Lines Matching full:chase
162 long chase=0;
165 /* chase the tree as far as it's already populated, fill in past */
168 if(chase>=top){
169 if (chase < 0 || chase >= n) return 1;
171 r[chase*2]=top;
172 r[chase*2+1]=0;
174 if (chase < 0 || chase >= n || chase*2+bit > n*2+1) return 1;
175 if(!r[chase*2+bit])
176 r[chase*2+bit]=top;
177 chase=r[chase*2+bit];
178 if (chase < 0 || chase >= n) return 1;
182 if(chase>=top){
184 r[chase*2+1]=0;
186 r[chase*2+bit]= decpack(i,count++,quantvals,b,opb,maptype) |
624 ogg_uint32_t chase=0;
636 /* chase the tree with the bits we got */
646 chase=t[chase*2+((lok>>i)&1)];
647 if(chase&0x80UL)break;
649 chase&=0x7fUL;
659 int next=t[chase+bit];
661 chase= (next<<8) | t[chase+bit+1+(!bit || t[chase]&0x80)];
664 chase=next;
666 //chase&=0x7fffUL;
667 chase&=~0x8000UL;
675 chase=((ogg_uint16_t *)(book->dec_table))[chase*2+((lok>>i)&1)];
676 if(chase&0x8000UL)break;
678 //chase&=0x7fffUL;
679 chase&=~0x8000UL;
689 int next=t[chase+bit];
691 chase= (next<<16) | t[chase+bit+1+(!bit || t[chase]&0x8000)];
694 chase=next;
696 //chase&=0x7fffffffUL;
697 chase&=~0x80000000UL;
704 chase=((ogg_uint32_t *)(book->dec_table))[chase*2+((lok>>i)&1)];
705 if(chase&0x80000000UL)break;
707 //chase&=0x7fffffffUL;
708 chase&=~0x80000000UL;
715 return chase;
