Searched refs:k1 (Results 1 - 6 of 6) sorted by relevance

/ast/src/lib/libbz/
H A Dbzlib.c530 UChar k1; local
553 BZ_GET_FAST(k1); BZ_RAND_UPD_MASK;
554 k1 ^= BZ_RAND_MASK; s->nblock_used++;
556 if (k1 != s->k0) { s->k0 = k1; continue; };
559 BZ_GET_FAST(k1); BZ_RAND_UPD_MASK;
560 k1 ^= BZ_RAND_MASK; s->nblock_used++;
562 if (k1 != s->k0) { s->k0 = k1; continue; };
565 BZ_GET_FAST(k1); BZ_RAND_UPD_MAS
683 UChar k1; local
[all...]
/ast/src/cmd/mailx/port/
H A Ddthdr.h114 #define CMP(dt,k1,k2,d) (d->comparf ? (*d->comparf)(dt,k1,k2,d) : \
115 d->size <= 0 ? strcmp(k1,k2) : memcmp(k1,k2,d->size) )
/ast/src/lib/librecsort/
H A Drs-rasp.c297 #define CHARCMP(k1,k2,v,i) (v = (int)k1[i] - (int)k2[i])
298 #define STRNCMP(k1,k2,v,i,n) \
299 { if(CHARCMP(k1,k2,v,1) == 0) \
301 if(CHARCMP(k1,k2,v,i) != 0) \
316 reg uchar *k1, *k2; local
322 k1 = one->key; k2 = two->key;
323 STRNCMP(k1,k2,v,i,n);
327 k1 = one->key;
337 { STRNCMP(k1,k
[all...]
/ast/src/cmd/sort/
H A Dtestsort.sh253 for i in -k -k0 -k-1 -k1, -kb -k1,2u -t -o
276 ./ysort -k1,1 -f
297 if $SORT -k1,1 -f -k2,2 <in >out 2>/dev/null
299 opt="-k1,1 -f -k2,2 :"
612 ./xsort B -mudf -k1 || echo "(other behavior is legal, not classical)"
844 ./xsort "" -r -k1,1 -k2n
883 ./xsort "" -t: -k9 -k8 -k7 -k6 -k5 -k4 -k3 -k2 -k1
1166 $s ./xsort "" -s -k1,1
1186 $s $SORT -su -k1,
[all...]
/ast/src/lib/libast/include/
H A Dcdt.h313 #define _DTCMP(dt,k1,k2,dc) \
314 ((dc)->comparf ? (*(dc)->comparf)((dt), (k1), (k2), (dc)) : \
315 (dc)->size > 0 ? memcmp((Void_t*)(k1), ((Void_t*)k2), (dc)->size) : \
316 strcmp((char*)(k1), ((char*)k2)) )
/ast/src/cmd/std/
H A Dmount.c200 matchcmp(Dt_t* dt, void* k1, void* k2, Dtdisc_t* disc) argument
204 return strcasecmp((char*)k1, (char*)k2);

Completed in 19 milliseconds