Lines Matching defs:bit
454 /* convert code back to bit vector */
709 int bit; /* for looping through bits */
710 int limbit; /* upper bit limit when looping */
787 * - 2 bit code type, set to 01
788 * - 2 bit size field
801 for (bit = 0; bit < infop->numx; bit++) {
811 for (bit = 0; bit < infop->numx; bit++) {
812 if (bit % 4 == 0)
828 * code2dictval -- convert a diagcode back to a bit vector
840 int bit; /* for looping through bits */
841 int limbit; /* upper bit limit when looping */
851 /* convert code back to a bit vector */
896 for (bit = 0; bit < numx; bit++) {
1092 * private routines to manipulate bit vectors (i.e. large integers)
1094 * if these bit vector routines are ever supposed to be more
1103 /* data structure used to hold a bit vector */
1108 /* allocate a new, zeroed out bit vector */
1122 /* free a bit vector that was allocated with bitv_alloc() */
1129 /* shift left a bit vector by a given number of bits. fill with zeros. */
1191 /* given a bit vector and a number of bits, shift it in from the right */
1206 /* return the number of bits required to hold the current bit vector's value */
1214 int bit;
1216 for (bit = 7; bit >= 0; bit--)
1217 if ((bv->v[i] >> bit) & 1)
1218 return (i * 8 + bit + 1);
1227 /* extract chunks of bits from bit vector */
1232 int bit;
1240 for (bit = limbit - 1; bit >= 0 && bit >= lobit; bit--) {
1242 retval |= (bv->v[bit / 8] >> (bit % 8)) & 1;
1251 * on overflow, bit vector will hold least significant BITV_MAX_BYTES,
1253 * return is zero and bit vector holds the product.
1265 /* start with a zeroed out bit vector to hold result */
1303 * on overflow, bit vector will hold least significant BITV_MAX_BYTES,
1305 * return is zero and bit vector holds the sum.
1334 * on underflow, bit vector will hold least significant BITV_MAX_BYTES,
1336 * return is zero and bit vector holds the difference.
1394 /* parse a string into bit vector, honor leading 0/0x for octal/hex */
1448 /* return 0 if two bit vectors represent the same number */