| /external/clang/lib/CodeGen/ |
| CGDecl.cpp | [all...] |
| /external/clang/lib/Sema/ |
| SemaAccess.cpp | 101 // simplicity of checking, but we need to walk up through the
[all...] |
| /external/clang/tools/libclang/ |
| RecursiveASTVisitor.h | 82 /// 2. at a given node, walk up the class hierarchy, starting from
[all...] |
| /external/libmtp/src/ |
| ptp-pack.c | [all...] |
| /external/libxslt/libxslt/ |
| pattern.c | 895 * just walk back to adjust the index
1027 * just walk back to adjust the index
[all...] |
| /external/llvm/lib/CodeGen/ |
| BranchFolding.cpp | 221 // Walk the function to find jump tables that are live.
731 // Walk through equivalence sets looking for actual exact matches.
[all...] |
| /external/llvm/lib/Linker/ |
| LinkModules.cpp | 116 /// areTypesIsomorphic - Recursively walk this pair of types, returning true
326 // To determine which case this is, we have to recursively walk the type graph
[all...] |
| /external/qemu/android/ |
| hw-qemud.c | [all...] |
| /external/skia/legacy/src/core/ |
| SkAAClip.cpp | 307 // walk row to the end, and then we'll back up to trim riteZ
510 // We know that we have at least one non-zero row, so we can just walk
[all...] |
| /external/skia/src/core/ |
| SkAAClip.cpp | 316 // walk row to the end, and then we'll back up to trim riteZ
524 // We know that we have at least one non-zero row, so we can just walk
[all...] |
| /external/srtp/srtp/ |
| srtp.c | [all...] |
| /external/tcpdump/ |
| print-isoclns.c | 802 /* now walk the options */
[all...] |
| /external/tinyxml/ |
| tinyxml.h | 503 /** An alternate way to walk the children of a node.
[all...] |
| /external/webkit/Source/WebKit/chromium/src/ |
| WebFrameImpl.cpp | 214 // The text iterator will walk nodes giving us text. This is similar to
252 // Recursively walk the children.
[all...] |
| /bootable/recovery/minzip/ |
| Zip.c | 980 /* Walk through the entries and extract anything whose path begins
[all...] |
| /cts/tools/dasm/src/java_cup/ |
| lalr_state.java | 378 /* walk through the items that have links to the new state */
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| debug.py | 250 # walk the tree and emit create and add child events
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| NFAFactory.java | 78 * Walk the chain of elements (which can be complicated loop blocks...)
|
| /external/bluetooth/bluedroid/stack/gatt/ |
| gatt_sr.c | 164 /* Now walk through the buffers puting the data into the response in order */
[all...] |
| /external/chromium/chrome/browser/ |
| enumerate_modules_model_win.cc | 446 // Walk the module list.
[all...] |
| /external/chromium/chrome/browser/sync/engine/ |
| syncer_util.cc | 649 // 2. Take each folder and do a tree walk of all entries underneath it.
[all...] |
| /external/chromium/chrome/common/extensions/docs/ |
| tut_oauth.html | 347 This tutorial will walk you through the necessary steps for creating a Google Chrome Extension that uses OAuth to access an API. It leverages a library that you can reuse in your extensions.
|
| /external/chromium/net/disk_cache/ |
| rankings.cc | 846 // But we could have more than one pointing at the same mode. We walk the list
|
| /external/clang/lib/Serialization/ |
| GlobalModuleIndex.cpp | 270 // Second, walk the back links from out-of-date modules to those modules
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| RetainCountChecker.cpp | 519 // Walk the super chain. If we find a hit with a parent, we'll end
[all...] |
