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