diff options
Diffstat (limited to 'gcc/tree-inline.c')
| -rw-r--r-- | gcc/tree-inline.c | 11 |
1 files changed, 5 insertions, 6 deletions
diff --git a/gcc/tree-inline.c b/gcc/tree-inline.c index 82b7857..707faaf 100644 --- a/gcc/tree-inline.c +++ b/gcc/tree-inline.c @@ -1159,7 +1159,7 @@ estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data) int *count = data; tree x = *tp; - if (TYPE_P (x) || DECL_P (x)) + if (IS_TYPE_OR_DECL_P (x)) { *walk_subtrees = 0; return NULL; @@ -1167,8 +1167,7 @@ estimate_num_insns_1 (tree *tp, int *walk_subtrees, void *data) /* Assume that constants and references counts nothing. These should be majorized by amount of operations among them we count later and are common target of CSE and similar optimizations. */ - else if (TREE_CODE_CLASS (TREE_CODE (x)) == 'c' - || TREE_CODE_CLASS (TREE_CODE (x)) == 'r') + else if (CONSTANT_CLASS_P (x) || REFERENCE_CLASS_P (x)) return NULL; switch (TREE_CODE (x)) @@ -2258,7 +2257,7 @@ copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED) /* We make copies of most nodes. */ if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code)) - || TREE_CODE_CLASS (code) == 'c' + || TREE_CODE_CLASS (code) == tcc_constant || code == TREE_LIST || code == TREE_VEC || code == TYPE_DECL) @@ -2288,9 +2287,9 @@ copy_tree_r (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED) BIND_EXPR_BLOCK (*tp) = NULL_TREE; } - else if (TREE_CODE_CLASS (code) == 't') + else if (TREE_CODE_CLASS (code) == tcc_type) *walk_subtrees = 0; - else if (TREE_CODE_CLASS (code) == 'd') + else if (TREE_CODE_CLASS (code) == tcc_declaration) *walk_subtrees = 0; else gcc_assert (code != STATEMENT_LIST); |