/freebsd-10.3-release/contrib/gcc/ |
H A D | tree-vn.c | 164 if (VEC_length (tree, ve1->vuses) != VEC_length (tree, ve2->vuses)) 231 if (VEC_length (tree, shared_lookup_vuses) > 1) 337 if (vuses && VEC_length (tree, vuses) != 0) 346 if (VEC_length (tree, vuses) - 1 != i) 389 if (VEC_length (tree, vuses) > 1) 391 VEC_length (tree, vuses),
|
H A D | tree-data-ref.h | 122 #define DR_NUM_DIMENSIONS(DR) VEC_length (tree, DR_ACCESS_FNS (DR)) 252 #define DDR_NUM_SUBSCRIPTS(DDR) VEC_length (subscript_p, DDR_SUBSCRIPTS (DDR)) 257 #define DDR_NB_LOOPS(DDR) (VEC_length (loop_p, DDR_LOOP_NEST (DDR))) 262 (VEC_length (lambda_vector, DDR_DIST_VECTS (DDR))) 264 (VEC_length (lambda_vector, DDR_DIR_VECTS (DDR)))
|
H A D | tree-ssa-operands.c | 184 int num = VEC_length (tree, list); 204 VEC_length (tree, list), 473 while (old_ops && new_i < VEC_length (tree, build_defs)) 498 for ( ; new_i < VEC_length (tree, build_defs); new_i++) 520 gcc_assert (x == VEC_length (tree, build_defs)); 530 unsigned int num = VEC_length (tree, build_defs); 566 for (new_i = 0; new_i < VEC_length (tree, build_uses); new_i++) 580 gcc_assert (x == VEC_length (tree, build_uses)); 593 unsigned num = VEC_length (tree, build_uses); 626 while (old_ops && new_i < VEC_length (tre [all...] |
H A D | tree-ssa-reassoc.c | 460 if (VEC_length (operand_entry_t, *ops) == 2) 597 += VEC_length (operand_entry_t, *ops) - 1; 628 if (VEC_length (operand_entry_t, *ops) != 1) 634 += VEC_length (operand_entry_t, *ops) - 1; 644 if (VEC_length (operand_entry_t, *ops) != 1) 656 if (VEC_length (operand_entry_t, *ops) != 1) 662 += VEC_length (operand_entry_t, *ops) - 1; 672 if (VEC_length (operand_entry_t, *ops) != 1) 684 if (VEC_length (operand_entry_t, *ops) != 1) 690 += VEC_length (operand_entry_ [all...] |
H A D | genextract.c | 119 op_count = VEC_length (locstr, acc.oplocs); 120 dup_count = VEC_length (locstr, acc.duplocs); 121 gcc_assert (dup_count == VEC_length (int, acc.dupnums)); 190 if (ix < VEC_length (locstr, *vp)) 197 while (ix > VEC_length (locstr, *vp)) 208 size_t n = VEC_length (char, v);
|
H A D | tree-ssa-propagate.c | 192 if (cfg_blocks_num > VEC_length (basic_block, cfg_blocks)) 199 cfg_blocks_tail = VEC_length (basic_block, cfg_blocks); 210 % VEC_length (basic_block, cfg_blocks)); 214 cfg_blocks_head = VEC_length (basic_block, cfg_blocks); 240 % VEC_length (basic_block, cfg_blocks)); 368 while (VEC_length (tree, *worklist) > 0) 693 || VEC_length (tree, interesting_ssa_edges) > 0 694 || VEC_length (tree, varying_ssa_edges) > 0)
|
H A D | domwalk.c | 171 if (VEC_length (void_p, walk_data->free_block_data) > 0) 282 while (VEC_length (void_p, walk_data->free_block_data) > 0)
|
H A D | tree-ssa-structalias.c | 485 #define FIRST_REF_NODE (VEC_length (varinfo_t, varmap)) 674 if (place >= VEC_length (constraint_t, vec)) 789 if (place >= VEC_length (constraint_t, complex) 961 graph->size = (VEC_length (varinfo_t, varmap)) * 3; 965 graph->indirect_cycles = XNEWVEC (int, VEC_length (varinfo_t, varmap)); 970 VEC_length (varinfo_t, varmap)); 986 for (j = 0; j < VEC_length (varinfo_t, varmap); j++) 1159 if (VEC_length (unsigned, si->scc_stack) > 0 1169 while (VEC_length (unsigned, si->scc_stack) != 0 1281 size_t size = VEC_length (varinfo_ [all...] |
H A D | genautomata.c | 3241 VEC_length (alt_state_t, alt_states), 3245 for (i = 1; i < VEC_length (alt_state_t, alt_states); i++) 3255 for (i = 1; i < VEC_length (alt_state_t, alt_states); i++) 4954 while (VEC_length (unit_usage_t, cycle_alt_unit_usages) < length) 5049 for (i = 0; i < (int) VEC_length (unit_usage_t, cycle_alt_unit_usages); i++) 5059 k < (int) VEC_length (unit_usage_t, cycle_alt_unit_usages) 5075 if (k < (int) VEC_length (unit_usage_t, cycle_alt_unit_usages) 5288 for (i = 0; i < VEC_length (ainsn_t, last_insns); i++) 5294 if (i < VEC_length (ainsn_t, last_insns)) 5361 while (VEC_length (state_ [all...] |
H A D | tree-outof-ssa.c | 262 return VEC_length (tree, g->nodes); 299 for (x = 0; x < VEC_length (int, g->edge_list); x += 2) 319 for (x_ = 0; x_ < VEC_length (int, (GRAPH)->edge_list); x_ += 2) \ 338 for (x_ = 0; x_ < VEC_length (int, (GRAPH)->edge_list); x_ += 2) \ 501 gcc_assert (VEC_length (tree, g->const_copies) == 0); 526 while (VEC_length (int, g->stack) > 0) 535 while (VEC_length (tree, g->const_copies) > 0) 2156 gcc_assert (VEC_length (edge, edge_leader) == 0); 2157 gcc_assert (VEC_length (tree, stmt_list) == 0);
|
H A D | c-pragma.c | 630 = VEC_length (visibility, visstack) != 0; 659 if (!VEC_length (visibility, visstack)) 747 id = VEC_length (pragma_handler, registered_pragmas);
|
H A D | tree-loop-linear.c | 181 if (VEC_length (ddr_p, dependence_relations) == 0)
|
H A D | tree-into-ssa.c | 271 unsigned len = VEC_length (ssa_name_info_p, info_for_ssa_name); 916 top = VEC_index (int, worklist, VEC_length (int, worklist) - 1); 1031 while (VEC_length (int, work_stack) > 0) 1106 for (i = VEC_length (tree_vec, phis_to_rewrite); i <= idx; i++) 1430 while (VEC_length (tree, block_defs_stack) > 0) 1696 while (VEC_length (tree, block_defs_stack) > 0)
|
H A D | tree-ssa-dce.c | 486 while (VEC_length (tree, worklist) > 0) 616 while (VEC_length (tree, worklist) > 0)
|
H A D | tree-ssa-threadedge.c | 119 while (VEC_length (tree, *stack) > 0)
|
H A D | loop-invariant.c | 493 htab_t eq = htab_create (VEC_length (invariant_p, invariants), 652 inv->invno = VEC_length (invariant_p, invariants); 1077 if (!VEC_length (invariant_p, invariants))
|
H A D | profile.c | 175 for (i = 0; i < VEC_length (histogram_value, values); i++) 625 for (i = 0; i < VEC_length (histogram_value, values); i++) 650 for (i = 0; i < VEC_length (histogram_value, values); i++)
|
H A D | function.c | 559 if (level >= (int) VEC_length (temp_slot_p, used_temp_slots)) 561 size_t old_length = VEC_length (temp_slot_p, used_temp_slots); 581 return VEC_length (temp_slot_p, used_temp_slots) - 1; 3945 gcc_assert (VEC_length (int, prologue) == 0); 3946 gcc_assert (VEC_length (int, epilogue) == 0); 3947 gcc_assert (VEC_length (int, sibcall_epilogue) == 0); 4673 for (j = VEC_length (int, *vec) - 1; j >= 0; --j) 4681 for (j = VEC_length (int, *vec) - 1; j >= 0; --j) 5599 if ((len = VEC_length (int, prologue)) > 0) 5640 if ((len = VEC_length (in [all...] |
H A D | cfglayout.c | 429 int max = VEC_length (int, block_locators_locs); 469 int max = VEC_length (int, line_locators_locs); 503 int max = VEC_length (int, file_locators_locs);
|
H A D | alias.c | 222 (REGNO (X) < VEC_length (rtx, reg_base_value) \ 639 return VEC_length (alias_set_entry, alias_sets) - 1; 821 && regno < VEC_length (rtx, reg_base_value)) 974 gcc_assert (regno < VEC_length (rtx, reg_base_value)); 2440 sizeof (rtx) * VEC_length (rtx, reg_base_value));
|
H A D | tree-ssa-alias.c | 246 VEC_length (tree, taglist), 415 while (VEC_length (tree, worklist) != 0) 1596 gcc_assert (VEC_length (tree, ann->may_aliases) == 1); 2753 && (VEC_length (tree, aliases) == 1)) 2820 len = VEC_length (tree, overlaps); 3008 if (VEC_length (fieldoff_s, fieldstack) != 0) 3076 for (i = VEC_length (fieldoff_s, fieldstack);
|
H A D | tree-vect-analyze.c | 1217 || VEC_length (tree, 1250 if (VEC_length (tree, LOOP_VINFO_MAY_MISALIGN_STMTS (loop_vinfo)) == 0) 1667 while (VEC_length (tree, worklist) > 0)
|
H A D | tree-cfgcleanup.c | 169 while (VEC_length (tree, modified_noreturn_calls))
|
/freebsd-10.3-release/contrib/gcc/cp/ |
H A D | typeck2.c | 320 if (VEC_length (tree, pure)) 811 gcc_assert (VEC_length (constructor_elt, v) <= len); 907 if (idx < VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init))) 991 gcc_assert (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)) == 1);
|
H A D | decl2.c | 654 if (VEC_length (tree, methods) > (size_t) ++ix) 3201 for (i = VEC_length (tree, unemitted_tinfo_decls); 3359 if (VEC_length (tree, pending_statics) != 0 3361 VEC_length (tree, pending_statics))) 3440 if (VEC_length (tree, pending_statics) != 0) 3443 VEC_length (tree, pending_statics)); 3445 VEC_length (tree, pending_statics));
|