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

1 2 3 4 5 6 7 8 9

  /src/external/gpl3/gcc.old/dist/gcc/
cfgloop.cc 89 /* Returns the list of the latch edges of LOOP. */
126 if (loop->latch)
127 fprintf (file, "latch %d\n", loop->latch->index);
142 if (loop->latch)
237 edge latch;
242 FOR_EACH_EDGE (latch, latch_ei, loop->header->preds)
244 if (latch->src->loop_father == loop
245 || !dominated_by_p (CDI_DOMINATORS, latch->src, loop->header))
249 stack.safe_push (latch->src)
236 edge latch; local
405 basic_block latch = e->src; local
518 basic_block latch = e->src; local
647 edge e, latch = latches[0]; local
700 edge latch = NULL; local
764 edge latch, e; local
    [all...]
cfgloopmanip.cc 339 if (dominated_by_p (CDI_DOMINATORS, l->latch, e->dest))
435 /* Given LOOP structure with filled header and latch, find the body of the
506 determined by comparing header edge count to latch ege count and thus
572 && other_e->dest != loop->latch
576 "exit condition to latch\n");
598 /* If latch exists, change its count, since we changed
600 source of exit edge to latch, but for vectorizer this is enough. */
601 if (loop->latch && loop->latch != e->src)
602 loop->latch->count += count_delta
866 basic_block latch = loop->latch; local
1069 basic_block header = loop->header, latch = loop->latch; local
    [all...]
gimple-loop-jam.cc 172 other edge (the one leading to the outer latch block) they are
195 /* When fusing the loops we skip the latch block
198 if (!empty_block_p (loop->latch))
219 if (!dominated_by_p (CDI_DOMINATORS, outer->latch, loop->header))
328 remove_branch (single_pred_edge (loop->latch));
330 basic_block oldlatch = loop->latch;
331 loop->latch = NULL;
335 loop->latch = e->src;
gimple-ssa-split-paths.cc 39 /* Given LATCH, the latch block in a loop, see if the shape of the
40 path reaching LATCH is suitable for being split by duplication.
45 find_block_to_duplicate_for_splitting_paths (basic_block latch)
47 /* We should have simple latches at this point. So the latch should
48 have a single successor. This implies the predecessor of the latch
51 the latch have a single predecessor too. */
52 if (single_succ_p (latch) && single_pred_p (latch))
54 basic_block bb = get_immediate_dominator (CDI_DOMINATORS, latch);
    [all...]
