HomeSort by: relevance | last modified time | path
    Searched refs:new_edge (Results 1 - 25 of 28) sorted by relevancy

1 2

  /src/external/gpl3/gdb.old/dist/sim/common/
hw-ports.c 99 struct hw_port_edge *new_edge = HW_ZALLOC (me, struct hw_port_edge); local
100 new_edge->my_port = my_port;
101 new_edge->dest = dest;
102 new_edge->dest_port = dest_port;
103 new_edge->next = *list;
104 new_edge->disposition = disposition;
105 *list = new_edge;
  /src/external/gpl3/gdb/dist/sim/common/
hw-ports.c 99 struct hw_port_edge *new_edge = HW_ZALLOC (me, struct hw_port_edge); local
100 new_edge->my_port = my_port;
101 new_edge->dest = dest;
102 new_edge->dest_port = dest_port;
103 new_edge->next = *list;
104 new_edge->disposition = disposition;
105 *list = new_edge;
  /src/external/gpl3/gcc/dist/gcc/
cgraphclones.cc 102 cgraph_edge *new_edge; local
117 new_edge = n->create_edge (callee, call_stmt, prof_count, true);
121 new_edge = n->create_indirect_edge (call_stmt,
124 *new_edge->indirect_info = *indirect_info;
129 new_edge = n->create_edge (callee, call_stmt, prof_count, true);
132 new_edge->indirect_info
134 *new_edge->indirect_info = *indirect_info;
138 new_edge->inline_failed = inline_failed;
139 new_edge->indirect_inlining_edge = indirect_inlining_edge;
141 new_edge->lto_stmt_uid = stmt_uid
    [all...]
tree-ssa-loop-unswitch.cc 1441 edge te, fe, e, new_edge; local
1502 new_edge = make_edge (pre_header, exit->dest, flags);
1506 new_edge->probability = guard->probability;
1510 : guard->count ().apply_probability (new_edge->probability);
1520 new_edge->probability.dump (buffer);
1531 e->probability = new_edge->probability.invert ();
1572 add_phi_arg (phi, arg, new_edge, UNKNOWN_LOCATION);
1578 add_phi_arg (phi, arg, new_edge, UNKNOWN_LOCATION);
auto-profile.cc 1068 struct cgraph_edge *new_edge local
1071 cgraph_edge::redirect_call_stmt_to_callee (new_edge);
1073 inline_call (new_edge, true, NULL, NULL, false);
tree-inline.cc 2571 edge new_edge; local
2581 new_edge
2583 new_edge->probability = old_edge->probability;
2585 new_edge->goto_locus = remap_location (locus, id);
2737 edge new_edge; local
2761 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
2763 edge old_edge = find_edge ((basic_block) new_edge->src->aux,
2791 gsi_insert_seq_on_edge (new_edge, stmts);
2799 add_phi_arg (new_phi, new_arg, new_edge, locus);
2807 FOR_EACH_EDGE (new_edge, ei, new_bb->preds
    [all...]
cfgrtl.cc 1520 edge new_edge;
1681 new_edge = make_edge (e->src, jump_block, EDGE_FALLTHRU);
1682 new_edge->probability = probability;
1690 fixup_partition_crossing (new_edge);
1696 new_edge->probability /= 2;
1698 edge new_edge2 = make_edge (new_edge->src, target,
1700 new_edge2->probability = probability - new_edge->probability;
1512 edge new_edge; local
tree-ssa-threadupdate.cc 2259 edge new_edge = find_edge (src_copy, e->dest); local
2262 if (new_edge == NULL)
2268 e = new_edge;
bb-reorder.cc 2110 edge new_edge;
2224 new_edge = make_single_succ_edge (new_bb, dest, 0);
2226 new_edge = EDGE_SUCC (new_bb, 0);
2229 new_edge->flags |= EDGE_CROSSING;
cfgloop.cc 1069 If NEW_EDGE is true and E is not a loop exit, we
1073 rescan_loop_exit (edge e, bool new_edge, bool removed)
1104 if (!exits && new_edge)
tree-cfg.cc 3032 edge new_edge, e; local
3057 new_edge = make_single_succ_edge (new_bb, dest, EDGE_FALLTHRU);
3059 gcc_assert (e == edge_in && new_edge->dest_idx == old_dest_idx);
  /src/external/gpl3/gcc.old/dist/gcc/
cgraphclones.cc 99 cgraph_edge *new_edge; local
114 new_edge = n->create_edge (callee, call_stmt, prof_count, true);
118 new_edge = n->create_indirect_edge (call_stmt,
121 *new_edge->indirect_info = *indirect_info;
126 new_edge = n->create_edge (callee, call_stmt, prof_count, true);
129 new_edge->indirect_info
131 *new_edge->indirect_info = *indirect_info;
135 new_edge->inline_failed = inline_failed;
136 new_edge->indirect_inlining_edge = indirect_inlining_edge;
138 new_edge->lto_stmt_uid = stmt_uid
    [all...]
tree-ssa-loop-unswitch.cc 825 edge te, fe, e, new_edge; local
886 new_edge = make_edge (pre_header, exit->dest, flags);
890 new_edge->probability = guard->probability;
894 : guard->count ().apply_probability (new_edge->probability);
904 new_edge->probability.dump (buffer);
915 e->probability = new_edge->probability.invert ();
956 add_phi_arg (phi, arg, new_edge, UNKNOWN_LOCATION);
962 add_phi_arg (phi, arg, new_edge, UNKNOWN_LOCATION);
auto-profile.cc 1067 struct cgraph_edge *new_edge local
1070 cgraph_edge::redirect_call_stmt_to_callee (new_edge);
1072 inline_call (new_edge, true, NULL, NULL, false);
tree-inline.cc 2555 edge new_edge; local
2565 new_edge
2567 new_edge->probability = old_edge->probability;
2569 new_edge->goto_locus = remap_location (locus, id);
2720 edge new_edge; local
2744 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
2746 edge old_edge = find_edge ((basic_block) new_edge->src->aux,
2774 gsi_insert_seq_on_edge (new_edge, stmts);
2782 add_phi_arg (new_phi, new_arg, new_edge, locus);
2790 FOR_EACH_EDGE (new_edge, ei, new_bb->preds
    [all...]
cfgrtl.cc 1521 edge new_edge;
1682 new_edge = make_edge (e->src, jump_block, EDGE_FALLTHRU);
1683 new_edge->probability = probability;
1691 fixup_partition_crossing (new_edge);
1697 new_edge->probability = new_edge->probability.apply_scale (1, 2);
1699 edge new_edge2 = make_edge (new_edge->src, target,
1701 new_edge2->probability = probability - new_edge->probability;
1513 edge new_edge; local
tree-ssa-threadupdate.cc 2266 edge new_edge = find_edge (src_copy, e->dest); local
2269 if (new_edge == NULL)
2275 e = new_edge;
bb-reorder.cc 2109 edge new_edge;
2223 new_edge = make_single_succ_edge (new_bb, dest, 0);
2225 new_edge = EDGE_SUCC (new_bb, 0);
2228 new_edge->flags |= EDGE_CROSSING;
cfgloop.cc 1076 If NEW_EDGE is true and E is not a loop exit, we
1080 rescan_loop_exit (edge e, bool new_edge, bool removed)
1111 if (!exits && new_edge)
  /src/external/gpl3/gcc/dist/gcc/analyzer/
supergraph.cc 523 cfg_superedge *new_edge; local
525 new_edge = new switch_cfg_superedge (src, dest, e);
527 new_edge = new cfg_superedge (src, dest, e);
528 add_edge (new_edge);
529 return new_edge;
539 call_superedge *new_edge = new call_superedge (src, dest, cedge); local
540 add_edge (new_edge);
541 return new_edge;
551 return_superedge *new_edge = new return_superedge (src, dest, cedge); local
552 add_edge (new_edge);
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/analyzer/
supergraph.cc 517 cfg_superedge *new_edge; local
519 new_edge = new switch_cfg_superedge (src, dest, e);
521 new_edge = new cfg_superedge (src, dest, e);
522 add_edge (new_edge);
523 return new_edge;
533 call_superedge *new_edge = new call_superedge (src, dest, cedge); local
534 add_edge (new_edge);
535 return new_edge;
545 return_superedge *new_edge = new return_superedge (src, dest, cedge); local
546 add_edge (new_edge);
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/
blocks.cc 1150 // Return true if it would be better to continue an EBB across NEW_EDGE
1154 better_ebb_edge_p (edge new_edge, edge old_edge)
1157 if (new_edge->probability.initialized_p ()
1159 && !(old_edge->probability == new_edge->probability))
1160 return old_edge->probability < new_edge->probability;
1163 if (new_edge->flags & EDGE_FALLTHRU)
  /src/external/gpl3/gdb/dist/sim/ppc/
device.c 71 device_interrupt_edge *new_edge = ZALLOC(device_interrupt_edge); local
72 new_edge->my_port = my_port;
73 new_edge->dest = dest;
74 new_edge->dest_port = dest_port;
75 new_edge->next = *list;
76 new_edge->disposition = disposition;
77 *list = new_edge;
  /src/external/gpl3/gdb.old/dist/sim/ppc/
device.c 71 device_interrupt_edge *new_edge = ZALLOC(device_interrupt_edge); local
72 new_edge->my_port = my_port;
73 new_edge->dest = dest;
74 new_edge->dest_port = dest_port;
75 new_edge->next = *list;
76 new_edge->disposition = disposition;
77 *list = new_edge;
  /src/external/gpl3/gcc/dist/gcc/rtl-ssa/
blocks.cc 1169 // Return true if it would be better to continue an EBB across NEW_EDGE
1173 better_ebb_edge_p (edge new_edge, edge old_edge)
1176 if (new_edge->probability.initialized_p ()
1178 && !(old_edge->probability == new_edge->probability))
1179 return old_edge->probability < new_edge->probability;
1182 if (new_edge->flags & EDGE_FALLTHRU)

Completed in 51 milliseconds

1 2