| /external/e2fsprogs/lib/ext2fs/ |
| rbtree.c | 317 * before removing the node, find the deepest node on the rebalance path
322 struct rb_node *deepest; local
325 deepest = ext2fs_rb_parent(node);
327 deepest = node->rb_left;
329 deepest = node->rb_right;
331 deepest = ext2fs_rb_next(node);
332 if (deepest->rb_right)
333 deepest = deepest->rb_right;
334 else if (ext2fs_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/linux-tools-perf/src/tools/perf/util/ |
| dwarf-aux.h | 86 /* Search the deepest inlined function including given address */
|
| /external/lldb/source/Target/ |
| SectionLoadList.cpp | 220 // deepest child section.
236 // deepest child section.
|
| StackFrameList.cpp | 140 // If we got here because of a crash, then set the inlined depth to the deepest most block.
155 // In all these cases we want to stop in the deepest most frame.
[all...] |
| /external/chromium-trace/trace-viewer/tracing/tracing/ui/tracks/ |
| slice_group_track.html | 92 // We do the same deepest-to-shallowest walk of the subrows trying to fit
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDFS.h | 180 /// of the deepest connection to another subtree.
|
| /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/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/lldb/examples/lookup/ |
| main.cpp | 38 // compile unit, function, deepest block, line table entry and the
|
| /external/lldb/include/lldb/API/ |
| SBFrame.h | 69 /// Gets the deepest block that contains the frame PC.
|
| /external/llvm/include/llvm/MC/ |
| SectionKind.h | 21 /// a section. A section is classified into the deepest possible
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/ |
| dir_util.py | 56 # now 'head' contains the deepest directory that already exists
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/ |
| dir_util.py | 56 # now 'head' contains the deepest directory that already exists
|
| /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/icu/icu4c/source/samples/ufortune/resources/ |
| root.txt | 72 "A \"No\" uttered from deepest conviction is better and greater than a
|
| /external/mesa3d/src/glsl/ |
| opt_tree_grafting.cpp | 34 * the deepest expression trees they can to try to optimize them.
|
| /external/lldb/include/lldb/Symbol/ |
| SymbolContext.h | 75 /// A Block pointer to the deepest block for this context.
196 /// the deepest most block. This allows us to extract information
198 /// the deepest lexical block.
|
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 806 /// each block to the deepest loop it's in, but we need the inverse. For each
[all...] |
| /external/lldb/scripts/Python/interface/ |
| SBFrame.i | 97 /// Gets the deepest block that contains the frame PC.
|
| /dalvik/dx/src/com/android/dx/merge/ |
| DexMerger.java | 558 * through all N types, where 'D' is the depth of the deepest type. For
559 * example, the deepest class in libcore is Xalan's KeyIterator, which
[all...] |
