HomeSort by: relevance | last modified time | path
    Searched refs:__root (Results 1 - 9 of 9) sorted by relevancy

  /src/sys/external/bsd/drm2/include/linux/
interval_tree_generic.h 82 PREFIX##_init(struct rb_root_cached *__root) \
84 rb_tree_init(&__root->rb_root.rbr_tree, &PREFIX##__rbtree_ops); \
88 PREFIX##_insert(T *__node, struct rb_root_cached *__root) \
92 __collision = rb_tree_insert_node(&__root->rb_root.rbr_tree, __node); \
97 PREFIX##_remove(T *__node, struct rb_root_cached *__root) \
99 rb_tree_remove_node(&__root->rb_root.rbr_tree, __node); \
103 PREFIX##_iter_first(struct rb_root_cached *__root, KT __start, KT __last) \
107 __node = rb_tree_find_node_geq(&__root->rb_root.rbr_tree, &__start); \
118 PREFIX##_iter_next(struct rb_root_cached *__root, T *__node, \
124 __next = rb_tree_iterate(&__root->rb_root.rbr_tree, __node,
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/
tree.cc 134 _Rb_tree_node_base*& __root)
143 if (__x == __root)
144 __root = __y;
159 _Rb_tree_node_base*& __root)
160 { local_Rb_tree_rotate_left (__x, __root); }
165 _Rb_tree_node_base*& __root)
174 if (__x == __root)
175 __root = __y;
190 _Rb_tree_node_base*& __root)
191 { local_Rb_tree_rotate_right (__x, __root); }
200 _Rb_tree_node_base *& __root = __header._M_parent; local
289 _Rb_tree_node_base *& __root = __header._M_parent; local
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/
tree.cc 134 _Rb_tree_node_base*& __root)
143 if (__x == __root)
144 __root = __y;
159 _Rb_tree_node_base*& __root)
160 { local_Rb_tree_rotate_left (__x, __root); }
165 _Rb_tree_node_base*& __root)
174 if (__x == __root)
175 __root = __y;
190 _Rb_tree_node_base*& __root)
191 { local_Rb_tree_rotate_right (__x, __root); }
200 _Rb_tree_node_base *& __root = __header._M_parent; local
289 _Rb_tree_node_base *& __root = __header._M_parent; local
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/
losertree.h 184 __init_winner(unsigned int __root)
186 if (__root >= _M_k)
187 return __root;
190 unsigned int __left = __init_winner(2 * __root);
191 unsigned int __right = __init_winner(2 * __root + 1);
198 _M_losers[__root] = _M_losers[__right];
204 _M_losers[__root] = _M_losers[__left];
277 * Computes the winner of the competition at position "__root".
281 * @param __root __index of the "game" to start.
284 __init_winner(unsigned int __root)
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/
losertree.h 184 __init_winner(unsigned int __root)
186 if (__root >= _M_k)
187 return __root;
190 unsigned int __left = __init_winner(2 * __root);
191 unsigned int __right = __init_winner(2 * __root + 1);
198 _M_losers[__root] = _M_losers[__right];
204 _M_losers[__root] = _M_losers[__left];
277 * Computes the winner of the competition at position "__root".
281 * @param __root __index of the "game" to start.
284 __init_winner(unsigned int __root)
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/
parallel_backend_tbb.h 478 spawn_root_and_wait(__root_task<_Fn>& __root)
480 tbb::task::spawn_root_and_wait(*__root._M_task);
610 spawn_root_and_wait(__root_task<_Fn>& __root)
612 tbb::detail::d1::execute_and_wait(*__root._M_func_task, __root._M_context, __root._M_wait_object,
613 __root._M_context);
836 _RandomAccessIterator2 __z_beg, bool __x_orig, bool __y_orig, bool __root)
838 _M_comp(__comp), _M_leaf_merge(__leaf_merge), _M_nsort(__nsort), _root(__root),
1115 bool __root, _Compare __comp, _LeafSort __leaf_sort, _SizeType __nsort
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/
parallel_backend_tbb.h 468 spawn_root_and_wait(__root_task<_Fn>& __root)
470 tbb::task::spawn_root_and_wait(*__root._M_task);
600 spawn_root_and_wait(__root_task<_Fn>& __root)
602 tbb::detail::d1::execute_and_wait(*__root._M_func_task, __root._M_context, __root._M_wait_object,
603 __root._M_context);
826 _RandomAccessIterator2 __z_beg, bool __x_orig, bool __y_orig, bool __root)
828 _M_comp(__comp), _M_leaf_merge(__leaf_merge), _M_nsort(__nsort), _root(__root),
1105 bool __root, _Compare __comp, _LeafSort __leaf_sort, _SizeType __nsort
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
stl_tree.h 887 _Link_type __root =
889 _M_leftmost() = _S_minimum(__root);
890 _M_rightmost() = _S_maximum(__root);
892 return __root;
2562 const _Rb_tree_node_base* __root) throw ();
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
stl_tree.h 891 _Link_type __root =
893 _M_leftmost() = _S_minimum(__root);
894 _M_rightmost() = _S_maximum(__root);
896 return __root;
2565 const _Rb_tree_node_base* __root) throw ();

Completed in 70 milliseconds