HomeSort by: relevance | last modified time | path
    Searched refs:isPowerOf2 (Results 1 - 25 of 66) sorted by relevancy

1 2 3

  /src/external/gpl3/gcc.old/dist/libphobos/src/std/math/
traits.d 722 bool isPowerOf2(X)(const X x) pure @safe nothrow @nogc
753 assert( isPowerOf2(1.0L));
754 assert( isPowerOf2(2.0L));
755 assert( isPowerOf2(0.5L));
756 assert( isPowerOf2(pow(2.0L, 96)));
757 assert( isPowerOf2(pow(2.0L, -77)));
759 assert(!isPowerOf2(-2.0L));
760 assert(!isPowerOf2(-0.5L));
761 assert(!isPowerOf2(0.0L));
762 assert(!isPowerOf2(4.315))
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
CmpInstAnalysis.cpp 108 if (!C->isPowerOf2())
115 if (!(*C + 1).isPowerOf2())
122 if (!(*C + 1).isPowerOf2())
129 if (!C->isPowerOf2())
TargetTransformInfo.cpp 664 if (CI->getValue().isPowerOf2())
685 if (CI->getValue().isPowerOf2())
691 if (CI->getValue().isPowerOf2())
Loads.cpp 38 assert(APAlign.isPowerOf2() && "must be a power of 2!");
  /src/external/apache2/llvm/dist/clang/include/clang/Basic/
