Lines Matching defs:NumLoops

343                                            unsigned NumLoops,
347 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(2 * NumLoops));
349 new (Mem) OMPOrderedClause(Num, NumLoops, StartLoc, LParenLoc, EndLoc);
350 for (unsigned I = 0; I < NumLoops; ++I) {
358 unsigned NumLoops) {
359 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(2 * NumLoops));
360 auto *Clause = new (Mem) OMPOrderedClause(NumLoops);
361 for (unsigned I = 0; I < NumLoops; ++I) {
987 unsigned NumLoops) {
988 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(NumLoops));
989 return new (Mem) OMPPermutationClause(NumLoops);
1080 ArrayRef<Expr *> VL, unsigned NumLoops) {
1082 totalSizeToAlloc<Expr *>(VL.size() + /*depend-modifier*/ 1 + NumLoops),
1085 OMPDependClause(StartLoc, LParenLoc, EndLoc, VL.size(), NumLoops);
1092 for (unsigned I = 0 ; I < NumLoops; ++I)
1098 unsigned NumLoops) {
1100 C.Allocate(totalSizeToAlloc<Expr *>(N + /*depend-modifier*/ 1 + NumLoops),
1102 return new (Mem) OMPDependClause(N, NumLoops);
1108 NumLoop < NumLoops &&
1118 NumLoop < NumLoops &&
1128 NumLoop < NumLoops &&
1701 ArrayRef<Expr *> VL, unsigned NumLoops) {
1702 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(VL.size() + NumLoops),
1705 OMPDoacrossClause(StartLoc, LParenLoc, EndLoc, VL.size(), NumLoops);
1710 for (unsigned I = 0; I < NumLoops; ++I)
1717 unsigned NumLoops) {
1718 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(N + NumLoops),
1720 return new (Mem) OMPDoacrossClause(N, NumLoops);
1724 assert(NumLoop < NumLoops && "Loop index must be less number of loops.");
1730 assert(NumLoop < NumLoops && "Loop index must be less number of loops.");
1736 assert(NumLoop < NumLoops && "Loop index must be less number of loops.");