| /external/llvm/test/Transforms/InstCombine/ |
| apint-add2.ll | 2 ; This test is for Integer BitWidth > 64 && BitWidth <= 1024.
|
| apint-and2.ll | 2 ; This test is for Integer BitWidth > 64 && BitWidth <= 1024.
|
| /frameworks/rs/driver/linkloader/include/ |
| ELFReloc.h | 27 template <unsigned Bitwidth>
30 ELF_TYPE_INTRO_TO_TEMPLATE_SCOPE(Bitwidth);
|
| ELFObject.h | 30 template <unsigned Bitwidth>
33 ELF_TYPE_INTRO_TO_TEMPLATE_SCOPE(Bitwidth);
|
| ELFSectionHeader.h | 30 template <unsigned Bitwidth>
33 ELF_TYPE_INTRO_TO_TEMPLATE_SCOPE(Bitwidth);
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| FunctionLoweringInfo.cpp | 245 FunctionLoweringInfo::GetLiveOutRegInfo(unsigned Reg, unsigned BitWidth) {
253 if (BitWidth > LOI->KnownZero.getBitWidth()) {
255 LOI->KnownZero = LOI->KnownZero.zextOrTrunc(BitWidth);
256 LOI->KnownOne = LOI->KnownOne.zextOrTrunc(BitWidth);
278 unsigned BitWidth = IntVT.getSizeInBits();
289 APInt Zero(BitWidth, 0);
296 APInt Val = CI->getValue().zextOrTrunc(BitWidth);
308 const LiveOutInfo *SrcLOI = GetLiveOutRegInfo(SrcReg, BitWidth);
316 assert(DestLOI.KnownZero.getBitWidth() == BitWidth &&
317 DestLOI.KnownOne.getBitWidth() == BitWidth &
[all...] |
| TargetLowering.cpp | 303 unsigned BitWidth,
319 unsigned DemandedSize = BitWidth - Demanded.countLeadingZeros();
323 for (; SmallVTBits < BitWidth; SmallVTBits = NextPowerOf2(SmallVTBits)) {
355 unsigned BitWidth = DemandedMask.getBitWidth();
356 assert(Op.getValueType().getScalarType().getSizeInBits() == BitWidth &&
362 KnownZero = KnownOne = APInt(BitWidth, 0);
374 NewMask = APInt::getAllOnesValue(BitWidth);
431 if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
465 if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
490 if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl)
[all...] |
| SelectionDAG.cpp | [all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| APSIntType.cpp | 31 if (MinBits <= BitWidth)
|
| BasicValueFactory.cpp | 95 const llvm::APSInt& BasicValueFactory::getValue(uint64_t X, unsigned BitWidth,
97 llvm::APSInt V(BitWidth, isUnsigned);
|
| /external/llvm/include/llvm/CodeGen/ |
| ValueTypes.h | 442 static MVT getFloatingPointVT(unsigned BitWidth) {
443 switch (BitWidth) {
459 static MVT getIntegerVT(unsigned BitWidth) {
460 switch (BitWidth) {
574 static EVT getFloatingPointVT(unsigned BitWidth) {
575 return MVT::getFloatingPointVT(BitWidth);
580 static EVT getIntegerVT(LLVMContext &Context, unsigned BitWidth) {
581 MVT M = MVT::getIntegerVT(BitWidth);
584 return getExtendedIntegerVT(Context, BitWidth);
598 /// integer type with the same bitwidth
[all...] |
| /external/grub/netboot/ |
| otulip.c | 112 const unsigned bitwidth = SROM_BITWIDTH; local
113 const unsigned cmdmask = (SROMCMD_RD << bitwidth);
114 const unsigned msb = 1 << (bitwidth + 3 - 1);
115 unsigned lastidx = (1 << bitwidth) - 1;
127 for (bits = idx|cmdmask, bit = bitwidth + 3; bit > 0; bit--, bits <<= 1)
|
| /external/llvm/lib/Transforms/Utils/ |
| BypassSlowDivision.cpp | 245 // Get bitwidth of div/rem instruction
247 unsigned int bitwidth = T->getBitWidth(); local
249 // Continue if bitwidth is not bypassed
250 DenseMap<unsigned int, unsigned int>::const_iterator BI = BypassWidths.find(bitwidth);
254 // Get type for div/rem instruction with bypass bitwidth
|
| IntegerDivision.cpp | 422 /// Generate code to compute the remainder of two integers of bitwidth up to
441 llvm_unreachable("Div of bitwidth greater than 32 not supported");
446 // If bitwidth smaller than 32 extend inputs, truncate output and proceed
475 /// Generate code to divide two integers of bitwidth up to 32 bits. Uses the
493 llvm_unreachable("Div of bitwidth greater than 32 not supported");
498 // If bitwidth smaller than 32 extend inputs, truncate output and proceed
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineCalls.cpp | 320 uint32_t BitWidth = IT->getBitWidth();
321 APInt KnownZero(BitWidth, 0);
322 APInt KnownOne(BitWidth, 0);
325 APInt Mask(APInt::getLowBitsSet(BitWidth, TrailingZeros));
328 APInt(BitWidth, TrailingZeros)));
338 uint32_t BitWidth = IT->getBitWidth();
339 APInt KnownZero(BitWidth, 0);
340 APInt KnownOne(BitWidth, 0);
343 APInt Mask(APInt::getHighBitsSet(BitWidth, LeadingZeros));
346 APInt(BitWidth, LeadingZeros)))
[all...] |
| InstCombineCasts.cpp | 371 uint32_t BitWidth = Ty->getScalarSizeInBits();
372 if (BitWidth < OrigBitWidth) {
373 APInt Mask = APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth);
386 uint32_t BitWidth = Ty->getScalarSizeInBits();
387 if (CI->getLimitedValue(BitWidth) < BitWidth)
397 uint32_t BitWidth = Ty->getScalarSizeInBits();
399 APInt::getHighBitsSet(OrigBitWidth, OrigBitWidth-BitWidth)) &&
400 CI->getLimitedValue(BitWidth) < BitWidth) {
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionAliasAnalysis.cpp | 128 unsigned BitWidth = SE->getTypeSizeInBits(AS->getType());
129 APInt ASizeInt(BitWidth, LocA.Size);
130 APInt BSizeInt(BitWidth, LocB.Size);
|
| /external/llvm/lib/ExecutionEngine/JIT/ |
| JIT.cpp | 458 unsigned BitWidth = cast<IntegerType>(RetTy)->getBitWidth();
459 if (BitWidth == 1)
460 rv.IntVal = APInt(BitWidth, ((bool(*)())(intptr_t)FPtr)());
461 else if (BitWidth <= 8)
462 rv.IntVal = APInt(BitWidth, ((char(*)())(intptr_t)FPtr)());
463 else if (BitWidth <= 16)
464 rv.IntVal = APInt(BitWidth, ((short(*)())(intptr_t)FPtr)());
465 else if (BitWidth <= 32)
466 rv.IntVal = APInt(BitWidth, ((int(*)())(intptr_t)FPtr)());
467 else if (BitWidth <= 64
[all...] |
| /external/llvm/lib/Support/ |
| StringRef.cpp | 416 unsigned BitWidth = Log2Radix * Str.size();
417 if (BitWidth < Result.getBitWidth())
418 BitWidth = Result.getBitWidth(); // don't shrink the result
419 else if (BitWidth > Result.getBitWidth())
420 Result = Result.zext(BitWidth);
425 RadixAP = APInt(BitWidth, Radix);
426 CharAP = APInt(BitWidth, 0);
|
| /external/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 252 /// CarmichaelShift - Returns k such that lambda(2^Bitwidth) = 2^k, where lambda
253 /// is the Carmichael function. This means that x^(2^k) === 1 mod 2^Bitwidth for
254 /// every odd x, i.e. x^(2^k) = 1 for every odd x in Bitwidth-bit arithmetic.
255 /// Note that 0 <= k < Bitwidth, and if Bitwidth > 3 then x^(2^k) = 0 for every
256 /// even x in Bitwidth-bit arithmetic.
257 static unsigned CarmichaelShift(unsigned Bitwidth) {
258 if (Bitwidth < 3)
259 return Bitwidth - 1;
260 return Bitwidth - 2
[all...] |
| /external/llvm/lib/Target/AArch64/InstPrinter/ |
| AArch64InstPrinter.cpp | 31 static int64_t unpackSignedImm(int BitWidth, uint64_t Value) {
32 assert(!(Value & ~((1ULL << BitWidth)-1)) && "immediate not n-bit");
33 if (Value & (1ULL << (BitWidth - 1)))
34 return static_cast<int64_t>(Value) - (1LL << BitWidth);
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| BasicValueFactory.h | 79 const llvm::APSInt& getValue(uint64_t X, unsigned BitWidth, bool isUnsigned);
102 /// but with the bitwidth and signedness of 'To'.
|
| /external/clang/test/Analysis/ |
| null-deref-ps.c | 218 // for 'x' should have a bitwidth of 8.
222 // x against 0 (with the same bitwidth).
|
| /external/clang/include/clang/AST/ |
| TemplateBase.h | 81 // BitWidth > 64. The memory may be shared between multiple
87 unsigned BitWidth : 31;
275 if (Integer.BitWidth <= 64)
276 return APSInt(APInt(Integer.BitWidth, Integer.VAL), Integer.IsUnsigned);
278 unsigned NumWords = APInt::getNumWords(Integer.BitWidth);
279 return APSInt(APInt(Integer.BitWidth, makeArrayRef(Integer.pVal, NumWords)),
|
| /external/llvm/lib/ExecutionEngine/ |
| ExecutionEngine.cpp | 568 uint32_t BitWidth = cast<IntegerType>(CE->getType())->getBitWidth();
569 GV.IntVal = GV.IntVal.trunc(BitWidth);
574 uint32_t BitWidth = cast<IntegerType>(CE->getType())->getBitWidth();
575 GV.IntVal = GV.IntVal.zext(BitWidth);
580 uint32_t BitWidth = cast<IntegerType>(CE->getType())->getBitWidth();
581 GV.IntVal = GV.IntVal.sext(BitWidth);
629 uint32_t BitWidth = cast<IntegerType>(CE->getType())->getBitWidth();
631 GV.IntVal = APIntOps::RoundFloatToAPInt(GV.FloatVal, BitWidth);
633 GV.IntVal = APIntOps::RoundDoubleToAPInt(GV.DoubleVal, BitWidth);
638 (void)apf.convertToInteger(&v, BitWidth,
[all...] |
