Eugene Zelenko | d1b2d22 | 2017-11-29 23:27:36 +0000 | [diff] [blame] | 1 | //===- OpenMPClause.cpp - Classes for OpenMP clauses ----------------------===// |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file implements the subclesses of Stmt class declared in OpenMPClause.h |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
| 14 | #include "clang/AST/OpenMPClause.h" |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 15 | #include "clang/AST/ASTContext.h" |
Eugene Zelenko | d1b2d22 | 2017-11-29 23:27:36 +0000 | [diff] [blame] | 16 | #include "clang/AST/Decl.h" |
Patrick Lyster | 074c3ae2 | 2018-10-18 14:28:23 +0000 | [diff] [blame] | 17 | #include "clang/AST/DeclOpenMP.h" |
Eugene Zelenko | d1b2d22 | 2017-11-29 23:27:36 +0000 | [diff] [blame] | 18 | #include "clang/Basic/LLVM.h" |
| 19 | #include "llvm/ADT/SmallPtrSet.h" |
| 20 | #include "llvm/Support/Casting.h" |
| 21 | #include "llvm/Support/ErrorHandling.h" |
| 22 | #include <algorithm> |
| 23 | #include <cassert> |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 24 | |
| 25 | using namespace clang; |
| 26 | |
| 27 | OMPClause::child_range OMPClause::children() { |
| 28 | switch (getClauseKind()) { |
| 29 | default: |
| 30 | break; |
| 31 | #define OPENMP_CLAUSE(Name, Class) \ |
| 32 | case OMPC_##Name: \ |
| 33 | return static_cast<Class *>(this)->children(); |
| 34 | #include "clang/Basic/OpenMPKinds.def" |
| 35 | } |
| 36 | llvm_unreachable("unknown OMPClause"); |
| 37 | } |
| 38 | |
Alexey Bataev | 3392d76 | 2016-02-16 11:18:12 +0000 | [diff] [blame] | 39 | OMPClauseWithPreInit *OMPClauseWithPreInit::get(OMPClause *C) { |
| 40 | auto *Res = OMPClauseWithPreInit::get(const_cast<const OMPClause *>(C)); |
| 41 | return Res ? const_cast<OMPClauseWithPreInit *>(Res) : nullptr; |
| 42 | } |
| 43 | |
| 44 | const OMPClauseWithPreInit *OMPClauseWithPreInit::get(const OMPClause *C) { |
| 45 | switch (C->getClauseKind()) { |
| 46 | case OMPC_schedule: |
| 47 | return static_cast<const OMPScheduleClause *>(C); |
| 48 | case OMPC_dist_schedule: |
| 49 | return static_cast<const OMPDistScheduleClause *>(C); |
Alexey Bataev | 417089f | 2016-02-17 13:19:37 +0000 | [diff] [blame] | 50 | case OMPC_firstprivate: |
| 51 | return static_cast<const OMPFirstprivateClause *>(C); |
Alexey Bataev | 005248a | 2016-02-25 05:25:57 +0000 | [diff] [blame] | 52 | case OMPC_lastprivate: |
| 53 | return static_cast<const OMPLastprivateClause *>(C); |
Alexey Bataev | 6120507 | 2016-03-02 04:57:40 +0000 | [diff] [blame] | 54 | case OMPC_reduction: |
| 55 | return static_cast<const OMPReductionClause *>(C); |
Alexey Bataev | 169d96a | 2017-07-18 20:17:46 +0000 | [diff] [blame] | 56 | case OMPC_task_reduction: |
| 57 | return static_cast<const OMPTaskReductionClause *>(C); |
Alexey Bataev | fa312f3 | 2017-07-21 18:48:21 +0000 | [diff] [blame] | 58 | case OMPC_in_reduction: |
| 59 | return static_cast<const OMPInReductionClause *>(C); |
Alexey Bataev | 78849fb | 2016-03-09 09:49:00 +0000 | [diff] [blame] | 60 | case OMPC_linear: |
| 61 | return static_cast<const OMPLinearClause *>(C); |
Arpith Chacko Jacob | fe4890a | 2017-01-18 20:40:48 +0000 | [diff] [blame] | 62 | case OMPC_if: |
| 63 | return static_cast<const OMPIfClause *>(C); |
Arpith Chacko Jacob | 33c849a | 2017-01-25 00:57:16 +0000 | [diff] [blame] | 64 | case OMPC_num_threads: |
| 65 | return static_cast<const OMPNumThreadsClause *>(C); |
Arpith Chacko Jacob | bc12634 | 2017-01-25 11:28:18 +0000 | [diff] [blame] | 66 | case OMPC_num_teams: |
| 67 | return static_cast<const OMPNumTeamsClause *>(C); |
Arpith Chacko Jacob | 7ecc0b7 | 2017-01-25 11:44:35 +0000 | [diff] [blame] | 68 | case OMPC_thread_limit: |
| 69 | return static_cast<const OMPThreadLimitClause *>(C); |
Alexey Bataev | 931e19b | 2017-10-02 16:32:39 +0000 | [diff] [blame] | 70 | case OMPC_device: |
| 71 | return static_cast<const OMPDeviceClause *>(C); |
Alexey Bataev | 3392d76 | 2016-02-16 11:18:12 +0000 | [diff] [blame] | 72 | case OMPC_default: |
| 73 | case OMPC_proc_bind: |
Alexey Bataev | 3392d76 | 2016-02-16 11:18:12 +0000 | [diff] [blame] | 74 | case OMPC_final: |
Alexey Bataev | 3392d76 | 2016-02-16 11:18:12 +0000 | [diff] [blame] | 75 | case OMPC_safelen: |
| 76 | case OMPC_simdlen: |
| 77 | case OMPC_collapse: |
| 78 | case OMPC_private: |
Alexey Bataev | 005248a | 2016-02-25 05:25:57 +0000 | [diff] [blame] | 79 | case OMPC_shared: |
Alexey Bataev | 005248a | 2016-02-25 05:25:57 +0000 | [diff] [blame] | 80 | case OMPC_aligned: |
| 81 | case OMPC_copyin: |
| 82 | case OMPC_copyprivate: |
| 83 | case OMPC_ordered: |
| 84 | case OMPC_nowait: |
| 85 | case OMPC_untied: |
| 86 | case OMPC_mergeable: |
| 87 | case OMPC_threadprivate: |
| 88 | case OMPC_flush: |
| 89 | case OMPC_read: |
| 90 | case OMPC_write: |
| 91 | case OMPC_update: |
| 92 | case OMPC_capture: |
| 93 | case OMPC_seq_cst: |
| 94 | case OMPC_depend: |
Alexey Bataev | 005248a | 2016-02-25 05:25:57 +0000 | [diff] [blame] | 95 | case OMPC_threads: |
| 96 | case OMPC_simd: |
| 97 | case OMPC_map: |
Alexey Bataev | 005248a | 2016-02-25 05:25:57 +0000 | [diff] [blame] | 98 | case OMPC_priority: |
| 99 | case OMPC_grainsize: |
| 100 | case OMPC_nogroup: |
| 101 | case OMPC_num_tasks: |
| 102 | case OMPC_hint: |
| 103 | case OMPC_defaultmap: |
| 104 | case OMPC_unknown: |
Alexey Bataev | e48a5fc | 2016-04-12 05:28:34 +0000 | [diff] [blame] | 105 | case OMPC_uniform: |
Samuel Antao | 661c090 | 2016-05-26 17:39:58 +0000 | [diff] [blame] | 106 | case OMPC_to: |
Samuel Antao | ec172c6 | 2016-05-26 17:49:04 +0000 | [diff] [blame] | 107 | case OMPC_from: |
Carlo Bertolli | 2404b17 | 2016-07-13 15:37:16 +0000 | [diff] [blame] | 108 | case OMPC_use_device_ptr: |
Carlo Bertolli | 70594e9 | 2016-07-13 17:16:49 +0000 | [diff] [blame] | 109 | case OMPC_is_device_ptr: |
Kelvin Li | 1408f91 | 2018-09-26 04:28:39 +0000 | [diff] [blame] | 110 | case OMPC_unified_address: |
Patrick Lyster | 4a370b9 | 2018-10-01 13:47:43 +0000 | [diff] [blame] | 111 | case OMPC_unified_shared_memory: |
Patrick Lyster | 6bdf63b | 2018-10-03 20:07:58 +0000 | [diff] [blame] | 112 | case OMPC_reverse_offload: |
Patrick Lyster | 3fe9e39 | 2018-10-11 14:41:10 +0000 | [diff] [blame] | 113 | case OMPC_dynamic_allocators: |
Patrick Lyster | 7a2a27c | 2018-11-02 12:18:11 +0000 | [diff] [blame^] | 114 | case OMPC_atomic_default_mem_order: |
Alexey Bataev | 005248a | 2016-02-25 05:25:57 +0000 | [diff] [blame] | 115 | break; |
| 116 | } |
| 117 | |
| 118 | return nullptr; |
| 119 | } |
| 120 | |
| 121 | OMPClauseWithPostUpdate *OMPClauseWithPostUpdate::get(OMPClause *C) { |
| 122 | auto *Res = OMPClauseWithPostUpdate::get(const_cast<const OMPClause *>(C)); |
| 123 | return Res ? const_cast<OMPClauseWithPostUpdate *>(Res) : nullptr; |
| 124 | } |
| 125 | |
| 126 | const OMPClauseWithPostUpdate *OMPClauseWithPostUpdate::get(const OMPClause *C) { |
| 127 | switch (C->getClauseKind()) { |
Alexey Bataev | 3392d76 | 2016-02-16 11:18:12 +0000 | [diff] [blame] | 128 | case OMPC_lastprivate: |
Alexey Bataev | 005248a | 2016-02-25 05:25:57 +0000 | [diff] [blame] | 129 | return static_cast<const OMPLastprivateClause *>(C); |
Alexey Bataev | 6120507 | 2016-03-02 04:57:40 +0000 | [diff] [blame] | 130 | case OMPC_reduction: |
| 131 | return static_cast<const OMPReductionClause *>(C); |
Alexey Bataev | 169d96a | 2017-07-18 20:17:46 +0000 | [diff] [blame] | 132 | case OMPC_task_reduction: |
| 133 | return static_cast<const OMPTaskReductionClause *>(C); |
Alexey Bataev | fa312f3 | 2017-07-21 18:48:21 +0000 | [diff] [blame] | 134 | case OMPC_in_reduction: |
| 135 | return static_cast<const OMPInReductionClause *>(C); |
Alexey Bataev | 78849fb | 2016-03-09 09:49:00 +0000 | [diff] [blame] | 136 | case OMPC_linear: |
| 137 | return static_cast<const OMPLinearClause *>(C); |
Alexey Bataev | 005248a | 2016-02-25 05:25:57 +0000 | [diff] [blame] | 138 | case OMPC_schedule: |
| 139 | case OMPC_dist_schedule: |
| 140 | case OMPC_firstprivate: |
| 141 | case OMPC_default: |
| 142 | case OMPC_proc_bind: |
| 143 | case OMPC_if: |
| 144 | case OMPC_final: |
| 145 | case OMPC_num_threads: |
| 146 | case OMPC_safelen: |
| 147 | case OMPC_simdlen: |
| 148 | case OMPC_collapse: |
| 149 | case OMPC_private: |
Alexey Bataev | 3392d76 | 2016-02-16 11:18:12 +0000 | [diff] [blame] | 150 | case OMPC_shared: |
Alexey Bataev | 3392d76 | 2016-02-16 11:18:12 +0000 | [diff] [blame] | 151 | case OMPC_aligned: |
| 152 | case OMPC_copyin: |
| 153 | case OMPC_copyprivate: |
| 154 | case OMPC_ordered: |
| 155 | case OMPC_nowait: |
| 156 | case OMPC_untied: |
| 157 | case OMPC_mergeable: |
| 158 | case OMPC_threadprivate: |
| 159 | case OMPC_flush: |
| 160 | case OMPC_read: |
| 161 | case OMPC_write: |
| 162 | case OMPC_update: |
| 163 | case OMPC_capture: |
| 164 | case OMPC_seq_cst: |
| 165 | case OMPC_depend: |
| 166 | case OMPC_device: |
| 167 | case OMPC_threads: |
| 168 | case OMPC_simd: |
| 169 | case OMPC_map: |
| 170 | case OMPC_num_teams: |
| 171 | case OMPC_thread_limit: |
| 172 | case OMPC_priority: |
| 173 | case OMPC_grainsize: |
| 174 | case OMPC_nogroup: |
| 175 | case OMPC_num_tasks: |
| 176 | case OMPC_hint: |
| 177 | case OMPC_defaultmap: |
| 178 | case OMPC_unknown: |
Alexey Bataev | e48a5fc | 2016-04-12 05:28:34 +0000 | [diff] [blame] | 179 | case OMPC_uniform: |
Samuel Antao | 661c090 | 2016-05-26 17:39:58 +0000 | [diff] [blame] | 180 | case OMPC_to: |
Samuel Antao | ec172c6 | 2016-05-26 17:49:04 +0000 | [diff] [blame] | 181 | case OMPC_from: |
Carlo Bertolli | 2404b17 | 2016-07-13 15:37:16 +0000 | [diff] [blame] | 182 | case OMPC_use_device_ptr: |
Carlo Bertolli | 70594e9 | 2016-07-13 17:16:49 +0000 | [diff] [blame] | 183 | case OMPC_is_device_ptr: |
Kelvin Li | 1408f91 | 2018-09-26 04:28:39 +0000 | [diff] [blame] | 184 | case OMPC_unified_address: |
Patrick Lyster | 4a370b9 | 2018-10-01 13:47:43 +0000 | [diff] [blame] | 185 | case OMPC_unified_shared_memory: |
Patrick Lyster | 6bdf63b | 2018-10-03 20:07:58 +0000 | [diff] [blame] | 186 | case OMPC_reverse_offload: |
Patrick Lyster | 3fe9e39 | 2018-10-11 14:41:10 +0000 | [diff] [blame] | 187 | case OMPC_dynamic_allocators: |
Patrick Lyster | 7a2a27c | 2018-11-02 12:18:11 +0000 | [diff] [blame^] | 188 | case OMPC_atomic_default_mem_order: |
Alexey Bataev | 3392d76 | 2016-02-16 11:18:12 +0000 | [diff] [blame] | 189 | break; |
| 190 | } |
| 191 | |
| 192 | return nullptr; |
| 193 | } |
| 194 | |
Alexey Bataev | f138fda | 2018-08-13 19:04:24 +0000 | [diff] [blame] | 195 | OMPOrderedClause *OMPOrderedClause::Create(const ASTContext &C, Expr *Num, |
| 196 | unsigned NumLoops, |
| 197 | SourceLocation StartLoc, |
| 198 | SourceLocation LParenLoc, |
| 199 | SourceLocation EndLoc) { |
| 200 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(2 * NumLoops)); |
| 201 | auto *Clause = |
| 202 | new (Mem) OMPOrderedClause(Num, NumLoops, StartLoc, LParenLoc, EndLoc); |
| 203 | for (unsigned I = 0; I < NumLoops; ++I) { |
| 204 | Clause->setLoopNumIterations(I, nullptr); |
| 205 | Clause->setLoopCounter(I, nullptr); |
| 206 | } |
| 207 | return Clause; |
| 208 | } |
| 209 | |
| 210 | OMPOrderedClause *OMPOrderedClause::CreateEmpty(const ASTContext &C, |
| 211 | unsigned NumLoops) { |
| 212 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(2 * NumLoops)); |
| 213 | auto *Clause = new (Mem) OMPOrderedClause(NumLoops); |
| 214 | for (unsigned I = 0; I < NumLoops; ++I) { |
| 215 | Clause->setLoopNumIterations(I, nullptr); |
| 216 | Clause->setLoopCounter(I, nullptr); |
| 217 | } |
| 218 | return Clause; |
| 219 | } |
| 220 | |
| 221 | void OMPOrderedClause::setLoopNumIterations(unsigned NumLoop, |
| 222 | Expr *NumIterations) { |
| 223 | assert(NumLoop < NumberOfLoops && "out of loops number."); |
| 224 | getTrailingObjects<Expr *>()[NumLoop] = NumIterations; |
| 225 | } |
| 226 | |
| 227 | ArrayRef<Expr *> OMPOrderedClause::getLoopNumIterations() const { |
| 228 | return llvm::makeArrayRef(getTrailingObjects<Expr *>(), NumberOfLoops); |
| 229 | } |
| 230 | |
| 231 | void OMPOrderedClause::setLoopCounter(unsigned NumLoop, Expr *Counter) { |
| 232 | assert(NumLoop < NumberOfLoops && "out of loops number."); |
| 233 | getTrailingObjects<Expr *>()[NumberOfLoops + NumLoop] = Counter; |
| 234 | } |
| 235 | |
Mike Rice | 0ed4666 | 2018-09-20 17:19:41 +0000 | [diff] [blame] | 236 | Expr *OMPOrderedClause::getLoopCounter(unsigned NumLoop) { |
Alexey Bataev | f138fda | 2018-08-13 19:04:24 +0000 | [diff] [blame] | 237 | assert(NumLoop < NumberOfLoops && "out of loops number."); |
| 238 | return getTrailingObjects<Expr *>()[NumberOfLoops + NumLoop]; |
| 239 | } |
| 240 | |
Mike Rice | 0ed4666 | 2018-09-20 17:19:41 +0000 | [diff] [blame] | 241 | const Expr *OMPOrderedClause::getLoopCounter(unsigned NumLoop) const { |
Alexey Bataev | f138fda | 2018-08-13 19:04:24 +0000 | [diff] [blame] | 242 | assert(NumLoop < NumberOfLoops && "out of loops number."); |
| 243 | return getTrailingObjects<Expr *>()[NumberOfLoops + NumLoop]; |
| 244 | } |
| 245 | |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 246 | void OMPPrivateClause::setPrivateCopies(ArrayRef<Expr *> VL) { |
| 247 | assert(VL.size() == varlist_size() && |
| 248 | "Number of private copies is not the same as the preallocated buffer"); |
| 249 | std::copy(VL.begin(), VL.end(), varlist_end()); |
| 250 | } |
| 251 | |
| 252 | OMPPrivateClause * |
| 253 | OMPPrivateClause::Create(const ASTContext &C, SourceLocation StartLoc, |
| 254 | SourceLocation LParenLoc, SourceLocation EndLoc, |
| 255 | ArrayRef<Expr *> VL, ArrayRef<Expr *> PrivateVL) { |
| 256 | // Allocate space for private variables and initializer expressions. |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 257 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(2 * VL.size())); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 258 | OMPPrivateClause *Clause = |
| 259 | new (Mem) OMPPrivateClause(StartLoc, LParenLoc, EndLoc, VL.size()); |
| 260 | Clause->setVarRefs(VL); |
| 261 | Clause->setPrivateCopies(PrivateVL); |
| 262 | return Clause; |
| 263 | } |
| 264 | |
| 265 | OMPPrivateClause *OMPPrivateClause::CreateEmpty(const ASTContext &C, |
| 266 | unsigned N) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 267 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(2 * N)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 268 | return new (Mem) OMPPrivateClause(N); |
| 269 | } |
| 270 | |
| 271 | void OMPFirstprivateClause::setPrivateCopies(ArrayRef<Expr *> VL) { |
| 272 | assert(VL.size() == varlist_size() && |
| 273 | "Number of private copies is not the same as the preallocated buffer"); |
| 274 | std::copy(VL.begin(), VL.end(), varlist_end()); |
| 275 | } |
| 276 | |
| 277 | void OMPFirstprivateClause::setInits(ArrayRef<Expr *> VL) { |
| 278 | assert(VL.size() == varlist_size() && |
| 279 | "Number of inits is not the same as the preallocated buffer"); |
| 280 | std::copy(VL.begin(), VL.end(), getPrivateCopies().end()); |
| 281 | } |
| 282 | |
| 283 | OMPFirstprivateClause * |
| 284 | OMPFirstprivateClause::Create(const ASTContext &C, SourceLocation StartLoc, |
| 285 | SourceLocation LParenLoc, SourceLocation EndLoc, |
| 286 | ArrayRef<Expr *> VL, ArrayRef<Expr *> PrivateVL, |
Alexey Bataev | 417089f | 2016-02-17 13:19:37 +0000 | [diff] [blame] | 287 | ArrayRef<Expr *> InitVL, Stmt *PreInit) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 288 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(3 * VL.size())); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 289 | OMPFirstprivateClause *Clause = |
| 290 | new (Mem) OMPFirstprivateClause(StartLoc, LParenLoc, EndLoc, VL.size()); |
| 291 | Clause->setVarRefs(VL); |
| 292 | Clause->setPrivateCopies(PrivateVL); |
| 293 | Clause->setInits(InitVL); |
Alexey Bataev | 417089f | 2016-02-17 13:19:37 +0000 | [diff] [blame] | 294 | Clause->setPreInitStmt(PreInit); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 295 | return Clause; |
| 296 | } |
| 297 | |
| 298 | OMPFirstprivateClause *OMPFirstprivateClause::CreateEmpty(const ASTContext &C, |
| 299 | unsigned N) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 300 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(3 * N)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 301 | return new (Mem) OMPFirstprivateClause(N); |
| 302 | } |
| 303 | |
| 304 | void OMPLastprivateClause::setPrivateCopies(ArrayRef<Expr *> PrivateCopies) { |
| 305 | assert(PrivateCopies.size() == varlist_size() && |
| 306 | "Number of private copies is not the same as the preallocated buffer"); |
| 307 | std::copy(PrivateCopies.begin(), PrivateCopies.end(), varlist_end()); |
| 308 | } |
| 309 | |
| 310 | void OMPLastprivateClause::setSourceExprs(ArrayRef<Expr *> SrcExprs) { |
| 311 | assert(SrcExprs.size() == varlist_size() && "Number of source expressions is " |
| 312 | "not the same as the " |
| 313 | "preallocated buffer"); |
| 314 | std::copy(SrcExprs.begin(), SrcExprs.end(), getPrivateCopies().end()); |
| 315 | } |
| 316 | |
| 317 | void OMPLastprivateClause::setDestinationExprs(ArrayRef<Expr *> DstExprs) { |
| 318 | assert(DstExprs.size() == varlist_size() && "Number of destination " |
| 319 | "expressions is not the same as " |
| 320 | "the preallocated buffer"); |
| 321 | std::copy(DstExprs.begin(), DstExprs.end(), getSourceExprs().end()); |
| 322 | } |
| 323 | |
| 324 | void OMPLastprivateClause::setAssignmentOps(ArrayRef<Expr *> AssignmentOps) { |
| 325 | assert(AssignmentOps.size() == varlist_size() && |
| 326 | "Number of assignment expressions is not the same as the preallocated " |
| 327 | "buffer"); |
| 328 | std::copy(AssignmentOps.begin(), AssignmentOps.end(), |
| 329 | getDestinationExprs().end()); |
| 330 | } |
| 331 | |
| 332 | OMPLastprivateClause *OMPLastprivateClause::Create( |
| 333 | const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc, |
| 334 | SourceLocation EndLoc, ArrayRef<Expr *> VL, ArrayRef<Expr *> SrcExprs, |
Alexey Bataev | 005248a | 2016-02-25 05:25:57 +0000 | [diff] [blame] | 335 | ArrayRef<Expr *> DstExprs, ArrayRef<Expr *> AssignmentOps, Stmt *PreInit, |
| 336 | Expr *PostUpdate) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 337 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * VL.size())); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 338 | OMPLastprivateClause *Clause = |
| 339 | new (Mem) OMPLastprivateClause(StartLoc, LParenLoc, EndLoc, VL.size()); |
| 340 | Clause->setVarRefs(VL); |
| 341 | Clause->setSourceExprs(SrcExprs); |
| 342 | Clause->setDestinationExprs(DstExprs); |
| 343 | Clause->setAssignmentOps(AssignmentOps); |
Alexey Bataev | 005248a | 2016-02-25 05:25:57 +0000 | [diff] [blame] | 344 | Clause->setPreInitStmt(PreInit); |
| 345 | Clause->setPostUpdateExpr(PostUpdate); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 346 | return Clause; |
| 347 | } |
| 348 | |
| 349 | OMPLastprivateClause *OMPLastprivateClause::CreateEmpty(const ASTContext &C, |
| 350 | unsigned N) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 351 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * N)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 352 | return new (Mem) OMPLastprivateClause(N); |
| 353 | } |
| 354 | |
| 355 | OMPSharedClause *OMPSharedClause::Create(const ASTContext &C, |
| 356 | SourceLocation StartLoc, |
| 357 | SourceLocation LParenLoc, |
| 358 | SourceLocation EndLoc, |
| 359 | ArrayRef<Expr *> VL) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 360 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(VL.size())); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 361 | OMPSharedClause *Clause = |
| 362 | new (Mem) OMPSharedClause(StartLoc, LParenLoc, EndLoc, VL.size()); |
| 363 | Clause->setVarRefs(VL); |
| 364 | return Clause; |
| 365 | } |
| 366 | |
| 367 | OMPSharedClause *OMPSharedClause::CreateEmpty(const ASTContext &C, unsigned N) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 368 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(N)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 369 | return new (Mem) OMPSharedClause(N); |
| 370 | } |
| 371 | |
| 372 | void OMPLinearClause::setPrivates(ArrayRef<Expr *> PL) { |
| 373 | assert(PL.size() == varlist_size() && |
| 374 | "Number of privates is not the same as the preallocated buffer"); |
| 375 | std::copy(PL.begin(), PL.end(), varlist_end()); |
| 376 | } |
| 377 | |
| 378 | void OMPLinearClause::setInits(ArrayRef<Expr *> IL) { |
| 379 | assert(IL.size() == varlist_size() && |
| 380 | "Number of inits is not the same as the preallocated buffer"); |
| 381 | std::copy(IL.begin(), IL.end(), getPrivates().end()); |
| 382 | } |
| 383 | |
| 384 | void OMPLinearClause::setUpdates(ArrayRef<Expr *> UL) { |
| 385 | assert(UL.size() == varlist_size() && |
| 386 | "Number of updates is not the same as the preallocated buffer"); |
| 387 | std::copy(UL.begin(), UL.end(), getInits().end()); |
| 388 | } |
| 389 | |
| 390 | void OMPLinearClause::setFinals(ArrayRef<Expr *> FL) { |
| 391 | assert(FL.size() == varlist_size() && |
| 392 | "Number of final updates is not the same as the preallocated buffer"); |
| 393 | std::copy(FL.begin(), FL.end(), getUpdates().end()); |
| 394 | } |
| 395 | |
| 396 | OMPLinearClause *OMPLinearClause::Create( |
| 397 | const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc, |
| 398 | OpenMPLinearClauseKind Modifier, SourceLocation ModifierLoc, |
| 399 | SourceLocation ColonLoc, SourceLocation EndLoc, ArrayRef<Expr *> VL, |
Alexey Bataev | 78849fb | 2016-03-09 09:49:00 +0000 | [diff] [blame] | 400 | ArrayRef<Expr *> PL, ArrayRef<Expr *> IL, Expr *Step, Expr *CalcStep, |
| 401 | Stmt *PreInit, Expr *PostUpdate) { |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 402 | // Allocate space for 4 lists (Vars, Inits, Updates, Finals) and 2 expressions |
| 403 | // (Step and CalcStep). |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 404 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * VL.size() + 2)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 405 | OMPLinearClause *Clause = new (Mem) OMPLinearClause( |
| 406 | StartLoc, LParenLoc, Modifier, ModifierLoc, ColonLoc, EndLoc, VL.size()); |
| 407 | Clause->setVarRefs(VL); |
| 408 | Clause->setPrivates(PL); |
| 409 | Clause->setInits(IL); |
| 410 | // Fill update and final expressions with zeroes, they are provided later, |
| 411 | // after the directive construction. |
| 412 | std::fill(Clause->getInits().end(), Clause->getInits().end() + VL.size(), |
| 413 | nullptr); |
| 414 | std::fill(Clause->getUpdates().end(), Clause->getUpdates().end() + VL.size(), |
| 415 | nullptr); |
| 416 | Clause->setStep(Step); |
| 417 | Clause->setCalcStep(CalcStep); |
Alexey Bataev | 78849fb | 2016-03-09 09:49:00 +0000 | [diff] [blame] | 418 | Clause->setPreInitStmt(PreInit); |
| 419 | Clause->setPostUpdateExpr(PostUpdate); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 420 | return Clause; |
| 421 | } |
| 422 | |
| 423 | OMPLinearClause *OMPLinearClause::CreateEmpty(const ASTContext &C, |
| 424 | unsigned NumVars) { |
| 425 | // Allocate space for 4 lists (Vars, Inits, Updates, Finals) and 2 expressions |
| 426 | // (Step and CalcStep). |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 427 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * NumVars + 2)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 428 | return new (Mem) OMPLinearClause(NumVars); |
| 429 | } |
| 430 | |
| 431 | OMPAlignedClause * |
| 432 | OMPAlignedClause::Create(const ASTContext &C, SourceLocation StartLoc, |
| 433 | SourceLocation LParenLoc, SourceLocation ColonLoc, |
| 434 | SourceLocation EndLoc, ArrayRef<Expr *> VL, Expr *A) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 435 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(VL.size() + 1)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 436 | OMPAlignedClause *Clause = new (Mem) |
| 437 | OMPAlignedClause(StartLoc, LParenLoc, ColonLoc, EndLoc, VL.size()); |
| 438 | Clause->setVarRefs(VL); |
| 439 | Clause->setAlignment(A); |
| 440 | return Clause; |
| 441 | } |
| 442 | |
| 443 | OMPAlignedClause *OMPAlignedClause::CreateEmpty(const ASTContext &C, |
| 444 | unsigned NumVars) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 445 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(NumVars + 1)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 446 | return new (Mem) OMPAlignedClause(NumVars); |
| 447 | } |
| 448 | |
| 449 | void OMPCopyinClause::setSourceExprs(ArrayRef<Expr *> SrcExprs) { |
| 450 | assert(SrcExprs.size() == varlist_size() && "Number of source expressions is " |
| 451 | "not the same as the " |
| 452 | "preallocated buffer"); |
| 453 | std::copy(SrcExprs.begin(), SrcExprs.end(), varlist_end()); |
| 454 | } |
| 455 | |
| 456 | void OMPCopyinClause::setDestinationExprs(ArrayRef<Expr *> DstExprs) { |
| 457 | assert(DstExprs.size() == varlist_size() && "Number of destination " |
| 458 | "expressions is not the same as " |
| 459 | "the preallocated buffer"); |
| 460 | std::copy(DstExprs.begin(), DstExprs.end(), getSourceExprs().end()); |
| 461 | } |
| 462 | |
| 463 | void OMPCopyinClause::setAssignmentOps(ArrayRef<Expr *> AssignmentOps) { |
| 464 | assert(AssignmentOps.size() == varlist_size() && |
| 465 | "Number of assignment expressions is not the same as the preallocated " |
| 466 | "buffer"); |
| 467 | std::copy(AssignmentOps.begin(), AssignmentOps.end(), |
| 468 | getDestinationExprs().end()); |
| 469 | } |
| 470 | |
| 471 | OMPCopyinClause *OMPCopyinClause::Create( |
| 472 | const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc, |
| 473 | SourceLocation EndLoc, ArrayRef<Expr *> VL, ArrayRef<Expr *> SrcExprs, |
| 474 | ArrayRef<Expr *> DstExprs, ArrayRef<Expr *> AssignmentOps) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 475 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(4 * VL.size())); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 476 | OMPCopyinClause *Clause = |
| 477 | new (Mem) OMPCopyinClause(StartLoc, LParenLoc, EndLoc, VL.size()); |
| 478 | Clause->setVarRefs(VL); |
| 479 | Clause->setSourceExprs(SrcExprs); |
| 480 | Clause->setDestinationExprs(DstExprs); |
| 481 | Clause->setAssignmentOps(AssignmentOps); |
| 482 | return Clause; |
| 483 | } |
| 484 | |
| 485 | OMPCopyinClause *OMPCopyinClause::CreateEmpty(const ASTContext &C, unsigned N) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 486 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(4 * N)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 487 | return new (Mem) OMPCopyinClause(N); |
| 488 | } |
| 489 | |
| 490 | void OMPCopyprivateClause::setSourceExprs(ArrayRef<Expr *> SrcExprs) { |
| 491 | assert(SrcExprs.size() == varlist_size() && "Number of source expressions is " |
| 492 | "not the same as the " |
| 493 | "preallocated buffer"); |
| 494 | std::copy(SrcExprs.begin(), SrcExprs.end(), varlist_end()); |
| 495 | } |
| 496 | |
| 497 | void OMPCopyprivateClause::setDestinationExprs(ArrayRef<Expr *> DstExprs) { |
| 498 | assert(DstExprs.size() == varlist_size() && "Number of destination " |
| 499 | "expressions is not the same as " |
| 500 | "the preallocated buffer"); |
| 501 | std::copy(DstExprs.begin(), DstExprs.end(), getSourceExprs().end()); |
| 502 | } |
| 503 | |
| 504 | void OMPCopyprivateClause::setAssignmentOps(ArrayRef<Expr *> AssignmentOps) { |
| 505 | assert(AssignmentOps.size() == varlist_size() && |
| 506 | "Number of assignment expressions is not the same as the preallocated " |
| 507 | "buffer"); |
| 508 | std::copy(AssignmentOps.begin(), AssignmentOps.end(), |
| 509 | getDestinationExprs().end()); |
| 510 | } |
| 511 | |
| 512 | OMPCopyprivateClause *OMPCopyprivateClause::Create( |
| 513 | const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc, |
| 514 | SourceLocation EndLoc, ArrayRef<Expr *> VL, ArrayRef<Expr *> SrcExprs, |
| 515 | ArrayRef<Expr *> DstExprs, ArrayRef<Expr *> AssignmentOps) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 516 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(4 * VL.size())); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 517 | OMPCopyprivateClause *Clause = |
| 518 | new (Mem) OMPCopyprivateClause(StartLoc, LParenLoc, EndLoc, VL.size()); |
| 519 | Clause->setVarRefs(VL); |
| 520 | Clause->setSourceExprs(SrcExprs); |
| 521 | Clause->setDestinationExprs(DstExprs); |
| 522 | Clause->setAssignmentOps(AssignmentOps); |
| 523 | return Clause; |
| 524 | } |
| 525 | |
| 526 | OMPCopyprivateClause *OMPCopyprivateClause::CreateEmpty(const ASTContext &C, |
| 527 | unsigned N) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 528 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(4 * N)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 529 | return new (Mem) OMPCopyprivateClause(N); |
| 530 | } |
| 531 | |
Alexey Bataev | f24e7b1 | 2015-10-08 09:10:53 +0000 | [diff] [blame] | 532 | void OMPReductionClause::setPrivates(ArrayRef<Expr *> Privates) { |
| 533 | assert(Privates.size() == varlist_size() && |
| 534 | "Number of private copies is not the same as the preallocated buffer"); |
| 535 | std::copy(Privates.begin(), Privates.end(), varlist_end()); |
| 536 | } |
| 537 | |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 538 | void OMPReductionClause::setLHSExprs(ArrayRef<Expr *> LHSExprs) { |
| 539 | assert( |
| 540 | LHSExprs.size() == varlist_size() && |
| 541 | "Number of LHS expressions is not the same as the preallocated buffer"); |
Alexey Bataev | f24e7b1 | 2015-10-08 09:10:53 +0000 | [diff] [blame] | 542 | std::copy(LHSExprs.begin(), LHSExprs.end(), getPrivates().end()); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 543 | } |
| 544 | |
| 545 | void OMPReductionClause::setRHSExprs(ArrayRef<Expr *> RHSExprs) { |
| 546 | assert( |
| 547 | RHSExprs.size() == varlist_size() && |
| 548 | "Number of RHS expressions is not the same as the preallocated buffer"); |
| 549 | std::copy(RHSExprs.begin(), RHSExprs.end(), getLHSExprs().end()); |
| 550 | } |
| 551 | |
| 552 | void OMPReductionClause::setReductionOps(ArrayRef<Expr *> ReductionOps) { |
| 553 | assert(ReductionOps.size() == varlist_size() && "Number of reduction " |
| 554 | "expressions is not the same " |
| 555 | "as the preallocated buffer"); |
| 556 | std::copy(ReductionOps.begin(), ReductionOps.end(), getRHSExprs().end()); |
| 557 | } |
| 558 | |
| 559 | OMPReductionClause *OMPReductionClause::Create( |
| 560 | const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc, |
| 561 | SourceLocation EndLoc, SourceLocation ColonLoc, ArrayRef<Expr *> VL, |
| 562 | NestedNameSpecifierLoc QualifierLoc, const DeclarationNameInfo &NameInfo, |
Alexey Bataev | f24e7b1 | 2015-10-08 09:10:53 +0000 | [diff] [blame] | 563 | ArrayRef<Expr *> Privates, ArrayRef<Expr *> LHSExprs, |
Alexey Bataev | 6120507 | 2016-03-02 04:57:40 +0000 | [diff] [blame] | 564 | ArrayRef<Expr *> RHSExprs, ArrayRef<Expr *> ReductionOps, Stmt *PreInit, |
| 565 | Expr *PostUpdate) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 566 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * VL.size())); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 567 | OMPReductionClause *Clause = new (Mem) OMPReductionClause( |
| 568 | StartLoc, LParenLoc, EndLoc, ColonLoc, VL.size(), QualifierLoc, NameInfo); |
| 569 | Clause->setVarRefs(VL); |
Alexey Bataev | f24e7b1 | 2015-10-08 09:10:53 +0000 | [diff] [blame] | 570 | Clause->setPrivates(Privates); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 571 | Clause->setLHSExprs(LHSExprs); |
| 572 | Clause->setRHSExprs(RHSExprs); |
| 573 | Clause->setReductionOps(ReductionOps); |
Alexey Bataev | 6120507 | 2016-03-02 04:57:40 +0000 | [diff] [blame] | 574 | Clause->setPreInitStmt(PreInit); |
| 575 | Clause->setPostUpdateExpr(PostUpdate); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 576 | return Clause; |
| 577 | } |
| 578 | |
| 579 | OMPReductionClause *OMPReductionClause::CreateEmpty(const ASTContext &C, |
| 580 | unsigned N) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 581 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * N)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 582 | return new (Mem) OMPReductionClause(N); |
| 583 | } |
| 584 | |
Alexey Bataev | 169d96a | 2017-07-18 20:17:46 +0000 | [diff] [blame] | 585 | void OMPTaskReductionClause::setPrivates(ArrayRef<Expr *> Privates) { |
| 586 | assert(Privates.size() == varlist_size() && |
| 587 | "Number of private copies is not the same as the preallocated buffer"); |
| 588 | std::copy(Privates.begin(), Privates.end(), varlist_end()); |
| 589 | } |
| 590 | |
| 591 | void OMPTaskReductionClause::setLHSExprs(ArrayRef<Expr *> LHSExprs) { |
| 592 | assert( |
| 593 | LHSExprs.size() == varlist_size() && |
| 594 | "Number of LHS expressions is not the same as the preallocated buffer"); |
| 595 | std::copy(LHSExprs.begin(), LHSExprs.end(), getPrivates().end()); |
| 596 | } |
| 597 | |
| 598 | void OMPTaskReductionClause::setRHSExprs(ArrayRef<Expr *> RHSExprs) { |
| 599 | assert( |
| 600 | RHSExprs.size() == varlist_size() && |
| 601 | "Number of RHS expressions is not the same as the preallocated buffer"); |
| 602 | std::copy(RHSExprs.begin(), RHSExprs.end(), getLHSExprs().end()); |
| 603 | } |
| 604 | |
| 605 | void OMPTaskReductionClause::setReductionOps(ArrayRef<Expr *> ReductionOps) { |
| 606 | assert(ReductionOps.size() == varlist_size() && "Number of task reduction " |
| 607 | "expressions is not the same " |
| 608 | "as the preallocated buffer"); |
| 609 | std::copy(ReductionOps.begin(), ReductionOps.end(), getRHSExprs().end()); |
| 610 | } |
| 611 | |
| 612 | OMPTaskReductionClause *OMPTaskReductionClause::Create( |
| 613 | const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc, |
| 614 | SourceLocation EndLoc, SourceLocation ColonLoc, ArrayRef<Expr *> VL, |
| 615 | NestedNameSpecifierLoc QualifierLoc, const DeclarationNameInfo &NameInfo, |
| 616 | ArrayRef<Expr *> Privates, ArrayRef<Expr *> LHSExprs, |
| 617 | ArrayRef<Expr *> RHSExprs, ArrayRef<Expr *> ReductionOps, Stmt *PreInit, |
| 618 | Expr *PostUpdate) { |
| 619 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * VL.size())); |
| 620 | OMPTaskReductionClause *Clause = new (Mem) OMPTaskReductionClause( |
| 621 | StartLoc, LParenLoc, EndLoc, ColonLoc, VL.size(), QualifierLoc, NameInfo); |
| 622 | Clause->setVarRefs(VL); |
| 623 | Clause->setPrivates(Privates); |
| 624 | Clause->setLHSExprs(LHSExprs); |
| 625 | Clause->setRHSExprs(RHSExprs); |
| 626 | Clause->setReductionOps(ReductionOps); |
| 627 | Clause->setPreInitStmt(PreInit); |
| 628 | Clause->setPostUpdateExpr(PostUpdate); |
| 629 | return Clause; |
| 630 | } |
| 631 | |
| 632 | OMPTaskReductionClause *OMPTaskReductionClause::CreateEmpty(const ASTContext &C, |
| 633 | unsigned N) { |
| 634 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * N)); |
| 635 | return new (Mem) OMPTaskReductionClause(N); |
| 636 | } |
| 637 | |
Alexey Bataev | fa312f3 | 2017-07-21 18:48:21 +0000 | [diff] [blame] | 638 | void OMPInReductionClause::setPrivates(ArrayRef<Expr *> Privates) { |
| 639 | assert(Privates.size() == varlist_size() && |
| 640 | "Number of private copies is not the same as the preallocated buffer"); |
| 641 | std::copy(Privates.begin(), Privates.end(), varlist_end()); |
| 642 | } |
| 643 | |
| 644 | void OMPInReductionClause::setLHSExprs(ArrayRef<Expr *> LHSExprs) { |
| 645 | assert( |
| 646 | LHSExprs.size() == varlist_size() && |
| 647 | "Number of LHS expressions is not the same as the preallocated buffer"); |
| 648 | std::copy(LHSExprs.begin(), LHSExprs.end(), getPrivates().end()); |
| 649 | } |
| 650 | |
| 651 | void OMPInReductionClause::setRHSExprs(ArrayRef<Expr *> RHSExprs) { |
| 652 | assert( |
| 653 | RHSExprs.size() == varlist_size() && |
| 654 | "Number of RHS expressions is not the same as the preallocated buffer"); |
| 655 | std::copy(RHSExprs.begin(), RHSExprs.end(), getLHSExprs().end()); |
| 656 | } |
| 657 | |
| 658 | void OMPInReductionClause::setReductionOps(ArrayRef<Expr *> ReductionOps) { |
| 659 | assert(ReductionOps.size() == varlist_size() && "Number of in reduction " |
| 660 | "expressions is not the same " |
| 661 | "as the preallocated buffer"); |
| 662 | std::copy(ReductionOps.begin(), ReductionOps.end(), getRHSExprs().end()); |
| 663 | } |
| 664 | |
Alexey Bataev | 88202be | 2017-07-27 13:20:36 +0000 | [diff] [blame] | 665 | void OMPInReductionClause::setTaskgroupDescriptors( |
| 666 | ArrayRef<Expr *> TaskgroupDescriptors) { |
| 667 | assert(TaskgroupDescriptors.size() == varlist_size() && |
| 668 | "Number of in reduction descriptors is not the same as the " |
| 669 | "preallocated buffer"); |
| 670 | std::copy(TaskgroupDescriptors.begin(), TaskgroupDescriptors.end(), |
| 671 | getReductionOps().end()); |
| 672 | } |
| 673 | |
Alexey Bataev | fa312f3 | 2017-07-21 18:48:21 +0000 | [diff] [blame] | 674 | OMPInReductionClause *OMPInReductionClause::Create( |
| 675 | const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc, |
| 676 | SourceLocation EndLoc, SourceLocation ColonLoc, ArrayRef<Expr *> VL, |
| 677 | NestedNameSpecifierLoc QualifierLoc, const DeclarationNameInfo &NameInfo, |
| 678 | ArrayRef<Expr *> Privates, ArrayRef<Expr *> LHSExprs, |
Alexey Bataev | 88202be | 2017-07-27 13:20:36 +0000 | [diff] [blame] | 679 | ArrayRef<Expr *> RHSExprs, ArrayRef<Expr *> ReductionOps, |
| 680 | ArrayRef<Expr *> TaskgroupDescriptors, Stmt *PreInit, Expr *PostUpdate) { |
| 681 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(6 * VL.size())); |
Alexey Bataev | fa312f3 | 2017-07-21 18:48:21 +0000 | [diff] [blame] | 682 | OMPInReductionClause *Clause = new (Mem) OMPInReductionClause( |
| 683 | StartLoc, LParenLoc, EndLoc, ColonLoc, VL.size(), QualifierLoc, NameInfo); |
| 684 | Clause->setVarRefs(VL); |
| 685 | Clause->setPrivates(Privates); |
| 686 | Clause->setLHSExprs(LHSExprs); |
| 687 | Clause->setRHSExprs(RHSExprs); |
| 688 | Clause->setReductionOps(ReductionOps); |
Alexey Bataev | 88202be | 2017-07-27 13:20:36 +0000 | [diff] [blame] | 689 | Clause->setTaskgroupDescriptors(TaskgroupDescriptors); |
Alexey Bataev | fa312f3 | 2017-07-21 18:48:21 +0000 | [diff] [blame] | 690 | Clause->setPreInitStmt(PreInit); |
| 691 | Clause->setPostUpdateExpr(PostUpdate); |
| 692 | return Clause; |
| 693 | } |
| 694 | |
| 695 | OMPInReductionClause *OMPInReductionClause::CreateEmpty(const ASTContext &C, |
| 696 | unsigned N) { |
Alexey Bataev | 88202be | 2017-07-27 13:20:36 +0000 | [diff] [blame] | 697 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(6 * N)); |
Alexey Bataev | fa312f3 | 2017-07-21 18:48:21 +0000 | [diff] [blame] | 698 | return new (Mem) OMPInReductionClause(N); |
| 699 | } |
| 700 | |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 701 | OMPFlushClause *OMPFlushClause::Create(const ASTContext &C, |
| 702 | SourceLocation StartLoc, |
| 703 | SourceLocation LParenLoc, |
| 704 | SourceLocation EndLoc, |
| 705 | ArrayRef<Expr *> VL) { |
Alexey Bataev | 8b42706 | 2016-05-25 12:36:08 +0000 | [diff] [blame] | 706 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(VL.size() + 1)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 707 | OMPFlushClause *Clause = |
| 708 | new (Mem) OMPFlushClause(StartLoc, LParenLoc, EndLoc, VL.size()); |
| 709 | Clause->setVarRefs(VL); |
| 710 | return Clause; |
| 711 | } |
| 712 | |
| 713 | OMPFlushClause *OMPFlushClause::CreateEmpty(const ASTContext &C, unsigned N) { |
James Y Knight | 374fd20 | 2016-01-01 00:38:24 +0000 | [diff] [blame] | 714 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(N)); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 715 | return new (Mem) OMPFlushClause(N); |
| 716 | } |
| 717 | |
Alexey Bataev | f138fda | 2018-08-13 19:04:24 +0000 | [diff] [blame] | 718 | OMPDependClause * |
| 719 | OMPDependClause::Create(const ASTContext &C, SourceLocation StartLoc, |
| 720 | SourceLocation LParenLoc, SourceLocation EndLoc, |
| 721 | OpenMPDependClauseKind DepKind, SourceLocation DepLoc, |
| 722 | SourceLocation ColonLoc, ArrayRef<Expr *> VL, |
| 723 | unsigned NumLoops) { |
| 724 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(VL.size() + NumLoops)); |
| 725 | OMPDependClause *Clause = new (Mem) |
| 726 | OMPDependClause(StartLoc, LParenLoc, EndLoc, VL.size(), NumLoops); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 727 | Clause->setVarRefs(VL); |
| 728 | Clause->setDependencyKind(DepKind); |
| 729 | Clause->setDependencyLoc(DepLoc); |
| 730 | Clause->setColonLoc(ColonLoc); |
Alexey Bataev | f138fda | 2018-08-13 19:04:24 +0000 | [diff] [blame] | 731 | for (unsigned I = 0 ; I < NumLoops; ++I) |
| 732 | Clause->setLoopData(I, nullptr); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 733 | return Clause; |
| 734 | } |
| 735 | |
Alexey Bataev | f138fda | 2018-08-13 19:04:24 +0000 | [diff] [blame] | 736 | OMPDependClause *OMPDependClause::CreateEmpty(const ASTContext &C, unsigned N, |
| 737 | unsigned NumLoops) { |
| 738 | void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(N + NumLoops)); |
| 739 | return new (Mem) OMPDependClause(N, NumLoops); |
James Y Knight | b8bfd96 | 2015-10-02 13:41:04 +0000 | [diff] [blame] | 740 | } |
Kelvin Li | 0bff7af | 2015-11-23 05:32:03 +0000 | [diff] [blame] | 741 | |
Alexey Bataev | f138fda | 2018-08-13 19:04:24 +0000 | [diff] [blame] | 742 | void OMPDependClause::setLoopData(unsigned NumLoop, Expr *Cnt) { |
| 743 | assert((getDependencyKind() == OMPC_DEPEND_sink || |
| 744 | getDependencyKind() == OMPC_DEPEND_source) && |
| 745 | NumLoop < NumLoops && |
| 746 | "Expected sink or source depend + loop index must be less number of " |
| 747 | "loops."); |
| 748 | auto It = std::next(getVarRefs().end(), NumLoop); |
| 749 | *It = Cnt; |
Alexey Bataev | 8b42706 | 2016-05-25 12:36:08 +0000 | [diff] [blame] | 750 | } |
| 751 | |
Alexey Bataev | f138fda | 2018-08-13 19:04:24 +0000 | [diff] [blame] | 752 | Expr *OMPDependClause::getLoopData(unsigned NumLoop) { |
| 753 | assert((getDependencyKind() == OMPC_DEPEND_sink || |
| 754 | getDependencyKind() == OMPC_DEPEND_source) && |
| 755 | NumLoop < NumLoops && |
| 756 | "Expected sink or source depend + loop index must be less number of " |
| 757 | "loops."); |
| 758 | auto It = std::next(getVarRefs().end(), NumLoop); |
| 759 | return *It; |
Alexey Bataev | 8b42706 | 2016-05-25 12:36:08 +0000 | [diff] [blame] | 760 | } |
| 761 | |
Alexey Bataev | f138fda | 2018-08-13 19:04:24 +0000 | [diff] [blame] | 762 | const Expr *OMPDependClause::getLoopData(unsigned NumLoop) const { |
| 763 | assert((getDependencyKind() == OMPC_DEPEND_sink || |
| 764 | getDependencyKind() == OMPC_DEPEND_source) && |
| 765 | NumLoop < NumLoops && |
| 766 | "Expected sink or source depend + loop index must be less number of " |
| 767 | "loops."); |
| 768 | auto It = std::next(getVarRefs().end(), NumLoop); |
| 769 | return *It; |
Alexey Bataev | 8b42706 | 2016-05-25 12:36:08 +0000 | [diff] [blame] | 770 | } |
| 771 | |
Samuel Antao | 9092700 | 2016-04-26 14:54:23 +0000 | [diff] [blame] | 772 | unsigned OMPClauseMappableExprCommon::getComponentsTotalNumber( |
| 773 | MappableExprComponentListsRef ComponentLists) { |
| 774 | unsigned TotalNum = 0u; |
| 775 | for (auto &C : ComponentLists) |
| 776 | TotalNum += C.size(); |
| 777 | return TotalNum; |
| 778 | } |
| 779 | |
| 780 | unsigned OMPClauseMappableExprCommon::getUniqueDeclarationsTotalNumber( |
Alexey Bataev | e372710 | 2018-04-18 15:57:46 +0000 | [diff] [blame] | 781 | ArrayRef<const ValueDecl *> Declarations) { |
Samuel Antao | 9092700 | 2016-04-26 14:54:23 +0000 | [diff] [blame] | 782 | unsigned TotalNum = 0u; |
| 783 | llvm::SmallPtrSet<const ValueDecl *, 8> Cache; |
Alexey Bataev | e372710 | 2018-04-18 15:57:46 +0000 | [diff] [blame] | 784 | for (const ValueDecl *D : Declarations) { |
Samuel Antao | 9092700 | 2016-04-26 14:54:23 +0000 | [diff] [blame] | 785 | const ValueDecl *VD = D ? cast<ValueDecl>(D->getCanonicalDecl()) : nullptr; |
| 786 | if (Cache.count(VD)) |
| 787 | continue; |
| 788 | ++TotalNum; |
| 789 | Cache.insert(VD); |
| 790 | } |
| 791 | return TotalNum; |
| 792 | } |
| 793 | |
| 794 | OMPMapClause * |
| 795 | OMPMapClause::Create(const ASTContext &C, SourceLocation StartLoc, |
| 796 | SourceLocation LParenLoc, SourceLocation EndLoc, |
| 797 | ArrayRef<Expr *> Vars, ArrayRef<ValueDecl *> Declarations, |
| 798 | MappableExprComponentListsRef ComponentLists, |
| 799 | OpenMPMapClauseKind TypeModifier, OpenMPMapClauseKind Type, |
| 800 | bool TypeIsImplicit, SourceLocation TypeLoc) { |
Samuel Antao | 9092700 | 2016-04-26 14:54:23 +0000 | [diff] [blame] | 801 | unsigned NumVars = Vars.size(); |
| 802 | unsigned NumUniqueDeclarations = |
| 803 | getUniqueDeclarationsTotalNumber(Declarations); |
| 804 | unsigned NumComponentLists = ComponentLists.size(); |
| 805 | unsigned NumComponents = getComponentsTotalNumber(ComponentLists); |
| 806 | |
| 807 | // We need to allocate: |
| 808 | // NumVars x Expr* - we have an original list expression for each clause list |
| 809 | // entry. |
| 810 | // NumUniqueDeclarations x ValueDecl* - unique base declarations associated |
| 811 | // with each component list. |
| 812 | // (NumUniqueDeclarations + NumComponentLists) x unsigned - we specify the |
| 813 | // number of lists for each unique declaration and the size of each component |
| 814 | // list. |
| 815 | // NumComponents x MappableComponent - the total of all the components in all |
| 816 | // the lists. |
| 817 | void *Mem = C.Allocate( |
| 818 | totalSizeToAlloc<Expr *, ValueDecl *, unsigned, |
| 819 | OMPClauseMappableExprCommon::MappableComponent>( |
| 820 | NumVars, NumUniqueDeclarations, |
| 821 | NumUniqueDeclarations + NumComponentLists, NumComponents)); |
| 822 | OMPMapClause *Clause = new (Mem) OMPMapClause( |
| 823 | TypeModifier, Type, TypeIsImplicit, TypeLoc, StartLoc, LParenLoc, EndLoc, |
| 824 | NumVars, NumUniqueDeclarations, NumComponentLists, NumComponents); |
| 825 | |
| 826 | Clause->setVarRefs(Vars); |
| 827 | Clause->setClauseInfo(Declarations, ComponentLists); |
Kelvin Li | 0bff7af | 2015-11-23 05:32:03 +0000 | [diff] [blame] | 828 | Clause->setMapTypeModifier(TypeModifier); |
| 829 | Clause->setMapType(Type); |
| 830 | Clause->setMapLoc(TypeLoc); |
| 831 | return Clause; |
| 832 | } |
| 833 | |
Samuel Antao | 9092700 | 2016-04-26 14:54:23 +0000 | [diff] [blame] | 834 | OMPMapClause *OMPMapClause::CreateEmpty(const ASTContext &C, unsigned NumVars, |
| 835 | unsigned NumUniqueDeclarations, |
| 836 | unsigned NumComponentLists, |
| 837 | unsigned NumComponents) { |
| 838 | void *Mem = C.Allocate( |
| 839 | totalSizeToAlloc<Expr *, ValueDecl *, unsigned, |
| 840 | OMPClauseMappableExprCommon::MappableComponent>( |
| 841 | NumVars, NumUniqueDeclarations, |
| 842 | NumUniqueDeclarations + NumComponentLists, NumComponents)); |
| 843 | return new (Mem) OMPMapClause(NumVars, NumUniqueDeclarations, |
| 844 | NumComponentLists, NumComponents); |
Kelvin Li | 0bff7af | 2015-11-23 05:32:03 +0000 | [diff] [blame] | 845 | } |
Samuel Antao | 661c090 | 2016-05-26 17:39:58 +0000 | [diff] [blame] | 846 | |
| 847 | OMPToClause *OMPToClause::Create(const ASTContext &C, SourceLocation StartLoc, |
| 848 | SourceLocation LParenLoc, |
| 849 | SourceLocation EndLoc, ArrayRef<Expr *> Vars, |
| 850 | ArrayRef<ValueDecl *> Declarations, |
| 851 | MappableExprComponentListsRef ComponentLists) { |
| 852 | unsigned NumVars = Vars.size(); |
| 853 | unsigned NumUniqueDeclarations = |
| 854 | getUniqueDeclarationsTotalNumber(Declarations); |
| 855 | unsigned NumComponentLists = ComponentLists.size(); |
| 856 | unsigned NumComponents = getComponentsTotalNumber(ComponentLists); |
| 857 | |
| 858 | // We need to allocate: |
| 859 | // NumVars x Expr* - we have an original list expression for each clause list |
| 860 | // entry. |
| 861 | // NumUniqueDeclarations x ValueDecl* - unique base declarations associated |
| 862 | // with each component list. |
| 863 | // (NumUniqueDeclarations + NumComponentLists) x unsigned - we specify the |
| 864 | // number of lists for each unique declaration and the size of each component |
| 865 | // list. |
| 866 | // NumComponents x MappableComponent - the total of all the components in all |
| 867 | // the lists. |
| 868 | void *Mem = C.Allocate( |
| 869 | totalSizeToAlloc<Expr *, ValueDecl *, unsigned, |
| 870 | OMPClauseMappableExprCommon::MappableComponent>( |
| 871 | NumVars, NumUniqueDeclarations, |
| 872 | NumUniqueDeclarations + NumComponentLists, NumComponents)); |
| 873 | |
| 874 | OMPToClause *Clause = new (Mem) |
| 875 | OMPToClause(StartLoc, LParenLoc, EndLoc, NumVars, NumUniqueDeclarations, |
| 876 | NumComponentLists, NumComponents); |
| 877 | |
| 878 | Clause->setVarRefs(Vars); |
| 879 | Clause->setClauseInfo(Declarations, ComponentLists); |
| 880 | return Clause; |
| 881 | } |
| 882 | |
| 883 | OMPToClause *OMPToClause::CreateEmpty(const ASTContext &C, unsigned NumVars, |
| 884 | unsigned NumUniqueDeclarations, |
| 885 | unsigned NumComponentLists, |
| 886 | unsigned NumComponents) { |
| 887 | void *Mem = C.Allocate( |
| 888 | totalSizeToAlloc<Expr *, ValueDecl *, unsigned, |
| 889 | OMPClauseMappableExprCommon::MappableComponent>( |
| 890 | NumVars, NumUniqueDeclarations, |
| 891 | NumUniqueDeclarations + NumComponentLists, NumComponents)); |
| 892 | return new (Mem) OMPToClause(NumVars, NumUniqueDeclarations, |
| 893 | NumComponentLists, NumComponents); |
| 894 | } |
Samuel Antao | ec172c6 | 2016-05-26 17:49:04 +0000 | [diff] [blame] | 895 | |
| 896 | OMPFromClause * |
| 897 | OMPFromClause::Create(const ASTContext &C, SourceLocation StartLoc, |
| 898 | SourceLocation LParenLoc, SourceLocation EndLoc, |
| 899 | ArrayRef<Expr *> Vars, ArrayRef<ValueDecl *> Declarations, |
| 900 | MappableExprComponentListsRef ComponentLists) { |
| 901 | unsigned NumVars = Vars.size(); |
| 902 | unsigned NumUniqueDeclarations = |
| 903 | getUniqueDeclarationsTotalNumber(Declarations); |
| 904 | unsigned NumComponentLists = ComponentLists.size(); |
| 905 | unsigned NumComponents = getComponentsTotalNumber(ComponentLists); |
| 906 | |
| 907 | // We need to allocate: |
| 908 | // NumVars x Expr* - we have an original list expression for each clause list |
| 909 | // entry. |
| 910 | // NumUniqueDeclarations x ValueDecl* - unique base declarations associated |
| 911 | // with each component list. |
| 912 | // (NumUniqueDeclarations + NumComponentLists) x unsigned - we specify the |
| 913 | // number of lists for each unique declaration and the size of each component |
| 914 | // list. |
| 915 | // NumComponents x MappableComponent - the total of all the components in all |
| 916 | // the lists. |
| 917 | void *Mem = C.Allocate( |
| 918 | totalSizeToAlloc<Expr *, ValueDecl *, unsigned, |
| 919 | OMPClauseMappableExprCommon::MappableComponent>( |
| 920 | NumVars, NumUniqueDeclarations, |
| 921 | NumUniqueDeclarations + NumComponentLists, NumComponents)); |
| 922 | |
| 923 | OMPFromClause *Clause = new (Mem) |
| 924 | OMPFromClause(StartLoc, LParenLoc, EndLoc, NumVars, NumUniqueDeclarations, |
| 925 | NumComponentLists, NumComponents); |
| 926 | |
| 927 | Clause->setVarRefs(Vars); |
| 928 | Clause->setClauseInfo(Declarations, ComponentLists); |
| 929 | return Clause; |
| 930 | } |
| 931 | |
| 932 | OMPFromClause *OMPFromClause::CreateEmpty(const ASTContext &C, unsigned NumVars, |
| 933 | unsigned NumUniqueDeclarations, |
| 934 | unsigned NumComponentLists, |
| 935 | unsigned NumComponents) { |
| 936 | void *Mem = C.Allocate( |
| 937 | totalSizeToAlloc<Expr *, ValueDecl *, unsigned, |
| 938 | OMPClauseMappableExprCommon::MappableComponent>( |
| 939 | NumVars, NumUniqueDeclarations, |
| 940 | NumUniqueDeclarations + NumComponentLists, NumComponents)); |
| 941 | return new (Mem) OMPFromClause(NumVars, NumUniqueDeclarations, |
| 942 | NumComponentLists, NumComponents); |
| 943 | } |
Carlo Bertolli | 2404b17 | 2016-07-13 15:37:16 +0000 | [diff] [blame] | 944 | |
Samuel Antao | cc10b85 | 2016-07-28 14:23:26 +0000 | [diff] [blame] | 945 | void OMPUseDevicePtrClause::setPrivateCopies(ArrayRef<Expr *> VL) { |
| 946 | assert(VL.size() == varlist_size() && |
| 947 | "Number of private copies is not the same as the preallocated buffer"); |
| 948 | std::copy(VL.begin(), VL.end(), varlist_end()); |
| 949 | } |
| 950 | |
| 951 | void OMPUseDevicePtrClause::setInits(ArrayRef<Expr *> VL) { |
| 952 | assert(VL.size() == varlist_size() && |
| 953 | "Number of inits is not the same as the preallocated buffer"); |
| 954 | std::copy(VL.begin(), VL.end(), getPrivateCopies().end()); |
| 955 | } |
| 956 | |
| 957 | OMPUseDevicePtrClause *OMPUseDevicePtrClause::Create( |
| 958 | const ASTContext &C, SourceLocation StartLoc, SourceLocation LParenLoc, |
| 959 | SourceLocation EndLoc, ArrayRef<Expr *> Vars, ArrayRef<Expr *> PrivateVars, |
| 960 | ArrayRef<Expr *> Inits, ArrayRef<ValueDecl *> Declarations, |
| 961 | MappableExprComponentListsRef ComponentLists) { |
| 962 | unsigned NumVars = Vars.size(); |
| 963 | unsigned NumUniqueDeclarations = |
| 964 | getUniqueDeclarationsTotalNumber(Declarations); |
| 965 | unsigned NumComponentLists = ComponentLists.size(); |
| 966 | unsigned NumComponents = getComponentsTotalNumber(ComponentLists); |
| 967 | |
| 968 | // We need to allocate: |
| 969 | // 3 x NumVars x Expr* - we have an original list expression for each clause |
| 970 | // list entry and an equal number of private copies and inits. |
| 971 | // NumUniqueDeclarations x ValueDecl* - unique base declarations associated |
| 972 | // with each component list. |
| 973 | // (NumUniqueDeclarations + NumComponentLists) x unsigned - we specify the |
| 974 | // number of lists for each unique declaration and the size of each component |
| 975 | // list. |
| 976 | // NumComponents x MappableComponent - the total of all the components in all |
| 977 | // the lists. |
| 978 | void *Mem = C.Allocate( |
| 979 | totalSizeToAlloc<Expr *, ValueDecl *, unsigned, |
| 980 | OMPClauseMappableExprCommon::MappableComponent>( |
| 981 | 3 * NumVars, NumUniqueDeclarations, |
| 982 | NumUniqueDeclarations + NumComponentLists, NumComponents)); |
| 983 | |
| 984 | OMPUseDevicePtrClause *Clause = new (Mem) OMPUseDevicePtrClause( |
| 985 | StartLoc, LParenLoc, EndLoc, NumVars, NumUniqueDeclarations, |
| 986 | NumComponentLists, NumComponents); |
| 987 | |
| 988 | Clause->setVarRefs(Vars); |
| 989 | Clause->setPrivateCopies(PrivateVars); |
| 990 | Clause->setInits(Inits); |
| 991 | Clause->setClauseInfo(Declarations, ComponentLists); |
Carlo Bertolli | 2404b17 | 2016-07-13 15:37:16 +0000 | [diff] [blame] | 992 | return Clause; |
| 993 | } |
| 994 | |
Samuel Antao | cc10b85 | 2016-07-28 14:23:26 +0000 | [diff] [blame] | 995 | OMPUseDevicePtrClause *OMPUseDevicePtrClause::CreateEmpty( |
| 996 | const ASTContext &C, unsigned NumVars, unsigned NumUniqueDeclarations, |
| 997 | unsigned NumComponentLists, unsigned NumComponents) { |
| 998 | void *Mem = C.Allocate( |
| 999 | totalSizeToAlloc<Expr *, ValueDecl *, unsigned, |
| 1000 | OMPClauseMappableExprCommon::MappableComponent>( |
| 1001 | 3 * NumVars, NumUniqueDeclarations, |
| 1002 | NumUniqueDeclarations + NumComponentLists, NumComponents)); |
| 1003 | return new (Mem) OMPUseDevicePtrClause(NumVars, NumUniqueDeclarations, |
| 1004 | NumComponentLists, NumComponents); |
Carlo Bertolli | 2404b17 | 2016-07-13 15:37:16 +0000 | [diff] [blame] | 1005 | } |
Carlo Bertolli | 70594e9 | 2016-07-13 17:16:49 +0000 | [diff] [blame] | 1006 | |
Samuel Antao | 6890b09 | 2016-07-28 14:25:09 +0000 | [diff] [blame] | 1007 | OMPIsDevicePtrClause * |
| 1008 | OMPIsDevicePtrClause::Create(const ASTContext &C, SourceLocation StartLoc, |
| 1009 | SourceLocation LParenLoc, SourceLocation EndLoc, |
| 1010 | ArrayRef<Expr *> Vars, |
| 1011 | ArrayRef<ValueDecl *> Declarations, |
| 1012 | MappableExprComponentListsRef ComponentLists) { |
| 1013 | unsigned NumVars = Vars.size(); |
| 1014 | unsigned NumUniqueDeclarations = |
| 1015 | getUniqueDeclarationsTotalNumber(Declarations); |
| 1016 | unsigned NumComponentLists = ComponentLists.size(); |
| 1017 | unsigned NumComponents = getComponentsTotalNumber(ComponentLists); |
| 1018 | |
| 1019 | // We need to allocate: |
| 1020 | // NumVars x Expr* - we have an original list expression for each clause list |
| 1021 | // entry. |
| 1022 | // NumUniqueDeclarations x ValueDecl* - unique base declarations associated |
| 1023 | // with each component list. |
| 1024 | // (NumUniqueDeclarations + NumComponentLists) x unsigned - we specify the |
| 1025 | // number of lists for each unique declaration and the size of each component |
| 1026 | // list. |
| 1027 | // NumComponents x MappableComponent - the total of all the components in all |
| 1028 | // the lists. |
| 1029 | void *Mem = C.Allocate( |
| 1030 | totalSizeToAlloc<Expr *, ValueDecl *, unsigned, |
| 1031 | OMPClauseMappableExprCommon::MappableComponent>( |
| 1032 | NumVars, NumUniqueDeclarations, |
| 1033 | NumUniqueDeclarations + NumComponentLists, NumComponents)); |
| 1034 | |
| 1035 | OMPIsDevicePtrClause *Clause = new (Mem) OMPIsDevicePtrClause( |
| 1036 | StartLoc, LParenLoc, EndLoc, NumVars, NumUniqueDeclarations, |
| 1037 | NumComponentLists, NumComponents); |
| 1038 | |
| 1039 | Clause->setVarRefs(Vars); |
| 1040 | Clause->setClauseInfo(Declarations, ComponentLists); |
Carlo Bertolli | 70594e9 | 2016-07-13 17:16:49 +0000 | [diff] [blame] | 1041 | return Clause; |
| 1042 | } |
| 1043 | |
Samuel Antao | 6890b09 | 2016-07-28 14:25:09 +0000 | [diff] [blame] | 1044 | OMPIsDevicePtrClause *OMPIsDevicePtrClause::CreateEmpty( |
| 1045 | const ASTContext &C, unsigned NumVars, unsigned NumUniqueDeclarations, |
| 1046 | unsigned NumComponentLists, unsigned NumComponents) { |
| 1047 | void *Mem = C.Allocate( |
| 1048 | totalSizeToAlloc<Expr *, ValueDecl *, unsigned, |
| 1049 | OMPClauseMappableExprCommon::MappableComponent>( |
| 1050 | NumVars, NumUniqueDeclarations, |
| 1051 | NumUniqueDeclarations + NumComponentLists, NumComponents)); |
| 1052 | return new (Mem) OMPIsDevicePtrClause(NumVars, NumUniqueDeclarations, |
| 1053 | NumComponentLists, NumComponents); |
Carlo Bertolli | 70594e9 | 2016-07-13 17:16:49 +0000 | [diff] [blame] | 1054 | } |
Patrick Lyster | 074c3ae2 | 2018-10-18 14:28:23 +0000 | [diff] [blame] | 1055 | |
| 1056 | //===----------------------------------------------------------------------===// |
| 1057 | // OpenMP clauses printing methods |
| 1058 | //===----------------------------------------------------------------------===// |
| 1059 | |
| 1060 | void OMPClausePrinter::VisitOMPIfClause(OMPIfClause *Node) { |
| 1061 | OS << "if("; |
| 1062 | if (Node->getNameModifier() != OMPD_unknown) |
| 1063 | OS << getOpenMPDirectiveName(Node->getNameModifier()) << ": "; |
| 1064 | Node->getCondition()->printPretty(OS, nullptr, Policy, 0); |
| 1065 | OS << ")"; |
| 1066 | } |
| 1067 | |
| 1068 | void OMPClausePrinter::VisitOMPFinalClause(OMPFinalClause *Node) { |
| 1069 | OS << "final("; |
| 1070 | Node->getCondition()->printPretty(OS, nullptr, Policy, 0); |
| 1071 | OS << ")"; |
| 1072 | } |
| 1073 | |
| 1074 | void OMPClausePrinter::VisitOMPNumThreadsClause(OMPNumThreadsClause *Node) { |
| 1075 | OS << "num_threads("; |
| 1076 | Node->getNumThreads()->printPretty(OS, nullptr, Policy, 0); |
| 1077 | OS << ")"; |
| 1078 | } |
| 1079 | |
| 1080 | void OMPClausePrinter::VisitOMPSafelenClause(OMPSafelenClause *Node) { |
| 1081 | OS << "safelen("; |
| 1082 | Node->getSafelen()->printPretty(OS, nullptr, Policy, 0); |
| 1083 | OS << ")"; |
| 1084 | } |
| 1085 | |
| 1086 | void OMPClausePrinter::VisitOMPSimdlenClause(OMPSimdlenClause *Node) { |
| 1087 | OS << "simdlen("; |
| 1088 | Node->getSimdlen()->printPretty(OS, nullptr, Policy, 0); |
| 1089 | OS << ")"; |
| 1090 | } |
| 1091 | |
| 1092 | void OMPClausePrinter::VisitOMPCollapseClause(OMPCollapseClause *Node) { |
| 1093 | OS << "collapse("; |
| 1094 | Node->getNumForLoops()->printPretty(OS, nullptr, Policy, 0); |
| 1095 | OS << ")"; |
| 1096 | } |
| 1097 | |
| 1098 | void OMPClausePrinter::VisitOMPDefaultClause(OMPDefaultClause *Node) { |
| 1099 | OS << "default(" |
| 1100 | << getOpenMPSimpleClauseTypeName(OMPC_default, Node->getDefaultKind()) |
| 1101 | << ")"; |
| 1102 | } |
| 1103 | |
| 1104 | void OMPClausePrinter::VisitOMPProcBindClause(OMPProcBindClause *Node) { |
| 1105 | OS << "proc_bind(" |
| 1106 | << getOpenMPSimpleClauseTypeName(OMPC_proc_bind, Node->getProcBindKind()) |
| 1107 | << ")"; |
| 1108 | } |
| 1109 | |
| 1110 | void OMPClausePrinter::VisitOMPUnifiedAddressClause(OMPUnifiedAddressClause *) { |
| 1111 | OS << "unified_address"; |
| 1112 | } |
| 1113 | |
| 1114 | void OMPClausePrinter::VisitOMPUnifiedSharedMemoryClause( |
| 1115 | OMPUnifiedSharedMemoryClause *) { |
| 1116 | OS << "unified_shared_memory"; |
| 1117 | } |
| 1118 | |
| 1119 | void OMPClausePrinter::VisitOMPReverseOffloadClause(OMPReverseOffloadClause *) { |
| 1120 | OS << "reverse_offload"; |
| 1121 | } |
| 1122 | |
| 1123 | void OMPClausePrinter::VisitOMPDynamicAllocatorsClause( |
| 1124 | OMPDynamicAllocatorsClause *) { |
| 1125 | OS << "dynamic_allocators"; |
| 1126 | } |
| 1127 | |
Patrick Lyster | 7a2a27c | 2018-11-02 12:18:11 +0000 | [diff] [blame^] | 1128 | void OMPClausePrinter::VisitOMPAtomicDefaultMemOrderClause( |
| 1129 | OMPAtomicDefaultMemOrderClause *Node) { |
| 1130 | OS << "atomic_default_mem_order(" |
| 1131 | << getOpenMPSimpleClauseTypeName(OMPC_atomic_default_mem_order, |
| 1132 | Node->getAtomicDefaultMemOrderKind()) |
| 1133 | << ")"; |
| 1134 | } |
| 1135 | |
Patrick Lyster | 074c3ae2 | 2018-10-18 14:28:23 +0000 | [diff] [blame] | 1136 | void OMPClausePrinter::VisitOMPScheduleClause(OMPScheduleClause *Node) { |
| 1137 | OS << "schedule("; |
| 1138 | if (Node->getFirstScheduleModifier() != OMPC_SCHEDULE_MODIFIER_unknown) { |
| 1139 | OS << getOpenMPSimpleClauseTypeName(OMPC_schedule, |
| 1140 | Node->getFirstScheduleModifier()); |
| 1141 | if (Node->getSecondScheduleModifier() != OMPC_SCHEDULE_MODIFIER_unknown) { |
| 1142 | OS << ", "; |
| 1143 | OS << getOpenMPSimpleClauseTypeName(OMPC_schedule, |
| 1144 | Node->getSecondScheduleModifier()); |
| 1145 | } |
| 1146 | OS << ": "; |
| 1147 | } |
| 1148 | OS << getOpenMPSimpleClauseTypeName(OMPC_schedule, Node->getScheduleKind()); |
| 1149 | if (auto *E = Node->getChunkSize()) { |
| 1150 | OS << ", "; |
| 1151 | E->printPretty(OS, nullptr, Policy); |
| 1152 | } |
| 1153 | OS << ")"; |
| 1154 | } |
| 1155 | |
| 1156 | void OMPClausePrinter::VisitOMPOrderedClause(OMPOrderedClause *Node) { |
| 1157 | OS << "ordered"; |
| 1158 | if (auto *Num = Node->getNumForLoops()) { |
| 1159 | OS << "("; |
| 1160 | Num->printPretty(OS, nullptr, Policy, 0); |
| 1161 | OS << ")"; |
| 1162 | } |
| 1163 | } |
| 1164 | |
| 1165 | void OMPClausePrinter::VisitOMPNowaitClause(OMPNowaitClause *) { |
| 1166 | OS << "nowait"; |
| 1167 | } |
| 1168 | |
| 1169 | void OMPClausePrinter::VisitOMPUntiedClause(OMPUntiedClause *) { |
| 1170 | OS << "untied"; |
| 1171 | } |
| 1172 | |
| 1173 | void OMPClausePrinter::VisitOMPNogroupClause(OMPNogroupClause *) { |
| 1174 | OS << "nogroup"; |
| 1175 | } |
| 1176 | |
| 1177 | void OMPClausePrinter::VisitOMPMergeableClause(OMPMergeableClause *) { |
| 1178 | OS << "mergeable"; |
| 1179 | } |
| 1180 | |
| 1181 | void OMPClausePrinter::VisitOMPReadClause(OMPReadClause *) { OS << "read"; } |
| 1182 | |
| 1183 | void OMPClausePrinter::VisitOMPWriteClause(OMPWriteClause *) { OS << "write"; } |
| 1184 | |
| 1185 | void OMPClausePrinter::VisitOMPUpdateClause(OMPUpdateClause *) { |
| 1186 | OS << "update"; |
| 1187 | } |
| 1188 | |
| 1189 | void OMPClausePrinter::VisitOMPCaptureClause(OMPCaptureClause *) { |
| 1190 | OS << "capture"; |
| 1191 | } |
| 1192 | |
| 1193 | void OMPClausePrinter::VisitOMPSeqCstClause(OMPSeqCstClause *) { |
| 1194 | OS << "seq_cst"; |
| 1195 | } |
| 1196 | |
| 1197 | void OMPClausePrinter::VisitOMPThreadsClause(OMPThreadsClause *) { |
| 1198 | OS << "threads"; |
| 1199 | } |
| 1200 | |
| 1201 | void OMPClausePrinter::VisitOMPSIMDClause(OMPSIMDClause *) { OS << "simd"; } |
| 1202 | |
| 1203 | void OMPClausePrinter::VisitOMPDeviceClause(OMPDeviceClause *Node) { |
| 1204 | OS << "device("; |
| 1205 | Node->getDevice()->printPretty(OS, nullptr, Policy, 0); |
| 1206 | OS << ")"; |
| 1207 | } |
| 1208 | |
| 1209 | void OMPClausePrinter::VisitOMPNumTeamsClause(OMPNumTeamsClause *Node) { |
| 1210 | OS << "num_teams("; |
| 1211 | Node->getNumTeams()->printPretty(OS, nullptr, Policy, 0); |
| 1212 | OS << ")"; |
| 1213 | } |
| 1214 | |
| 1215 | void OMPClausePrinter::VisitOMPThreadLimitClause(OMPThreadLimitClause *Node) { |
| 1216 | OS << "thread_limit("; |
| 1217 | Node->getThreadLimit()->printPretty(OS, nullptr, Policy, 0); |
| 1218 | OS << ")"; |
| 1219 | } |
| 1220 | |
| 1221 | void OMPClausePrinter::VisitOMPPriorityClause(OMPPriorityClause *Node) { |
| 1222 | OS << "priority("; |
| 1223 | Node->getPriority()->printPretty(OS, nullptr, Policy, 0); |
| 1224 | OS << ")"; |
| 1225 | } |
| 1226 | |
| 1227 | void OMPClausePrinter::VisitOMPGrainsizeClause(OMPGrainsizeClause *Node) { |
| 1228 | OS << "grainsize("; |
| 1229 | Node->getGrainsize()->printPretty(OS, nullptr, Policy, 0); |
| 1230 | OS << ")"; |
| 1231 | } |
| 1232 | |
| 1233 | void OMPClausePrinter::VisitOMPNumTasksClause(OMPNumTasksClause *Node) { |
| 1234 | OS << "num_tasks("; |
| 1235 | Node->getNumTasks()->printPretty(OS, nullptr, Policy, 0); |
| 1236 | OS << ")"; |
| 1237 | } |
| 1238 | |
| 1239 | void OMPClausePrinter::VisitOMPHintClause(OMPHintClause *Node) { |
| 1240 | OS << "hint("; |
| 1241 | Node->getHint()->printPretty(OS, nullptr, Policy, 0); |
| 1242 | OS << ")"; |
| 1243 | } |
| 1244 | |
| 1245 | template<typename T> |
| 1246 | void OMPClausePrinter::VisitOMPClauseList(T *Node, char StartSym) { |
| 1247 | for (typename T::varlist_iterator I = Node->varlist_begin(), |
| 1248 | E = Node->varlist_end(); |
| 1249 | I != E; ++I) { |
| 1250 | assert(*I && "Expected non-null Stmt"); |
| 1251 | OS << (I == Node->varlist_begin() ? StartSym : ','); |
| 1252 | if (auto *DRE = dyn_cast<DeclRefExpr>(*I)) { |
| 1253 | if (isa<OMPCapturedExprDecl>(DRE->getDecl())) |
| 1254 | DRE->printPretty(OS, nullptr, Policy, 0); |
| 1255 | else |
| 1256 | DRE->getDecl()->printQualifiedName(OS); |
| 1257 | } else |
| 1258 | (*I)->printPretty(OS, nullptr, Policy, 0); |
| 1259 | } |
| 1260 | } |
| 1261 | |
| 1262 | void OMPClausePrinter::VisitOMPPrivateClause(OMPPrivateClause *Node) { |
| 1263 | if (!Node->varlist_empty()) { |
| 1264 | OS << "private"; |
| 1265 | VisitOMPClauseList(Node, '('); |
| 1266 | OS << ")"; |
| 1267 | } |
| 1268 | } |
| 1269 | |
| 1270 | void OMPClausePrinter::VisitOMPFirstprivateClause(OMPFirstprivateClause *Node) { |
| 1271 | if (!Node->varlist_empty()) { |
| 1272 | OS << "firstprivate"; |
| 1273 | VisitOMPClauseList(Node, '('); |
| 1274 | OS << ")"; |
| 1275 | } |
| 1276 | } |
| 1277 | |
| 1278 | void OMPClausePrinter::VisitOMPLastprivateClause(OMPLastprivateClause *Node) { |
| 1279 | if (!Node->varlist_empty()) { |
| 1280 | OS << "lastprivate"; |
| 1281 | VisitOMPClauseList(Node, '('); |
| 1282 | OS << ")"; |
| 1283 | } |
| 1284 | } |
| 1285 | |
| 1286 | void OMPClausePrinter::VisitOMPSharedClause(OMPSharedClause *Node) { |
| 1287 | if (!Node->varlist_empty()) { |
| 1288 | OS << "shared"; |
| 1289 | VisitOMPClauseList(Node, '('); |
| 1290 | OS << ")"; |
| 1291 | } |
| 1292 | } |
| 1293 | |
| 1294 | void OMPClausePrinter::VisitOMPReductionClause(OMPReductionClause *Node) { |
| 1295 | if (!Node->varlist_empty()) { |
| 1296 | OS << "reduction("; |
| 1297 | NestedNameSpecifier *QualifierLoc = |
| 1298 | Node->getQualifierLoc().getNestedNameSpecifier(); |
| 1299 | OverloadedOperatorKind OOK = |
| 1300 | Node->getNameInfo().getName().getCXXOverloadedOperator(); |
| 1301 | if (QualifierLoc == nullptr && OOK != OO_None) { |
| 1302 | // Print reduction identifier in C format |
| 1303 | OS << getOperatorSpelling(OOK); |
| 1304 | } else { |
| 1305 | // Use C++ format |
| 1306 | if (QualifierLoc != nullptr) |
| 1307 | QualifierLoc->print(OS, Policy); |
| 1308 | OS << Node->getNameInfo(); |
| 1309 | } |
| 1310 | OS << ":"; |
| 1311 | VisitOMPClauseList(Node, ' '); |
| 1312 | OS << ")"; |
| 1313 | } |
| 1314 | } |
| 1315 | |
| 1316 | void OMPClausePrinter::VisitOMPTaskReductionClause( |
| 1317 | OMPTaskReductionClause *Node) { |
| 1318 | if (!Node->varlist_empty()) { |
| 1319 | OS << "task_reduction("; |
| 1320 | NestedNameSpecifier *QualifierLoc = |
| 1321 | Node->getQualifierLoc().getNestedNameSpecifier(); |
| 1322 | OverloadedOperatorKind OOK = |
| 1323 | Node->getNameInfo().getName().getCXXOverloadedOperator(); |
| 1324 | if (QualifierLoc == nullptr && OOK != OO_None) { |
| 1325 | // Print reduction identifier in C format |
| 1326 | OS << getOperatorSpelling(OOK); |
| 1327 | } else { |
| 1328 | // Use C++ format |
| 1329 | if (QualifierLoc != nullptr) |
| 1330 | QualifierLoc->print(OS, Policy); |
| 1331 | OS << Node->getNameInfo(); |
| 1332 | } |
| 1333 | OS << ":"; |
| 1334 | VisitOMPClauseList(Node, ' '); |
| 1335 | OS << ")"; |
| 1336 | } |
| 1337 | } |
| 1338 | |
| 1339 | void OMPClausePrinter::VisitOMPInReductionClause(OMPInReductionClause *Node) { |
| 1340 | if (!Node->varlist_empty()) { |
| 1341 | OS << "in_reduction("; |
| 1342 | NestedNameSpecifier *QualifierLoc = |
| 1343 | Node->getQualifierLoc().getNestedNameSpecifier(); |
| 1344 | OverloadedOperatorKind OOK = |
| 1345 | Node->getNameInfo().getName().getCXXOverloadedOperator(); |
| 1346 | if (QualifierLoc == nullptr && OOK != OO_None) { |
| 1347 | // Print reduction identifier in C format |
| 1348 | OS << getOperatorSpelling(OOK); |
| 1349 | } else { |
| 1350 | // Use C++ format |
| 1351 | if (QualifierLoc != nullptr) |
| 1352 | QualifierLoc->print(OS, Policy); |
| 1353 | OS << Node->getNameInfo(); |
| 1354 | } |
| 1355 | OS << ":"; |
| 1356 | VisitOMPClauseList(Node, ' '); |
| 1357 | OS << ")"; |
| 1358 | } |
| 1359 | } |
| 1360 | |
| 1361 | void OMPClausePrinter::VisitOMPLinearClause(OMPLinearClause *Node) { |
| 1362 | if (!Node->varlist_empty()) { |
| 1363 | OS << "linear"; |
| 1364 | if (Node->getModifierLoc().isValid()) { |
| 1365 | OS << '(' |
| 1366 | << getOpenMPSimpleClauseTypeName(OMPC_linear, Node->getModifier()); |
| 1367 | } |
| 1368 | VisitOMPClauseList(Node, '('); |
| 1369 | if (Node->getModifierLoc().isValid()) |
| 1370 | OS << ')'; |
| 1371 | if (Node->getStep() != nullptr) { |
| 1372 | OS << ": "; |
| 1373 | Node->getStep()->printPretty(OS, nullptr, Policy, 0); |
| 1374 | } |
| 1375 | OS << ")"; |
| 1376 | } |
| 1377 | } |
| 1378 | |
| 1379 | void OMPClausePrinter::VisitOMPAlignedClause(OMPAlignedClause *Node) { |
| 1380 | if (!Node->varlist_empty()) { |
| 1381 | OS << "aligned"; |
| 1382 | VisitOMPClauseList(Node, '('); |
| 1383 | if (Node->getAlignment() != nullptr) { |
| 1384 | OS << ": "; |
| 1385 | Node->getAlignment()->printPretty(OS, nullptr, Policy, 0); |
| 1386 | } |
| 1387 | OS << ")"; |
| 1388 | } |
| 1389 | } |
| 1390 | |
| 1391 | void OMPClausePrinter::VisitOMPCopyinClause(OMPCopyinClause *Node) { |
| 1392 | if (!Node->varlist_empty()) { |
| 1393 | OS << "copyin"; |
| 1394 | VisitOMPClauseList(Node, '('); |
| 1395 | OS << ")"; |
| 1396 | } |
| 1397 | } |
| 1398 | |
| 1399 | void OMPClausePrinter::VisitOMPCopyprivateClause(OMPCopyprivateClause *Node) { |
| 1400 | if (!Node->varlist_empty()) { |
| 1401 | OS << "copyprivate"; |
| 1402 | VisitOMPClauseList(Node, '('); |
| 1403 | OS << ")"; |
| 1404 | } |
| 1405 | } |
| 1406 | |
| 1407 | void OMPClausePrinter::VisitOMPFlushClause(OMPFlushClause *Node) { |
| 1408 | if (!Node->varlist_empty()) { |
| 1409 | VisitOMPClauseList(Node, '('); |
| 1410 | OS << ")"; |
| 1411 | } |
| 1412 | } |
| 1413 | |
| 1414 | void OMPClausePrinter::VisitOMPDependClause(OMPDependClause *Node) { |
| 1415 | OS << "depend("; |
| 1416 | OS << getOpenMPSimpleClauseTypeName(Node->getClauseKind(), |
| 1417 | Node->getDependencyKind()); |
| 1418 | if (!Node->varlist_empty()) { |
| 1419 | OS << " :"; |
| 1420 | VisitOMPClauseList(Node, ' '); |
| 1421 | } |
| 1422 | OS << ")"; |
| 1423 | } |
| 1424 | |
| 1425 | void OMPClausePrinter::VisitOMPMapClause(OMPMapClause *Node) { |
| 1426 | if (!Node->varlist_empty()) { |
| 1427 | OS << "map("; |
| 1428 | if (Node->getMapType() != OMPC_MAP_unknown) { |
| 1429 | if (Node->getMapTypeModifier() != OMPC_MAP_unknown) { |
| 1430 | OS << getOpenMPSimpleClauseTypeName(OMPC_map, |
| 1431 | Node->getMapTypeModifier()); |
| 1432 | OS << ','; |
| 1433 | } |
| 1434 | OS << getOpenMPSimpleClauseTypeName(OMPC_map, Node->getMapType()); |
| 1435 | OS << ':'; |
| 1436 | } |
| 1437 | VisitOMPClauseList(Node, ' '); |
| 1438 | OS << ")"; |
| 1439 | } |
| 1440 | } |
| 1441 | |
| 1442 | void OMPClausePrinter::VisitOMPToClause(OMPToClause *Node) { |
| 1443 | if (!Node->varlist_empty()) { |
| 1444 | OS << "to"; |
| 1445 | VisitOMPClauseList(Node, '('); |
| 1446 | OS << ")"; |
| 1447 | } |
| 1448 | } |
| 1449 | |
| 1450 | void OMPClausePrinter::VisitOMPFromClause(OMPFromClause *Node) { |
| 1451 | if (!Node->varlist_empty()) { |
| 1452 | OS << "from"; |
| 1453 | VisitOMPClauseList(Node, '('); |
| 1454 | OS << ")"; |
| 1455 | } |
| 1456 | } |
| 1457 | |
| 1458 | void OMPClausePrinter::VisitOMPDistScheduleClause(OMPDistScheduleClause *Node) { |
| 1459 | OS << "dist_schedule(" << getOpenMPSimpleClauseTypeName( |
| 1460 | OMPC_dist_schedule, Node->getDistScheduleKind()); |
| 1461 | if (auto *E = Node->getChunkSize()) { |
| 1462 | OS << ", "; |
| 1463 | E->printPretty(OS, nullptr, Policy); |
| 1464 | } |
| 1465 | OS << ")"; |
| 1466 | } |
| 1467 | |
| 1468 | void OMPClausePrinter::VisitOMPDefaultmapClause(OMPDefaultmapClause *Node) { |
| 1469 | OS << "defaultmap("; |
| 1470 | OS << getOpenMPSimpleClauseTypeName(OMPC_defaultmap, |
| 1471 | Node->getDefaultmapModifier()); |
| 1472 | OS << ": "; |
| 1473 | OS << getOpenMPSimpleClauseTypeName(OMPC_defaultmap, |
| 1474 | Node->getDefaultmapKind()); |
| 1475 | OS << ")"; |
| 1476 | } |
| 1477 | |
| 1478 | void OMPClausePrinter::VisitOMPUseDevicePtrClause(OMPUseDevicePtrClause *Node) { |
| 1479 | if (!Node->varlist_empty()) { |
| 1480 | OS << "use_device_ptr"; |
| 1481 | VisitOMPClauseList(Node, '('); |
| 1482 | OS << ")"; |
| 1483 | } |
| 1484 | } |
| 1485 | |
| 1486 | void OMPClausePrinter::VisitOMPIsDevicePtrClause(OMPIsDevicePtrClause *Node) { |
| 1487 | if (!Node->varlist_empty()) { |
| 1488 | OS << "is_device_ptr"; |
| 1489 | VisitOMPClauseList(Node, '('); |
| 1490 | OS << ")"; |
| 1491 | } |
| 1492 | } |
| 1493 | |