Searched refs:mtch (Results 1 - 5 of 5) sorted by relevance
/ast/src/lib/libvcodex/ |
H A D | vclzparse.c | 33 Vclzmatch_t mtch[MAXPAIR]; /* storage for pairs */ member in struct:_pair_s 35 #define NEXTPAIR(pr) ((pr)->size < MAXPAIR-1 ? ((pr)->mtch + (pr)->size++) : NIL(Vclzmatch_t*)) 135 Vclzmatch_t *mt = pr->mtch + pr->size - 1; 192 done: mt = pr->mtch+pr->size-1; 193 return (mt->tpos + mt->size) - pr->mtch->tpos; 306 { fpair.mtch[n].tpos = add - hs->src; 307 fpair.mtch[n].mpos = -1; 308 fpair.mtch[n].size = obj - add; 311 fpair.mtch[n].tpos = obj - hs->src; 312 fpair.mtch[ 580 { Vclzmatch_t mtch; local [all...] |
/ast/src/lib/libvcodex/Vcdelta/ |
H A D | vcdelta.c | 190 static ssize_t vcdputinst(Vclzparse_t* vcpa, int type, Vclzmatch_t* mtch, ssize_t n) argument 192 static ssize_t vcdputinst(vcpa, type, mtch, n) 195 Vclzmatch_t* mtch; /* list of matched fragments */ 204 if((m = mtch)->mpos < 0) 205 { PRINT(2, "add %6d ", mtch->size); 206 PRINT(2, "pos %6d\n", mtch->tpos - vcpa->nsrc); 211 PRINT(2, "cpy %6d ", mtch[n-1].tpos+mtch[n-1].size - m->tpos); 214 if((l = n - (m == mtch ? 0 : 1)) > 1 ) 220 for(len = 0, here = mtch [all...] |
/ast/src/lib/libvcodex/Vcwindow/ |
H A D | vcwngram.c | 57 double vcwngmatch(int* mtch, size_t* dfreq, size_t size, argument 60 double vcwngmatch(mtch, dfreq, size, data, dtsz, pos, stop) 61 int* mtch; /* to return the best match */ 171 done: *mtch = bestp;
|
H A D | vcwvote.c | 71 int mtch; local 86 if((dif = vcwngmatch(&mtch, dfreq, size, data, dtsz, 0, NGRAMMATCH)) < fr->bestd) 89 wm->wpos = l + mtch; 147 int mtch; local 180 dif = vcwngmatch(&mtch, dfreq, size, data, dtsz, 0, NGRAMMATCH); 184 wm->wpos = pos + mtch; 283 /**/DEBUG_PRINT(2,"mtch=%8d ",(ssize_t)wm->msize);
|
H A D | vcwprefix.c | 49 ssize_t mtch; /* number of matched bytes */ member in struct:_pfseg_s 229 seg->mtch += mn; 246 seg->mtch = mn; 454 /**/DEBUG_PRINT(2,"mtch=%8d ",(ssize_t)wm->msize);
|
Completed in 17 milliseconds