@@ -76,7 +76,7 @@ extend(cpp::simd<T, N> x, cpp::index_sequence<Indices...>) {
7676template <typename T, size_t N, size_t TargetSize, size_t OriginalSize>
7777LIBC_INLINE constexpr static auto extend (cpp::simd<T, N> x) {
7878 // Recursively resize an input vector to the target size, increasing its size
79- // by at most double the input size each step.
79+ // by at most double the input size each step due to shufflevector limitation .
8080 if constexpr (N == TargetSize)
8181 return x;
8282 else if constexpr (TargetSize <= 2 * N)
@@ -115,12 +115,12 @@ template <typename T, size_t N, size_t Offset, size_t Head, size_t... Tail>
115115LIBC_INLINE constexpr static auto split (cpp::simd<T, N> x) {
116116 // Recursively splits the input vector by walking the variadic template list,
117117 // increasing our current head each call.
118- auto first = cpp::make_tuple (
118+ auto result = cpp::make_tuple (
119119 slice<T, N, Head, Offset>(x, cpp::make_index_sequence<Head>{}));
120120 if constexpr (sizeof ...(Tail) > 0 )
121- return cpp::tuple_cat (first , split<T, N, Offset + Head, Tail...>(x));
121+ return cpp::tuple_cat (result , split<T, N, Offset + Head, Tail...>(x));
122122 else
123- return first ;
123+ return result ;
124124}
125125
126126} // namespace internal
0 commit comments