| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 314 // Therefore, we cannot simply walk through one typedef chain to
432 // expressions inside a template function, we first walk up the AST, memoizing
|
| /external/elfutils/libdwfl/ |
| libdwfl.h | 213 /* Iterate through the modules, starting the walk with OFFSET == 0.
215 When *CALLBACK returns another value, the walk stops and the
|
| /external/libusb-compat/libusb/ |
| core.c | 259 /* walk through all busses we already know about, removing duplicates
594 /* walk through the devices we already know about, removing duplicates
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 139 /// MIs that are inside bundles (i.e. walk top level MIs only).
695 // MachineFunction as a graph of MachineBasicBlocks... and to walk it
|
| /external/llvm/lib/Analysis/IPA/ |
| CallGraphSCCPass.cpp | 195 // Walk the function body looking for call sites. Sync up the call sites in
430 // Walk the callgraph in bottom-up SCC order.
|
| /external/llvm/lib/Bitcode/Writer/ |
| ValueEnumerator.cpp | 251 // do walk their operands.
391 // walk through it, enumerating the types of the constant.
|
| /external/llvm/lib/CodeGen/ |
| MachineCSE.cpp | 598 /// dominator tree node if its a leaf or all of its children are done. Walk
626 // Perform a DFS walk to determine the order of visit.
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCContract.cpp | 244 // Walk down to find the store and the release, which may be in either order.
282 // 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/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
|
| /external/webkit/Source/WebCore/page/ |
| Frame.cpp | 413 // walk backwards in the node tree, until another element, or form, or end of tree
533 // Walk the hashtable. Inject by world.
[all...] |
| /external/webkit/Source/WebCore/rendering/ |
| RenderObjectChildList.cpp | 380 // We have generated content present still. We want to walk this content and update our
415 // Walk our list of generated content and create render objects for each.
|
| /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}
|
| /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/webkit/Source/WebCore/inspector/front-end/ |
| StylesSidebarPane.js | 268 // Walk the node structure and identify styles with inherited properties.
312 // Walk the style rules and make a list of all used and overloaded properties.
358 // Walk the properties again and account for !important.
361 // Walk in reverse to match the order !important overrides.
388 // Walk the style rules and update the sections with new overloaded and used properties.
[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/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 786 // Walk all dominator tree children of Root, inspecting their CFG edges with
[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...] |
| /cts/libs/json/src/com/android/json/stream/ |
| JsonWriter.java | 34 * writer as you walk the structure's contents, nesting arrays and objects as
|
