/external/clang/test/SemaCXX/ |
H A D | constexpr-backtrace-limit.cpp | 4 // TEST1-NEXT: in call to 'recurse(2)' 5 // TEST1-NEXT: in call to 'recurse(3)' 6 // TEST1-NEXT: in call to 'recurse(4)' 7 // TEST1-NEXT: in call to 'recurse(5)' 12 // TEST2-NEXT: in call to 'recurse(2)' 14 // TEST2-NEXT: in call to 'recurse(5)' 19 // TEST3-NEXT: in call to 'recurse(0)' 21 // TEST3-NEXT: in call to 'recurse(5)' 26 // TEST4-NEXT: in call to 'recurse(0)' 27 // TEST4-NEXT: in call to 'recurse( 33 constexpr int recurse(int n) { return n ? recurse(n-1) : *(int*)n; } function [all...] |
H A D | scope-check.cpp | 194 bool recurse() { function in namespace:PR10462 200 if (recurse()) {
|
/external/v8/test/mjsunit/regress/ |
H A D | regress-119429.js | 31 function recurse() { function 35 recurse(); 37 assertThrows(function() { recurse();} );
|
/external/valgrind/none/tests/amd64/ |
H A D | bug156404-amd64.c | 35 long recurse ( const char* path, long count ) function 40 long r = recurse(path, count-1); 50 r = recurse( "/proc/self", i );
|
/external/doclava/src/com/google/doclava/ |
H A D | Hierarchy.java | 62 recurse(nodes, "java.lang.Object", hdf.getChild("classes.0"), depth, depth); 94 private static void recurse(HashMap<String, TreeSet<String>> nodes, String name, Data hdf, method in class:Hierarchy 135 recurse(nodes, s, children.getChild(index), totalDepth, remainingDepth);
|
/external/elfutils/src/libdw/ |
H A D | libdw_visit_scopes.c | 82 inline int recurse (void) function 129 int result = recurse ();
|
/external/jmonkeyengine/engine/src/test/jme3test/app/ |
H A D | TestTempVars.java | 92 public static void recursiveMethod(int recurse) { argument 97 if (recurse < 4) { 98 recursiveMethod(recurse + 1);
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | URLHandler.java | 163 public void guide(URLVisitor v, boolean recurse, boolean strip) { argument 165 process(v, recurse, strip, "/", file.listFiles()); 171 private void process(URLVisitor v, boolean recurse, boolean strip, String path, File[] files) { argument 176 if (recurse) { 177 process(v, recurse, strip, path + f.getName()+ '/', f.listFiles()); 220 public void guide(URLVisitor v, boolean recurse, boolean strip) { argument 233 if (ix > 0 && !recurse) { 250 public void guide(URLVisitor visitor, boolean recurse) argument 252 guide(visitor, recurse, true); 255 public abstract void guide(URLVisitor visitor, boolean recurse, boolea argument [all...] |
/external/owasp/sanitizer/tools/ |
H A D | update_tree_in_svn.py | 65 def recurse(src, dst): function in function:sync 100 (NO_EXIST, DIR) : (recurse, remove, svn_delete,), 103 (FILE, DIR) : (recurse, remove, svn_delete, copy, svn_add, cnf), 104 (DIR, NO_EXIST): (mkdir, svn_add, recurse,), 105 (DIR, FILE) : (remove, svn_delete, mkdir, svn_add, recurse, cnf), 106 (DIR, DIR) : (recurse,), 109 # Walk the file tree (see recurse action above) and synchronize it at
|
/external/e2fsprogs/e2fsck/ |
H A D | message.c | 242 int *first, int recurse) 251 if (*cpp && recurse < 10) { 257 print_e2fsck_message(f, ctx, str, pctx, *first, recurse+1); 524 int recurse) 535 recurse); 240 expand_at_expression(FILE *f, e2fsck_t ctx, char ch, struct problem_context *pctx, int *first, int recurse) argument 522 print_e2fsck_message(FILE *f, e2fsck_t ctx, const char *msg, struct problem_context *pctx, int first, int recurse) argument
|
H A D | problem.c | 2001 int recurse) 1999 print_e2fsck_message(FILE *f, e2fsck_t ctx, const char *msg, struct problem_context *pctx, int first, int recurse) argument
|
/external/jarjar/src/main/com/tonicsystems/jarjar/util/ |
H A D | ClassPathIterator.java | 213 private static List<File> findFiles(File dir, FileFilter filter, boolean recurse, List<File> collect) { argument 215 if (recurse && file.isDirectory()) { 216 findFiles(file, filter, recurse, collect);
|
/external/skia/bench/ |
H A D | AAClipBench.cpp | 118 void recurse(SkCanvas* canvas, function in class:NestedAAClipBench 144 this->recurse(canvas, depth+1, childOffset); 147 this->recurse(canvas, depth+1, childOffset); 151 this->recurse(canvas, depth+1, childOffset); 155 this->recurse(canvas, depth+1, childOffset); 165 this->recurse(canvas, 0, offset);
|
/external/e2fsprogs/util/ |
H A D | symlinks.c | 34 static int verbose = 0, fix_links = 0, recurse = 0, delete = 0, shorten = 0, variable 293 } else if (recurse && S_ISDIR(st.st_mode)) { 311 "\t-r == recurse into subdirs\n" 362 else if (c == 'r') recurse = 1;
|
/external/llvm/utils/llvm-build/llvmbuild/ |
H A D | main.py | 68 def recurse(subpath): function in function:LLVMProjectInfo.load_infos_from_path 83 for item in recurse(os.path.join(subpath, subdir)): 86 return recurse("/")
|
/external/selinux/policycoreutils/setfiles/ |
H A D | setfiles.c | 153 int recurse; /* Recursive descent. */ local 196 recurse = 1; 216 recurse = 0; 320 recurse = 1; 433 errors |= process_glob(buf, recurse) < 0; 439 errors |= process_glob(argv[i], recurse) < 0;
|
H A D | restore.c | 103 static int restore(FTSENT *ftsent, int recurse) argument 110 if ((errno == ENOENT) && ((!recurse) || (r_opts->verbose))) 281 static int apply_spec(FTSENT *ftsent, int recurse) argument 289 int rc = restore(ftsent, recurse); 373 int process_glob(char *name, int recurse) { argument 388 int rc = process_one_realpath(globbuf.gl_pathv[i], recurse); 396 int process_one_realpath(char *name, int recurse) argument 409 return process_one(name, recurse); 432 rc = process_one(p, recurse); 443 rc = process_one(p, recurse); [all...] |
/external/deqp/framework/delibs/depool/ |
H A D | deMemPool.c | 386 * \param recurse Is operation recursive to child pools? 388 * if 'recurse' is true). 390 int deMemPool_getNumAllocatedBytes (const deMemPool* pool, deBool recurse) argument 398 if (recurse) 408 int deMemPool_getCapacity (const deMemPool* pool, deBool recurse) argument 416 if (recurse)
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | AbstractIteratorTester.java | 372 recurse(0); 378 private void recurse(int level) { method in class:AbstractIteratorTester 388 recurse(level + 1);
|
/external/toybox/toys/posix/ |
H A D | find.c | 183 int pcount = 0, print = 0, not = 0, active = !!new, test = active, recurse; local 187 recurse = DIRTREE_COMEAGAIN|(DIRTREE_SYMFOLLOW*!!(toys.optflags&FLAG_L)); 193 if (TT.xdev && new->st.st_dev != new->parent->st.st_dev) recurse = 0; 199 if (TT.depth) return recurse; 285 if (check && S_ISDIR(new->st.st_dev) && !TT.depth) recurse = 0; 352 if (i == d && not) recurse = 0; 355 if (i == d && !not) recurse = 0; 505 return recurse;
|
/external/v8/test/mjsunit/ |
H A D | strict-mode.js | 1161 function recurse(n, then) { function 1163 return recurse(n - 1, then); 1170 return recurse(n, function() { return non_strict.caller; }); 1174 return recurse(n, function() { return strict(n); }); 1189 function recurse(n, then) { 1191 return recurse(n - 1, then); 1198 return recurse(n, function() { 1204 return recurse(n, function() { return strict(n); });
|
/external/skia/src/views/ |
H A D | SkView.cpp | 799 static void dumpview(const SkView* view, int level, bool recurse) argument 809 if (recurse) 838 void SkView::dump(bool recurse) const 840 dumpview(this, 0, recurse);
|
/external/llvm/utils/TableGen/ |
H A D | FixedLenDecoderEmitter.cpp | 266 void recurse(); 413 // Called from Filter::recurse() when singleton exists. For debug purpose. 539 void Filter::recurse() { function in class:Filter 556 // No need to recurse for a singleton filtered instruction. 621 // See also recurse(). 950 // Called from Filter::recurse() when singleton exists. For debug purpose. 1355 bestFilter().recurse(); 1426 // Filter::recurse() set either BIT_TRUE or BIT_FALSE for each position. 1594 bestFilter().recurse();
|
/external/libselinux/src/ |
H A D | android.c | 1223 bool recurse = (flags & SELINUX_ANDROID_RESTORECON_RECURSE) ? true : false; local 1260 if (!recurse) {
|
/external/valgrind/coregrind/m_demangle/ |
H A D | cplus-dem.c | 3154 char * recurse = (char *)NULL; local 3157 recurse = XNEWVEC (char, namelength + 1); 3158 memcpy (recurse, *mangled, namelength); 3159 recurse[namelength] = '\000'; 3161 recurse_dem = ML_(cplus_demangle) (recurse, work->options); 3172 free (recurse); 4120 char * recurse; local 4138 recurse = XNEWVEC (char, literal_len + 1); 4139 memcpy (recurse, *mangled, literal_len); 4140 recurse[literal_le [all...] |