HomeSort by relevance Sort by last modified time
    Searched refs:BitIdx (Results 1 - 11 of 11) sorted by null

  /prebuilts/clang/host/linux-x86/clang-4579689/prebuilt_include/llvm/lib/Fuzzer/
FuzzerValueBitMap.h 36 uintptr_t BitIdx = Idx % kBitsInWord;
38 uintptr_t New = Old | (1UL << BitIdx);
51 uintptr_t BitIdx = Idx % kBitsInWord;
52 return Map[WordIdx] & (1UL << BitIdx);
  /prebuilts/clang/host/linux-x86/clang-4630689/prebuilt_include/llvm/lib/Fuzzer/
FuzzerValueBitMap.h 36 uintptr_t BitIdx = Idx % kBitsInWord;
38 uintptr_t New = Old | (1UL << BitIdx);
51 uintptr_t BitIdx = Idx % kBitsInWord;
52 return Map[WordIdx] & (1UL << BitIdx);
  /prebuilts/clang/host/linux-x86/clang-4639204/prebuilt_include/llvm/lib/Fuzzer/
FuzzerValueBitMap.h 36 uintptr_t BitIdx = Idx % kBitsInWord;
38 uintptr_t New = Old | (1UL << BitIdx);
51 uintptr_t BitIdx = Idx % kBitsInWord;
52 return Map[WordIdx] & (1UL << BitIdx);
  /prebuilts/clang/host/linux-x86/clang-4691093/prebuilt_include/llvm/lib/Fuzzer/
FuzzerValueBitMap.h 36 uintptr_t BitIdx = Idx % kBitsInWord;
38 uintptr_t New = Old | (1UL << BitIdx);
51 uintptr_t BitIdx = Idx % kBitsInWord;
52 return Map[WordIdx] & (1UL << BitIdx);
  /prebuilts/clang/host/linux-x86/clang-3859424/prebuilt_include/llvm/lib/Fuzzer/
FuzzerValueBitMap.h 35 uintptr_t BitIdx = Idx % kBitsInWord;
37 uintptr_t New = Old | (1UL << BitIdx);
45 uintptr_t BitIdx = Idx % kBitsInWord;
46 return Map[WordIdx] & (1UL << BitIdx);
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/lib/Fuzzer/
FuzzerValueBitMap.h 36 uintptr_t BitIdx = Idx % kBitsInWord;
38 uintptr_t New = Old | (1UL << BitIdx);
51 uintptr_t BitIdx = Idx % kBitsInWord;
52 return Map[WordIdx] & (1UL << BitIdx);
  /prebuilts/clang/host/linux-x86/clang-4393122/prebuilt_include/llvm/lib/Fuzzer/
FuzzerValueBitMap.h 36 uintptr_t BitIdx = Idx % kBitsInWord;
38 uintptr_t New = Old | (1UL << BitIdx);
51 uintptr_t BitIdx = Idx % kBitsInWord;
52 return Map[WordIdx] & (1UL << BitIdx);
  /prebuilts/clang/host/linux-x86/clang-4479392/prebuilt_include/llvm/lib/Fuzzer/
FuzzerValueBitMap.h 36 uintptr_t BitIdx = Idx % kBitsInWord;
38 uintptr_t New = Old | (1UL << BitIdx);
51 uintptr_t BitIdx = Idx % kBitsInWord;
52 return Map[WordIdx] & (1UL << BitIdx);
  /external/compiler-rt/lib/esan/
working_set.cpp 121 // It does *not* clear for BitIdx==TotalWorkingSetBitIdx, as that top bit
123 static u32 countAndClearShadowValues(u32 BitIdx, uptr ShadowStart,
126 u32 ByteValue = 0x1 << BitIdx;
131 bool Accum = getFlags()->record_snapshots && BitIdx < MaxAccumBitIdx;
133 bool Clear = BitIdx < TotalWorkingSetBitIdx;
156 // i.e., the number of non-zero bits indexed by BitIdx in each shadow byte.
158 // We do *not* clear for BitIdx==TotalWorkingSetBitIdx, as that top bit
160 static u32 computeWorkingSizeAndReset(u32 BitIdx) {
171 WorkingSetSize += countAndClearShadowValues(BitIdx, Start, End);
180 u32 BitIdx = CurWorkingSetBitIdx
    [all...]
  /external/llvm/lib/Fuzzer/
FuzzerTracePC.cpp 24 uintptr_t BitIdx = Idx % kBitsInWord;
25 Map[WordIdx] |= 1UL << BitIdx;
  /external/llvm/lib/Target/X86/
X86ISelLowering.cpp     [all...]

Completed in 448 milliseconds