/ast/src/lib/libast/cdt/ |
H A D | dtwalk.c | 39 Void_t *obj, *next; local 43 for(obj = dtfirst(dt); obj; ) 46 next = dtnext(dt,obj); 47 if((rv = (*userf)(walk, obj, data )) < 0) 49 obj = next;
|
H A D | dtview.c | 35 static Void_t* dtvsearch(Dt_t* dt, reg Void_t* obj, reg int type) argument 37 static Void_t* dtvsearch(dt,obj,type) 39 reg Void_t* obj; 48 return (*(dt->meth->searchf))(dt,obj,type); 56 if((o = (*(d->meth->searchf))(d,obj,type)) ) 69 { if(!(o = (*d->meth->searchf)(d, obj, type)) ) 97 if((o = (*(d->meth->searchf))(d, obj, DT_SEARCH)) ) 100 if(!(obj = o) ) 104 for(d = dt->walk, obj = (*d->meth->searchf)(d, obj, typ [all...] |
H A D | dtlist.c | 39 char *obj, *endb, buf[1024]; local 49 obj = (*objprintf)(_DTOBJ(disc, here)); 50 k = strlen(obj); memcpy(endb, obj, k); endb += k; 163 static Void_t* dtlist(Dt_t* dt, Void_t* obj, int type) argument 165 static Void_t* dtlist(dt, obj, type) 167 Void_t* obj; 183 DTRETURN(obj, lfirstlast(dt, type)); 185 DTRETURN(obj, llist(dt, (Dtlink_t*)obj, typ [all...] |
H A D | dthash.c | 202 Void_t *obj; local 214 obj = _DTOBJ(disc,l); 215 if((*dt->meth->searchf)(dt, (Void_t*)l, DT_RELINK) == obj) 250 static Void_t* dthashchain(Dt_t* dt, Void_t* obj, int type) argument 252 static Void_t* dthashchain(dt,obj,type) 254 Void_t* obj; 271 DTRETURN(obj, NIL(Void_t*)); 278 DTRETURN(obj, hfirst(dt)); 280 DTRETURN(obj, hclear(dt)); 282 DTRETURN(obj, hsta [all...] |
H A D | dttree.c | 26 ** obj: the object to look for. 41 char *obj, *endb, buf[1024]; local 53 obj = (*objprintf)(_DTOBJ(disc, here)); 54 k = strlen(obj); memcpy(endb, obj, k); endb += k; 61 obj = (*objprintf)(_DTOBJ(disc,here->_left)); 62 else obj = "NIL"; 63 k = strlen(obj); memcpy(endb, obj, k); endb += k; 69 obj 151 Void_t *obj; local 285 troot(Dt_t* dt, Dtlink_t* list, Dtlink_t* link, Void_t* obj, int type) argument 394 dttree(Dt_t* dt, Void_t* obj, int type) argument [all...] |
/ast/src/cmd/mailx/port/ |
H A D | dtwalk.c | 86 reg Void_t *obj, *next; local 90 for(obj = dtfirst(dt); obj; ) 93 next = dtnext(dt,obj); 94 if((rv = (*userf)(walk, obj, data )) < 0) 96 obj = next;
|
H A D | dttree.c | 73 ** obj: the object to look for. 80 static Void_t* dttree(Dt_t* dt, reg Void_t* obj, int type) argument 82 static Void_t* dttree(dt,obj,type) 84 reg Void_t* obj; 97 if(!obj) 135 key = (char*)obj; 138 { me = (Dtlink_t*)obj; 139 obj = OBJ(me,disc); 141 key = KEY(obj,disc); 147 if(root && obj ! [all...] |
H A D | dtlist.c | 78 static Void_t* dtlist(reg Dt_t* dt, reg Void_t* obj, reg int type) argument 80 static Void_t* dtlist(dt, obj, type) 82 reg Void_t* obj; 90 if(!obj) 117 key = (char*)obj; 120 { renew = (Dtlink_t*)obj; 121 obj = OBJ(renew,disc); 123 key = KEY(obj,disc); 128 if(!(t = dt->data->here) || OBJ(t,disc) != obj) 163 obj [all...] |
H A D | dtstkq.c | 80 static Void_t* dtstkq(Dt_t* dt, reg Void_t* obj, reg int type) argument 82 static Void_t* dtstkq(dt, obj, type) 84 reg Void_t* obj; 94 if(!t || (obj && obj != OBJ(t,disc)) ) 102 obj = OBJ(t,disc); 104 (*disc->freef)(dt,obj,disc); 107 return obj; 110 if(!obj) 136 { if(disc->makef && !(obj [all...] |
H A D | dtrenew.c | 77 Void_t* dtrenew(Dt_t* dt, reg Void_t* obj) argument 79 Void_t* dtrenew(dt, obj) 81 reg Void_t* obj; 91 if(!(e = dt->data->here) || OBJ(e,disc) != obj) 113 key = KEY(obj,disc); 144 return obj; 148 return (*dt->meth->searchf)(dt,(Void_t*)e,DT_RENEW) ? obj : NIL(Void_t*);
|
H A D | dtview.c | 77 static Void_t* dtvsearch(Dt_t* dt, reg Void_t* obj, reg int type) argument 79 static Void_t* dtvsearch(dt,obj,type) 81 reg Void_t* obj; 90 return (*(dt->meth->searchf))(dt,obj,type); 92 if(!obj && !(type&(DT_FIRST|DT_LAST)) ) 97 { if((o = (*(d->meth->searchf))(d,obj,type)) ) 111 for(d = dt->walk, o = (*(d->meth->searchf))(d,obj,type); ; )
|
H A D | dthash.c | 73 ** obj: what to look for 124 static Void_t* dthash(Dt_t* dt, reg Void_t* obj, int type) argument 126 static Void_t* dthash(dt,obj,type) 128 reg Void_t* obj; 140 if(!obj) 180 key = (char*)obj; 183 { r = (Dtlink_t*)obj; 184 obj = OBJ(r,disc); 186 key = KEY(obj,disc); 191 if(!(t = dt->data->here) || OBJ(t,disc) != obj) [all...] |
/ast/src/lib/librecsort/ |
H A D | rs-verify.c | 29 { Rsobj_t obj; member in struct:rsverify_s 30 ulong o; /* obj's ordinal */ 35 static int verifyinsert(Rs_t* rs, reg Rsobj_t* obj) argument 37 static int verifyinsert(rs, obj) 39 reg Rsobj_t* obj; 48 p = &verify->obj; ph = p->order; 50 OBJHEAD(obj); oh = obj->order; 51 if(verify->n > 0) /* compare with current obj */ 52 { OBJCMP(obj, [all...] |
H A D | rs-copy.c | 36 static int copyinsert(Rs_t* rs, reg Rsobj_t* obj) argument 38 static int copyinsert(rs, obj) 40 reg Rsobj_t* obj; 46 copy->tail->right = obj; 48 copy->head = obj; 49 copy->tail = obj;
|
H A D | rs-splay.c | 33 static int splayinsert(Rs_t* rs, reg Rsobj_t* obj) argument 35 static int splayinsert(rs, obj) 37 reg Rsobj_t* obj; 45 obj->equal = NIL(Rsobj_t*); 46 OBJHEAD(obj); 49 { obj->left = obj->right = NIL(Rsobj_t*); 50 splay->root = obj; 54 OBJCMP(obj,root,cmp); 56 { EQUAL(root,obj, [all...] |
H A D | rslist.c | 30 { Rsobj_t* obj; member in struct:_union_s 35 #define ADDOBJ(list,tail,obj) (tail = tail ? (tail->right = obj) : (list = obj) ) 49 reg Rsobj_t *obj, *o; local 53 obj = un->obj; 59 o = (*m)->obj; 60 OBJCMP(o,obj,cmp); 70 { o = (*r)->obj; 107 reg Rsobj_t *obj, *o, *e, *list, *tail; local [all...] |
H A D | rsmerge.c | 36 { Rsobj_t obj[MG_CACHE]; /* records */ member in struct:_merge_s 51 #define APPEND(rs,obj,t) \ 53 { t->left->right = (obj); } \ 54 else { rs->sorted = t = (obj); } \ 55 t->left = (obj); \ 135 reg Rsobj_t *obj, *endobj; local 231 endobj = (obj = mg->obj)+MG_CACHE; 239 { obj->equal = NIL(Rsobj_t*); 240 obj 510 reg Rsobj_t *obj, *o; local 572 Rsobj_t obj, out; local 845 reg Rsobj_t *obj; local 931 reg Rsobj_t *obj, *o, *t, *endobj; local [all...] |
/ast/src/cmd/tests/aso/ |
H A D | tthread.c | 48 Obj_t* obj; local 54 if((obj = Objlist)) 55 { Objlist = obj->next; 56 free(obj); 62 if(!obj) 71 Obj_t *obj; local 93 { if(!(obj = malloc(sizeof(Obj_t))) ) 95 obj->value = i; 96 obj->next = Objlist; 97 Objlist = obj; [all...] |
/ast/src/cmd/tests/cdt/ |
H A D | tbags.c | 43 Obj_t *obj = (Obj_t*)arg; local 46 sprintf(buf,"%ld,%ld", obj->key, obj->ord); 60 Obj_t *p, *o, *obj, proto; local 103 { obj = Obj + i*R_OBJ + k; 104 o = (meth == 3 || i%2 == 0) ? dtappend(dt,obj) : dtinsert(dt,obj); 105 if(o != obj) 106 terror("%s: dtappend (key=%d,ord=%d) failed", name, obj->key, obj [all...] |
H A D | tevent.c | 25 static int event(Dt_t* dt, int type, Void_t* obj, Dtdisc_t* disc) argument 32 { *(ssize_t*)obj = 1024; 57 static Void_t* memory(Dt_t* dt, Void_t* obj, size_t size, Dtdisc_t* disc) argument 59 if(!obj) 62 { free(obj);
|
H A D | tshare.c | 28 static int event(Dt_t* dt, int type, Void_t* obj, Dtdisc_t* disc) argument 30 static int event(dt, type, obj, disc) 33 Void_t* obj; 38 if(obj) 42 { *((Void_t**)obj) = (Void_t*)(&Space[0]);
|
/ast/src/lib/libast/disc/ |
H A D | memfatal.c | 48 nomalloc(Vmalloc_t* region, int type, void* obj, Vmdisc_t* disc) argument 57 error(ERROR_SYSTEM|3, "invalid pointer %p passed to free or realloc", obj); 62 error(ERROR_SYSTEM|3, "storage allocator out of space on %lu byte request ( region %lu segments %lu busy %lu:%lu:%lu free %lu:%lu:%lu )", (size_t)obj, st.extent, st.n_seg, st.n_busy, st.s_busy, st.m_busy, st.n_free, st.s_free, st.m_free);
|
/ast/src/lib/libast/comp/ |
H A D | tsearch.c | 176 Tree_t obj; local 183 obj.key = (Void_t*)key; 184 dtdelete(dt,&obj); 201 static void _twalk(Tree_t* obj, void(*action)(const Void_t*,VISIT,int), int level) argument 203 static void _twalk(obj,action,level) 204 Tree_t* obj; 208 { if(!obj->lchild && !obj->rchild) 209 (*action)((Void_t*)obj,leaf,level); 211 { (*action)((Void_t*)obj,preorde [all...] |
H A D | hsearch.c | 69 static void hashfree(Dt_t* dt, Void_t* obj, Dtdisc_t* disc) argument 71 static void hashfree(dt, obj, disc) 73 Void_t* obj; 77 free(((Hash_t*)obj)->item.key); 78 free(obj);
|
/ast/src/lib/libvcodex/Vchuff/ |
H A D | vchuffgroup.c | 43 { Vchobj_t obj; /* object */ member in struct:_obj_s 59 Obj_t* obj; /* objs and their frequencies */ member in struct:_group_s 75 { case 16: fr[oo->obj] += oo->freq; oo++; case 15: fr[oo->obj] += oo->freq; oo++; \ 76 case 14: fr[oo->obj] += oo->freq; oo++; case 13: fr[oo->obj] += oo->freq; oo++; \ 77 case 12: fr[oo->obj] += oo->freq; oo++; case 11: fr[oo->obj] += oo->freq; oo++; \ 78 case 10: fr[oo->obj] += oo->freq; oo++; case 9: fr[oo->obj] 242 Obj_t *obj = grp->obj; local [all...] |