|
1 |
| -#ifndef LLVM_FRONTEND_OPENMP_COMPOUNDSPLITTERT_H |
2 |
| -#define LLVM_FRONTEND_OPENMP_COMPOUNDSPLITTERT_H |
| 1 | +//===- ConstructDecompositionT.h -- Decomposing compound constructs -------===// |
| 2 | +// |
| 3 | +// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 4 | +// See https://llvm.org/LICENSE.txt for license information. |
| 5 | +// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| 6 | +// |
| 7 | +//===----------------------------------------------------------------------===// |
| 8 | +// Given a compound construct with a set of clauses, generate the list of |
| 9 | +// constituent leaf constructs, each with a list of clauses that apply to it. |
| 10 | +// |
| 11 | +// Note: Clauses that are not originally present, but that are implied by the |
| 12 | +// OpenMP spec are materialized, and are present in the output. |
| 13 | +// |
| 14 | +// Note: Composite constructs will also be broken up into leaf constructs. |
| 15 | +// If composite constructs require processing as a whole, the lists of clauses |
| 16 | +// for each leaf constituent should be concatenated. |
| 17 | +//===----------------------------------------------------------------------===// |
| 18 | +#ifndef LLVM_FRONTEND_OPENMP_CONSTRUCTDECOMPOSITIONT_H |
| 19 | +#define LLVM_FRONTEND_OPENMP_CONSTRUCTDECOMPOSITIONT_H |
3 | 20 |
|
4 | 21 | #include "llvm/ADT/ArrayRef.h"
|
5 | 22 | #include "llvm/ADT/DenseMap.h"
|
@@ -982,4 +999,4 @@ template <typename C, typename H> bool ConstructDecompositionT<C, H>::split() {
|
982 | 999 |
|
983 | 1000 | } // namespace tomp
|
984 | 1001 |
|
985 |
| -#endif // LLVM_FRONTEND_OPENMP_COMPOUNDSPLITTERT_H |
| 1002 | +#endif // LLVM_FRONTEND_OPENMP_CONSTRUCTDECOMPOSITIONT_H |
0 commit comments