_ptr is not initialized

Author: vinay-deshmukh

libcxx/include/__tree

@@ -208,9 +208,6 @@ inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 _EndNodePtr __tree_ne
   _LIBCPP_ASSERT_INTERNAL(__x != nullptr, "node shouldn't be null");
   if (__x->__right_ != nullptr)
     return std::__static_fancy_pointer_cast<_EndNodePtr>(std::__tree_min(__x->__right_));
-  auto __dddd = __x->__parent_;
-  auto ___xxx = __dddd->__left_;
-  (void)___xxx;
   while (!std::__tree_is_left_child(__x))
     __x = __x->__parent_unsafe();
   return static_cast<_EndNodePtr>(__x->__parent_);
@@ -565,7 +562,7 @@ public:
   typedef _Pointer pointer;
   pointer __left_;
 
-  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __tree_end_node() _NOEXCEPT : __left_() {}
+  _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 __tree_end_node() _NOEXCEPT : __left_(nullptr) {}
 };
 
 template <class _VoidPtr>
@@ -1016,12 +1013,10 @@ public:
 
   template <class... _Args>
   _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 pair<iterator, bool> __emplace_hint_unique(const_iterator __p, _Args&&... __args) {
-    (void)__p.__ptr_->__left_;
     return std::__try_key_extraction<key_type>(
         [this, __p](const key_type& __key, _Args&&... __args2) {
           __end_node_pointer __parent;
           __node_base_pointer __dummy;
-    (void)__p.__ptr_->__left_;
           __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __key);
           __node_pointer __r           = std::__static_fancy_pointer_cast<__node_pointer>(__child);
           bool __inserted              = false;
@@ -1456,20 +1451,20 @@ private:
 template <class _Tp, class _Compare, class _Allocator>
 _LIBCPP_CONSTEXPR_SINCE_CXX26 __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp) _NOEXCEPT_(
     is_nothrow_default_constructible<__node_allocator>::value&& is_nothrow_copy_constructible<value_compare>::value)
-    : __size_(0), __value_comp_(__comp) {
+    : __end_node_(), __size_(0), __value_comp_(__comp) {
   __begin_node_ = __end_node();
 }
 
 template <class _Tp, class _Compare, class _Allocator>
 _LIBCPP_CONSTEXPR_SINCE_CXX26 __tree<_Tp, _Compare, _Allocator>::__tree(const allocator_type& __a)
-    : __begin_node_(), __node_alloc_(__node_allocator(__a)), __size_(0) {
+    : __begin_node_(), __end_node_(), __node_alloc_(__node_allocator(__a)), __size_(0)  {
   __begin_node_ = __end_node();
 }
 
 template <class _Tp, class _Compare, class _Allocator>
 _LIBCPP_CONSTEXPR_SINCE_CXX26
 __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp, const allocator_type& __a)
-    : __begin_node_(), __node_alloc_(__node_allocator(__a)), __size_(0), __value_comp_(__comp) {
+    : __begin_node_(), __end_node_(), __node_alloc_(__node_allocator(__a)), __size_(0), __value_comp_(__comp)  {
   __begin_node_ = __end_node();
 }
 
@@ -1875,9 +1870,6 @@ __tree<_Tp, _Compare, _Allocator>::__find_equal(
     const_iterator __prior = __hint;
     if (__prior == begin() || value_comp()(*--__prior, __v)) {
       // *prev(__hint) < __v < *__hint
-      auto __xx = __hint.__ptr_;
-      auto __yy = __xx->__left_;
-      (void)( __yy);
       if (__hint.__ptr_->__left_ == nullptr) {
         __parent = __hint.__ptr_;
         return __parent->__left_;