Searched refs:bitreverse (Results 1 - 23 of 23) sorted by relevance

/freebsd-current/sys/dev/iicbus/rtc/
H A Ds35390a.c128 * bitreverse() reverses the bits in uint8_t.
149 bitreverse(uint8_t x) function
176 buf[i] = bitreverse(buf[i]);
197 buf[i] = bitreverse(buf[i]);
/freebsd-current/sys/dev/dwc/
H A Ddwc1000_core.c267 bitreverse(uint8_t x) function
282 val = bitreverse(~crc & 0xff);
/freebsd-current/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVTargetTransformInfo.cpp696 {Intrinsic::bitreverse, MVT::i8, 17}, member in class:Intrinsic
697 {Intrinsic::bitreverse, MVT::i16, 24}, member in class:Intrinsic
698 {Intrinsic::bitreverse, MVT::i32, 33}, member in class:Intrinsic
699 {Intrinsic::bitreverse, MVT::i64, 52}, member in class:Intrinsic
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64TargetTransformInfo.cpp571 case Intrinsic::bitreverse: {
573 {Intrinsic::bitreverse, MVT::i32, 1},
574 {Intrinsic::bitreverse, MVT::i64, 1},
575 {Intrinsic::bitreverse, MVT::v8i8, 1},
576 {Intrinsic::bitreverse, MVT::v16i8, 1},
577 {Intrinsic::bitreverse, MVT::v4i16, 2},
578 {Intrinsic::bitreverse, MVT::v8i16, 2},
579 {Intrinsic::bitreverse, MVT::v2i32, 2},
580 {Intrinsic::bitreverse, MVT::v4i32, 2},
581 {Intrinsic::bitreverse, MV
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Analysis/
H A DDemandedBits.cpp94 case Intrinsic::bitreverse:
H A DVectorUtils.cpp49 case Intrinsic::bitreverse:
H A DConstantFolding.cpp1521 case Intrinsic::bitreverse:
2024 IntrinsicID == Intrinsic::bitreverse ||
2412 case Intrinsic::bitreverse:
H A DValueTracking.cpp1449 case Intrinsic::bitreverse:
2069 // bswap/bitreverse just move around bits, but don't change any 1s/0s
2071 case Intrinsic::bitreverse:
2690 case Intrinsic::bitreverse:
6603 case Intrinsic::bitreverse:
H A DInstructionSimplify.cpp6233 case Intrinsic::bitreverse:
6234 // bitreverse(bitreverse(x)) -> x
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUCodeGenPrepare.cpp210 /// Promotes uniform 'bitreverse' intrinsic \p I to 32 bit 'bitreverse'
215 /// bits, replacing \p I with 32 bit 'bitreverse' intrinsic, shifting the
216 /// result of 32 bit 'bitreverse' intrinsic to the right with zero fill (the
568 assert(I.getIntrinsicID() == Intrinsic::bitreverse &&
569 "I must be bitreverse intrinsic");
578 Intrinsic::getDeclaration(Mod, Intrinsic::bitreverse, { I32Ty });
2015 case Intrinsic::bitreverse:
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/
H A DExpandVectorPredication.cpp306 case Intrinsic::bitreverse: {
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineCalls.cpp502 // ctlz(bitreverse(x)) -> cttz(x)
503 // cttz(bitreverse(x)) -> ctlz(x)
640 // ctpop(bitreverse(x)) -> ctpop(x)
1394 /// Fold the following cases and accepts bswap and bitreverse intrinsics:
1400 static_assert(IntrID == Intrinsic::bswap || IntrID == Intrinsic::bitreverse,
1411 // If both X and Y are bswap/bitreverse, the transform reduces the number
1413 // If only one operand is bswap/bitreverse, we need to ensure the operand
1821 case Intrinsic::bitreverse: {
1834 foldBitOrderCrossLogicOp<Intrinsic::bitreverse>(IIOperand, Builder))
1892 // Try to fold into bitreverse i
[all...]
H A DInstCombineAndOrXor.cpp2131 // bitwise(bitreverse(A), bitreverse(B)) -> bitreverse(bitwise(A, B))
2132 // bitwise(bitreverse(A), C) -> bitreverse(bitwise(A, bitreverse(C)))
2150 if (!Y && (!(IID == Intrinsic::bswap || IID == Intrinsic::bitreverse) ||
2167 case Intrinsic::bitreverse: {
2952 // concat(bitreverse(x),bitreverse(
[all...]
H A DInstCombineCasts.cpp2692 // bitcast <N x i1> (shuf X, undef, <N, N-1,...0>) -> bitreverse (bitcast X)
2700 IntrinsicNum = Intrinsic::bitreverse;
H A DInstCombineCompares.cpp3515 case Intrinsic::bitreverse:
3516 // bitreverse(A) == C -> A == bitreverse(C)
3618 case Intrinsic::bitreverse:
/freebsd-current/contrib/llvm-project/llvm/lib/IR/
H A DAutoUpgrade.cpp631 NewFn = Intrinsic::getDeclaration(F->getParent(), Intrinsic::bitreverse,
804 .StartsWith("rbit", Intrinsic::bitreverse)
1180 .Cases("brev32", "brev64", Intrinsic::bitreverse)
4378 case Intrinsic::bitreverse:
/freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DBasicTTIImpl.h2235 case Intrinsic::bitreverse:
/freebsd-current/contrib/llvm-project/llvm/include/llvm/IR/
H A DPatternMatch.h2302 return m_Intrinsic<Intrinsic::bitreverse>(Op0);
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLocal.cpp115 // bitreverse idioms.
3618 /// A potential constituent of a bitreverse or bswap expression. See
3625 /// The Value that this is a bitreverse/bswap of.
3638 /// pieces of a bswap or bitreverse. The subexpression provides a potential
3639 /// piece of a bswap or bitreverse if it can be proved that each non-zero bit in
3643 /// the bitnumber to bitnumber mapping is correct for a bswap or bitreverse.
3804 // bitreverse.
3877 // be the root input value to the bswap/bitreverse.
3944 // Now, is the bit permutation correct for a bswap or a bitreverse? We can
3965 Intrin = Intrinsic::bitreverse;
[all...]
/freebsd-current/contrib/llvm-project/clang/lib/CodeGen/
H A DCGBuiltin.cpp3365 return RValue::get(emitUnaryBuiltin(*this, E, Intrinsic::bitreverse));
3665 return RValue::get(emitUnaryBuiltin(*this, E, llvm::Intrinsic::bitreverse,
3666 "elt.bitreverse"));
8379 CGM.getIntrinsic(Intrinsic::bitreverse, Arg->getType()), Arg, "rbit");
10701 CGM.getIntrinsic(Intrinsic::bitreverse, Arg->getType()), Arg, "rbit");
10708 CGM.getIntrinsic(Intrinsic::bitreverse, Arg->getType()), Arg, "rbit");
12571 Int = Intrinsic::bitreverse;
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DIRTranslator.cpp1824 case Intrinsic::bitreverse:
/freebsd-current/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86TargetTransformInfo.cpp3368 // BITREVERSE: llvm\test\CodeGen\X86\vector-bitreverse.ll
4047 case Intrinsic::bitreverse:
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.cpp6784 case Intrinsic::bitreverse:

Completed in 910 milliseconds