Lines Matching refs:tree
62 The algorithm constructs a subset of the dominator tree, holding the
71 worst-case, the cost is due to creating the dominator tree subset,
74 of creating the dominator tree subset is O(n_basic_blocks) and the
83 work on just a subset of the dominator tree, as we do now, and the
93 #include "tree.h"
94 #include "tree-flow.h"
97 #include "tree-pass.h"
112 tree recip_def;
116 tree recip_def_stmt;
139 interesting block in the dominator tree. */
163 /* Insert NEW_OCC into our subset of the dominator tree. P_HEAD points to a
167 We try to insert NEW_OCC as deep as possible in the tree, and we also
169 block already in the tree. */
275 is_division_by (tree use_stmt, tree def)
282 /* Walk the subset of the dominator tree rooted at OCC, setting the
293 tree def, tree recip_def, int threshold)
295 tree type, new_stmt;
350 tree use_stmt = USE_STMT (use_p);
397 execute_cse_reciprocals_1 (block_stmt_iterator *def_bsi, tree def)
408 tree use_stmt = USE_STMT (use_p);
420 tree use_stmt;
457 tree arg;
480 tree phi, def;
492 tree stmt = bsi_stmt (bsi);