HomeSort by: relevance | last modified time | path
    Searched defs:taken_edge (Results 1 - 25 of 32) sorted by relevancy

1 2

  /src/external/gpl3/gcc/dist/gcc/
domwalk.cc 305 edge taken_edge = NULL; local
311 taken_edge = before_dom_children (bb);
312 if (taken_edge && taken_edge != STOP)
317 if (e != taken_edge)
331 if (taken_edge != STOP)
domwalk.cc 305 edge taken_edge = NULL; local
311 taken_edge = before_dom_children (bb);
312 if (taken_edge && taken_edge != STOP)
317 if (e != taken_edge)
331 if (taken_edge != STOP)
tree-cfgcleanup.cc 131 edge taken_edge; local
168 taken_edge = find_taken_edge (bb, val);
169 if (!taken_edge)
179 if (e != taken_edge)
188 taken_edge->probability += e->probability;
199 taken_edge = single_succ_edge (bb);
203 taken_edge->flags = EDGE_FALLTHRU;
tree-ssa-propagate.cc 204 edge taken_edge = NULL; local
221 val = visit_stmt (stmt, &taken_edge, &output_name);
253 if (taken_edge)
254 add_control_edge (taken_edge);
tree-ssa-threadbackward.cc 109 void maybe_register_path_dump (edge taken_edge);
245 edge taken_edge = find_taken_edge (m_path); local
247 if (taken_edge && taken_edge != UNREACHABLE_EDGE)
250 if (profit.profitable_path_p (m_path, taken_edge, &irreducible)
252 && m_registry.register_path (m_path, taken_edge))
258 taken_edge = NULL;
262 maybe_register_path_dump (taken_edge);
264 return taken_edge;
765 The taken edge out of the path is TAKEN_EDGE
    [all...]
