Searched defs:next (Results 1 - 25 of 204) sorted by relevance

123456789

/ast/src/lib/libvcodex/
H A Dvccontext.c40 { 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/cdt/
H A Ddtwalk.c39 Void_t *obj, *next; local
46 next = dtnext(dt,obj);
49 obj = next;
/ast/src/lib/libast/sfio/
H A Dsfwrite.c38 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 Dsfraise.c38 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 Dsfsync.c36 reg Sfpool_t *p, *next; local
44 for(p = &_Sfpool; p; p = next)
45 { /* find the next legitimate pool */
46 for(next = p->next; next; next = next->next)
47 if(next
[all...]
H A Dsfmove.c43 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...]
/ast/src/lib/libast/stdio/
H A Dfcloseall.c32 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...]
/ast/src/lib/libast/vmalloc/
H A Dvmclear.c41 Seg_t *seg, *next; local
59 for(seg = vd->seg; seg; seg = next)
60 { next = seg->next;
H A Dvmexit.c55 { struct _exit_s* next; member in struct:_exit_s
71 e->next = Exit;
85 for(e = Exit; e; e = e->next)
H A Dvmclose.c41 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;
/ast/src/lib/libmam/
H A Dmamlib.h33 struct frame* next; /* next in list */ member in struct:frame
44 struct proc* next; /* next in list of all procs */ \
/ast/src/cmd/mailx/port/
H A Ddtwalk.c86 reg Void_t *obj, *next; local
93 next = dtnext(dt,obj);
96 obj = next;
H A Ddtdisc.c106 reg Dtlink_t *root, *t, *next, **slot, **eslot; local
139 root = next = NIL(Dtlink_t*);
143 if(next)
144 next->right = t;
145 else root = next = t;
146 while((t = next->right) )
147 next = t;
155 { next = root->right;
161 root = next;
172 next
[all...]
H A Ddthash.c87 reg Dtlink_t *t, *next, **chain, **slot, **oslot, **eslot; local
110 next = t->right;
113 t = next;
/ast/src/lib/libvcodex/Vchuff/
H A Dvchuff.h32 ** size[p] < 0: need to recurse to the next level of the trie. In this
34 ** next level. node[p] is the base of the next level.
38 { short* node; /* data or next trie base to look up */
42 short next; member in struct:_vchtrie_s
/ast/src/lib/libast/misc/
H A Dsetenviron.c47 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/string/
H A Dstrpsearch.c48 * otherwise if next!=0 then it points to the next
53 strpsearch(const void* tab, size_t num, size_t siz, const char* name, char** next) argument
93 if (next)
94 *next = (char*)t;
/ast/src/lib/libast/astsa/
H A Dvmalloc.h41 struct Vmchunk_s* next; member in struct:Vmchunk_s
/ast/src/lib/libast/path/
H A Dpathexists.c42 struct Tree_s* next; member in struct:Tree_s
75 for (t = p->tree; t && (*cmp)(s, t->name); t = t->next);
84 t->next = p->tree;
110 p->next = t->tree;
H A Dpathfind.c39 struct Dir_s* next; /* next in list */ member in struct:Dir_s
61 for (dp = state.head; dp; dp = dp->next)
67 dp->next = 0;
69 state.tail = state.tail->next = dp;
136 for (dp = state.head; dp; dp = dp->next)
/ast/src/lib/libtk/generic/
H A DtkFileFilter.h26 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/libvdelta/vd01/
H A Dvdio01.c40 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 Dvdio.c40 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/libast/comp/
H A Dwordexp.c33 struct list *next; member in struct:list
172 ((struct list*)cp)->next = (struct list*)(*av);
209 argnext = arg->next;
/ast/src/lib/libast/disc/
H A Dsfdcfilter.c33 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...]

Completed in 44 milliseconds

123456789