| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/arpa/ |
| nameser_compat.h | 56 unsigned rd: 1; /* recursion desired */
58 unsigned ra: 1; /* recursion available */
66 unsigned rd :1; /* recursion desired */
76 unsigned ra :1; /* recursion available */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/arpa/ |
| nameser_compat.h | 56 unsigned rd: 1; /* recursion desired */
58 unsigned ra: 1; /* recursion available */
66 unsigned rd :1; /* recursion desired */
76 unsigned ra :1; /* recursion available */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/arpa/ |
| nameser_compat.h | 56 unsigned rd: 1; /* recursion desired */
58 unsigned ra: 1; /* recursion available */
66 unsigned rd :1; /* recursion desired */
76 unsigned ra :1; /* recursion available */
|
| /system/extras/tests/bionic/libc/common/ |
| test_strptime.c | 29 // For now, only test a couple of formats that use recursion
|
| /external/llvm/lib/Transforms/Scalar/ |
| TailRecursionElimination.cpp | 10 // This file transforms calls of the current function (self recursion) followed
36 // evaluated each time through the tail recursion. Safely keeping allocas
39 // 2. Tail recursion is only performed if the call immediately precedes the
268 // part of the recursion.
329 /// transformed using accumulator recursion elimination, return the constant
415 // If we are introducing accumulator recursion to eliminate operations after
418 // then we actually perform accumulator recursion elimination instead of
419 // simple tail recursion elimination. If the operation is an LLVM instruction
424 // special case of accumulator recursion, the operation being "return C".
438 // using accumulator recursion elimination. Check to see if this is th
[all...] |
| /external/emma/core/java12/com/vladium/util/exception/ |
| IThrowableWrapper.java | 43 * recursion and is not meant to be called by other classes.
52 * recursion and is not meant to be called by other classes.
|
| /bionic/libc/private/ |
| arpa_nameser_compat.h | 107 unsigned rd: 1; /* recursion desired */
109 unsigned ra: 1; /* recursion available */
117 unsigned rd :1; /* recursion desired */
127 unsigned ra :1; /* recursion available */
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| NonLLStarDecisionException.java | 31 * a decision that has recursion in more than a single alt.
|
| NFAContext.java | 49 * is that I bound only recursion on the stack, not the simple stack size.
65 * trapped by the non-LL(*) detector for recursion in > 1 alt. Here is
68 * s : a Y | A A A A A X ; // force recursion past m=4
90 * This tracks recursion to a rule specific to an invocation site!
96 * max=4. Let's set to 4. Recursion is sometimes needed to resolve some
246 * Note that many NFA states can invoke rule r, but we ignore recursion
|
| DecisionProbe.java | 121 /** If decision with > 1 alt has recursion in > 1 alt, it's (likely) nonregular
127 /** Recursion is limited to a particular depth. If that limit is exceeded
137 /** Left recursion discovered. The proposed new NFAConfiguration
225 /** Found recursion in > 1 alt */
246 * terminate early to avoid infinite recursion for example (due to
247 * left recursion perhaps).
289 /** If a recursion overflow is resolve with predicates, then we need
415 // NONREGULAR DUE TO RECURSION > 1 ALTS
532 // RECURSION OVERFLOW
546 // walk each alt with recursion overflow problems and generate erro
[all...] |
| /external/dbus/dbus/ |
| dbus-threads.h | 57 * this, because it does not save/restore the recursion count when
86 * condition variables (does not save/restore the recursion count) so
152 * waiting on a condition, the recursion count is saved and restored,
154 * level of recursion.
|
| /external/valgrind/main/drd/ |
| drd_semaphore.h | 26 // Semaphore state information: owner thread and recursion count.
|
| /external/valgrind/main/drd/tests/ |
| tc23_bogus_condwait.stderr.exp-linux-ppc | 16 Mutex not locked: mutex 0x........, recursion count 0, owner 0.
43 Mutex not locked by calling thread: mutex 0x........, recursion count 1, owner 2.
63 The impossible happened: mutex is locked simultaneously by two threads: mutex 0x........, recursion count 1, owner 2.
71 Mutex not locked by calling thread: mutex 0x........, recursion count 2, owner 1.
|
| /external/webkit/Source/JavaScriptCore/runtime/ |
| StringRecursionChecker.h | 53 return emptyString(); // Return empty string to avoid infinite recursion.
|
| /external/bluetooth/glib/gobject/ |
| gobject-query.c | 38 static gboolean recursion = TRUE; variable
84 if (children && recursion)
183 recursion = FALSE;
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Exceptions/ |
| regress-121658.js | 38 * SUMMARY: "Too much recursion" errors should be safely caught by try...catch
48 var msg = '"Too much recursion" errors should be safely caught by try...catch';
64 // try...catch should catch the "too much recursion" error to ensue
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Regress/ |
| regress-192414.js | 38 * SUMMARY: Parser recursion should check stack overflow
46 var summary = 'Parser recursion should check stack overflow';
72 * in response to too deep recursion. We haven't crashed; good!
|
| regress-192465.js | 38 * SUMMARY: Object.toSource() recursion should check stack overflow
63 var summary = 'Object.toSource() recursion should check stack overflow';
85 // recursion. We haven't crashed; good! Continue on to set the dummy values -
|
| /ndk/sources/host-tools/make-3.81/doc/ |
| make.info | 103 Node: Recursion148728
105 Node: Variables/Recursion153089
106 Node: Options/Recursion158530
|
| make.info-2 | [all...] |
| /external/webkit/Source/JavaScriptCore/ |
| ChangeLog-2003-10-25 | [all...] |
| /external/svox/pico/lib/ |
| picotrns.c | 139 1 = before regular recursion step
143 picoos_int16 recPos; /* recursion position; must be signed! */
147 picokfst_state_t startFSTState; /**< starting FST state in current recursion position */
156 picokfst_symid_t altOutSym; /**< current output symbol at this recursion position */
157 picoos_int32 altOutRefPos; /**< output reference position at this recursion position */
288 /* Gets next acceptable alternative for output symbol '*outSym' at current recursion position
292 return the characteristics for next recursion step;
411 general scheme to get all solutions ("position" refers to abstract backtracking recursion depth,
483 /* initialize first recursion position */
492 case 1: /* before regular recursion step *
[all...] |
| /external/markdown/docs/ |
| CHANGE_LOG | 66 limit imposed by recursion in _process_section(). You can now parse as
85 Oct 7, 2007: Limit recursion on inlinePatterns. Added a 'safe' tag
108 May 15, 2006: A bug with lists, recursion on block-level elements,
|
| /external/webkit/Source/WebCore/bindings/v8/ |
| WorkerContextExecutionProxy.cpp | 237 // Compute the source string and prevent against infinite recursion.
239 v8::Local<v8::String> code = v8ExternalString("throw RangeError('Recursion too deep')");
249 // Run the script and keep track of the current recursion depth.
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| RecursionOverflowMessage.java | 37 /** Indicates recursion overflow. A DFA state tried add an NFA configuration
|
