110 | 446k | } 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 | 76.2k | uint32_t* JXL_RESTRICT out) { | 45 | 76.2k | const HWY_FULL(uint32_t) du; | 46 | 76.2k | const HWY_FULL(float) df; | 47 | 76.2k | const auto kZero = Zero(du); | 48 | 76.2k | const auto kSplit = Set(du, 1 << E); | 49 | 76.2k | const auto kExpOffset = Set(du, 127); | 50 | 76.2k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 76.2k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 76.2k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 76.2k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 76.2k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 76.2k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 76.2k | constexpr size_t kLargeShiftVal = 10; | 57 | 76.2k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 76.2k | auto extra_bits = kZero; | 60 | 76.2k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 12.7M | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 12.6M | const auto val = LoadU(du, values + i); | 63 | 12.6M | const auto is_large = Gt(val, kLargeThreshold); | 64 | 12.6M | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 12.6M | const auto not_literal = Ge(val, kSplit); | 66 | 12.6M | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 12.6M | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 12.6M | const auto l = And(val, kMaskL); | 69 | 12.6M | const auto exp = ShiftRight<23>(b); | 70 | 12.6M | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 12.6M | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 12.6M | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 12.6M | const auto m = ShiftRight<23 - M - L>(b); | 74 | 12.6M | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 12.6M | const auto d = And(m, kMaskM); | 76 | 12.6M | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 12.6M | const auto c = Or(a, l); | 78 | 12.6M | extra_bits = Add(extra_bits, eb_fixed); | 79 | 12.6M | const auto t = Or(c, d); | 80 | 12.6M | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 12.6M | Store(t_fixed, du, out + i); | 82 | 12.6M | } | 83 | 76.2k | if (last_full < len) { | 84 | 66.0k | const auto stop = Set(du, len); | 85 | 66.0k | const auto fence = Iota(du, last_full); | 86 | 66.0k | const auto take = Lt(fence, stop); | 87 | 66.0k | const auto val = LoadU(du, values + last_full); | 88 | 66.0k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 66.0k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 66.0k | const auto not_literal = Ge(val, kSplit); | 91 | 66.0k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 66.0k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 66.0k | const auto l = And(val, kMaskL); | 94 | 66.0k | const auto exp = ShiftRight<23>(b); | 95 | 66.0k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 66.0k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 66.0k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 66.0k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 66.0k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 66.0k | const auto d = And(m, kMaskM); | 101 | 66.0k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 66.0k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 66.0k | const auto c = Or(a, l); | 104 | 66.0k | extra_bits = Add(extra_bits, eb_masked); | 105 | 66.0k | const auto t = Or(c, d); | 106 | 66.0k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 66.0k | Store(t_fixed, du, out + last_full); | 108 | 66.0k | } | 109 | 76.2k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 76.2k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<2ul, 0ul, 1ul>(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.7M | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 12.6M | const auto val = LoadU(du, values + i); | 63 | 12.6M | const auto is_large = Gt(val, kLargeThreshold); | 64 | 12.6M | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 12.6M | const auto not_literal = Ge(val, kSplit); | 66 | 12.6M | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 12.6M | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 12.6M | const auto l = And(val, kMaskL); | 69 | 12.6M | const auto exp = ShiftRight<23>(b); | 70 | 12.6M | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 12.6M | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 12.6M | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 12.6M | const auto m = ShiftRight<23 - M - L>(b); | 74 | 12.6M | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 12.6M | const auto d = And(m, kMaskM); | 76 | 12.6M | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 12.6M | const auto c = Or(a, l); | 78 | 12.6M | extra_bits = Add(extra_bits, eb_fixed); | 79 | 12.6M | const auto t = Or(c, d); | 80 | 12.6M | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 12.6M | Store(t_fixed, du, out + i); | 82 | 12.6M | } | 83 | 75.7k | if (last_full < len) { | 84 | 65.5k | const auto stop = Set(du, len); | 85 | 65.5k | const auto fence = Iota(du, last_full); | 86 | 65.5k | const auto take = Lt(fence, stop); | 87 | 65.5k | const auto val = LoadU(du, values + last_full); | 88 | 65.5k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 65.5k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 65.5k | const auto not_literal = Ge(val, kSplit); | 91 | 65.5k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 65.5k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 65.5k | const auto l = And(val, kMaskL); | 94 | 65.5k | const auto exp = ShiftRight<23>(b); | 95 | 65.5k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 65.5k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 65.5k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 65.5k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 65.5k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 65.5k | const auto d = And(m, kMaskM); | 101 | 65.5k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 65.5k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 65.5k | const auto c = Or(a, l); | 104 | 65.5k | extra_bits = Add(extra_bits, eb_masked); | 105 | 65.5k | const auto t = Or(c, d); | 106 | 65.5k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 65.5k | Store(t_fixed, du, out + last_full); | 108 | 65.5k | } | 109 | 75.7k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 75.7k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<3ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<3ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<3ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<3ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 1ul, 2ul>(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.7M | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 12.6M | const auto val = LoadU(du, values + i); | 63 | 12.6M | const auto is_large = Gt(val, kLargeThreshold); | 64 | 12.6M | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 12.6M | const auto not_literal = Ge(val, kSplit); | 66 | 12.6M | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 12.6M | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 12.6M | const auto l = And(val, kMaskL); | 69 | 12.6M | const auto exp = ShiftRight<23>(b); | 70 | 12.6M | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 12.6M | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 12.6M | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 12.6M | const auto m = ShiftRight<23 - M - L>(b); | 74 | 12.6M | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 12.6M | const auto d = And(m, kMaskM); | 76 | 12.6M | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 12.6M | const auto c = Or(a, l); | 78 | 12.6M | extra_bits = Add(extra_bits, eb_fixed); | 79 | 12.6M | const auto t = Or(c, d); | 80 | 12.6M | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 12.6M | Store(t_fixed, du, out + i); | 82 | 12.6M | } | 83 | 75.7k | if (last_full < len) { | 84 | 65.5k | const auto stop = Set(du, len); | 85 | 65.5k | const auto fence = Iota(du, last_full); | 86 | 65.5k | const auto take = Lt(fence, stop); | 87 | 65.5k | const auto val = LoadU(du, values + last_full); | 88 | 65.5k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 65.5k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 65.5k | const auto not_literal = Ge(val, kSplit); | 91 | 65.5k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 65.5k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 65.5k | const auto l = And(val, kMaskL); | 94 | 65.5k | const auto exp = ShiftRight<23>(b); | 95 | 65.5k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 65.5k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 65.5k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 65.5k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 65.5k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 65.5k | const auto d = And(m, kMaskM); | 101 | 65.5k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 65.5k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 65.5k | const auto c = Or(a, l); | 104 | 65.5k | extra_bits = Add(extra_bits, eb_masked); | 105 | 65.5k | const auto t = Or(c, d); | 106 | 65.5k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 65.5k | Store(t_fixed, du, out + last_full); | 108 | 65.5k | } | 109 | 75.7k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 75.7k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 1ul, 3ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 2ul, 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.7M | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 12.6M | const auto val = LoadU(du, values + i); | 63 | 12.6M | const auto is_large = Gt(val, kLargeThreshold); | 64 | 12.6M | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 12.6M | const auto not_literal = Ge(val, kSplit); | 66 | 12.6M | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 12.6M | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 12.6M | const auto l = And(val, kMaskL); | 69 | 12.6M | const auto exp = ShiftRight<23>(b); | 70 | 12.6M | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 12.6M | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 12.6M | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 12.6M | const auto m = ShiftRight<23 - M - L>(b); | 74 | 12.6M | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 12.6M | const auto d = And(m, kMaskM); | 76 | 12.6M | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 12.6M | const auto c = Or(a, l); | 78 | 12.6M | extra_bits = Add(extra_bits, eb_fixed); | 79 | 12.6M | const auto t = Or(c, d); | 80 | 12.6M | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 12.6M | Store(t_fixed, du, out + i); | 82 | 12.6M | } | 83 | 75.7k | if (last_full < len) { | 84 | 65.5k | const auto stop = Set(du, len); | 85 | 65.5k | const auto fence = Iota(du, last_full); | 86 | 65.5k | const auto take = Lt(fence, stop); | 87 | 65.5k | const auto val = LoadU(du, values + last_full); | 88 | 65.5k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 65.5k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 65.5k | const auto not_literal = Ge(val, kSplit); | 91 | 65.5k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 65.5k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 65.5k | const auto l = And(val, kMaskL); | 94 | 65.5k | const auto exp = ShiftRight<23>(b); | 95 | 65.5k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 65.5k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 65.5k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 65.5k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 65.5k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 65.5k | const auto d = And(m, kMaskM); | 101 | 65.5k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 65.5k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 65.5k | const auto c = Or(a, l); | 104 | 65.5k | extra_bits = Add(extra_bits, eb_masked); | 105 | 65.5k | const auto t = Or(c, d); | 106 | 65.5k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 65.5k | Store(t_fixed, du, out + last_full); | 108 | 65.5k | } | 109 | 75.7k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 75.7k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<4ul, 2ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 1ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 1ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 1ul, 4ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.38k | uint32_t* JXL_RESTRICT out) { | 45 | 6.38k | const HWY_FULL(uint32_t) du; | 46 | 6.38k | const HWY_FULL(float) df; | 47 | 6.38k | const auto kZero = Zero(du); | 48 | 6.38k | const auto kSplit = Set(du, 1 << E); | 49 | 6.38k | const auto kExpOffset = Set(du, 127); | 50 | 6.38k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.38k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.38k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.38k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.38k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.38k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.38k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.38k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.38k | auto extra_bits = kZero; | 60 | 6.38k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.38k | if (last_full < len) { | 84 | 5.38k | const auto stop = Set(du, len); | 85 | 5.38k | const auto fence = Iota(du, last_full); | 86 | 5.38k | const auto take = Lt(fence, stop); | 87 | 5.38k | const auto val = LoadU(du, values + last_full); | 88 | 5.38k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.38k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.38k | const auto not_literal = Ge(val, kSplit); | 91 | 5.38k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.38k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.38k | const auto l = And(val, kMaskL); | 94 | 5.38k | const auto exp = ShiftRight<23>(b); | 95 | 5.38k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.38k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.38k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.38k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.38k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.38k | const auto d = And(m, kMaskM); | 101 | 5.38k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.38k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.38k | const auto c = Or(a, l); | 104 | 5.38k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.38k | const auto t = Or(c, d); | 106 | 5.38k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.38k | Store(t_fixed, du, out + last_full); | 108 | 5.38k | } | 109 | 6.38k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.38k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 2ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 2ul, 1ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 2ul, 2ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<5ul, 2ul, 3ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.38k | uint32_t* JXL_RESTRICT out) { | 45 | 6.38k | const HWY_FULL(uint32_t) du; | 46 | 6.38k | const HWY_FULL(float) df; | 47 | 6.38k | const auto kZero = Zero(du); | 48 | 6.38k | const auto kSplit = Set(du, 1 << E); | 49 | 6.38k | const auto kExpOffset = Set(du, 127); | 50 | 6.38k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.38k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.38k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.38k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.38k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.38k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.38k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.38k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.38k | auto extra_bits = kZero; | 60 | 6.38k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.38k | if (last_full < len) { | 84 | 5.38k | const auto stop = Set(du, len); | 85 | 5.38k | const auto fence = Iota(du, last_full); | 86 | 5.38k | const auto take = Lt(fence, stop); | 87 | 5.38k | const auto val = LoadU(du, values + last_full); | 88 | 5.38k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.38k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.38k | const auto not_literal = Ge(val, kSplit); | 91 | 5.38k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.38k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.38k | const auto l = And(val, kMaskL); | 94 | 5.38k | const auto exp = ShiftRight<23>(b); | 95 | 5.38k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.38k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.38k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.38k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.38k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.38k | const auto d = And(m, kMaskM); | 101 | 5.38k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.38k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.38k | const auto c = Or(a, l); | 104 | 5.38k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.38k | const auto t = Or(c, d); | 106 | 5.38k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.38k | Store(t_fixed, du, out + last_full); | 108 | 5.38k | } | 109 | 6.38k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.38k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<6ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<6ul, 1ul, 5ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 5.47k | uint32_t* JXL_RESTRICT out) { | 45 | 5.47k | const HWY_FULL(uint32_t) du; | 46 | 5.47k | const HWY_FULL(float) df; | 47 | 5.47k | const auto kZero = Zero(du); | 48 | 5.47k | const auto kSplit = Set(du, 1 << E); | 49 | 5.47k | const auto kExpOffset = Set(du, 127); | 50 | 5.47k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 5.47k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 5.47k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 5.47k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 5.47k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 5.47k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 5.47k | constexpr size_t kLargeShiftVal = 10; | 57 | 5.47k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 5.47k | auto extra_bits = kZero; | 60 | 5.47k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 348k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 342k | const auto val = LoadU(du, values + i); | 63 | 342k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 342k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 342k | const auto not_literal = Ge(val, kSplit); | 66 | 342k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 342k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 342k | const auto l = And(val, kMaskL); | 69 | 342k | const auto exp = ShiftRight<23>(b); | 70 | 342k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 342k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 342k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 342k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 342k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 342k | const auto d = And(m, kMaskM); | 76 | 342k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 342k | const auto c = Or(a, l); | 78 | 342k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 342k | const auto t = Or(c, d); | 80 | 342k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 342k | Store(t_fixed, du, out + i); | 82 | 342k | } | 83 | 5.47k | if (last_full < len) { | 84 | 4.65k | const auto stop = Set(du, len); | 85 | 4.65k | const auto fence = Iota(du, last_full); | 86 | 4.65k | const auto take = Lt(fence, stop); | 87 | 4.65k | const auto val = LoadU(du, values + last_full); | 88 | 4.65k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 4.65k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 4.65k | const auto not_literal = Ge(val, kSplit); | 91 | 4.65k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 4.65k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 4.65k | const auto l = And(val, kMaskL); | 94 | 4.65k | const auto exp = ShiftRight<23>(b); | 95 | 4.65k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 4.65k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 4.65k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 4.65k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 4.65k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 4.65k | const auto d = And(m, kMaskM); | 101 | 4.65k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 4.65k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 4.65k | const auto c = Or(a, l); | 104 | 4.65k | extra_bits = Add(extra_bits, eb_masked); | 105 | 4.65k | const auto t = Or(c, d); | 106 | 4.65k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 4.65k | Store(t_fixed, du, out + last_full); | 108 | 4.65k | } | 109 | 5.47k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 5.47k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<6ul, 2ul, 4ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 5.47k | uint32_t* JXL_RESTRICT out) { | 45 | 5.47k | const HWY_FULL(uint32_t) du; | 46 | 5.47k | const HWY_FULL(float) df; | 47 | 5.47k | const auto kZero = Zero(du); | 48 | 5.47k | const auto kSplit = Set(du, 1 << E); | 49 | 5.47k | const auto kExpOffset = Set(du, 127); | 50 | 5.47k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 5.47k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 5.47k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 5.47k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 5.47k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 5.47k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 5.47k | constexpr size_t kLargeShiftVal = 10; | 57 | 5.47k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 5.47k | auto extra_bits = kZero; | 60 | 5.47k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 348k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 342k | const auto val = LoadU(du, values + i); | 63 | 342k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 342k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 342k | const auto not_literal = Ge(val, kSplit); | 66 | 342k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 342k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 342k | const auto l = And(val, kMaskL); | 69 | 342k | const auto exp = ShiftRight<23>(b); | 70 | 342k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 342k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 342k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 342k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 342k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 342k | const auto d = And(m, kMaskM); | 76 | 342k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 342k | const auto c = Or(a, l); | 78 | 342k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 342k | const auto t = Or(c, d); | 80 | 342k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 342k | Store(t_fixed, du, out + i); | 82 | 342k | } | 83 | 5.47k | if (last_full < len) { | 84 | 4.65k | const auto stop = Set(du, len); | 85 | 4.65k | const auto fence = Iota(du, last_full); | 86 | 4.65k | const auto take = Lt(fence, stop); | 87 | 4.65k | const auto val = LoadU(du, values + last_full); | 88 | 4.65k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 4.65k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 4.65k | const auto not_literal = Ge(val, kSplit); | 91 | 4.65k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 4.65k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 4.65k | const auto l = And(val, kMaskL); | 94 | 4.65k | const auto exp = ShiftRight<23>(b); | 95 | 4.65k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 4.65k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 4.65k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 4.65k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 4.65k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 4.65k | const auto d = And(m, kMaskM); | 101 | 4.65k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 4.65k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 4.65k | const auto c = Or(a, l); | 104 | 4.65k | extra_bits = Add(extra_bits, eb_masked); | 105 | 4.65k | const auto t = Or(c, d); | 106 | 4.65k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 4.65k | Store(t_fixed, du, out + last_full); | 108 | 4.65k | } | 109 | 5.47k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 5.47k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<7ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 6.39k | uint32_t* JXL_RESTRICT out) { | 45 | 6.39k | const HWY_FULL(uint32_t) du; | 46 | 6.39k | const HWY_FULL(float) df; | 47 | 6.39k | const auto kZero = Zero(du); | 48 | 6.39k | const auto kSplit = Set(du, 1 << E); | 49 | 6.39k | const auto kExpOffset = Set(du, 127); | 50 | 6.39k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 6.39k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 6.39k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 6.39k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 6.39k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 6.39k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 6.39k | constexpr size_t kLargeShiftVal = 10; | 57 | 6.39k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 6.39k | auto extra_bits = kZero; | 60 | 6.39k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 684k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 677k | const auto val = LoadU(du, values + i); | 63 | 677k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 677k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 677k | const auto not_literal = Ge(val, kSplit); | 66 | 677k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 677k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 677k | const auto l = And(val, kMaskL); | 69 | 677k | const auto exp = ShiftRight<23>(b); | 70 | 677k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 677k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 677k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 677k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 677k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 677k | const auto d = And(m, kMaskM); | 76 | 677k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 677k | const auto c = Or(a, l); | 78 | 677k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 677k | const auto t = Or(c, d); | 80 | 677k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 677k | Store(t_fixed, du, out + i); | 82 | 677k | } | 83 | 6.39k | if (last_full < len) { | 84 | 5.39k | const auto stop = Set(du, len); | 85 | 5.39k | const auto fence = Iota(du, last_full); | 86 | 5.39k | const auto take = Lt(fence, stop); | 87 | 5.39k | const auto val = LoadU(du, values + last_full); | 88 | 5.39k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 5.39k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 5.39k | const auto not_literal = Ge(val, kSplit); | 91 | 5.39k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 5.39k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 5.39k | const auto l = And(val, kMaskL); | 94 | 5.39k | const auto exp = ShiftRight<23>(b); | 95 | 5.39k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 5.39k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 5.39k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 5.39k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 5.39k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 5.39k | const auto d = And(m, kMaskM); | 101 | 5.39k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 5.39k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 5.39k | const auto c = Or(a, l); | 104 | 5.39k | extra_bits = Add(extra_bits, eb_masked); | 105 | 5.39k | const auto t = Or(c, d); | 106 | 5.39k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 5.39k | Store(t_fixed, du, out + last_full); | 108 | 5.39k | } | 109 | 6.39k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 6.39k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<8ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 4.71k | uint32_t* JXL_RESTRICT out) { | 45 | 4.71k | const HWY_FULL(uint32_t) du; | 46 | 4.71k | const HWY_FULL(float) df; | 47 | 4.71k | const auto kZero = Zero(du); | 48 | 4.71k | const auto kSplit = Set(du, 1 << E); | 49 | 4.71k | const auto kExpOffset = Set(du, 127); | 50 | 4.71k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 4.71k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 4.71k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 4.71k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 4.71k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 4.71k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 4.71k | constexpr size_t kLargeShiftVal = 10; | 57 | 4.71k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 4.71k | auto extra_bits = kZero; | 60 | 4.71k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 317k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 313k | const auto val = LoadU(du, values + i); | 63 | 313k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 313k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 313k | const auto not_literal = Ge(val, kSplit); | 66 | 313k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 313k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 313k | const auto l = And(val, kMaskL); | 69 | 313k | const auto exp = ShiftRight<23>(b); | 70 | 313k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 313k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 313k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 313k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 313k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 313k | const auto d = And(m, kMaskM); | 76 | 313k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 313k | const auto c = Or(a, l); | 78 | 313k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 313k | const auto t = Or(c, d); | 80 | 313k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 313k | Store(t_fixed, du, out + i); | 82 | 313k | } | 83 | 4.71k | if (last_full < len) { | 84 | 3.96k | const auto stop = Set(du, len); | 85 | 3.96k | const auto fence = Iota(du, last_full); | 86 | 3.96k | const auto take = Lt(fence, stop); | 87 | 3.96k | const auto val = LoadU(du, values + last_full); | 88 | 3.96k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 3.96k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 3.96k | const auto not_literal = Ge(val, kSplit); | 91 | 3.96k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 3.96k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 3.96k | const auto l = And(val, kMaskL); | 94 | 3.96k | const auto exp = ShiftRight<23>(b); | 95 | 3.96k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 3.96k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 3.96k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 3.96k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 3.96k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 3.96k | const auto d = And(m, kMaskM); | 101 | 3.96k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 3.96k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 3.96k | const auto c = Or(a, l); | 104 | 3.96k | extra_bits = Add(extra_bits, eb_masked); | 105 | 3.96k | const auto t = Or(c, d); | 106 | 3.96k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 3.96k | Store(t_fixed, du, out + last_full); | 108 | 3.96k | } | 109 | 4.71k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 4.71k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<9ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 4.71k | uint32_t* JXL_RESTRICT out) { | 45 | 4.71k | const HWY_FULL(uint32_t) du; | 46 | 4.71k | const HWY_FULL(float) df; | 47 | 4.71k | const auto kZero = Zero(du); | 48 | 4.71k | const auto kSplit = Set(du, 1 << E); | 49 | 4.71k | const auto kExpOffset = Set(du, 127); | 50 | 4.71k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 4.71k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 4.71k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 4.71k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 4.71k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 4.71k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 4.71k | constexpr size_t kLargeShiftVal = 10; | 57 | 4.71k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 4.71k | auto extra_bits = kZero; | 60 | 4.71k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 317k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 313k | const auto val = LoadU(du, values + i); | 63 | 313k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 313k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 313k | const auto not_literal = Ge(val, kSplit); | 66 | 313k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 313k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 313k | const auto l = And(val, kMaskL); | 69 | 313k | const auto exp = ShiftRight<23>(b); | 70 | 313k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 313k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 313k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 313k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 313k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 313k | const auto d = And(m, kMaskM); | 76 | 313k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 313k | const auto c = Or(a, l); | 78 | 313k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 313k | const auto t = Or(c, d); | 80 | 313k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 313k | Store(t_fixed, du, out + i); | 82 | 313k | } | 83 | 4.71k | if (last_full < len) { | 84 | 3.96k | const auto stop = Set(du, len); | 85 | 3.96k | const auto fence = Iota(du, last_full); | 86 | 3.96k | const auto take = Lt(fence, stop); | 87 | 3.96k | const auto val = LoadU(du, values + last_full); | 88 | 3.96k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 3.96k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 3.96k | const auto not_literal = Ge(val, kSplit); | 91 | 3.96k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 3.96k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 3.96k | const auto l = And(val, kMaskL); | 94 | 3.96k | const auto exp = ShiftRight<23>(b); | 95 | 3.96k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 3.96k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 3.96k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 3.96k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 3.96k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 3.96k | const auto d = And(m, kMaskM); | 101 | 3.96k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 3.96k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 3.96k | const auto c = Or(a, l); | 104 | 3.96k | extra_bits = Add(extra_bits, eb_masked); | 105 | 3.96k | const auto t = Or(c, d); | 106 | 3.96k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 3.96k | Store(t_fixed, du, out + last_full); | 108 | 3.96k | } | 109 | 4.71k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 4.71k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<10ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 4.71k | uint32_t* JXL_RESTRICT out) { | 45 | 4.71k | const HWY_FULL(uint32_t) du; | 46 | 4.71k | const HWY_FULL(float) df; | 47 | 4.71k | const auto kZero = Zero(du); | 48 | 4.71k | const auto kSplit = Set(du, 1 << E); | 49 | 4.71k | const auto kExpOffset = Set(du, 127); | 50 | 4.71k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 4.71k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 4.71k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 4.71k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 4.71k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 4.71k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 4.71k | constexpr size_t kLargeShiftVal = 10; | 57 | 4.71k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 4.71k | auto extra_bits = kZero; | 60 | 4.71k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 317k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 313k | const auto val = LoadU(du, values + i); | 63 | 313k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 313k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 313k | const auto not_literal = Ge(val, kSplit); | 66 | 313k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 313k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 313k | const auto l = And(val, kMaskL); | 69 | 313k | const auto exp = ShiftRight<23>(b); | 70 | 313k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 313k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 313k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 313k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 313k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 313k | const auto d = And(m, kMaskM); | 76 | 313k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 313k | const auto c = Or(a, l); | 78 | 313k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 313k | const auto t = Or(c, d); | 80 | 313k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 313k | Store(t_fixed, du, out + i); | 82 | 313k | } | 83 | 4.71k | if (last_full < len) { | 84 | 3.96k | const auto stop = Set(du, len); | 85 | 3.96k | const auto fence = Iota(du, last_full); | 86 | 3.96k | const auto take = Lt(fence, stop); | 87 | 3.96k | const auto val = LoadU(du, values + last_full); | 88 | 3.96k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 3.96k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 3.96k | const auto not_literal = Ge(val, kSplit); | 91 | 3.96k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 3.96k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 3.96k | const auto l = And(val, kMaskL); | 94 | 3.96k | const auto exp = ShiftRight<23>(b); | 95 | 3.96k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 3.96k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 3.96k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 3.96k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 3.96k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 3.96k | const auto d = And(m, kMaskM); | 101 | 3.96k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 3.96k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 3.96k | const auto c = Or(a, l); | 104 | 3.96k | extra_bits = Add(extra_bits, eb_masked); | 105 | 3.96k | const auto t = Or(c, d); | 106 | 3.96k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 3.96k | Store(t_fixed, du, out + last_full); | 108 | 3.96k | } | 109 | 4.71k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 4.71k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<11ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 4.71k | uint32_t* JXL_RESTRICT out) { | 45 | 4.71k | const HWY_FULL(uint32_t) du; | 46 | 4.71k | const HWY_FULL(float) df; | 47 | 4.71k | const auto kZero = Zero(du); | 48 | 4.71k | const auto kSplit = Set(du, 1 << E); | 49 | 4.71k | const auto kExpOffset = Set(du, 127); | 50 | 4.71k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 4.71k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 4.71k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 4.71k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 4.71k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 4.71k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 4.71k | constexpr size_t kLargeShiftVal = 10; | 57 | 4.71k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 4.71k | auto extra_bits = kZero; | 60 | 4.71k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 317k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 313k | const auto val = LoadU(du, values + i); | 63 | 313k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 313k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 313k | const auto not_literal = Ge(val, kSplit); | 66 | 313k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 313k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 313k | const auto l = And(val, kMaskL); | 69 | 313k | const auto exp = ShiftRight<23>(b); | 70 | 313k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 313k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 313k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 313k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 313k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 313k | const auto d = And(m, kMaskM); | 76 | 313k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 313k | const auto c = Or(a, l); | 78 | 313k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 313k | const auto t = Or(c, d); | 80 | 313k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 313k | Store(t_fixed, du, out + i); | 82 | 313k | } | 83 | 4.71k | if (last_full < len) { | 84 | 3.96k | const auto stop = Set(du, len); | 85 | 3.96k | const auto fence = Iota(du, last_full); | 86 | 3.96k | const auto take = Lt(fence, stop); | 87 | 3.96k | const auto val = LoadU(du, values + last_full); | 88 | 3.96k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 3.96k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 3.96k | const auto not_literal = Ge(val, kSplit); | 91 | 3.96k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 3.96k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 3.96k | const auto l = And(val, kMaskL); | 94 | 3.96k | const auto exp = ShiftRight<23>(b); | 95 | 3.96k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 3.96k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 3.96k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 3.96k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 3.96k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 3.96k | const auto d = And(m, kMaskM); | 101 | 3.96k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 3.96k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 3.96k | const auto c = Or(a, l); | 104 | 3.96k | extra_bits = Add(extra_bits, eb_masked); | 105 | 3.96k | const auto t = Or(c, d); | 106 | 3.96k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 3.96k | Store(t_fixed, du, out + last_full); | 108 | 3.96k | } | 109 | 4.71k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 4.71k | } |
unsigned int jxl::N_AVX2::EstimateTokenCostImpl<12ul, 0ul, 0ul>(unsigned int*, unsigned long, unsigned int*) Line | Count | Source | 44 | 4.71k | uint32_t* JXL_RESTRICT out) { | 45 | 4.71k | const HWY_FULL(uint32_t) du; | 46 | 4.71k | const HWY_FULL(float) df; | 47 | 4.71k | const auto kZero = Zero(du); | 48 | 4.71k | const auto kSplit = Set(du, 1 << E); | 49 | 4.71k | const auto kExpOffset = Set(du, 127); | 50 | 4.71k | const auto kEBOffset = Set(du, 127 + M + L); | 51 | 4.71k | const auto kBase = Set(du, static_cast<uint32_t>((1 << E) - (E << (M + L)))); | 52 | 4.71k | const auto kMulN = Set(du, 1 << (M + L)); | 53 | 4.71k | const auto kMaskL = Set(du, (1 << L) - 1); | 54 | 4.71k | const auto kMaskM = Set(du, ((1 << M) - 1) << L); | 55 | 4.71k | const auto kLargeThreshold = Set(du, (1 << 22) - 1); | 56 | 4.71k | constexpr size_t kLargeShiftVal = 10; | 57 | 4.71k | const auto kLargeShift = Set(du, kLargeShiftVal); | 58 | | | 59 | 4.71k | auto extra_bits = kZero; | 60 | 4.71k | size_t last_full = Lanes(du) * (len / Lanes(du)); | 61 | 317k | for (size_t i = 0; i < last_full; i += Lanes(du)) { | 62 | 313k | const auto val = LoadU(du, values + i); | 63 | 313k | const auto is_large = Gt(val, kLargeThreshold); | 64 | 313k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 65 | 313k | const auto not_literal = Ge(val, kSplit); | 66 | 313k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 67 | 313k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 68 | 313k | const auto l = And(val, kMaskL); | 69 | 313k | const auto exp = ShiftRight<23>(b); | 70 | 313k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 71 | 313k | const auto n = Sub(exp_fixed, kExpOffset); | 72 | 313k | const auto eb = Sub(exp_fixed, kEBOffset); | 73 | 313k | const auto m = ShiftRight<23 - M - L>(b); | 74 | 313k | const auto a = Add(kBase, Mul(n, kMulN)); | 75 | 313k | const auto d = And(m, kMaskM); | 76 | 313k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 77 | 313k | const auto c = Or(a, l); | 78 | 313k | extra_bits = Add(extra_bits, eb_fixed); | 79 | 313k | const auto t = Or(c, d); | 80 | 313k | const auto t_fixed = IfThenElse(not_literal, t, val); | 81 | 313k | Store(t_fixed, du, out + i); | 82 | 313k | } | 83 | 4.71k | if (last_full < len) { | 84 | 3.96k | const auto stop = Set(du, len); | 85 | 3.96k | const auto fence = Iota(du, last_full); | 86 | 3.96k | const auto take = Lt(fence, stop); | 87 | 3.96k | const auto val = LoadU(du, values + last_full); | 88 | 3.96k | const auto is_large = Gt(val, kLargeThreshold); | 89 | 3.96k | const auto val_shifted = ShiftRight<kLargeShiftVal>(val); | 90 | 3.96k | const auto not_literal = Ge(val, kSplit); | 91 | 3.96k | const auto val_fixed = IfThenElse(is_large, val_shifted, val); | 92 | 3.96k | const auto b = BitCast(du, ConvertTo(df, val_fixed)); | 93 | 3.96k | const auto l = And(val, kMaskL); | 94 | 3.96k | const auto exp = ShiftRight<23>(b); | 95 | 3.96k | const auto exp_fixed = IfThenElse(is_large, Add(exp, kLargeShift), exp); | 96 | 3.96k | const auto n = Sub(exp_fixed, kExpOffset); | 97 | 3.96k | const auto eb = Sub(exp_fixed, kEBOffset); | 98 | 3.96k | const auto m = ShiftRight<23 - M - L>(b); | 99 | 3.96k | const auto a = Add(kBase, Mul(n, kMulN)); | 100 | 3.96k | const auto d = And(m, kMaskM); | 101 | 3.96k | const auto eb_fixed = IfThenElseZero(not_literal, eb); | 102 | 3.96k | const auto eb_masked = IfThenElseZero(take, eb_fixed); | 103 | 3.96k | const auto c = Or(a, l); | 104 | 3.96k | extra_bits = Add(extra_bits, eb_masked); | 105 | 3.96k | const auto t = Or(c, d); | 106 | 3.96k | const auto t_fixed = IfThenElse(not_literal, t, val); | 107 | 3.96k | Store(t_fixed, du, out + last_full); | 108 | 3.96k | } | 109 | 4.71k | return GetLane(SumOfLanes(du, extra_bits)); | 110 | 4.71k | } |
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*) |