// Copyright 2022 Google LLC // SPDX-License-Identifier: Apache-2.0 // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. #include "hwy/contrib/sort/vqsort.h" #undef HWY_TARGET_INCLUDE // clang-format off // (avoid line break, which would prevent Copybara rules from matching) #define HWY_TARGET_INCLUDE "hwy/contrib/sort/vqsort_kv64a.cc" //NOLINT // clang-format on #include "hwy/foreach_target.h" // IWYU pragma: keep // After foreach_target #include "hwy/contrib/sort/traits-inl.h" #include "hwy/contrib/sort/vqsort-inl.h" HWY_BEFORE_NAMESPACE(); namespace hwy { namespace HWY_NAMESPACE { void SortKV64Asc(uint64_t* HWY_RESTRICT keys, size_t num, uint64_t* HWY_RESTRICT buf) { #if VQSORT_ENABLED SortTag d; detail::SharedTraits> st; Sort(d, st, keys, num, buf); #else (void) keys; (void) num; (void) buf; HWY_ASSERT(0); #endif } // NOLINTNEXTLINE(google-readability-namespace-comments) } // namespace HWY_NAMESPACE } // namespace hwy HWY_AFTER_NAMESPACE(); #if HWY_ONCE namespace hwy { namespace { HWY_EXPORT(SortKV64Asc); } // namespace void Sorter::operator()(K32V32* HWY_RESTRICT keys, size_t n, SortAscending) const { HWY_DYNAMIC_DISPATCH(SortKV64Asc) (reinterpret_cast(keys), n, Get()); } } // namespace hwy #endif // HWY_ONCE