Lines Matching defs:entries
86 long *entryindex,long entries,
103 memset(entryA,0,sizeof(long)*entries);
104 memset(entryB,0,sizeof(long)*entries);
138 /* keep the entries in ascending order (relative to the original
140 for(j=0;j<entries;j++){
159 long *entryindex,long entries,
175 long *entryA=_ogg_calloc(entries,sizeof(long));
176 long *entryB=_ogg_calloc(entries,sizeof(long));
190 for(i=0;i<b->entries;i++)reventry[i]=-1;
191 for(i=0;i<entries;i++)reventry[entryindex[i]]=i;
199 if(entries<8 || (float)points*entries*entries<16.f*1024*1024){
203 for(i=0;i<entries-1;i++){
204 for(j=i+1;j<entries;j++){
205 spinnit(spinbuf,entries-i);
208 entryindex,entries,
240 spinnit(spinbuf,entries);
243 for(j=0;j<entries;j++)
245 p[k]/=entries;
249 /* we go through the entries one by one, looking for the entry on
253 for(i=0;i<entries;i++){
258 spinnit(spinbuf,entries-i);
263 for(j=0;j<entries;j++){
275 entryindex,entries,
309 entryindex,entries,
316 entries,depth,entriesA-entriesC,entriesC,entriesB-entriesC);*/
382 /* make sure there are no duplicate entries and that every
385 for(i=0;i<v->entries;){
390 v->entries--;
391 memcpy(_now(v,i),_now(v,v->entries),sizeof(float)*v->elements);
392 memcpy(quantlist+i*v->elements,quantlist+v->entries*v->elements,
401 v->assigned=_ogg_calloc(v->entries,sizeof(long));
409 for(j=0;j<v->entries;j++){
420 for(j=0;j<v->entries;){
423 v->entries--;
424 memcpy(_now(v,j),_now(v,v->entries),sizeof(float)*v->elements);
426 memcpy(quantlist+j*v->elements,quantlist+v->entries*v->elements,
434 fprintf(stderr,"Building a book with %ld unique entries...\n",v->entries);
437 long *entryindex=_ogg_malloc(v->entries*sizeof(long *));
440 long *reventry=_ogg_malloc(v->entries*sizeof(long));
443 for(i=0;i<v->entries;i++)entryindex[i]=i;
453 c->entries=v->entries;
454 c->lengthlist=_ogg_calloc(c->entries,sizeof(long));
457 b->entries=c->entries;
467 for(j=1;j<v->entries;j++){
482 b,entryindex,v->entries,
547 long *probability=_ogg_malloc(c->entries*sizeof(long));
548 for(i=0;i<c->entries;i++)probability[i]=1; /* trivial guard */
565 build_tree_from_lengths(c->entries,probability,c->lengthlist);
570 /* Sort the entries by codeword length, short to long (eases
574 long *index=_ogg_malloc(c->entries*sizeof(long));
575 long *revindex=_ogg_malloc(c->entries*sizeof(long));
577 for(i=0;i<c->entries;i++)index[i]=i;
579 qsort(index,c->entries,sizeof(long),iascsort);
583 for(i=0;i<c->entries;i++)revindex[index[i]]=i;
595 c->lengthlist=_ogg_calloc(c->entries,sizeof(long));
596 b->valuelist=_ogg_malloc(sizeof(float)*c->entries*c->dim);
597 c->quantlist=_ogg_malloc(sizeof(long)*c->entries*c->dim);
598 for(i=0;i<c->entries;i++){