/freebsd-9.3-release/contrib/gcc/ |
H A D | cfgloop.c | 36 /* Ratio of frequencies of edges so that one of more latch edges is 133 fprintf (file, ";; header %d, latch %d\n", 134 loop->header->index, loop->latch->index); 234 if (loop->latch->loop_father != loop) 239 stack[sp++] = loop->latch; 240 loop->latch->loop_father = loop; 241 loop->latch->loop_depth = loop->depth; 425 /* A callback to update latch and header info for basic block JUMP created 449 /* A callback for make_forwarder block, to redirect the latch edges into an 470 /* Split blocks so that each loop has only single latch 478 basic_block latch = e->src; local 647 basic_block latch = e->src; local 727 basic_block latch = e->src; local [all...] |
H A D | cfgloopmanip.c | 278 e->src->loop_father->latch, e->dest)) 366 /* Given LOOP structure with filled header and latch, find the body of the 380 n = dfs_enumerate_from (loop->latch, 1, alp_enum_p, 402 latch to header and update loop tree stored in LOOPS and dominators 428 loop->latch = latch_edge->src; 503 /* Remove the latch edge of a LOOP and update LOOPS tree to indicate that 504 the LOOP was removed. After this function, original loop latch will 516 basic_block latch = loop->latch; local 523 loop header dominates loop latch, s 792 basic_block header = loop->header, latch = loop->latch; local [all...] |
H A D | tree-ssa-loop-manip.c | 495 if (dest->loop_father->latch == src) 496 dest->loop_father->latch = new_bb; 507 return loop->latch; 520 if (!single_pred_p (loop->latch)) 523 bb = single_pred (loop->latch); 529 if (exit->dest == loop->latch) 539 (just before the exit condition if it is available and latch block is empty, 540 end of the latch block otherwise) to BSI. INSERT_AFTER is set to true if 547 basic_block bb = ip_normal_pos (loop), latch = ip_end_pos (loop); local 548 tree last = last_stmt (latch); [all...] |
H A D | cfgloopanal.c | 39 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb)) 257 throw away all latch edges and mark blocks inside any remaining cycle. 299 /* And latch edges. */ 301 && e->dest->loop_father->latch == act) 424 if (loop->latch->count || loop->header->count) 432 if (e->src == loop->latch) 453 if (e->src == loop->latch)
|
H A D | tree-if-conv.c | 433 - Basic block is after exit block but before latch. 449 if (bb != loop->latch) 452 fprintf (dump_file, "basic block after exit bb but before latch\n"); 461 else if (bb == loop->latch 466 fprintf (dump_file, "latch is not dominated by exit_block\n"); 917 gcc_assert (exit_bb != loop->latch); 941 /* Redirect non-exit edges to loop->latch. */ 945 redirect_edge_and_branch (e, loop->latch); 947 set_immediate_dominator (CDI_DOMINATORS, loop->latch, exit_bb); 951 /* If the loop does not have exit then reconnect header and latch [all...] |
H A D | cfgloop.h | 67 /* Basic block of loop latch. */ 68 basic_block latch; member in struct:loop 332 /* Assumptions under that the loop ends before reaching the latch,
|
H A D | tree-ssa-loop-ch.c | 103 tree stmt = last_stmt (loop->latch); 105 /* If the latch of the loop is not empty, it is not a do-while loop. */ 194 /* Ensure that the header will have just the latch as a predecessor 228 /* Ensure that the latch and the preheader is simple (we know that they
|
H A D | tree-vectorizer.c | 293 (the one associated with the latch of NEW_LOOP) 548 loop_arg = PHI_ARG_DEF_FROM_EDGE (orig_phi, EDGE_SUCC (loop->latch, 0)); 775 tree begin_label = tree_block_label (loop->latch); 879 if (EDGE_SUCC (new_loop->header, 0)->dest == new_loop->latch) 965 (2) it consists of exactly 2 basic blocks - header, and an empty latch. 987 || !empty_block_p (loop->latch)
|
H A D | predict.c | 735 if (bb == loop->latch) 737 e = find_edge (loop->latch, loop->header); 1711 if (EDGE_COUNT (loop->latch->succs) > 0)
|
H A D | loop-unswitch.c | 395 iteration, i.e. it must dominate LOOP latch. COND is the condition 439 latch_edge = single_succ_edge (get_bb_copy (loop->latch));
|
H A D | cfglayout.c | 1217 BASE is the superloop to that basic block belongs; if its header or latch 1218 is copied, we do not set the new blocks as header or latch. 1248 /* Or latch. */ 1249 if (bb->loop_father->latch == bb && bb->loop_father != base) 1250 new_bb->loop_father->latch = new_bb;
|
H A D | tree-ssa-loop-im.c | 1078 /* Put this into the latch, so that we are sure it will be processed after 1452 if (dominated_by_p (CDI_DOMINATORS, loop->latch, bb)) 1474 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb))
|
H A D | modulo-sched.c | 819 either a single basic block or two BBs - a header and a latch. */ 821 && (EDGE_COUNT (loop->latch->preds) == 1) \ 822 && (EDGE_COUNT (loop->latch->succs) == 1)) 887 if (loop->latch == loop->header 888 || EDGE_COUNT (loop->latch->succs) > 1) 891 if (e->src == loop->latch)
|
H A D | loop-unroll.c | 219 if (desc->in_edge->dest != loop->latch) 222 /* Check that the latch is empty. */ 223 FOR_BB_INSNS (loop->latch, insn) 1743 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb))
|
H A D | tree-vect-analyze.c | 1903 - number of BBs = 2 (which are the loop header and the latch) 1946 executable statements, and the latch is empty. */ 1947 if (!empty_block_p (loop->latch) 1948 || phi_nodes (loop->latch))
|
H A D | tree-cfg.c | 1245 && b->loop_father->latch == b) 2017 /* If we remove the header or the latch of a loop, mark the loop for 2018 removal by setting its header and latch to NULL. */ 2023 if (loop->latch == bb 2026 loop->latch = NULL; 4378 /* During loop unrolling the target of the latch edge is copied. 4465 use), ensure that EXIT and its copy will be new latch and entry edges. */ 4471 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src)) 4536 loop->latch = exit->src;
|
H A D | tree-ssa-loop-niter.c | 1054 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src)) 1753 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb))
|
H A D | loop-invariant.c | 516 if (dominated_by_p (CDI_DOMINATORS, loop->latch, body[i]))
|
H A D | loop-iv.c | 273 /* Finds the definition of REG that dominates loop latch and stores 275 dominating the latch. If REG has no definition in loop, DEF 284 struct df_rd_bb_info *bb_info = DF_RD_BB_INFO (df, current_loop->latch); 350 latch. */ 761 LAST_DEF is the definition of REG that dominates loop latch. */ 2555 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit_bb))
|
H A D | lambda-code.c | 2519 newloop->latch = latchbb;
|
H A D | tree-ssa-loop-ivopts.c | 167 IP_END, /* At the end of the latch block. */ 347 /* The single loop exit if it dominates the latch, NULL otherwise. */ 588 if (sbb == loop->latch) 2084 The purpose is to avoid splitting latch edge with a biv increment, thus 2087 is not available (so we do not have a better alternative), or if the latch 4144 /* For now works only for exits that dominate the loop latch. TODO -- extend 4150 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, ex_bb)) 4365 /* Prefer not to insert statements into latch unless there are some
|
/freebsd-9.3-release/sys/boot/i386/boot2/ |
H A D | sio.S | 33 subb $0x3,%dl # Divisor latch reg
|
/freebsd-9.3-release/sys/dev/usb/serial/ |
H A D | uslcom.c | 702 uint8_t latch; local 712 USETW(req.wLength, sizeof(latch)); 715 &req, &latch, 0, 1000)) { 719 *(int *)data = latch;
|