| /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/chrome/common/extensions/docs/server2/ |
| compiled_file_system_test.py | 30 'deepest.html': 'deepest.html contents',
97 'apps/deepdir/deeper/deepest',
110 'deepdir/deeper/deepest',
122 self.assertEqual(['deeper/deepest', 'deepfile'],
125 self.assertEqual(['deeper/deepest', 'deepfile'],
128 self.assertEqual(['deepest'],
131 self.assertEqual(['deepest'],
|
| /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.
|
| /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/chromium_org/chrome/browser/chromeos/drive/file_system/ |
| create_directory_operation.h | 61 // Returns the file path to the existing deepest directory, which appears
|
| /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/angle/src/compiler/ |
| Types.h | 214 // If this type is a struct, returns the deepest struct nesting of
225 // 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/llvm/include/llvm/CodeGen/ |
| ScheduleDFS.h | 182 /// 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
|
| ElemContext.java | 133 * a documents deepest element depth is N then there will be (N+1)
|
| /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/chrome/browser/accessibility/ |
| browser_accessibility.h | 97 // Returns the deepest descendant that contains the specified point.
|
| /external/chromium_org/tools/telemetry/telemetry/core/timeline/ |
| thread.py | 200 We do the same deepest-to-shallowest walk of the subrows trying to fit
|
| /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...] |
