| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| ScoreboardHazardRecognizer.cpp | 37 // the scoreboard. We always make the scoreboard at least 1 cycle deep to
118 int cycle = Stalls; local
131 // We must find one of the stage's units free for every cycle the
135 int StageCycle = cycle + (int)i;
159 LLVM_DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", ");
165 // Advance the cycle to the next stage.
166 cycle += IS->getNextCycles();
185 unsigned cycle = 0; local
190 // We must reserve one of the stage's units for every cycle the
194 assert(((cycle + i) < RequiredScoreboard.getDepth()) &
[all...] |
| /src/lib/libmenu/ |
| internals.c | 91 int neighbour, cycle, row_major, edge; local
95 cycle = ((menu->opts & O_NONCYCLIC) != O_NONCYCLIC);
99 if (cycle) {
111 if (cycle)
143 if ((!cycle) && (edge == 1))
150 if (cycle)
184 if ((!cycle) && (edge == 1))
190 if (cycle) {
201 if (cycle)
230 if ((!cycle) && (edge == 1)
[all...] |
| /src/external/gpl3/gdb.old/dist/sim/m68hc11/ |
| interrupts.c | 341 int64_t cycle = cpu_current_cycle (interrupts->cpu); local
349 interrupts->interrupts[i].cpu_cycle = cycle;
624 sim_io_printf (sd, "N Interrupt Cycle Taken Latency"
|
| /src/external/gpl3/gdb/dist/sim/m68hc11/ |
| interrupts.c | 341 int64_t cycle = cpu_current_cycle (interrupts->cpu); local
349 interrupts->interrupts[i].cpu_cycle = cycle;
624 sim_io_printf (sd, "N Interrupt Cycle Taken Latency"
|
| /src/usr.sbin/fwctl/ |
| fwdv.c | 66 {8000*100, 2997}, /* NTSC 8000 cycle / 29.97 Hz */
67 {320, 1}, /* PAL 8000 cycle / 25 Hz */
269 int lsystem=-1, pad_acc, cycle_acc, cycle, f_frac; local
285 cycle_acc = cycle = 0;
370 cycle = 1;
371 cycle_acc = frame_cycle[lsystem].d * cycle;
387 ciph->fdf.dv.cyc = htons(cycle << 12 | f_frac);
404 cycle ++;
412 cycle ++;
|
| /src/sys/arch/macppc/dev/ |
| wdc_obio.c | 218 /* Minimum cycle time is 150ns (DMA MODE 1) on ohare. */
264 int cycle; /* minimum cycle time [ns] */ member in struct:ide_timings
326 min_cycle = pio_timing[piomode].cycle;
342 min_cycle = dma_timing[dmamode].cycle;
392 min_cycle = pio_timing[piomode].cycle;
404 min_cycle = dma_timing[dmamode].cycle;
415 min_cycle = udma_timing[udmamode].cycle;
|
| /src/sys/dev/sbus/ |
| dbrivar.h | 92 int cycle; /* offset of timeslot (bits) */ member in struct:dbri_pipe
|
| /src/usr.bin/m4/ |
| mdef.h | 136 #define cycle for(;;) macro
|
| /src/external/gpl3/gcc/dist/gcc/ |
| sel-sched-dump.cc | 406 int cycle = INSN_SCHED_CYCLE (i);
408 if (cycle != 0)
409 sel_print ("cycle:%d;", cycle);
569 /* '+' before insn means it is a new cycle start and it's not been
403 int cycle = INSN_SCHED_CYCLE (i); local
|
| mcf.cc | 36 cancel_negative_cycle: While G contains a negative cost cycle C, reverse
37 the flow on the found cycle by the minimum residual capacity in that
38 cycle.
87 /* Residual flow for this edge - used during negative cycle canceling. */
768 /* Finds a negative cycle in the residual network using
769 the Bellman-Ford algorithm. The flow on the found cycle is reversed by the
770 minimum residual capacity of that cycle. ENTRY and EXIT vertices are not
778 CYCLE - Vector to hold the minimum cost cycle
781 true if a negative cycle was found, false otherwise. *
1307 int *cycle; local
[all...] |
| gcov.cc | 97 /* used in cycle search, so that we do not clobber original counts. */
118 unsigned int cycle : 1; member in struct:arc_info
205 /* Single line graph cycle workspace. Used for all-blocks
209 } cycle; /* Used in all-blocks mode, after blocks are linked onto member in class:block_info
223 cycle.arc = NULL;
748 /* Cycle detection!
757 simple paths)--the node is unblocked only when it participates in a cycle.
763 /* Handle cycle identified by EDGES, where the function finds minimum cs_count
770 /* Find the minimum edge of the cycle, and reduce all nodes in the cycle b
[all...] |
| modulo-sched.cc | 72 Note: this is different from the cycle-scheduling of schedule_insns;
105 /* The minimum (absolute) cycle that a node of ps was scheduled in. */
108 /* The maximum (absolute) cycle that a node of ps was scheduled in. */
129 /* The (absolute) cycle in which the PS instruction is scheduled.
131 int cycle;
183 /* The earliest absolute cycle of an insn in the partial schedule. */
186 /* The latest absolute cycle of an insn in the partial schedule. */
236 int time; /* The absolute scheduling cycle. */
467 the CYCLE of U and MIN_CYCLE.
470 because the stages may not be aligned on cycle 0. *
130 int cycle; member in struct:ps_insn
3164 int cycle; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| sel-sched-dump.cc | 406 int cycle = INSN_SCHED_CYCLE (i);
408 if (cycle != 0)
409 sel_print ("cycle:%d;", cycle);
569 /* '+' before insn means it is a new cycle start and it's not been
403 int cycle = INSN_SCHED_CYCLE (i); local
|
| mcf.cc | 36 cancel_negative_cycle: While G contains a negative cost cycle C, reverse
37 the flow on the found cycle by the minimum residual capacity in that
38 cycle.
87 /* Residual flow for this edge - used during negative cycle canceling. */
768 /* Finds a negative cycle in the residual network using
769 the Bellman-Ford algorithm. The flow on the found cycle is reversed by the
770 minimum residual capacity of that cycle. ENTRY and EXIT vertices are not
778 CYCLE - Vector to hold the minimum cost cycle
781 true if a negative cycle was found, false otherwise. *
1307 int *cycle; local
[all...] |
| /src/sys/uvm/ |
| uvm_pdpolicy_clockpro.c | 352 int cycle; member in struct:bucket
422 b->cycle = cycle_target;
452 const int cycle = b->cycle; local
456 todo = target - cycle;
473 b->cycle = target;
|
| /src/external/gpl3/binutils/dist/bfd/ |
| linker.c | 1321 CYCLE, /* Repeat with symbol pointed to. */
1322 REFC, /* Mark indirect symbol referenced and then CYCLE. */
1323 WARNC /* Issue warning and then CYCLE. */
1334 /* DEF_ROW */ {DEF, DEF, DEF, MDEF, DEF, CDEF, MIND, CYCLE },
1335 /* DEFW_ROW */ {DEFW, DEFW, DEFW, NOACT, NOACT, NOACT, NOACT, CYCLE },
1337 /* INDR_ROW */ {IND, IND, IND, MDEF, IND, CIND, MIND, CYCLE },
1339 /* SET_ROW */ {SET, SET, SET, SET, SET, SET, CYCLE, CYCLE }
1439 bool cycle;
1519 cycle = false
1434 bool cycle; local
[all...] |
| /src/external/gpl3/binutils.old/dist/bfd/ |
| linker.c | 1319 CYCLE, /* Repeat with symbol pointed to. */
1320 REFC, /* Mark indirect symbol referenced and then CYCLE. */
1321 WARNC /* Issue warning and then CYCLE. */
1332 /* DEF_ROW */ {DEF, DEF, DEF, MDEF, DEF, CDEF, MIND, CYCLE },
1333 /* DEFW_ROW */ {DEFW, DEFW, DEFW, NOACT, NOACT, NOACT, NOACT, CYCLE },
1335 /* INDR_ROW */ {IND, IND, IND, MDEF, IND, CIND, MIND, CYCLE },
1337 /* SET_ROW */ {SET, SET, SET, SET, SET, SET, CYCLE, CYCLE }
1437 bool cycle;
1517 cycle = false
1432 bool cycle; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/fortran/ |
| parse.cc | 514 match ("cycle", gfc_match_cycle, ST_CYCLE);
2181 p = "CYCLE";
6033 bool cycle = true; local
6084 cycle = false;
6088 if (!cycle)
|
| /src/external/gpl3/gcc.old/dist/gcc/fortran/ |
| parse.cc | 461 match ("cycle", gfc_match_cycle, ST_CYCLE);
1979 p = "CYCLE";
5636 bool cycle = true; local
5681 cycle = false;
5685 if (!cycle)
|
| /src/external/gpl3/gdb.old/dist/bfd/ |
| linker.c | 1303 CYCLE, /* Repeat with symbol pointed to. */
1304 REFC, /* Mark indirect symbol referenced and then CYCLE. */
1305 WARNC /* Issue warning and then CYCLE. */
1316 /* DEF_ROW */ {DEF, DEF, DEF, MDEF, DEF, CDEF, MIND, CYCLE },
1317 /* DEFW_ROW */ {DEFW, DEFW, DEFW, NOACT, NOACT, NOACT, NOACT, CYCLE },
1319 /* INDR_ROW */ {IND, IND, IND, MDEF, IND, CIND, MIND, CYCLE },
1321 /* SET_ROW */ {SET, SET, SET, SET, SET, SET, CYCLE, CYCLE }
1403 bool cycle;
1483 cycle = false
1398 bool cycle; local
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/ |
| valprint.c | 1579 int cycle;
1582 * the extra bits, which cycle every three bytes:
1590 * Cycle number: 0 1 2
1593 * figure out where in the cycle we are so that we end up with no
1601 "cycle zero constants are wrong");
1607 "cycle one constants are wrong");
1612 "cycle two constants are wrong");
1614 /* For 32 we start in cycle 2, with two bits and one bit carry;
1615 for 64 in cycle in cycle 1, with one bit and a two bit carry. *
1578 int cycle; local
[all...] |
| /src/external/gpl3/gdb/dist/bfd/ |
| linker.c | 1319 CYCLE, /* Repeat with symbol pointed to. */
1320 REFC, /* Mark indirect symbol referenced and then CYCLE. */
1321 WARNC /* Issue warning and then CYCLE. */
1332 /* DEF_ROW */ {DEF, DEF, DEF, MDEF, DEF, CDEF, MIND, CYCLE },
1333 /* DEFW_ROW */ {DEFW, DEFW, DEFW, NOACT, NOACT, NOACT, NOACT, CYCLE },
1335 /* INDR_ROW */ {IND, IND, IND, MDEF, IND, CIND, MIND, CYCLE },
1337 /* SET_ROW */ {SET, SET, SET, SET, SET, SET, CYCLE, CYCLE }
1437 bool cycle;
1517 cycle = false
1432 bool cycle; local
[all...] |
| /src/external/gpl3/gdb/dist/gdb/ |
| valprint.c | 1579 int cycle;
1582 * the extra bits, which cycle every three bytes:
1590 * Cycle number: 0 1 2
1593 * figure out where in the cycle we are so that we end up with no
1601 "cycle zero constants are wrong");
1607 "cycle one constants are wrong");
1612 "cycle two constants are wrong");
1614 /* For 32 we start in cycle 2, with two bits and one bit carry;
1615 for 64 in cycle in cycle 1, with one bit and a two bit carry. *
1578 int cycle; local
[all...] |
| /src/usr.bin/make/ |
| make.h | 229 * state indicates a cycle in the graph.
402 bool cycle:1; member in struct:GNodeFlags
|
| /src/sys/dev/ieee1394/ |
| fwohci.c | 91 "nocyclemaster", SYSCTL_DESCR("Do not send cycle start packets"),
998 /* Clear cycle match counter bits */
1001 /* 2bit second + 13bit cycle */
1923 int sec, cycle, cycle_match; local
1925 cycle = cycle_now & 0x1fff;
1933 cycle = cycle + CYCLE_DELAY;
1934 if (cycle >= 8000) {
1936 cycle -= 8000;
1938 cycle = roundup2(cycle, CYCLE_MOD)
[all...] |
