Searched refs:best_node (Results 1 - 5 of 5) sorted by relevance

/external/chromium_org/ui/gfx/geometry/
H A Dr_tree_base.cc472 NodeBase* best_node = children_.front(); local
480 best_node = children_[i];
487 best_node = NULL;
493 return static_cast<Node*>(best_node);
502 NodeBase* best_node = children_.front(); local
504 expanded_rects[0].size().GetArea() - best_node->rect().size().GetArea();
511 best_node = candidate_node;
515 best_node->rect().size().GetArea()) {
517 best_node = candidate_node;
523 return static_cast<Node*>(best_node);
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dregister_allocate.c534 unsigned int best_node = -1; local
549 best_node = n;
553 return best_node;
/external/mesa3d/src/mesa/program/
H A Dregister_allocate.c534 unsigned int best_node = -1; local
549 best_node = n;
553 return best_node;
/external/chromium_org/third_party/libwebp/enc/
H A Dquant.c693 int best_node = best_path[1]; local
695 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal
698 const Node* const node = &NODE(n, best_node);
703 best_node = node->prev;
/external/webp/src/enc/
H A Dquant.c693 int best_node = best_path[1]; local
695 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal
698 const Node* const node = &NODE(n, best_node);
703 best_node = node->prev;

Completed in 110 milliseconds