next 6380 src/decNumber/decNumber.c uInt next; // work next 6388 src/decNumber/decNumber.c next=0; // all paths next 6402 src/decNumber/decNumber.c next+=quot; next 6405 src/decNumber/decNumber.c next+=*source/powers[cut]; next 6407 src/decNumber/decNumber.c if (target<=first) *target=(Unit)next; // write to target iff valid next 6408 src/decNumber/decNumber.c next=rem*powers[DECDPUN-cut]; // save remainder for next Unit next 6414 src/decNumber/decNumber.c *target=(Unit)next; next 6415 src/decNumber/decNumber.c next=0; next 5876 src/dps8/dps8_eis.c word9 next = EISget49(cpup, &e->ADDR2, &e->mopPos, CTN9); next 5878 src/dps8/dps8_eis.c word9 next = EISget49(cpup, e->mopAddress, &e->mopPos, CTN9); next 5882 src/dps8/dps8_eis.c e->editInsertionTable[e->mopIF - 1] = next; next 5883 src/dps8/dps8_eis.c sim_debug (DBG_TRACEEXT, & cpu_dev, "LTE IT[%d]<=%d\n", e -> mopIF - 1, next); next 237 src/dps8/dps8_math.c long double exponents[20], *next; next 253 src/dps8/dps8_math.c for (next = exponents, exponents[0] = 2.0L, bit = 1; next 254 src/dps8/dps8_math.c *next <= x + x; next 255 src/dps8/dps8_math.c bit <<= 1, next[1] = next[0] * next[0], next++); next 257 src/dps8/dps8_math.c for (; next >= exponents; bit >>= 1, next--) next 258 src/dps8/dps8_math.c if (x + x >= *next) next 260 src/dps8/dps8_math.c x /= *next; next 268 src/dps8/dps8_math.c for (next = exponents, exponents[0] = 0.5L, bit = 1; next 269 src/dps8/dps8_math.c *next > x; next 270 src/dps8/dps8_math.c bit <<= 1, next[1] = next[0] * next[0], next++); next 272 src/dps8/dps8_math.c for (; next >= exponents; bit >>= 1, next--) next 273 src/dps8/dps8_math.c if (x < *next) next 275 src/dps8/dps8_math.c x /= *next; next 386 src/libsir/include/sir/types.h struct _sir_queue_node* next; next 75 src/libsir/src/sirqueue.c sir_queue_node* next = (*q)->head; next 76 src/libsir/src/sirqueue.c while (next) { next 77 src/libsir/src/sirqueue.c sir_queue_node* this_node = next; next 79 src/libsir/src/sirqueue.c next = this_node->next; next 95 src/libsir/src/sirqueue.c sir_queue_node* next = q->head->next; next 97 src/libsir/src/sirqueue.c while (next) { next 99 src/libsir/src/sirqueue.c next = next->next; next 117 src/libsir/src/sirqueue.c sir_queue_node* next = q->head; next 118 src/libsir/src/sirqueue.c while (next) { next 119 src/libsir/src/sirqueue.c if (!next->next) { next 120 src/libsir/src/sirqueue.c next->next = _sir_queue_node_create(data); next 121 src/libsir/src/sirqueue.c if (next->next) { next 126 src/libsir/src/sirqueue.c next = next->next; next 139 src/libsir/src/sirqueue.c q->head = old_head->next; next 5557 src/simh/scp.c for (uptr = sim_clock_queue; uptr != QUEUE_LIST_END; uptr = uptr->next) { next 6513 src/simh/scp.c sim_clock_queue = uptr->next; next 6514 src/simh/scp.c uptr->next = NULL; next 8680 src/simh/scp.c sim_clock_queue = uptr->next; /* remove first */ next 8681 src/simh/scp.c uptr->next = NULL; /* hygiene */ next 8754 src/simh/scp.c for (cptr = sim_clock_queue; cptr != QUEUE_LIST_END; cptr = cptr->next) { next 8761 src/simh/scp.c cptr = uptr->next = sim_clock_queue; next 8765 src/simh/scp.c cptr = uptr->next = prvptr->next; /* insert at prvptr */ next 8766 src/simh/scp.c prvptr->next = uptr; next 8836 src/simh/scp.c nptr = sim_clock_queue = uptr->next; next 8837 src/simh/scp.c uptr->next = NULL; /* hygiene */ next 8840 src/simh/scp.c for (cptr = sim_clock_queue; cptr != QUEUE_LIST_END; cptr = cptr->next) { next 8841 src/simh/scp.c if (cptr->next == uptr) { next 8842 src/simh/scp.c nptr = cptr->next = uptr->next; next 8843 src/simh/scp.c uptr->next = NULL; /* hygiene */ next 8849 src/simh/scp.c nptr->time += (uptr->next) ? 0 : uptr->time; next 8850 src/simh/scp.c if (!uptr->next) next 8855 src/simh/scp.c if (uptr->next) { next 8876 src/simh/scp.c if (uptr->next == NULL) next 8895 src/simh/scp.c for (cptr = sim_clock_queue; cptr != QUEUE_LIST_END; cptr = cptr->next) { next 8933 src/simh/scp.c for (uptr = sim_clock_queue; uptr != QUEUE_LIST_END; uptr = uptr->next) next 8985 src/simh/scp.c BRKTAB *bpt = bp->next; next 9044 src/simh/scp.c bp = bp->next; next 9089 src/simh/scp.c bp->next = sim_brk_tab[sim_brk_ins]; next 9091 src/simh/scp.c if (bp->next == NULL) next 9122 src/simh/scp.c bp = bp->next; next 9163 src/simh/scp.c bpl = sim_brk_tab[sim_brk_ins] = bp->next; next 9167 src/simh/scp.c bpl->next = bp->next; next 9174 src/simh/scp.c bp = bp->next; next 9188 src/simh/scp.c bp = bp->next; next 9305 src/simh/scp.c BRKTAB *next; next 9308 src/simh/scp.c next = cur->next; next 9309 src/simh/scp.c cur->next = prev; next 9311 src/simh/scp.c cur = next; next 9320 src/simh/scp.c cur = cur->next; next 9326 src/simh/scp.c next = cur->next; next 9327 src/simh/scp.c cur->next = prev; next 9329 src/simh/scp.c cur = next; next 9436 src/simh/scp.c for (bp = *bpt; bp; bp = bp->next) { next 9451 src/simh/scp.c for (bp = *bpt; bp; bp = bp->next) { next 423 src/simh/sim_defs.h UNIT *next; /* next active */ next 612 src/simh/sim_defs.h BRKTAB *next; /* list with same address value */ next 592 src/simh/sim_timer.c for (uptr = sim_clock_cosched_queue[tmr]; uptr != QUEUE_LIST_END; uptr = uptr->next) { //-V763 next 686 src/simh/sim_timer.c sim_clock_cosched_queue[tmr] = cptr->next; next 687 src/simh/sim_timer.c cptr->next = NULL; next 863 src/simh/sim_timer.c sim_clock_cosched_queue[tmr] = cptr->next; next 864 src/simh/sim_timer.c cptr->next = NULL; next 953 src/simh/sim_timer.c if (uptr->next) { /* On a queue? */ next 958 src/simh/sim_timer.c sim_clock_cosched_queue[tmr] = uptr->next; next 959 src/simh/sim_timer.c uptr->next = NULL; next 965 src/simh/sim_timer.c cptr = cptr->next) next 966 src/simh/sim_timer.c if (cptr->next == (uptr)) { next 967 src/simh/sim_timer.c cptr->next = (uptr)->next; next 968 src/simh/sim_timer.c uptr->next = NULL; next 972 src/simh/sim_timer.c if (uptr->next == NULL) { /* found? */