| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/ |
| search.h | 149 /* Walk through the whole tree and call the ACTION callback for every node
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/ |
| search.h | 149 /* Walk through the whole tree and call the ACTION callback for every node
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/pages/ |
| OverviewPage.java | 152 // walk through the known children of the manifest descriptor and keep what's not excluded
|
| /system/core/libcutils/ |
| config_utils.c | 43 /* we walk the whole list, as we need to return the last (newest) entry */
|
| /cts/tools/dasm/src/java_cup/ |
| production.java | 380 /* walk down the input buffer looking for identifiers */
449 /* walk down the parts and extract the labels */
469 /* now walk across and do each action string */
587 /* walk over the production and process each action */
669 /* walk down the right hand side till we get past all nullables */
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DecisionProbe.java | 535 // now walk truly unique (unaliased) list of dfa states with inf recur
546 // walk each alt with recursion overflow problems and generate error
572 // walk this DFA's config list
806 * interpreter, which does a deterministic walk. We need to be able to
808 * just do a depth-first walk traversing edges labeled with the current
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| tree.py | 134 """Walk upwards looking for ancestor with this token type."""
139 """Walk upwards and get first ancestor with this token type."""
786 # walk rest and decrement their child indexes
890 """Walk upwards looking for ancestor with this token type."""
894 """Walk upwards and get first ancestor with this token type."""
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| streams.rb | 47 ANTLR recognizers need a way to walk through input data in a serialized IO-style
72 parsers with the means to sequential walk through series of tokens.
1022 def walk method in class:ANTLR3.that.CommonTokenStream
[all...] |
| /external/oprofile/events/i386/nehalem/ |
| unit_masks | 24 0x01 any Counts all load misses that cause a page walk
155 0x01 any Counts the number of misses in the STLB which causes a page walk
156 0x02 walk_completed Counts number of misses in the STLB which resulted in a completed page walk
196 0x01 any Counts the number of misses in all levels of the ITLB which causes a page walk
197 0x02 walk_completed Counts number of misses in all levels of the ITLB which resulted in a completed page walk
198 0x04 walk_cycles Counts ITLB miss page walk cycles
|
| /build/tools/releasetools/ |
| check_target_files_signatures | 130 for dirpath, dirnames, filenames in os.walk(top):
256 for dirpath, dirnames, filenames in os.walk(d):
|
| /dalvik/vm/compiler/codegen/arm/ |
| LocalOptimizations.cpp | 71 * Perform a pass of top-down walk, from the second-last instruction in the
268 * Perform a pass of bottom-up walk, from the second instruction in the
|
| /dalvik/vm/compiler/codegen/mips/ |
| LocalOptimizations.cpp | 71 * Perform a pass of top-down walk, from the second-last instruction in the
268 * Perform a pass of bottom-up walk, from the second instruction in the
|
| /development/cmds/monkey/src/com/android/commands/monkey/ |
| MonkeySourceRandom.java | 253 * TODO: More useful than the random walk here would be to pick a single random direction
345 * TODO: More useful than the random walk here would be to pick a single random direction
|
| /development/scripts/ |
| divide_and_compress.py | 151 os.path.walk(self.base_path, self.CompressDirectory, 1)
217 unused_id: A numeric identifier passed by the os.path.walk method, this
|
| /development/tools/apkcheck/src/com/android/apkcheck/ |
| ApkCheck.java | 122 /* walk through list of libs we want to scan */
216 * We can walk up the hierarchy while analyzing the target APK,
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| DOTGenerator.java | 107 /** Do a depth-first walk of the state machine graph and
155 /** Do a depth-first walk of the state machine graph and
|
| /external/apache-xml/src/main/java/org/apache/xpath/compiler/ |
| Lexer.java | 90 * Walk through the expression and build a token queue, and a map of the top-level
102 * Walk through the expression and build a token queue, and a map of the top-level
|
| /external/chromium/chrome/browser/password_manager/ |
| password_form_manager.cc | 441 // so we don't generally need to walk the entire URL path (the else
445 // Walk the origin URL paths one directory at a time to see how
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| Store.cpp | 252 // Walk through the cast path to create nested CXXBaseRegions.
263 // Walk through the path to create nested CXXBaseRegions.
|
| /external/icu4c/common/ |
| rbbinode.cpp | 171 // flattenVariables Walk a parse tree, replacing any variable
208 // flattenSets Walk the parse tree, replacing any nodes of type setRef
|
| /external/jmonkeyengine/engine/src/test/jme3test/bullet/ |
| TestWalkingChar.java | 354 } else if (!"Walk".equals(animationChannel.getAnimationName())) {
355 animationChannel.setAnim("Walk", 0.7f);
|
| /external/jsilver/src/org/clearsilver/jni/ |
| JniHdf.java | 354 * Use this in conjunction with objNext to walk the HDF tree. Every node
369 * sibling. Use this in conjunction with objChild to walk the HDF tree.
|
| /external/llvm/include/llvm/Support/ |
| CFG.h | 276 // graph of basic blocks... and to walk it in inverse order. Inverse order for
338 // graph of basic blocks... and to walk it in inverse order. Inverse order for
|
| /external/llvm/lib/Analysis/ |
| TargetTransformInfo.cpp | 33 // Walk up the chain and update the top TTI pointer.
41 // Walk up the chain and update the top TTI pointer.
|
| /external/llvm/lib/CodeGen/ |
| MachineLICM.cpp | 160 /// HoistRegionPostRA - Walk the specified region of the CFG and hoist loop
228 /// dominator tree node if its a leaf or all of its children are done. Walk
234 /// HoistOutOfLoop - Walk the specified loop in the CFG (defined by all
489 /// HoistRegionPostRA - Walk the specified region of the CFG and hoist loop
503 // Walk the entire region, count number of defs for each register, and
663 /// dominator tree node if its a leaf or all of its children are done. Walk
684 /// HoistOutOfLoop - Walk the specified loop in the CFG (defined by all
696 // Perform a DFS walk to determine the order of visit.
[all...] |
