Searched refs:nest (Results 1 - 23 of 23) sorted by relevance

/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/noncompile/
H A Dlabel-1.c82 auto void nest(void);
84 l: nest();
86 void nest(void) function
88 goto l; /* { dg-error "used but not defined" "nest use outer label" } */
98 auto void nest(void);
100 l: nest();
102 void nest(void) function
104 l: dummy(); /* { dg-warning "defined but not used" "nest label same name" } */
114 void nest(void) function
116 l: dummy(); /* { dg-warning "defined but not used" "outer use nest labe
126 void nest(void) function
142 void nest(void) { goto l; } function
154 void nest(void) function
167 void nest(void) function
[all...]
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/
H A Dturing.go19 for nest := dir; dir*nest > 0; pc += dir {
22 nest--
24 nest++
/haiku-buildtools/gcc/gcc/
H A Dgraphite-interchange.c408 lst_interchange_profitable_p (lst_p nest, int depth1, int depth2) argument
418 memory_strides_in_loop (nest, depth1, d1);
419 memory_strides_in_loop (nest, depth2, d2);
477 /* Return true when the nest starting at LOOP1 and ending on LOOP2 is
493 /* Transform the loop nest between LOOP1 and LOOP2 into a perfect
494 nest. To continue the naming tradition, this function is called
501 lst_p *nest, lst_p *after)
513 *nest = copy_lst (loop1);
519 lst_remove_all_before_excluding_pbb (*nest, first, true);
520 lst_remove_all_before_excluding_pbb (*nest, las
500 lst_perfect_nestify(lst_p loop1, lst_p loop2, lst_p *before, lst_p *nest, lst_p *after) argument
550 lst_p before = NULL, nest = NULL, after = NULL; local
[all...]
H A Dgenhooks.c296 int print_nest, nest = 0; local
311 if (nest && nest == print_nest)
313 nest++;
314 if (nest > MAX_NEST)
316 if (nest == print_nest)
321 if (nest == print_nest)
323 nest--;
333 if (nest == print_nest)
H A Dsese.c502 generated loop nest. */
621 struct loop *nest;
623 nest = bb->loop_father;
624 while (loop_outer (nest)
625 && loop_in_sese_p (loop_outer (nest), region))
626 nest = loop_outer (nest);
628 return nest;
618 struct loop *nest; local
H A Dgraphite-sese-to-poly.c324 loop_p nest = outermost_loop_in_sese (region, bb); local
326 if (loop_in_sese_p (nest, region))
327 return nest;
331 nest = nest->inner;
332 while (nest)
333 if (loop_in_sese_p (nest, region))
336 nest = nest->next;
338 gcc_assert (nest);
351 loop_p nest = outermost_loop_in_sese_1 (region, bb); local
1979 loop_p nest; local
2991 loop_p nest = loop_containing_stmt (SSA_NAME_DEF_STMT (arg)); local
[all...]
H A Dtree-ssa-loop-prefetch.c590 only when the step is loop invariant in the entire loop nest. */
1423 nest. */
1451 of the loops in the nest (length of VEC and LOOP_SIZES vectors). */
1474 of the considered loop nest, and, LOOP is its innermost loop. */
1507 loops. LOOP is the innermost loop of the current loop nest. */
1577 in the loop nest of LOOP. NO_OTHER_REFS is true if there are no other
1584 struct loop *nest, *aloop; local
1600 /* Find the outermost loop of the loop nest of loop (we require that
1601 there are no sibling loops inside the nest). */
1602 nest
[all...]
H A Dtree-data-ref.c480 fprintf (outf, " loop nest: (");
551 considered nest. */
790 dr_analyze_innermost (struct data_reference *dr, struct loop *nest)
836 nest ? true : false))
838 if (nest)
874 nest ? true : false))
876 if (nest)
916 DR, analyzed in LOOP and instantiated in loop nest NEST. */
919 dr_analyze_indices (struct data_reference *dr, loop_p nest, loop_p loop)
928 if (!nest)
789 dr_analyze_innermost(struct data_reference *dr, struct loop *nest) argument
918 dr_analyze_indices(struct data_reference *dr, loop_p nest, loop_p loop) argument
1088 create_data_ref(loop_p nest, loop_p loop, tree memref, gimple stmt, bool is_read) argument
4536 find_data_references_in_stmt(struct loop *nest, gimple stmt, vec<data_reference_p> *datarefs) argument
4566 graphite_find_data_references_in_stmt(loop_p nest, loop_p loop, gimple stmt, vec<data_reference_p> *datarefs) argument
[all...]
H A Dipa-inline.c1210 loop nest and overall size growth, so we optimize for overall number
1214 int nest = MIN (inline_edge_summary (edge)->loop_depth, 8); local
1219 badness = badness >> nest;
1221 badness = badness << nest;
1223 fprintf (dump_file, " %f: no profile. nest %i\n",
1224 badness.to_double (), nest);
/haiku-buildtools/legacy/binutils/bfd/
H A Dstabs.c298 int nest;
306 nest = 0;
321 if (nest == 0)
323 --nest;
326 ++nest;
327 else if (nest == 0)
412 nest = 0;
423 if (nest == 0)
429 --nest;
432 ++nest;
296 int nest; local
[all...]
H A Dpdp11.c4318 int nest;
4323 nest = 0;
4331 if (nest == 0)
4333 --nest;
4336 ++nest;
4337 else if (nest == 0)
4389 nest = 0;
4399 if (nest == 0)
4404 --nest;
4407 ++nest;
4309 int nest; local
[all...]
H A Daoutx.h5029 int nest;
5034 nest = 0;
5042 if (nest == 0)
5044 --nest;
5047 ++nest;
5048 else if (nest == 0)
5100 nest = 0;
5110 if (nest == 0)
5115 --nest;
5118 ++nest;
[all...]
/haiku-buildtools/binutils/bfd/
H A Dstabs.c301 int nest;
309 nest = 0;
324 if (nest == 0)
326 --nest;
329 ++nest;
330 else if (nest == 0)
417 nest = 0;
428 if (nest == 0)
434 --nest;
437 ++nest;
299 int nest; local
[all...]
H A Dpdp11.c4331 int nest;
4336 nest = 0;
4344 if (nest == 0)
4346 --nest;
4349 ++nest;
4350 else if (nest == 0)
4402 nest = 0;
4412 if (nest == 0)
4417 --nest;
4420 ++nest;
4322 int nest; local
[all...]
H A Daoutx.h5166 int nest;
5171 nest = 0;
5179 if (nest == 0)
5181 --nest;
5184 ++nest;
5185 else if (nest == 0)
5238 nest = 0;
5248 if (nest == 0)
5253 --nest;
5256 ++nest;
5157 int nest; local
[all...]
/haiku-buildtools/jam/
H A Dscan.c238 int nest = 1; local
243 nest++;
245 if( c == '}' && !--nest )
266 if( nest )
/haiku-buildtools/legacy/binutils/binutils/
H A Dsrconv.c582 struct coff_scope *scope, int type, int nest)
600 nest,
611 dps.nesting = nest;
635 struct coff_type *type, int nest)
707 walk_tree_type_1 (sfile, symbol, type->u.pointer.points_to, nest + 1);
723 walk_tree_type_1 (sfile, symbol, type->u.function.function_returns, nest + 1);
730 walk_tree_symbol (sfile, 0, param, nest);
758 walk_tree_symbol (sfile, 0, member, nest + 1);
814 walk_tree_type_1 (sfile, symbol, type->u.array.array_of, nest + 1);
841 walk_tree_symbol (sfile, 0, member, nest
580 wr_dps_start(struct coff_sfile *sfile, struct coff_section *section ATTRIBUTE_UNUSED, struct coff_scope *scope, int type, int nest) argument
634 walk_tree_type_1(struct coff_sfile *sfile, struct coff_symbol *symbol, struct coff_type *type, int nest) argument
906 walk_tree_type(struct coff_sfile *sfile, struct coff_symbol *symbol, struct coff_type *type, int nest) argument
953 walk_tree_symbol(struct coff_sfile *sfile, struct coff_section *section ATTRIBUTE_UNUSED, struct coff_symbol *symbol, int nest) argument
1167 walk_tree_scope(struct coff_section *section, struct coff_sfile *sfile, struct coff_scope *scope, int nest, int type) argument
[all...]
H A Dstabs.c1268 int nest = 0; local
1273 ++nest;
1275 --nest;
1276 else if (*q2 == ':' && nest == 0)
/haiku-buildtools/binutils/binutils/
H A Dsrconv.c549 struct coff_scope *scope, int type, int nest)
567 nest,
578 dps.nesting = nest;
602 struct coff_type *type, int nest)
675 walk_tree_type_1 (sfile, symbol, type->u.pointer.points_to, nest + 1);
691 walk_tree_type_1 (sfile, symbol, type->u.function.function_returns, nest + 1);
698 walk_tree_symbol (sfile, 0, param, nest);
726 walk_tree_symbol (sfile, 0, member, nest + 1);
782 walk_tree_type_1 (sfile, symbol, type->u.array.array_of, nest + 1);
809 walk_tree_symbol (sfile, 0, member, nest
547 wr_dps_start(struct coff_sfile *sfile, struct coff_section *section ATTRIBUTE_UNUSED, struct coff_scope *scope, int type, int nest) argument
601 walk_tree_type_1(struct coff_sfile *sfile, struct coff_symbol *symbol, struct coff_type *type, int nest) argument
874 walk_tree_type(struct coff_sfile *sfile, struct coff_symbol *symbol, struct coff_type *type, int nest) argument
921 walk_tree_symbol(struct coff_sfile *sfile, struct coff_section *section ATTRIBUTE_UNUSED, struct coff_symbol *symbol, int nest) argument
1135 walk_tree_scope(struct coff_section *section, struct coff_sfile *sfile, struct coff_scope *scope, int nest, int type) argument
[all...]
H A Dstabs.c1282 int nest = 0; local
1287 ++nest;
1289 --nest;
1290 else if (*q2 == ':' && nest == 0)
/haiku-buildtools/isl/
H A Disl_space.c1109 isl_space *ran, *dom1, *dom2, *nest; local
1125 nest = isl_space_wrap(isl_space_join(isl_space_reverse(dom1), dom2));
1127 return isl_space_join(isl_space_reverse(nest), ran);
1137 isl_space *dom, *ran1, *ran2, *nest; local
1152 nest = isl_space_wrap(isl_space_join(isl_space_reverse(ran1), ran2));
1154 return isl_space_join(isl_space_reverse(dom), nest);
/haiku-buildtools/gcc/gcc/fortran/
H A Dtrans-decl.c796 create_index_var (const char * pfx, int nest) argument
801 if (nest)
818 int nest; local
829 nest = (procns->proc_name->backend_decl != current_function_decl)
881 GFC_TYPE_ARRAY_LBOUND (type, dim) = create_index_var ("lbound", nest);
889 GFC_TYPE_ARRAY_UBOUND (type, dim) = create_index_var ("ubound", nest);
895 GFC_TYPE_ARRAY_STRIDE (type, dim) = create_index_var ("stride", nest);
904 GFC_TYPE_ARRAY_LBOUND (type, dim) = create_index_var ("lbound", nest);
911 GFC_TYPE_ARRAY_UBOUND (type, dim) = create_index_var ("ubound", nest);
921 if (nest)
[all...]
/haiku-buildtools/gcc/gcc/go/gofrontend/
H A Dparse.cc1151 int nest = 0; local
1155 ++nest;
1158 --nest;
1159 if (nest < 0)

Completed in 331 milliseconds