| /external/e2fsprogs/lib/ext2fs/tdb/ |
| build-tdb | 12 freelistcheck.c traverse.c dump.c tdb.c open.c"
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMTreeWalker.java | 99 * (postorder) are invoked for each node as we traverse over them,
103 * in other words, the root of the subtree to traverse over.
106 public void traverse(int pos) throws org.xml.sax.SAXException method in class:DTMTreeWalker
108 // %REVIEW% Why isn't this just traverse(pos,pos)?
131 // %REVIEW% This condition isn't tested in traverse(pos,top)
149 * (postorder) are invoked for each node as we traverse over them,
158 public void traverse(int pos, int top) throws org.xml.sax.SAXException method in class:DTMTreeWalker
|
| /external/chromium_org/third_party/angle_dx11/src/compiler/ |
| Compiler.cpp | 265 root->traverse(&detect);
290 root->traverse(&renamer);
295 root->traverse(&validate);
328 root->traverse(&traverser);
337 samplerSymbol->traverse(&graphTraverser);
364 root->traverse(&collect);
377 root->traverse(&map);
|
| OutputGLSLBase.cpp | 425 node->getCondition()->traverse(this);
427 node->getTrueBlock()->traverse(this);
429 node->getFalseBlock()->traverse(this);
435 node->getCondition()->traverse(this);
470 node->traverse(this);
509 // Traverse function parameters.
513 params->traverse(this);
515 // Traverse function body.
649 node->getInit()->traverse(this);
653 node->getCondition()->traverse(this)
[all...] |
| OutputHLSL.cpp | 116 mContext.treeRoot->traverse(this); // Output the body first to determine what has to go in the header
[all...] |
| /development/tools/idegen/src/ |
| Configuration.java | 72 traverse(new File("."), sourceRoots, jarFiles, excludedDirs, excludes); method
95 // TODO: Traverse all vendor-specific directories.
114 private static void traverse(File directory, Set<File> sourceRoots, method in class:Configuration
160 // Traverse nested directories.
167 traverse(file, sourceRoots, jarFiles, excludedDirs, method
|
| /external/clang/include/clang/Serialization/ |
| ModuleManager.h | 107 /// \brief Forward iterator to traverse all loaded modules. This is reverse
110 /// \brief Forward iterator end-point to traverse all loaded modules
113 /// \brief Const forward iterator to traverse all loaded modules. This is
116 /// \brief Const forward iterator end-point to traverse all loaded modules
119 /// \brief Reverse iterator to traverse all loaded modules. This is in
122 /// \brief Reverse iterator end-point to traverse all loaded modules.
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| TreeWalker2Result.java | 69 public void traverse(int pos) throws org.xml.sax.SAXException method in class:TreeWalker2Result
74 super.traverse(pos);
|
| /external/chromium_org/third_party/angle_dx11/src/compiler/timing/ |
| RestrictFragmentShaderTiming.cpp | 46 // Starting from each sampler, traverse the dependency graph and generate an error each time we
54 samplerSymbol->traverse(this);
|
| /external/chromium_org/v8/test/mjsunit/tools/ |
| profile_view.js | 73 view.traverse(fillFlatTree);
90 view.traverse(fillFlatTree);
|
| /external/v8/test/mjsunit/tools/ |
| profile_view.js | 73 view.traverse(fillFlatTree);
90 view.traverse(fillFlatTree);
|
| /bionic/libc/string/ |
| strlcpy.c | 42 /* Not enough room in dst, add NUL and traverse rest of src */
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| TokenTypes.cs | 40 /** <summary>imaginary tree navigation type; traverse "get child" link</summary> */
|
| /external/llvm/lib/Support/ |
| regstrlcpy.c | 43 /* Not enough room in dst, add NUL and traverse rest of src */
|
| /external/llvm/test/CodeGen/ARM/ |
| 2011-04-27-IfCvtBug.ll | 4 ; successors) and use inverse depth first search to traverse the BBs. However
|
| /external/mksh/src/ |
| strlcpy.c | 45 /* traverse rest of src */
|
| /external/openssh/openbsd-compat/ |
| strlcpy.c | 47 /* Not enough room in dst, add NUL and traverse rest of src */
|
| /frameworks/base/core/java/android/database/ |
| CrossProcessCursorWrapper.java | 30 * traverse the contents of the cursor similar to {@link AbstractCursor#fillWindow}.
|
| /external/chromium_org/tools/idl_parser/ |
| idl_node.py | 128 def Traverse(self, search, filter_nodes):
135 child.Traverse(search, filter_nodes)
163 self.Traverse(search, filter_nodes)
|
| /external/chromium_org/tools/telemetry_tools/ |
| telemetry_bootstrap.py | 69 def Traverse(self, src_path, dst_path):
88 self.Traverse(os.path.join(src_path, subdir),
157 dav_client.Traverse(parsed_url.path, full_dst_path)
|
| /external/chromium_org/v8/tools/ |
| profile_view.js | 52 callTree.traverse(function(node, viewParent) {
125 this.traverse(function (node) {
136 ProfileView.prototype.traverse = function(f) {
|
| /external/e2fsprogs/lib/blkid/ |
| blkidP.h | 32 * We can traverse all of the tags by bid_tags (linking to the tag bit_names).
86 * We can traverse all of the found devices via bic_list.
87 * We can traverse all of the tag types by bic_tags, which hold empty tags
|
| /external/v8/tools/ |
| profile_view.js | 52 callTree.traverse(function(node, viewParent) {
125 this.traverse(function (node) {
136 ProfileView.prototype.traverse = function(f) {
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentNavigableMap.java | 96 * and guarantees to traverse elements as they existed upon
117 * and guarantees to traverse elements as they existed upon
140 * and guarantees to traverse elements as they existed upon
|
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 90 // traverse the singly-linked list of entries in the bucket:
114 // traverse the singly-linked list of entries in the bucket:
133 // traverse the singly-linked list of entries in the bucket:
177 // traverse the singly-linked list of entries in the bucket:
220 // traverse the singly-linked list of entries in the bucket:
|
