Searched defs:prev (Results 1 - 25 of 38) sorted by relevance

12

/ast/src/lib/libast/misc/
H A Ddebug.c49 static double prev; local
54 return prev = tm;
55 return tm - prev;
H A Dstk.c70 char *prev; /* address of previous frame */ member in struct:frame
165 if(fp->prev)
167 cp = fp->prev;
248 fp->prev = 0;
327 for(fp=(struct frame*)sp->stkbase; fp; fp=(struct frame*)fp->prev)
370 if(fp->prev)
372 sp->stkbase = fp->prev;
373 sp->stkend = ((struct frame*)(fp->prev))->end;
520 sp->stkbase = ((struct frame*)dp)->prev;
540 fp->prev
[all...]
/ast/src/lib/libast/tm/
H A Dtmzone.c52 register char* prev; local
69 prev = 0;
73 prev = zp->type;
74 if (!type || type == prev || !prev)
/ast/src/lib/libmam/
H A Dmamlib.h34 struct frame* prev; /* prev in list */ member in struct:frame
/ast/src/cmd/mailx/port/
H A Ddtlist.c88 reg Dtlink_t *r, *t, *prev, *renew; local
127 prev = NIL(Dtlink_t*);
129 { for(t = dt->data->head; t; prev = t->left, t = prev->right)
142 /* make sure prev is just before the equivalence class of t */
143 if(!prev && (r = dt->data->head->left) != t->left)
144 while((prev = r) )
145 if((r = prev->right->left) == t->left)
149 { if(prev) /* move the whole class to the front */
150 { t = prev
[all...]
H A Ddthash.c135 reg Dtlink_t *t, *prev, *r = NIL(Dtlink_t*); local
190 prev = NIL(Dtlink_t*);
197 for(; t; prev = t, t = t->right)
245 { if(prev) /* move to front heuristic */
246 { prev->right = t->right;
277 { if(!prev && t != *slot)
278 for(prev = *slot; prev->right != t; prev = prev
[all...]
/ast/src/lib/libast/hash/
H A Dhashlook.c43 Hash_bucket_t* prev; local
100 for (prev = 0, b = tab->table[n]; b; prev = b, b = b->next)
137 prev = 0;
146 if (prev && !tab->frozen)
152 prev->next = b->next;
262 if (tab == top) prev = 0;
265 if (prev = b)
304 if (!prev && (tab->flags & HASH_ALLOCATE))
/ast/src/cmd/pax/
H A Dnocomment.c51 if (line > prev && line > directive) \
53 if (sfsprintf(buf, sizeof(buf), "\n#%s %d\n", sync <= 0 ? "line" : "", line + 1) <= line - prev) \
56 prev = line; \
58 else while (prev < line) \
60 prev++; \
132 unsigned long prev = 0; local
151 if (line != prev)
166 prev = ++line;
275 prev = line;
338 prev
[all...]
/ast/src/lib/libast/include/
H A Dstack.h39 struct stackblock* prev; /* previous block in list */ member in struct:stackblock
/ast/src/lib/libast/sfio/
H A Dsfdisc.c76 Sfdisc_t *prev; local
83 for(prev = f->disc; prev; prev = prev->disc)
84 if(prev->disc == disc)
86 if(!prev)
99 { prev->disc = disc->disc;
/ast/src/cmd/builtin/
H A Dwhat.c71 unsigned char prev[3]; member in struct:__anon48
101 s = state.prev;
H A Dtr.c103 #define setchar(p,s,t) ((p)->type=(t),(p)->prev=(p)->last=(-1),(p)->isit=0,(p)->count=0,(p)->base=(p)->next=(s))
110 int prev; member in struct:__anon47
151 return tr->prev;
161 while (++tr->prev <= tr->last)
162 if (!tr->isit || (*tr->isit)(tr->prev))
163 return (!tr->type || !tr->convert) ? tr->prev : tr->convert == 'l' ? tolower(tr->prev) : toupper(tr->prev);
171 c = tr->level ? -2 : tr->type && !tr->truncate ? tr->prev : -1;
210 tr->prev
[all...]
/ast/src/lib/libast/comp/
H A Dregexp.h83 static const char* prev; local
97 if (!re->re_sed && !prev)
102 prev = 0;
123 prev = endbuf;
124 RETURN((char*)prev);
/ast/src/lib/libdss/
H A Dtag.h61 Tagframe_t* prev; /* previous in stack */ member in struct:Tagframe_s
H A Dcxmap.c32 struct Frame_s* prev; member in struct:Frame_s
102 top.prev = frame;
116 for (fp = frame; fp; fp = fp->prev)
/ast/src/lib/libexpr/
H A Dexlib.h128 struct Switch_s*prev; /* previous switch state */ member in struct:Switch_s
/ast/src/lib/libjcl/
H A Djcllib.h57 Include_t* prev; member in struct:Include_s
79 Ie_t* prev; member in struct:Ie_s
/ast/src/lib/libtk/generic/
H A DtkEvent.c821 Tk_RestrictProc *prev;
823 prev = restrictProc;
827 return prev;
813 Tk_RestrictProc *prev; local
/ast/src/cmd/html/
H A Dbb2tok.c77 Header_t* prev; member in struct:State_s
93 if (state->prev)
95 sfprintf(op, "%s<%s%s>\n", (!state->push && (state->prev->lex == HEADER || state->prev->lex == CODE && state->last != '\n')) ? "\n" : "", state->push ? "" : "/", state->prev->out);
96 state->prev = 0;
103 if (state->prev)
105 if (head->lex == LINK && state->prev->lex == NAME && state->push)
107 if (head->lex == LINE && state->prev->lex == HEADER && !state->push)
109 if (head->lex == HEADER && push && state->prev
[all...]
/ast/src/cmd/ksh93/include/
H A Dfault.h97 sigjmp_buf *prev; member in struct:checkpt
109 (bp)->topfd=shp->topfd, (bp)->prev=shp->jmplist, \
113 #define sh_popcontext(shp,bp) (shp->jmplist=(bp)->prev, errorpop(&((bp)->err)))
/ast/src/cmd/mailx/
H A Dnames.c292 Dt_t* prev; member in struct:__anon149
304 if (!dictsearch(&wm->prev, name, LOOKUP)) {
366 wm.prev = 0;
369 wm.next = wm.prev;
370 wm.prev = hp->h_names;
378 (np = dictsearch(&wm.prev, hp->h_first, LOOKUP)) &&
/ast/src/cmd/pzip/
H A Dpop.c131 int prev; /* prev row value */ member in struct:__anon195
149 ip[i].prev = -1;
167 if (ip[i].prev != buf[j = map[i]])
169 ip[i].hit[ip[i].prev = buf[j]] = 1;
/ast/src/cmd/std/
H A Dsplit.c176 getop(struct op** prev, Sfoff_t size, size_t repeat, int flags, int re) argument
188 *prev = op;
199 getexpr(struct op** prev, const char* arg) argument
206 if (op = getop(prev, 0, 1, *cp == '/' ? OP_SEARCH : OP_SKIP, 1))
/ast/src/cmd/ksh93/sh/
H A Dnvtree.c43 struct nvdir *prev; member in struct:nvdir
237 dp->prev = save;
327 for(save=dp; save; save=save->prev)
338 dp->prev = save;
362 if(!(save=dp->prev))
373 if(dp->prev)
374 nv_dirclose((void*)dp->prev);
H A Dsubshell.c69 struct subshell *prev; /* previous subshell data */ member in struct:subshell
225 for(sp = (struct subshell*)subshell_data; sp; sp=sp->prev)
457 sp = sp->prev;
500 sp->prev = subshell_data;
539 for(xp=sp->prev; xp; xp=xp->prev)
617 else if(sp->prev)
619 sp->pipe = sp->prev->pipe;
640 subshell_data = sp->prev;
787 subshell_data = sp->prev;
[all...]

Completed in 39 milliseconds

12