| /frameworks/base/core/java/com/android/internal/backup/ |
| IBackupTransport.aidl | 158 * to walk through the actual application data.
|
| /ndk/build/core/ |
| definitions-graph.mk | 437 # Return breadth-first walk of a graph, starting from an arbitrary
440 # This performs a breadth-first walk of the graph and will return a
494 # Return breadth-first walk of a graph, starting from an arbitrary
497 # This performs a breadth-first walk of the graph and will return a
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/ |
| archive_util.py | 165 for dirpath, dirnames, filenames in os.walk(base_dir):
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/tests/ |
| support.py | 177 # this file is run from its parent directory, so walk up the
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/ |
| archive_util.py | 165 for dirpath, dirnames, filenames in os.walk(base_dir):
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/tests/ |
| support.py | 177 # this file is run from its parent directory, so walk up the
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaMethod.java | 746 * method once for every block. This depth-first walk may be run forward
749 * @param reverse true if this should walk backwards from the exit points
806 // We walk the tree this way for historical reasons...
|
| /dalvik/vm/arch/arm/ |
| CallEABI.S | 293 * Walk through the argument list, counting up the number of 32-bit words
294 * required to contain it. Then walk through it a second time, copying
352 @ We need to copy words from [r7] to [r8]. We walk forward through
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| IntervalSet.java | 197 // walk set and add each interval
400 * just walk them together. This is roughly O(min(n,m)) for interval
547 * and disjoint, equals is a simple linear walk over both lists
|
| /external/chromium/chrome/common/extensions/docs/build/ |
| directory.py | 21 """ A version of os.walk that yields results in order sorted by name.
23 This is to prevent spurious docs changes due to os.walk returning items in a
26 for base, dirs, files in os.walk(path):
|
| /external/chromium_org/content/browser/worker_host/ |
| worker_service_impl.cc | 417 // Walk the worker's filter list to see if this client is listed. If not,
673 // Walk the pending instances looking for a matching pending worker.
690 // Walk the pending instances looking for a matching pending worker.
|
| /external/chromium_org/courgette/ |
| disassembler_win32_x64.cc | 244 // Walk the variable sized blocks.
259 // Walk through the two-byte entries.
335 // Walk all the bytes in the file, whether or not in a section.
|
| disassembler_win32_x86.cc | 244 // Walk the variable sized blocks.
259 // Walk through the two-byte entries.
335 // Walk all the bytes in the file, whether or not in a section.
|
| /external/chromium_org/ui/views/widget/ |
| root_view.cc | 176 // Walk up the tree until we find a view that wants the touch event.
303 // Walk up the tree until we find a view that wants the gesture event.
428 // Walk up the tree until we find a view that wants the mouse event.
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaMethod.java | 747 * method once for every block. This depth-first walk may be run forward
750 * @param reverse true if this should walk backwards from the exit points
807 // We walk the tree this way for historical reasons...
|
| /external/llvm/lib/Transforms/Scalar/ |
| EarlyCSE.cpp | 10 // This pass performs a simple dominator tree walk that eliminates trivially
267 /// EarlyCSE - This pass does a simple depth-first walk over the dominator
284 /// all of our simple scalar expressions. As we walk down the domtree, we
|
| /external/llvm/lib/Transforms/Utils/ |
| SSAUpdater.cpp | 98 // is relatively slow. If we already have PHI nodes in this block, walk one
247 // block, walk one of them to get the predecessor list instead.
356 // Walk the uses in the use-list order to be determinstic.
|
| PromoteMemoryToRegister.cpp | 100 // Walk queued up uses in the worklist to handle nested uses.
360 /// \brief Walk a small vector of dead instructions and recursively remove them
520 // Walk the use-def list of the alloca, getting the locations of all stores.
534 // Walk all of the loads from this alloca, replacing them with the nearest
[all...] |
| /external/oprofile/events/i386/westmere/ |
| unit_masks | 66 0x04 walk_cycles DTLB load miss page walk cycles
73 0x04 walk_cycles DTLB miss page walk cycles
107 0x04 walk_cycles ITLB miss page walk cycles
|
| /external/oprofile/events/x86-64/family10/ |
| unit_masks | 129 0x04 TLB page table walk
138 0x08 GART/DEV request hit table walk in progress
142 0x80 GART/DEV multiple table walk in progress
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_parser.py | 267 def walk(tree): function in function:RoundtripLegalSyntaxTestCase.test_position
272 for x in walk(elt):
277 terminals = list(walk(st2))
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_parser.py | 267 def walk(tree): function in function:RoundtripLegalSyntaxTestCase.test_position
272 for x in walk(elt):
277 terminals = list(walk(st2))
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| streams.py | 729 Walk past any token not on the channel the parser is listening to.
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| compile.cc | 140 // The walk is purely post-recursive: given the machines for the
676 // decided to cut this walk short.
682 // Called before traversing a node's children during the walk.
684 // Cut off walk if we've already failed.
712 // Called after traversing the node's children during the walk.
[all...] |
| /external/llvm/lib/CodeGen/ |
| ShrinkWrapping.cpp | 400 // Walk instructions in all MBBs, create CSRUsed[] sets, choose
[all...] |
