Lines Matching defs:bit
98 /* 32 bit float (not IEEE; nonnormalized mantissa +
167 int bit=(entry>>(length-j-1))&1;
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];
181 int bit=(entry>>(length-j-1))&1;
186 r[chase*2+bit]= decpack(i,count++,quantvals,b,opb,maptype) |
240 * This probably wastes a bit of space, but it shouldn't
497 /* this is the correct boundary here; we lose one bit to
514 long total1=(s->q_bits*s->dim+8)/8; /* remember flag bit */
516 /* vector of column offsets; remember flag bit */
580 bit */
678 int bit=(lok>>i)&1;
679 int next=t[chase+bit];
681 chase= (next<<8) | t[chase+bit+1+(!bit || t[chase]&0x80)];
708 int bit=(lok>>i)&1;
709 int next=t[chase+bit];
711 chase= (next<<16) | t[chase+bit+1+(!bit || t[chase]&0x8000)];
