| /dalvik/vm/alloc/ |
| MarkSweep.h | 46 const void *finger; // only used while scanning/recursing.
|
| HeapInternal.h | 30 * that we find while recursing. The "next" pointers are hidden
|
| Heap.cpp | 276 * Avoid recursing.
530 LOGD_HEAP("Recursing...");
|
| MarkSweep.cpp | 127 /* Used to mark objects when recursing. Recursion is done by moving
|
| /external/openfst/src/bin/ |
| fstreplace.cc | 21 DEFINE_bool(epsilon_on_replace, false, "Create an espilon arc when recursing");
|
| /external/webkit/Source/WebCore/rendering/style/ |
| ContentData.cpp | 34 // Delete the singly-linked list without recursing.
|
| /external/kernel-headers/original/linux/ |
| mutex.h | 43 * - detects self-recursing locks and prints out all relevant info
|
| /external/webrtc/src/system_wrappers/source/spreadsortlib/ |
| spreadsort.hpp | 186 //Recursing; log_divisor is the remaining range
273 //Recursing
321 //Recursing
514 //Recursing
565 //Recursing
616 //Recursing
665 //Recursing
[all...] |
| /external/chromium/net/url_request/ |
| url_request_ftp_job.cc | 223 // any recursing into the caller as a result of this call.
|
| /external/valgrind/main/VEX/priv/ |
| ir_match.c | 55 /* This is the actual matching function, recursing over the pattern
|
| /frameworks/base/tests/DumpRenderTree/src/com/android/dumprendertree/ |
| FsUtils.java | 75 Log.v(LOGTAG, "Recursing on " + s);
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_storage.cc | 96 // Adds node to the model's index, recursing through all children as well.
|
| /external/emma/ |
| dependencies.xml | 3 <patternset id="java.libs" includes="*.jar,*.zip" /> <!-- not recursing by design -->
|
| /external/protobuf/ |
| Makefile.am | 28 # Makefile exists before recursing.
|
| /external/emma/core/java12/com/vladium/util/ |
| IPathEnumerator.java | 176 if (trace1) m_log.trace1 ("enumeratePathDir", "recursing into [" + child.getName () + "] ...");
|
| /external/llvm/lib/Support/Unix/ |
| Signals.inc | 132 // instead of recursing in the signal handler.
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| TypeInfo.java | 177 * definition can be reached by recursing any combination of {base
|
| /external/proguard/src/proguard/optimize/peephole/ |
| MethodInliner.java | 479 // Only inline the method if it isn't recursing.
|
| /ndk/sources/host-tools/make-3.81/ |
| implicit.c | 332 are ignored if we're recursing, so that they cannot be
796 /* If we are recursing, store the pattern that matched
|
| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| uniq.inp | 478 /* If min = max, continue at the same level without recursing */
[all...] |
| uniq.good | 90 /* If min = max, continue at the same level without recursing */
594 level without recursing. Otherwise, if minimizing, keep trying the rest of
[all...] |
| /external/openfst/src/include/fst/ |
| replace.h | 267 // create an epsilon arc when recursing into the appropriate Fst.
537 // so that recursing into an empty fst lead to a non co-accessible
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| AbstractIteratorTester.java | 384 // Keep recursing to fill the array.
|
| /external/llvm/docs/tutorial/ |
| OCamlLangImpl1.html | 248 <tt>Lexer.lex</tt> works by recursing over a <tt>char Stream.t</tt> to read
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| replace.h | 34 // create an epsilon arc when recursing into the appropriate Fst.
|
