next             6400 src/decNumber/decNumber.c   uInt  next;                      // work
next             6408 src/decNumber/decNumber.c   next=0;                          // all paths
next             6422 src/decNumber/decNumber.c         next+=quot;
next             6425 src/decNumber/decNumber.c         next+=*source/powers[cut];
next             6427 src/decNumber/decNumber.c       if (target<=first) *target=(Unit)next;   // write to target iff valid
next             6428 src/decNumber/decNumber.c       next=rem*powers[DECDPUN-cut];            // save remainder for next Unit
next             6434 src/decNumber/decNumber.c     *target=(Unit)next;
next             6435 src/decNumber/decNumber.c     next=0;
next             5835 src/dps8/dps8_eis.c     word9 next = EISget49(&e->ADDR2, &e->mopPos, CTN9);
next             5837 src/dps8/dps8_eis.c     word9 next = EISget49(e->mopAddress, &e->mopPos, CTN9);
next             5841 src/dps8/dps8_eis.c     e->editInsertionTable[e->mopIF - 1] = next;
next             5842 src/dps8/dps8_eis.c     sim_debug (DBG_TRACEEXT, & cpu_dev, "LTE IT[%d]<=%d\n", e -> mopIF - 1, next);
next              233 src/dps8/dps8_math.c     long double exponents[20], *next;
next              249 src/dps8/dps8_math.c         for (next = exponents, exponents[0] = 2.0L, bit = 1;
next              250 src/dps8/dps8_math.c              *next <= x + x;
next              251 src/dps8/dps8_math.c              bit <<= 1, next[1] = next[0] * next[0], next++);
next              253 src/dps8/dps8_math.c         for (; next >= exponents; bit >>= 1, next--)
next              254 src/dps8/dps8_math.c             if (x + x >= *next)
next              256 src/dps8/dps8_math.c                 x /= *next;
next              264 src/dps8/dps8_math.c         for (next = exponents, exponents[0] = 0.5L, bit = 1;
next              265 src/dps8/dps8_math.c              *next > x;
next              266 src/dps8/dps8_math.c              bit <<= 1, next[1] = next[0] * next[0], next++);
next              268 src/dps8/dps8_math.c         for (; next >= exponents; bit >>= 1, next--)
next              269 src/dps8/dps8_math.c             if (x < *next)
next              271 src/dps8/dps8_math.c                 x /= *next;
next              206 src/dps8/uthash.h  (add)->hh.next = NULL;                                                          \
next              214 src/dps8/uthash.h     (head)->hh.tbl->tail->next = (add);                                          \
next              251 src/dps8/uthash.h     if ( ((delptr)->hh.prev == NULL) && ((delptr)->hh.next == NULL) )  {         \
next              266 src/dps8/uthash.h                     (head)->hh.tbl->hho))->next = (delptr)->hh.next;             \
next              268 src/dps8/uthash.h             DECLTYPE_ASSIGN(head,(delptr)->hh.next);                             \
next              270 src/dps8/uthash.h         if (_hd_hh_del->next) {                                                  \
next              271 src/dps8/uthash.h             ((UT_hash_handle*)((ptrdiff_t)_hd_hh_del->next +                     \
next              360 src/dps8/uthash.h            _thh = ( _thh->next ?  (UT_hash_handle*)((char*)(_thh->next) +        \
next              828 src/dps8/uthash.h                   _hs_q = (UT_hash_handle*)((_hs_q->next) ?                      \
next              829 src/dps8/uthash.h                           ((void*)((char*)(_hs_q->next) +                        \
next              837 src/dps8/uthash.h                       _hs_q = (UT_hash_handle*)((_hs_q->next) ?                  \
next              838 src/dps8/uthash.h                               ((void*)((char*)(_hs_q->next) +                    \
next              843 src/dps8/uthash.h                       _hs_p = (UT_hash_handle*)((_hs_p->next) ?                  \
next              844 src/dps8/uthash.h                               ((void*)((char*)(_hs_p->next) +                    \
next              852 src/dps8/uthash.h                       _hs_p = (UT_hash_handle*)((_hs_p->next) ?                  \
next              853 src/dps8/uthash.h                               ((void*)((char*)(_hs_p->next) +                    \
next              858 src/dps8/uthash.h                       _hs_q = (UT_hash_handle*)((_hs_q->next) ?                  \
next              859 src/dps8/uthash.h                               ((void*)((char*)(_hs_q->next) +                    \
next              864 src/dps8/uthash.h                       _hs_tail->next = ((_hs_e) ?                                \
next              875 src/dps8/uthash.h           _hs_tail->next = NULL;                                                 \
next              913 src/dps8/uthash.h             _dst_hh->next = NULL;                                                \
next              914 src/dps8/uthash.h             if (_last_elt_hh) { _last_elt_hh->next = _elt; }                     \
next              952 src/dps8/uthash.h for((el)=(head), (*(char**)(&(tmp)))=(char*)((head)?(head)->hh.next:NULL);       \
next              953 src/dps8/uthash.h   el; (el)=(tmp),(*(char**)(&(tmp)))=(char*)((tmp)?(tmp)->hh.next:NULL))
next              956 src/dps8/uthash.h for((el)=(head),(tmp)=DECLTYPE(el)((head)?(head)->hh.next:NULL);                 \
next              957 src/dps8/uthash.h   el; (el)=(tmp),(tmp)=DECLTYPE(el)((tmp)?(tmp)->hh.next:NULL))
next             1035 src/dps8/uthash.h    void *next;                       /* next element in app order      */
next               99 src/dps8/utlist.h #  define _NEXT(elt,list,next) ((char*)((list)->next))
next              100 src/dps8/utlist.h #  define _NEXTASGN(elt,list,to,next) { char **_alias = (char**)&((list)->next); *_alias=(char*)(to); }
next              107 src/dps8/utlist.h #  define _NEXT(elt,list,next) ((elt)->next)
next              108 src/dps8/utlist.h #  define _NEXTASGN(elt,list,to,next) ((elt)->next)=(to)
next              123 src/dps8/utlist.h     LL_SORT2(list, cmp, next)
next              125 src/dps8/utlist.h # define LL_SORT2(list, cmp, next)                                                             \
next              146 src/dps8/utlist.h           _SV(_ls_q,list); _ls_q = _NEXT(_ls_q,list,next); _RS(list);                          \
next              153 src/dps8/utlist.h               _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--;                                  \
next              156 src/dps8/utlist.h               _NEXT(_ls_p,list,next); _RS(list); _ls_psize--;                                  \
next              159 src/dps8/utlist.h               _NEXT(_ls_p,list,next); _RS(list); _ls_psize--;                                  \
next              162 src/dps8/utlist.h               _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--;                                  \
next              165 src/dps8/utlist.h             _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,_ls_e,next); _RS(list);                \
next              174 src/dps8/utlist.h         _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,NULL,next); _RS(list);                     \
next              185 src/dps8/utlist.h     DL_SORT2(list, cmp, prev, next)
next              187 src/dps8/utlist.h # define DL_SORT2(list, cmp, prev, next)                                                       \
next              208 src/dps8/utlist.h           _SV(_ls_q,list); _ls_q = _NEXT(_ls_q,list,next); _RS(list);                          \
next              215 src/dps8/utlist.h               _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--;                                  \
next              218 src/dps8/utlist.h               _NEXT(_ls_p,list,next); _RS(list); _ls_psize--;                                  \
next              221 src/dps8/utlist.h               _NEXT(_ls_p,list,next); _RS(list); _ls_psize--;                                  \
next              224 src/dps8/utlist.h               _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--;                                  \
next              227 src/dps8/utlist.h             _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,_ls_e,next); _RS(list);                \
next              237 src/dps8/utlist.h       _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,NULL,next); _RS(list);                       \
next              247 src/dps8/utlist.h     CDL_SORT2(list, cmp, prev, next)
next              249 src/dps8/utlist.h # define CDL_SORT2(list, cmp, prev, next)                                                      \
next              274 src/dps8/utlist.h           if (_NEXT(_ls_q,list,next) == _ls_oldhead) {                                         \
next              277 src/dps8/utlist.h             _ls_q = _NEXT(_ls_q,list,next);                                                    \
next              286 src/dps8/utlist.h               _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--;                                  \
next              290 src/dps8/utlist.h               _NEXT(_ls_p,list,next); _RS(list); _ls_psize--;                                  \
next              294 src/dps8/utlist.h               _NEXT(_ls_p,list,next); _RS(list); _ls_psize--;                                  \
next              298 src/dps8/utlist.h               _NEXT(_ls_q,list,next); _RS(list); _ls_qsize--;                                  \
next              302 src/dps8/utlist.h             _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,_ls_e,next); _RS(list);                \
next              313 src/dps8/utlist.h       _SV(_ls_tail,list); _NEXTASGN(_ls_tail,list,_tmp,next); _RS(list);                       \
next              329 src/dps8/utlist.h     LL_PREPEND2(head,add,next)
next              331 src/dps8/utlist.h # define LL_PREPEND2(head,add,next)                                                            \
next              333 src/dps8/utlist.h   (add)->next = head;                                                                          \
next              338 src/dps8/utlist.h     LL_CONCAT2(head1,head2,next)
next              340 src/dps8/utlist.h # define LL_CONCAT2(head1,head2,next)                                                          \
next              345 src/dps8/utlist.h     while (_tmp->next) { _tmp = _tmp->next; }                                                  \
next              346 src/dps8/utlist.h     _tmp->next=(head2);                                                                        \
next              353 src/dps8/utlist.h     LL_APPEND2(head,add,next)
next              355 src/dps8/utlist.h # define LL_APPEND2(head,add,next)                                                             \
next              358 src/dps8/utlist.h   (add)->next=NULL;                                                                            \
next              361 src/dps8/utlist.h     while (_tmp->next) { _tmp = _tmp->next; }                                                  \
next              362 src/dps8/utlist.h     _tmp->next=(add);                                                                          \
next              369 src/dps8/utlist.h     LL_DELETE2(head,del,next)
next              371 src/dps8/utlist.h # define LL_DELETE2(head,del,next)                                                             \
next              375 src/dps8/utlist.h     (head)=(head)->next;                                                                       \
next              378 src/dps8/utlist.h     while (_tmp->next && (_tmp->next != (del))) {                                              \
next              379 src/dps8/utlist.h       _tmp = _tmp->next;                                                                       \
next              381 src/dps8/utlist.h     if (_tmp->next) {                                                                          \
next              382 src/dps8/utlist.h       _tmp->next = ((del)->next);                                                              \
next              393 src/dps8/utlist.h     LL_APPEND2_VS2008(head,add,next)
next              395 src/dps8/utlist.h # define LL_APPEND2_VS2008(head,add,next)                                                      \
next              398 src/dps8/utlist.h     (add)->next = head;     /* use add->next as a temp variable */                             \
next              399 src/dps8/utlist.h     while ((add)->next->next) { (add)->next = (add)->next->next; }                             \
next              400 src/dps8/utlist.h     (add)->next->next=(add);                                                                   \
next              404 src/dps8/utlist.h   (add)->next=NULL;                                                                            \
next              408 src/dps8/utlist.h     LL_DELETE2_VS2008(head,del,next)
next              410 src/dps8/utlist.h # define LL_DELETE2_VS2008(head,del,next)                                                      \
next              413 src/dps8/utlist.h     (head)=(head)->next;                                                                       \
next              416 src/dps8/utlist.h     while ((head)->next && ((head)->next != (del))) {                                          \
next              417 src/dps8/utlist.h       head = (head)->next;                                                                     \
next              419 src/dps8/utlist.h     if ((head)->next) {                                                                        \
next              420 src/dps8/utlist.h       (head)->next = ((del)->next);                                                            \
next              447 src/dps8/utlist.h     LL_FOREACH2(head,el,next)
next              449 src/dps8/utlist.h # define LL_FOREACH2(head,el,next)                                                             \
next              450 src/dps8/utlist.h     for(el=head;el;el=(el)->next)
next              453 src/dps8/utlist.h     LL_FOREACH_SAFE2(head,el,tmp,next)
next              455 src/dps8/utlist.h # define LL_FOREACH_SAFE2(head,el,tmp,next)                                                    \
next              456 src/dps8/utlist.h   for((el)=(head);(el) && (tmp = (el)->next, 1); (el) = tmp)
next              459 src/dps8/utlist.h     LL_SEARCH_SCALAR2(head,out,field,val,next)
next              461 src/dps8/utlist.h # define LL_SEARCH_SCALAR2(head,out,field,val,next)                                            \
next              463 src/dps8/utlist.h     LL_FOREACH2(head,out,next) {                                                               \
next              469 src/dps8/utlist.h     LL_SEARCH2(head,out,elt,cmp,next)
next              471 src/dps8/utlist.h # define LL_SEARCH2(head,out,elt,cmp,next)                                                     \
next              473 src/dps8/utlist.h     LL_FOREACH2(head,out,next) {                                                               \
next              484 src/dps8/utlist.h  (add)->next = (el)->next;                                                                     \
next              489 src/dps8/utlist.h   while (_tmp->next && (_tmp->next != (el))) {                                                 \
next              490 src/dps8/utlist.h    _tmp = _tmp->next;                                                                          \
next              492 src/dps8/utlist.h   if (_tmp->next) {                                                                            \
next              493 src/dps8/utlist.h     _tmp->next = (add);                                                                        \
next              504 src/dps8/utlist.h  (add)->next = (el);                                                                           \
next              509 src/dps8/utlist.h   while (_tmp->next && (_tmp->next != (el))) {                                                 \
next              510 src/dps8/utlist.h    _tmp = _tmp->next;                                                                          \
next              512 src/dps8/utlist.h   if (_tmp->next) {                                                                            \
next              513 src/dps8/utlist.h     _tmp->next = (add);                                                                        \
next              525 src/dps8/utlist.h     DL_PREPEND2(head,add,prev,next)
next              527 src/dps8/utlist.h # define DL_PREPEND2(head,add,prev,next)                                                       \
next              529 src/dps8/utlist.h  (add)->next = head;                                                                           \
next              540 src/dps8/utlist.h     DL_APPEND2(head,add,prev,next)
next              542 src/dps8/utlist.h # define DL_APPEND2(head,add,prev,next)                                                        \
next              546 src/dps8/utlist.h       (head)->prev->next = (add);                                                              \
next              548 src/dps8/utlist.h       (add)->next = NULL;                                                                      \
next              552 src/dps8/utlist.h       (head)->next = NULL;                                                                     \
next              557 src/dps8/utlist.h     DL_CONCAT2(head1,head2,prev,next)
next              559 src/dps8/utlist.h # define DL_CONCAT2(head1,head2,prev,next)                                                     \
next              566 src/dps8/utlist.h         (head1)->prev->next = (head2);                                                         \
next              575 src/dps8/utlist.h     DL_DELETE2(head,del,prev,next)
next              577 src/dps8/utlist.h # define DL_DELETE2(head,del,prev,next)                                                        \
next              583 src/dps8/utlist.h       (del)->next->prev = (del)->prev;                                                         \
next              584 src/dps8/utlist.h       (head) = (del)->next;                                                                    \
next              586 src/dps8/utlist.h       (del)->prev->next = (del)->next;                                                         \
next              587 src/dps8/utlist.h       if ((del)->next) {                                                                       \
next              588 src/dps8/utlist.h           (del)->next->prev = (del)->prev;                                                     \
next              596 src/dps8/utlist.h     DL_FOREACH2(head,el,next)
next              598 src/dps8/utlist.h # define DL_FOREACH2(head,el,next)                                                             \
next              599 src/dps8/utlist.h     for(el=head;el;el=(el)->next)
next              607 src/dps8/utlist.h     DL_FOREACH_SAFE2(head,el,tmp,next)
next              609 src/dps8/utlist.h # define DL_FOREACH_SAFE2(head,el,tmp,next)                                                    \
next              610 src/dps8/utlist.h   for((el)=(head);(el) && (tmp = (el)->next, 1); (el) = tmp)
next              629 src/dps8/utlist.h   (add)->next = (el)->next;                                                                    \
next              630 src/dps8/utlist.h   if ((el)->next == NULL) {                                                                    \
next              634 src/dps8/utlist.h    (add)->next->prev = (add);                                                                  \
next              637 src/dps8/utlist.h   (add)->next = (el)->next;                                                                    \
next              639 src/dps8/utlist.h   (add)->prev->next = (add);                                                                   \
next              640 src/dps8/utlist.h   if ((el)->next == NULL) {                                                                    \
next              643 src/dps8/utlist.h    (add)->next->prev = (add);                                                                  \
next              653 src/dps8/utlist.h  (add)->next = (el);                                                                           \
next              659 src/dps8/utlist.h   (add)->prev->next = (add);                                                                   \
next              670 src/dps8/utlist.h     CDL_PREPEND2(head,add,prev,next)
next              672 src/dps8/utlist.h # define CDL_PREPEND2(head,add,prev,next)                                                      \
next              676 src/dps8/utlist.h    (add)->next = (head);                                                                       \
next              678 src/dps8/utlist.h    (add)->prev->next = (add);                                                                  \
next              681 src/dps8/utlist.h    (add)->next = (add);                                                                        \
next              687 src/dps8/utlist.h     CDL_DELETE2(head,del,prev,next)
next              689 src/dps8/utlist.h # define CDL_DELETE2(head,del,prev,next)                                                       \
next              691 src/dps8/utlist.h   if ( ((head)==(del)) && ((head)->next == (head))) {                                          \
next              694 src/dps8/utlist.h      (del)->next->prev = (del)->prev;                                                          \
next              695 src/dps8/utlist.h      (del)->prev->next = (del)->next;                                                          \
next              696 src/dps8/utlist.h      if ((del) == (head)) (head)=(del)->next;                                                  \
next              701 src/dps8/utlist.h     CDL_FOREACH2(head,el,next)
next              703 src/dps8/utlist.h # define CDL_FOREACH2(head,el,next)                                                            \
next              704 src/dps8/utlist.h     for(el=head;el;el=((el)->next==head ? 0L : (el)->next))
next              707 src/dps8/utlist.h     CDL_FOREACH_SAFE2(head,el,tmp1,tmp2,prev,next)
next              709 src/dps8/utlist.h # define CDL_FOREACH_SAFE2(head,el,tmp1,tmp2,prev,next)                                        \
next              711 src/dps8/utlist.h       (el) && ((tmp2)=(el)->next, 1);                                                          \
next              715 src/dps8/utlist.h     CDL_SEARCH_SCALAR2(head,out,field,val,next)
next              717 src/dps8/utlist.h # define CDL_SEARCH_SCALAR2(head,out,field,val,next)                                           \
next              719 src/dps8/utlist.h     CDL_FOREACH2(head,out,next) {                                                              \
next              725 src/dps8/utlist.h     CDL_SEARCH2(head,out,elt,cmp,next)
next              727 src/dps8/utlist.h # define CDL_SEARCH2(head,out,elt,cmp,next)                                                    \
next              729 src/dps8/utlist.h     CDL_FOREACH2(head,out,next) {                                                              \
next              739 src/dps8/utlist.h  if ((el)->next == (el)) {                                                                     \
next              740 src/dps8/utlist.h   (add)->next = (add);                                                                         \
next              744 src/dps8/utlist.h   (add)->next = (el)->next;                                                                    \
next              746 src/dps8/utlist.h   (add)->next->prev = (add);                                                                   \
next              747 src/dps8/utlist.h   (add)->prev->next = (add);                                                                   \
next              759 src/dps8/utlist.h  (add)->next = (el);                                                                           \
next              762 src/dps8/utlist.h  (add)->prev->next = (add);                                                                    \
next             5224 src/simh/scp.c     for (uptr = sim_clock_queue; uptr != QUEUE_LIST_END; uptr = uptr->next) {
next             6180 src/simh/scp.c     sim_clock_queue = uptr->next;
next             6181 src/simh/scp.c     uptr->next = NULL;
next             8344 src/simh/scp.c     sim_clock_queue = uptr->next;                       /* remove first */
next             8345 src/simh/scp.c     uptr->next = NULL;                                  /* hygiene */
next             8410 src/simh/scp.c for (cptr = sim_clock_queue; cptr != QUEUE_LIST_END; cptr = cptr->next) {
next             8417 src/simh/scp.c     cptr = uptr->next = sim_clock_queue;
next             8421 src/simh/scp.c     cptr = uptr->next = prvptr->next;                   /* insert at prvptr */
next             8422 src/simh/scp.c     prvptr->next = uptr;
next             8489 src/simh/scp.c     nptr = sim_clock_queue = uptr->next;
next             8490 src/simh/scp.c     uptr->next = NULL;                                  /* hygiene */
next             8493 src/simh/scp.c     for (cptr = sim_clock_queue; cptr != QUEUE_LIST_END; cptr = cptr->next) {
next             8494 src/simh/scp.c         if (cptr->next == uptr) {
next             8495 src/simh/scp.c             nptr = cptr->next = uptr->next;
next             8496 src/simh/scp.c             uptr->next = NULL;                          /* hygiene */
next             8502 src/simh/scp.c     nptr->time += (uptr->next) ? 0 : uptr->time;
next             8503 src/simh/scp.c if (!uptr->next)
next             8508 src/simh/scp.c if (uptr->next) {
next             8529 src/simh/scp.c if (uptr->next == NULL)
next             8548 src/simh/scp.c for (cptr = sim_clock_queue; cptr != QUEUE_LIST_END; cptr = cptr->next) {
next             8586 src/simh/scp.c for (uptr = sim_clock_queue; uptr != QUEUE_LIST_END; uptr = uptr->next)
next             8638 src/simh/scp.c             BRKTAB *bpt = bp->next;
next             8697 src/simh/scp.c     bp = bp->next;
next             8742 src/simh/scp.c bp->next = sim_brk_tab[sim_brk_ins];
next             8744 src/simh/scp.c if (bp->next == NULL)
next             8775 src/simh/scp.c         bp = bp->next;
next             8816 src/simh/scp.c             bpl = sim_brk_tab[sim_brk_ins] = bp->next;
next             8820 src/simh/scp.c               bpl->next = bp->next;
next             8827 src/simh/scp.c         bp = bp->next;
next             8841 src/simh/scp.c         bp = bp->next;
next             8944 src/simh/scp.c     BRKTAB *next;
next             8947 src/simh/scp.c         next = cur->next;
next             8948 src/simh/scp.c         cur->next = prev;
next             8950 src/simh/scp.c         cur = next;
next             8959 src/simh/scp.c         cur = cur->next;
next             8965 src/simh/scp.c         next = cur->next;
next             8966 src/simh/scp.c         cur->next = prev;
next             8968 src/simh/scp.c         cur = next;
next             9075 src/simh/scp.c     for (bp = *bpt; bp; bp = bp->next) {
next             9090 src/simh/scp.c         for (bp = *bpt; bp; bp = bp->next) {
next              413 src/simh/sim_defs.h     UNIT                *next;                          /* next active */
next              602 src/simh/sim_defs.h     BRKTAB *next;                                       /* list with same address value */
next              580 src/simh/sim_timer.c         for (uptr = sim_clock_cosched_queue[tmr]; uptr != QUEUE_LIST_END; uptr = uptr->next) { //-V763
next              682 src/simh/sim_timer.c         sim_clock_cosched_queue[tmr]  = cptr->next;
next              683 src/simh/sim_timer.c         cptr->next                    = NULL;
next              849 src/simh/sim_timer.c             sim_clock_cosched_queue[tmr] = cptr->next;
next              850 src/simh/sim_timer.c             cptr->next                   = NULL;
next              939 src/simh/sim_timer.c if (uptr->next) {                           /* On a queue? */
next              944 src/simh/sim_timer.c             sim_clock_cosched_queue[tmr] = uptr->next;
next              945 src/simh/sim_timer.c             uptr->next = NULL;
next              951 src/simh/sim_timer.c                 cptr = cptr->next)
next              952 src/simh/sim_timer.c                 if (cptr->next == (uptr)) {
next              953 src/simh/sim_timer.c                     cptr->next = (uptr)->next;
next              954 src/simh/sim_timer.c                     uptr->next = NULL;
next              958 src/simh/sim_timer.c         if (uptr->next == NULL) {           /* found? */