Searched defs:top (Results 1 - 25 of 27) sorted by relevance

12

/ast/src/lib/libast/hash/
H A Dhashview.c35 * bot==0 pop top scope
36 * bot==top query
37 * bot!=0 push top on bot
43 hashview(Hash_table_t* top, Hash_table_t* bot) argument
50 if (!top || top->frozen)
52 else if (top == bot)
53 bot = top->scope;
56 if (top->scope)
60 sx = &top
[all...]
H A Dhashlook.c42 Hash_table_t* top; local
76 top = tab;
161 if (tab != top && !(flags & HASH_SCOPE)) break;
167 if (tab == top || (flags & HASH_SCOPE))
205 if (tab != top || tab->frozen || (b->hash & (HASH_KEEP|HASH_OPAQUED)) || hashlook(top, value, (flags&(HASH_HASHED|HASH_INTERNAL))|HASH_LOOKUP, NiL))
262 if (tab == top) prev = 0;
270 if (!(flags & HASH_SCOPE)) tab = top;
/ast/src/lib/librecsort/
H A Drsdisc.c40 reg Rsdisc_t* top; local
66 while (top = cur)
69 if (disc == top)
/ast/src/lib/libdss/
H A Ddssfile.c80 Sfdisc_t top; local
87 memset(&top, 0, sizeof(top));
88 if (sfdisc(io, &top))
90 n = top.disc == &dss->state->compress_preferred;
H A Dcxmap.c55 Frame_t top; local
102 top.prev = frame;
103 top.str2num = map->str2num;
104 frame = ⊤
H A Dcxopen.c1036 cxscope(Cx_t* top, Cx_t* bot, Cxflags_t flags, Cxflags_t test, Cxdisc_t* disc) argument
1038 if (!top)
1040 if (!(top = cxopen(CX_SCOPE|flags, test, disc)))
1042 top->op = sfstdout;
1044 if (top->scoped != 1)
1046 if (top->disc->errorf)
1047 (*top->disc->errorf)(NiL, top->disc, 2, "cannot change active scope");
1053 * scope top on bot
1056 if (top
[all...]
/ast/src/lib/libjcl/
H A Dfind.c207 Jcl_t* top; local
221 top = jcl;
229 sfprintf(top->tp, "%s/", dir);
230 sfprintf(top->tp, "%s/%s", dp->dir, name);
231 if (!(s = sfstruse(top->tp)))
233 if (regular(top, s, st))
H A Drun.c135 Jcl_t* top; local
166 top = jcl;
227 for (top = scope; !top->name && !(top->flags & JCL_SCOPE) && top->scope; top = top->scope);
366 sfprintf(jcl->tp, "%sJOBNAME=%s ", JCL_AUTO, top->name);
523 if (jcl == top)
[all...]
/ast/src/cmd/ksh93/sh/
H A Denv.c232 Evar_t *vp, *vpnext,*top; local
240 for(top=0,vp = ep->freelist; vp; vp = vpnext)
245 vp->un.next = top;
246 top = vp;
249 for(vp=top; vp; vp = vpnext)
H A Dexpand.c274 struct argnod *top = 0; local
383 ap->argchn.ap = top;
384 top = ap;
H A Dmain.c420 Sfio_t *top; local
439 if(top = fcfile())
443 while(top=sfstack(iop,SF_POPSTACK))
444 sfclose(top);
H A Dlex.c317 * Get the next word and put it on the top of the stak
2128 register Sfio_t *top; local
2131 while(top=sfstack(sp,SF_POPSTACK))
2132 sfclose(top);
2164 * Assumes that current word is unfrozen on top of the stak
H A Dname.c761 int copy=0,isref,top=0,noscope=(flags&NV_NOSCOPE); local
769 top = 1;
817 if(top)
880 if(top)
918 top = 0;
3525 * make <scoped> the top scope and return previous scope
/ast/src/cmd/nmake/
H A Dvariable.c40 scanprereqs(register Sfio_t* sp, Rule_t* r, int dostate, int all, int top, int sep, int op) argument
52 top = -1;
56 top = 1;
57 if (top)
84 if (top >= 0)
99 if (top >= 0)
H A Drule.c1709 Stat_t top; local
1733 while (!stat(t -= 4, &top))
1751 if (!stat(".", &top) && !stat("...", &bot) && top.st_ino == bot.st_ino && top.st_dev == bot.st_dev)
1780 if (!stat(t, &top))
1787 if (!stat(u, &bot) && bot.st_ino == top.st_ino && bot.st_dev == top.st_dev)
H A Dexpand.c181 * top level alternate syntax:
1942 * if bound then return top and covered view names
2125 * return the top view logical name of s
3407 long top[2]; local
3418 top[0] = beg = sfstrtell(xp);
3420 top[1] = 0;
3441 beg = top[out];
3933 beg = top[out];
H A Dparse.c324 long top; local
343 top = sfstrtell(xp);
346 v = sfstrseek(xp, top, SEEK_SET);
3135 long top; local
3168 top = sfstrtell(xp);
3174 return strexpr(sfstrseek(xp, top, SEEK_SET), NiL, makeexpr, NiL);
/ast/src/cmd/std/
H A Dsplit.c487 struct op* top; local
581 op = getexpr(op ? &op->next : &top, sp);
600 op = getop(op ? &op->next : &top, size, 1, OP_ABSOLUTE, 0);
604 op = getop(op ? &op->next : &top, SF_UNBOUND, 1, OP_LINES, 0);
611 getop(&top, size, SF_UNBOUND, OP_LINES, 0);
618 n = split(in, fp, top, flags);
H A Dls.c110 " [+view?3d fs view level, 0 for the top or 2d]"
353 Ftw_t* top; /* top directory -- no label */ member in struct:__anon232
576 if (ftw != state.top)
1173 int top = 0; local
1189 state.top = ftw;
1199 top++;
1237 if (top)
1242 state.top = 0;
1244 else if (top >
[all...]
/ast/src/lib/libast/misc/
H A Dstk.c335 * otherwise, the top of the stack is set to stkbot+<offset>
422 * advance the stack to the current top
427 register unsigned char *old, *top; local
431 top = stream->_next;
436 if (!(top = (unsigned char*)stkgrow(stream,extra)))
440 *top = 0;
441 top += extra;
443 stream->_next = stream->_data += roundof(top-old,STK_ALIGN);
H A Dfts.c46 FTSENT* parent; /* top parent */ \
48 FTSENT* top; /* top element */ \
250 * search trees with top-down splaying (a la Tarjan and Sleator)
372 getlist(register FTSENT** top, register FTSENT** bot, register FTSENT* root) argument
388 if (*top)
391 *bot = *top = root;
584 * get top list of elements to process
594 register FTSENT* top; local
605 top
693 FTSENT* top; local
[all...]
H A Dglob.c577 globlist_t* top; local
741 top = ap = (globlist_t*)stakalloc((optlen ? 2 : 1) * strlen(pattern) + sizeof(globlist_t) + suflen + gp->gl_extra);
768 top->gl_next = gp->gl_match;
769 gp->gl_match = top;
770 strcopy(top->gl_path + gp->gl_extra, nocheck);
/ast/src/cmd/mailx/
H A Dcmd1.c405 * Print the top so many lines of each desired message.
410 top(struct msg* msgvec) function
/ast/src/lib/libtk/generic/
H A DtkCanvas.c3657 * corresponding to top edge of canvas
3660 int left, right, top, bottom, delta;
3707 top = yOrigin + canvasPtr->inset - canvasPtr->scrollY1;
3723 if ((top < 0) && (bottom > 0)) {
3724 delta = (bottom > -top) ? -top : bottom;
3729 } else if ((bottom < 0) && (top > 0)) {
3730 delta = (top > -bottom) ? -bottom : top;
3630 int left, right, top, bottom, delta; local
/ast/src/cmd/html/
H A Dtroff2html.h111 Arg_t top; /* new state.tag */ member in struct:Pushin_s
229 Arg_t top; /* top tag arg data */ member in struct:State_s
251 Pushin_t* in_top; /* input stream stack top */
253 Sfio_t** out_top; /* output stream stack top */

Completed in 3122 milliseconds

12