cycle
bool cycle = (menu->opt & O_NONCYCLIC) ? FALSE : TRUE;
(cycle ? menu->items[(Last_in_Row >= Number_Of_Items) ?
(cycle ? menu->items[row * Number_Of_Columns] :
(cycle ? menu->items[(Last_in_Column >= Number_Of_Items) ?
(cycle ? menu->items[(row + 1) < menu->rows ?
(cycle ? (Last_in_Column >= Number_Of_Items) ?
(cycle ? menu->items[row] : (ITEM *)0);
(cycle ?
(cycle ?
int cycle; /* minimum cycle time [ns] */
min_cycle = pio_timing[piomode].cycle;
min_cycle = dma_timing[dmamode].cycle;
min_cycle = pio_timing[piomode].cycle;
min_cycle = dma_timing[dmamode].cycle;
min_cycle = udma_timing[udmamode].cycle;
#define rdcycle() csr_read(cycle)
DECLARE_CSR(cycle, CSR_CYCLE)
int cycle;
cycle = 0;
cycle += 1;
cyclenlp = &cyclenl[cycle];
cyclenlp -> cycleno = cycle; /* internal number of cycle on */
printf( " is the head of cycle %d\n" , cycle );
memberp -> cycleno = cycle;
if ( arcp -> arc_parentp -> cycleno == cycle ) {
int cycle;
for ( cycle = 1 ; cycle <= ncycle ; cycle += 1 ) {
cyclenlp = &cyclenl[ cycle ];
cycle {
bool cycle = false;
cycle = true;
return cycle;
struct growableArray cycle;
Array_Init(&cycle, 16); /* cycles are generally shorter */
Array_Reset(&cycle);
c = find_cycle(t, &cycle);
print_unlink_cycle(&cycle, c);
free(cycle.a);
find_cycle(Lst l, struct growableArray *cycle)
Array_Push(cycle, gn);
c = find_cycle(&gn->children, cycle);
Array_Pop(cycle);