Lines Matching defs:work
62 reg Rsobj_t *work, *r;
74 work = radix->list; radix->list = NIL(Rsobj_t*);
75 work->left->right = NIL(Rsobj_t*);
79 { maxph = work->keylen-1;
80 for(work->order = 0; work; )
81 { next = work->left->right; work->left->right = NIL(Rsobj_t*);
84 if((ph = (ssize_t)work->order) == maxph)
85 { for(; work; work = work->right)
86 { bin = part + work->key[ph];
88 { *bin = work;
93 else EQUAL(r,work,t);
106 work = next;
109 { for(; work; work = work->right)
110 { bin = part + work->key[ph];
112 r->left->right = work;
114 { r = *bin = work;
119 r->left = work;
123 work = *lo; t = work->left; *lo = NIL(Rsobj_t*);
124 work->order = ph;
139 if(work && work->left == work)
140 { endl = list ? (endl->right = work) : (list = work);
141 for(work = work->right; work; work = work->right)
142 { if(work->left != work)
144 endl = endl->right = work;
150 { for(work->order = 0; work; )
151 { next = work->left->right; work->left->right = NIL(Rsobj_t*);
154 ph = (ssize_t)work->order;
155 for(; work; work = work->right)
156 { if(ph >= work->keylen)
158 empty = work;
159 else EQUAL(empty,work,t);
162 { bin = part + work->key[ph];
164 r->left->right = work;
166 { r = *bin = work;
171 r->left = work;
183 work = next;
186 work = *lo; *lo = NIL(Rsobj_t*);
187 t = work->left;
188 work->order = ph;
205 if(work && work->left == work)
206 { endl = list ? (endl->right = work) : (list = work);
207 for(work = work->right; work; work = work->right)
208 { if(work->left != work)
210 endl = endl->right = work;