| /external/libcxx/src/ |
| D | debug.cpp | 181 return i->__c_ != nullptr ? i->__c_->__c_ : nullptr; in __find_c_from_i()
196 while (c->__c_ != __c) in __insert_ic()
204 i->__c_ = c; in __insert_ic()
225 size_t h = hash<void*>()(q->__c_) % nc; in __insert_c()
243 r->__c_ = __c; in __insert_c()
273 __c_node* c = p->__c_; in __erase_i()
294 while (p->__c_ != __c) in __invalidate_all()
303 (*p->end_)->__c_ = nullptr; in __invalidate_all()
330 while (p->__c_ != __c) in __find_c_and_lock()
350 while (p->__c_ != __c) in __find_c()
[all …]
|
| D | algorithm.cpp | 53 unsigned __rs_default::__c_ = 0; member in __rs_default
60 __c_ = 1; in __rs_default()
65 ++__c_; in __rs_default()
71 if (--__c_ == 0) in ~__rs_default()
74 --__c_; in ~__rs_default()
|
| D | locale.cpp | 5117 __c_ = __analyze('c', ct); in init()
5193 __c_ = __analyze('c', ct); in init()
|
| /external/llvm-project/libcxx/src/ |
| D | debug.cpp | 144 return i->__c_ != nullptr ? i->__c_->__c_ : nullptr; in __find_c_from_i()
159 while (c->__c_ != __c) in __insert_ic()
167 i->__c_ = c; in __insert_ic()
188 size_t h = hash<void*>()(q->__c_) % nc; in __insert_c()
233 __c_node* c = p->__c_; in __erase_i()
254 while (p->__c_ != __c) in __invalidate_all()
263 (*p->end_)->__c_ = nullptr; in __invalidate_all()
290 while (p->__c_ != __c) in __find_c_and_lock()
310 while (p->__c_ != __c) in __find_c()
340 while (p->__c_ != __c) in __erase_c()
[all …]
|
| D | random_shuffle.cpp | 23 unsigned __rs_default::__c_ = 0; member in __rs_default
30 __c_ = 1; in __rs_default()
35 ++__c_; in __rs_default()
41 if (--__c_ == 0) in ~__rs_default()
44 --__c_; in ~__rs_default()
|
| D | locale.cpp | 5294 __c_ = __analyze('c', ct); in init()
5370 __c_ = __analyze('c', ct); in init()
|
| /external/libcxx/include/ |
| D | __debug | 123 __c_node* __c_;
136 : __i_(__i), __next_(__next), __c_(__c) {}
142 void* __c_;
159 : __c_(__c), __next_(__next), beg_(nullptr), end_(nullptr), cap_(nullptr) {}
190 _Cont* _Cp = static_cast<_Cont*>(__c_);
200 _Cont* _Cp = static_cast<_Cont*>(__c_);
210 _Cont* _Cp = static_cast<_Cont*>(__c_);
220 _Cont* _Cp = static_cast<_Cont*>(__c_);
259 ::new(__n) _C_node<_Cont>(__n->__c_, __n->__next_);
|
| D | list | 814 (*__p)->__c_ = __cn1;
827 (*__p)->__c_ = __cn2;
1752 (*__p)->__c_ = nullptr;
1781 (*__p)->__c_ = nullptr;
1817 (*__ip)->__c_ = nullptr;
1863 (*__p)->__c_ = nullptr;
2027 (*__ip)->__c_ = __cn1;
2070 (*__ip)->__c_ = __cn1;
2127 (*__ip)->__c_ = __cn1;
2256 (*__p)->__c_ = __cn1;
|
| D | random | 2541 result_type __c_;
2652 __c_ = __x_[__r-1] == 0;
2669 __c_ = __x_[__r-1] == 0;
2684 __c_ = __x_[__r-1] == 0;
2700 __c_ = __x_[__r-1] == 0;
2710 result_type __new_c = __c_ == 0 ? __xs < __xr : __xs != 0 ? __xs <= __xr : 1;
2711 __xr = (__xs - __xr - __c_) & _Max;
2712 __c_ = __new_c;
2723 if (__x.__c_ != __y.__c_)
2785 __os << __sp << __x.__c_;
[all …]
|
| D | regex | 2104 _CharT __c_;
2113 : base(__s), __c_(__c) {}
2122 if (__s.__current_ != __s.__last_ && *__s.__current_ == __c_)
2144 _CharT __c_;
2153 : base(__s), __traits_(__traits), __c_(__traits.translate_nocase(__c)) {}
2163 __traits_.translate_nocase(*__s.__current_) == __c_)
2185 _CharT __c_;
2194 : base(__s), __traits_(__traits), __c_(__traits.translate(__c)) {}
2204 __traits_.translate(*__s.__current_) == __c_)
|
| D | __hash_table | 1593 (*__p)->__c_ = nullptr;
2701 (*__dp)->__c_ = nullptr;
|
| D | locale | 2395 string_type __c_;
2463 virtual const string_type& __c() const {return this->__c_;}
|
| D | vector | 2164 (*__p)->__c_ = nullptr;
|
| D | string | 1717 (*__p)->__c_ = nullptr;
|
| D | algorithm | 2959 static unsigned __c_;
|
| /external/llvm-project/libcxx/include/ |
| D | __debug | 89 __c_node* __c_;
102 : __i_(__i), __next_(__next), __c_(__c) {}
108 void* __c_;
125 : __c_(__c), __next_(__next), beg_(nullptr), end_(nullptr), cap_(nullptr) {}
156 _Cont* _Cp = static_cast<_Cont*>(__c_);
166 _Cont* _Cp = static_cast<_Cont*>(__c_);
176 _Cont* _Cp = static_cast<_Cont*>(__c_);
186 _Cont* _Cp = static_cast<_Cont*>(__c_);
|
| D | list | 816 (*__p)->__c_ = __cn1;
829 (*__p)->__c_ = __cn2;
1759 (*__p)->__c_ = nullptr;
1788 (*__p)->__c_ = nullptr;
1824 (*__ip)->__c_ = nullptr;
1870 (*__p)->__c_ = nullptr;
2035 (*__ip)->__c_ = __cn1;
2080 (*__ip)->__c_ = __cn1;
2139 (*__ip)->__c_ = __cn1;
2272 (*__p)->__c_ = __cn1;
|
| D | random | 2560 result_type __c_;
2671 __c_ = __x_[__r-1] == 0;
2688 __c_ = __x_[__r-1] == 0;
2703 __c_ = __x_[__r-1] == 0;
2719 __c_ = __x_[__r-1] == 0;
2729 result_type __new_c = __c_ == 0 ? __xs < __xr : __xs != 0 ? __xs <= __xr : 1;
2730 __xr = (__xs - __xr - __c_) & _Max;
2731 __c_ = __new_c;
2742 if (__x.__c_ != __y.__c_)
2805 __os << __sp << __x.__c_;
[all …]
|
| D | regex | 2143 _CharT __c_;
2152 : base(__s), __c_(__c) {}
2161 if (__s.__current_ != __s.__last_ && *__s.__current_ == __c_)
2183 _CharT __c_;
2192 : base(__s), __traits_(__traits), __c_(__traits.translate_nocase(__c)) {}
2202 __traits_.translate_nocase(*__s.__current_) == __c_)
2224 _CharT __c_;
2233 : base(__s), __traits_(__traits), __c_(__traits.translate(__c)) {}
2243 __traits_.translate(*__s.__current_) == __c_)
|
| D | __hash_table | 1572 (*__p)->__c_ = nullptr;
2600 (*__dp)->__c_ = nullptr;
|
| D | locale | 2384 string_type __c_;
2452 virtual const string_type& __c() const {return this->__c_;}
|
| D | vector | 2140 (*__p)->__c_ = nullptr;
|
| D | string | 1757 (*__p)->__c_ = nullptr;
|
| D | algorithm | 3096 static unsigned __c_;
|