| /external/chromium_org/v8/test/cctest/ |
| test-strings.cc | 28 // Check that we can traverse very deep stacks of ConsStrings using
538 static void Traverse(Handle<String> s1, Handle<String> s2) {
570 TEST(Traverse) {
582 Traverse(flat, symmetric);
584 Traverse(flat, left_asymmetric);
586 Traverse(flat, right_asymmetric);
599 Traverse(flat, left_asymmetric);
603 Traverse(flat, right_asymmetric);
607 Traverse(flat, symmetric);
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfoImpl.h | 411 // this loop, which we must traverse.
439 void traverse(BlockT *EntryBlock);
456 void PopulateLoopsDFS<BlockT, LoopT>::traverse(BlockT *EntryBlock) { function in class:llvm::PopulateLoopsDFS
460 // Traverse the leftmost path as far as possible.
552 DFS.traverse(DomRoot->getBlock());
|
| /external/llvm/lib/CodeGen/ |
| Analysis.cpp | 41 // Given a struct type, recursively traverse the elements.
53 // Given an array type, recursively traverse the elements.
78 // Given a struct type, recursively traverse the elements.
89 // Given an array type, recursively traverse the elements.
420 /// Assuming Next is an aggregate of some kind, this function will traverse the
|
| /external/chromium/third_party/libevent/compat/sys/ |
| queue.h | 56 * traverse the list. New elements can be added to the list before
70 * traverse the list. New elements can be added to the list before or
77 * traverse the list. New elements can be added to the list before or after
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| SelectorQuery.cpp | 239 // we would need to sort the results. For now, just traverse the document in that case.
266 // to find traverse root.
369 // we would need to sort the results. For now, just traverse the document in that case.
|
| /external/chromium_org/third_party/angle_dx11/src/compiler/ |
| ValidateLimitations.cpp | 128 node->getRight()->traverse(&validate);
178 body->traverse(this);
483 node->traverse(&validate);
|
| /external/chromium_org/third_party/libevent/compat/sys/ |
| queue.h | 56 * traverse the list. New elements can be added to the list before
70 * traverse the list. New elements can be added to the list before or
77 * traverse the list. New elements can be added to the list before or after
|
| /external/qemu/ |
| qemu-queue.h | 50 * traverse the list. New elements can be added to the list before
64 * traverse the list. New elements can be added to the list before or
71 * traverse the list. New elements can be added to the list before or after
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| opt_tree_grafting.cpp | 149 /* Do not traverse into the body of the loop since that is a
250 /* Do not traverse into the body of the if-statement since that is a
|
| /external/emma/core/java12/com/vladium/util/ |
| IntSet.java | 88 // traverse the singly-linked list of entries in the bucket:
144 // traverse the singly-linked list of entries in the bucket:
|
| /external/mesa3d/src/glsl/ |
| opt_tree_grafting.cpp | 149 /* Do not traverse into the body of the loop since that is a
250 /* Do not traverse into the body of the if-statement since that is a
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| DependencyGraph.java | 163 // Traverse the graph of constraints and determine all nodes affected by
214 // Traverse the graph of constraints and determine all nodes affected by
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 133 ANTLR3_UINT32 bucket; // Used to traverse the buckets
197 ANTLR3_UINT32 bucket; /* Used to traverse the buckets */
289 /* Now, we traverse the entries in the bucket until
346 /* Now, we traverse the entries in the bucket until
538 /* Knowing the bucket, we can traverse the entries until we
609 /* Knowign the bucket, we can traverse the entries until we
667 /** \brief Creates an enumeration structure to traverse the hash table.
[all...] |
| /art/runtime/ |
| intern_table_test.cc | 102 // We should traverse only the weaks...
|
| /development/samples/ApiDemos/src/com/example/android/apis/accessibility/ |
| TaskBackService.java | 75 // AccessibilityEvent. The following code will use it to traverse the
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| AVTPartXPath.java | 60 * Tell if this expression or it's subexpressions can traverse outside
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| FilterExprIterator.java | 186 * This will traverse the heararchy, calling the visitor for
|
| OneStepIteratorForward.java | 63 * Create a OneStepIterator object that will just traverse the self axes.
|
| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| Function2Args.java | 119 * Tell if this expression or it's subexpressions can traverse outside
|
| Function3Args.java | 117 * Tell if this expression or it's subexpressions can traverse outside
|
| FunctionDef1Arg.java | 158 * Tell if this expression or it's subexpressions can traverse outside
|
| FunctionMultiArgs.java | 138 * Tell if this expression or it's subexpressions can traverse outside
|
| FunctionOneArg.java | 98 * Tell if this expression or it's subexpressions can traverse outside
|
| /external/apache-xml/src/main/java/org/apache/xpath/operations/ |
| Operation.java | 62 * Tell if this expression or it's subexpressions can traverse outside
|
| /external/apache-xml/src/main/java/org/apache/xpath/patterns/ |
| UnionPattern.java | 55 * Tell if this expression or it's subexpressions can traverse outside
|
