Lines Matching refs:integerPartWidth
2294 static_assert(integerPartWidth % 2 == 0, "Part width must be divisible by 2!");
2304 assert(bits != 0 && bits <= integerPartWidth);
2306 return ~(integerPart) 0 >> (integerPartWidth - bits);
2313 return part & lowBitMask(integerPartWidth / 2);
2320 return part >> (integerPartWidth / 2);
2381 return (parts[bit / integerPartWidth] &
2382 ((integerPart) 1 << bit % integerPartWidth)) != 0;
2389 parts[bit / integerPartWidth] |= (integerPart) 1 << (bit % integerPartWidth);
2396 parts[bit / integerPartWidth] &=
2397 ~((integerPart) 1 << (bit % integerPartWidth));
2411 return lsb + i * integerPartWidth;
2431 return msb + n * integerPartWidth;
2448 dstParts = (srcBits + integerPartWidth - 1) / integerPartWidth;
2451 firstSrcPart = srcLSB / integerPartWidth;
2454 shift = srcLSB % integerPartWidth;
2457 /* We now have (dstParts * integerPartWidth - shift) bits from SRC
2460 n = dstParts * integerPartWidth - shift;
2464 << n % integerPartWidth);
2466 if (srcBits % integerPartWidth)
2467 dst[dstParts - 1] &= lowBitMask (srcBits % integerPartWidth);
2581 mid <<= integerPartWidth / 2;
2588 mid <<= integerPartWidth / 2;
2708 shiftCount = parts * integerPartWidth - shiftCount;
2709 n = shiftCount / integerPartWidth;
2710 mask = (integerPart) 1 << (shiftCount % integerPartWidth);
2733 mask = (integerPart) 1 << (integerPartWidth - 1);
2750 jump = count / integerPartWidth;
2751 shift = count % integerPartWidth;
2764 part |= dst[parts - jump - 1] >> (integerPartWidth - shift);
2784 jump = count / integerPartWidth;
2785 shift = count % integerPartWidth;
2799 part |= dst[i + jump + 1] << (integerPartWidth - shift);
2903 while (bits > integerPartWidth) {
2905 bits -= integerPartWidth;
2909 dst[i++] = ~(integerPart) 0 >> (integerPartWidth - bits);
