Home
last modified time | relevance | path

Searched refs:searchf (Results 1 – 9 of 9) sorted by relevance

/illumos-gate/usr/src/contrib/ast/src/lib/libast/cdt/
H A Ddtmethod.c52 if(dt->searchf == oldmt->searchf) /* ie, not viewpathing */
53 dt->searchf = meth->searchf;
61 if(dt->searchf == meth->searchf)
62 dt->searchf = oldmt->searchf;
68 if(dt->searchf == oldmt->searchf)
69 dt->searchf = meth->searchf;
H A Ddtview.c48 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)) )
104 for(d = dt->walk, obj = (*d->meth->searchf)(d, obj, type);; )
109 if((*(p->meth->searchf))(p, obj, DT_SEARCH) )
112 obj = (*d->meth->searchf)(d, obj, type);
118 obj = (*(d->meth->searchf))(d,NIL(Void_t*),DT_FIRST);
119 else obj = (*(d->meth->searchf))(d,NIL(Void_t*),DT_LAST);
147 { dt->searchf = dt->meth->searchf;
[all …]
H A Ddtcomp.c35 return (Dtlink_t*)(*(_DT(d)->searchf))((d),(Void_t*)(0),DT_FLATTEN); in dtflatten()
41 return (Dtlink_t*)(*(_DT(d)->searchf))((d),(Void_t*)(0),DT_EXTRACT); in dtextract()
47 return (Dtlink_t*)(*(_DT(d)->searchf))((d),(l),DT_RESTORE); in dtrestore()
53 return (ssize_t)(*(_DT(d)->searchf))((d),(Void_t*)(0),DT_STAT); in dtsize()
59 return (ssize_t)(*(_DT(d)->searchf))((d),(Void_t*)(0),DT_STAT); in dtstat()
H A Ddtopen.c59 pdt.searchf = meth->searchf;
H A Ddtclose.c55 { (void)(*(dt->meth->searchf))(dt,NIL(Void_t*),DT_CLEAR);
H A Ddthash.c215 if((*dt->meth->searchf)(dt, (Void_t*)l, DT_RELINK) == obj) in hlist()
H A Ddttree.c179 if((*dt->meth->searchf)(dt, (Void_t*)r, DT_RELINK) == obj )
/illumos-gate/usr/src/contrib/ast/src/lib/libast/include/
H A Dcdt.h110 { Dtsearch_f searchf; /* search function */ member
144 { Dtsearch_f searchf;/* search function */ member
328 #define dtfirst(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_FIRST)
329 #define dtnext(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_NEXT)
330 #define dtatleast(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_ATLEAST)
331 #define dtlast(d) (*(_DT(d)->searchf))((d),(Void_t*)(0),DT_LAST)
332 #define dtprev(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_PREV)
333 #define dtatmost(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_ATMOST)
334 #define dtsearch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_SEARCH)
335 #define dtmatch(d,o) (*(_DT(d)->searchf))((d),(Void_t*)(o),DT_MATCH)
[all …]
/illumos-gate/usr/src/contrib/ast/src/lib/libast/vmalloc/
H A Dvmprivate.c40 static Block_t* _vmextend(reg Vmalloc_t* vm, size_t size, Vmsearch_f searchf ) in _vmextend() argument
42 static Block_t* _vmextend(vm, size, searchf ) in _vmextend()
45 Vmsearch_f searchf; /* tree search function */
103 { /**/ ASSERT(searchf);
107 else REMOVE(vd,bp,INDEX(SIZE(bp)),tp,(*searchf));