Sanitizers.h 75 bool isPowerOf2() const {
155 assert(K.isPowerOf2() && "Has to be a single sanitizer.");
164 assert(K.isPowerOf2() && "Has to be a single sanitizer.");
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/
common.d 120 import std.math.traits : isPowerOf2;
121 assert(alignment.isPowerOf2);
145 import std.math.traits : isPowerOf2;
146 assert(alignment.isPowerOf2);
308 import std.math.traits : isPowerOf2;
309 assert(alignment.isPowerOf2);
320 import std.math.traits : isPowerOf2;
321 assert(alignment.isPowerOf2);
329 import std.math.traits : isPowerOf2;
330 return x.isPowerOf2;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/GISel/
AArch64PostLegalizerCombiner.cpp 182 if (SCVMinus1.isPowerOf2()) {
185 } else if (CVPlus1.isPowerOf2()) {
195 if (CVNegPlus1.isPowerOf2()) {
199 } else if (CVNegMinus1.isPowerOf2()) {
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/building_blocks/
aligned_block_list.d 360 import std.math.traits : isPowerOf2;
361 static assert(isPowerOf2(alignment));
520 import std.math.traits : isPowerOf2;
521 static assert(isPowerOf2(alignment));
region.d 191 import std.math.traits : isPowerOf2;
192 assert(a.isPowerOf2);
1187 import std.math.traits : isPowerOf2;
1189 assert(a.isPowerOf2);
affix_allocator.d 31 import std.math.traits : isPowerOf2;
50 enum uint alignment = isPowerOf2(stateSize!Prefix)
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
SwiftCallingConv.cpp 26 static bool isPowerOf2(unsigned n) {
422 assert(isPowerOf2(unitSize.getQuantity()));
664 if (!isPowerOf2(size)) {
712 if (numElts >= 4 && isPowerOf2(numElts)) {
776 if (numElts > 2 && !isPowerOf2(numElts) &&
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineCompares.cpp 1158 if (AP1.isAllOnesValue() && !AP2.isPowerOf2())
1233 if (!CI2->getValue().isPowerOf2())
1615 if (*XorC == ~C && (C + 1).isPowerOf2())
1618 if (*XorC == C && (C + 1).isPowerOf2())
1623 if (*XorC == -C && C.isPowerOf2())
1627 if (*XorC == C && (-C).isPowerOf2())
1753 if ((~(*C2) + 1).isPowerOf2()) {
1856 if (Cmp.getOperand(1) == Y && (-C).isPowerOf2()) {
1898 if (*MaskC == C && (C + 1).isPowerOf2()) {
1993 bool CIsPowerOf2 = C.isPowerOf2();
    [all...]
InstCombineAndOrXor.cpp 192 bool IsAPow2 = (ACst && !ACst->isZero() && ACst->getValue().isPowerOf2());
193 bool IsBPow2 = (BCst && !BCst->isZero() && BCst->getValue().isPowerOf2());
454 (BCst->getValue() & (BCst->getValue() ^ DCst->getValue())).isPowerOf2()) {
769 if (Xor.isPowerOf2()) {
898 assert(HighestBit.isPowerOf2() && "expected to be power of two (non-zero)");
950 if (!OtherHighestBit.isPowerOf2())
1280 if ((PredL == ICmpInst::ICMP_ULT && LHSC->getValue().isPowerOf2()) ||
1893 if (Op0->hasOneUse() && C->isPowerOf2() && (*AddC & (*C - 1)) == 0) {
2403 if (DiffC.isPowerOf2()) {
2419 if (LowRangeDiff.isPowerOf2() && LowRangeDiff == HighRangeDiff &
    [all...]
InstCombineAddSub.cpp 953 if (C->isPowerOf2())
955 else if (C2->isPowerOf2())
1031 if (match(E, m_And(m_Value(Op), m_APInt(AI))) && (*AI + 1).isPowerOf2()) {
InstCombineCasts.cpp 975 if ((Op1CV->isNullValue() || Op1CV->isPowerOf2()) &&
982 if (KnownZeroMask.isPowerOf2()) { // Exactly 1 possible 1?
1348 ICI->isEquality() && (Op1C->isZero() || Op1C->getValue().isPowerOf2())){
1352 if (KnownZeroMask.isPowerOf2()) {
InstCombineSelect.cpp 154 if (!AndMask.isPowerOf2())
200 if (!TC.isPowerOf2() && !FC.isPowerOf2())
2206 if (!(*MaxValue + 1).isPowerOf2() || -*MinValue != *MaxValue + 1)
  /src/external/apache2/llvm/dist/llvm/lib/Support/
KnownBits.cpp 536 if (RHS.isConstant() && RHS.getConstant().isPowerOf2()) {
557 if (RHS.isConstant() && RHS.getConstant().isPowerOf2()) {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
Utils.cpp 690 return CI->getValue().zextOrTrunc(BitWidth).isPowerOf2();
728 if (!Const || !Const->zextOrTrunc(BitWidth).isPowerOf2())
  /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/
SystemZTargetTransformInfo.cpp 427 (CVal->getValue().isPowerOf2() || (-CVal->getValue()).isPowerOf2()))
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
SeparateConstOffsetFromGEP.cpp 879 if (ElementSize.isPowerOf2()) {
940 if (ElementSize.isPowerOf2()) {
StraightLineStrengthReduce.cpp 618 if (IndexOffset.isPowerOf2()) {
623 if ((-IndexOffset).isPowerOf2()) {
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/
aaA.d 473 const isPowerOf2 = !((n - 1) & n);
474 return 1 << (bsr(n) + !isPowerOf2);
  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64FastISel.cpp 554 if (C->getValue().isPowerOf2())
557 if (C->getValue().isPowerOf2())
781 if (C->getValue().isPowerOf2())
1230 if (C->getValue().isPowerOf2())
1599 if (C->getValue().isPowerOf2())
2291 if (C->getValue().isPowerOf2())
2295 if (C->getValue().isPowerOf2()) {
4571 if (C->getValue().isPowerOf2())
4576 if (C->getValue().isPowerOf2()) {
4804 !(C.isPowerOf2() || (-C).isPowerOf2())
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
APInt.h 469 bool isPowerOf2() const {
1859 if (!isPowerOf2())
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
numeric.d 3349 assert(isPowerOf2(range.length));
3383 assert(isPowerOf2(range.length));
3491 assert(isPowerOf2(buf.length));
3580 assert(isPowerOf2(size),

Completed in 91 milliseconds

1 2 3