Searched refs:list (Results 1 - 25 of 164) sorted by relevance

1234567

/ast/src/cmd/mailx/port/
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 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 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 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/lib/libast/comp/
H A Datexit.c53 struct list
55 struct list* next;
59 static struct list* funclist;
66 register struct list* p;
68 if (!(p = newof(0, struct list, 1, 0))) return(-1);
78 register struct list* p;
/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...]
/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/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 Dvcbuffer.c49 { for(n = NIL(Vcbuffer_t*), b = vc->list; b; n = b, b = b->next)
57 else vc->list = b->next;
72 { b->next = vc->list;
73 vc->list = b;
93 b->next = vc->list;
94 vc->list = b;
105 for(b = vc->list; b; b = n)
115 vc->list = NIL(Vcbuffer_t*);
127 b->next = vc->list;
135 vc->list
[all...]
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/cmd/mam/
H A Dmamdag.sh61 list[0]=all
75 make) case " ${list[level]} " in
77 *) list[level]="${list[level]} \"$arg\"" ;;
80 list[level]=\"$arg\"
82 prev) case " ${list[level]} " in
84 *) list[level]="${list[level]} \"$arg\"" ;;
87 done) case ${list[level]} in
88 *' '*) print ${list[leve
[all...]
H A Dmamold.sh34 do [[ " $list " == *" $i "* ]] && continue
35 list="$list $i"
43 typeset rule list order target variable
76 list=
77 closure ${prereqs[$rule]} && print && convert "$rule :$list"
/ast/src/lib/libast/cdt/
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...]
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);
/ast/src/lib/librecsort/
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...]
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...]
/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/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/libtk/library/demos/
H A Dbrowse15 scrollbar .scroll -command ".list yview"
17 listbox .list -yscroll ".scroll set" -relief sunken -width 20 -height 20 \
19 pack .list -side left -fill both -expand yes
45 # Fill the listbox with a list of all the files in the directory (run
50 .list insert end $i
56 bind .list <Double-Button-1> {foreach i [selection get] {browse $dir $i}}
/ast/src/cmd/cs/vcs_src/
H A Dvcs_search.c68 register rdirent_t* list; local
72 if ((list = rs_dir(rf, ap)) == NULL)
75 *dir = list;
77 r = lookup_tag(list, rf, ap, versions, domain, &tp, 0);
79 r = gettagbyspec(list, versions, domain, &tp);
86 if ((tp = gettagbyname(list, tp->version, G_LINK, 0)) == NULL)
95 int gettagbyspec(list, versions, domain, tpp)
96 register rdirent_t* list;
116 for (entry=list, i=0; entry; entry = entry->next, i++)
210 register rdirent_t* list; local
[all...]
H A Dvcs_cmd.h27 rdirent_t* list; member in struct:rfile_t
/ast/src/cmd/kshlib/cmdtst/
H A DMakefile5 cmdtst plugin=ksh list=b_ :LIBRARY: lib.c grep.c xargs.c -lcmd
/ast/src/lib/libvcodex/Vchuff/
H A Dvchsize.c71 Vchtree_t *f, *s, *p, *list, *tail, *head; local
77 /* construct list of elements with non-zero weights */
110 /* build linked list sorted by frequencies */
113 { f->link = f; /* nodes in each subtree are kept in a circular list */
118 for(head = tail = NIL(Vchtree_t*), list = sort[0];; )
120 ** 0. The lists "list" and "head" are sorted by frequency.
121 ** 1. list and list->next are not NULL;
122 ** 2. head == NULL or head->freq >= list->next->freq
123 ** 3. tail == NULL or list
[all...]
/ast/src/lib/libmam/
H A Dmam.h56 struct list* prereqs; /* explicit prerequisite list */
57 struct list* implicit; /* implicit prerequisite list */
88 struct list /* prereq list */ struct
90 struct list* next; /* next prereq */
94 struct block /* data block list */
105 struct proc* child; /* child proc list */
143 extern void mamprereq(struct proc*, struct rule*, struct rule*, struct list**);
[all...]

Completed in 77 milliseconds

1234567