HomeSort by: relevance | last modified time | path
    Searched refs:BitNum (Results 1 - 3 of 3) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
PackedVector.h 22 template <typename T, unsigned BitNum, typename BitVectorTy, bool isSigned>
27 template <typename T, unsigned BitNum, typename BitVectorTy>
28 class PackedVectorBase<T, BitNum, BitVectorTy, false> {
32 for (unsigned i = 0; i != BitNum; ++i)
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
38 assert((val >> BitNum) == 0 && "value is too big");
39 for (unsigned i = 0; i != BitNum; ++i)
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
44 template <typename T, unsigned BitNum, typename BitVectorTy>
45 class PackedVectorBase<T, BitNum, BitVectorTy, true>
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonBitTracker.cpp 1063 uint16_t BitNum;
1109 BitNum = 8;
1123 BitNum = 8;
1137 BitNum = 16;
1151 BitNum = 16;
1167 BitNum = 32;
1182 BitNum = 64;
1192 assert(W >= BitNum && BitNum > 0);
1195 for (uint16_t i = 0; i < BitNum; ++i
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/AsmParser/
MipsAsmParser.cpp 2683 unsigned BitNum = findFirstSet(x);
2685 return (x == x >> BitNum << BitNum) && isUInt<N>(x >> BitNum);
2839 for (int BitNum = 16; BitNum >= 0; BitNum -= 16) {
2840 uint16_t ImmChunk = (ImmValue >> BitNum) & 0xffff;

Completed in 24 milliseconds