Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:__code (Results 1 - 9 of 9) sorted by null

/external/libnetfilter_conntrack/src/conntrack/
bsf.c	110 struct sock_filter __code = { local 114 memcpy(&this[pos], &__code, sizeof(__code)); 115 return NEW_POS(__code); 121 struct sock_filter __code[] = { local 133 memcpy(&this[pos], __code, sizeof(__code)); 134 return NEW_POS(__code); 141 struct sock_filter __code[] = { local 153 memcpy(&this[pos], __code, sizeof(__code)) 167 struct sock_filter __code = { local 186 struct sock_filter __code = { local 203 struct sock_filter __code = { local 214 struct sock_filter __code = { local 226 struct sock_filter __code = { local 236 struct sock_filter __code = { local 246 struct sock_filter __code = { local 260 struct sock_filter __code = { local 272 struct sock_filter __code = { local 283 struct sock_filter __code = { local 295 struct sock_filter __code[] = { local 686 struct sock_filter __code = { local     [all...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/
hashtable_policy.h	523 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k); local 524 std::size_t __n = __h->_M_bucket_index(__k, __code, 528 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 531 __n, __code)->second;
hashtable.h	696 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 697 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count); 698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); 713 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 714 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count); 715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); 730 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 731 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count); 734 if (this->_M_compare(__k, __code, __p)) 755 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k) local 793 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 892 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 919 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 1036 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local     [all...]
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/
hashtable_policy.h	523 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k); local 524 std::size_t __n = __h->_M_bucket_index(__k, __code, 528 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 531 __n, __code)->second;
hashtable.h	696 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 697 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count); 698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); 713 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 714 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count); 715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code); 730 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 731 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count); 734 if (this->_M_compare(__k, __code, __p)) 755 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k) local 793 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 892 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 919 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local 1036 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); local     [all...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
hashtable.h	623 // Insert node with hash code __code, in bucket bkt if no rehash (assumes 627 _M_insert_unique_node(size_type __bkt, __hash_code __code, 630 // Insert node with hash code __code. Take ownership of the node, 633 _M_insert_multi_node(__hash_code __code, __node_type* __n); 1023 __hash_code __code = this->_M_hash_code(__k); local 1040 __hash_code __code = this->_M_hash_code(__k); local 1057 __hash_code __code = this->_M_hash_code(__k); local 1095 __hash_code __code = this->_M_hash_code(__k); local 1128 __hash_code __code = this->_M_hash_code(__k); local 1262 __hash_code __code; local 1301 __hash_code __code; local 1418 __hash_code __code = this->_M_hash_code(__k); local 1444 __hash_code __code = this->_M_hash_code(this->_M_extract()(__v)); local 1513 __hash_code __code = this->_M_hash_code(__k); local 1538 __hash_code __code = this->_M_hash_code(__k); local     [all...]
hashtable_policy.h	487 __hash_code __code = __h->_M_hash_code(__k); local 488 std::size_t __n = __h->_M_bucket_index(__k, __code); 489 __node_type* __p = __h->_M_find_node(__n, __k, __code); 496 return __h->_M_insert_unique_node(__n, __code, __p)->second; 513 __hash_code __code = __h->_M_hash_code(__k); local 514 std::size_t __n = __h->_M_bucket_index(__k, __code); 515 __node_type* __p = __h->_M_find_node(__n, __k, __code); 522 return __h->_M_insert_unique_node(__n, __code, __p)->second; 539 __hash_code __code = __h->_M_hash_code(__k); local 540 std::size_t __n = __h->_M_bucket_index(__k, __code); 559 __hash_code __code = __h->_M_hash_code(__k); local     [all...]
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
hashtable.h	623 // Insert node with hash code __code, in bucket bkt if no rehash (assumes 627 _M_insert_unique_node(size_type __bkt, __hash_code __code, 630 // Insert node with hash code __code. Take ownership of the node, 633 _M_insert_multi_node(__hash_code __code, __node_type* __n); 1023 __hash_code __code = this->_M_hash_code(__k); local 1040 __hash_code __code = this->_M_hash_code(__k); local 1057 __hash_code __code = this->_M_hash_code(__k); local 1095 __hash_code __code = this->_M_hash_code(__k); local 1128 __hash_code __code = this->_M_hash_code(__k); local 1262 __hash_code __code; local 1301 __hash_code __code; local 1418 __hash_code __code = this->_M_hash_code(__k); local 1444 __hash_code __code = this->_M_hash_code(this->_M_extract()(__v)); local 1513 __hash_code __code = this->_M_hash_code(__k); local 1538 __hash_code __code = this->_M_hash_code(__k); local     [all...]
hashtable_policy.h	487 __hash_code __code = __h->_M_hash_code(__k); local 488 std::size_t __n = __h->_M_bucket_index(__k, __code); 489 __node_type* __p = __h->_M_find_node(__n, __k, __code); 496 return __h->_M_insert_unique_node(__n, __code, __p)->second; 513 __hash_code __code = __h->_M_hash_code(__k); local 514 std::size_t __n = __h->_M_bucket_index(__k, __code); 515 __node_type* __p = __h->_M_find_node(__n, __k, __code); 522 return __h->_M_insert_unique_node(__n, __code, __p)->second; 539 __hash_code __code = __h->_M_hash_code(__k); local 540 std::size_t __n = __h->_M_bucket_index(__k, __code); 559 __hash_code __code = __h->_M_hash_code(__k); local     [all...]

Completed in 151 milliseconds