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

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/libvorbis-1.2.3/lib/
H A Dsharedbook.c265 if(b->nearest_tree){
266 _ogg_free(b->nearest_tree->ptr0);
267 _ogg_free(b->nearest_tree->ptr1);
268 _ogg_free(b->nearest_tree->p);
269 _ogg_free(b->nearest_tree->q);
270 memset(b->nearest_tree,0,sizeof(*b->nearest_tree));
271 _ogg_free(b->nearest_tree);
462 encode_aux_nearestmatch *nt=book->c->nearest_tree;
H A Dcodebook.h57 struct encode_aux_nearestmatch *nearest_tree; member in struct:static_codebook
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/libvorbis-1.2.3/vq/
H A Dlocalcodebook.h57 struct encode_aux_nearestmatch *nearest_tree; member in struct:static_codebook
H A Dvqsplit.c164 encode_aux_nearestmatch *t=b->c->nearest_tree;
379 t=c->nearest_tree=_ogg_calloc(1,sizeof(encode_aux_nearestmatch));
H A Dbookutil.c215 c->nearest_tree=a=_ogg_calloc(1,sizeof(encode_aux_nearestmatch));
533 encode_aux_nearestmatch *n=c->nearest_tree;
H A Dlatticepare.c512 nt=b->c->nearest_tree=

Completed in 78 milliseconds