Searched refs:searchf (Results 1 - 17 of 17) sorted by relevance

/ast/src/lib/libast/cdt/
H A Ddtcomp.c35 return (Dtlink_t*)(*(_DT(d)->searchf))((d),(Void_t*)(0),DT_FLATTEN);
41 return (Dtlink_t*)(*(_DT(d)->searchf))((d),(Void_t*)(0),DT_EXTRACT);
47 return (Dtlink_t*)(*(_DT(d)->searchf))((d),(l),DT_RESTORE);
53 return (ssize_t)(*(_DT(d)->searchf))((d),(Void_t*)(0),DT_STAT);
59 return (ssize_t)(*(_DT(d)->searchf))((d),(Void_t*)(0),DT_STAT);
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)
[all...]
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
[all...]
H A Ddtclose.c55 { (void)(*(dt->meth->searchf))(dt,NIL(Void_t*),DT_CLEAR);
H A Ddtopen.c59 pdt.searchf = meth->searchf;
H A Ddthash.c215 if((*dt->meth->searchf)(dt, (Void_t*)l, DT_RELINK) == obj)
H A Ddttree.c179 if((*dt->meth->searchf)(dt, (Void_t*)r, DT_RELINK) == obj )
/ast/src/cmd/mailx/port/
H A Ddtview.c90 return (*(dt->meth->searchf))(dt,obj,type);
97 { if((o = (*(d->meth->searchf))(d,obj,type)) )
111 for(d = dt->walk, o = (*(d->meth->searchf))(d,obj,type); ; )
118 if((*(p->meth->searchf))(p,o,DT_SEARCH) )
122 o = (*(d->meth->searchf))(d,o,type);
129 o = (*(d->meth->searchf))(d,NIL(Void_t*),DT_FIRST);
131 o = (*(d->meth->searchf))(d,NIL(Void_t*),DT_LAST);
158 { dt->searchf = dt->meth->searchf;
171 dt->searchf
[all...]
H A Ddtmethod.c86 reg Dtsearch_f searchf; local
118 searchf = meth->searchf;
119 if(dt->searchf == oldmeth->searchf)
120 dt->searchf = searchf;
145 (void)(*searchf)(dt,(Void_t*)list,DT_RENEW);
H A Ddtopen.c96 dt->searchf = NIL(Dtsearch_f);
128 dt->searchf = meth->searchf;
H A Ddtrestore.c87 reg Dtsearch_f searchf = dt->meth->searchf; local
118 (*searchf)(dt,(Void_t*)list,DT_RENEW);
H A Dcdt.h197 { Dtsearch_f searchf; /* search function */ member in struct:_dtmethod_s
228 { Dtsearch_f searchf;/* searching function */ member in struct:_dt_s
318 #define dtfirst(d) (*(_DT_(d)->searchf))((d),NIL(Void_t*),DT_FIRST)
319 #define dtnext(d,o) (*(_DT_(d)->searchf))((d),(Void_t*)(o),DT_NEXT)
320 #define dtlast(d) (*(_DT_(d)->searchf))((d),NIL(Void_t*),DT_LAST)
321 #define dtprev(d,o) (*(_DT_(d)->searchf))((d),(Void_t*)(o),DT_PREV)
322 #define dtsearch(d,o) (*(_DT_(d)->searchf))((d),(Void_t*)(o),DT_SEARCH)
323 #define dtinsert(d,o) (*(_DT_(d)->searchf))((d),(Void_t*)(o),DT_INSERT)
324 #define dtdelete(d,o) (*(_DT_(d)->searchf))((d),(Void_t*)(o),DT_DELETE)
325 #define dtmatch(d,o) (*(_DT_(d)->searchf))((
[all...]
H A Ddtdisc.c105 reg Dtsearch_f searchf; local
121 searchf = dt->meth->searchf;
160 (void)(*searchf)(dt,(Void_t*)root,DT_RENEW);
173 (void)(*searchf)(dt,(Void_t*)root,DT_RENEW);
182 (void)(*searchf)(dt,(Void_t*)root,DT_RENEW);
H A Ddtclose.c93 (void)(*(dt->meth->searchf))(dt,NIL(Void_t*),DT_CLEAR);
H A Ddtrenew.c148 return (*dt->meth->searchf)(dt,(Void_t*)e,DT_RENEW) ? obj : NIL(Void_t*);
/ast/src/lib/libast/include/
H A Dcdt.h110 { Dtsearch_f searchf; /* search function */ member in struct:_dtmethod_s
144 { Dtsearch_f searchf;/* search function */ member in struct:_dt_s
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))((
[all...]
/ast/src/lib/libast/vmalloc/
H A Dvmprivate.c40 static Block_t* _vmextend(reg Vmalloc_t* vm, size_t size, Vmsearch_f searchf )
42 static Block_t* _vmextend(vm, size, searchf )
45 Vmsearch_f searchf; /* tree search function */
103 { /**/ ASSERT(searchf);
107 else REMOVE(vd,bp,INDEX(SIZE(bp)),tp,(*searchf));

Completed in 24 milliseconds