Lines Matching refs:integerPartWidth
2274 COMPILE_TIME_ASSERT(integerPartWidth % 2 == 0);
2284 assert(bits != 0 && bits <= integerPartWidth);
2286 return ~(integerPart) 0 >> (integerPartWidth - bits);
2293 return part & lowBitMask(integerPartWidth / 2);
2300 return part >> (integerPartWidth / 2);
2361 return (parts[bit / integerPartWidth] &
2362 ((integerPart) 1 << bit % integerPartWidth)) != 0;
2369 parts[bit / integerPartWidth] |= (integerPart) 1 << (bit % integerPartWidth);
2376 parts[bit / integerPartWidth] &=
2377 ~((integerPart) 1 << (bit % integerPartWidth));
2391 return lsb + i * integerPartWidth;
2411 return msb + n * integerPartWidth;
2428 dstParts = (srcBits + integerPartWidth - 1) / integerPartWidth;
2431 firstSrcPart = srcLSB / integerPartWidth;
2434 shift = srcLSB % integerPartWidth;
2437 /* We now have (dstParts * integerPartWidth - shift) bits from SRC
2440 n = dstParts * integerPartWidth - shift;
2444 << n % integerPartWidth);
2446 if (srcBits % integerPartWidth)
2447 dst[dstParts - 1] &= lowBitMask (srcBits % integerPartWidth);
2561 mid <<= integerPartWidth / 2;
2568 mid <<= integerPartWidth / 2;
2688 shiftCount = parts * integerPartWidth - shiftCount;
2689 n = shiftCount / integerPartWidth;
2690 mask = (integerPart) 1 << (shiftCount % integerPartWidth);
2713 mask = (integerPart) 1 << (integerPartWidth - 1), n--;
2728 jump = count / integerPartWidth;
2729 shift = count % integerPartWidth;
2742 part |= dst[parts - jump - 1] >> (integerPartWidth - shift);
2762 jump = count / integerPartWidth;
2763 shift = count % integerPartWidth;
2777 part |= dst[i + jump + 1] << (integerPartWidth - shift);
2881 while (bits > integerPartWidth) {
2883 bits -= integerPartWidth;
2887 dst[i++] = ~(integerPart) 0 >> (integerPartWidth - bits);
