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

12

/freebsd-11-stable/contrib/bmake/unit-tests/
H A Ddotwait.exp25 cycle.1.99
26 cycle.1.99
27 make: Graph cycles through `cycle.2.99'
28 make: Graph cycles through `cycle.2.98'
29 make: Graph cycles through `cycle.2.97'
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-11-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:__anon8602::__anon8603
185 header.s.cycle = cvmx_get_cycle();
476 if (header.s.cycle == 0)
478 printf("%llu: ", (unsigned long long)header.s.cycle);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp37 // the scoreboard. We always make the scoreboard at least 1 cycle deep to
117 int cycle = Stalls; local
130 // We must find one of the stage's units free for every cycle the
134 int StageCycle = cycle + (int)i;
158 LLVM_DEBUG(dbgs() << "*** Hazard in cycle +" << StageCycle << ", ");
164 // Advance the cycle to the next stage.
165 cycle += IS->getNextCycles();
184 unsigned cycle = 0; local
189 // We must reserve one of the stage's units for every cycle the
193 assert(((cycle
[all...]
H A DMachinePipeliner.cpp1011 /// for each cycle that is required. When adding a new instruction, we attempt
1042 // DFA is needed for each cycle.
1337 // Add the artificial dependencies if it does not form a cycle.
2014 // When scheduling a Phi it is better to start at the late cycle and go
2299 // Add the already scheduled instructions at the specified cycle to the
2319 dbgs() << "\tinsert at cycle " << curCycle << " ";
2332 dbgs() << "\tfailed to insert at cycle " << curCycle << " ";
2339 // Return the cycle of the earliest scheduled instruction in the chain.
2362 // Return the cycle of the latest scheduled instruction in the chain.
2405 for (int cycle
[all...]
/freebsd-11-stable/lib/libthr/thread/
H A Dthr_resume_np.c95 thread->cycle++;
96 _thr_umtx_wake(&thread->cycle, 1, 0);
H A Dthr_barrier.c136 int64_t cycle; local
159 cycle = bar->b_cycle;
164 /* test cycle to avoid bogus wakeup */
165 } while (cycle == bar->b_cycle);
H A Dthr_suspend_np.c171 tmp = thread->cycle;
175 _thr_umtx_wait_uint(&thread->cycle, tmp, NULL, 0);
H A Dthr_sig.c354 uint32_t cycle; local
378 curthread->cycle++;
379 cycle = curthread->cycle;
382 _thr_umtx_wake(&curthread->cycle, INT_MAX, 0);
392 _thr_umtx_wait_uint(&curthread->cycle, cycle, NULL, 0);
H A Dthr_exit.c307 curthread->cycle++;
308 _thr_umtx_wake(&curthread->cycle, INT_MAX, 0);
H A Dthr_create.c208 new_thread->cycle++;
209 _thr_umtx_wake(&new_thread->cycle, INT_MAX, 0);
/freebsd-11-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-11-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::__anon1318
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...]
H A Dmodulo-sched.c77 Note: this is different from the cycle-scheduling of schedule_insns;
97 /* The minimum (absolute) cycle that a node of ps was scheduled in. */
100 /* The maximum (absolute) cycle that a node of ps was scheduled in. */
117 /* The (absolute) cycle in which the PS instruction is scheduled.
119 int cycle;
140 /* The earliest absolute cycle of an insn in the partial schedule. */
143 /* The latest absolute cycle of an insn in the partial schedule. */
167 ddg_node_ptr node, int cycle,
181 machine cycle. It can be defined in the config/mach/mach.h file,
208 int asap; /* A lower-bound on the absolute scheduling cycle
118 int cycle; member in struct:ps_insn
2091 create_ps_insn(ddg_node_ptr node, int rest_count, int cycle) argument
2253 add_node_to_ps(partial_schedule_ptr ps, ddg_node_ptr node, int cycle, sbitmap must_precede, sbitmap must_follow) argument
2353 int cycle; local
[all...]
H A Dgenautomata.c342 /* The following field value is maximal cycle number (1, ...) on
346 /* The following field value is minimal cycle number (0, ...) on
364 /* The following is the last cycle on which the unit was checked for
448 /* The following field is used to check up cycle in expression
477 insn `cycle advancing'. */
621 special insn "cycle advancing" which is added by the automaton
670 cycle advancing. */
673 each cycle. */
721 from given state no containing arcs marked by special insn `cycle
736 /* The following field describes that the insn issue (with cycle
3571 int cycle; local
4920 store_alt_unit_usage(regexp_t regexp, regexp_t unit, int cycle, int alt_num) argument
4952 int i, j, k, cycle; local
5140 int cycle; local
5297 int cycle, unit; local
[all...]
/freebsd-11-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-11-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...]
/freebsd-11-stable/sys/powerpc/powermac/
H A Data_macio.c84 int cycle; /* minimum cycle time [ns] */ member in struct:ide_timings
269 min_cycle = udma_timings[mode & ATA_MODE_MASK].cycle;
279 min_cycle = dma_timings[mode & ATA_MODE_MASK].cycle;
302 pio_timings[(mode & ATA_MODE_MASK) - ATA_PIO0].cycle;
/freebsd-11-stable/contrib/gdb/gdb/
H A Dvalprint.c606 int cycle;
612 * the extra bits, which cycle every three bytes:
623 * figure out where in the cycle we are so that we end up with no
638 /* For 32 we start in cycle 2, with two bits and one bit carry;
639 * for 64 in cycle in cycle 1, with one bit and a two bit carry.
641 cycle = (len * BITS_IN_BYTES) % BITS_IN_OCTAL;
651 switch (cycle)
691 cycle++;
692 cycle
605 int cycle; local
[all...]
/freebsd-11-stable/sys/dev/isci/scil/
H A Dscic_sds_controller.h459 * to 0 it will toggel the cycle bit.
461 #define INCREMENT_QUEUE_GET(index, cycle, entry_count, bit_toggle) \
466 (cycle) = (cycle) ^ (bit_toggle); \
/freebsd-11-stable/sys/dev/sound/pcm/
H A Dbuffer.c684 &snd_feeder_maxcycle, 0, "maximum feeder cycle");
693 unsigned int cycle; local
698 cycle = 0;
716 cycle++;
721 if (cycle > snd_feeder_maxcycle)
722 snd_feeder_maxcycle = cycle;
/freebsd-11-stable/contrib/ofed/opensm/opensm/
H A Dosm_ucast_dfsssp.c125 uint8_t status; /* node status in cycle search to avoid recursive function */
127 struct cdg_node *pre; /* to save the path in cycle detection algorithm */
624 /* search for a edge in the cdg which should be removed to break a cycle */
625 static cdg_link_t *get_weakest_link_in_cycle(cdg_node_t * cycle) argument
627 cdg_node_t *current = cycle, *node_with_weakest_link = NULL;
657 /* if complete cycle is traversed */
658 if (current == cycle) {
680 /* search for nodes in the cdg not yet reached in the cycle search process;
722 /* make a DFS on the cdg to check for a cycle */
726 cdg_node_t *cycle local
1889 cdg_node_t **cdg = NULL, *start_here = NULL, *cycle = NULL; local
[all...]
/freebsd-11-stable/contrib/ntp/libntp/
H A Dntp_calendar.c447 * 'cycle'.
451 * 1) res MOD cycle == value MOD cycle
452 * 2) pivot <= res < pivot + cycle
478 * Basically, the function delivers 'pivot + (value - pivot) % cycle',
480 * integer overflows in the '(value - pivot) % cycle' part and adheres
495 int32_t cycle
513 if (cycle > 1)
515 uc = (uint32_t)cycle;
522 else if (cycle <
[all...]
/freebsd-11-stable/secure/lib/libcrypto/arm/
H A Dsha1-armv4-large.S192 eor r11,r11,r12 @ 1 cycle stall
209 eor r11,r11,r12 @ 1 cycle stall
226 eor r11,r11,r12 @ 1 cycle stall
243 eor r11,r11,r12 @ 1 cycle stall
264 eor r11,r11,r12 @ 1 cycle stall
280 eor r11,r11,r12 @ 1 cycle stall
296 eor r11,r11,r12 @ 1 cycle stall
312 eor r11,r11,r12 @ 1 cycle stall
328 eor r11,r11,r12 @ 1 cycle stall
351 eor r11,r11,r12 @ 1 cycle stal
[all...]

Completed in 392 milliseconds

12