Lines Matching defs:header

95      2) be a header of loop K such that K->outer is superloop of L
112 if (act->header == e->dest)
164 SET_BIT (in_queue, base_loop->header->index);
181 if (from->loop_father->header == from)
183 /* Subloop header, maybe move the loop upward. */
219 pred = pred->loop_father->header;
274 normally. We may assume that e->dest is not a header of any loop,
315 if (rem_bbs[i]->loop_father->header == rem_bbs[i])
366 /* Given LOOP structure with filled header and latch, find the body of the
381 bbs, n_basic_blocks, loop->header);
385 add_bb_to_loop (loop->header, loop);
402 latch to header and update loop tree stored in LOOPS and dominators
427 loop->header = header_edge->dest;
438 loop_redirect_edge (latch_edge, loop->header);
446 loop_redirect_edge (false_edge, loop->header);
450 set_immediate_dominator (CDI_DOMINATORS, loop->header, switch_bb);
523 loop header dominates loop latch, so the only thing we have to care of
616 for its preheader, because the successor is the header and belongs
774 LOOPS structure and dominators. E's destination must be LOOP header for
792 basic_block header = loop->header, latch = loop->latch;
807 gcc_assert (e->dest == loop->header);
819 gcc_assert (bbs[0] == loop->header);
842 freq_in = header->frequency;
877 /* Now simulate the duplication adjustments and compute header
987 loop->header);
995 loop->header);
1086 /* Creates a pre-header for a LOOP. Returns newly created block. Unless
1105 FOR_EACH_EDGE (e, ei, loop->header->preds)
1118 to loop->header. */
1119 e = EDGE_PRED (loop->header,
1120 EDGE_PRED (loop->header, 0)->src == loop->latch);
1128 fallthru = make_forwarder_block (loop->header, mfb_keep_just,
1131 loop->header = fallthru->dest;
1133 /* The header could be a latch of some superloop(s); due to design of
1142 The preheader was created just before the header and all incoming edges
1143 to the header were redirected to the preheader, except the latch edge.
1157 loop->header->loop_father = loop;
1196 if (loop->latch != loop->header && single_succ_p (loop->latch))
1199 e = find_edge (loop->latch, loop->header);
1275 /* Adjust loop header phi nodes. */
1342 single_pred_edge (get_bb_copy (loop->header)),
1393 to be correct). But still for the remaining loops the header dominates
1423 if (loop->header)
1456 loop->num_nodes = flow_loop_nodes_find (loop->header, loop);