Home
last modified time | relevance | path

Searched refs:__c_ (Results 1 – 13 of 13) sorted by relevance

/ndk/sources/cxx-stl/llvm-libc++/libcxx/src/
Ddebug.cpp118 return i->__c_ != nullptr ? i->__c_->__c_ : nullptr; in __find_c_from_i()
133 while (c->__c_ != __c) in __insert_ic()
141 i->__c_ = c; in __insert_ic()
165 size_t h = hash<void*>()(q->__c_) % nc; in __insert_c()
186 r->__c_ = __c; in __insert_c()
216 __c_node* c = p->__c_; in __erase_i()
237 while (p->__c_ != __c) in __invalidate_all()
246 (*p->end_)->__c_ = nullptr; in __invalidate_all()
273 while (p->__c_ != __c) in __find_c_and_lock()
293 while (p->__c_ != __c) in __find_c()
[all …]
Dalgorithm.cpp54 unsigned __rs_default::__c_ = 0; member in __rs_default
61 __c_ = 1; in __rs_default()
66 ++__c_; in __rs_default()
72 if (--__c_ == 0) in ~__rs_default()
75 --__c_; in ~__rs_default()
Dlocale.cpp5149 __c_ = __analyze('c', ct); in init()
5249 __c_ = __analyze('c', ct); in init()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
D__debug39 __c_node* __c_;
52 : __i_(__i), __next_(__next), __c_(__c) {}
58 void* __c_;
75 : __c_(__c), __next_(__next), beg_(nullptr), end_(nullptr), cap_(nullptr) {}
106 _Cont* _Cp = static_cast<_Cont*>(__c_);
116 _Cont* _Cp = static_cast<_Cont*>(__c_);
126 _Cont* _Cp = static_cast<_Cont*>(__c_);
136 _Cont* _Cp = static_cast<_Cont*>(__c_);
175 ::new(__n) _C_node<_Cont>(__n->__c_, __n->__next_);
Dlist731 (*__p)->__c_ = nullptr;
789 (*__p)->__c_ = __cn1;
803 (*__p)->__c_ = __cn2;
1652 (*__p)->__c_ = nullptr;
1680 (*__p)->__c_ = nullptr;
1715 (*__p)->__c_ = nullptr;
1757 (*__p)->__c_ = nullptr;
1926 (*__p)->__c_ = __cn1;
1969 (*__p)->__c_ = __cn1;
2026 (*__p)->__c_ = __cn1;
[all …]
Drandom2538 result_type __c_;
2649 __c_ = __x_[__r-1] == 0;
2666 __c_ = __x_[__r-1] == 0;
2681 __c_ = __x_[__r-1] == 0;
2697 __c_ = __x_[__r-1] == 0;
2707 result_type __new_c = __c_ == 0 ? __xs < __xr : __xs != 0 ? __xs <= __xr : 1;
2708 __xr = (__xs - __xr - __c_) & _Max;
2709 __c_ = __new_c;
2720 if (__x.__c_ != __y.__c_)
2782 __os << __sp << __x.__c_;
[all …]
Dregex2063 _CharT __c_;
2072 : base(__s), __c_(__c) {}
2081 if (__s.__current_ != __s.__last_ && *__s.__current_ == __c_)
2103 _CharT __c_;
2112 : base(__s), __traits_(__traits), __c_(__traits.translate_nocase(__c)) {}
2122 __traits_.translate_nocase(*__s.__current_) == __c_)
2144 _CharT __c_;
2153 : base(__s), __traits_(__traits), __c_(__traits.translate(__c)) {}
2163 __traits_.translate(*__s.__current_) == __c_)
D__hash_table1340 (*__p)->__c_ = nullptr;
2255 (*__p)->__c_ = nullptr;
Dlocale2521 string_type __c_;
2572 virtual const string_type& __c() const {return this->__c_;}
Dvector815 (*__p)->__c_ = nullptr;
Dstring1964 (*__p)->__c_ = nullptr;
Dalgorithm3044 static unsigned __c_;
/ndk/sources/cxx-stl/llvm-libc++/patches.android/
D0013-temp-collective-ndk-hackathon-fixes.patch294 unsigned __rs_default::__c_ = 0;
301 __c_ = 1;
309 if (--__c_ == 0)
312 + --__c_;
388 return i->__c_ != nullptr ? i->__c_->__c_ : nullptr;
452 while (p->__c_ != __c)
490 __c_node* c0 = i0 != nullptr ? i0->__c_ : nullptr;
499 return i != nullptr && i->__c_ != nullptr && i->__c_->__dereferenceable(__i);
509 return i != nullptr && i->__c_ != nullptr && i->__c_->__decrementable(__i);
519 return i != nullptr && i->__c_ != nullptr && i->__c_->__addable(__i, __n);
[all …]