/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | pr42231.c | 11 static int CallFunctionRec(int (*fun)(int depth), int depth) { argument 12 if (!fun(depth)) { 15 if (depth < 10) { 16 CallFunctionRec(fun, depth + 1); 21 static int CallFunction(int (*fun)(int depth)) { argument 25 static int callback(int depth) { argument 26 storemax (depth); 27 return depth != 0;
|
H A D | pr35231.c | 4 foo(int bits_per_pixel, int depth) argument 6 if ((bits_per_pixel | depth) == 1)
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/garbage/ |
H A D | tree.go | 45 var n = flag.Int("n", 16, "depth") 52 func bottomUpTree(item, depth int) *Node { 53 if depth <= 0 { 56 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)} 80 fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check) 84 for depth := minDepth; depth <= maxDepth; depth += 2 { 85 iterations := 1 << uint(maxDepth-depth [all...] |
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/ |
H A D | binary-tree.go | 44 var n = flag.Int("n", 15, "depth") 51 func bottomUpTree(item, depth int) *Node { 52 if depth <= 0 { 55 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)} 77 fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check) 81 for depth := minDepth; depth <= maxDepth; depth += 2 { 82 iterations := 1 << uint(maxDepth-depth [all...] |
H A D | binary-tree.c | 74 treeNode* BottomUpTree(long item, unsigned depth) argument 76 if (depth > 0) 79 BottomUpTree(2 * item - 1, depth - 1), 80 BottomUpTree(2 * item, depth - 1), 102 unsigned N, depth, minDepth, maxDepth, stretchDepth; local 119 "stretch tree of depth %u\t check: %li\n", 128 for (depth = minDepth; depth <= maxDepth; depth += 2) 132 iterations = pow(2, maxDepth - depth [all...] |
H A D | binary-tree-freelist.go | 44 var n = flag.Int("n", 15, "depth") 84 func bottomUpTree(item, depth int) *Node { 85 if depth <= 0 { 88 return arena.New(item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)) 110 fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check) 114 for depth := minDepth; depth <= maxDepth; depth += 2 { 115 iterations := 1 << uint(maxDepth-depth [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/asan/ |
H A D | deep-stack-uaf-1.C | 13 template <int depth> 17 DeepFree<depth - 1>::free(x);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | delay-slot-2.c | 54 write_cond (struct decision_test *p, int depth, argument 64 printf ("GET_CODE (x%d) == ", depth); 68 printf ("XVECLEN (x%d, 0) == %d", depth, p->u.veclen); 72 printf ("XINT (x%d, 0) == %d", depth, (int) p->u.intval); 76 printf ("XINT (x%d, 1) == %d", depth, (int) p->u.intval); 81 printf ("XWINT (x%d, 0) == ", depth); 87 depth, (int) p->u.intval); 91 printf ("XVECLEN (x%d, 0) >= %d", depth, p->u.veclen); 95 printf ("rtx_equal_p (x%d, operands[%d])", depth, p->u.dup); 99 printf ("%s (x%d)", p->u.pred.name, depth); [all...] |
H A D | pr45055.c | 11 foo (int *img, int fp, int y, int *ptr, int depth, int c, int t, int xm) argument 16 if (depth)
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/go1/ |
H A D | binarytree_test.go | 17 func bottomUpTree(item, depth int) *binaryNode { 18 if depth <= 0 { 21 return &binaryNode{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)} 41 //fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check) 45 for depth := minDepth; depth <= maxDepth; depth += 2 { 46 iterations := 1 << uint(maxDepth-depth+minDepth) 50 check += bottomUpTree(i, depth) [all...] |
/haiku-buildtools/legacy/gcc/libobjc/ |
H A D | thr.c | 270 mutex->depth = 0; 284 int depth; local 291 depth = objc_mutex_lock(mutex); 300 /* Return last depth */ 301 return depth; 320 /* If we already own the lock then increment depth */ 323 return ++mutex->depth; 334 return mutex->depth = 1; 352 /* If we already own the lock then increment depth */ 355 return ++mutex->depth; [all...] |
/haiku-buildtools/gcc/libgcc/config/i386/ |
H A D | gthr-win32.c | 196 mutex->depth = 0; 207 mutex->depth = 1; 213 ++(mutex->depth); 217 mutex->depth = 1; 236 mutex->depth = 1; 240 ++(mutex->depth); 250 --(mutex->depth); 251 if (mutex->depth == 0)
|
/haiku-buildtools/gcc/gcc/ |
H A D | et-forest.c | 55 int depth; /* The depth of the node is the sum of depth member in struct:et_occ 57 int min; /* The minimum value of the depth in the subtree 58 is obtained by adding sum of depth fields 61 depth. */ 67 /* Changes depth of OCC to D. */ 75 occ->min += d - occ->depth; 76 occ->depth = d; 79 /* Adds D to the depth o 210 record_path_before_1(struct et_occ *occ, int depth) argument 261 check_path_after_1(struct et_occ *occ, int depth) argument [all...] |
H A D | graphite-blocking.c | 73 around PBB at depth TIME_DEPTH. 189 lst_do_strip_mine_loop (lst_p lst, int depth, int stride) argument 203 res += lst_do_strip_mine_loop (l, depth, stride); 209 pbb_strip_mine_time_depth (pbb, psct_dynamic_dim (pbb, depth), stride); 235 int depth; local 247 depth = lst_depth (lst); 248 if (depth >= 0
|
/haiku-buildtools/cloog/include/cloog/ |
H A D | block.h | 66 int depth ; /**< Original block depth (outer loop number).*/ member in struct:cloogblock 107 cloog_int_t *scaldims, int depth);
|
/haiku-buildtools/gcc/libgcc/config/mips/ |
H A D | gthr-mipssde.h | 47 long depth; member in struct:__anon2079 170 __mutex->depth = 0; 188 __mutex->depth++; 207 __mutex->depth++; 217 if (--__mutex->depth == 0)
|
/haiku-buildtools/isl/ |
H A D | isl_ast_codegen.c | 343 * resulting in constraints that are independent of "depth" 344 * to be sorted before the lower bounds on "depth", which in 345 * turn are sorted before the upper bounds on "depth". 350 int *depth = user; local 351 int t1 = constraint_type(a, *depth); 352 int t2 = constraint_type(b, *depth); 575 int depth; local 578 depth = isl_ast_build_get_depth(build); 581 if (isl_ast_build_has_stride(build, depth)) { 587 dom = isl_set_eliminate(dom, isl_dim_set, depth, 905 int depth; local 940 use_upper_bound_list(isl_ctx *ctx, int n_upper, __isl_keep isl_set *domain, int depth) argument 1027 int depth; local 1187 int depth; local 1241 int depth; local 1321 int depth; local 1385 int depth; member in struct:isl_check_scaled_data 1668 int depth = *(int *) user; local 1783 int i, n, depth; local 1841 int depth; local 1873 int depth = *(int *) user; local 1959 int depth; local 2025 int depth, dim; local 2108 int depth; member in struct:isl_find_unroll_data 2217 find_unroll_lower_bound(__isl_keep isl_set *domain, int depth, int *n) argument 2245 at_offset(int depth, __isl_keep isl_aff *aff, int offset) argument 2327 int depth; local 2840 at_most_one_non_fixed(struct isl_set_map_pair *domain, int *order, int n, int depth) argument 2871 eliminate_non_fixed(struct isl_set_map_pair *domain, int *order, int n, int depth, __isl_keep isl_ast_build *build) argument 3037 int depth; local 3114 int depth; local 3225 int depth; local 3340 int depth; member in struct:isl_any_scheduled_after_data 3478 int depth; local [all...] |
H A D | isl_ast_build.c | 33 map = isl_map_equate(map, isl_dim_in, build->depth, isl_dim_out, 0); 34 map = isl_map_eliminate(map, isl_dim_in, build->depth, 1); 126 build->depth = n; 170 dup->depth = build->depth; 439 for (i = 0; i < build->depth; ++i) 449 * In particular, it should be called when the depth is changed or 476 return build->depth != dim || any_eliminated(build); 515 build->depth, dim - build->depth); 1324 int depth; member in struct:isl_ast_build_involves_data 1528 int depth; local 2041 int depth; local 2064 int depth; local [all...] |
/haiku-buildtools/legacy/binutils/gas/ |
H A D | listing.h | 56 void listing_title (int depth);
|
/haiku-buildtools/binutils/gas/ |
H A D | listing.h | 55 void listing_title (int depth);
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | genrecog.c | 131 /* Record the highest depth we ever have so we know how many variables to 340 int depth = strlen (position); 343 if (depth > max_depth) 344 max_depth = depth; 377 newpos = (char *) alloca (depth + 2); 379 newpos[depth + 1] = 0; 457 newpos[depth] = i + (code == MATCH_OPERATOR ? '0': 'a'); 472 newpos[depth] = i + '0'; 503 newpos[depth] = '0'; 506 newpos[depth] 337 int depth = strlen (position); local 1104 register int depth = tree ? strlen (tree->position) : 0; local 1642 int depth = odepth; local [all...] |
H A D | genextract.c | 196 int depth = strlen (path); 230 newpath = (char *) alloca (depth + 2); 232 newpath[depth + 1] = 0; 236 newpath[depth] = '0' + i; 245 newpath = (char *) alloca (depth + 2); 247 newpath[depth + 1] = 0; 251 newpath[depth] = '0' + i; 260 newpath = (char *) alloca (depth + 2); 262 newpath[depth + 1] = 0; 266 newpath[depth] 194 int depth = strlen (path); local [all...] |
/haiku-buildtools/legacy/gcc/gcc/config/i386/ |
H A D | sequent.h | 80 fprintf (asmfile, "%s %d,0,%d,", ASM_STABN_OP, N_LBRAC, depth); \ 86 fprintf (asmfile, "%s %d,0,%d,", ASM_STABN_OP, N_RBRAC, depth); \
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/eh/ |
H A D | registers1.C | 16 const int depth = 3; variable 18 float float_src[num_vars * depth]; 21 int int_src[num_vars * depth]; 118 for (int i = 0; i < depth * num_vars; i++) 123 for (int level = 0; level < depth; level++)
|
/haiku-buildtools/jam/ |
H A D | make.c | 79 static void make0( TARGET *t, TARGET *p, int depth, 174 int depth, /* for display purposes */ 190 printf( "make\t--\t%s%s\n", spaces( depth ), t->name ); 246 spaces( depth ), t->name, t->boundname ); 255 spaces( depth ), t->name, target_bind[ t->binding ] ); 260 spaces( depth ), t->name, ctime( &t->time ) ); 284 make0( c->target, ptime, depth + 1, counts, anyhow ); 292 make0( t->includes, p, depth + 1, counts, anyhow ); 484 spaces( depth ), t->name ); 171 make0( TARGET *t, TARGET *p, int depth, COUNTS *counts, int anyhow ) argument
|