Lines Matching refs:next
163 struct rule *next; /* Next rule in the global list */
182 struct config *next; /* Next configuration in the state */
183 struct config *bp; /* The next basis configuration */
203 struct action *next; /* Next action for this state */
225 struct plink *next; /* The next propagate link */
344 for(i=0; i<amt-1; i++) freelist[i].next = &freelist[i+1];
345 freelist[amt-1].next = 0;
348 freelist = freelist->next;
372 ap = (struct action *)msort((char *)ap,(char **)&ap->next,actioncmp);
384 new->next = *app;
588 for(rp=xp->rule; rp; rp=rp->next){
624 for(rp=lemp->rule; rp; rp=rp->next){
640 for(rp=lemp->rule; rp; rp=rp->next){
690 for(rp=lemp->rule; rp; rp=rp->next){
781 for(cfp=stp->cfp; cfp; cfp=cfp->next) cfp->status = INCOMPLETE;
784 for(cfp=stp->cfp; cfp; cfp=cfp->next){
793 for(bcfp=cfp; bcfp; bcfp=bcfp->next){
829 for(cfp=stp->cfp; cfp; cfp=cfp->next){
838 for(cfp=stp->cfp; cfp; cfp=cfp->next){
839 for(plp=cfp->bplp; plp; plp=plp->next){
862 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){
870 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){
872 for(plp=cfp->fplp; plp; plp=plp->next){
904 for(cfp=stp->cfp; cfp; cfp=cfp->next){ /* Loop over all configurations */
936 for(ap=stp->ap; ap && ap->next; ap=ap->next){
937 for(nap=ap->next; nap && nap->sp==ap->sp; nap=nap->next){
946 for(rp=lemp->rule; rp; rp=rp->next) rp->canReduce = B_FALSE;
949 for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){
953 for(rp=lemp->rule; rp; rp=rp->next){
1051 for(i=0; i<amt-1; i++) freelist[i].next = &freelist[i+1];
1052 freelist[amt-1].next = 0;
1055 freelist = freelist->next;
1063 old->next = freelist;
1105 cfp->next = 0;
1108 currentend = &cfp->next;
1133 cfp->next = 0;
1136 currentend = &cfp->next;
1154 for(cfp=current; cfp; cfp=cfp->next){
1186 current = (struct config *)msort((char *)current,(char **)&(current->next),Configcmp);
1224 nextcfp = cfp->next;
1455 ** ptr = msort(ptr,&(ptr->next),cmpfnc);
1461 ** the offset to the "next" field within the structure. The offset to
1462 ** the "next" field must be constant for all structures in the list.
1472 ** Return a pointer to the next structure in the linked list.
1481 ** offset: Offset in the structure to the "next" field.
1488 ** The "next" pointers for elements in the lists a and b are
1532 ** next: Pointer to pointer to the second element of the list.
1540 ** The "next" pointers for elements in list are changed.
1543 char *msort(list,next,cmp)
1545 char **next;
1552 offset = (unsigned long)next - (unsigned long)list;
1918 /* Fall thru to next case */
2051 rp->next = 0;
2055 psp->lastrule->next = rp;
2440 for(i=0; i<amt-1; i++) plink_freelist[i].next = &plink_freelist[i+1];
2441 plink_freelist[amt-1].next = 0;
2444 plink_freelist = plink_freelist->next;
2455 new->next = *plpp;
2467 nextpl = from->next;
2468 from->next = *to;
2481 nextpl = plp->next;
2482 plp->next = plink_freelist;
2563 for(rp=lemp->rule; rp; rp=rp->next){
2624 plp = plp->next;
2694 else cfp=cfp->next;
2697 for(ap=stp->ap; ap; ap=ap->next){
2771 /* The next cluster of routines are for reading the template file
2807 /* The next function finds the template file and opens it, returning
3286 for(ap=stp->ap; ap; ap=ap->next){
3316 for(ap=stp->ap; ap; ap=ap->next){
3327 for(ap=stp->ap; ap; ap=ap->next){
3464 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){
3520 for(rp=lemp->rule; rp; rp=rp->next){
3526 for(rp=lemp->rule; rp; rp=rp->next){
3607 for(ap=stp->ap; ap; ap=ap->next){
3612 for(ap2=ap->next; ap2; ap2=ap2->next){
3630 for(ap=stp->ap; ap; ap=ap->next){
3635 for(ap=ap->next; ap; ap=ap->next){
3760 struct s_x1node *next; /* Next entry with the same hash */
3805 np = np->next;
3823 if( array.ht[h] ) array.ht[h]->from = &(newnp->next);
3824 newnp->next = array.ht[h];
3836 if( x1a->ht[h] ) x1a->ht[h]->from = &(np->next);
3837 np->next = x1a->ht[h];
3856 np = np->next;
3922 struct s_x2node *next; /* Next entry with the same hash */
3968 np = np->next;
3986 if( array.ht[h] ) array.ht[h]->from = &(newnp->next);
3987 newnp->next = array.ht[h];
4001 if( x2a->ht[h] ) x2a->ht[h]->from = &(np->next);
4002 np->next = x2a->ht[h];
4021 np = np->next;
4128 struct s_x3node *next; /* Next entry with the same hash */
4174 np = np->next;
4192 if( array.ht[h] ) array.ht[h]->from = &(newnp->next);
4193 newnp->next = array.ht[h];
4207 if( x3a->ht[h] ) x3a->ht[h]->from = &(np->next);
4208 np->next = x3a->ht[h];
4227 np = np->next;
4274 struct s_x4node *next; /* Next entry with the same hash */
4319 np = np->next;
4337 if( array.ht[h] ) array.ht[h]->from = &(newnp->next);
4338 newnp->next = array.ht[h];
4350 if( x4a->ht[h] ) x4a->ht[h]->from = &(np->next);
4351 np->next = x4a->ht[h];
4370 np = np->next;