Searched defs:tail (Results 1 - 22 of 22) sorted by relevance

/ast/src/lib/libpp/
H A Dppcomment.c31 ppcomment(char* head, char* comment, char* tail, int line) argument
34 ppprintf("%s%-.*s%s", head, MAXTOKEN - 4, comment, tail);
H A Dppargs.c169 pplint(char* head, char* comment, char* tail, int line) argument
/ast/src/lib/librecsort/
H A Drs-copy.c32 Rsobj_t* tail; member in struct:Copy_s
45 if (copy->tail)
46 copy->tail->right = obj;
49 copy->tail = obj;
62 if (copy->tail)
64 copy->tail->right = 0;
65 copy->tail = 0;
H A Drslist.c35 #define ADDOBJ(list,tail,obj) (tail = tail ? (tail->right = obj) : (list = obj) )
107 reg Rsobj_t *obj, *o, *e, *list, *tail; local
128 list = tail = NIL(Rsobj_t*);
133 ADDOBJ(list,tail,obj);
156 ADDOBJ(list,tail,obj);
159 tail->right = NIL(Rsobj_t*);
165 ADDOBJ(list,tail,ob
[all...]
H A Drecsort.h128 Rskeyfield_t* tail; /* key field list tail */ member in struct:_rskey_s
/ast/src/lib/libast/path/
H A Dpathfind.c46 Dir_t* tail; /* directory list tail */ member in struct:__anon299
68 if (state.tail)
69 state.tail = state.tail->next = dp;
71 state.head = state.tail = dp;
/ast/src/lib/libdss/
H A Dtag.h66 void* tail; /* user defined pointer */ member in struct:Tagframe_s
H A Ddssopen.c800 * apply expression with optional head and tail queries to files in argv
804 dssrun(Dss_t* dss, const char* expression, const char* head, const char* tail, char** argv) argument
815 expression = tail ? tail : "{write}";
820 if (expression == tail)
821 tail = 0;
822 else if (!tail && !hasquery(expr))
823 tail = "{write}";
824 if (tail)
826 if (!(xt = dsscomp(dss, tail, Ni
[all...]
H A Dcxopen.c2042 Cxreference_t* tail; local
2098 tail->next = ref;
2101 tail = ref;
2121 v->type = tail->variable->type;
/ast/src/lib/libvcodex/Vchuff/
H A Dvchsize.c71 Vchtree_t *f, *s, *p, *list, *tail, *head; local
118 for(head = tail = NIL(Vchtree_t*), list = sort[0];; )
123 ** 3. tail == NULL or list->freq+list->next->freq >= tail->freq.
140 tail = head ? (tail->next = f) : (head = f);
141 tail->next = NIL(Vchtree_t*);
154 ** Now observe that tail->freq <= 2*head->freq and
155 ** tail->freq <= 2*list->freq. This gives I.3 in all cases.
167 tail
[all...]
/ast/src/lib/libvcodex/Vcmisc/
H A Dvcstrip.c22 /* Stripping head and tail data.
29 #define ST_TAIL 04 /* specifying tail to strip */
34 ssize_t tail; /* amount to strip from tail */ member in struct:_strip_s
40 { "tail", "Tail to strip is 'tail=amount'", (Void_t*)ST_TAIL },
93 /* find an appropriate tail amount to strip */
96 { for(z = st->tail; z > 0; --z)
106 { if((tsz = st->tail) > dsz)
212 st->tail
[all...]
/ast/src/lib/libvgraph/
H A Dgraph.c43 if(e1->tail != e2->tail)
44 return e1->tail < e2->tail ? -1 : 1;
88 gredge(gr, e->tail, e->head, e->label, -1);
92 gredge(gr, e->tail, e->head, e->label, -1);
118 Gredge_t* gredge(Graph_t* gr, Grnode_t* tail, Grnode_t* head, Void_t* label, int type) argument
124 if(gr->type == GR_UNDIRECTED) /* enforce tail <= head */
125 if(tail > head)
126 { nd = tail; tai
[all...]
H A Dvgraph.h34 Grnode_t* tail; /* tail of edge */ member in struct:_gredge_s
36 Void_t* label; /* (tail,head,label) ids edge */
/ast/src/lib/libast/cdt/
H A Ddthash.c153 Dtlink_t **t, **endt, *head, *tail, *l; local
157 { head = tail = NIL(Dtlink_t*);
160 { if(tail)
161 tail = (tail->_rght = l);
162 else head = tail = l;
164 *t = type == DT_FLATTEN ? tail : NIL(Dtlink_t*);
182 /* find the tail of the list for this slot */
/ast/src/lib/libjcl/
H A Djcllib.h49 struct Dirlist_s /* directory list head/tail */
52 Dir_t* tail; /* directory list tail */ member in struct:Dirlist_s
H A Dpath.c35 char* tail; member in struct:Map_s
178 * match tail pattern t to s
183 tail(register const char* t, register const char* s, int set) function
262 if (mp->tail)
268 if (!mp->prefix[j] && (!mp->tail || tail(mp->tail, &name[j], 0)))
279 if (lp->tail)
280 lp->length += tail(lp->tail,
378 char* tail; local
[all...]
/ast/src/cmd/re/
H A Dgrep.c140 Item_t* tail; /* list tail */ member in struct:List_s
224 p->head = p->tail = x;
228 else if (state.label || regcomb(&p->tail->re, &x->re))
230 p->tail = p->tail->next = x;
247 p->tail->next = x;
250 p->tail = x;
/ast/src/cmd/kshlib/cmdtst/
H A Dgrep.c152 Item_t* tail; /* list tail */ member in struct:List_s
271 if (state->labels.tail)
272 state->labels.tail = state->labels.tail->next = x;
274 state->labels.head = state->labels.tail = x;
296 p->tail->next = x;
299 p->tail = x;
404 state->labels.head = state->labels.tail = state->hit;
/ast/src/cmd/nmake/
H A Doption.c313 Oplist_t* lasthidden; /* tail of hidden */
315 Oplist_t* lastdelayed; /* tail of delayed */
318 Option_t* tail; /* tail of external option list */ member in struct:Optstate_s
396 if (opt.tail)
397 opt.tail->next = &options[i];
400 opt.tail = &options[i];
1198 if (opt.tail)
1199 opt.tail->next = nop;
1202 opt.tail
[all...]
/ast/src/cmd/html/
H A Dhtml2rtf.c98 par(int hanging, const char* tail) argument
107 sfprintf(state.out, "\\li%d\\tx%d\\tx20000%s", twips(state.indent), twips(state.indent), tail ? tail : "");
/ast/src/cmd/mailx/
H A Dimap.c108 Imaparg_t* tail; member in struct:__anon121
159 Imappart_t* lastpart; /* part list tail */
566 if (lp->tail)
567 lp->tail->next = ap;
570 lp->tail = ap;
600 ap->value.list.head = ap->value.list.tail = 0;
828 op->args.head = op->args.tail = 0;
H A Dmailx.h470 struct list* tail; member in struct:header::__anon135
758 Part_t* tail; member in struct:__anon136::state_part::__anon144

Completed in 74 milliseconds