| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| ContactsDictionary.java | 154 // may overflow due to recursion
|
| /pdk/build/ |
| pdk_utils.py | 100 # do not include symbolic link to recursion
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| partial_sum.h | 77 no recursion.
|
| /external/protobuf/src/google/protobuf/io/ |
| coded_stream.h | 339 // Recursion Limit -------------------------------------------------
341 // we must keep track of the depth of recursion when parsing embedded
345 // Sets the maximum recursion depth. The default is 64.
348 // Increments the current recursion depth. Returns true if the depth is
352 // Decrements the recursion depth.
474 // Current recursion depth, controlled by IncrementRecursionDepth() and
477 // Recursion depth limit, set by SetRecursionLimit().
[all...] |
| /external/valgrind/main/callgrind/ |
| global.h | 345 * Recursion levels are used for fn[0].
351 * For each Context, recursion index and BB, there can be a BBCC.
381 * - recursion level of current function
392 UInt rec_index; /* Recursion index in rec->bbcc for this bbcc */
394 * recursion BBCCs. Shared. */
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestDFAConversion.java | 103 "s : a Y | A A A A A X ;\n" + // force recursion past m=4
113 "s : a Y | A+ X ;\n" + // force recursion past m=4
125 "s : (a Y)=> a Y | A A A A A X ;\n" + // force recursion past m=4
153 "s : (a Y)=> a Y | A A A A A X | Z;\n" + // force recursion past m=4
559 assertTrue("expecting left recursion cycles; found "+msg.getClass().getName(),
588 assertTrue("expecting left recursion cycles; found "+msg.getClass().getName(),
619 assertTrue("expecting left recursion cycles; found "+msg.getClass().getName(),
[all...] |
| /external/icu4c/test/intltest/ |
| wbnf.cpp | 227 delete refs[i]; // TOFIX: point alias/recursion problem
707 delete items[i]; // TOFIX: point alias/recursion problem
745 delete item; // TOFIX: point alias/recursion problem
763 delete items[i]; // TOFIX: point alias/recursion problem
[all...] |
| /hardware/ti/wlan/wl1271/stad/src/Ctrl_Interface/ |
| DrvMain.c | 937 * The first case (same context) may lead to a recursion of the SM, so a special handling is added
938 * to the SM to prevent recursion (see drvMain_Sm).
[all...] |
| /external/bluetooth/glib/docs/reference/glib/ |
| regex-syntax.sgml | [all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/ |
| en.stg | 265 Alternative <alt>: after matching input such as <input> decision cannot predict what comes next due to recursion overflow <targetRules,callSiteStates:{t,c|to <t> from <c:{s|<s.enclosingRule.name>};separator=", ">}; separator=" and ">
269 Alternative <alt> discovers infinite left-recursion <targetRules,callSiteStates:{t,c|to <t> from <c:{s|<s.enclosingRule>};separator=", ">}; separator=" and ">
|
| /external/icu4c/common/ |
| umutex.c | 239 m->recursionCount++; /* Recursion causes deadlock on Unixes. */
240 U_ASSERT(m->recursionCount == 1); /* Recursion detection works on Windows. */
|
| /external/llvm/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 121 // Break the recursion if this BasicBlock was already visited.
308 // This block is visited, mark this before the recursion.
|
| /external/mdnsresponder/mDNSCore/ |
| DNSCommon.h | 59 kDNSFlag0_RD = 0x01, // Recursion Desired?
60 kDNSFlag1_RA = 0x80, // Recursion Available?
|
| /external/valgrind/main/docs/internals/ |
| tracking-fn-entry-exit.txt | 68 mainly to catch tail recursion. In general, for functions doing a
137 Yes. IMHO, there is no way to distinguish between optimized tail recursion
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1/ |
| poly_laguerre.tcc | 156 * by recursion.
197 // Compute l_n^alpha by recursion on n.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/ |
| poly_laguerre.tcc | 155 * by recursion.
196 // Compute l_n^alpha by recursion on n.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/ |
| poly_laguerre.tcc | 155 * by recursion.
196 // Compute l_n^alpha by recursion on n.
|
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/tr1/ |
| poly_laguerre.tcc | 156 * by recursion.
197 // Compute l_n^alpha by recursion on n.
|
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/tr1/ |
| poly_laguerre.tcc | 156 * by recursion.
197 // Compute l_n^alpha by recursion on n.
|
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/tr1/ |
| poly_laguerre.tcc | 156 * by recursion.
197 // Compute l_n^alpha by recursion on n.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/refactorings/extractstring/ |
| ReplaceStringsVisitor.java | 361 * Because the superType argument is actually a recursion index, this makes the most
367 * @param superType The recursion index.
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/wizards/newproject/ |
| SdkSelectionPage.java | 262 * @param rootDir The "samples" root directory. Doesn't change during recursion.
319 // We can however skip this recursion for known android sub-dirs that
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/invoke_virtual/ |
| Test_invoke_virtual.java | 71 * @title Recursion of method lookup procedure
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| DeadCodeRemover.java | 179 * if this is the first recursion
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| LivenessAnalyzer.java | 123 * The algorithm in Appel is presented in partial tail-recursion
|
