Home
last modified time | relevance | path

Searched refs:TREE_VEC_LENGTH (Results 1 – 25 of 39) sorted by relevance

12

/netbsd/src/external/gpl3/gcc/dist/gcc/cp/
Dpt.cc477 begin_scope (TREE_VEC_LENGTH (parms) ? sk_template_parms : sk_template_spec, in push_inline_template_parms_recursive()
479 for (i = 0; i < TREE_VEC_LENGTH (parms); ++i) in push_inline_template_parms_recursive()
623 TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args); in add_outermost_template_args()
628 TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args); in add_outermost_template_args()
1210 for (int i = 0; i < TREE_VEC_LENGTH (inner); ++i) in verify_unstripped_args_1()
1820 for (int i = 0, len = TREE_VEC_LENGTH (arg); i < len; ++i) in iterative_hash_template_arg()
2276 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn)) in determine_specialization()
2277 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS in determine_specialization()
3352 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2)) in comp_template_parms()
3355 for (i = 0; i < TREE_VEC_LENGTH (t2); ++i) in comp_template_parms()
[all …]
Dconstraint.cc556 for (int i = 0; i < TREE_VEC_LENGTH (args); ++i) in debug_argument_list()
1145 TREE_VEC_LENGTH (outer_gtargs) = extra_levels; in associate_classtype_constraints()
1312 int n = rest ? TREE_VEC_LENGTH (rest) : 0; in build_concept_check_arguments()
1560 for (int i = 0; i < TREE_VEC_LENGTH (parms); ++i) in get_shorthand_constraints()
1694 gcc_assert (index == TREE_VEC_LENGTH (wildcards)); in introduce_template_parameters()
1698 for (int i = 0; i < TREE_VEC_LENGTH (args); ++i) in introduce_template_parameters()
1740 if (TREE_VEC_LENGTH (intros) < TREE_VEC_LENGTH (parms)) in check_introduction_list()
1785 int nargs = MIN (TREE_VEC_LENGTH (parms), TREE_VEC_LENGTH (intro_list)); in finish_template_introduction()
1792 nargs = TREE_VEC_LENGTH (parm_list); in finish_template_introduction()
1795 for (int i = 0; i < TREE_VEC_LENGTH (parm_list); ++i) in finish_template_introduction()
[all …]
Dcxx-pretty-print.cc1226 int i, len = TREE_VEC_LENGTH (args); in expression()
1622 len = TREE_VEC_LENGTH (argpack); in pp_cxx_exception_specification()
1897 int len = TREE_VEC_LENGTH (args); in type_id()
1934 for (i = 0; i < TREE_VEC_LENGTH (t); ++i) in pp_cxx_template_argument_list()
1943 len = TREE_VEC_LENGTH (argpack); in pp_cxx_template_argument_list()
2224 const int n = TREE_VEC_LENGTH (t); in pp_cxx_template_parameter_list()
2315 tree args = make_tree_vec (TREE_VEC_LENGTH (a) - 1); in pp_cxx_constrained_type_spec()
2316 for (int i = 0; i < TREE_VEC_LENGTH (a) - 1; ++i) in pp_cxx_constrained_type_spec()
Dcp-lang.cc185 vec_len = TREE_VEC_LENGTH (elems); in fold_cplus_constants()
Dmangle.cc557 TREE_VEC_LENGTH (args) == 1 in is_std_substitution_char()
637 if (TREE_VEC_LENGTH (args) == 3 in find_substitution()
661 if (TREE_VEC_LENGTH (args) == 2 in find_substitution()
2900 length = TREE_VEC_LENGTH (args); in write_template_args()
2907 length = TREE_VEC_LENGTH (args); in write_template_args()
3145 int length = TREE_VEC_LENGTH (args); in write_expression()
3769 int i, length = TREE_VEC_LENGTH (args); in write_template_arg()
Dsemantics.cc10352 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv)); in finish_omp_for()
10353 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv)); in finish_omp_for()
10354 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv)); in finish_omp_for()
10355 if (TREE_VEC_LENGTH (declv) > 1) in finish_omp_for()
10367 if (collapse != TREE_VEC_LENGTH (declv)) in finish_omp_for()
10368 ordered = TREE_VEC_LENGTH (declv); in finish_omp_for()
10371 for (i = 0; i < TREE_VEC_LENGTH (declv); i++) in finish_omp_for()
10450 for (i = 0; i < TREE_VEC_LENGTH (declv); i++) in finish_omp_for()
10476 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv)); in finish_omp_for()
10478 for (i = 0; i < TREE_VEC_LENGTH (declv); ) in finish_omp_for()
[all …]
Derror.cc285 int n = TREE_VEC_LENGTH (INNERMOST_TEMPLATE_ARGS (args)); in get_non_default_template_args_count()
318 || TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg)) > 0)) in dump_template_argument_list()
422 for (i = 0; i < TREE_VEC_LENGTH (p); ++i) in dump_template_bindings()
1508 int len = TREE_VEC_LENGTH (inner_parms); in dump_template_decl()
1832 for (i = 0; i < TREE_VEC_LENGTH (template_args); ++i) in dump_function_decl()
2035 || TREE_VEC_LENGTH (ARGUMENT_PACK_ARGS (arg)) > 0)) in dump_template_parms()
2051 len = parms ? TREE_VEC_LENGTH (parms) : 0; in dump_template_parms()
Dcp-gimplify.cc1068 n = TREE_VEC_LENGTH (x); in cp_fold_r()
1079 n = TREE_VEC_LENGTH (x); in cp_fold_r()
1716 for (int i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (inner)); i++) in cp_genericize_r()
2970 int n = TREE_VEC_LENGTH (x); in cp_fold()
Dtree.cc1743 for (int i = 0; i < TREE_VEC_LENGTH (args); ++i) in strip_typedefs()
1955 n = TREE_VEC_LENGTH (t); in strip_typedefs_expr()
4201 int len = TREE_VEC_LENGTH (p1); in cp_tree_equal()
4202 if (TREE_VEC_LENGTH (p2) != len) in cp_tree_equal()
5452 int i, len = TREE_VEC_LENGTH (args); in cp_walk_subtrees()
Dcp-tree.h3745 : TREE_VEC_LENGTH (INNERMOST_TEMPLATE_ARGS (NODE))
3778 (NODE && TREE_VEC_LENGTH (NODE) && TREE_VEC_ELT (NODE, 0) \
3788 : TMPL_ARGS_HAVE_MULTIPLE_LEVELS (NODE) ? TREE_VEC_LENGTH (NODE) \
3809 (TREE_VEC_LENGTH (NODE))
4949 TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (NODE))
Dname-lookup.cc1425 for (int i = 0; i < TREE_VEC_LENGTH (list); ++i) in adl_class()
1480 for (int ix = TREE_VEC_LENGTH (args); ix--;) in adl_expr()
1581 int i, len = TREE_VEC_LENGTH (args); in adl_template_arg()
Dmodule.cc4229 for (int ix = 0; ix != TREE_VEC_LENGTH (args); ix++) in nested_name()
5064 u (TREE_VEC_LENGTH (t)); in start()
6156 for (unsigned ix = TREE_VEC_LENGTH (t); ix--;) in core_vals()
6649 for (unsigned ix = TREE_VEC_LENGTH (t); ix--;) in core_vals()
9752 unsigned len = TREE_VEC_LENGTH (vec); in tpl_parms()
9854 for (unsigned ix = TREE_VEC_LENGTH (vec); ix--;) in tpl_parms_fini()
9894 for (unsigned ix = TREE_VEC_LENGTH (vec); ix--;) in tpl_parms_fini()
Dclass.cc1608 for (int j = 0; j < TREE_VEC_LENGTH (level); ++j) in mark_abi_tags()
1720 for (int j = 0; j < TREE_VEC_LENGTH (level); ++j) in inherit_targ_abi_tags()
/netbsd/src/external/gpl3/gcc/dist/gcc/
Dtree-dump.cc433 dump_int (di, "lngt", TREE_VEC_LENGTH (t)); in dequeue_and_dump()
434 for (i = 0; i < TREE_VEC_LENGTH (t); ++i) in dequeue_and_dump()
Dtree-object-size.cc202 return TREE_VEC_ELT (ret, TREE_VEC_LENGTH (ret) - 1); in object_sizes_get()
232 TREE_VEC_ELT (expr, TREE_VEC_LENGTH (expr) - 1) = name; in bundle_sizes()
838 phires = TREE_VEC_ELT (wholesize, TREE_VEC_LENGTH (wholesize) - 1); in emit_phi_nodes()
842 phires = TREE_VEC_ELT (size, TREE_VEC_LENGTH (size) - 1); in emit_phi_nodes()
917 for (int i = 0; i < TREE_VEC_LENGTH (expr); i++) in propagate_unknowns()
Dtree-streamer-out.cc780 for (i = 0; i < TREE_VEC_LENGTH (expr); i++) in write_ts_vec_tree_pointers()
1008 streamer_write_hwi (ob, TREE_VEC_LENGTH (expr)); in streamer_write_tree_header()
Dgimplify.cc12393 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (inner_for_stmt)); i++) in gimplify_omp_for()
12474 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (inner_for_stmt)); i++) in gimplify_omp_for()
12552 if (ort == ORT_SIMD && TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) == 1) in gimplify_omp_for()
12624 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++) in gimplify_omp_for()
12679 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) in gimplify_omp_for()
12680 == TREE_VEC_LENGTH (OMP_FOR_COND (for_stmt))); in gimplify_omp_for()
12681 gcc_assert (TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)) in gimplify_omp_for()
12682 == TREE_VEC_LENGTH (OMP_FOR_INCR (for_stmt))); in gimplify_omp_for()
12689 gimplify_omp_ctxp->loop_iter_var.create (TREE_VEC_LENGTH in gimplify_omp_for()
12709 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (for_stmt)); i++) in gimplify_omp_for()
[all …]
Dtree-pretty-print.cc1821 if (TREE_VEC_LENGTH (node) > 0) in dump_generic_node()
1823 size_t len = TREE_VEC_LENGTH (node); in dump_generic_node()
3597 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INIT (node)); i++) in dump_generic_node()
3648 spc -= 2 * TREE_VEC_LENGTH (OMP_FOR_INIT (node)) - 2; in dump_generic_node()
Dtree-streamer-in.cc895 for (i = 0; i < TREE_VEC_LENGTH (expr); i++) in lto_input_ts_vec_tree_pointers()
Dprint-tree.cc882 len = TREE_VEC_LENGTH (node); in print_node()
Dlto-streamer-out.cc1092 for (int i = 0; i < TREE_VEC_LENGTH (expr); i++) in DFS_write_tree_body()
1504 for (int i = 0; i < TREE_VEC_LENGTH (t); ++i) in hash_tree()
Dtree.cc1096 + (TREE_VEC_LENGTH (node) - 1) * sizeof (tree)); in tree_size()
2774 TREE_VEC_LENGTH (t) = len; in make_tree_vec()
2786 int oldlen = TREE_VEC_LENGTH (v); in grow_tree_vec()
2796 TREE_VEC_LENGTH (v) = len; in grow_tree_vec()
11286 int len = TREE_VEC_LENGTH (*tp); in walk_tree_1()
13960 for (i = 0; i < TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t)); i++) in verify_type()
Dvr-values.cc3918 size_t n = TREE_VEC_LENGTH (su->vec); in cleanup_edges_and_switches()
/netbsd/src/external/gpl3/gcc/dist/gcc/objc/
Dobjc-act.cc5256 for (i = 0; i < (size_t) TREE_VEC_LENGTH (method); i++) in check_duplicates()
5289 for (i = 0; i < (size_t) TREE_VEC_LENGTH (method); i++) in check_duplicates()
6018 for (i = 0; i < (size_t) TREE_VEC_LENGTH (existing_entry); i++) in insert_method_into_method_map()
6027 new_entry = make_tree_vec (TREE_VEC_LENGTH (existing_entry) + 1); in insert_method_into_method_map()
6030 for (i = 0; i < (size_t) TREE_VEC_LENGTH (existing_entry); i++) in insert_method_into_method_map()
/netbsd/src/external/gpl3/gcc/dist/gcc/lto/
Dlto-common.cc1542 for (int i = 0; i < TREE_VEC_LENGTH (t1); i++) in compare_tree_sccs_1()

12