| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
| BitSet.js | 189 // walk set and add each interval
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRTreeWizard.m | 312 /** Walk the entire tree and make a node name to nodes mapping.
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| treewizard.py | 370 """Walk the entire tree and make a node name to nodes mapping.
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/ |
| AST.stg | 213 * option but if the user is going to walk the tree, they will want
|
| /external/bluetooth/glib/glib/ |
| gthread.c | 960 /* walk the list, skipping non-existant threads */
|
| /external/chromium/base/ |
| process_util_win.cc | 73 // TODO(maruel): Walk up the process chain if deemed necessary.
|
| /external/chromium/chrome/browser/autocomplete/ |
| autocomplete_popup_view_gtk.cc | 220 // Walk through the classifications, they are linear, in order, and should
|
| /external/chromium/chrome/browser/history/ |
| text_database_manager.cc | 355 // Walk from the beginning of the list backwards in time to find the newest
|
| /external/chromium/chrome/browser/instant/ |
| instant_controller.cc | 330 // Walk up the view hierarchy. If the view gaining focus is a subview of the
|
| /external/chromium/chrome/common/extensions/docs/examples/extensions/proxy_configuration/ |
| proxy_form_controller.js | 430 // Walk up the tree until we hit `form > fieldset` or fall off the top
|
| /external/chromium/sdch/open-vcdiff/src/ |
| blockhash.h | 418 // Walk through the hash entry chain, skipping over any false matches
|
| /external/chromium/third_party/libevent/ |
| evdns.h | 149 * nameserver. Several algorithms require a full walk of the inflight
|
| /external/clang/include/clang/AST/ |
| ExternalASTSource.h | 370 /// gives us a reasonably efficient, source-order walk.
|
| /external/clang/include/clang/Lex/ |
| PreprocessingRecord.h | 421 /// gives us a reasonably efficient, source-order walk.
|
| /external/clang/lib/AST/ |
| CXXInheritance.cpp | 502 // overrides so that we do not walk the virtual base class (and
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| MacOSKeychainAPIChecker.cpp | 516 // Walk the ExplodedGraph backwards and find the first node that referred to
|
| /external/clang/utils/TableGen/ |
| ClangDiagnosticsEmitter.cpp | 272 // Walk through the groups emitting an array for each diagnostic of the diags
|
| /external/clang/www/analyzer/ |
| checker_dev_manual.html | 261 Some checks might not require path-sensitivity to be effective. Simple AST walk
|
| /external/e2fsprogs/e2fsck/ |
| recovery.c | 389 * Now we walk through the log, transaction by transaction,
|
| /external/icu4c/common/unicode/ |
| uiter.h | 253 * relatively slow because the iterator has to "walk" from a known index
|
| /external/icu4c/i18n/ |
| coll.cpp | 254 // for now, there is a hardcoded list, so just walk through that list and set it up.
|
| /external/llvm/docs/ |
| index.html | 77 <li><a href="tutorial/">LLVM Tutorial</a> - A walk through the process of using
|
| /external/llvm/include/llvm/ADT/ |
| SparseBitVector.h | 309 // Iterator to walk set bits in the bitmap. This iterator is a lot uglier
|
| /external/llvm/include/llvm/Analysis/ |
| RegionInfo.h | 233 /// verifyWalk - Walk over all the BBs of the region starting from BB and
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineFunction.h | 468 // graph of basic blocks... and to walk it in inverse order. Inverse order for
|
