| /aosp_15_r20/external/pigweed/pw_tokenizer/py/pw_tokenizer/ |
| H A D | detokenize.py | 280 recursion: int = DEFAULT_RECURSION,
298 if recursion > 0:
299 recursive_detokenize = self._detokenize_nested_callback(recursion)
312 recursion: int = DEFAULT_RECURSION,
323 return self._detokenize_nested_callback(recursion)(data)
329 recursion: int = DEFAULT_RECURSION,
332 return self.detokenize_text(data, recursion)
338 recursion: int = DEFAULT_RECURSION,
341 output.write(self._detokenize_nested(data, recursion))
348 recursion: int = DEFAULT_RECURSION,
[all …]
|
| /aosp_15_r20/external/pcre/testdata/ |
| H A D | testoutput15 | 215 Failed: error -52: nested recursion at the same subject position
219 Failed: error -52: nested recursion at the same subject position
223 Failed: error -52: nested recursion at the same subject position
376 # These tests provoke recursion loops, which give a different error message
384 Failed: error -52: nested recursion at the same subject position
394 Failed: error -52: nested recursion at the same subject position
404 Failed: error -52: nested recursion at the same subject position
414 Failed: error -52: nested recursion at the same subject position
424 Failed: error -52: nested recursion at the same subject position
428 Failed: error -52: nested recursion at the same subject position
[all …]
|
| /aosp_15_r20/external/compiler-rt/lib/tsan/rtl/ |
| H A D | tsan_rtl_mutex.cc | 154 CHECK_EQ(s->recursion, 0); in MutexLock()
158 CHECK_GT(s->recursion, 0); in MutexLock()
163 if (s->recursion == 0) { in MutexLock()
170 s->recursion += rec; in MutexLock()
172 if (common_flags()->detect_deadlocks && (s->recursion - rec) == 0) { in MutexLock()
198 if (kCppMode && (s->recursion == 0 || s->owner_tid != thr->tid)) { in MutexUnlock()
204 rec = all ? s->recursion : 1; in MutexUnlock()
205 s->recursion -= rec; in MutexUnlock()
206 if (s->recursion == 0) { in MutexUnlock()
215 if (common_flags()->detect_deadlocks && s->recursion == 0 && in MutexUnlock()
[all …]
|
| /aosp_15_r20/prebuilts/go/linux-x86/src/testing/ |
| D | sub_test.go | 196 === RUN chatty with recursion
197 === RUN chatty with recursion/#00
198 === RUN chatty with recursion/#00/#00
199 --- PASS: chatty with recursion (N.NNs)
200 --- PASS: chatty with recursion/#00 (N.NNs)
201 --- PASS: chatty with recursion/#00/#00 (N.NNs)`,
213 ^V=== RUN chatty with recursion and json
214 ^V=== RUN chatty with recursion and json/#00
215 ^V=== RUN chatty with recursion and json/#00/#00
216 ^V--- PASS: chatty with recursion and json/#00/#00 (N.NNs)
[all …]
|
| /aosp_15_r20/prebuilts/cmake/linux-x86/share/cmake-3.22/Help/variable/ |
| D | CMAKE_MAXIMUM_RECURSION_DEPTH.rst | 6 Maximum recursion depth for CMake scripts. It is intended to be set on the
8 ``CMakeLists.txt`` by projects that require a large recursion depth. Projects
20 used. If the recursion limit is reached, the script terminates immediately with
23 Calling any of the following commands increases the recursion depth:
32 :command:`function` and :command:`macro` themselves don't increase recursion
|
| /aosp_15_r20/external/toolchain-utils/binary_search_tool/full_bisect_test/ |
| H A D | bad-output-3.txt | 1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
|
| H A D | bad-output-2.txt | 1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
|
| H A D | good-output.txt | 1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
|
| H A D | bad-output-1.txt | 1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
|
| /aosp_15_r20/external/cronet/ipc/ |
| H A D | ipc_message_utils.cc | 117 void WriteValue(const base::Value& value, int recursion, base::Pickle* pickle);
120 int recursion, in WriteDictValue() argument
125 WriteValue(entry.second, recursion + 1, pickle); in WriteDictValue()
130 int recursion, in WriteListValue() argument
134 WriteValue(entry, recursion + 1, pickle); in WriteListValue()
138 void WriteValue(const base::Value& value, int recursion, base::Pickle* pickle) { in WriteValue() argument
140 if (recursion > kMaxRecursionDepth) { in WriteValue()
178 WriteDictValue(value.GetDict(), recursion, pickle); in WriteValue()
183 WriteListValue(value.GetList(), recursion, pickle); in WriteValue()
191 int recursion,
[all …]
|
| /aosp_15_r20/external/starlark-go/starlark/testdata/ |
| H A D | function.star | 50 # recursion detection, simple
57 # recursion detection, advanced
59 # A simplistic recursion check that looks for repeated calls to the
60 # same function value will not detect recursion using the Y
62 # recursion. To truly prohibit recursion, the dynamic check must look
80 # With the -recursion option it would yield [[2, 4, 6], ["aa", "bb", "cc"]].
242 # option:recursion
|
| H A D | misc.star | 62 assert.fails(lambda: cyclic < cyclic, "maximum recursion")
63 assert.fails(lambda: cyclic == cyclic, "maximum recursion")
66 assert.fails(lambda: cyclic2 == cyclic, "maximum recursion")
78 assert.fails(lambda: cyclic5 == cyclic5 ,"maximum recursion")
81 assert.fails(lambda: cyclic5 == cyclic6, "maximum recursion")
|
| H A D | recursion.star | 1 # Tests of Starlark recursion and while statement.
5 # option:recursion
|
| /aosp_15_r20/external/libchrome/ipc/ |
| H A D | ipc_message_utils.cc | 82 int recursion);
84 void WriteValue(base::Pickle* m, const base::Value* value, int recursion) { in WriteValue() argument
86 if (recursion > kMaxRecursionDepth) { in WriteValue()
138 WriteValue(m, &it.value(), recursion + 1); in WriteValue()
146 WriteValue(m, &entry, recursion + 1); in WriteValue()
158 int recursion) { in ReadDictionaryValue() argument
167 !ReadValue(m, iter, &subval, recursion + 1)) in ReadDictionaryValue()
180 int recursion) { in ReadListValue() argument
187 if (!ReadValue(m, iter, &subval, recursion + 1)) in ReadListValue()
198 int recursion) { in ReadValue() argument
[all …]
|
| /aosp_15_r20/external/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_deadlock_detector2.cc | 156 m->recursion = 0; in MutexInit()
283 m->recursion++; in MutexAfterLock()
289 CHECK_EQ(m->recursion, 0); in MutexAfterLock()
290 m->recursion = 1; in MutexAfterLock()
314 if (--m->recursion > 0) in MutexBeforeUnlock()
|
| /aosp_15_r20/external/skia/resources/sksl/errors/ |
| H A D | IllegalRecursionSimple.rts | 3 // Simple recursion is not allowed, even with branching:
7 potential recursion (function call cycle) not allowed:
|
| H A D | IllegalRecursionMutual.rts | 3 // Straightforward mutual recursion (not allowed)
9 potential recursion (function call cycle) not allowed:
|
| H A D | IllegalRecursionComplex.rts | 3 // Complex recursion spanning several functions with overloads, etc.
37 potential recursion (function call cycle) not allowed:
|
| /aosp_15_r20/external/deqp-deps/glslang/Test/ |
| D | recurse2.frag | 3 // cross-unit recursion
5 // two-level recursion
|
| D | recurse1.vert | 7 // direct recursion
14 // two-level recursion
|
| /aosp_15_r20/external/angle/third_party/glslang/src/Test/ |
| H A D | recurse2.frag | 3 // cross-unit recursion
5 // two-level recursion
|
| H A D | recurse1.vert | 7 // direct recursion
14 // two-level recursion
|
| /aosp_15_r20/prebuilts/build-tools/common/bison/m4sugar/ |
| H A D | foreach.m4 | 4 # Speeds up GNU M4 1.4.x by avoiding quadratic $@ recursion, but penalizes
42 # recursion by writing a variant of m4_foreach that uses m4_for rather
43 # than $@ recursion to operate on the list. This involves more macro
47 # costs additional time; therefore, in M4 1.6, where $@ recursion uses
62 # ARG, expand PRE[ARG]POST[]. The IGNORED argument makes recursion
67 # that temporary macro. Thus, the recursion is done in m4_for without
|
| /aosp_15_r20/external/angle/tools/flex-bison/third_party/m4sugar/ |
| H A D | foreach.m4 | 4 # Speeds up GNU M4 1.4.x by avoiding quadratic $@ recursion, but penalizes
42 # recursion by writing a variant of m4_foreach that uses m4_for rather
43 # than $@ recursion to operate on the list. This involves more macro
47 # costs additional time; therefore, in M4 1.6, where $@ recursion uses
62 # ARG, expand PRE[ARG]POST[]. The IGNORED argument makes recursion
67 # that temporary macro. Thus, the recursion is done in m4_for without
|
| /aosp_15_r20/external/python/cpython2/Misc/NEWS.d/ |
| D | 2.6rc2.rst | 26 recursion tests in Tools/scripts/find_recursion_limit.py can raise
28 exactly the recursion limit is exceeded. Consequently, both exception types
|