110 | 442k | } Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<0ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<2ul, 0ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<3ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<3ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<3ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<3ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<4ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<4ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<4ul, 1ul, 3ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<4ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<4ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<4ul, 2ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<5ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<5ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<5ul, 1ul, 4ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<5ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<5ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<5ul, 2ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<5ul, 2ul, 3ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<6ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<6ul, 1ul, 5ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<6ul, 2ul, 4ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<7ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<8ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<9ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<10ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<11ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE4::EstimateTokenCostImpl<12ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) unsigned int jxl::N_AVX2::EstimateTokenCostImpl<0ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 75.7k | uint32_t* JXL_RESTRICT out) { | 45 | 75.7k | const HWY_FULL(uint32_t) du; | 46 | 75.7k | const HWY_FULL(float) df; | 47 | 75.7k | const auto kZero = Zero(du); | 48 | 75.7k | const auto kSplit = Set(du, 1 << E); | 49 | 75.7k | const auto kExpOffset = Set(du, 127); | 50 | 75.7k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 75.7k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 75.7k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 75.7k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 75.7k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 75.7k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 75.7k | constexpr size_t kLargeShiftVal = 10; | 57 | 75.7k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 75.7k | auto extra_bits = kZero; | 60 | 75.7k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 12.3M | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 12.2M | const auto val = LoadU(du, values + i); | 63 | 12.2M | const auto is_large = Gt(val, kLargeThreshold); | 64 | 12.2M | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 12.2M | const auto not_literal = Ge(val, kSplit); | 66 | 12.2M | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 12.2M | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 12.2M | const auto l = And(val, kMaskL); | 69 | 12.2M | const auto exp = ShiftRight<23>(b); | 70 | 12.2M | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 12.2M | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 12.2M | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 12.2M | const auto m = ShiftRight<23 - M - L>(b); | 74 | 12.2M | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 12.2M | const auto d = And(m, kMaskM); | 76 | 12.2M | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 12.2M | const auto c = Or(a, l); | 78 | 12.2M | extra_bits = Add(extra_bits, eb_fixed); | 79 | 12.2M | const auto t = Or(c, d); | 80 | 12.2M | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 12.2M | Store(t_fixed, du, out + i); | 82 | 12.2M | } | 83 | 75.7k | if (last_full < len) { | 84 | 65.7k | const auto stop = Set(du, len); | 85 | 65.7k | const auto fence = Iota(du, last_full); | 86 | 65.7k | const auto take = Lt(fence, stop); | 87 | 65.7k | const auto val = LoadU(du, values + last_full); | 88 | 65.7k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 65.7k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 65.7k | const auto not_literal = Ge(val, kSplit); | 91 | 65.7k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 65.7k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 65.7k | const auto l = And(val, kMaskL); | 94 | 65.7k | const auto exp = ShiftRight<23>(b); | 95 | 65.7k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 65.7k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 65.7k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 65.7k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 65.7k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 65.7k | const auto d = And(m, kMaskM); | 101 | 65.7k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 65.7k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 65.7k | const auto c = Or(a, l); | 104 | 65.7k | extra_bits = Add(extra_bits, eb_masked); | 105 | 65.7k | const auto t = Or(c, d); | 106 | 65.7k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 65.7k | Store(t_fixed, du, out + last_full); | 108 | 65.7k | } | 109 | 75.7k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 75.7k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<2ul, 0ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 75.1k | uint32_t* JXL_RESTRICT out) { | 45 | 75.1k | const HWY_FULL(uint32_t) du; | 46 | 75.1k | const HWY_FULL(float) df; | 47 | 75.1k | const auto kZero = Zero(du); | 48 | 75.1k | const auto kSplit = Set(du, 1 << E); | 49 | 75.1k | const auto kExpOffset = Set(du, 127); | 50 | 75.1k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 75.1k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 75.1k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 75.1k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 75.1k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 75.1k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 75.1k | constexpr size_t kLargeShiftVal = 10; | 57 | 75.1k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 75.1k | auto extra_bits = kZero; | 60 | 75.1k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 12.3M | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 12.2M | const auto val = LoadU(du, values + i); | 63 | 12.2M | const auto is_large = Gt(val, kLargeThreshold); | 64 | 12.2M | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 12.2M | const auto not_literal = Ge(val, kSplit); | 66 | 12.2M | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 12.2M | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 12.2M | const auto l = And(val, kMaskL); | 69 | 12.2M | const auto exp = ShiftRight<23>(b); | 70 | 12.2M | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 12.2M | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 12.2M | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 12.2M | const auto m = ShiftRight<23 - M - L>(b); | 74 | 12.2M | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 12.2M | const auto d = And(m, kMaskM); | 76 | 12.2M | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 12.2M | const auto c = Or(a, l); | 78 | 12.2M | extra_bits = Add(extra_bits, eb_fixed); | 79 | 12.2M | const auto t = Or(c, d); | 80 | 12.2M | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 12.2M | Store(t_fixed, du, out + i); | 82 | 12.2M | } | 83 | 75.1k | if (last_full < len) { | 84 | 65.1k | const auto stop = Set(du, len); | 85 | 65.1k | const auto fence = Iota(du, last_full); | 86 | 65.1k | const auto take = Lt(fence, stop); | 87 | 65.1k | const auto val = LoadU(du, values + last_full); | 88 | 65.1k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 65.1k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 65.1k | const auto not_literal = Ge(val, kSplit); | 91 | 65.1k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 65.1k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 65.1k | const auto l = And(val, kMaskL); | 94 | 65.1k | const auto exp = ShiftRight<23>(b); | 95 | 65.1k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 65.1k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 65.1k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 65.1k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 65.1k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 65.1k | const auto d = And(m, kMaskM); | 101 | 65.1k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 65.1k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 65.1k | const auto c = Or(a, l); | 104 | 65.1k | extra_bits = Add(extra_bits, eb_masked); | 105 | 65.1k | const auto t = Or(c, d); | 106 | 65.1k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 65.1k | Store(t_fixed, du, out + last_full); | 108 | 65.1k | } | 109 | 75.1k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 75.1k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<3ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<3ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<3ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<3ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 75.0k | uint32_t* JXL_RESTRICT out) { | 45 | 75.0k | const HWY_FULL(uint32_t) du; | 46 | 75.0k | const HWY_FULL(float) df; | 47 | 75.0k | const auto kZero = Zero(du); | 48 | 75.0k | const auto kSplit = Set(du, 1 << E); | 49 | 75.0k | const auto kExpOffset = Set(du, 127); | 50 | 75.0k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 75.0k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 75.0k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 75.0k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 75.0k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 75.0k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 75.0k | constexpr size_t kLargeShiftVal = 10; | 57 | 75.0k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 75.0k | auto extra_bits = kZero; | 60 | 75.0k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 12.3M | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 12.2M | const auto val = LoadU(du, values + i); | 63 | 12.2M | const auto is_large = Gt(val, kLargeThreshold); | 64 | 12.2M | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 12.2M | const auto not_literal = Ge(val, kSplit); | 66 | 12.2M | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 12.2M | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 12.2M | const auto l = And(val, kMaskL); | 69 | 12.2M | const auto exp = ShiftRight<23>(b); | 70 | 12.2M | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 12.2M | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 12.2M | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 12.2M | const auto m = ShiftRight<23 - M - L>(b); | 74 | 12.2M | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 12.2M | const auto d = And(m, kMaskM); | 76 | 12.2M | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 12.2M | const auto c = Or(a, l); | 78 | 12.2M | extra_bits = Add(extra_bits, eb_fixed); | 79 | 12.2M | const auto t = Or(c, d); | 80 | 12.2M | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 12.2M | Store(t_fixed, du, out + i); | 82 | 12.2M | } | 83 | 75.0k | if (last_full < len) { | 84 | 65.1k | const auto stop = Set(du, len); | 85 | 65.1k | const auto fence = Iota(du, last_full); | 86 | 65.1k | const auto take = Lt(fence, stop); | 87 | 65.1k | const auto val = LoadU(du, values + last_full); | 88 | 65.1k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 65.1k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 65.1k | const auto not_literal = Ge(val, kSplit); | 91 | 65.1k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 65.1k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 65.1k | const auto l = And(val, kMaskL); | 94 | 65.1k | const auto exp = ShiftRight<23>(b); | 95 | 65.1k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 65.1k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 65.1k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 65.1k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 65.1k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 65.1k | const auto d = And(m, kMaskM); | 101 | 65.1k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 65.1k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 65.1k | const auto c = Or(a, l); | 104 | 65.1k | extra_bits = Add(extra_bits, eb_masked); | 105 | 65.1k | const auto t = Or(c, d); | 106 | 65.1k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 65.1k | Store(t_fixed, du, out + last_full); | 108 | 65.1k | } | 109 | 75.0k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 75.0k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 1ul, 3ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 75.1k | uint32_t* JXL_RESTRICT out) { | 45 | 75.1k | const HWY_FULL(uint32_t) du; | 46 | 75.1k | const HWY_FULL(float) df; | 47 | 75.1k | const auto kZero = Zero(du); | 48 | 75.1k | const auto kSplit = Set(du, 1 << E); | 49 | 75.1k | const auto kExpOffset = Set(du, 127); | 50 | 75.1k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 75.1k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 75.1k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 75.1k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 75.1k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 75.1k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 75.1k | constexpr size_t kLargeShiftVal = 10; | 57 | 75.1k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 75.1k | auto extra_bits = kZero; | 60 | 75.1k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 12.3M | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 12.2M | const auto val = LoadU(du, values + i); | 63 | 12.2M | const auto is_large = Gt(val, kLargeThreshold); | 64 | 12.2M | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 12.2M | const auto not_literal = Ge(val, kSplit); | 66 | 12.2M | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 12.2M | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 12.2M | const auto l = And(val, kMaskL); | 69 | 12.2M | const auto exp = ShiftRight<23>(b); | 70 | 12.2M | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 12.2M | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 12.2M | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 12.2M | const auto m = ShiftRight<23 - M - L>(b); | 74 | 12.2M | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 12.2M | const auto d = And(m, kMaskM); | 76 | 12.2M | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 12.2M | const auto c = Or(a, l); | 78 | 12.2M | extra_bits = Add(extra_bits, eb_fixed); | 79 | 12.2M | const auto t = Or(c, d); | 80 | 12.2M | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 12.2M | Store(t_fixed, du, out + i); | 82 | 12.2M | } | 83 | 75.1k | if (last_full < len) { | 84 | 65.1k | const auto stop = Set(du, len); | 85 | 65.1k | const auto fence = Iota(du, last_full); | 86 | 65.1k | const auto take = Lt(fence, stop); | 87 | 65.1k | const auto val = LoadU(du, values + last_full); | 88 | 65.1k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 65.1k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 65.1k | const auto not_literal = Ge(val, kSplit); | 91 | 65.1k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 65.1k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 65.1k | const auto l = And(val, kMaskL); | 94 | 65.1k | const auto exp = ShiftRight<23>(b); | 95 | 65.1k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 65.1k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 65.1k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 65.1k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 65.1k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 65.1k | const auto d = And(m, kMaskM); | 101 | 65.1k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 65.1k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 65.1k | const auto c = Or(a, l); | 104 | 65.1k | extra_bits = Add(extra_bits, eb_masked); | 105 | 65.1k | const auto t = Or(c, d); | 106 | 65.1k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 65.1k | Store(t_fixed, du, out + last_full); | 108 | 65.1k | } | 109 | 75.1k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 75.1k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 2ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 1ul, 4ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 2ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 2ul, 3ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<6ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<6ul, 1ul, 5ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 5.35k | uint32_t* JXL_RESTRICT out) { | 45 | 5.35k | const HWY_FULL(uint32_t) du; | 46 | 5.35k | const HWY_FULL(float) df; | 47 | 5.35k | const auto kZero = Zero(du); | 48 | 5.35k | const auto kSplit = Set(du, 1 << E); | 49 | 5.35k | const auto kExpOffset = Set(du, 127); | 50 | 5.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 5.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 5.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 5.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 5.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 5.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 5.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 5.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 5.35k | auto extra_bits = kZero; | 60 | 5.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 362k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 356k | const auto val = LoadU(du, values + i); | 63 | 356k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 356k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 356k | const auto not_literal = Ge(val, kSplit); | 66 | 356k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 356k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 356k | const auto l = And(val, kMaskL); | 69 | 356k | const auto exp = ShiftRight<23>(b); | 70 | 356k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 356k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 356k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 356k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 356k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 356k | const auto d = And(m, kMaskM); | 76 | 356k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 356k | const auto c = Or(a, l); | 78 | 356k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 356k | const auto t = Or(c, d); | 80 | 356k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 356k | Store(t_fixed, du, out + i); | 82 | 356k | } | 83 | 5.35k | if (last_full < len) { | 84 | 4.53k | const auto stop = Set(du, len); | 85 | 4.53k | const auto fence = Iota(du, last_full); | 86 | 4.53k | const auto take = Lt(fence, stop); | 87 | 4.53k | const auto val = LoadU(du, values + last_full); | 88 | 4.53k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 4.53k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 4.53k | const auto not_literal = Ge(val, kSplit); | 91 | 4.53k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 4.53k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 4.53k | const auto l = And(val, kMaskL); | 94 | 4.53k | const auto exp = ShiftRight<23>(b); | 95 | 4.53k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 4.53k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 4.53k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 4.53k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 4.53k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 4.53k | const auto d = And(m, kMaskM); | 101 | 4.53k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 4.53k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 4.53k | const auto c = Or(a, l); | 104 | 4.53k | extra_bits = Add(extra_bits, eb_masked); | 105 | 4.53k | const auto t = Or(c, d); | 106 | 4.53k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 4.53k | Store(t_fixed, du, out + last_full); | 108 | 4.53k | } | 109 | 5.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 5.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<6ul, 2ul, 4ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 5.35k | uint32_t* JXL_RESTRICT out) { | 45 | 5.35k | const HWY_FULL(uint32_t) du; | 46 | 5.35k | const HWY_FULL(float) df; | 47 | 5.35k | const auto kZero = Zero(du); | 48 | 5.35k | const auto kSplit = Set(du, 1 << E); | 49 | 5.35k | const auto kExpOffset = Set(du, 127); | 50 | 5.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 5.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 5.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 5.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 5.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 5.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 5.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 5.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 5.35k | auto extra_bits = kZero; | 60 | 5.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 362k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 356k | const auto val = LoadU(du, values + i); | 63 | 356k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 356k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 356k | const auto not_literal = Ge(val, kSplit); | 66 | 356k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 356k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 356k | const auto l = And(val, kMaskL); | 69 | 356k | const auto exp = ShiftRight<23>(b); | 70 | 356k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 356k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 356k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 356k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 356k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 356k | const auto d = And(m, kMaskM); | 76 | 356k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 356k | const auto c = Or(a, l); | 78 | 356k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 356k | const auto t = Or(c, d); | 80 | 356k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 356k | Store(t_fixed, du, out + i); | 82 | 356k | } | 83 | 5.35k | if (last_full < len) { | 84 | 4.53k | const auto stop = Set(du, len); | 85 | 4.53k | const auto fence = Iota(du, last_full); | 86 | 4.53k | const auto take = Lt(fence, stop); | 87 | 4.53k | const auto val = LoadU(du, values + last_full); | 88 | 4.53k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 4.53k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 4.53k | const auto not_literal = Ge(val, kSplit); | 91 | 4.53k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 4.53k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 4.53k | const auto l = And(val, kMaskL); | 94 | 4.53k | const auto exp = ShiftRight<23>(b); | 95 | 4.53k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 4.53k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 4.53k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 4.53k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 4.53k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 4.53k | const auto d = And(m, kMaskM); | 101 | 4.53k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 4.53k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 4.53k | const auto c = Or(a, l); | 104 | 4.53k | extra_bits = Add(extra_bits, eb_masked); | 105 | 4.53k | const auto t = Or(c, d); | 106 | 4.53k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 4.53k | Store(t_fixed, du, out + last_full); | 108 | 4.53k | } | 109 | 5.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 5.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<7ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.35k | uint32_t* JXL_RESTRICT out) { | 45 | 6.35k | const HWY_FULL(uint32_t) du; | 46 | 6.35k | const HWY_FULL(float) df; | 47 | 6.35k | const auto kZero = Zero(du); | 48 | 6.35k | const auto kSplit = Set(du, 1 << E); | 49 | 6.35k | const auto kExpOffset = Set(du, 127); | 50 | 6.35k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.35k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.35k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.35k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.35k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.35k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.35k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.35k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.35k | auto extra_bits = kZero; | 60 | 6.35k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 706k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 700k | const auto val = LoadU(du, values + i); | 63 | 700k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 700k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 700k | const auto not_literal = Ge(val, kSplit); | 66 | 700k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 700k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 700k | const auto l = And(val, kMaskL); | 69 | 700k | const auto exp = ShiftRight<23>(b); | 70 | 700k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 700k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 700k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 700k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 700k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 700k | const auto d = And(m, kMaskM); | 76 | 700k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 700k | const auto c = Or(a, l); | 78 | 700k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 700k | const auto t = Or(c, d); | 80 | 700k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 700k | Store(t_fixed, du, out + i); | 82 | 700k | } | 83 | 6.35k | if (last_full < len) { | 84 | 5.37k | const auto stop = Set(du, len); | 85 | 5.37k | const auto fence = Iota(du, last_full); | 86 | 5.37k | const auto take = Lt(fence, stop); | 87 | 5.37k | const auto val = LoadU(du, values + last_full); | 88 | 5.37k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.37k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.37k | const auto not_literal = Ge(val, kSplit); | 91 | 5.37k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.37k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.37k | const auto l = And(val, kMaskL); | 94 | 5.37k | const auto exp = ShiftRight<23>(b); | 95 | 5.37k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.37k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.37k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.37k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.37k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.37k | const auto d = And(m, kMaskM); | 101 | 5.37k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.37k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.37k | const auto c = Or(a, l); | 104 | 5.37k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.37k | const auto t = Or(c, d); | 106 | 5.37k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.37k | Store(t_fixed, du, out + last_full); | 108 | 5.37k | } | 109 | 6.35k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.35k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<8ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 4.55k | uint32_t* JXL_RESTRICT out) { | 45 | 4.55k | const HWY_FULL(uint32_t) du; | 46 | 4.55k | const HWY_FULL(float) df; | 47 | 4.55k | const auto kZero = Zero(du); | 48 | 4.55k | const auto kSplit = Set(du, 1 << E); | 49 | 4.55k | const auto kExpOffset = Set(du, 127); | 50 | 4.55k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 4.55k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 4.55k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 4.55k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 4.55k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 4.55k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 4.55k | constexpr size_t kLargeShiftVal = 10; | 57 | 4.55k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 4.55k | auto extra_bits = kZero; | 60 | 4.55k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 328k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 324k | const auto val = LoadU(du, values + i); | 63 | 324k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 324k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 324k | const auto not_literal = Ge(val, kSplit); | 66 | 324k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 324k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 324k | const auto l = And(val, kMaskL); | 69 | 324k | const auto exp = ShiftRight<23>(b); | 70 | 324k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 324k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 324k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 324k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 324k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 324k | const auto d = And(m, kMaskM); | 76 | 324k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 324k | const auto c = Or(a, l); | 78 | 324k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 324k | const auto t = Or(c, d); | 80 | 324k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 324k | Store(t_fixed, du, out + i); | 82 | 324k | } | 83 | 4.55k | if (last_full < len) { | 84 | 3.81k | const auto stop = Set(du, len); | 85 | 3.81k | const auto fence = Iota(du, last_full); | 86 | 3.81k | const auto take = Lt(fence, stop); | 87 | 3.81k | const auto val = LoadU(du, values + last_full); | 88 | 3.81k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 3.81k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 3.81k | const auto not_literal = Ge(val, kSplit); | 91 | 3.81k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 3.81k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 3.81k | const auto l = And(val, kMaskL); | 94 | 3.81k | const auto exp = ShiftRight<23>(b); | 95 | 3.81k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 3.81k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 3.81k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 3.81k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 3.81k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 3.81k | const auto d = And(m, kMaskM); | 101 | 3.81k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 3.81k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 3.81k | const auto c = Or(a, l); | 104 | 3.81k | extra_bits = Add(extra_bits, eb_masked); | 105 | 3.81k | const auto t = Or(c, d); | 106 | 3.81k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 3.81k | Store(t_fixed, du, out + last_full); | 108 | 3.81k | } | 109 | 4.55k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 4.55k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<9ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 4.55k | uint32_t* JXL_RESTRICT out) { | 45 | 4.55k | const HWY_FULL(uint32_t) du; | 46 | 4.55k | const HWY_FULL(float) df; | 47 | 4.55k | const auto kZero = Zero(du); | 48 | 4.55k | const auto kSplit = Set(du, 1 << E); | 49 | 4.55k | const auto kExpOffset = Set(du, 127); | 50 | 4.55k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 4.55k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 4.55k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 4.55k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 4.55k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 4.55k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 4.55k | constexpr size_t kLargeShiftVal = 10; | 57 | 4.55k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 4.55k | auto extra_bits = kZero; | 60 | 4.55k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 328k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 324k | const auto val = LoadU(du, values + i); | 63 | 324k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 324k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 324k | const auto not_literal = Ge(val, kSplit); | 66 | 324k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 324k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 324k | const auto l = And(val, kMaskL); | 69 | 324k | const auto exp = ShiftRight<23>(b); | 70 | 324k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 324k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 324k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 324k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 324k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 324k | const auto d = And(m, kMaskM); | 76 | 324k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 324k | const auto c = Or(a, l); | 78 | 324k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 324k | const auto t = Or(c, d); | 80 | 324k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 324k | Store(t_fixed, du, out + i); | 82 | 324k | } | 83 | 4.55k | if (last_full < len) { | 84 | 3.81k | const auto stop = Set(du, len); | 85 | 3.81k | const auto fence = Iota(du, last_full); | 86 | 3.81k | const auto take = Lt(fence, stop); | 87 | 3.81k | const auto val = LoadU(du, values + last_full); | 88 | 3.81k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 3.81k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 3.81k | const auto not_literal = Ge(val, kSplit); | 91 | 3.81k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 3.81k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 3.81k | const auto l = And(val, kMaskL); | 94 | 3.81k | const auto exp = ShiftRight<23>(b); | 95 | 3.81k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 3.81k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 3.81k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 3.81k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 3.81k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 3.81k | const auto d = And(m, kMaskM); | 101 | 3.81k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 3.81k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 3.81k | const auto c = Or(a, l); | 104 | 3.81k | extra_bits = Add(extra_bits, eb_masked); | 105 | 3.81k | const auto t = Or(c, d); | 106 | 3.81k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 3.81k | Store(t_fixed, du, out + last_full); | 108 | 3.81k | } | 109 | 4.55k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 4.55k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<10ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 4.55k | uint32_t* JXL_RESTRICT out) { | 45 | 4.55k | const HWY_FULL(uint32_t) du; | 46 | 4.55k | const HWY_FULL(float) df; | 47 | 4.55k | const auto kZero = Zero(du); | 48 | 4.55k | const auto kSplit = Set(du, 1 << E); | 49 | 4.55k | const auto kExpOffset = Set(du, 127); | 50 | 4.55k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 4.55k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 4.55k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 4.55k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 4.55k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 4.55k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 4.55k | constexpr size_t kLargeShiftVal = 10; | 57 | 4.55k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 4.55k | auto extra_bits = kZero; | 60 | 4.55k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 328k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 324k | const auto val = LoadU(du, values + i); | 63 | 324k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 324k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 324k | const auto not_literal = Ge(val, kSplit); | 66 | 324k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 324k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 324k | const auto l = And(val, kMaskL); | 69 | 324k | const auto exp = ShiftRight<23>(b); | 70 | 324k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 324k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 324k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 324k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 324k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 324k | const auto d = And(m, kMaskM); | 76 | 324k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 324k | const auto c = Or(a, l); | 78 | 324k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 324k | const auto t = Or(c, d); | 80 | 324k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 324k | Store(t_fixed, du, out + i); | 82 | 324k | } | 83 | 4.55k | if (last_full < len) { | 84 | 3.81k | const auto stop = Set(du, len); | 85 | 3.81k | const auto fence = Iota(du, last_full); | 86 | 3.81k | const auto take = Lt(fence, stop); | 87 | 3.81k | const auto val = LoadU(du, values + last_full); | 88 | 3.81k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 3.81k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 3.81k | const auto not_literal = Ge(val, kSplit); | 91 | 3.81k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 3.81k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 3.81k | const auto l = And(val, kMaskL); | 94 | 3.81k | const auto exp = ShiftRight<23>(b); | 95 | 3.81k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 3.81k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 3.81k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 3.81k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 3.81k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 3.81k | const auto d = And(m, kMaskM); | 101 | 3.81k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 3.81k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 3.81k | const auto c = Or(a, l); | 104 | 3.81k | extra_bits = Add(extra_bits, eb_masked); | 105 | 3.81k | const auto t = Or(c, d); | 106 | 3.81k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 3.81k | Store(t_fixed, du, out + last_full); | 108 | 3.81k | } | 109 | 4.55k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 4.55k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<11ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 4.55k | uint32_t* JXL_RESTRICT out) { | 45 | 4.55k | const HWY_FULL(uint32_t) du; | 46 | 4.55k | const HWY_FULL(float) df; | 47 | 4.55k | const auto kZero = Zero(du); | 48 | 4.55k | const auto kSplit = Set(du, 1 << E); | 49 | 4.55k | const auto kExpOffset = Set(du, 127); | 50 | 4.55k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 4.55k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 4.55k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 4.55k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 4.55k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 4.55k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 4.55k | constexpr size_t kLargeShiftVal = 10; | 57 | 4.55k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 4.55k | auto extra_bits = kZero; | 60 | 4.55k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 328k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 324k | const auto val = LoadU(du, values + i); | 63 | 324k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 324k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 324k | const auto not_literal = Ge(val, kSplit); | 66 | 324k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 324k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 324k | const auto l = And(val, kMaskL); | 69 | 324k | const auto exp = ShiftRight<23>(b); | 70 | 324k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 324k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 324k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 324k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 324k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 324k | const auto d = And(m, kMaskM); | 76 | 324k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 324k | const auto c = Or(a, l); | 78 | 324k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 324k | const auto t = Or(c, d); | 80 | 324k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 324k | Store(t_fixed, du, out + i); | 82 | 324k | } | 83 | 4.55k | if (last_full < len) { | 84 | 3.81k | const auto stop = Set(du, len); | 85 | 3.81k | const auto fence = Iota(du, last_full); | 86 | 3.81k | const auto take = Lt(fence, stop); | 87 | 3.81k | const auto val = LoadU(du, values + last_full); | 88 | 3.81k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 3.81k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 3.81k | const auto not_literal = Ge(val, kSplit); | 91 | 3.81k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 3.81k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 3.81k | const auto l = And(val, kMaskL); | 94 | 3.81k | const auto exp = ShiftRight<23>(b); | 95 | 3.81k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 3.81k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 3.81k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 3.81k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 3.81k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 3.81k | const auto d = And(m, kMaskM); | 101 | 3.81k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 3.81k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 3.81k | const auto c = Or(a, l); | 104 | 3.81k | extra_bits = Add(extra_bits, eb_masked); | 105 | 3.81k | const auto t = Or(c, d); | 106 | 3.81k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 3.81k | Store(t_fixed, du, out + last_full); | 108 | 3.81k | } | 109 | 4.55k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 4.55k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<12ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 4.55k | uint32_t* JXL_RESTRICT out) { | 45 | 4.55k | const HWY_FULL(uint32_t) du; | 46 | 4.55k | const HWY_FULL(float) df; | 47 | 4.55k | const auto kZero = Zero(du); | 48 | 4.55k | const auto kSplit = Set(du, 1 << E); | 49 | 4.55k | const auto kExpOffset = Set(du, 127); | 50 | 4.55k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 4.55k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 4.55k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 4.55k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 4.55k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 4.55k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 4.55k | constexpr size_t kLargeShiftVal = 10; | 57 | 4.55k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 4.55k | auto extra_bits = kZero; | 60 | 4.55k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 328k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 324k | const auto val = LoadU(du, values + i); | 63 | 324k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 324k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 324k | const auto not_literal = Ge(val, kSplit); | 66 | 324k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 324k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 324k | const auto l = And(val, kMaskL); | 69 | 324k | const auto exp = ShiftRight<23>(b); | 70 | 324k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 324k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 324k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 324k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 324k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 324k | const auto d = And(m, kMaskM); | 76 | 324k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 324k | const auto c = Or(a, l); | 78 | 324k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 324k | const auto t = Or(c, d); | 80 | 324k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 324k | Store(t_fixed, du, out + i); | 82 | 324k | } | 83 | 4.55k | if (last_full < len) { | 84 | 3.81k | const auto stop = Set(du, len); | 85 | 3.81k | const auto fence = Iota(du, last_full); | 86 | 3.81k | const auto take = Lt(fence, stop); | 87 | 3.81k | const auto val = LoadU(du, values + last_full); | 88 | 3.81k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 3.81k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 3.81k | const auto not_literal = Ge(val, kSplit); | 91 | 3.81k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 3.81k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 3.81k | const auto l = And(val, kMaskL); | 94 | 3.81k | const auto exp = ShiftRight<23>(b); | 95 | 3.81k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 3.81k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 3.81k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 3.81k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 3.81k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 3.81k | const auto d = And(m, kMaskM); | 101 | 3.81k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 3.81k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 3.81k | const auto c = Or(a, l); | 104 | 3.81k | extra_bits = Add(extra_bits, eb_masked); | 105 | 3.81k | const auto t = Or(c, d); | 106 | 3.81k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 3.81k | Store(t_fixed, du, out + last_full); | 108 | 3.81k | } | 109 | 4.55k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 4.55k | } |
Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<0ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<2ul, 0ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<3ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<3ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<3ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<3ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<4ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<4ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<4ul, 1ul, 3ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<4ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<4ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<4ul, 2ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<5ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<5ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<5ul, 1ul, 4ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<5ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<5ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<5ul, 2ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<5ul, 2ul, 3ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<6ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<6ul, 1ul, 5ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<6ul, 2ul, 4ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<7ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<8ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<9ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<10ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<11ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Unexecuted instantiation: unsigned int jxl::N_SSE2::EstimateTokenCostImpl<12ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) |