Home
last modified time | relevance | path

Searched refs:latch (Results 1 – 25 of 38) sorted by relevance

12

/freebsd-10-stable/contrib/gcc/
Dcfgloop.c133 loop->header->index, loop->latch->index); in flow_loop_dump()
233 if (loop->latch->loop_father != loop) in flow_loop_nodes_find()
238 stack[sp++] = loop->latch; in flow_loop_nodes_find()
239 loop->latch->loop_father = loop; in flow_loop_nodes_find()
240 loop->latch->loop_depth = loop->depth; in flow_loop_nodes_find()
478 basic_block latch = e->src; in canonicalize_loop_headers() local
483 if (latch != ENTRY_BLOCK_PTR in canonicalize_loop_headers()
484 && dominated_by_p (CDI_DOMINATORS, latch, header)) in canonicalize_loop_headers()
647 basic_block latch = e->src; in flow_loops_find() local
656 if (latch != ENTRY_BLOCK_PTR in flow_loops_find()
[all …]
Dcfgloopmanip.c278 e->src->loop_father->latch, e->dest)) in remove_path()
380 n = dfs_enumerate_from (loop->latch, 1, alp_enum_p, in add_loop()
428 loop->latch = latch_edge->src; in loopify()
516 basic_block latch = loop->latch; in unloop() local
550 remove_edge (single_succ_edge (latch)); in unloop()
555 fix_bb_placements (loops, latch, &dummy); in unloop()
792 basic_block header = loop->header, latch = loop->latch; in duplicate_loop_to_header_edge() local
800 int is_latch = (latch == e->src); in duplicate_loop_to_header_edge()
820 gcc_assert (bbs[n - 1] == loop->latch); in duplicate_loop_to_header_edge()
928 first_active_latch = latch; in duplicate_loop_to_header_edge()
[all …]
Dtree-ssa-loop-manip.c495 if (dest->loop_father->latch == src) in bsi_insert_on_edge_immediate_loop()
496 dest->loop_father->latch = new_bb; in bsi_insert_on_edge_immediate_loop()
507 return loop->latch; in ip_end_pos()
520 if (!single_pred_p (loop->latch)) in ip_normal_pos()
523 bb = single_pred (loop->latch); in ip_normal_pos()
529 if (exit->dest == loop->latch) in ip_normal_pos()
547 basic_block bb = ip_normal_pos (loop), latch = ip_end_pos (loop); in standard_iv_increment_position() local
548 tree last = last_stmt (latch); in standard_iv_increment_position()
553 *bsi = bsi_last (latch); in standard_iv_increment_position()
896 exit_bb = single_pred (loop->latch); in tree_unroll_loop()
[all …]
Dtree-if-conv.c449 if (bb != loop->latch) in if_convertible_bb_p()
461 else if (bb == loop->latch in if_convertible_bb_p()
917 gcc_assert (exit_bb != loop->latch); in combine_blocks()
945 redirect_edge_and_branch (e, loop->latch); in combine_blocks()
947 set_immediate_dominator (CDI_DOMINATORS, loop->latch, exit_bb); in combine_blocks()
952 make_edge (loop->header, loop->latch, EDGE_FALLTHRU); in combine_blocks()
953 set_immediate_dominator (CDI_DOMINATORS, loop->latch, loop->header); in combine_blocks()
964 if (bb == exit_bb || bb == loop->latch) in combine_blocks()
1067 gcc_assert (loop->latch != EXIT_BLOCK_PTR); in get_loop_body_in_if_conv_order()
Dcfgloopanal.c39 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb)) in just_once_each_iteration_p()
301 && e->dest->loop_father->latch == act) in mark_irreducible_loops()
424 if (loop->latch->count || loop->header->count) in expected_loop_iterations()
432 if (e->src == loop->latch) in expected_loop_iterations()
453 if (e->src == loop->latch) in expected_loop_iterations()
Dtree-ssa-loop-ch.c103 tree stmt = last_stmt (loop->latch); in do_while_loop_p()
Dcfgloop.h68 basic_block latch; member
Dtree-vectorizer.c547 loop_arg = PHI_ARG_DEF_FROM_EDGE (orig_phi, EDGE_SUCC (loop->latch, 0)); in slpeel_update_phi_nodes_for_guard1()
774 tree begin_label = tree_block_label (loop->latch); in slpeel_make_loop_iterate_ntimes()
878 if (EDGE_SUCC (new_loop->header, 0)->dest == new_loop->latch) in slpeel_tree_duplicate_loop_to_edge_cfg()
986 || !empty_block_p (loop->latch) in slpeel_can_duplicate_loop_p()
Dmodulo-sched.c818 && (EDGE_COUNT (loop->latch->preds) == 1) \
819 && (EDGE_COUNT (loop->latch->succs) == 1))
884 if (loop->latch == loop->header in canon_loop()
885 || EDGE_COUNT (loop->latch->succs) > 1) in canon_loop()
888 if (e->src == loop->latch) in canon_loop()
Dloop-unswitch.c439 latch_edge = single_succ_edge (get_bb_copy (loop->latch)); in unswitch_loop()
Dpredict.c735 if (bb == loop->latch) in predict_loops()
737 e = find_edge (loop->latch, loop->header); in predict_loops()
1705 if (EDGE_COUNT (loop->latch->succs) > 0) in estimate_loops_at_level()
Dloop-unroll.c219 if (desc->in_edge->dest != loop->latch) in loop_exit_at_end_p()
223 FOR_BB_INSNS (loop->latch, insn) in loop_exit_at_end_p()
1743 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb)) in analyze_insns_in_loop()
Dcfglayout.c1239 if (bb->loop_father->latch == bb && bb->loop_father != base) in copy_bbs()
1240 new_bb->loop_father->latch = new_bb; in copy_bbs()
Dtree-ssa-loop-im.c1452 if (dominated_by_p (CDI_DOMINATORS, loop->latch, bb)) in fill_always_executed_in()
1474 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb)) in fill_always_executed_in()
Dtree-vect-analyze.c1947 if (!empty_block_p (loop->latch) in vect_analyze_loop_form()
1948 || phi_nodes (loop->latch)) in vect_analyze_loop_form()
Dtree-cfg.c1245 && b->loop_father->latch == b) in tree_can_merge_blocks_p()
2023 if (loop->latch == bb in remove_bb()
2026 loop->latch = NULL; in remove_bb()
4471 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src)) in tree_duplicate_sese_region()
4536 loop->latch = exit->src; in tree_duplicate_sese_region()
Dtree-ssa-loop-niter.c1054 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src)) in number_of_iterations_exit()
1753 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb)) in infer_loop_bounds_from_undefined()
Dloop-invariant.c516 if (dominated_by_p (CDI_DOMINATORS, loop->latch, body[i])) in compute_always_reached()
/freebsd-10-stable/sys/amd64/vmm/io/
Dvatpit.c191 pit_update_counter(struct vatpit *vatpit, struct channel *c, bool latch) in pit_update_counter() argument
197 if (latch && c->olbyte != 0) in pit_update_counter()
218 if (latch) { in pit_update_counter()
/freebsd-10-stable/sys/dev/usb/serial/
Duslcom.c738 uint8_t latch; in uslcom_ioctl() local
752 USETW(req.wLength, sizeof(latch)); in uslcom_ioctl()
755 &req, &latch, 0, 1000)) { in uslcom_ioctl()
759 *(int *)data = latch; in uslcom_ioctl()
/freebsd-10-stable/sys/boot/i386/boot2/
Dsio.S33 subb $0x3,%dl # Divisor latch reg
/freebsd-10-stable/contrib/gcc/doc/
Dloop.texi49 single latch. During loop analysis, headers of such loops are split and
58 and reachable from its latch against the direction of edges in CFG. The
93 force the latch block of each loop to have only one successor. This
94 ensures that the latch of the loop does not belong to any of its
135 @item @code{header}, @code{latch}: Header and latch basic blocks of the
159 @item @code{loop_latch_edge}: Returns the latch edge of a loop.
182 does not belong to a sub-loop, and it dominates the latch of the loop).
421 the number of executions of the loop latch.
446 the exit statement, not of the loop latch).
/freebsd-10-stable/tools/tools/nanobsd/gateworks/
DG235869 device cambria_led # octal led latch
/freebsd-10-stable/sys/arm/conf/
DCAMBRIA93 device cambria_led # 8-LED latch
/freebsd-10-stable/sys/dev/aic7xxx/
Daic7xxx.seq1148 * data fifo is full, but the PCI input latch is not empty,
1151 * there is space for the input latch to drain.
1602 mov NONE,SCSIDATL; /*dummy read from latch to ACK*/
1736 mov NONE,SCSIDATL; /*dummy read from latch to ACK*/
1766 mov NONE,SCSIDATL; /*dummy read from latch to ACK*/
1772 mov NONE,SCSIDATL; /*dummy read from latch to ACK*/
1981 mov NONE,SCSIDATL; /*dummy read from latch to ACK*/
1997 mov NONE,SCSIDATL ret; /*dummy read from latch to ACK*/
2263 * module has an 8 byte input latch that only
2265 * latch is full.

12