diff options
| author | Richard Kenner <kenner@vlsi1.ultra.nyu.edu> | 2000-05-27 15:21:17 +0000 |
|---|---|---|
| committer | Richard Kenner <kenner@gcc.gnu.org> | 2000-05-27 11:21:17 -0400 |
| commit | 8d5e6e2527f07e6cfda3b62f1fd826006931d551 (patch) | |
| tree | e4055b6cf63a0bcf4381fb7092adf5db521626a7 /gcc/cp/tree.c | |
| parent | 0777f60c79e32b504c03b6a703d6833ca6bc91c5 (diff) | |
| download | gcc-8d5e6e2527f07e6cfda3b62f1fd826006931d551.zip gcc-8d5e6e2527f07e6cfda3b62f1fd826006931d551.tar.gz gcc-8d5e6e2527f07e6cfda3b62f1fd826006931d551.tar.bz2 | |
tree.h (TREE_CODE_LENGTH): New macro.
* tree.h (TREE_CODE_LENGTH): New macro.
* c-common.c (c_find_base_decl): Use it.
* expr.c (safe_from_p): Likewise.
* print-tree.c (print_node): Likewise.
* tree.c (make_node, copy_node, get_identifier): Likewie.
(first_rtl_op, contains_placeholder_p, substitute_in_expr): Likewise.
(build, build_nt, build_parse_node, simple_cst_equal): Likewise.
* fold-const.c (make_range): Likewise.
(fold): Likewise; also use first_rtl_op.
* c-iterate.c (collect_iterators): Use first_rtl_op.
* calls.c (calls_function_1): Likewise; also rename TYPE to CLASS.
Use IS_EXPR_CODE_CLASS.
(preexpand_calls): Likewise.
* ggc-common.c (ggc_mark_trees): Rework to use first_rtl_op
and TREE_CODE_LENGTH.
* stmt.c (warn_if_unused_value): If no operands, no unused value.
* ch/lang.c (deep_const_expr): Use first_rtl_op.
* ch/satisfy.c (satisfy): Use TREE_CODE_LENGTH.
* cp/method.c (mangle_expression): Use TREE_CODE_LENGTH.
* cp/tree.c (break_out_calls, build_min_nt): Use TREE_CODE_LENGTH.
(built_min, cp_tree_equal): Likewise.
From-SVN: r34203
Diffstat (limited to 'gcc/cp/tree.c')
| -rw-r--r-- | gcc/cp/tree.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/cp/tree.c b/gcc/cp/tree.c index 646a892..b62fc61 100644 --- a/gcc/cp/tree.c +++ b/gcc/cp/tree.c @@ -405,7 +405,7 @@ break_out_calls (exp) case 'e': /* an expression */ case 'r': /* a reference */ case 's': /* an expression with side effects */ - for (i = tree_code_length[(int) code] - 1; i >= 0; i--) + for (i = TREE_CODE_LENGTH (code) - 1; i >= 0; i--) { t1 = break_out_calls (TREE_OPERAND (exp, i)); if (t1 != TREE_OPERAND (exp, i)) @@ -427,7 +427,7 @@ break_out_calls (exp) changed = 1; if (changed) { - if (tree_code_length[(int) code] == 1) + if (TREE_CODE_LENGTH (code) == 1) return build1 (code, TREE_TYPE (exp), t1); else return build (code, TREE_TYPE (exp), t1, t2); @@ -1659,7 +1659,7 @@ build_min_nt VPARAMS ((enum tree_code code, ...)) #endif t = make_node (code); - length = tree_code_length[(int) code]; + length = TREE_CODE_LENGTH (code); TREE_COMPLEXITY (t) = lineno; for (i = 0; i < length; i++) @@ -1695,7 +1695,7 @@ build_min VPARAMS ((enum tree_code code, tree tt, ...)) #endif t = make_node (code); - length = tree_code_length[(int) code]; + length = TREE_CODE_LENGTH (code); TREE_TYPE (t) = tt; TREE_COMPLEXITY (t) = lineno; @@ -1944,7 +1944,7 @@ cp_tree_equal (t1, t2) case 'r': case 's': cmp = 1; - for (i=0; i<tree_code_length[(int) code1]; ++i) + for (i = 0; i < TREE_CODE_LENGTH (code1); ++i) { cmp = cp_tree_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i)); if (cmp <= 0) |