Home
last modified time | relevance | path

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

/external/mesa3d/src/compiler/glsl/
Dlist.h663 #define foreach_in_list_safe(__type, __node, __list) \ argument
664 for (__type *__node = (__type *)(__list)->head_sentinel.next, \
665 *__next = (__type *)__node->next; \
667 __node = __next, __next = (__type *)__next->next)
669 #define foreach_in_list_reverse_safe(__type, __node, __list) \ argument
670 for (__type *__node = (__type *)(__list)->tail_sentinel.prev, \
671 *__prev = (__type *)__node->prev; \
673 __node = __prev, __prev = (__type *)__prev->prev)
696 #define foreach_list_typed(__type, __node, __field, __list) \ argument
697 for (__type * __node = \
[all …]
/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/libcxx/include/
Dforward_list202 typename pointer_traits<_NodePtr>::element_type>::type __node;
203 typedef typename __forward_list_node_value_type<__node>::type __node_value_type;
358 typedef typename __traits::__node __node;
443 typedef __forward_list_node<value_type, void_pointer> __node;
445 …typedef typename __rebind_alloc_helper<allocator_traits<allocator_type>, __node>::type __node_allo…
613 typedef typename base::__node __node;
862 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
884 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
1094 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1110 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
[all …]
D__hash_table385 __hash_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
386 : __node_(__node)
392 __hash_iterator(__next_pointer __node) _NOEXCEPT
393 : __node_(__node)
501 __hash_const_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
502 : __node_(__node)
508 __hash_const_iterator(__next_pointer __node) _NOEXCEPT
509 : __node_(__node)
614 __hash_local_iterator(__next_pointer __node, size_t __bucket,
616 : __node_(__node),
[all …]
Dregex1298 template <class _CharT> class __node;
1329 const __node<_CharT>* __node_;
1339 // __node
1342 class __node
1344 __node(const __node&);
1345 __node& operator=(const __node&);
1350 __node() {}
1352 virtual ~__node() {}
1364 : public __node<_CharT>
1386 : public __node<_CharT>
[all …]
Dmap1286 typedef typename __base::__node __node;
1293 typedef unique_ptr<__node, _Dp> __node_holder;
1837 typedef typename __base::__node __node;
1842 typedef unique_ptr<__node, _Dp> __node_holder;
Dunordered_map776 typedef typename __table::__node __node;
778 typedef unique_ptr<__node, _Dp> __node_holder;
1524 typedef typename __table::__node __node;
1526 typedef unique_ptr<__node, _Dp> __node_holder;
Dlist539 typedef __list_node<value_type, __void_pointer> __node;
540 typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator;
809 typedef typename base::__node __node;
1075 typedef unique_ptr<__node, __node_destructor> __hold_pointer;
D__tree1011 typedef typename _NodeTypes::__node_type __node;
1023 typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator;
1416 typedef 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;