| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCContract.cpp | 217 // Walk down to find the store and the release, which may be in either order.
255 // Walk up to find the retain.
|
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherOpt.cpp | 31 // If we have a scope node, walk down all of the children.
189 // Walk down all members of a scope node.
|
| /external/mesa3d/src/mesa/drivers/dri/i915/ |
| i915_debug.c | 527 FLAG(ptr[j], 0, "tile walk ymajor");
654 FLAG(ptr[j], 21, "tile walk ymajor");
|
| /external/oprofile/ |
| TODO | 50 <movement> but can we remove the app_name from rough_less and still be able to walk the two lists?
200 in a single left to right walk of the jitentry list.
|
| /external/v8/src/ |
| full-codegen.h | 325 // a register. Emits a context chain walk if if necessary (so does
331 // scratch1 will be clobbered. Emits a context chain walk if if necessary
|
| /frameworks/compile/slang/BitWriter_2_9/ |
| ValueEnumerator.cpp | 253 // do walk their operands.
403 // walk through it, enumerating the types of the constant.
|
| /frameworks/compile/slang/BitWriter_2_9_func/ |
| ValueEnumerator.cpp | 253 // do walk their operands.
403 // walk through it, enumerating the types of the constant.
|
| /frameworks/compile/slang/BitWriter_3_2/ |
| ValueEnumerator.cpp | 253 // do walk their operands.
393 // walk through it, enumerating the types of the constant.
|
| /libcore/luni/src/main/java/java/util/regex/ |
| Matcher.java | 98 * {@link #appendTail(StringBuffer)} to walk through the input and replace
276 * walk through the input and replace all matches of the {@code Pattern}
|
| /ndk/sources/host-tools/gdb-pretty-printers/stlport/gppfs-0.2/stlport/ |
| printers.py | 94 # Walk down to left-most child in right subtree.
99 # Walk up to first parent reached via left subtree.
|
| /prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/stlport/stlport/ |
| printers.py | 93 # Walk down to left-most child in right subtree.
98 # Walk up to first parent reached via left subtree.
|
| /prebuilts/python/linux-x86/2.7.5/share/pretty-printers/stlport/stlport/ |
| printers.py | 94 # Walk down to left-most child in right subtree.
99 # Walk up to first parent reached via left subtree.
|
| /dalvik/vm/interp/ |
| Jit.cpp | 568 * Walk the bucket chain to find an exact match for our PC and trace/method
582 * slot in the chain. Possibly continue the chain walk in case
611 /* Linear walk to find a free cell and add it to the end */
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderLayer.cpp | 498 // FIXME: We could track the repaint container as we walk down the tree.
675 // For the new columns code, we want to walk up our containing block chain looking for an enclosing layer. Once
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 365 /// walk recursively from start until stop. You can always return
721 /// Walk tree with depth-first-search and fill nodes buffer.
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Grammar.java | 484 * Computed during NFA to DFA conversion. Just walk accept states
943 /** Walk the list of options, altering this Grammar object according
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| CodeGenerator.java | 268 /** Given the grammar to which we are attached, walk the AST associated
271 * Finally, walk the AST again to generate code.
416 // Walk the AST holding the input grammar, this time generating code
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| SelectorChecker.cpp | 85 // CrossesBoundary means we don't care any context.scope. So we can walk up from a shadow root to its shadow host.
89 // If context.scope is not a shadow host, we cannot walk up from a shadow root to its shadow host.
93 // If behaviorAtBoundary is StaysWithInTreeScope, we cannot walk up from a shadow root to its shadow host.
[all...] |
| /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
| Blend.cpp | 830 // Walk the Region of interest and populate the pyramid
914 // Walk the Region of interest and populate the pyramid
[all...] |
| /art/runtime/gc/space/ |
| dlmalloc_space.cc | 466 void DlMallocSpace::Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_arg),
|
| /art/runtime/ |
| thread.cc | [all...] |
| zip_archive.cc | 513 // Walk through the central directory, adding entries to the hash
|
| /cts/libs/json/src/com/android/json/stream/ |
| JsonWriter.java | 34 * writer as you walk the structure's contents, nesting arrays and objects as
|
| /cts/tools/dasm/src/java_cup/ |
| lalr_item.java | 240 /* walk down the rhs and bail if we get a non-nullable symbol */
|
| /dalvik/vm/analysis/ |
| VfyBasicBlock.cpp | 334 * computation at each step, we just walk the "try" list in parallel.
|
