/ast/src/cmd/sortlib/sync/ |
H A D | test.c | 37 E00(int index, Rsobj_t* rp, Rsobj_t* dp, void** data) 102 extern int E11(Rsobj_t* rp, Rsobj_t* dp, void** state) { return E00(11, rp, dp, state); } 103 extern int E14(Rsobj_t* rp, Rsobj_t* dp, void** state) { return E00(14, rp, dp, state); } 104 extern int E15(Rsobj_t* rp, Rsobj_t* dp, void** state) { return E00(15, rp, dp, state); } 105 extern int E16(Rsobj_t* rp, Rsobj_t* d [all...] |
H A D | ssexit.h | 47 typedef int (*Ssexit_f)(Rsobj_t*, Rsobj_t*, void**);
|
H A D | ss.h | 88 typedef int (*Ssexit_f)(Rsobj_t*, Rsobj_t*, void**); 89 typedef int (*Ssintercept_f)(Ssexit_f, Rsobj_t*, Rsobj_t*, void**);
|
H A D | sync.c | 39 " rs_intercept(\acallout\a,Rsobj_t*rec,Rsobj_t*dup,void**state)," 41 " \acallout\a(Rsobj_t*rec,Rsobj_t*dup,void**state)." 44 " [+Rsobj_t* rec?The current record.]" 45 " [+Rsobj_t* dup?The record comparing equal to \arec\a just before" 112 junk(State_t* state, Rsobj_t* r) 158 Rsobj_t* rp; 159 Rsobj_t* ep; 190 rp = (Rsobj_t*)dat [all...] |
/ast/src/lib/librecsort/ |
H A D | rs-copy.c | 31 Rsobj_t* head; 32 Rsobj_t* tail; 36 static int copyinsert(Rs_t* rs, reg Rsobj_t* obj) 40 reg Rsobj_t* obj; 54 static Rsobj_t* copylist(Rs_t* rs) 56 static Rsobj_t* copylist(rs)
|
H A D | rs-splay.c | 29 { Rsobj_t* root; 33 static int splayinsert(Rs_t* rs, reg Rsobj_t* obj) 37 reg Rsobj_t* obj; 41 reg Rsobj_t *r, *root, *t, *l; 42 Rsobj_t link; 45 obj->equal = NIL(Rsobj_t*); 49 { obj->left = obj->right = NIL(Rsobj_t*); 62 obj->right = NIL(Rsobj_t*); 70 obj->left = NIL(Rsobj_t*); 144 l->right = NIL(Rsobj_t*); [all...] |
H A D | rs-radix.c | 33 { Rsobj_t* list; 37 static int radixinsert(Rs_t* rs, reg Rsobj_t* obj) 41 reg Rsobj_t* obj; 44 reg Rsobj_t* r; 47 obj->equal = NIL(Rsobj_t*); 56 static Rsobj_t* radixlist(Rs_t* rs) 58 static Rsobj_t* radixlist(rs) 62 reg Rsobj_t *work, *r; 64 reg Rsobj_t **bin, *t, *empty, *list, *endl, *next, **lo, **maxpart; 66 Rsobj_t *par [all...] |
H A D | rs-rasp.c | 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*); [all...] |
H A D | rslist.c | 30 { Rsobj_t* obj; 49 reg Rsobj_t *obj, *o; 98 static Rsobj_t* unionize(Rsobj_t** objlist, int n) 100 static Rsobj_t* unionize(objlist, n) 101 Rsobj_t** objlist; 107 reg Rsobj_t *obj, *o, *e, *list, *tail; 112 return NIL(Rsobj_t*); 115 return NIL(Rsobj_t*); 128 list = tail = NIL(Rsobj_t*); [all...] |
H A D | rsclear.c | 44 rs->free = rs->sorted = NIL(Rsobj_t*);
|
H A D | rs-verify.c | 29 { Rsobj_t obj; 35 static int verifyinsert(Rs_t* rs, reg Rsobj_t* obj) 39 reg Rsobj_t* obj; 45 reg Rsobj_t* p; 78 obj->equal = obj->left = obj->right = NIL(Rsobj_t*); 106 p->left = NIL(Rsobj_t*); 130 static Rsobj_t* verifylist(Rs_t* rs) 132 static Rsobj_t* verifylist(rs) 137 reg Rsobj_t* p = &verify->obj; 143 return NIL(Rsobj_t*); [all...] |
H A D | rsprocess.c | 33 static Rsobj_t* rsalloc(Rs_t* rs) 35 static Rsobj_t* rsalloc(rs) 39 reg Rsobj_t *r, *endr; 41 if(!(rs->free = r = (Rsobj_t*)vmalloc(rs->vm,RS_ALLOC*sizeof(Rsobj_t))) ) 42 return NIL(Rsobj_t*); 45 r->right = NIL(Rsobj_t*); 61 reg Rsobj_t* r; 66 int (*insertf)_ARG_((Rs_t*, Rsobj_t*)) = rs->meth->insertf; 112 Rsobj_t** lis [all...] |
H A D | recsort.h | 36 typedef struct _rsobj_s Rsobj_t; typedef in typeref:struct:_rsobj_s 51 { int (*insertf)_ARG_((Rs_t*, Rsobj_t*)); 52 Rsobj_t* (*listf)_ARG_((Rs_t*)); 73 Rsobj_t* left; /* left/last link or out of order */ 74 Rsobj_t* right; /* next record in sorted list */ 75 Rsobj_t* equal; /* equivalence class */ 242 extern Rsobj_t* rslist _ARG_((Rs_t*));
|
H A D | rsmerge.c | 36 { Rsobj_t obj[MG_CACHE]; /* records */ 105 reg Rsobj_t* r; 109 { r->left->right = NIL(Rsobj_t*); 119 rs->sorted = NIL(Rsobj_t*); 135 reg Rsobj_t *obj, *endobj; 239 { obj->equal = NIL(Rsobj_t*); 256 { obj->equal = NIL(Rsobj_t*); 465 static int mgcompare(Rs_t* rs, Rsobj_t* one, Rsobj_t* two, int reverse) 469 reg Rsobj_t* on [all...] |
H A D | rshdr.h | 46 Rsobj_t* sorted; /* defined after a reclist call */ \ 47 Rsobj_t** list; /* list of processed contexts */ \ 49 Rsobj_t* free; /* free list of objects */ \
|
H A D | rswrite.c | 81 reg Rsobj_t *r, *e, *o; 85 Rsobj_t out; 86 Rsobj_t tmp; 87 Rsobj_t usr;
|
/ast/src/cmd/dsslib/sort/ |
H A D | sort.c | 104 Rsobj_t* r; 105 Rsobj_t* q; 114 r = (Rsobj_t*)data;
|
/ast/src/cmd/sortlib/sum/ |
H A D | sortsum.c | 156 record(register State_t* state, register Rsobj_t* r, int op) 396 register Rsobj_t* r; 397 register Rsobj_t* q; 405 r = (Rsobj_t*)data;
|
/ast/src/cmd/sortlib/glean/ |
H A D | glean.c | 163 register Rsobj_t* r; 185 r = (Rsobj_t*)data;
|
/ast/src/cmd/sort/ |
H A D | main.c | 346 error(3, "disorder at record %lld", (Sflong_t)((Rsobj_t*)data)->order);
|