This patch adds support for two new variants of the vectorize_width pragma: 1. vectorize_width(X[, fixed|scalable]) where an optional second parameter is passed to the vectorize_width pragma, which indicates if the user wishes to use fixed width or scalable vectorization. For example the user can now write something like: #pragma clang loop vectorize_width(4, fixed) or #pragma clang loop vectorize_width(4, scalable) In the absence of a second parameter it is assumed the user wants fixed width vectorization, in order to maintain compatibility with existing code. 2. vectorize_width(fixed|scalable) where the width is left unspecified, but the user hints what type of vectorization they prefer, either fixed width or scalable. I have implemented this by making use of the LLVM loop hint attribute: llvm.loop.vectorize.scalable.enable Tests were added to clang/test/CodeGenCXX/pragma-loop.cpp for both the 'fixed' and 'scalable' optional parameter. See this thread for context: http://lists.llvm.org/pipermail/cfe-dev/2020-November/067262.html Differential Revision: https://reviews.llvm.org/D89031
100 lines
2.6 KiB
C++
100 lines
2.6 KiB
C++
// RUN: %clang_cc1 -ast-print %s -o - | FileCheck %s
|
|
// RUN: %clang_cc1 -DMS_EXT -fsyntax-only -fms-extensions %s -triple x86_64-pc-win32 -ast-print | FileCheck %s --check-prefix=MS-EXT
|
|
|
|
// CHECK: #pragma clang loop vectorize_width(4)
|
|
// CHECK-NEXT: #pragma clang loop interleave_count(8){{$}}
|
|
|
|
void test(int *List, int Length) {
|
|
int i = 0;
|
|
#pragma clang loop vectorize_width(4)
|
|
#pragma clang loop interleave_count(8)
|
|
// CHECK-NEXT: while (i < Length)
|
|
while (i < Length) {
|
|
List[i] = i * 2;
|
|
i++;
|
|
}
|
|
i = 0;
|
|
|
|
// CHECK: #pragma clang loop vectorize_width(4, scalable)
|
|
|
|
#pragma clang loop vectorize_width(4, scalable)
|
|
// CHECK-NEXT: while (i < Length)
|
|
while (i < Length) {
|
|
List[i] = i * 2;
|
|
i++;
|
|
}
|
|
i = 0;
|
|
|
|
// CHECK: #pragma clang loop vectorize_width(fixed)
|
|
|
|
#pragma clang loop vectorize_width(fixed)
|
|
// CHECK-NEXT: while (i < Length)
|
|
while (i < Length) {
|
|
List[i] = i * 2;
|
|
i++;
|
|
}
|
|
i = 0;
|
|
|
|
// CHECK: #pragma clang loop vectorize_width(scalable)
|
|
|
|
#pragma clang loop vectorize_width(scalable)
|
|
// CHECK-NEXT: while (i < Length)
|
|
while (i < Length) {
|
|
List[i] = i * 2;
|
|
i++;
|
|
}
|
|
|
|
// CHECK: #pragma clang loop distribute(disable)
|
|
// CHECK-NEXT: #pragma clang loop vectorize(enable)
|
|
// CHECK-NEXT: #pragma clang loop interleave(disable)
|
|
// CHECK-NEXT: #pragma clang loop vectorize_predicate(disable)
|
|
|
|
#pragma clang loop distribute(disable)
|
|
#pragma clang loop vectorize(enable)
|
|
#pragma clang loop interleave(disable)
|
|
#pragma clang loop vectorize_predicate(disable)
|
|
// CHECK-NEXT: while (i - 1 < Length)
|
|
while (i - 1 < Length) {
|
|
List[i] = i * 2;
|
|
i++;
|
|
}
|
|
|
|
// CHECK: #pragma clang loop distribute(enable)
|
|
// CHECK-NEXT: #pragma clang loop vectorize(disable)
|
|
// CHECK-NEXT: #pragma clang loop interleave(enable)
|
|
// CHECK-NEXT: #pragma clang loop vectorize_predicate(enable)
|
|
|
|
#pragma clang loop distribute(enable)
|
|
#pragma clang loop vectorize(disable)
|
|
#pragma clang loop interleave(enable)
|
|
#pragma clang loop vectorize_predicate(enable)
|
|
// CHECK-NEXT: while (i - 2 < Length)
|
|
while (i - 2 < Length) {
|
|
List[i] = i * 2;
|
|
i++;
|
|
}
|
|
}
|
|
|
|
template <int V, int I>
|
|
void test_nontype_template_param(int *List, int Length) {
|
|
#pragma clang loop vectorize_width(V) interleave_count(I)
|
|
for (int i = 0; i < Length; i++) {
|
|
List[i] = i;
|
|
}
|
|
}
|
|
|
|
// CHECK: #pragma clang loop vectorize_width(V)
|
|
// CHECK: #pragma clang loop interleave_count(I)
|
|
|
|
void test_templates(int *List, int Length) {
|
|
test_nontype_template_param<2, 4>(List, Length);
|
|
}
|
|
|
|
#ifdef MS_EXT
|
|
#pragma init_seg(compiler)
|
|
// MS-EXT: #pragma init_seg (.CRT$XCC){{$}}
|
|
// MS-EXT-NEXT: int x = 3 __declspec(thread);
|
|
int __declspec(thread) x = 3;
|
|
#endif //MS_EXT
|
|
|