Searched refs:bitreverse (Results 1 – 25 of 28) sorted by relevance
12
8 ; Verify the cost of scalar bitreverse instructions.10 declare i64 @llvm.bitreverse.i64(i64)11 declare i32 @llvm.bitreverse.i32(i32)12 declare i16 @llvm.bitreverse.i16(i16)13 declare i8 @llvm.bitreverse.i8(i8)17 ; SSE2: Found an estimated cost of 1 for instruction: %bitreverse18 ; SSE42: Found an estimated cost of 1 for instruction: %bitreverse19 ; AVX: Found an estimated cost of 1 for instruction: %bitreverse20 ; AVX2: Found an estimated cost of 1 for instruction: %bitreverse21 ; XOP: Found an estimated cost of 3 for instruction: %bitreverse[all …]
6 %a = call i32 @llvm.bitreverse.i32(i32 %p)7 %b = call i32 @llvm.bitreverse.i32(i32 %a)14 %a = call <2 x i32> @llvm.bitreverse.v2i32(<2 x i32> %p)15 %b = call <2 x i32> @llvm.bitreverse.v2i32(<2 x i32> %a)22 %x = call i32 @llvm.bitreverse.i32(i32 0)29 %x = call i32 @llvm.bitreverse.i32(i32 1)36 %x = call i32 @llvm.bitreverse.i32(i32 -1)43 %x = call i1 @llvm.bitreverse.i1(i1 false)50 %x = call i1 @llvm.bitreverse.i1(i1 true)57 %x = call <2 x i1> @llvm.bitreverse.v2i1(<2 x i1> zeroinitializer)[all …]
19 declare i64 @llvm.bitreverse.i64(i64)20 declare i32 @llvm.bitreverse.i32(i32)21 declare i16 @llvm.bitreverse.i16(i16)22 declare i8 @llvm.bitreverse.i8(i8)28 ; SSE-NEXT: [[BITREVERSE0:%.*]] = call i64 @llvm.bitreverse.i64(i64 [[LD0]])29 ; SSE-NEXT: [[BITREVERSE1:%.*]] = call i64 @llvm.bitreverse.i64(i64 [[LD1]])37 ; AVX-NEXT: [[BITREVERSE0:%.*]] = call i64 @llvm.bitreverse.i64(i64 [[LD0]])38 ; AVX-NEXT: [[BITREVERSE1:%.*]] = call i64 @llvm.bitreverse.i64(i64 [[LD1]])45 ; XOP-NEXT: [[TMP2:%.*]] = call <2 x i64> @llvm.bitreverse.v2i64(<2 x i64> [[TMP1]])51 %bitreverse0 = call i64 @llvm.bitreverse.i64(i64 %ld0)[all …]
4 declare i16 @llvm.bitreverse.i16(i16) #15 declare i32 @llvm.bitreverse.i32(i32) #16 declare i64 @llvm.bitreverse.i64(i64) #18 declare <2 x i32> @llvm.bitreverse.v2i32(<2 x i32>) #19 declare <4 x i32> @llvm.bitreverse.v4i32(<4 x i32>) #111 declare <2 x i64> @llvm.bitreverse.v2i64(<2 x i64>) #112 declare <4 x i64> @llvm.bitreverse.v4i64(<4 x i64>) #119 %brev = call i16 @llvm.bitreverse.i16(i16 %val) #128 %brev = call i16 @llvm.bitreverse.i16(i16 %val) #140 %brev = call i32 @llvm.bitreverse.i32(i32 %val) #1[all …]
3 ; These tests just check that the plumbing is in place for @llvm.bitreverse. The4 ; actual output is massive at the moment as llvm.bitreverse is not yet legal.6 declare <2 x i16> @llvm.bitreverse.v2i16(<2 x i16>) readnone11 %b = call <2 x i16> @llvm.bitreverse.v2i16(<2 x i16> %a)15 declare i8 @llvm.bitreverse.i8(i8) readnone21 %b = call i8 @llvm.bitreverse.i8(i8 %a)
4 ; These tests just check that the plumbing is in place for @llvm.bitreverse. The5 ; actual output is massive at the moment as llvm.bitreverse is not yet legal.7 declare <2 x i16> @llvm.bitreverse.v2i16(<2 x i16>) readnone139 %b = call <2 x i16> @llvm.bitreverse.v2i16(<2 x i16> %a)143 declare i24 @llvm.bitreverse.i24(i24) readnone244 %b = call i24 @llvm.bitreverse.i24(i24 %a)248 declare i8 @llvm.bitreverse.i8(i8) readnone283 %b = call i8 @llvm.bitreverse.i8(i8 %a)287 declare i4 @llvm.bitreverse.i4(i4) readnone308 %b = call i4 @llvm.bitreverse.i4(i4 %a)[all …]
85 %b = call i8 @llvm.bitreverse.i8(i8 %a)229 %b = call i16 @llvm.bitreverse.i16(i16 %a)494 %b = call i32 @llvm.bitreverse.i32(i32 %a)1017 %b = call i64 @llvm.bitreverse.i64(i64 %a)1097 %b = call <16 x i8> @llvm.bitreverse.v16i8(<16 x i8> %a)1188 %b = call <8 x i16> @llvm.bitreverse.v8i16(<8 x i16> %a)1279 %b = call <4 x i32> @llvm.bitreverse.v4i32(<4 x i32> %a)1372 %b = call <2 x i64> @llvm.bitreverse.v2i64(<2 x i64> %a)1545 %b = call <32 x i8> @llvm.bitreverse.v32i8(<32 x i8> %a)1743 %b = call <16 x i16> @llvm.bitreverse.v16i16(<16 x i16> %a)[all …]
3 ; These tests just check that the plumbing is in place for @llvm.bitreverse. The4 ; actual output is massive at the moment as llvm.bitreverse is not yet legal.6 declare <2 x i16> @llvm.bitreverse.v2i16(<2 x i16>) readnone12 %b = call <2 x i16> @llvm.bitreverse.v2i16(<2 x i16> %a)16 declare i8 @llvm.bitreverse.i8(i8) readnone41 %b = call i8 @llvm.bitreverse.i8(i8 %a)45 declare <8 x i8> @llvm.bitreverse.v8i8(<8 x i8>) readnone86 %b = call <8 x i8> @llvm.bitreverse.v8i8(<8 x i8> %a)
22 declare i32 @llvm.bitreverse.i32(i32) readnone28 %rbit = call i32 @llvm.bitreverse.i32(i32 %t)
24 %or19 = call i8 @llvm.bitreverse.i8(i8 %1)34 declare i8 @llvm.bitreverse.i8(i8)
299 static ogg_uint32_t bitreverse(ogg_uint32_t x){ in bitreverse() function346 codes[i]=bitreverse(codes[i]); in vorbis_book_init_decode()389 ogg_uint32_t orig=bitreverse(c->codelist[i]); in vorbis_book_init_decode()403 if(c->dec_firsttable[bitreverse(word)]==0){ in vorbis_book_init_decode()416 c->dec_firsttable[bitreverse(word)]= in vorbis_book_init_decode()
275 static ogg_uint32_t bitreverse(ogg_uint32_t x){ in bitreverse() function310 ogg_uint32_t testword=bitreverse((ogg_uint32_t)lok); in decode_packed_entry_number()
37 // Deprecated in favor of llvm.bitreverse
116 [(set i32:$sdst, (bitreverse i32:$src0))]
8 ; CHECK: call i32 @llvm.bitreverse.i32
3 ; Test these 5 bitreverse store intrinsics:
3 ; Testing bitreverse load intrinsics:
55 case Intrinsic::bitreverse: in isTriviallyVectorizable()
1311 case Intrinsic::bitreverse: in canConstantFoldCallTo()1647 case Intrinsic::bitreverse: in ConstantFoldScalarCall()
1365 case Intrinsic::bitreverse: { in visitCallInst()1370 if (match(IIOperand, m_Intrinsic<Intrinsic::bitreverse>(m_Value(X)))) in visitCallInst()
1925 Intrin = Intrinsic::bitreverse; in recognizeBSwapOrBitReverseIdiom()
999 case Intrinsic::bitreverse: in getIntrinsicInstrCost()
409 def bitreverse : SDNode<"ISD::BITREVERSE" , SDTIntUnaryOp>;
10695 '``llvm.bitreverse.*``' Intrinsics10701 This is an overloaded intrinsic function. You can use bitreverse on any10706 declare i16 @llvm.bitreverse.i16(i16 <id>)10707 declare i32 @llvm.bitreverse.i32(i32 <id>)10708 declare i64 @llvm.bitreverse.i64(i64 <id>)10713 The '``llvm.bitreverse``' family of intrinsics is used to reverse the10720 The ``llvm.bitreverse.iN`` intrinsic returns an i16 value that has bit
2957 [(set rGPR:$Rd, (bitreverse rGPR:$Rm))]>,