| /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/chromium_org/chrome/common/extensions/docs/server2/ |
| compiled_file_system_test.py | 30 'deepest.html': 'deepest.html contents',
97 'apps/deepdir/deeper/deepest',
108 'deepdir/deeper/deepest',
116 self.assertEqual(['deeper/deepest', 'deepfile'],
119 self.assertEqual(['deepest'],
|
| sidenav_data_source.py | 31 If more than one item exactly matches the path, the deepest one is considered
|
| /external/chromium_org/chrome/browser/ui/panels/ |
| native_panel.h | 122 // Verifies, on a deepest possible level, if the Panel is showing the "Draw
125 // Verifies, on a deepest possible level, if the native panel is really
128 // Verifies, on a deepest possible level, if the native panel is really
131 // Verifies, on a deepest possible level, if the native panel is really
|
| /external/chromium_org/ui/views/widget/ |
| drop_helper.h | 76 // set to the deepest descendant of the RootView that contains the point
99 // The deepest view under the current drop coordinate.
|
| /external/clang/test/CXX/dcl.dcl/basic.namespace/namespace.udir/ |
| p1.cpp | 15 // Test that names appear as if in deepest common ancestor.
|
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/walkers/ |
| abstract_selection_walker.js | 74 // Find the deepest visible node; written specifically here because we want
75 // to move across siblings if necessary and take the deepest node which can
93 // node has no visible children; it's therefore the deepest visible node.
|
| /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/chromium_org/chrome/browser/ui/views/ |
| javascript_app_modal_event_blocker_x11.cc | 16 // Returns the toplevel window for the deepest transient ancestor of |window|.
|
| /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/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| dwarf-aux.h | 86 /* Search the deepest inlined function including given address */
|
| /external/srec/portable/include/ |
| PStackTrace.h | 93 * Removes the deepest level of the stack-trace.
|
| /external/chromium_org/native_client_sdk/src/tools/ |
| decode_dump.py | 157 A list of dicts with filename, lineno, function (deepest first).
169 trace: A list of [filename, lineno, function] (deepest first).
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| FastTextAutosizer.h | 163 // The deepest block containing all text is computed lazily (see:
268 // A cluster's width provider is typically the deepest block containing all text.
|
| /external/chromium_org/third_party/libaddressinput/chromium/cpp/src/ |
| ruleset.h | 105 // Returns the deepest possible ruleset level for this country. Must be called
157 // The deepest possible ruleset level for this country. Set in
|
| /external/lldb/source/Target/ |
| SectionLoadList.cpp | 220 // deepest child section.
236 // deepest child section.
|
| /external/chromium_org/third_party/angle/src/compiler/translator/ |
| Types.h | 444 // If this type is a struct, returns the deepest struct nesting of
455 // deepest field (nesting2.field1.position).
|
| /external/chromium-trace/trace-viewer/src/tracing/tracks/ |
| slice_group_track.js | 148 // We do the same deepest-to-shallowest walk of the subrows trying to fit
|
| /external/chromium_org/chrome/browser/chromeos/drive/file_system/ |
| create_directory_operation.cc | 71 // Get the existing deepest entry.
|
| /external/chromium_org/content/browser/frame_host/ |
| frame_tree_browsertest.cc | 82 // Verify the deepest node exists and has the right name.
|
| /external/chromium_org/tools/binary_size/template/ |
| test-data-generator.html | 83 * the deepest level of nesting that was found during conversion: for the
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDFS.h | 180 /// of the deepest connection to another subtree.
|
| /external/qemu/distrib/sdl-1.2.15/src/video/x11/ |
| SDL_x11video.h | 103 /* available visuals of interest to us, sorted deepest first */
|
| /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
|
