Searched refs:bitreverse (Results 1 - 15 of 15) sorted by path
/freebsd-11-stable/sys/dev/dwc/ |
H A D | if_dwc.c | 578 bitreverse(uint8_t x) function 617 val = bitreverse(~crc & 0xff);
|
/freebsd-11-stable/sys/dev/iicbus/ |
H A D | s35390a.c | 128 * 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-11-stable/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGBuiltin.cpp | 2190 return RValue::get(emitUnaryBuiltin(*this, E, Intrinsic::bitreverse)); 6214 CGM.getIntrinsic(Intrinsic::bitreverse, Arg->getType()), Arg, "rbit"); 7315 CGM.getIntrinsic(Intrinsic::bitreverse, Arg->getType()), Arg, "rbit"); 7322 CGM.getIntrinsic(Intrinsic::bitreverse, Arg->getType()), Arg, "rbit");
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | PatternMatch.h | 1809 return m_Intrinsic<Intrinsic::bitreverse>(Op0);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ConstantFolding.cpp | 1453 case Intrinsic::bitreverse: 1709 IntrinsicID == Intrinsic::bitreverse || 1972 case Intrinsic::bitreverse:
|
H A D | DemandedBits.cpp | 126 case Intrinsic::bitreverse:
|
H A D | InstructionSimplify.cpp | 5024 case Intrinsic::bitreverse: 5025 // bitreverse(bitreverse(x)) -> x
|
H A D | ValueTracking.cpp | 1560 case Intrinsic::bitreverse:
|
H A D | VectorUtils.cpp | 47 case Intrinsic::bitreverse:
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | IRTranslator.cpp | 1209 case Intrinsic::bitreverse:
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGBuilder.cpp | 6310 case Intrinsic::bitreverse:
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | AutoUpgrade.cpp | 506 NewFn = Intrinsic::getDeclaration(F->getParent(), Intrinsic::bitreverse, 764 .Cases("brev32", "brev64", Intrinsic::bitreverse) 3561 case Intrinsic::bitreverse:
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUCodeGenPrepare.cpp | 132 /// Promotes uniform 'bitreverse' intrinsic \p I to 32 bit 'bitreverse' 137 /// bits, replacing \p I with 32 bit 'bitreverse' intrinsic, shifting the 138 /// result of 32 bit 'bitreverse' intrinsic to the right with zero fill (the 390 assert(I.getIntrinsicID() == Intrinsic::bitreverse && 391 "I must be bitreverse intrinsic"); 400 Intrinsic::getDeclaration(Mod, Intrinsic::bitreverse, { I32Ty }); 1001 case Intrinsic::bitreverse:
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86TargetTransformInfo.cpp | 1890 // BITREVERSE: llvm\test\CodeGen\X86\vector-bitreverse.ll 2161 case Intrinsic::bitreverse:
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | Local.cpp | 95 // bitreverse idioms 2651 /// A potential constituent of a bitreverse or bswap expression. See 2658 /// The Value that this is a bitreverse/bswap of. 2671 /// pieces of a bswap or bitreverse. The subexpression provides a potential 2672 /// piece of a bswap or bitreverse if it can be proven that each non-zero bit in 2676 /// the bitnumber to bitnumber mapping is correct for a bswap or bitreverse. 2811 // the input value to the bswap/bitreverse. 2862 // Now, is the bit permutation correct for a bswap or a bitreverse? We can 2876 Intrin = Intrinsic::bitreverse;
|
Completed in 447 milliseconds