Searched refs:__key (Results 1 - 12 of 12) sorted by relevance

/external/kernel-headers/original/linux/
H A Dmutex-debug.h16 static struct lock_class_key __key; \
18 __mutex_init((mutex), #mutex, &__key); \
H A Dmutex.h81 static struct lock_class_key __key; \
83 __mutex_init((mutex), #mutex, &__key); \
H A Dspinlock.h96 static struct lock_class_key __key; \
98 __spin_lock_init((lock), #lock, &__key); \
111 static struct lock_class_key __key; \
113 __rwlock_init((lock), #lock, &__key); \
/external/stlport/stlport/stl/
H A D_unordered_map.h148 iterator find(const _KT& __key) { return _M_ht.find(__key); } argument
150 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
153 _Tp& operator[](const _KT& __key) { argument
154 iterator __it = _M_ht.find(__key);
156 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second :
161 size_type count(const _KT& __key) const { return _M_ht.count(__key); }
164 pair<iterator, iterator> equal_range(const _KT& __key) argument
170 erase(const key_type& __key) argument
316 find(const _KT& __key) argument
324 equal_range(const _KT& __key) argument
330 erase(const key_type& __key) argument
[all...]
H A D_hashtable.h498 _ElemsIte _M_find(const _KT& __key) const {
499 size_type __n = _M_bkt_num_key(__key);
502 for ( ; (__first != __last) && !_M_equals(_M_get_key(*__first), __key); ++__first);
511 iterator find(const _KT& __key) { return _M_find(__key); } argument
513 const_iterator find(const _KT& __key) const { return _M_find(__key); }
516 size_type count(const _KT& __key) const {
517 const size_type __n = _M_bkt_num_key(__key);
522 if (_M_equals(_M_get_key(*__cur), __key)) {
534 equal_range(const _KT& __key) argument
609 _M_bkt_num_key(const _KT& __key, size_type __n) const argument
[all...]
H A D_unordered_set.h142 iterator find(const _KT& __key) { return _M_ht.find(__key); } argument
144 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
147 size_type count(const _KT& __key) const { return _M_ht.count(__key); }
150 pair<iterator, iterator> equal_range(const _KT& __key) argument
151 { return _M_ht.equal_range(__key); }
153 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const
154 { return _M_ht.equal_range(__key); }
156 erase(const key_type& __key) argument
292 find(const _KT& __key) argument
300 equal_range(const _KT& __key) argument
306 erase(const key_type& __key) argument
[all...]
H A D_hash_map.h195 iterator find(const _KT& __key) { return _M_ht.find(__key); } argument
197 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
200 _Tp& operator[](const _KT& __key) { argument
201 iterator __it = _M_ht.find(__key);
203 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second :
208 size_type count(const _KT& __key) const { return _M_ht.count(__key); }
211 pair<iterator, iterator> equal_range(const _KT& __key) argument
218 erase(const _KT& __key) argument
388 find(const _KT& __key) argument
397 equal_range(const _KT& __key) argument
403 erase(const _KT& __key) argument
[all...]
H A D_hash_set.h197 iterator find(const _KT& __key) { return _M_ht.find(__key); } argument
199 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
202 size_type count(const _KT& __key) const { return _M_ht.count(__key); }
205 pair<iterator, iterator> equal_range(const _KT& __key) argument
206 { return _M_ht.equal_range(__key); }
208 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const
209 { return _M_ht.equal_range(__key); }
212 erase(const _KT& __key) argument
378 find(const _KT& __key) argument
387 equal_range(const _KT& __key) argument
394 erase(const _KT& __key) argument
[all...]
H A D_hashtable.c263 ::erase(const key_type& __key) { argument
264 const size_type __n = _M_bkt_num_key(__key);
272 if (_M_equals(_M_get_key(*__cur), __key)) {
279 } while ((__cur != __last) && _M_equals(_M_get_key(*__cur), __key));
285 if (_M_equals(_M_get_key(*__cur), __key)) {
289 } while ((__cur != __last) && _M_equals(_M_get_key(*__cur), __key));
/external/stlport/stlport/stl/debug/
H A D_hashtable.h261 iterator find(const _KT& __key) argument
262 { return iterator(&_M_iter_list, _M_non_dbg_impl.find(__key)); }
264 const_iterator find(const _KT& __key) const
265 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.find(__key)); }
268 size_type count(const _KT& __key) const { return _M_non_dbg_impl.count(__key); }
271 pair<iterator, iterator> equal_range(const _KT& __key) { argument
272 pair<_Base_iterator, _Base_iterator> __res = _M_non_dbg_impl.equal_range(__key);
278 pair<const_iterator, const_iterator> equal_range(const _KT& __key) const {
279 pair <_Base_const_iterator, _Base_const_iterator> __res = _M_non_dbg_impl.equal_range(__key);
284 erase(const key_type& __key) argument
[all...]
/external/libxml2/
H A Dthreads.c58 extern void *pthread_getspecific (pthread_key_t __key)
60 extern int pthread_setspecific (pthread_key_t __key,
63 extern int pthread_key_create (pthread_key_t *__key,
66 extern int pthread_key_delete (pthread_key_t __key)
/external/openssl/crypto/aes/asm/
H A Daes-586.pl212 $__key=&DWP(20,"esp"); # pointer to key schedule
295 &mov ($key,$__key); # reincarnate v1 as key
349 &mov ($key,$__key); # reincarnate v0 as key
439 if ($i==3) { &$Fn ($key,$__key); }##%edx
501 &mov ($__key,$key); # save key
533 &mov ($key,$__key);
542 &mov ($__key,$key);
772 if ($i==3) { &mov ($key,$__key); }##%edx
805 if ($i==3) { &mov ($key,$__key); }##%edx
847 &mov ($__key,
[all...]

Completed in 551 milliseconds