Searched refs:comparf (Results 1 - 25 of 37) sorted by relevance

12

/ast/src/lib/libast/string/
H A Dstrsearch.c32 * name in the (*comparf*)() sorted tab of num elements of
40 strsearch(const void* tab, size_t num, size_t siz, Strcmp_f comparf, const char* name, void* context) argument
50 if (!(v = context ? (*(Strcmp_context_f)comparf)(name, *((char**)mid), context) : (*comparf)(name, *((char**)mid))))
/ast/src/lib/libvcodex/
H A Dvcqsort.c36 void vcqsort(Void_t* list, ssize_t n, ssize_t size, Vccompare_f comparf, Void_t* disc) argument
42 Vccompare_f comparf; /* comparison function */
53 { if((*comparf)(base, base+size, disc) > 0)
59 { if((*comparf)(base, base + l*size, disc) >= 0)
69 vcqsort(base, l, size, comparf, disc);
72 vcqsort(base + r*size, n, size, comparf, disc);
/ast/src/lib/libast/comp/
H A Dtsearch.c68 int(* comparf)_ARG_((const Void_t*, const Void_t*)); member in struct:_treedisc_s
86 return (*((Treedisc_t*)disc)->comparf)((Void_t*)one,(Void_t*)two);
104 int(*comparf)(const Void_t*,const Void_t*) )
106 Void_t* tsearch(key, rootp, comparf)
109 int(* comparf)();
119 /* dangerous to set comparf on each call but that's tsearch */
120 Treedisc.comparf = comparf;
140 int(*comparf)(const Void_t*, const Void_t*) )
142 Void_t* tfind(key, rootp, comparf)
[all...]
/ast/src/lib/libast/misc/
H A Dftwalk.c35 int (*comparf)(Ftw_t*, Ftw_t*); member in struct:__anon282
45 return (*state.comparf)(*pf1, *pf2);
53 ftwalk(const char* path, int (*userf)(Ftw_t*), int flags, int (*comparf)(Ftw_t*, Ftw_t*)) argument
75 state.comparf = comparf;
76 if (!(f = fts_open((char* const*)path, flags, comparf ? ftscompare : 0)))
H A Dfts.c60 Compar_f comparf; /* node comparison func */ \
258 search(FTSENT* e, FTSENT* root, int(*comparf)(FTSENT* const*, FTSENT* const*), int insert)
270 if (!(cmp = (*comparf)(&e, &root)) && !insert)
278 if (root->left && (cmp = (*comparf)(&e, &root->left)) <= 0)
303 if (root->right && (cmp = (*comparf)(&e, &root->right)) >= 0)
685 * order fts->todo if fts->comparf != 0
698 root = search(f, root, fts->comparf, 1);
746 fts_open(char* const* pathnames, int flags, int (*comparf)(FTSENT* const*, FTSENT* const*))
754 fts->comparf = comparf;
[all...]
/ast/src/cmd/mailx/port/
H A Ddthdr.h114 #define CMP(dt,k1,k2,d) (d->comparf ? (*d->comparf)(dt,k1,k2,d) : \
H A Dcdt.h220 Dtcompar_f comparf;/* to compare two objects */ member in struct:_dtdisc_s
/ast/src/cmd/dsslib/ip_t/
H A Div-flat.c116 fl->dc.comparf = flatbldcmp;
218 fl->dc.comparf = flatsrchcmp;
239 fl->dc.comparf = flatsrchcmp;
H A Dptopen.c81 prefixdisc.comparf = (Dtcompar_f)byprefix;
H A Div-nested.c217 nst->dc.comparf = nestcmp;
H A Dptvopen.c96 p->dtdisc.comparf = (Dtcompar_f)byprefix;
/ast/src/lib/libast/include/
H A Dcdt.h124 Dtcompar_f comparf;/* to compare two objects */ member in struct:_dtdisc_s
133 (dc)->comparf = (cmpf), (dc)->hashf = (hshf), \
314 ((dc)->comparf ? (*(dc)->comparf)((dt), (k1), (k2), (dc)) : \
/ast/src/cmd/tests/cdt/
H A Dtstringset.c66 disc.comparf = 0; disc.hashf = 0;
H A Dtvthread.c80 dc->disc.comparf = mycompare;
H A Dtrehash.c239 Disc->disc.comparf = NIL(Dtcompar_f);
H A Dtsafehash.c239 Disc->disc.comparf = NIL(Dtcompar_f);
H A Dtsafetree.c241 Disc->disc.comparf = NIL(Dtcompar_f);
H A Dtvsafehash.c134 mmdc->disc.comparf = mmcompare;
H A Dtvsaferehash.c136 mmdc->disc.comparf = mmcompare;
H A Dtvsafetree.c133 mmdc->disc.comparf = mmcompare;
/ast/src/cmd/mailx/
H A Dlocal.c793 * name in the (*comparf*)() sorted tab of num elements of
801 strsearch(const void* tab, size_t num, size_t siz, Compare_f comparf, const char* name, void* context) argument
811 if (!(v = context ? (*(Compare_context_f)comparf)(name, *((char**)mid), context) : (*(Compare_f)comparf)(name, *((char**)mid))))
/ast/src/lib/libjcl/
H A Duniq.c215 state.uniqdisc.comparf = uniqcmp;
/ast/src/lib/libdss/
H A Dcxmap.c91 stricase2numdisc.comparf = ignorecase;
/ast/src/cmd/dsslib/merge/
H A Dmerge.c231 state->orderdisc.comparf = ordercmp;
/ast/src/cmd/std/
H A Dmount.c217 state.matchdisc.comparf = matchcmp;

Completed in 38 milliseconds

12