Home
last modified time | relevance | path

Searched refs:TREE_CODE_LENGTH (Results 1 – 25 of 34) sorted by relevance

12

/trueos/contrib/gcc/
HDc-semantics.c122 length = TREE_CODE_LENGTH (code); in build_stmt()
HDtree-chrec.c850 switch (TREE_CODE_LENGTH (TREE_CODE (chrec))) in chrec_contains_symbols()
879 switch (TREE_CODE_LENGTH (TREE_CODE (chrec))) in chrec_contains_undetermined()
914 switch (TREE_CODE_LENGTH (TREE_CODE (expr))) in tree_contains_chrecs()
957 switch (TREE_CODE_LENGTH (TREE_CODE (chrec))) in evolution_function_is_invariant_rec_p()
HDtree.c361 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *)); in tree_code_size()
2230 switch (TREE_CODE_LENGTH (code)) in contains_placeholder_p()
2394 switch (TREE_CODE_LENGTH (code)) in substitute_in_expr()
2528 switch (TREE_CODE_LENGTH (code)) in substitute_placeholder_in_expr()
2853 gcc_assert (TREE_CODE_LENGTH (code) == 0); in build0_stat()
2888 gcc_assert (TREE_CODE_LENGTH (code) == 1); in build1_stat()
2974 gcc_assert (TREE_CODE_LENGTH (code) == 2); in build2_stat()
3013 gcc_assert (TREE_CODE_LENGTH (code) == 3); in build3_stat()
3059 gcc_assert (TREE_CODE_LENGTH (code) == 4); in build4_stat()
3086 gcc_assert (TREE_CODE_LENGTH (code) == 5); in build5_stat()
[all …]
HDtree-browser.c742 switch (TREE_CODE_LENGTH (TREE_CODE (node))) in store_child_info()
798 switch (TREE_CODE_LENGTH (TREE_CODE (parent))) in TB_parent_eq()
HDtree-gimple.c470 int len = TREE_CODE_LENGTH (code); in recalculate_side_effects()
HDtree-ssa-reassoc.c288 if (TREE_CODE_LENGTH (TREE_CODE (rhs)) == 0) in get_rank()
293 i < TREE_CODE_LENGTH (TREE_CODE (rhs)) in get_rank()
HDtree-ssa-loop-im.c348 nops = TREE_CODE_LENGTH (TREE_CODE (expr)); in outermost_invariant_loop_expr()
842 nops = TREE_CODE_LENGTH (TREE_CODE (expr)); in force_move_till_expr()
HDtree-vect-transform.c798 op_type = TREE_CODE_LENGTH (TREE_CODE (operation)); in vect_create_epilog_for_reduction()
1196 op_type = TREE_CODE_LENGTH (code); in vectorizable_reduction()
1519 op_type = TREE_CODE_LENGTH (code); in vectorizable_operation()
2001 op_type = TREE_CODE_LENGTH (code); in vectorizable_live_operation()
HDtree-ssa-loop-niter.c690 n = TREE_CODE_LENGTH (TREE_CODE (expr)); in simplify_replace_tree()
726 n = TREE_CODE_LENGTH (code); in expand_simple_operations()
HDprint-tree.c671 len = TREE_CODE_LENGTH (TREE_CODE (node)); in print_node()
HDtree.h192 #define TREE_CODE_LENGTH(CODE) tree_code_length[(int) (CODE)] macro
765 if (__i < 0 || __i >= TREE_CODE_LENGTH (TREE_CODE (__t))) \
775 if (__i < 0 || __i >= TREE_CODE_LENGTH (CODE)) \
786 if (__i < 0 || __i >= TREE_CODE_LENGTH ((CODE))) \
HDtree-scalar-evolution.c389 switch (TREE_CODE_LENGTH (TREE_CODE (chrec))) in chrec_contains_symbols_defined_in_loop()
2340 switch (TREE_CODE_LENGTH (TREE_CODE (chrec))) in instantiate_parameters_1()
HDtree-vectorizer.c1861 op_type = TREE_CODE_LENGTH (code); in vect_is_simple_reduction()
HDfold-const.c3960 if (TREE_CODE_LENGTH (code) > 0) in make_range()
3969 && TREE_CODE_LENGTH (code) > 1)) in make_range()
7431 && TREE_CODE_LENGTH (code) == 1); in fold_unary()
8485 && TREE_CODE_LENGTH (code) == 2 in fold_binary()
11462 && TREE_CODE_LENGTH (code) == 3); in fold_ternary()
11800 switch (TREE_CODE_LENGTH (code)) in fold()
11987 len = TREE_CODE_LENGTH (code); in fold_checksum_tree()
HDstmt.c1488 if (EXPRESSION_CLASS_P (exp) && TREE_CODE_LENGTH (TREE_CODE (exp)) == 0) in warn_if_unused_value()
HDtree-pretty-print.c76 len = TREE_CODE_LENGTH (TREE_CODE (node)); in do_niy()
HDtree-ssa-pre.c2951 for (i = 0; i < TREE_CODE_LENGTH (code); i++) in create_value_expr_from()
HDtree-ssa-structalias.c3545 for (i = 0; i < TREE_CODE_LENGTH (TREE_CODE (rhsop)); i++) in find_func_aliases()
HDc-common.c1545 int max = TREE_CODE_LENGTH (TREE_CODE (x)); in verify_tree()
HDtree-ssa-loop-ivopts.c1320 len = TREE_CODE_LENGTH (TREE_CODE (expr)); in expr_invariant_in_loop_p()
HDoptabs.c379 int nops = TREE_CODE_LENGTH (TREE_CODE (exp)); in expand_widen_pattern_expr()
/trueos/contrib/gcc/cp/
HDtree.c1295 length = TREE_CODE_LENGTH (code); in build_min_nt()
1320 length = TREE_CODE_LENGTH (code); in build_min()
1350 length = TREE_CODE_LENGTH (code); in build_min_non_dep()
1613 for (i = 0; i < TREE_CODE_LENGTH (code1); ++i) in cp_tree_equal()
HDmangle.c2234 for (i = 0; i < TREE_CODE_LENGTH (code); ++i) in write_expression()
HDdecl.c2045 + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *)); in duplicate_decls()
2052 + TREE_CODE_LENGTH (TREE_CODE (newdecl)) * sizeof (char *)); in duplicate_decls()
HDChangeLog-20003551 * method.c (mangle_expression): Use TREE_CODE_LENGTH.
3552 * tree.c (break_out_calls, build_min_nt): Use TREE_CODE_LENGTH.

12