HomeSort by relevance Sort by last modified time
    Searched refs:recursion (Results 1 - 25 of 82) sorted by null

1 2 3 4

  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/tic54x/
subsym1.s 2 * String substitution symbol recursion
5 ; recursion should stop at x
  /external/mesa3d/src/glsl/
linker.h 91 void recursion(const glsl_type *t, char **name, size_t name_length);
link_uniforms.cpp 68 recursion(var->type, &name, strlen(name));
76 uniform_field_visitor::recursion(const glsl_type *t, char **name, function in class:uniform_field_visitor
93 recursion(t->fields.structure[i].type, name, new_length);
102 recursion(t->fields.array, name, new_length);
  /external/valgrind/drd/tests/
pth_mutex_reinit.stderr.exp 2 Mutex reinitialization: mutex 0x........, recursion count 0, owner 1.
pth_cancel_locked.stderr.exp 2 Mutex still locked at thread exit: mutex 0x........, recursion count 1, owner 2.
tc10_rec_lock.stderr.exp 9 Mutex not locked by calling thread: mutex 0x........, recursion count 0, owner 1.
  /build/tools/
mktarball.sh 24 #tar --no-recursion -cvf ${target_tar} ${dir_to_tar}
39 tar --no-recursion --numeric-owner --owner $new_uid \
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-spu/
icache1.s 73 #recursion
82 #recursion
  /external/compiler-rt/lib/tsan/rtl/
tsan_rtl_mutex.cc 153 CHECK_EQ(s->recursion, 0);
157 CHECK_GT(s->recursion, 0);
162 if (s->recursion == 0) {
169 s->recursion += rec;
171 if (common_flags()->detect_deadlocks && (s->recursion - rec) == 0) {
197 if (kCppMode && (s->recursion == 0 || s->owner_tid != thr->tid)) {
203 rec = all ? s->recursion : 1;
204 s->recursion -= rec;
205 if (s->recursion == 0) {
214 if (common_flags()->detect_deadlocks && s->recursion == 0 &
    [all...]
tsan_sync.h 37 int recursion; member in struct:__tsan::SyncVar
tsan_sync.cc 44 recursion = 0;
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_deadlock_detector_interface.h 41 u32 recursion;
sanitizer_deadlock_detector2.cc 156 m->recursion = 0;
283 m->recursion++;
289 CHECK_EQ(m->recursion, 0);
290 m->recursion = 1;
314 if (--m->recursion > 0)
  /external/v8/test/mjsunit/regress/
regress-2564.js 34 Error.prepareStackTrace = undefined; // Prevent recursion.
65 Error.prepareStackTrace = undefined; // Prevent recursion.
101 Error.prepareStackTrace = undefined; // Prevent recursion.
regress-crbug-178790.js 45 // recursion depth possible with a given budget.
  /external/v8/tools/
detect-builtins.js 25 // Avoid endless recursion.
  /external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/
backtracking.rb 45 * recursion in the declarator rules. I'm putting in a
  /external/v8/test/webkit/fast/js/kde/
crash-2.js 25 // infinite recursion 2
  /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/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/
ant-starteam.jar 
  /external/v8/test/webkit/
named-function-expression.js 45 debug("recursion is possible, though");
63 // Recursion.
  /external/fdlibm/
configure 453 -no-recursion | --no-recursion | --no-recursio | --no-recursi \
976 # Strip out --no-create and --no-recursion so they do not pile up.
990 -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
    [all...]
  /external/v8/test/mjsunit/
stack-traces.js 329 // does not lead to recursion.
  /toolchain/binutils/binutils-2.25/etc/
configure 832 -no-recursion | --no-recursion | --no-recursio | --no-recursi \
    [all...]
  /external/pcre/dist/
RunGrepTest 327 (cd $srcdir; $valgrind $pcregrep --recursion-limit=1000 --no-jit -M 'This is a file(.|\R)*file.' ./testdata/grepinput) >>testtrygrep 2>&1

Completed in 811 milliseconds

1 2 3 4