Lines Matching defs:entry
29 codebooks so that brute forcing each codebook entry isn't needed.
51 static int addtosearch(int entry,long **tempstack,long *tempcount,int add){
52 long *ptr=tempstack[entry];
53 long i=tempcount[entry];
58 tempstack[entry]=_ogg_realloc(tempstack[entry],
59 (tempcount[entry]+1)*sizeof(long));
61 tempstack[entry]=_ogg_malloc(sizeof(long));
64 tempstack[entry][tempcount[entry]++]=add;
277 entry, we can find the minimum and maximum possible errors
278 (relative to the entry) for any point that could appear in the
300 int entry=0;
301 for(i=dim-1;i>=0;i--)entry=entry*p->quantvals+p->pigeonmap[temptrack[i]];
324 totalstack+=addtosearch(entry,tempstack,tempcount,i);