__node (reference) in projects: external

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched refs:__node (Results 1 – 25 of 25) sorted by relevance

/external/mesa3d/src/util/
D	rb_tree.h	245 for (type iter, __node = (type )rb_tree_first(T); \ 246 __node != NULL && \ 247 (iter = rb_node_data(type, (struct rb_node )__node, field), true); \ 248 __node = (type )rb_node_next((struct rb_node )__node)) 263 __node = (type )rb_tree_first(T), \ 264 __next = (type )rb_node_next_or_null((struct rb_node )__node); \ 265 __node != NULL && \ 266 (iter = rb_node_data(type, (struct rb_node )__node, field), true); \ 267 __node = __next, \ 268 __next = (type )rb_node_next_or_null((struct rb_node )__node)) [all …]
/external/mesa3d/src/compiler/glsl/
D	list.h	682 #define exec_node_typed_forward(__node, __type) \ argument 683 (!exec_node_is_tail_sentinel(__node) ? (__type) (__node) : NULL) 685 #define exec_node_typed_backward(__node, __type) \ argument 686 (!exec_node_is_head_sentinel(__node) ? (__type) (__node) : NULL) 702 #define foreach_in_list_safe(__type, __node, __list) … argument 703 …for (__type __node = exec_node_typed_forward((__list)->head_sentinel.next, __type ), … 704 …__next = (__node) ? exec_node_typed_forward((__list)->head_sentinel.next->next, __type ) : NULL;… 705 …(__node) != NULL; … 706 (__node) = __next, __next = __next ? exec_node_typed_forward(__next->next, __type *) : NULL) 708 #define foreach_in_list_reverse_safe(__type, __node, __list) … argument [all …]
/external/libabigail/src/
D	abg-viz-dot.cc	`83 dot::add_node(const node_base& __node) in add_node() argument 85 _M_sstream << "Node" << __node._M_count << " "; in add_node() 93 string_replace(strip, label, __node._M_id); in add_node() 94 string_replace(strip, height, std::to_string(__node._M_y_space)); in add_node() 95 string_replace(strip, width, std::to_string(__node._M_x_space)); in add_node()`
/external/libevent/WIN32-Code/
D	tree.h	`205 struct type __node, __left, __right, __tmp; \ 208 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\ 209 __left = __right = &__node; \ 234 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \ 242 struct type __node, __left, __right, __tmp; \ 244 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\ 245 __left = __right = &__node; \ 270 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \`
/external/libcxx/include/
D	forward_list	213 typename pointer_traits<_NodePtr>::element_type>::type __node; 214 typedef typename __forward_list_node_value_type<__node>::type __node_value_type; 369 typedef typename __traits::__node __node; 454 typedef __forward_list_node<value_type, void_pointer> __node; 456 …typedef typename __rebind_alloc_helper<allocator_traits<allocator_type>, __node>::type __node_allo… 630 typedef typename base::__node __node; 896 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1)); 918 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1)); 1125 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1)); 1141 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1)); [all …]
D	__hash_table	`370 __hash_iterator(__next_pointer __node, const void* __c) _NOEXCEPT 371 : __node_(__node) 377 __hash_iterator(__next_pointer __node) _NOEXCEPT 378 : __node_(__node) 486 __hash_const_iterator(__next_pointer __node, const void* __c) _NOEXCEPT 487 : __node_(__node) 493 __hash_const_iterator(__next_pointer __node) _NOEXCEPT 494 : __node_(__node) 599 __hash_local_iterator(__next_pointer __node, size_t __bucket, 601 : __node_(__node), [all …]`
D	regex	`1308 template <class _CharT> class __node; 1339 const __node<_CharT>* __node_; 1349 // __node 1352 class __node 1354 __node(const __node&); 1355 __node& operator=(const __node&); 1360 __node() {} 1362 virtual ~__node() {} 1374 : public __node<_CharT> 1396 : public __node<_CharT> [all …]`
D	map	`952 typedef __map_node_handle<typename __base::__node, allocator_type> node_type; 1451 typedef typename __base::__node __node; 1458 typedef unique_ptr<__node, _Dp> __node_holder; 1688 typedef __map_node_handle<typename __base::__node, allocator_type> node_type; 2082 typedef typename __base::__node __node; 2087 typedef unique_ptr<__node, _Dp> __node_holder;`
D	unordered_map	`875 typedef typename __table::__node __node; 877 typedef unique_ptr<__node, _Dp> __node_holder; 894 typedef __map_node_handle<__node, allocator_type> node_type; 1703 typedef typename __table::__node __node; 1705 typedef unique_ptr<__node, _Dp> __node_holder; 1722 typedef __map_node_handle<__node, allocator_type> node_type;`
D	list	`551 typedef __list_node<value_type, __void_pointer> __node; 552 typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator; 838 typedef typename base::__node __node; 1104 typedef unique_ptr<__node, __node_destructor> __hold_pointer;`
D	set	`476 typedef __set_node_handle<typename __base::__node, allocator_type> node_type; 964 typedef __set_node_handle<typename __base::__node, allocator_type> node_type;`
D	unordered_set	`413 typedef __set_node_handle<typename __table::__node, allocator_type> node_type; 1013 typedef __set_node_handle<typename __table::__node, allocator_type> node_type;`
D	__tree	`998 typedef typename _NodeTypes::__node_type __node; 1010 typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator; 1441 typedef unique_ptr<__node, _Dp> __node_holder;`
/external/cronet/buildtools/third_party/libc++/trunk/include/
D	forward_list	258 typename pointer_traits<_NodePtr>::element_type> __node; 259 typedef typename __forward_list_node_value_type<__node>::type __node_value_type; 402 typedef typename __traits::__node __node; 487 typedef __forward_list_node<value_type, void_pointer> __node; 489 typedef __rebind_alloc<allocator_traits<allocator_type>, __node> __node_allocator; 657 typedef typename base::__node __node; 936 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1)); 958 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1)); 1149 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1)); 1165 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1)); [all …]
D	regex	`1399 template <class _CharT> class __node; 1430 const __node<_CharT>* __node_; 1440 // __node 1443 class __node 1445 __node(const __node&); 1446 __node& operator=(const __node&); 1451 __node() {} 1453 virtual ~__node() {} 1465 : public __node<_CharT> 1487 : public __node<_CharT> [all …]`
D	__hash_table	379 explicit __hash_iterator(__next_pointer __node, const void* __c) _NOEXCEPT 380 : __node_(__node) 493 explicit __hash_const_iterator(__next_pointer __node, const void* __c) _NOEXCEPT 494 : __node_(__node) 602 explicit __hash_local_iterator(__next_pointer __node, size_t __bucket, 604 : __node_(__node), 632 typedef typename __pointer_traits::element_type __node; 633 typedef __remove_const_t<__node> __non_const_node; 908 // Create __node 910 typedef typename _NodeTypes::__node_type __node; [all …]
D	map	`1035 typedef __map_node_handle<typename __base::__node, allocator_type> node_type; 1549 typedef typename __base::__node __node; 1556 typedef unique_ptr<__node, _Dp> __node_holder; 1835 typedef __map_node_handle<typename __base::__node, allocator_type> node_type; 2244 typedef typename __base::__node __node; 2249 typedef unique_ptr<__node, _Dp> __node_holder;`
D	unordered_map	`1056 typedef typename __table::__node __node; 1058 typedef unique_ptr<__node, _Dp> __node_holder; 1079 typedef __map_node_handle<__node, allocator_type> node_type; 1947 typedef typename __table::__node __node; 1949 typedef unique_ptr<__node, _Dp> __node_holder; 1971 typedef __map_node_handle<__node, allocator_type> node_type;`
D	list	`563 typedef __list_node<value_type, __void_pointer> __node; 564 typedef __rebind_alloc<__alloc_traits, __node> __node_allocator; 825 typedef typename base::__node __node; 1104 typedef unique_ptr<__node, __node_destructor> __hold_pointer;`
D	set	`551 typedef __set_node_handle<typename __base::__node, allocator_type> node_type; 1088 typedef __set_node_handle<typename __base::__node, allocator_type> node_type;`
D	__tree	`1025 typedef typename _NodeTypes::__node_type __node; 1037 typedef __rebind_alloc<__alloc_traits, __node> __node_allocator; 1433 typedef unique_ptr<__node, _Dp> __node_holder;`
D	unordered_set	`539 typedef __set_node_handle<typename __table::__node, allocator_type> node_type; 1195 typedef __set_node_handle<typename __table::__node, allocator_type> node_type;`
/external/libcxx/include/ext/
D	hash_map	`494 typedef typename __table::__node __node; 496 typedef unique_ptr<__node, _Dp> __node_holder; 766 typedef typename __table::__node __node; 768 typedef unique_ptr<__node, _Dp> __node_holder;`
/external/cronet/buildtools/third_party/libc++/trunk/include/ext/
D	hash_map	`496 typedef typename __table::__node __node; 498 typedef std::unique_ptr<__node, _Dp> __node_holder; 767 typedef typename __table::__node __node; 769 typedef std::unique_ptr<__node, _Dp> __node_holder;`
/external/libabigail/tests/data/test-read-dwarf/
D	test-libandroid.so.abi	6112 …<typedef-decl name='__set_node_handle<typename __table::__node, std::__1::unordered_set<unsi… 6113 …c_string<char>, std::__1::basic_string<char> > > >::__node, std::__1::unorder… 6114 …, android::util::unique_cptr<android::ResolvedBag> > > >::__node, std::__1::unorder… 6115 …signed int, std::__1::allocator<unsigned int> > > > >::__node, std::__1::unorder… 27092 …<typedef-decl name='__set_node_handle<typename __table::__node, std::__1::unordered_set<andr… 27093 …<typedef-decl name='__set_node_handle<typename __table::__node, std::__1::unordered_set<long… 27094 …__1::pair<ASurfaceControl *const, ASurfaceControlStats> > >::__node, std::__1::unorder… 27095 …istener>, android::SurfaceComposerClient::CallbackInfo> > >::__node, std::__1::unorder… 27096 …sp<android::SurfaceControl>, android::ComposerState> > >::__node, std::__1::unorder… 27097 …gned char, std::__1::allocator<unsigned char> > > > >::__node, std::__1::unorder…

art
bionic
bootable
build
cts
dalvik
developers
development
device
external
frameworks
hardware
kernel
libcore
libnativehelper
packages
pdk
platform_testing
sdk
system
test
toolchain
tools