Lines Matching refs:tree

25    propagation engine (tree-ssa-propagate.c).  Constant assignments of
195 #include "tree.h"
206 #include "tree-dump.h"
207 #include "tree-flow.h"
208 #include "tree-pass.h"
209 #include "tree-ssa-propagate.h"
283 ccp_decl_initial_min_invariant (tree t)
327 get_default_value (tree var)
329 tree sym = SSA_NAME_VAR (var);
358 tree stmt = SSA_NAME_DEF_STMT (var);
400 get_value (tree var, bool may_use_default_p)
414 set_lattice_value (tree var, prop_value_t new_val)
469 likely_value (tree stmt)
473 tree use;
551 tree stmt = bsi_stmt (i);
556 tree def;
579 tree phi;
584 tree arg;
718 ccp_visit_phi_node (tree phi)
779 tree arg = PHI_ARG_DEF (phi, i);
840 static tree
841 ccp_fold (tree stmt)
843 tree rhs = get_rhs (stmt);
846 tree retval = NULL_TREE;
880 tree op0 = TREE_OPERAND (rhs, 0);
907 tree op0 = TREE_OPERAND (rhs, 0);
908 tree op1 = TREE_OPERAND (rhs, 1);
938 tree *orig, var;
939 tree fndecl, arglist;
945 orig = XNEWVEC (tree, NUM_SSA_OPERANDS (stmt, SSA_OP_USE));
974 /* Return the tree representing the element referenced by T if T is an
978 static tree
979 fold_const_aggregate_ref (tree t)
982 tree base, ctor, idx, field;
984 tree cfield, cval;
1104 tree c = fold_const_aggregate_ref (TREE_OPERAND (t, 0));
1120 evaluate_stmt (tree stmt)
1123 tree simplified = NULL_TREE;
1180 visit_assignment (tree stmt, tree *output_p)
1183 tree lhs, rhs;
1220 tree orig_lhs = TREE_OPERAND (stmt, 0);
1225 tree w = fold_unary (VIEW_CONVERT_EXPR,
1243 tree w = widen_bitfield (val.value, TREE_OPERAND (orig_lhs, 1),
1279 tree vdef;
1318 visit_cond_stmt (tree stmt, edge *taken_edge_p)
1348 ccp_visit_stmt (tree stmt, edge *taken_edge_p, tree *output_p)
1350 tree def;
1451 -fno-tree-store-ccp is specified, we should run regular CCP.
1481 tree
1482 widen_bitfield (tree val, tree field, tree var)
1485 tree wide_val;
1539 static tree
1540 maybe_fold_offset_to_array_ref (tree base, tree offset, tree orig_type)
1542 tree min_idx, idx, elt_offset = integer_zero_node;
1543 tree array_type, elt_type, elt_size;
1552 tree low_bound = array_ref_low_bound (base);
1633 static tree
1634 maybe_fold_offset_to_component_ref (tree record_type, tree base, tree offset,
1635 tree orig_type, bool base_is_ptr)
1637 tree f, t, field_type, tail_array_field, field_offset;
1738 static tree
1739 maybe_fold_stmt_indirect (tree expr, tree base, tree offset)
1741 tree t;
1758 tree offset2;
1850 static tree
1851 maybe_fold_stmt_addition (tree expr)
1853 tree op0 = TREE_OPERAND (expr, 0);
1854 tree op1 = TREE_OPERAND (expr, 1);
1855 tree ptr_type = TREE_TYPE (expr);
1856 tree ptd_type;
1857 tree t;
1882 tree array_obj = TREE_OPERAND (op0, 0);
1883 tree array_idx = TREE_OPERAND (op0, 1);
1884 tree elt_type = TREE_TYPE (op0);
1885 tree elt_size = TYPE_SIZE_UNIT (elt_type);
1886 tree min_idx;
1959 tree stmt;
1967 static tree
1968 fold_stmt_r (tree *expr_p, int *walk_subtrees, void *data)
1973 tree expr = *expr_p, t;
2038 tree expr_record = TREE_TYPE (TREE_OPERAND (expr, 0));
2039 tree expr_field = TREE_OPERAND (expr, 1);
2056 tree op0 = TREE_OPERAND (expr, 0);
2057 tree tem;
2096 get_maxval_strlen (tree arg, tree *length, bitmap visited, int type)
2098 tree var, def_stmt, val;
2146 tree rhs;
2164 tree arg = PHI_ARG_DEF (def_stmt, i);
2194 static tree
2195 ccp_fold_builtin (tree stmt, tree fn)
2197 tree result, val[3];
2198 tree callee, arglist, a;
2284 tree new = fold_convert (TREE_TYPE (fn), val[0]);
2360 fold_stmt (tree *stmt_p)
2362 tree rhs, result, stmt;
2390 tree callee;
2415 tree t;
2453 fold_stmt_inplace (tree stmt)
2455 tree old_stmt = stmt, rhs, new_rhs;
2487 static tree
2488 convert_to_gimple_builtin (block_stmt_iterator *si_p, tree expr)
2491 tree stmt = bsi_stmt (*si_p);
2492 tree tmp, stmts = NULL;
2504 tree new_stmt = tsi_stmt (ti);
2528 tree *stmtp = bsi_stmt_ptr (i);
2529 tree old_stmt = *stmtp;
2530 tree call = get_rhs (*stmtp);
2531 tree callee, result;