Home
last modified time | relevance | path

Searched defs:__p (Results 1 – 25 of 272) sorted by relevance

1234567891011

/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/include/tr1/
A Dhashtable.h467 _Node* __p = __array[__i]; in _GLIBCXX_VISIBILITY() local
493 _Node** __p = __alloc.allocate(__n + 1); in _GLIBCXX_VISIBILITY() local
698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
733 for (_Node* __p = _M_buckets[__n]; __p; __p = __p->_M_next) in _GLIBCXX_VISIBILITY() local
758 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
796 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
895 if (_Node* __p = _M_find_node(_M_buckets[__n], __k, __code)) in _GLIBCXX_VISIBILITY() local
1052 _Node* __p = *__slot; in _GLIBCXX_VISIBILITY() local
1067 _Node* __p = *__saved_slot; in _GLIBCXX_VISIBILITY() local
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/include/tr1/
A Dhashtable.h467 _Node* __p = __array[__i]; in _GLIBCXX_VISIBILITY() local
493 _Node** __p = __alloc.allocate(__n + 1); in _GLIBCXX_VISIBILITY() local
698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
733 for (_Node* __p = _M_buckets[__n]; __p; __p = __p->_M_next) in _GLIBCXX_VISIBILITY() local
758 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
796 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
895 if (_Node* __p = _M_find_node(_M_buckets[__n], __k, __code)) in _GLIBCXX_VISIBILITY() local
1052 _Node* __p = *__slot; in _GLIBCXX_VISIBILITY() local
1067 _Node* __p = *__saved_slot; in _GLIBCXX_VISIBILITY() local
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/include/tr1/
A Dhashtable.h467 _Node* __p = __array[__i]; in _GLIBCXX_VISIBILITY() local
493 _Node** __p = __alloc.allocate(__n + 1); in _GLIBCXX_VISIBILITY() local
698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
733 for (_Node* __p = _M_buckets[__n]; __p; __p = __p->_M_next) in _GLIBCXX_VISIBILITY() local
758 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
796 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
895 if (_Node* __p = _M_find_node(_M_buckets[__n], __k, __code)) in _GLIBCXX_VISIBILITY() local
1052 _Node* __p = *__slot; in _GLIBCXX_VISIBILITY() local
1067 _Node* __p = *__saved_slot; in _GLIBCXX_VISIBILITY() local
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/include/tr1/
A Dhashtable.h467 _Node* __p = __array[__i]; in _GLIBCXX_VISIBILITY() local
493 _Node** __p = __alloc.allocate(__n + 1); in _GLIBCXX_VISIBILITY() local
698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
733 for (_Node* __p = _M_buckets[__n]; __p; __p = __p->_M_next) in _GLIBCXX_VISIBILITY() local
758 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
796 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
895 if (_Node* __p = _M_find_node(_M_buckets[__n], __k, __code)) in _GLIBCXX_VISIBILITY() local
1052 _Node* __p = *__slot; in _GLIBCXX_VISIBILITY() local
1067 _Node* __p = *__saved_slot; in _GLIBCXX_VISIBILITY() local
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/tr1/
A Dhashtable.h477 _Node* __p = __array[__i]; in _GLIBCXX_VISIBILITY() local
503 _Node** __p = __alloc.allocate(__n + 1); in _GLIBCXX_VISIBILITY() local
708 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
725 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
743 for (_Node* __p = _M_buckets[__n]; __p; __p = __p->_M_next) in _GLIBCXX_VISIBILITY() local
768 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
806 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
905 if (_Node* __p = _M_find_node(_M_buckets[__n], __k, __code)) in _GLIBCXX_VISIBILITY() local
1062 _Node* __p = *__slot; in _GLIBCXX_VISIBILITY() local
1077 _Node* __p = *__saved_slot; in _GLIBCXX_VISIBILITY() local
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/include/tr1/
A Dhashtable.h467 _Node* __p = __array[__i]; in _GLIBCXX_VISIBILITY() local
493 _Node** __p = __alloc.allocate(__n + 1); in _GLIBCXX_VISIBILITY() local
698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
733 for (_Node* __p = _M_buckets[__n]; __p; __p = __p->_M_next) in _GLIBCXX_VISIBILITY() local
758 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
796 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
895 if (_Node* __p = _M_find_node(_M_buckets[__n], __k, __code)) in _GLIBCXX_VISIBILITY() local
1052 _Node* __p = *__slot; in _GLIBCXX_VISIBILITY() local
1067 _Node* __p = *__saved_slot; in _GLIBCXX_VISIBILITY() local
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/tr1/
A Dhashtable.h477 _Node* __p = __array[__i]; in _GLIBCXX_VISIBILITY() local
503 _Node** __p = __alloc.allocate(__n + 1); in _GLIBCXX_VISIBILITY() local
708 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
725 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
743 for (_Node* __p = _M_buckets[__n]; __p; __p = __p->_M_next) in _GLIBCXX_VISIBILITY() local
768 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
806 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
905 if (_Node* __p = _M_find_node(_M_buckets[__n], __k, __code)) in _GLIBCXX_VISIBILITY() local
1062 _Node* __p = *__slot; in _GLIBCXX_VISIBILITY() local
1077 _Node* __p = *__saved_slot; in _GLIBCXX_VISIBILITY() local
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/include/tr1/
A Dhashtable.h467 _Node* __p = __array[__i]; in _GLIBCXX_VISIBILITY() local
493 _Node** __p = __alloc.allocate(__n + 1); in _GLIBCXX_VISIBILITY() local
698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); in _GLIBCXX_VISIBILITY() local
733 for (_Node* __p = _M_buckets[__n]; __p; __p = __p->_M_next) in _GLIBCXX_VISIBILITY() local
758 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
796 _Node* __p = _M_find_node(*__head, __k, __code); in _GLIBCXX_VISIBILITY() local
895 if (_Node* __p = _M_find_node(_M_buckets[__n], __k, __code)) in _GLIBCXX_VISIBILITY() local
1052 _Node* __p = *__slot; in _GLIBCXX_VISIBILITY() local
1067 _Node* __p = *__saved_slot; in _GLIBCXX_VISIBILITY() local
[all …]
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/include/bits/
A Dvalarray_array.tcc44 _Tp* __p = __a._M_data; in __valarray_fill() local
68 _Tp* __p (__a._M_data); in __valarray_copy() local
95 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy() local
117 _Tp* __p (__a._M_data); in __valarray_copy() local
144 _Tp* __p (__a._M_data); in __valarray_copy() local
156 _Tp* __p (__a._M_data); in __valarray_copy() local
199 _Tp* __p (__a._M_data); in __valarray_copy() local
217 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
228 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
A Dhashtable.h1298 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1314 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1330 __node_type* __p = _M_bucket_begin(__n); in _GLIBCXX_VISIBILITY() local
1362 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1389 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1421 for (__node_type* __p = static_cast<__node_type*>(__prev_p->_M_nxt);; in _GLIBCXX_VISIBILITY() local
1531 if (__node_type* __p = _M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY() local
1833 __node_type* __p = __n->_M_next(); in _GLIBCXX_VISIBILITY() local
1966 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
2008 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-9/include/bits/
A Dvalarray_array.tcc44 _Tp* __p = __a._M_data; in __valarray_fill() local
68 _Tp* __p (__a._M_data); in __valarray_copy() local
95 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy() local
117 _Tp* __p (__a._M_data); in __valarray_copy() local
144 _Tp* __p (__a._M_data); in __valarray_copy() local
156 _Tp* __p (__a._M_data); in __valarray_copy() local
199 _Tp* __p (__a._M_data); in __valarray_copy() local
217 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
228 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
A Dhashtable.h1454 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1470 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1486 __node_type* __p = _M_bucket_begin(__n); in _GLIBCXX_VISIBILITY() local
1518 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1545 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1577 for (__node_type* __p = static_cast<__node_type*>(__prev_p->_M_nxt);; in _GLIBCXX_VISIBILITY() local
1687 if (__node_type* __p = _M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY() local
1991 __node_type* __p = __n->_M_next(); in _GLIBCXX_VISIBILITY() local
2124 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
2166 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-7/include/bits/
A Dvalarray_array.tcc44 _Tp* __p = __a._M_data; in __valarray_fill() local
68 _Tp* __p (__a._M_data); in __valarray_copy() local
95 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy() local
117 _Tp* __p (__a._M_data); in __valarray_copy() local
144 _Tp* __p (__a._M_data); in __valarray_copy() local
156 _Tp* __p (__a._M_data); in __valarray_copy() local
199 _Tp* __p (__a._M_data); in __valarray_copy() local
217 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
228 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
A Dhashtable.h1425 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1441 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1457 __node_type* __p = _M_bucket_begin(__n); in _GLIBCXX_VISIBILITY() local
1489 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1516 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1548 for (__node_type* __p = static_cast<__node_type*>(__prev_p->_M_nxt);; in _GLIBCXX_VISIBILITY() local
1658 if (__node_type* __p = _M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY() local
1960 __node_type* __p = __n->_M_next(); in _GLIBCXX_VISIBILITY() local
2093 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
2135 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-8/include/bits/
A Dvalarray_array.tcc44 _Tp* __p = __a._M_data; in __valarray_fill() local
68 _Tp* __p (__a._M_data); in __valarray_copy() local
95 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy() local
117 _Tp* __p (__a._M_data); in __valarray_copy() local
144 _Tp* __p (__a._M_data); in __valarray_copy() local
156 _Tp* __p (__a._M_data); in __valarray_copy() local
199 _Tp* __p (__a._M_data); in __valarray_copy() local
217 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
228 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
A Dhashtable.h1436 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1452 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1468 __node_type* __p = _M_bucket_begin(__n); in _GLIBCXX_VISIBILITY() local
1500 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1527 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1559 for (__node_type* __p = static_cast<__node_type*>(__prev_p->_M_nxt);; in _GLIBCXX_VISIBILITY() local
1669 if (__node_type* __p = _M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY() local
1973 __node_type* __p = __n->_M_next(); in _GLIBCXX_VISIBILITY() local
2106 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
2148 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-6/include/bits/
A Dvalarray_array.tcc44 _Tp* __p = __a._M_data; in __valarray_fill() local
68 _Tp* __p (__a._M_data); in __valarray_copy() local
95 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy() local
117 _Tp* __p (__a._M_data); in __valarray_copy() local
144 _Tp* __p (__a._M_data); in __valarray_copy() local
156 _Tp* __p (__a._M_data); in __valarray_copy() local
199 _Tp* __p (__a._M_data); in __valarray_copy() local
217 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
228 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
A Dhashtable.h1285 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1301 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1317 __node_type* __p = _M_bucket_begin(__n); in _GLIBCXX_VISIBILITY() local
1349 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1376 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1408 for (__node_type* __p = static_cast<__node_type*>(__prev_p->_M_nxt);; in _GLIBCXX_VISIBILITY() local
1518 if (__node_type* __p = _M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY() local
1820 __node_type* __p = __n->_M_next(); in _GLIBCXX_VISIBILITY() local
1953 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
1995 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-10/include/bits/
A Dvalarray_array.tcc44 _Tp* __p = __a._M_data; in __valarray_fill() local
68 _Tp* __p (__a._M_data); in __valarray_copy() local
95 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy() local
117 _Tp* __p (__a._M_data); in __valarray_copy() local
144 _Tp* __p (__a._M_data); in __valarray_copy() local
156 _Tp* __p (__a._M_data); in __valarray_copy() local
199 _Tp* __p (__a._M_data); in __valarray_copy() local
217 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
228 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/include/bits/
A Dvalarray_array.tcc44 _Tp* __p = __a._M_data; in __valarray_fill() local
68 _Tp* __p (__a._M_data); in __valarray_copy() local
95 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy() local
117 _Tp* __p (__a._M_data); in __valarray_copy() local
144 _Tp* __p (__a._M_data); in __valarray_copy() local
156 _Tp* __p (__a._M_data); in __valarray_copy() local
199 _Tp* __p (__a._M_data); in __valarray_copy() local
217 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
228 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
A Dhashtable.h1304 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1321 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1338 __node_type* __p = _M_bucket_begin(__n); in _GLIBCXX_VISIBILITY() local
1376 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1409 __node_type* __p = _M_find_node(__n, __k, __code); in _GLIBCXX_VISIBILITY() local
1442 for (__node_type* __p = static_cast<__node_type*>(__prev_p->_M_nxt);; in _GLIBCXX_VISIBILITY() local
1555 if (__node_type* __p = _M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY() local
1868 __node_type* __p = __n->_M_next(); in _GLIBCXX_VISIBILITY() local
2002 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
2044 __node_type* __p = _M_begin(); in _GLIBCXX_VISIBILITY() local
A Dstl_set.h501 std::pair<typename _Rep_type::iterator, bool> __p = in _GLIBCXX_VISIBILITY() local
510 std::pair<typename _Rep_type::iterator, bool> __p = in _GLIBCXX_VISIBILITY() local
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-11/include/bits/
A Dvalarray_array.tcc44 _Tp* __p = __a._M_data; in __valarray_fill() local
68 _Tp* __p (__a._M_data); in __valarray_copy() local
95 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy() local
117 _Tp* __p (__a._M_data); in __valarray_copy() local
144 _Tp* __p (__a._M_data); in __valarray_copy() local
156 _Tp* __p (__a._M_data); in __valarray_copy() local
199 _Tp* __p (__a._M_data); in __valarray_copy() local
217 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
228 _Tp* __p (__a._M_data); in __valarray_copy_construct() local
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-5/config/cpu/ia64/
A Datomic_word.h40 unsigned char *__p = reinterpret_cast<unsigned char *>(__g); in _GLIBCXX_VISIBILITY() local
52 unsigned char *__p = reinterpret_cast<unsigned char *>(__g); in _GLIBCXX_VISIBILITY() local
/l4re-core-master/libstdc++-v3/contrib/libstdc++-v3-4.9/config/cpu/ia64/
A Datomic_word.h40 unsigned char *__p = reinterpret_cast<unsigned char *>(__g); in _GLIBCXX_VISIBILITY() local
52 unsigned char *__p = reinterpret_cast<unsigned char *>(__g); in _GLIBCXX_VISIBILITY() local

Completed in 89 milliseconds

1234567891011