Searched defs:two (Results 1 - 14 of 14) sorted by relevance

/ast/src/cmd/vczip/tests/
H A Dtvcqsort.c26 int intcmp(Void_t* one, Void_t* two, Void_t* disc) argument
28 int i1 = *((int*)one), i2 = *((int*)two);
/ast/src/cmd/tests/sfio/
H A Dtseek.c47 Sfoff_t one, two; local
84 two = (Sfoff_t)lseek(sffileno(f), (off_t)0, 2);
85 if(one != two)
/ast/src/lib/libvcodex/Vchuff/
H A Dvchbits.c29 static int sizecmp(Void_t* one, Void_t* two, Void_t* disc) argument
31 static int sizecmp(one,two,disc)
33 Void_t* two;
38 ssize_t *o = *((ssize_t**)one), *t = *((ssize_t**)two);
H A Dvchsize.c42 static int huffcmp(Void_t* one, Void_t* two, Void_t* disc) argument
44 static int huffcmp(one, two, disc)
46 Void_t* two;
52 Vchtree_t *t = *((Vchtree_t**)two);
135 /* merge subtrees, ie, link the two circular lists */
H A Dvchtrie.c137 static int bitscmp(Void_t* one, Void_t* two, Void_t* disc) argument
139 static int bitscmp(one, two, disc)
141 Void_t* two;
145 Vcbit_t *o = *((Vcbit_t**)one), *t = *((Vcbit_t**)two);
H A Dvchuffgroup.c110 static int objcmp(Void_t* one, Void_t* two, Void_t* hdl) argument
112 static int objcmp(one, two, hdl)
114 Void_t* two;
120 Obj_t *o2 = (Obj_t*)two;
196 static int partcmp(Void_t* one, Void_t* two, Void_t* disc) argument
198 static int partcmp(one, two, disc)
200 Void_t* two;
208 q = *((size_t*)two); n = grp->ppos[q+1] - grp->ppos[q]; q = grp->ppos[q];
282 /* split blocks of table p into two tables, p and q */
/ast/src/lib/libast/comp/
H A Dtsearch.c77 static int treecompare(Dt_t* dt, char* one, char* two, Dtdisc_t* disc) argument
79 static int treecompare(dt, one, two, disc)
82 char* two;
86 return (*((Treedisc_t*)disc)->comparf)((Void_t*)one,(Void_t*)two);
/ast/src/lib/libvgraph/
H A Dgraph.c9 static int nodecmp(Dt_t* nodes, Void_t* one, Void_t* two, Dtdisc_t* disc) argument
12 Grnode_t *n2 = (Grnode_t*)two;
38 static int edgecmp(Dt_t* edges, Void_t* one, Void_t* two, Dtdisc_t* disc) argument
41 Gredge_t *e2 = (Gredge_t*)two;
/ast/src/lib/librecsort/
H A Drs-rasp.c42 #define SPLAYCMP(one,two,o,t,endo,mp,cr) \
43 { if(one->order != two->order) \
44 cr = one->order < two->order ? -1 : 1; \
46 { if((mp = (cr = one->keylen) - two->keylen) > 0) cr -= mp; \
47 o = one->key+PREFIX; t = two->key+PREFIX; \
307 static Rsobj_t* listmerge(reg Rsobj_t* one, reg Rsobj_t* two, reg int n) argument
309 static Rsobj_t* listmerge(one, two, n)
311 reg Rsobj_t* two;
320 endtwo = two->left; two
[all...]
H A Drsmerge.c445 /* compare two records. RS_REVERSE is taken care of here too. */
446 #define MGCOMPARE(rs,one,two,reverse) \
447 ((one)->order == (two)->order ? mgcompare(rs,one,two,reverse) : \
448 (one)->order < (two)->order ? (reverse ? 1 : -1) : (reverse ? -1 : 1) )
465 static int mgcompare(Rs_t* rs, Rsobj_t* one, Rsobj_t* two, int reverse) argument
467 static int mgcompare(rs, one, two, reverse)
470 reg Rsobj_t* two;
478 o = one->key+SIZEOF_LONG; t = two->key+SIZEOF_LONG;
479 if((d = (l = one->keylen) - two
[all...]
/ast/src/lib/libvcodex/Vcwindow/
H A Dvcwfile.c36 /* distance between two signatures */
39 /* the below criterion for accepting the closeness of two signatures is based
48 static int sigcmp(Void_t* one, Void_t* two, Void_t* disc) argument
50 static int sigcmp(one, two, disc)
52 Void_t* two;
56 Grint_t **t = (Grint_t**)two;
62 static int votecmp(Void_t* one, Void_t* two, Void_t* disc) argument
64 static int votecmp(one, two, disc)
66 Void_t* two;
70 Cand_t *t = (Cand_t*)two;
76 idxcmp(Void_t* one, Void_t* two, Void_t* disc) argument
[all...]
/ast/src/lib/libast/vmalloc/
H A Dvmprofile.c256 reg Pfobj_t *one, *two, *next; local
262 /* partition to two equal size lists */
263 one = two = NIL(Pfobj_t*);
271 pf->next = two;
272 two = pf;
279 two = pfsort(two);
282 if(PFLINE(one) == 0 && PFLINE(two) == 0)
283 cmp = PFVM(one) > PFVM(two) ? 1 : -1;
286 else if(PFLINE(two)
[all...]
/ast/src/lib/libast/uwin/
H A Derf.c171 two = 2.0, variable
369 return (two-tiny);
400 return two-r;
/ast/src/lib/libvcodex/
H A Dvcsfxsort.c43 #define SWAP(x,y,t) ((t) = (x), (x) = (y), (y) = (t)) /* swap two scalars */
70 static int intcmp(void* one, void* two, void* disc) argument
71 { return (int)(*((Vcsfxint_t*)one) - *((Vcsfxint_t*)two));
127 /* bucket sort by first two bytes. */
169 #if __STD_C /* swap two adjacent lists of integers */

Completed in 66 milliseconds