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 6015 src/dps8/dps8_eis.c word9 next = EISget49(cpup, &e->ADDR2, &e->mopPos, CTN9); next 6017 src/dps8/dps8_eis.c word9 next = EISget49(cpup, e->mopAddress, &e->mopPos, CTN9); next 6024 src/dps8/dps8_eis.c e->editInsertionTable[e->mopIF - 1] = next; next 6030 src/dps8/dps8_eis.c sim_debug (DBG_TRACEEXT, & cpu_dev, "LTE IT[%d]<=%d\r\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 268 src/dps8/fnpuv.c p->next = fnp_clients; next 279 src/dps8/fnpuv.c p->prev->next = p->next; next 281 src/dps8/fnpuv.c fnp_clients = p->next; next 282 src/dps8/fnpuv.c if (p->next) next 283 src/dps8/fnpuv.c p->next->prev = p->prev; next 984 src/dps8/fnpuv.c for (uvClientData * q = fnp_clients; q; q = q->next) next 1160 src/dps8/fnpuv.c for (uvClientData * p = fnp_clients, *next; p; p = next) next 1162 src/dps8/fnpuv.c next = p->next; next 1194 src/dps8/fnpuv.c for (uvClientData * p = fnp_clients; p; p = p->next) next 23 src/dps8/fnpuv.h struct uvClientData_s * next; next 98 src/dps8/uvutil.c struct access_client_s * next; next 234 src/dps8/uvutil.c for (access_client * s = access_sessions; s; s = s->next) next 607 src/dps8/uvutil.c link = &(*link)->next; next 609 src/dps8/uvutil.c *link = session->next; next 717 src/dps8/uvutil.c for (access_client * s = access_sessions; s; s = s->next) next 788 src/dps8/uvutil.c access_client * next = session->next; next 791 src/dps8/uvutil.c session = next; next 799 src/dps8/uvutil.c session = session->next) next 1083 src/dps8/uvutil.c session->next = access_sessions; 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 171 src/prt2pdf/prt2pdf.c struct _PageList * next; next 294 src/prt2pdf/prt2pdf.c n -> next = NULL; next 298 src/prt2pdf/prt2pdf.c GLOBAL_INSERT_PAGE = & n -> next; next 2252 src/prt2pdf/prt2pdf.c ptr = ptr -> next; next 2300 src/prt2pdf/prt2pdf.c PageList * next = ptr -> next; next 2302 src/prt2pdf/prt2pdf.c ptr = next; next 785 src/punutil/miniz.c int root, leaf, next, avbl, used, dpth; next 796 src/punutil/miniz.c for (next = 1; next < n - 1; next++) next 800 src/punutil/miniz.c A[next].m_key = A[root].m_key; next 801 src/punutil/miniz.c A[root++].m_key = (mz_uint16)next; next 804 src/punutil/miniz.c A[next].m_key = A[leaf++].m_key; next 805 src/punutil/miniz.c if (leaf >= n || (root < next && A[root].m_key < A[leaf].m_key)) next 807 src/punutil/miniz.c A[next].m_key = (mz_uint16)(A[next].m_key + A[root].m_key); next 808 src/punutil/miniz.c A[root++].m_key = (mz_uint16)next; next 811 src/punutil/miniz.c A[next].m_key = (mz_uint16)(A[next].m_key + A[leaf++].m_key); next 814 src/punutil/miniz.c for (next = n - 3; next >= 0; next--) next 815 src/punutil/miniz.c A[next].m_key = A[A[next].m_key].m_key + 1; next 819 src/punutil/miniz.c next = n - 1; next 829 src/punutil/miniz.c A[next--].m_key = (mz_uint16)(dpth); next 5819 src/simh/scp.c for (uptr = sim_clock_queue; uptr != QUEUE_LIST_END; uptr = uptr->next) { next 6775 src/simh/scp.c sim_clock_queue = uptr->next; next 6776 src/simh/scp.c uptr->next = NULL; next 8942 src/simh/scp.c sim_clock_queue = uptr->next; /* remove first */ next 8943 src/simh/scp.c uptr->next = NULL; /* hygiene */ next 9016 src/simh/scp.c for (cptr = sim_clock_queue; cptr != QUEUE_LIST_END; cptr = cptr->next) { next 9023 src/simh/scp.c cptr = uptr->next = sim_clock_queue; next 9027 src/simh/scp.c cptr = uptr->next = prvptr->next; /* insert at prvptr */ next 9028 src/simh/scp.c prvptr->next = uptr; next 9098 src/simh/scp.c nptr = sim_clock_queue = uptr->next; next 9099 src/simh/scp.c uptr->next = NULL; /* hygiene */ next 9102 src/simh/scp.c for (cptr = sim_clock_queue; cptr != QUEUE_LIST_END; cptr = cptr->next) { next 9103 src/simh/scp.c if (cptr->next == uptr) { next 9104 src/simh/scp.c nptr = cptr->next = uptr->next; next 9105 src/simh/scp.c uptr->next = NULL; /* hygiene */ next 9111 src/simh/scp.c nptr->time += (uptr->next) ? 0 : uptr->time; next 9112 src/simh/scp.c if (!uptr->next) next 9117 src/simh/scp.c if (uptr->next) { next 9138 src/simh/scp.c if (uptr->next == NULL) next 9157 src/simh/scp.c for (cptr = sim_clock_queue; cptr != QUEUE_LIST_END; cptr = cptr->next) { next 9195 src/simh/scp.c for (uptr = sim_clock_queue; uptr != QUEUE_LIST_END; uptr = uptr->next) next 9247 src/simh/scp.c BRKTAB *bpt = bp->next; next 9306 src/simh/scp.c bp = bp->next; next 9351 src/simh/scp.c bp->next = sim_brk_tab[sim_brk_ins]; next 9353 src/simh/scp.c if (bp->next == NULL) next 9384 src/simh/scp.c bp = bp->next; next 9425 src/simh/scp.c bpl = sim_brk_tab[sim_brk_ins] = bp->next; next 9429 src/simh/scp.c bpl->next = bp->next; next 9436 src/simh/scp.c bp = bp->next; next 9450 src/simh/scp.c bp = bp->next; next 9567 src/simh/scp.c BRKTAB *next; next 9570 src/simh/scp.c next = cur->next; next 9571 src/simh/scp.c cur->next = prev; next 9573 src/simh/scp.c cur = next; next 9582 src/simh/scp.c cur = cur->next; next 9588 src/simh/scp.c next = cur->next; next 9589 src/simh/scp.c cur->next = prev; next 9591 src/simh/scp.c cur = next; next 9698 src/simh/scp.c for (bp = *bpt; bp; bp = bp->next) { next 9713 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 600 src/simh/sim_timer.c for (uptr = sim_clock_cosched_queue[tmr]; uptr != QUEUE_LIST_END; uptr = uptr->next) { //-V763 next 694 src/simh/sim_timer.c sim_clock_cosched_queue[tmr] = cptr->next; next 695 src/simh/sim_timer.c cptr->next = NULL; next 875 src/simh/sim_timer.c sim_clock_cosched_queue[tmr] = cptr->next; next 876 src/simh/sim_timer.c cptr->next = NULL; next 965 src/simh/sim_timer.c if (uptr->next) { /* On a queue? */ next 970 src/simh/sim_timer.c sim_clock_cosched_queue[tmr] = uptr->next; next 971 src/simh/sim_timer.c uptr->next = NULL; next 977 src/simh/sim_timer.c cptr = cptr->next) next 978 src/simh/sim_timer.c if (cptr->next == (uptr)) { next 979 src/simh/sim_timer.c cptr->next = (uptr)->next; next 980 src/simh/sim_timer.c uptr->next = NULL; next 984 src/simh/sim_timer.c if (uptr->next == NULL) { /* found? */