Cross Reference: /ast/src/lib/librecsort/rs-rasp.c

Lines Matching refs:Rsobj_t
37 {	Rsobj_t*	empty;
38 	Rsobj_t*	slot[SLOT][UCHAR_MAX+1];
39 	Rsobj_t*	tree[UCHAR_MAX+1];
56 static int raspinsert(Rs_t* rs, reg Rsobj_t* obj)
60 reg Rsobj_t*	obj;
65 	reg Rsobj_t	*r, *root, *t, *l;
68 	Rsobj_t		link;
71 	obj->equal = NIL(Rsobj_t*);
112 		obj->left = obj->right = NIL(Rsobj_t*);
190 	l->right = NIL(Rsobj_t*);
191 	r->left = NIL(Rsobj_t*);
200 static Rsobj_t* radix(Rsobj_t* list)
202 static Rsobj_t* radix(list)
203 Rsobj_t*	list;
206 	reg Rsobj_t	*work, *r;
208 	reg Rsobj_t	**bin, *t, *endl, *next, **lo, **maxpart;
210 	Rsobj_t		*part[UCHAR_MAX+1];
213 		*lo = NIL(Rsobj_t*);
215 	work = list; list = NIL(Rsobj_t*);
216 	work->left->right = NIL(Rsobj_t*);
220 	{	next = work->left->right; work->left->right = NIL(Rsobj_t*);
238 			*lo = NIL(Rsobj_t*);
243 					*bin = NIL(Rsobj_t*);
264 			work = *lo; t = work->left; *lo = NIL(Rsobj_t*);
274 					*bin = NIL(Rsobj_t*);
307 static Rsobj_t* listmerge(reg Rsobj_t* one, reg Rsobj_t* two, reg int n)
309 static Rsobj_t* listmerge(one, two, n)
310 reg Rsobj_t*	one;
311 reg Rsobj_t*	two;
317 	reg Rsobj_t	*list, *endl, *endone, *endtwo;
319 	endone = one->left; one->left->right = NIL(Rsobj_t*);
320 	endtwo = two->left; two->left->right = NIL(Rsobj_t*);
369 static Rsobj_t* flatten(reg Rsobj_t* r)
371 static Rsobj_t* flatten(r)
372 reg Rsobj_t*	r;
374 {	reg Rsobj_t	*t, *p, *list;
396 static Rsobj_t* rasplist(Rs_t* rs)
398 static Rsobj_t* rasplist(rs)
402 	reg Rsobj_t	*r, *t, *list, *endl;
406 	list = endl = rasp->empty; rasp->empty = NIL(Rsobj_t*);
408 	for(n = 0, t = NIL(Rsobj_t*); n <= UCHAR_MAX; ++n)
412 			rasp->tree[n] = NIL(Rsobj_t*);
422 			rasp->slot[e][n] = NIL(Rsobj_t*);
431 			rasp->slot[0][n] = NIL(Rsobj_t*);
440 			t = NIL(Rsobj_t*);
446 		endl->right = NIL(Rsobj_t*);