tree-ssa-threadedge.cc 779 /* See if TAKEN_EDGE->dest is a threadable block with no side effecs (ie, it
788 edge taken_edge,
791 basic_block bb = taken_edge->dest;
827 taken_edge = single_succ_edge (bb);
829 if ((taken_edge->flags & EDGE_DFS_BACK) != 0)
832 if (!bitmap_bit_p (visited, taken_edge->dest->index))
834 m_registry->push_edge (path, taken_edge, EDGE_NO_COPY_SRC_BLOCK);
835 m_state->append_path (taken_edge->dest);
836 bitmap_set_bit (visited, taken_edge->dest->index);
837 return thread_around_empty_blocks (path, taken_edge, visited
969 edge taken_edge; local
1132 edge taken_edge; local
    [all...]
tree-cfgcleanup.cc 131 edge taken_edge; local
168 taken_edge = find_taken_edge (bb, val);
169 if (!taken_edge)
179 if (e != taken_edge)
188 taken_edge->probability += e->probability;
199 taken_edge = single_succ_edge (bb);
203 taken_edge->flags = EDGE_FALLTHRU;
tree-ssa-propagate.cc 204 edge taken_edge = NULL; local
221 val = visit_stmt (stmt, &taken_edge, &output_name);
253 if (taken_edge)
254 add_control_edge (taken_edge);
tree-ssa-threadbackward.cc 109 void maybe_register_path_dump (edge taken_edge);
245 edge taken_edge = find_taken_edge (m_path); local
247 if (taken_edge && taken_edge != UNREACHABLE_EDGE)
250 if (profit.profitable_path_p (m_path, taken_edge, &irreducible)
252 && m_registry.register_path (m_path, taken_edge))
258 taken_edge = NULL;
262 maybe_register_path_dump (taken_edge);
264 return taken_edge;
765 The taken edge out of the path is TAKEN_EDGE
    [all...]
tree-ssa-threadedge.cc 779 /* See if TAKEN_EDGE->dest is a threadable block with no side effecs (ie, it
788 edge taken_edge,
791 basic_block bb = taken_edge->dest;
827 taken_edge = single_succ_edge (bb);
829 if ((taken_edge->flags & EDGE_DFS_BACK) != 0)
832 if (!bitmap_bit_p (visited, taken_edge->dest->index))
834 m_registry->push_edge (path, taken_edge, EDGE_NO_COPY_SRC_BLOCK);
835 m_state->append_path (taken_edge->dest);
836 bitmap_set_bit (visited, taken_edge->dest->index);
837 return thread_around_empty_blocks (path, taken_edge, visited
969 edge taken_edge; local
1132 edge taken_edge; local
    [all...]
tree-ssa-dom.cc 1732 edge taken_edge = NULL; local
1748 taken_edge = this->optimize_stmt (bb, &gsi, &removed_p);
1778 if (taken_edge && !dbg_cnt (dom_unreachable_edges))
1781 return taken_edge;
2440 edge taken_edge = fold_cond (as_a <gcond *> (stmt)); local
2441 if (taken_edge)
2446 return taken_edge;
vr-values.cc 1103 edge taken_edge; local
1104 legacy_fold_cond (cond, &taken_edge);
1106 if (taken_edge)
1108 if (taken_edge->flags & EDGE_TRUE_VALUE)
1114 else if (taken_edge->flags & EDGE_FALSE_VALUE)
  /src/external/gpl3/gcc.old/dist/gcc/
domwalk.cc 303 edge taken_edge = NULL; local
309 taken_edge = before_dom_children (bb);
310 if (taken_edge && taken_edge != STOP)
315 if (e != taken_edge)
329 if (taken_edge != STOP)
domwalk.cc 303 edge taken_edge = NULL; local
309 taken_edge = before_dom_children (bb);
310 if (taken_edge && taken_edge != STOP)
315 if (e != taken_edge)
329 if (taken_edge != STOP)
gimple-ssa-evrp-analyze.cc 306 edge taken_edge; local
308 extract_range_from_stmt (stmt, &taken_edge, &output, &vr);
gimple-ssa-evrp-analyze.cc 306 edge taken_edge; local
308 extract_range_from_stmt (stmt, &taken_edge, &output, &vr);
tree-cfgcleanup.cc 131 edge taken_edge; local
168 taken_edge = find_taken_edge (bb, val);
169 if (!taken_edge)
179 if (e != taken_edge)
188 taken_edge->probability += e->probability;
199 taken_edge = single_succ_edge (bb);
203 taken_edge->flags = EDGE_FALLTHRU;
tree-ssa-propagate.cc 213 edge taken_edge = NULL; local
230 val = visit_stmt (stmt, &taken_edge, &output_name);
262 if (taken_edge)
263 add_control_edge (taken_edge);
tree-ssa-threadbackward.cc 92 void maybe_register_path_dump (edge taken_edge);
232 edge taken_edge = find_taken_edge (m_path); local
234 if (taken_edge && taken_edge != UNREACHABLE_EDGE)
236 if (m_visited_bbs.contains (taken_edge->dest))
240 taken_edge = UNREACHABLE_EDGE;
245 if (m_profit.profitable_path_p (m_path, m_name, taken_edge,
249 m_registry.register_path (m_path, taken_edge);
255 taken_edge = NULL;
260 maybe_register_path_dump (taken_edge);
    [all...]
tree-ssa-threadedge.cc 779 /* See if TAKEN_EDGE->dest is a threadable block with no side effecs (ie, it
788 edge taken_edge,
791 basic_block bb = taken_edge->dest;
823 taken_edge = single_succ_edge (bb);
825 if ((taken_edge->flags & EDGE_DFS_BACK) != 0)
828 if (!bitmap_bit_p (visited, taken_edge->dest->index))
830 m_registry->push_edge (path, taken_edge, EDGE_NO_COPY_SRC_BLOCK);
831 m_state->append_path (taken_edge->dest);
832 bitmap_set_bit (visited, taken_edge->dest->index);
833 return thread_around_empty_blocks (path, taken_edge, visited)
959 edge taken_edge; local
1119 edge taken_edge; local
    [all...]
tree-cfgcleanup.cc 131 edge taken_edge; local
168 taken_edge = find_taken_edge (bb, val);
169 if (!taken_edge)
179 if (e != taken_edge)
188 taken_edge->probability += e->probability;
199 taken_edge = single_succ_edge (bb);
203 taken_edge->flags = EDGE_FALLTHRU;
tree-ssa-propagate.cc 213 edge taken_edge = NULL; local
230 val = visit_stmt (stmt, &taken_edge, &output_name);
262 if (taken_edge)
263 add_control_edge (taken_edge);
tree-ssa-threadbackward.cc 92 void maybe_register_path_dump (edge taken_edge);
232 edge taken_edge = find_taken_edge (m_path); local
234 if (taken_edge && taken_edge != UNREACHABLE_EDGE)
236 if (m_visited_bbs.contains (taken_edge->dest))
240 taken_edge = UNREACHABLE_EDGE;
245 if (m_profit.profitable_path_p (m_path, m_name, taken_edge,
249 m_registry.register_path (m_path, taken_edge);
255 taken_edge = NULL;
260 maybe_register_path_dump (taken_edge);
    [all...]
tree-ssa-threadedge.cc 779 /* See if TAKEN_EDGE->dest is a threadable block with no side effecs (ie, it
788 edge taken_edge,
791 basic_block bb = taken_edge->dest;
823 taken_edge = single_succ_edge (bb);
825 if ((taken_edge->flags & EDGE_DFS_BACK) != 0)
828 if (!bitmap_bit_p (visited, taken_edge->dest->index))
830 m_registry->push_edge (path, taken_edge, EDGE_NO_COPY_SRC_BLOCK);
831 m_state->append_path (taken_edge->dest);
832 bitmap_set_bit (visited, taken_edge->dest->index);
833 return thread_around_empty_blocks (path, taken_edge, visited)
959 edge taken_edge; local
1119 edge taken_edge; local
    [all...]
tree-ssa-dom.cc 1531 edge taken_edge = NULL; local
1548 taken_edge = this->optimize_stmt (bb, &gsi, &removed_p);
1578 if (taken_edge && !dbg_cnt (dom_unreachable_edges))
1581 return taken_edge;
2222 edge taken_edge = NULL; local
2224 simpl.vrp_visit_cond_stmt (as_a <gcond *> (stmt), &taken_edge); local
2225 if (taken_edge)
2227 if (taken_edge->flags & EDGE_TRUE_VALUE)
2229 else if (taken_edge->flags & EDGE_FALSE_VALUE)
2236 return taken_edge;
    [all...]

Completed in 70 milliseconds

1 2