Home
last modified time | relevance | path

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

12

/external/mesa3d/src/util/
Drb_tree.h245 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/
Dlist.h682 #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/
Dabg-viz-dot.cc83 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/
Dtree.h205 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/openssh/openbsd-compat/
Dsys-tree.h212 struct type __node, *__left, *__right, *__tmp; \
215 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
216 __left = __right = &__node; \
241 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
249 struct type __node, *__left, *__right, *__tmp; \
251 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
252 __left = __right = &__node; \
277 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/external/libcxx/include/
Dforward_list213 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_table370 __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 …]
Dregex1308 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 …]
Dmap952 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;
Dunordered_map875 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;
Dlist551 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;
Dset476 typedef __set_node_handle<typename __base::__node, allocator_type> node_type;
964 typedef __set_node_handle<typename __base::__node, allocator_type> node_type;
Dunordered_set413 typedef __set_node_handle<typename __table::__node, allocator_type> node_type;
1013 typedef __set_node_handle<typename __table::__node, allocator_type> node_type;
D__tree998 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/llvm-project/libcxx/include/
Dforward_list216 typename pointer_traits<_NodePtr>::element_type>::type __node;
217 typedef typename __forward_list_node_value_type<__node>::type __node_value_type;
372 typedef typename __traits::__node __node;
457 typedef __forward_list_node<value_type, void_pointer> __node;
459 …typedef typename __rebind_alloc_helper<allocator_traits<allocator_type>, __node>::type __node_allo…
633 typedef typename base::__node __node;
902 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
924 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
1131 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1147 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
[all …]
D__hash_table364 __hash_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
365 : __node_(__node)
371 __hash_iterator(__next_pointer __node) _NOEXCEPT
372 : __node_(__node)
484 __hash_const_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
485 : __node_(__node)
491 __hash_const_iterator(__next_pointer __node) _NOEXCEPT
492 : __node_(__node)
599 __hash_local_iterator(__next_pointer __node, size_t __bucket,
601 : __node_(__node),
[all …]
Dregex1324 template <class _CharT> class __node;
1355 const __node<_CharT>* __node_;
1365 // __node
1368 class __node
1370 __node(const __node&);
1371 __node& operator=(const __node&);
1376 __node() {}
1378 virtual ~__node() {}
1390 : public __node<_CharT>
1412 : public __node<_CharT>
[all …]
Dmap952 typedef __map_node_handle<typename __base::__node, allocator_type> node_type;
1462 typedef typename __base::__node __node;
1469 typedef unique_ptr<__node, _Dp> __node_holder;
1723 typedef __map_node_handle<typename __base::__node, allocator_type> node_type;
2128 typedef typename __base::__node __node;
2133 typedef unique_ptr<__node, _Dp> __node_holder;
Dunordered_map949 typedef typename __table::__node __node;
951 typedef unique_ptr<__node, _Dp> __node_holder;
968 typedef __map_node_handle<__node, allocator_type> node_type;
1884 typedef typename __table::__node __node;
1886 typedef unique_ptr<__node, _Dp> __node_holder;
1903 typedef __map_node_handle<__node, allocator_type> node_type;
Dlist553 typedef __list_node<value_type, __void_pointer> __node;
554 typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator;
840 typedef typename base::__node __node;
1111 typedef unique_ptr<__node, __node_destructor> __hold_pointer;
Dset478 typedef __set_node_handle<typename __base::__node, allocator_type> node_type;
1006 typedef __set_node_handle<typename __base::__node, allocator_type> node_type;
D__tree1001 typedef typename _NodeTypes::__node_type __node;
1013 typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator;
1420 typedef unique_ptr<__node, _Dp> __node_holder;
Dunordered_set439 typedef __set_node_handle<typename __table::__node, allocator_type> node_type;
1137 typedef __set_node_handle<typename __table::__node, allocator_type> node_type;
/external/llvm-project/libcxx/include/ext/
Dhash_map496 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/libcxx/include/ext/
Dhash_map494 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;

12