HomeSort by relevance Sort by last modified time
    Searched refs:deepest (Results 1 - 6 of 6) sorted by null

  /external/linux-tools-perf/util/added/
rbtree.c 320 * before removing the node, find the deepest node on the rebalance path
325 struct rb_node *deepest; local
328 deepest = rb_parent(node);
330 deepest = node->rb_left;
332 deepest = node->rb_right;
334 deepest = rb_next(node);
335 if (deepest->rb_right)
336 deepest = deepest->rb_right;
337 else if (rb_parent(deepest) != node
    [all...]
  /external/chromium_org/tools/telemetry/telemetry/core/timeline/
thread.py 165 We do the same deepest-to-shallowest walk of the subrows trying to fit
  /external/chromium_org/ui/views/controls/menu/
menu_controller.cc 121 View* deepest = GetFirstFocusableView(view->child_at(i), -1, forward); local
122 if (deepest)
123 return deepest;
127 View* deepest = GetFirstFocusableView(view->child_at(i), -1, forward); local
128 if (deepest)
129 return deepest;
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/drivers/x11/
fakeglx.c 649 /* start with deepest */
680 /* start with deepest */
697 * Find the deepest X over/underlay visual of at least min_depth.
717 int deepest; local
736 /* Search for the deepest overlay which satisifies all criteria. */
737 deepest = min_depth;
780 if (deepvis==NULL || vislist->depth > deepest) {
785 deepest = vislist->depth;
    [all...]
  /external/mesa3d/src/mesa/drivers/x11/
fakeglx.c 649 /* start with deepest */
680 /* start with deepest */
697 * Find the deepest X over/underlay visual of at least min_depth.
717 int deepest; local
736 /* Search for the deepest overlay which satisifies all criteria. */
737 deepest = min_depth;
780 if (deepvis==NULL || vislist->depth > deepest) {
785 deepest = vislist->depth;
    [all...]
  /external/chromium_org/chrome/browser/resources/file_manager/js/
file_copy_manager.js 509 // deepest entry first. Since move of each entry is done by a single
    [all...]

Completed in 680 milliseconds