| /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/clang/test/CXX/dcl.dcl/basic.namespace/namespace.udir/ |
| p1.cpp | 15 // Test that names appear as if in deepest common ancestor.
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| Machine.java | 59 * order, so the first prototype argument type is for the deepest
82 * deepest element of the stack), and store them in the arguments
95 * deepest element of the stack), and store them in the arguments
|
| Frame.java | 143 * list is ordered such that the deepest nesting (the actual subroutine
235 * is the deepest common nesting (effectively, the common prefix of the
337 * The new subroutines list should be the deepest of the two
|
| /external/guava/guava/src/com/google/common/collect/ |
| BstPath.java | 43 * Return the end of this {@code BstPath}, the deepest node in the path.
|
| /external/srec/portable/include/ |
| PStackTrace.h | 93 * Removes the deepest level of the stack-trace.
|
| /external/qemu/distrib/sdl-1.2.12/src/video/cybergfx/ |
| SDL_cgxvideo.h | 85 /* available visuals of interest to us, sorted deepest first */
|
| SDL_cgxmodes.c | 159 /* Search for the visuals in deepest-first order, so that the first
|
| /external/qemu/distrib/sdl-1.2.12/src/video/x11/ |
| SDL_x11video.h | 106 /* available visuals of interest to us, sorted deepest first */
|
| /frameworks/testing/uiautomator/utils/uiautomatorviewer/src/com/android/uiautomator/ |
| UiAutomatorModel.java | 165 * Do a search in tree to find a leaf node or deepest parent node containing the coordinate
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| NamespaceMappings.java | 85 * to deepest) and is used to delete NamespaceNodes
87 * to returning to the parent. The mappings of the deepest
|
| ElemContext.java | 133 * a documents deepest element depth is N then there will be (N+1)
|
| /external/chromium/chrome/browser/accessibility/ |
| browser_accessibility.h | 97 // Returns the deepest descendant that contains the specified point.
|
| browser_accessibility_cocoa.mm | 458 // Returns the deepest accessibility child that should not be ignored.
|
| /external/llvm/include/llvm/MC/ |
| SectionKind.h | 21 /// a section. A section is classified into the deepest possible
|
| /external/mesa3d/src/glsl/ |
| opt_tree_grafting.cpp | 34 * the deepest expression trees they can to try to optimize them.
|
| /external/javassist/src/main/javassist/bytecode/ |
| Bytecode.java | 404 * is the deepest so far.
419 * is the deepest so far.
435 * is the deepest so far.
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| profile.rb | 142 report << "| %-66s | %7i |\n" % [ "Deepest Level of Invocation", rule_invocation_depth ]
|
| /external/chromium/base/ |
| message_pump_mac.h | 175 // The deepest (numerically highest) recursion depth encountered since the
|
| message_pump_mac.mm | 358 // deepest_nesting_level_ is set as run loops are entered. If the deepest
484 // thread, deeper on the stack than the deepest Run call. Don't preempt
|
| /external/chromium/chrome/browser/history/ |
| query_parser.cc | 331 // The last element (back) of the stack contains the current, deepest node.
|
| /external/dbus/dbus/ |
| dbus-object-tree.c | 357 _dbus_verbose ("Looking for deepest handler\n");
791 /* Find the deepest path that covers the path in the message */
804 /* run deepest paths first */
924 /* Find the deepest path that covers the path in the message */
[all...] |
| /external/icu4c/samples/ufortune/resources/ |
| root.txt | 72 "A \"No\" uttered from deepest conviction is better and greater than a
|
| /external/webkit/Source/WebCore/accessibility/ |
| AccessibilityObject.h | 388 // Called on the root AX object to return the deepest available element.
|
| /external/webkit/Source/WebCore/editing/ |
| InsertParagraphSeparatorCommand.cpp | 303 // all of the correct nodes when building the ancestor list. So this needs to be the deepest representation of the position
|
