/ast/src/lib/libast/stdio/ |
H A D | fcloseall.c | 32 Sfpool_t* next; local 42 for(p = &_Sfpool; p; p = next) 43 { /* find the next legitimate pool */ 44 for(next = p->next; next; next = next->next) 45 if(next [all...] |
H A D | vswprintf.c | 44 f.data = f.next = f.endr = (uchar*)s; 52 *f.next = 0; 53 _Sfi = f.next - f.data;
|
/ast/src/lib/libcodex/ |
H A D | codexadd.c | 33 if (meth->next) 35 meth->next = codexstate.first;
|
H A D | codexlist.c | 25 * return the next codex method 45 if (!meth->next && !codexstate.scanned) 55 for (lp = lp->next = np; lp->next; lp = lp->next); 64 return meth->next;
|
/ast/src/lib/libvcodex/ |
H A D | vccontext.c | 40 { for(p = NIL(Vccontext_t*), c = vc->ctxt; c; p = c, c = c->next) 47 else p->next = ctxt->next; 55 ctxt->next = vc->ctxt; 68 Vccontext_t *next; local 73 vc->ctxt = ctxt->next; 74 ctxt->next = NIL(Vccontext_t*); 81 for(; ctxt; ctxt = next) 82 { next = ctxt->next; [all...] |
/ast/src/lib/libast/sfio/ |
H A D | sfraise.c | 38 Sfpool_t *p, *next; local 42 for(p = &_Sfpool; p; p = next) 44 for(next = p->next; next; next = next->next) 45 if(next->n_sf > 0) 65 reg Sfdisc_t *disc, *next, * local [all...] |
H A D | sfwrite.c | 38 reg uchar *s, *begs, *next; local 55 if((uchar*)buf != f->next && 82 f->next += n; 95 w = f->endb - f->next; 97 if(s == f->next && s < f->endb) /* after sfreserve */ 100 f->next = (s += w); 109 if((w = f->endb - f->next) < (ssize_t)n) 111 { if(f->next > f->data) 118 else if(f->next > f->data) 121 if((w = f->endb - f->next) < (ssize_ [all...] |
H A D | sfputr.c | 52 if((f->flags&SF_STRING) && f->next >= f->endb ) 78 f->next = ps; 103 f->next = ps; 111 else ps = f->next+p; 112 s += ps - f->next; 118 w += ps - f->next; 119 f->next = ps; 127 else if((f->flags&SF_LINE) && !(f->flags&SF_STRING) && (n = f->next-f->data) > 0) 130 f->next -= n; 131 (void)SFWRITE(f,(Void_t*)f->next, [all...] |
H A D | sfmove.c | 43 reg uchar *cp, *next; local 91 if(fw->next >= fw->endb || 92 (fw->next > fw->data && fr->extent < 0 && 116 if((r = fr->endb - (next = fr->next)) <= 0) 134 if(fw && fw->extent >= 0 && w <= (fw->endb-fw->next) ) 135 { w = fw->endb - (next = fw->next); 146 { next = rbuf; 162 next [all...] |
H A D | sfpeek.c | 52 n = (f->data+f->here) - f->next; 54 else n = f->endb - f->next; 59 { *bp = (Void_t*)f->next; 76 { *bp = (Void_t*)f->next; 84 f->next += sz;
|
H A D | sftell.c | 51 SFMTXRETURN(f, (Sfoff_t)(f->next-f->data)); 56 else p = f->here + ((f->mode&SF_WRITE) ? f->next-f->data : f->next-f->endb);
|
H A D | sfungetc.c | 69 if(f->next > f->data && f->next[-1] == (uchar)c) 70 { f->next -= 1; 87 if(f->next == f->data) 100 f->next = data+16; 104 *--f->next = (uchar)c;
|
/ast/src/lib/libast/vmalloc/ |
H A D | vmclose.c | 41 Seg_t *seg, *vmseg, *next; local 61 for(last = Vmheap, v = last->next; v; last = v, v = v->next) 63 { last->next = v->next; 72 for(seg = vd->seg; seg; seg = next) 73 { next = seg->next;
|
H A D | vmexit.c | 55 { struct _exit_s* next; member in struct:_exit_s 71 e->next = Exit; 85 for(e = Exit; e; e = e->next)
|
/ast/src/lib/libmam/ |
H A D | mamlib.h | 33 struct frame* next; /* next in list */ member in struct:frame 44 struct proc* next; /* next in list of all procs */ \
|
/ast/src/lib/libast/misc/ |
H A D | setenviron.c | 47 static char** next; /* next free slot */ local 63 environ = next = p; 64 *++next = 0; 104 next = p; 107 else if (next == last) 113 next = last - INCREMENT; 131 next--; 143 p = next; 144 *++next [all...] |
/ast/src/lib/libast/cdt/ |
H A D | dtwalk.c | 39 Void_t *obj, *next; local 46 next = dtnext(dt,obj); 49 obj = next;
|
/ast/src/cmd/mailx/port/ |
H A D | dtwalk.c | 86 reg Void_t *obj, *next; local 93 next = dtnext(dt,obj); 96 obj = next;
|
/ast/src/lib/libvdelta/vd01/ |
H A D | vdio01.c | 40 io->next = io->data; 115 reg uchar *s, *next; local 119 s = next = &c[sizeof(c)-1]; 123 len = (next-s) + 1; 128 next = io->next; 131 default: memcpy((Void_t*)next,(Void_t*)s,len); next += len; break; 132 case 3: *next++ = *s++; 133 case 2: *next 150 reg uchar* next; local 177 reg uchar* next; local [all...] |
/ast/src/lib/libvdelta/ |
H A D | vdio.c | 40 io->next = io->data; 118 reg uchar *s, *next; local 122 s = next = &c[sizeof(c)-1]; 126 len = (next-s) + 1; 131 next = io->next; 134 default: memcpy((Void_t*)next,(Void_t*)s,len); next += len; break; 135 case 3: *next++ = *s++; 136 case 2: *next 153 reg uchar* next; local 180 reg uchar* next; local [all...] |
/ast/src/lib/libtk/generic/ |
H A D | tkFileFilter.h | 26 struct GlobPattern * next; /* Chains to the next glob pattern member in struct:GlobPattern 34 struct MacFileType * next; /* Chains to the next mac file type member in struct:MacFileType 41 struct FileFilterClause * next; /* Chains to the next clause in member in struct:FileFilterClause 50 struct FileFilter * next; /* Chains to the next filter member in struct:FileFilter
|
/ast/src/lib/libast/hash/ |
H A D | hashfree.c | 73 b = b->next; 111 for (; tp; tp = tp->next) 112 if (tp->next == tab) 114 tp->next = tab->next; 118 else if (!(tab->root->references = tp->next)) 122 for (; rp; rp = rp->next) 123 if (rp->next == tab->root) 125 rp->next = tab->root->next; [all...] |
/ast/src/lib/libast/comp/ |
H A D | atexit.c | 55 struct list* next; 70 p->next = funclist; 82 funclist = p->next;
|
/ast/src/lib/libvcodex/Vchuff/ |
H A D | vchsize.c | 36 struct _vchtree_s* next; /* link for the sorted lists */ member in struct:_vchtree_s 83 f->next = f->link = NIL(Vchtree_t*); 112 for(f = sort[k = 0]; f != NIL(Vchtree_t*); f = f->next) 114 f->next = (k += 1) < notz ? sort[k] : NIL(Vchtree_t*); 121 ** 1. list and list->next are not NULL; 122 ** 2. head == NULL or head->freq >= list->next->freq 123 ** 3. tail == NULL or list->freq+list->next->freq >= tail->freq. 124 ** Then, list and list->next can be merged into a subtree. 126 f = list; s = list->next; list = s->next; [all...] |
/ast/src/lib/libast/disc/ |
H A D | sfdcfilter.c | 33 char* next; /* data unwritten */ member in struct:_filter_s 56 if(fi->next && fi->next >= fi->endb ) 58 { fi->next = fi->raw; 66 fi->next = fi->endb = NIL(char*); 70 if(fi->next && (w = fi->endb - fi->next) > 0 ) 78 if((w = sfwr(fi->filter, fi->next, w, 0)) > 0) 79 fi->next += w; 87 w = sfpoll(&fi->filter, 1, fi->next [all...] |