| /titanic_41/usr/src/lib/libast/common/cdt/ |
| H A D | dtview.c | 46 return (*(dt->meth->searchf))(dt,obj,type);
51 if((o = (*(d->meth->searchf))(d,obj,type)) )
63 { if(!(o = (*d->meth->searchf)(d, obj, type)) )
91 if((o = (*(d->meth->searchf))(d, obj, DT_SEARCH)) )
98 for(d = dt->walk, obj = (*d->meth->searchf)(d, obj, type);; )
103 if((*(p->meth->searchf))(p, obj, DT_SEARCH) )
106 obj = (*d->meth->searchf)(d, obj, type);
112 obj = (*(d->meth->searchf))(d,NIL(Void_t*),DT_FIRST);
113 else obj = (*(d->meth->searchf))(d,NIL(Void_t*),DT_LAST);
145 { dt->searchf = dt->meth->searchf;
[all …]
|
| H A D | dtmethod.c | 65 if(dt->searchf == oldmeth->searchf)
66 dt->searchf = meth->searchf;
83 (*meth->searchf)(dt,(Void_t*)list,DT_RENEW);
101 (void)(*meth->searchf)(dt,(Void_t*)list,DT_RENEW);
|
| H A D | dtopen.c | 50 dt->searchf = NIL(Dtsearch_f);
77 dt->searchf = NIL(Dtsearch_f);
102 dt->searchf = meth->searchf;
|
| H A D | dtdisc.c | 60 reg Dtsearch_f searchf; local
75 searchf = dt->meth->searchf;
122 (void)(*searchf)(dt,(Void_t*)r,DT_RENEW);
|
| H A D | dtrestore.c | 41 reg Dtsearch_f searchf = dt->meth->searchf; local
71 (*searchf)(dt,(Void_t*)list,DT_RENEW);
|
| H A D | dtclose.c | 51 { (void)(*(dt->meth->searchf))(dt,NIL(Void_t*),DT_CLEAR);
|
| H A D | dtrenew.c | 78 return (*dt->meth->searchf)(dt,(Void_t*)e,DT_RENEW) ? obj : NIL(Void_t*);
|
| /titanic_41/usr/src/lib/libast/amd64/include/ast/ |
| H A D | cdt.h | 70 { Dtsearch_f searchf; /* search function */ member
116 { Dtsearch_f searchf;/* search function */ member
293 #define dtfirst(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_FIRST)
294 #define dtnext(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_NEXT)
295 #define dtleast(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_NEXT)
296 #define dtlast(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_LAST)
297 #define dtprev(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_PREV)
298 #define dtmost(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_PREV)
299 #define dtsearch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH)
300 #define dtmatch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_MATCH)
[all …]
|
| /titanic_41/usr/src/lib/libast/common/include/ |
| H A D | cdt.h | 70 { Dtsearch_f searchf; /* search function */ member
116 { Dtsearch_f searchf;/* search function */ member
293 #define dtfirst(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_FIRST)
294 #define dtnext(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_NEXT)
295 #define dtleast(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_NEXT)
296 #define dtlast(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_LAST)
297 #define dtprev(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_PREV)
298 #define dtmost(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_PREV)
299 #define dtsearch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH)
300 #define dtmatch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_MATCH)
[all …]
|
| /titanic_41/usr/src/lib/libast/sparcv9/include/ast/ |
| H A D | cdt.h | 70 { Dtsearch_f searchf; /* search function */ member
116 { Dtsearch_f searchf;/* search function */ member
293 #define dtfirst(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_FIRST)
294 #define dtnext(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_NEXT)
295 #define dtleast(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_NEXT)
296 #define dtlast(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_LAST)
297 #define dtprev(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_PREV)
298 #define dtmost(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_PREV)
299 #define dtsearch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH)
300 #define dtmatch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_MATCH)
[all …]
|
| /titanic_41/usr/src/lib/libast/i386/include/ast/ |
| H A D | cdt.h | 70 { Dtsearch_f searchf; /* search function */ member
116 { Dtsearch_f searchf;/* search function */ member
293 #define dtfirst(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_FIRST)
294 #define dtnext(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_NEXT)
295 #define dtleast(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_NEXT)
296 #define dtlast(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_LAST)
297 #define dtprev(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_PREV)
298 #define dtmost(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_PREV)
299 #define dtsearch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH)
300 #define dtmatch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_MATCH)
[all …]
|
| /titanic_41/usr/src/lib/libast/sparc/include/ast/ |
| H A D | cdt.h | 70 { Dtsearch_f searchf; /* search function */ member
116 { Dtsearch_f searchf;/* search function */ member
293 #define dtfirst(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_FIRST)
294 #define dtnext(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_NEXT)
295 #define dtleast(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_NEXT)
296 #define dtlast(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_LAST)
297 #define dtprev(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_PREV)
298 #define dtmost(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH|DT_PREV)
299 #define dtsearch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH)
300 #define dtmatch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_MATCH)
[all …]
|
| /titanic_41/usr/src/lib/libast/common/vmalloc/ |
| H A D | vmprivate.c | 39 static Block_t* vmextend(reg Vmalloc_t* vm, size_t size, Vmsearch_f searchf ) in vmextend() argument
41 static Block_t* vmextend(vm, size, searchf ) in vmextend()
44 Vmsearch_f searchf; /* tree search function */
129 { /**/ ASSERT(searchf);
133 else REMOVE(vd,bp,INDEX(SIZE(bp)),t,(*searchf));
|