Home
last modified time | relevance | path

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

/NextBSD/contrib/gcc/cp/
HDpt.c335 begin_scope (TREE_VEC_LENGTH (parms) ? sk_template_parms : sk_template_spec, in push_inline_template_parms_recursive()
337 for (i = 0; i < TREE_VEC_LENGTH (parms); ++i) in push_inline_template_parms_recursive()
470 TREE_VEC_LENGTH (args) -= TMPL_ARGS_DEPTH (extra_args); in add_outermost_template_args()
475 TREE_VEC_LENGTH (args) += TMPL_ARGS_DEPTH (extra_args); in add_outermost_template_args()
1465 && (TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (fn)) in determine_specialization()
1466 != TREE_VEC_LENGTH (INNERMOST_TEMPLATE_PARMS in determine_specialization()
2244 if (TREE_VEC_LENGTH (t1) != TREE_VEC_LENGTH (t2)) in comp_template_parms()
2247 for (i = 0; i < TREE_VEC_LENGTH (t2); ++i) in comp_template_parms()
2555 for (i = TREE_VEC_LENGTH (a) - 1; i >= 0; --i) in current_template_args()
2681 int nargs = TREE_VEC_LENGTH (inner_args); in process_partial_specialization()
[all …]
HDerror.c151 int n = TREE_VEC_LENGTH (args); in dump_template_argument_list()
222 for (i = 0; i < TREE_VEC_LENGTH (p); ++i) in dump_template_bindings()
944 int len = TREE_VEC_LENGTH (inner_parms); in dump_template_decl()
1230 args = TREE_VEC_ELT (args, TREE_VEC_LENGTH (args) - 1); in dump_template_parms()
1232 len = TREE_VEC_LENGTH (args); in dump_template_parms()
1254 len = parms ? TREE_VEC_LENGTH (parms) : 0; in dump_template_parms()
HDmangle.c488 TREE_VEC_LENGTH (args) == 1 in is_std_substitution_char()
570 if (TREE_VEC_LENGTH (args) == 3 in find_substitution()
600 if (TREE_VEC_LENGTH (args) == 2 in find_substitution()
1999 int length = TREE_VEC_LENGTH (args); in write_template_args()
2012 length = TREE_VEC_LENGTH (args); in write_template_args()
HDtree.c1560 if (TREE_VEC_LENGTH (vec1) != TREE_VEC_LENGTH (vec2)) in cp_tree_equal()
1563 for (ix = TREE_VEC_LENGTH (vec1); ix--;) in cp_tree_equal()
HDcxx-pretty-print.c1505 for (i = 0; i < TREE_VEC_LENGTH (t); ++i) in pp_cxx_template_argument_list()
1790 const int n = TREE_VEC_LENGTH (t); in pp_cxx_template_parameter_list()
HDdecl2.c483 i = TREE_VEC_LENGTH (args); in acceptable_java_type()
1613 for (i = TREE_VEC_LENGTH (args); i > 0; --i) in constrain_visibility_for_template()
HDcp-tree.h2190 (TMPL_ARGS_HAVE_MULTIPLE_LEVELS (NODE) ? TREE_VEC_LENGTH (NODE) : 1)
2210 (TREE_VEC_LENGTH (NODE))
2757 TREE_VEC_LENGTH (DECL_INNERMOST_TEMPLATE_PARMS (NODE))
HDname-lookup.c4542 for (i = 0; i < TREE_VEC_LENGTH (list); ++i) in arg_assoc_class()
4686 for (ix = TREE_VEC_LENGTH (args); ix--;) in arg_assoc()
HDChangeLog-20002981 * dump.c (dequeue_and_dump): Use TREE_VEC_LENGTH with vectors.
/NextBSD/contrib/gcc/
HDtree-dump.c432 dump_int (di, "lngt", TREE_VEC_LENGTH (t)); in dequeue_and_dump()
433 for (i = 0; i < TREE_VEC_LENGTH (t); ++i) in dequeue_and_dump()
HDtree-cfg.c787 n = TREE_VEC_LENGTH (vec); in get_cases_for_edge()
809 n = TREE_VEC_LENGTH (vec); in make_switch_expr_edges()
1025 size_t n = TREE_VEC_LENGTH (vec); in cleanup_dead_labels()
1110 int old_size = TREE_VEC_LENGTH (labels); in group_case_labels()
1179 TREE_VEC_LENGTH (labels) = new_size; in group_case_labels()
2213 size_t low, high, n = TREE_VEC_LENGTH (vec); in find_case_label_for_value()
3897 n = TREE_VEC_LENGTH (vec); in tree_verify_flow_info()
4168 size_t i, n = TREE_VEC_LENGTH (vec); in tree_redirect_edge_and_branch()
HDtree-ssa-uncprop.c196 int i, n_labels = TREE_VEC_LENGTH (labels); in associate_equivalences_with_edges()
HDtree-pretty-print.c481 if (TREE_VEC_LENGTH (node) > 0) in dump_generic_node()
483 size_t len = TREE_VEC_LENGTH (node); in dump_generic_node()
1520 size_t i, n = TREE_VEC_LENGTH (vec); in dump_generic_node()
HDprint-tree.c780 len = TREE_VEC_LENGTH (node); in print_node()
HDstmt.c2364 elt = TREE_VEC_ELT (vec, TREE_VEC_LENGTH (vec) - 1); in expand_case()
2369 for (i = TREE_VEC_LENGTH (vec) - 1; --i >= 0; ) in expand_case()
HDtree-eh.c569 n = TREE_VEC_LENGTH (vec); in verify_norecord_switch_expr()
HDtree-ssa-dom.c1285 int i, n_labels = TREE_VEC_LENGTH (labels); in record_edge_info()
HDtree.c422 + (TREE_VEC_LENGTH (node) - 1) * sizeof(char *)); in tree_size()
1260 TREE_VEC_LENGTH (t) = len; in make_tree_vec_stat()
7577 int len = TREE_VEC_LENGTH (*tp); in walk_tree()
HDtree-data-ref.c2118 for (j = 0; j < TREE_VEC_LENGTH (chrec) - 1; j++) in all_chrecs_equal_p()
HDtree.h1379 #define TREE_VEC_LENGTH(NODE) (TREE_VEC_CHECK (NODE)->vec.length) macro
HDomp-low.c4612 int i, len = TREE_VEC_LENGTH (vec); in diagnose_sb_2()
HDgimplify.c1331 size_t len = TREE_VEC_LENGTH (label_vec); in sort_case_labels()
HDfold-const.c11974 for (i = 0; i < TREE_VEC_LENGTH (expr); ++i) in fold_checksum_tree()
/NextBSD/contrib/gcc/doc/
HDc-tree.texi236 @findex TREE_VEC_LENGTH
251 A @code{TREE_VEC} is a simple vector. The @code{TREE_VEC_LENGTH} is an