Searched defs:list (Results 1 - 25 of 95) sorted by relevance

1234

/ast/src/cmd/mailx/port/
H A Ddtextract.c11 * copyright notice, this list of conditions and the *
15 * copyright notice, this list of conditions and the *
42 * notice, this list of conditions and the following disclaimer. *
44 * notice, this list of conditions and the following disclaimer in *
82 reg Dtlink_t *t, *last, *list, **slot, **eslot; local
87 list = dt->data->here;
88 else if(dt->data->type&DT_HASH) /* make a big list of everything */
89 { list = last = NIL(Dtlink_t*);
97 else list = last = t;
103 { list
[all...]
H A Ddtflatten.c11 * copyright notice, this list of conditions and the *
15 * copyright notice, this list of conditions and the *
42 * notice, this list of conditions and the following disclaimer. *
44 * notice, this list of conditions and the following disclaimer in *
70 /* Flatten a dictionary into a linked list.
83 reg Dtlink_t *r, *t, *list, *last, **slot, **eslot; local
89 list = last = NIL(Dtlink_t*);
97 else list = last = t;
107 last = last ? (last->right = r) : (list = r);
112 list
[all...]
H A Ddtrestore.c11 * copyright notice, this list of conditions and the *
15 * copyright notice, this list of conditions and the *
42 * notice, this list of conditions and the following disclaimer. *
44 * notice, this list of conditions and the following disclaimer in *
70 /* Restore dictionary from given tree or list of elements.
71 ** There are two cases. If called from within, list is nil.
72 ** From without, list is not nil and data->size must be 0.
78 int dtrestore(reg Dt_t* dt, reg Dtlink_t* list) argument
80 int dtrestore(dt, list)
82 reg Dtlink_t* list;
[all...]
H A Ddtmethod.c11 * copyright notice, this list of conditions and the *
15 * copyright notice, this list of conditions and the *
42 * notice, this list of conditions and the following disclaimer. *
44 * notice, this list of conditions and the following disclaimer in *
84 reg Dtlink_t *list, *t, **slot, **eslot; local
102 /* get the list of elements */
103 list = dtflatten(dt);
138 while(list)
139 { t = list->right;
141 { reg char* key = (char*)OBJ(list,dis
[all...]
/ast/src/cmd/vczip/tests/
H A Dtio.c33 Vcint_t v, g, list[N_LIST], copy[N_LIST]; local
76 /* Generate a list of positive integers.
79 list[0] = 2; list[1] = 6; list[2] = 9; list[3] = 7; list[4] = 2;
85 list[v] = list[v-1] + (random()%17);
86 else list[
[all...]
/ast/src/lib/libast/cdt/
H A Ddtdisc.c61 Dtlink_t *list; local
77 list = dtextract(dt); /* grab the list of objects if any */
78 else list = NIL(Dtlink_t*);
84 if(list ) /* reinsert extracted objects (with new discipline) */
85 dtrestore(dt, list);
H A Ddtmethod.c37 Dtlink_t *list; local
49 list = dtextract(dt); /* extract elements out of dictionary */
72 dtrestore(dt, list);
76 { dtrestore(dt, list);
H A Ddtlist.c31 Dtlink_t* link; /* list of objects */
41 Dtlist_t *list = (Dtlist_t*)dt->data; local
43 if(!here && !(here = list->link) )
71 Dtlist_t *list = (Dtlist_t*)dt->data; local
73 if((lnk = list->link) )
76 list->here = lnk; /* finger points to this */
92 Dtlist_t *list = (Dtlist_t*)dt->data; local
94 lnk = list->link;
95 list->link = list
118 Dtlist_t *list = (Dtlist_t*)dt->data; local
174 Dtlist_t *list = (Dtlist_t*)dt->data; local
346 Dtlist_t *list = (Dtlist_t*)dt->data; local
[all...]
/ast/src/cmd/cs/vcs_src/
H A Dvcs_cmd.h27 rdirent_t* list; member in struct:rfile_t
H A Dvcs_rscs.c35 rdirent_t* list; local
66 if (search_tag(rf.fd, rf.ap, vs.version, 0, &(vs.tp), G_LINK, &list))
99 register rdirent_t* list; local
118 if ((list = rs_dir(fd, &attr)) == NULL)
132 while(list != NULL)
134 len = sfsprintf(s, rsize, "%s ", list->tag->version);
137 list = list->next;
/ast/src/lib/libvcodex/
H A Dvcbcktsort.c31 ssize_t vcbcktsort(ssize_t* indx, ssize_t* list, ssize_t n, Vcchar_t* data, ssize_t* bckt) argument
33 ssize_t vcbcktsort(indx, list, n, data, bckt)
35 ssize_t* list; /* indices to be sorted */
46 if(list) /* sort using secondary predictor */
48 bckt[data[list[p]]] += 1;
62 if(list) /* sorting a sublist of indices */
64 indx[bckt[data[list[p]]]++] = list[p];
81 ssize_t vcbcktsort(ssize_t* sort, ssize_t* list, ssize_t n, Vcchar_t* data, ssize_t* bckt)
83 ssize_t vcbcktsort(sort, list,
[all...]
H A Dvcqsort.c36 void vcqsort(Void_t* list, ssize_t n, ssize_t size, Vccompare_f comparf, Void_t* disc) argument
38 void vcqsort(list, n, size, sortf, disc)
39 Void_t* list; /* list of objects to be sorted */
40 ssize_t n; /* number of objects in list[] */
47 Vcchar_t *base = (Vcchar_t*)list;
H A Dvcopen.c76 /* construct a handle from a list of methods and arguments */
97 Meth_t *list, *mt; local
109 for(list = NIL(Meth_t*);;)
146 mt->next = list; list = mt;
150 for(mt = list; mt; mt = mt->next)
159 done: for(; list; list = mt)
160 { mt = list->next;
161 free(list);
[all...]
/ast/src/lib/libvgraph/
H A Dgrfold.c26 Grnode_t* grfold(Grnode_t* list, Grnode_t* fold) argument
31 if(!list)
34 fold = list;
37 for(nd = list; nd; nd = nd->link)
42 for(nd = list; nd; nd = nd->link)
/ast/src/lib/libpp/
H A Dppbuiltin.c51 struct pplist* list; local
252 p = (list = (struct pplist*)hashget(pp.prdtab, a)) ? list->value : "";
/ast/src/lib/librecsort/
H A Drs-splay.c159 { reg Rsobj_t *t, *p, *list; local
161 /* find smallest element and make it head of list */
166 for(list = p = r, r = r->right;; p = r, r = r->right)
168 { list->left = p;
169 return list;
187 reg Rsobj_t* list; local
192 list = flatten(splay->root);
195 return list;
H A Drs-radix.c23 ** 1. All records are kept on a linked list.
24 ** 2. In each phase, portions of the linked list are sorted using
33 { Rsobj_t* list; member in struct:rsradix_s
48 if((r = radix->list) )
50 else radix->list = (r = obj);
64 reg Rsobj_t **bin, *t, *empty, *list, *endl, *next, **lo, **maxpart; local
69 if (!radix->list)
74 work = radix->list; radix->list = NIL(Rsobj_t*);
76 list
[all...]
H A Drslist.c23 /* Get a list of objects from a sorting context.
35 #define ADDOBJ(list,tail,obj) (tail = tail ? (tail->right = obj) : (list = obj) )
38 ** Ties are broken by list positions to preserve stability.
41 static int uninsert(Union_t** list, int n, Union_t* un) argument
43 static int uninsert(list, n, un)
44 Union_t** list;
54 r = (l = list) + n;
88 { for(r = list+n; r > l; --r)
107 reg Rsobj_t *obj, *o, *e, *list, *tai local
212 reg Rsobj_t *list, *next, *p, *r, *t, *e; local
[all...]
/ast/src/cmd/tests/vmalloc/
H A Dtsafemalloc.c34 { void* list[N_ALLOC]; member in struct:_thread_s
50 if(!(tdata->list[k] = malloc(size)) )
55 memset(tdata->list[k], 1, size);
60 if(tdata->list[p])
63 if(!(tdata->list[p] = realloc(tdata->list[p], size)) )
69 memset(tdata->list[p], 255, size);
73 { free(tdata->list[p]);
74 tdata->list[p] = 0;
/ast/src/lib/libast/comp/
H A Dwordexp.c31 struct list struct
33 struct list *next;
172 ((struct list*)cp)->next = (struct list*)(*av);
203 struct list *arg, *argnext;
206 argnext = (struct list*)wdarg->we_wordv[-1];
/ast/src/lib/libast/hash/
H A Dhashlib.h67 Hash_root_t* next; /* next in list of all roots */ \
68 Hash_table_t* references; /* referencing table list */
74 Hash_table_t* next; /* root reference list link */
99 Hash_root_t* list; /* root table list */ member in struct:__anon263
/ast/src/cmd/nmake/
H A DTABLE.mk10 * set TABLE.list=1 or TABLE.list.name=1 to list the table variables
18 local table=$(I) class format ignore map name novariables options list state $(~$(I)) $(>)
26 if TABLE.list || "$(TABLE.list.$(table))"
27 list = 1 macro
52 : $(.TABLE.SET. $(table) "$(class)" $(format) "$(state)" "$(map)" "$(ignore)" "$(list)")
67 local I J M N V (row name format assign map ignore list) $(%)
92 if list
[all...]
/ast/src/cmd/std/
H A Dfile.c52 "[f:files|file-list?\afile\a contains list of file names, one per line, that"
55 "[l:list?The loaded \amagic\a files are listed and then \bfile\b exits.]"
69 "[q:quiet|silent?Do not list matching \b--pattern\b files.]"
184 Sfio_t* list = 0; local
215 list = sfstdin;
216 else if (!(list = sfopen(NiL, opt_info.arg, "r")))
272 if (!list && !*argv)
273 list = sfstdin;
274 if (list)
[all...]
H A Diconv.c47 " above list may be incomplete.]"
56 "[l:list?List all known codesets on the standard output.]"
143 int list; local
151 all = ignore = list = 0;
188 list = 1;
208 if (list)
/ast/src/lib/libodelta/
H A Dsuftree.c32 ** are kept in a linked list which is managed by a move-to-front
85 Suftree *list; local
87 if(!(list = (Suftree*)malloc((n+1)*sizeof(Suftree))))
94 /* store where this list is for later deletion */
95 NEXT(list) = 0;
100 NEXT(root) = list;
103 return list+1;
125 Suftree *root, *list, *endlist; local
137 if(!(list = getmem(root,n)))
139 endlist = list
[all...]

Completed in 30 milliseconds

1234