/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/noncompile/ |
H A D | label-1.c | 82 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...] |
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.dg/noncompile/ |
H A D | label-1.c | 82 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...] |
/netbsd-6-1-5-RELEASE/sys/arch/hpc/hpc/platid_gen/ |
H A D | platid_gen.c | 86 int nest; variable 178 nest = -1; 181 genctx[MODE_CPU][nest].alt = NULL; 182 genctx[MODE_MACHINE][nest].alt = NULL; 229 nest++; 230 if (MAXNEST <= nest) { 231 fprintf(stderr, "too much nest\n"); 234 genctx[mode][nest].num = 0; 235 genctx[mode][nest].alt = NULL; 236 genctx[mode][nest] 263 gen_name(char *buf, struct genctx_t ctx[], int nest, int name, char *punct, int ignr) argument [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/less/dist/ |
H A D | brac.c | 37 register int nest; local 84 nest = 0; 88 nest++; 89 else if (c == cbrac && --nest < 0)
|
/netbsd-6-1-5-RELEASE/sys/arch/hpc/hpc/ |
H A D | platid.awk | 70 mode_name[mode], nm, saved_name, shifts[mode, nest]) > out_h 71 if (nest) { 73 for (i = 0; i < nest; i++) { 130 nest = 0 189 if (nest != 0) { 233 nms[nest] = nm 234 enums[nest] = enumerator[mode] 235 names[nest] = saved_name 236 cpus[nest] = saved_cpu 238 if (nest [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | graphite-interchange.c | 531 /* Return true when the nest starting at LOOP1 and ending on LOOP2 is 547 /* Transform the loop nest between LOOP1 and LOOP2 into a perfect 548 nest. To continue the naming tradition, this function is called 555 lst_p *nest, lst_p *after) 567 *nest = copy_lst (loop1); 573 lst_remove_all_before_excluding_pbb (*nest, first, true); 574 lst_remove_all_before_excluding_pbb (*nest, last, false); 586 if (lst_empty_p (*nest)) 588 free_lst (*nest); 589 *nest 554 lst_perfect_nestify(lst_p loop1, lst_p loop2, lst_p *before, lst_p *nest, lst_p *after) argument 604 lst_p before = NULL, nest = NULL, after = NULL; local [all...] |
H A D | tree-loop-linear.c | 58 considered. The first loop in the considered loop nest is 171 nest. */ 196 know that it is no worth looking at this loop nest: give up. */ 283 /* If it's not a loop nest, we don't want it. We also don't handle 339 VEC(loop_p,heap) *nest; 345 nest = VEC_alloc (loop_p, heap, 3); 347 VEC_safe_push (loop_p, heap, nest, loop); 361 if (!lambda_compute_access_matrices (datarefs, lambda_parameters, nest)) 420 VEC_free (loop_p, heap, nest);
|
H A D | lambda-code.c | 48 /* This loop nest code generation is based on non-singular matrix 80 nest . U = auxiliary space) , which has two important properties: 328 /* Create a new loop nest structure with DEPTH loops, and INVARIANTS as the 350 print_lambda_loopnest (FILE * outfile, lambda_loopnest nest, char start) argument 353 for (i = 0; i < LN_DEPTH (nest); i++) 356 print_lambda_loop (outfile, LN_LOOPS (nest)[i], LN_DEPTH (nest), 357 LN_INVARIANTS (nest), 'i'); 386 lambda_lattice_compute_base (lambda_loopnest nest, argument 397 depth = LN_DEPTH (nest); 638 lambda_compute_auxillary_space(lambda_loopnest nest, lambda_trans_matrix trans, struct obstack * lambda_obstack) argument 1039 lambda_loopnest_transform(lambda_loopnest nest, lambda_trans_matrix trans, struct obstack * lambda_obstack) argument 1191 depth_of_nest(struct loop *nest) argument 2803 build_access_matrix(data_reference_p data_reference, VEC (tree, heap) *parameters, VEC (loop_p, heap) *nest) argument [all...] |
H A D | tree-ssa-loop-prefetch.c | 1204 nest. */ 1232 of the loops in the nest (length of VEC and LOOP_SIZES vectors). */ 1255 of the considered loop nest, and, LOOP is its innermost loop. */ 1288 loops. LOOP is the innermost loop of the current loop nest. */ 1358 in the loop nest of LOOP. NO_OTHER_REFS is true if there are no other 1365 struct loop *nest, *aloop; local 1381 /* Find the outermost loop of the loop nest of loop (we require that 1382 there are no sibling loops inside the nest). */ 1383 nest = loop; 1386 aloop = loop_outer (nest); [all...] |
H A D | sese.c | 1451 struct loop *nest; 1453 nest = bb->loop_father; 1454 while (loop_outer (nest) 1455 && loop_in_sese_p (loop_outer (nest), region)) 1456 nest = loop_outer (nest); 1458 return nest; 1449 struct loop *nest; local
|
H A D | ipa-inline.c | 211 /* Scale frequency of NODE edges by FREQ_SCALE and increase loop nest 216 int freq_scale, int nest) 220 /* We do not want to ignore high loop nest after freq drops to 0. */ 225 e->loop_nest += nest; 230 update_noncloned_frequencies (e->callee, freq_scale, nest); 512 once in the single recursion nest path in the inline graph. */ 634 loop nest and overall size growth, so we optimize for overall number 638 int nest = MIN (edge->loop_nest, 8); local 643 badness >>= nest; local 646 badness <<= nest; local 215 update_noncloned_frequencies(struct cgraph_node *node, int freq_scale, int nest) argument [all...] |
H A D | lto-cgraph.c | 671 unsigned int nest; local 691 nest = (unsigned) bp_unpack_value (bp, 30); 700 edge = cgraph_create_edge (caller, callee, NULL, count, freq, nest);
|
H A D | tree-data-ref.c | 425 fprintf (outf, " loop nest: ("); 492 considered nest. */ 817 DR, analyzed in loop nest NEST. */ 820 dr_analyze_indices (struct data_reference *dr, struct loop *nest) 829 if (nest) 830 before_loop = block_before_loop (nest); 837 if (nest) 850 if (nest && INDIRECT_REF_P (aref)) 911 loop nest in that the reference should be analyzed. */ 914 create_data_ref (struct loop *nest, tre 819 dr_analyze_indices(struct data_reference *dr, struct loop *nest) argument 913 create_data_ref(struct loop *nest, tree memref, gimple stmt, bool is_read) argument 4155 find_data_references_in_stmt(struct loop *nest, gimple stmt, VEC (data_reference_p, heap) **datarefs) argument 4198 graphite_find_data_references_in_stmt(struct loop *nest, gimple stmt, VEC (data_reference_p, heap) **datarefs) argument [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/bfd/ |
H A D | stabs.c | 301 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 D | pdp11.c | 4327 int nest; 4332 nest = 0; 4340 if (nest == 0) 4342 --nest; 4345 ++nest; 4346 else if (nest == 0) 4398 nest = 0; 4408 if (nest == 0) 4413 --nest; 4416 ++nest; 4318 int nest; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/bfd/ |
H A D | stabs.c | 301 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 D | pdp11.c | 4329 int nest; 4334 nest = 0; 4342 if (nest == 0) 4344 --nest; 4347 ++nest; 4348 else if (nest == 0) 4400 nest = 0; 4410 if (nest == 0) 4415 --nest; 4418 ++nest; 4320 int nest; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/binutils/ |
H A D | srconv.c | 587 struct coff_scope *scope, int type, int nest) 605 nest, 616 dps.nesting = nest; 640 struct coff_type *type, int nest) 713 walk_tree_type_1 (sfile, symbol, type->u.pointer.points_to, nest + 1); 729 walk_tree_type_1 (sfile, symbol, type->u.function.function_returns, nest + 1); 736 walk_tree_symbol (sfile, 0, param, nest); 764 walk_tree_symbol (sfile, 0, member, nest + 1); 820 walk_tree_type_1 (sfile, symbol, type->u.array.array_of, nest + 1); 847 walk_tree_symbol (sfile, 0, member, nest 585 wr_dps_start(struct coff_sfile *sfile, struct coff_section *section ATTRIBUTE_UNUSED, struct coff_scope *scope, int type, int nest) argument 639 walk_tree_type_1(struct coff_sfile *sfile, struct coff_symbol *symbol, struct coff_type *type, int nest) argument 912 walk_tree_type(struct coff_sfile *sfile, struct coff_symbol *symbol, struct coff_type *type, int nest) argument 959 walk_tree_symbol(struct coff_sfile *sfile, struct coff_section *section ATTRIBUTE_UNUSED, struct coff_symbol *symbol, int nest) argument 1173 walk_tree_scope(struct coff_section *section, struct coff_sfile *sfile, struct coff_scope *scope, int nest, int type) argument [all...] |
/netbsd-6-1-5-RELEASE/bin/ksh/ |
H A D | tree.c | 559 register int nest = 0; local 578 nest++; 584 if (c == CSUBST && nest == 0) 586 nest--; 590 nest++; 595 if (c == wp[-1] && nest == 0) 598 nest--;
|
H A D | misc.c | 580 int nest = 0, bnest = 0; local 610 nest++; 618 } else if (nest) 619 nest--; 624 return saw_glob && !in_bracket && !nest; 816 int nest = 0; local 821 if ((*++p == /*(*/ ')' && nest-- == 0) 822 || (*p == '|' && match_sep && nest == 0)) 825 nest++;
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
H A D | lambda-code.c | 45 /* This loop nest code generation is based on non-singular matrix 77 nest . U = auxiliary space) , which has two important properties: 327 /* Create a new loop nest structure with DEPTH loops, and INVARIANTS as the 347 print_lambda_loopnest (FILE * outfile, lambda_loopnest nest, char start) argument 350 for (i = 0; i < LN_DEPTH (nest); i++) 353 print_lambda_loop (outfile, LN_LOOPS (nest)[i], LN_DEPTH (nest), 354 LN_INVARIANTS (nest), 'i'); 383 lambda_lattice_compute_base (lambda_loopnest nest) argument 393 depth = LN_DEPTH (nest); 670 lambda_compute_auxillary_space(lambda_loopnest nest, lambda_trans_matrix trans) argument 1066 lambda_loopnest_transform(lambda_loopnest nest, lambda_trans_matrix trans) argument 1213 depth_of_nest(struct loop *nest) argument [all...] |
H A D | ipa-inline.c | 324 once in the single recursion nest path in the inline graph. */ 382 int nest = MIN (edge->loop_nest, 8); local 387 badness >>= nest; local 389 badness <<= nest; local
|
/netbsd-6-1-5-RELEASE/usr.bin/unifdef/ |
H A D | unifdef.c | 254 static void nest(void); 434 static void Fdrop (void) { nest(); Dfalse(); } 435 static void Fpass (void) { nest(); Pelif(); } 436 static void Ftrue (void) { nest(); Strue(); } 437 static void Ffalse(void) { nest(); Sfalse(); } 535 nest(void) function
|
/netbsd-6-1-5-RELEASE/sys/netipsec/ |
H A D | ipsec_input.c | 610 int error, nest; local 766 nest = 0; 769 if (ip6_hdrnestlimit && (++nest > ip6_hdrnestlimit)) {
|
/netbsd-6-1-5-RELEASE/external/gpl2/xcvs/dist/lib/ |
H A D | regcomp.c | 63 Idx nest, reg_errcode_t *err); 66 Idx nest, reg_errcode_t *err); 69 Idx nest, reg_errcode_t *err); 72 Idx nest, reg_errcode_t *err); 2101 reg_syntax_t syntax, Idx nest, reg_errcode_t *err) 2105 tree = parse_branch (regexp, preg, token, syntax, nest, err); 2113 && (nest == 0 || token->type != OP_CLOSE_SUBEXP)) 2115 branch = parse_branch (regexp, preg, token, syntax, nest, err); 2142 reg_syntax_t syntax, Idx nest, reg_errcode_t *err) 2146 tree = parse_expression (regexp, preg, token, syntax, nest, er 2091 parse_reg_exp(re_string_t *regexp, regex_t *preg, re_token_t *token, reg_syntax_t syntax, Idx nest, reg_errcode_t *err) argument 2132 parse_branch(re_string_t *regexp, regex_t *preg, re_token_t *token, reg_syntax_t syntax, Idx nest, reg_errcode_t *err) argument 2172 parse_expression(re_string_t *regexp, regex_t *preg, re_token_t *token, reg_syntax_t syntax, Idx nest, reg_errcode_t *err) argument 2388 parse_sub_exp(re_string_t *regexp, regex_t *preg, re_token_t *token, reg_syntax_t syntax, Idx nest, reg_errcode_t *err) argument [all...] |