Searched refs:cycle (Results 1 - 25 of 64) sorted by relevance

123

/freebsd-10-stable/contrib/ofed/management/infiniband-diags/scripts/
H A Dibswportwatch.pl139 my $cycle = -1; # forever
150 if (defined $Getopt::Std::opt_n) { $cycle = $Getopt::Std::opt_n; }
161 while ($cycle != 0) {
170 if ($cycle != -1) { $cycle = $cycle - 1; }
/freebsd-10-stable/contrib/bmake/unit-tests/
H A Ddotwait.exp25 make: Graph cycles through `cycle.2.99'
26 make: Graph cycles through `cycle.2.98'
27 make: Graph cycles through `cycle.2.97'
28 cycle.1.99
29 cycle.1.99
H A Ddotwait.mk5 TESTS= simple recursive shared cycle
56 # cycle: the cyclic dependency must not cause infinite recursion
58 cycle: cycle.1.99 .WAIT cycle.2.99
59 cycle.2.99: cycle.2.98 _ECHOUSE
60 cycle.2.98: cycle.2.97 _ECHOUSE
61 cycle
[all...]
/freebsd-10-stable/sys/contrib/octeon-sdk/
H A Dcvmx-clock.h81 * Get cycle count based on the clock type.
111 uint64_t cycle;
112 CVMX_RDHWR(cycle, 31);
113 return(cycle);
H A Dcvmx-log.c85 uint64_t cycle :53; /* Low bits of the cycle counter as a timestamp */ member in struct:__anon7284::__anon7285
185 header.s.cycle = cvmx_get_cycle();
476 if (header.s.cycle == 0)
478 printf("%llu: ", (unsigned long long)header.s.cycle);
/freebsd-10-stable/contrib/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp43 // the scoreboard. We always make the scoreboard at least 1 cycle deep to
123 int cycle = Stalls; local
136 // We must find one of the stage's units free for every cycle the
140 int StageCycle = cycle + (int)i;
164 DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", ");
171 // Advance the cycle to the next stage.
172 cycle += IS->getNextCycles();
191 unsigned cycle = 0; local
196 // We must reserve one of the stage's units for every cycle the
200 assert(((cycle
[all...]
/freebsd-10-stable/sys/gnu/dts/arm/
H A Domap2420-h4.dts44 gpmc,rd-cycle-ns = <170>;
45 gpmc,wr-cycle-ns = <170>;
H A Domap3430-sdp.dts76 gpmc,rd-cycle-ns = <186>;
77 gpmc,wr-cycle-ns = <186>;
122 gpmc,rd-cycle-ns = <72>;
123 gpmc,wr-cycle-ns = <72>;
167 gpmc,rd-cycle-ns = <108>;
168 gpmc,wr-cycle-ns = <96>;
H A Domap-gpmc-smsc911x.dtsi39 gpmc,rd-cycle-ns = <155>;
40 gpmc,wr-cycle-ns = <155>;
H A Domap-gpmc-smsc9221.dtsi42 gpmc,rd-cycle-ns = <60>;
43 gpmc,wr-cycle-ns = <54>;
H A Domap2430-sdp.dts61 gpmc,rd-cycle-ns = <187>;
62 gpmc,wr-cycle-ns = <187>;
H A Ddm8168-evm.dts81 gpmc,rd-cycle-ns = <82>;
82 gpmc,wr-cycle-ns = <82>;
H A Domap-zoom-common.dtsi41 gpmc,rd-cycle-ns = <155>;
42 gpmc,wr-cycle-ns = <155>;
H A Domap3-devkit8000.dts125 gpmc,rd-cycle-ns = <82>;
126 gpmc,wr-cycle-ns = <82>;
H A Domap3-sb-t35.dtsi123 gpmc,rd-cycle-ns = <155>;
124 gpmc,wr-cycle-ns = <155>;
H A Domap3-igep.dtsi121 gpmc,rd-cycle-ns = <82>;
122 gpmc,wr-cycle-ns = <82>;
/freebsd-10-stable/lib/libthr/thread/
H A Dthr_resume_np.c94 thread->cycle++;
95 _thr_umtx_wake(&thread->cycle, 1, 0);
H A Dthr_barrier.c106 int64_t cycle; local
122 cycle = bar->b_cycle;
127 /* test cycle to avoid bogus wakeup */
128 } while (cycle == bar->b_cycle);
H A Dthr_suspend_np.c170 tmp = thread->cycle;
174 _thr_umtx_wait_uint(&thread->cycle, tmp, NULL, 0);
H A Dthr_exit.c293 curthread->cycle++;
294 _thr_umtx_wake(&curthread->cycle, INT_MAX, 0);
/freebsd-10-stable/contrib/ncurses/menu/
H A Dm_global.c389 bool cycle = (menu->opt & O_NONCYCLIC) ? FALSE : TRUE; local
407 (cycle ? menu->items[(Last_in_Row >= Number_Of_Items) ?
416 (cycle ? menu->items[row * Number_Of_Columns] :
423 (cycle ? menu->items[(Last_in_Column >= Number_Of_Items) ?
431 (cycle ? menu->items[(row + 1) < menu->rows ?
455 (cycle ? (Last_in_Column >= Number_Of_Items) ?
463 (cycle ? menu->items[row] : (ITEM *) 0);
469 (cycle ?
480 (cycle ?
/freebsd-10-stable/sys/powerpc/powermac/
H A Data_macio.c84 int cycle; /* minimum cycle time [ns] */ member in struct:ide_timings
265 min_cycle = udma_timings[mode & ATA_MODE_MASK].cycle;
275 min_cycle = dma_timings[mode & ATA_MODE_MASK].cycle;
298 pio_timings[(mode & ATA_MODE_MASK) - ATA_PIO0].cycle;
/freebsd-10-stable/contrib/gcc/
H A Dgcov.c84 /* used in cycle search, so that we do not clobber original counts. */
102 unsigned int cycle : 1; member in struct:arc_info
152 /* Single line graph cycle workspace. Used for all-blocks
156 } cycle; /* Used in all-blocks mode, after blocks are linked onto member in union:block_info::__anon1138
1526 block->u.cycle.arc = NULL;
1527 block->u.cycle.ident = ~0U;
1607 block->u.cycle.ident = ix;
1618 if (arc->src->u.cycle.ident != ix)
1643 count. Decrease flow over the cycle and remove the arc
1657 arc->cycle
[all...]
/freebsd-10-stable/usr.sbin/fwcontrol/
H A Dfwdv.c68 {8000*100, 2997}, /* NTSC 8000 cycle / 29.97 Hz */
69 {320, 1}, /* PAL 8000 cycle / 25 Hz */
263 int system=-1, pad_acc, cycle_acc, cycle, f_cycle, f_frac; local
354 cycle = 1;
355 cycle_acc = frame_cycle[system].d * cycle;
370 ciph->fdf.dv.cyc = htons(cycle << 12 | f_frac);
387 cycle ++;
395 cycle ++;
/freebsd-10-stable/usr.bin/gprof/
H A Darcs.c161 * link together nodes on the same cycle
174 printf("[doarcs] pass %ld, cycle(s) %d\n" , pass , ncycle );
181 "to reduce the maximum cycle size to", cyclethreshold );
236 * and cycle headers.
332 * add this share to the parent's cycle header, if any.
358 int cycle; local
363 * Count the number of cycles, and initialize the cycle lists
375 * cyclenl is indexed by cycle number:
380 errx( 1 , "no room for %zu bytes of cycle headers" ,
384 * number them, accumulate the data for the cycle
762 int cycle; local
[all...]

Completed in 321 milliseconds

123