cfghooks.cc 558 /* Identify all loops bb may have been the latch of and adjust them. */
560 if (e->dest->loop_father->latch == bb)
561 e->dest->loop_father->latch = new_bb;
625 /* If we remove the header or the latch of a loop, mark the loop for
627 if (loop->latch == bb
723 /* If we split the latch edge of loop adjust the latch block. */
724 if (loop->latch == src
726 loop->latch = ret;
839 /* If we merge a loop latch into its predecessor, update the loo
    [all...]
cfgloopanal.cc 48 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, bb))
63 throw away all latch edges and mark blocks inside any remaining cycle.
114 /* Ignore latch edges. */
263 else if (loop->latch && (loop->latch->count.initialized_p ()
270 if (e->src == loop->latch)
500 order against direction of edges from latch. Specially, if
501 header != latch, latch is the 1-st block. */
tree-ssa-loop-manip.cc 838 return loop->latch;
851 if (!single_pred_p (loop->latch))
854 bb = single_pred (loop->latch);
861 if (exit->dest == loop->latch)
871 (just before the exit condition if it is available and latch block is empty,
872 end of the latch block otherwise) to BSI. INSERT_AFTER is set to true if
879 basic_block bb = ip_normal_pos (loop), latch = ip_end_pos (loop); local
880 gimple *last = last_stmt (latch);
885 *bsi = gsi_last_bb (latch);
1086 /* Convert the latch count to an iteration count. *
    [all...]
graph.cc 208 && loop->latch != EXIT_BLOCK_PTR_FOR_FN (cfun))
227 if (loop->latch == EXIT_BLOCK_PTR_FOR_FN (cfun))
241 if (loop->latch != EXIT_BLOCK_PTR_FOR_FN (cfun))
tree-if-conv.cc 522 if (dominated_by_p (CDI_DOMINATORS, loop->latch, bb))
587 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, e->dest))
1136 - it is after the exit block but before the latch,
1161 if (bb != loop->latch)
1164 fprintf (dump_file, "basic block after exit bb but before latch\n");
1173 else if (bb == loop->latch
1178 fprintf (dump_file, "latch is not dominated by exit_block\n");
1226 gcc_assert (loop->latch != EXIT_BLOCK_PTR_FOR_FN (cfun));
1301 /* The loop latch and loop exit block are always executed and
1303 if (bb == loop->latch
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
cfgloop.cc 90 /* Returns the list of the latch edges of LOOP. */
127 if (loop->latch)
128 fprintf (file, "latch %d\n", loop->latch->index);
230 edge latch;
235 FOR_EACH_EDGE (latch, latch_ei, loop->header->preds)
237 if (latch->src->loop_father == loop
238 || !dominated_by_p (CDI_DOMINATORS, latch->src, loop->header))
242 stack.safe_push (latch->src);
243 latch->src->loop_father = loop
229 edge latch; local
398 basic_block latch = e->src; local
511 basic_block latch = e->src; local
640 edge e, latch = latches[0]; local
693 edge latch = NULL; local
757 edge latch, e; local
    [all...]
gimple-loop-jam.cc 173 other edge (the one leading to the outer latch block) they are
196 /* When fusing the loops we skip the latch block
199 if (!empty_block_p (loop->latch))
220 if (!dominated_by_p (CDI_DOMINATORS, outer->latch, loop->header))
329 remove_branch (single_pred_edge (loop->latch));
331 basic_block oldlatch = loop->latch;
332 loop->latch = NULL;
336 loop->latch = e->src;
gimple-ssa-split-paths.cc 39 /* Given LATCH, the latch block in a loop, see if the shape of the
40 path reaching LATCH is suitable for being split by duplication.
45 find_block_to_duplicate_for_splitting_paths (basic_block latch)
47 /* We should have simple latches at this point. So the latch should
48 have a single successor. This implies the predecessor of the latch
51 the latch have a single predecessor too. */
52 if (single_succ_p (latch) && single_pred_p (latch))
54 basic_block bb = get_immediate_dominator (CDI_DOMINATORS, latch);
    [all...]
cfghooks.cc 559 /* Identify all loops bb may have been the latch of and adjust them. */
561 if (e->dest->loop_father->latch == bb)
562 e->dest->loop_father->latch = new_bb;
626 /* If we remove the header or the latch of a loop, mark the loop for
628 if (loop->latch == bb
724 /* If we split the latch edge of loop adjust the latch block. */
725 if (loop->latch == src
727 loop->latch = ret;
840 /* If we merge a loop latch into its predecessor, update the loo
    [all...]
cfgloopmanip.cc 340 if (dominated_by_p (CDI_DOMINATORS, l->latch, e->dest))
436 /* Given LOOP structure with filled header and latch, find the body of the
662 /* If there is only loop latch after other edge,
665 if (other_edge && other_edge->dest == loop->latch)
667 if (single_pred_p (loop->latch))
668 loop->latch->count = loop->latch->count
684 determined by comparing header edge count to latch ege count and thus
920 /* Create header, latch and wire up the loop. */
936 loop->latch = loop_latch
1002 basic_block latch = loop->latch; local
1205 basic_block header = loop->header, latch = loop->latch; local
    [all...]
graph.cc 208 && loop->latch != EXIT_BLOCK_PTR_FOR_FN (cfun))
227 if (loop->latch == EXIT_BLOCK_PTR_FOR_FN (cfun))
241 if (loop->latch != EXIT_BLOCK_PTR_FOR_FN (cfun))
tree-ssa-loop-manip.cc 764 return loop->latch;
776 if (!single_pred_p (loop->latch))
779 bb = single_pred (loop->latch);
784 if (exit->dest == loop->latch)
794 (just before the exit condition if it is available and latch block is empty,
795 end of the latch block otherwise) to BSI. INSERT_AFTER is set to true if
802 basic_block bb = ip_normal_pos (loop), latch = ip_end_pos (loop); local
803 gimple *last = last_nondebug_stmt (latch);
808 *bsi = gsi_last_bb (latch);
1009 /* Convert the latch count to an iteration count. *
    [all...]
tree-ssa-loop-split.cc 246 edge latch = loop_latch_edge (loop); local
255 tree next = PHI_ARG_DEF_FROM_EDGE (phi, latch);
539 if (bbs1[j] == loop1->latch
552 if (bbs2[j] == loop2->latch
581 /* ??? We could handle non-empty latches when we split the latch edge
585 || !empty_block_p (loop1->latch)
735 /* +1 to get header interations rather than latch iterations and then
878 const edge latch = loop_latch_edge (loop); local
880 const tree last = PHI_ARG_DEF_FROM_EDGE (vphi, latch);
885 .MEM_1 = PHI <.MEM_2(loop entry edge), .MEM_1(latch edge)
1150 const_edge latch = loop_latch_edge (loop); local
    [all...]
  /src/sys/arch/hppa/dev/
gftfb.c 1035 uint32_t latch = 0, bg8, fg8, pixel, mask; local
1119 latch = (latch << 8) | pixel;
1122 gftfb_write4(sc, NGLE_BINC_DATA_R, latch);
1123 latch = 0;
1127 /* if we have pixels left in latch write them out */
1129 latch = latch << ((4 - (i & 3)) << 3);
1130 /* make sure we write only the pixels in the latch */
1132 gftfb_write4(sc, NGLE_BINC_DATA_R, latch);
1341 uint32_t buffer[128], latch, tmp; local
    [all...]
hyperfb.c 1244 uint32_t latch = 0, bg8, fg8, pixel, mask; local
1329 latch = (latch << 8) | pixel;
1332 hyperfb_write4(sc, NGLE_BINC_DATA_R, latch);
1333 latch = 0;
1337 /* if we have pixels left in latch write them out */
1339 latch = latch << ((4 - (i & 3)) << 3);
1340 /* make sure we write only the pixels in the latch */
1342 hyperfb_write4(sc, NGLE_BINC_DATA_R, latch);
1547 uint32_t buffer[128], latch, tmp; local
    [all...]
summitfb.c 1382 uint32_t buffer[128], latch, tmp; local
1388 latch = 0;
1390 latch |= tmp >> 7;
1392 latch |= tmp >> 5;
1394 latch |= tmp >> 3;
1396 latch |= tmp >> 1;
1398 latch |= tmp << 1;
1400 latch |= tmp << 3;
1402 latch |= tmp << 5;
1404 latch |= tmp << 7
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/precompiled/
stdc++.h 144 #include <latch>
  /src/sys/arch/macppc/dev/
lightbar.c 267 uint32_t latch; local
306 latch = 0;
309 latch |= 1 << (j + 16);
311 sc->sc_dmabuf[i] = LEDMASK(latch);
  /src/external/gpl3/gdb.old/dist/sim/bfin/
dv-bfin_pint.c 45 bu32 latch; member in struct:bfin_pint
86 case mmr_offset(latch):
155 case mmr_offset(latch):
  /src/external/gpl3/gdb/dist/sim/bfin/
dv-bfin_pint.c 45 bu32 latch; member in struct:bfin_pint
86 case mmr_offset(latch):
155 case mmr_offset(latch):
  /src/sys/dev/sun/
cgsix.c 1101 uint32_t latch, tmp; local
1105 latch = 0;
1107 latch |= tmp >> 7;
1109 latch |= tmp >> 5;
1111 latch |= tmp >> 3;
1113 latch |= tmp >> 1;
1115 latch |= tmp << 1;
1117 latch |= tmp << 3;
1119 latch |= tmp << 5;
1121 latch |= tmp << 7
1478 uint32_t latch, res = 0, shift; local
1558 uint32_t bg, latch = 0, bg8, fg8, pixel; local
    [all...]

Completed in 40 milliseconds

1 2 3 4 5 6 7 8 9