forked from OSchip/llvm-project
[OPENMP 4.5] Parsing/sema support for 'omp taskloop simd' directive.
OpenMP 4.5 adds directive 'taskloop simd'. Patch adds parsing/sema analysis for 'taskloop simd' directive and its clauses. llvm-svn: 254597
This commit is contained in:
parent
830dfccfb2
commit
0a6ed84a0d
|
@ -2260,7 +2260,11 @@ enum CXCursorKind {
|
|||
*/
|
||||
CXCursor_OMPTaskLoopDirective = 258,
|
||||
|
||||
CXCursor_LastStmt = CXCursor_OMPTaskLoopDirective,
|
||||
/** \brief OpenMP taskloop simd directive.
|
||||
*/
|
||||
CXCursor_OMPTaskLoopSimdDirective = 259,
|
||||
|
||||
CXCursor_LastStmt = CXCursor_OMPTaskLoopSimdDirective,
|
||||
|
||||
/**
|
||||
* \brief Cursor that represents the translation unit itself.
|
||||
|
|
|
@ -2436,6 +2436,9 @@ DEF_TRAVERSE_STMT(OMPTeamsDirective,
|
|||
DEF_TRAVERSE_STMT(OMPTaskLoopDirective,
|
||||
{ TRY_TO(TraverseOMPExecutableDirective(S)); })
|
||||
|
||||
DEF_TRAVERSE_STMT(OMPTaskLoopSimdDirective,
|
||||
{ TRY_TO(TraverseOMPExecutableDirective(S)); })
|
||||
|
||||
// OpenMP clauses.
|
||||
template <typename Derived>
|
||||
bool RecursiveASTVisitor<Derived>::TraverseOMPClause(OMPClause *C) {
|
||||
|
|
|
@ -391,7 +391,8 @@ protected:
|
|||
|
||||
/// \brief Offset to the start of children expression arrays.
|
||||
static unsigned getArraysOffset(OpenMPDirectiveKind Kind) {
|
||||
return (isOpenMPWorksharingDirective(Kind) || Kind == OMPD_taskloop)
|
||||
return (isOpenMPWorksharingDirective(Kind) ||
|
||||
isOpenMPTaskLoopDirective(Kind))
|
||||
? WorksharingEnd
|
||||
: DefaultEnd;
|
||||
}
|
||||
|
@ -423,43 +424,43 @@ protected:
|
|||
void setInc(Expr *Inc) { *std::next(child_begin(), IncOffset) = Inc; }
|
||||
void setIsLastIterVariable(Expr *IL) {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
*std::next(child_begin(), IsLastIterVariableOffset) = IL;
|
||||
}
|
||||
void setLowerBoundVariable(Expr *LB) {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
*std::next(child_begin(), LowerBoundVariableOffset) = LB;
|
||||
}
|
||||
void setUpperBoundVariable(Expr *UB) {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
*std::next(child_begin(), UpperBoundVariableOffset) = UB;
|
||||
}
|
||||
void setStrideVariable(Expr *ST) {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
*std::next(child_begin(), StrideVariableOffset) = ST;
|
||||
}
|
||||
void setEnsureUpperBound(Expr *EUB) {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
*std::next(child_begin(), EnsureUpperBoundOffset) = EUB;
|
||||
}
|
||||
void setNextLowerBound(Expr *NLB) {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
*std::next(child_begin(), NextLowerBoundOffset) = NLB;
|
||||
}
|
||||
void setNextUpperBound(Expr *NUB) {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
*std::next(child_begin(), NextUpperBoundOffset) = NUB;
|
||||
}
|
||||
|
@ -587,49 +588,49 @@ public:
|
|||
}
|
||||
Expr *getIsLastIterVariable() const {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
return const_cast<Expr *>(reinterpret_cast<const Expr *>(
|
||||
*std::next(child_begin(), IsLastIterVariableOffset)));
|
||||
}
|
||||
Expr *getLowerBoundVariable() const {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
return const_cast<Expr *>(reinterpret_cast<const Expr *>(
|
||||
*std::next(child_begin(), LowerBoundVariableOffset)));
|
||||
}
|
||||
Expr *getUpperBoundVariable() const {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
return const_cast<Expr *>(reinterpret_cast<const Expr *>(
|
||||
*std::next(child_begin(), UpperBoundVariableOffset)));
|
||||
}
|
||||
Expr *getStrideVariable() const {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
return const_cast<Expr *>(reinterpret_cast<const Expr *>(
|
||||
*std::next(child_begin(), StrideVariableOffset)));
|
||||
}
|
||||
Expr *getEnsureUpperBound() const {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
return const_cast<Expr *>(reinterpret_cast<const Expr *>(
|
||||
*std::next(child_begin(), EnsureUpperBoundOffset)));
|
||||
}
|
||||
Expr *getNextLowerBound() const {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
return const_cast<Expr *>(reinterpret_cast<const Expr *>(
|
||||
*std::next(child_begin(), NextLowerBoundOffset)));
|
||||
}
|
||||
Expr *getNextUpperBound() const {
|
||||
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
|
||||
getDirectiveKind() == OMPD_taskloop) &&
|
||||
isOpenMPTaskLoopDirective(getDirectiveKind())) &&
|
||||
"expected worksharing loop directive");
|
||||
return const_cast<Expr *>(reinterpret_cast<const Expr *>(
|
||||
*std::next(child_begin(), NextUpperBoundOffset)));
|
||||
|
@ -681,7 +682,8 @@ public:
|
|||
T->getStmtClass() == OMPForSimdDirectiveClass ||
|
||||
T->getStmtClass() == OMPParallelForDirectiveClass ||
|
||||
T->getStmtClass() == OMPParallelForSimdDirectiveClass ||
|
||||
T->getStmtClass() == OMPTaskLoopDirectiveClass;
|
||||
T->getStmtClass() == OMPTaskLoopDirectiveClass ||
|
||||
T->getStmtClass() == OMPTaskLoopSimdDirectiveClass;
|
||||
}
|
||||
};
|
||||
|
||||
|
@ -2264,6 +2266,73 @@ public:
|
|||
}
|
||||
};
|
||||
|
||||
/// \brief This represents '#pragma omp taskloop simd' directive.
|
||||
///
|
||||
/// \code
|
||||
/// #pragma omp taskloop simd private(a,b) grainsize(val) num_tasks(num)
|
||||
/// \endcode
|
||||
/// In this example directive '#pragma omp taskloop simd' has clauses 'private'
|
||||
/// with the variables 'a' and 'b', 'grainsize' with expression 'val' and
|
||||
/// 'num_tasks' with expression 'num'.
|
||||
///
|
||||
class OMPTaskLoopSimdDirective : public OMPLoopDirective {
|
||||
friend class ASTStmtReader;
|
||||
/// \brief Build directive with the given start and end location.
|
||||
///
|
||||
/// \param StartLoc Starting location of the directive kind.
|
||||
/// \param EndLoc Ending location of the directive.
|
||||
/// \param CollapsedNum Number of collapsed nested loops.
|
||||
/// \param NumClauses Number of clauses.
|
||||
///
|
||||
OMPTaskLoopSimdDirective(SourceLocation StartLoc, SourceLocation EndLoc,
|
||||
unsigned CollapsedNum, unsigned NumClauses)
|
||||
: OMPLoopDirective(this, OMPTaskLoopSimdDirectiveClass,
|
||||
OMPD_taskloop_simd, StartLoc, EndLoc, CollapsedNum,
|
||||
NumClauses) {}
|
||||
|
||||
/// \brief Build an empty directive.
|
||||
///
|
||||
/// \param CollapsedNum Number of collapsed nested loops.
|
||||
/// \param NumClauses Number of clauses.
|
||||
///
|
||||
explicit OMPTaskLoopSimdDirective(unsigned CollapsedNum, unsigned NumClauses)
|
||||
: OMPLoopDirective(this, OMPTaskLoopSimdDirectiveClass,
|
||||
OMPD_taskloop_simd, SourceLocation(), SourceLocation(),
|
||||
CollapsedNum, NumClauses) {}
|
||||
|
||||
public:
|
||||
/// \brief Creates directive with a list of \a Clauses.
|
||||
///
|
||||
/// \param C AST context.
|
||||
/// \param StartLoc Starting location of the directive kind.
|
||||
/// \param EndLoc Ending Location of the directive.
|
||||
/// \param CollapsedNum Number of collapsed loops.
|
||||
/// \param Clauses List of clauses.
|
||||
/// \param AssociatedStmt Statement, associated with the directive.
|
||||
/// \param Exprs Helper expressions for CodeGen.
|
||||
///
|
||||
static OMPTaskLoopSimdDirective *
|
||||
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
|
||||
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
|
||||
Stmt *AssociatedStmt, const HelperExprs &Exprs);
|
||||
|
||||
/// \brief Creates an empty directive with the place
|
||||
/// for \a NumClauses clauses.
|
||||
///
|
||||
/// \param C AST context.
|
||||
/// \param CollapsedNum Number of collapsed nested loops.
|
||||
/// \param NumClauses Number of clauses.
|
||||
///
|
||||
static OMPTaskLoopSimdDirective *CreateEmpty(const ASTContext &C,
|
||||
unsigned NumClauses,
|
||||
unsigned CollapsedNum,
|
||||
EmptyShell);
|
||||
|
||||
static bool classof(const Stmt *T) {
|
||||
return T->getStmtClass() == OMPTaskLoopSimdDirectiveClass;
|
||||
}
|
||||
};
|
||||
|
||||
} // end namespace clang
|
||||
|
||||
#endif
|
||||
|
|
|
@ -72,6 +72,9 @@
|
|||
#ifndef OPENMP_TASKLOOP_CLAUSE
|
||||
# define OPENMP_TASKLOOP_CLAUSE(Name)
|
||||
#endif
|
||||
#ifndef OPENMP_TASKLOOP_SIMD_CLAUSE
|
||||
# define OPENMP_TASKLOOP_SIMD_CLAUSE(Name)
|
||||
#endif
|
||||
#ifndef OPENMP_DEFAULT_KIND
|
||||
# define OPENMP_DEFAULT_KIND(Name)
|
||||
#endif
|
||||
|
@ -119,6 +122,7 @@ OPENMP_DIRECTIVE_EXT(parallel_sections, "parallel sections")
|
|||
OPENMP_DIRECTIVE_EXT(for_simd, "for simd")
|
||||
OPENMP_DIRECTIVE_EXT(cancellation_point, "cancellation point")
|
||||
OPENMP_DIRECTIVE(taskloop)
|
||||
OPENMP_DIRECTIVE_EXT(taskloop_simd, "taskloop simd")
|
||||
|
||||
// OpenMP clauses.
|
||||
OPENMP_CLAUSE(if, OMPIfClause)
|
||||
|
@ -360,6 +364,25 @@ OPENMP_TASKLOOP_CLAUSE(untied)
|
|||
OPENMP_TASKLOOP_CLAUSE(mergeable)
|
||||
OPENMP_TASKLOOP_CLAUSE(priority)
|
||||
|
||||
// Clauses allowed for OpenMP directive 'taskloop simd'.
|
||||
// TODO: add next clauses
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(if)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(shared)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(private)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(firstprivate)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(lastprivate)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(default)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(collapse)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(final)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(untied)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(mergeable)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(priority)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(linear)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(aligned)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(safelen)
|
||||
OPENMP_TASKLOOP_SIMD_CLAUSE(simdlen)
|
||||
|
||||
#undef OPENMP_TASKLOOP_SIMD_CLAUSE
|
||||
#undef OPENMP_TASKLOOP_CLAUSE
|
||||
#undef OPENMP_LINEAR_KIND
|
||||
#undef OPENMP_DEPEND_KIND
|
||||
|
|
|
@ -111,6 +111,12 @@ bool isOpenMPLoopDirective(OpenMPDirectiveKind DKind);
|
|||
/// otherwise - false.
|
||||
bool isOpenMPWorksharingDirective(OpenMPDirectiveKind DKind);
|
||||
|
||||
/// \brief Checks if the specified directive is a taskloop directive.
|
||||
/// \param DKind Specified directive.
|
||||
/// \return true - the directive is a worksharing directive like 'omp taskloop',
|
||||
/// otherwise - false.
|
||||
bool isOpenMPTaskLoopDirective(OpenMPDirectiveKind DKind);
|
||||
|
||||
/// \brief Checks if the specified directive is a parallel-kind directive.
|
||||
/// \param DKind Specified directive.
|
||||
/// \return true - the directive is a parallel-like directive like 'omp
|
||||
|
|
|
@ -220,4 +220,5 @@ def OMPTeamsDirective : DStmt<OMPExecutableDirective>;
|
|||
def OMPCancellationPointDirective : DStmt<OMPExecutableDirective>;
|
||||
def OMPCancelDirective : DStmt<OMPExecutableDirective>;
|
||||
def OMPTaskLoopDirective : DStmt<OMPLoopDirective>;
|
||||
def OMPTaskLoopSimdDirective : DStmt<OMPLoopDirective>;
|
||||
|
||||
|
|
|
@ -7955,6 +7955,12 @@ public:
|
|||
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
|
||||
SourceLocation EndLoc,
|
||||
llvm::DenseMap<VarDecl *, Expr *> &VarsWithImplicitDSA);
|
||||
/// \brief Called on well-formed '\#pragma omp taskloop simd' after parsing of
|
||||
/// the associated statement.
|
||||
StmtResult ActOnOpenMPTaskLoopSimdDirective(
|
||||
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
|
||||
SourceLocation EndLoc,
|
||||
llvm::DenseMap<VarDecl *, Expr *> &VarsWithImplicitDSA);
|
||||
|
||||
OMPClause *ActOnOpenMPSingleExprClause(OpenMPClauseKind Kind,
|
||||
Expr *Expr,
|
||||
|
|
|
@ -1448,6 +1448,7 @@ namespace clang {
|
|||
STMT_OMP_CANCELLATION_POINT_DIRECTIVE,
|
||||
STMT_OMP_CANCEL_DIRECTIVE,
|
||||
STMT_OMP_TASKLOOP_DIRECTIVE,
|
||||
STMT_OMP_TASKLOOP_SIMD_DIRECTIVE,
|
||||
EXPR_OMP_ARRAY_SECTION,
|
||||
|
||||
// ARC
|
||||
|
|
|
@ -786,3 +786,49 @@ OMPTaskLoopDirective *OMPTaskLoopDirective::CreateEmpty(const ASTContext &C,
|
|||
return new (Mem) OMPTaskLoopDirective(CollapsedNum, NumClauses);
|
||||
}
|
||||
|
||||
OMPTaskLoopSimdDirective *OMPTaskLoopSimdDirective::Create(
|
||||
const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
|
||||
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt,
|
||||
const HelperExprs &Exprs) {
|
||||
unsigned Size = llvm::RoundUpToAlignment(sizeof(OMPTaskLoopSimdDirective),
|
||||
llvm::alignOf<OMPClause *>());
|
||||
void *Mem = C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
|
||||
sizeof(Stmt *) *
|
||||
numLoopChildren(CollapsedNum, OMPD_taskloop_simd));
|
||||
OMPTaskLoopSimdDirective *Dir = new (Mem)
|
||||
OMPTaskLoopSimdDirective(StartLoc, EndLoc, CollapsedNum, Clauses.size());
|
||||
Dir->setClauses(Clauses);
|
||||
Dir->setAssociatedStmt(AssociatedStmt);
|
||||
Dir->setIterationVariable(Exprs.IterationVarRef);
|
||||
Dir->setLastIteration(Exprs.LastIteration);
|
||||
Dir->setCalcLastIteration(Exprs.CalcLastIteration);
|
||||
Dir->setPreCond(Exprs.PreCond);
|
||||
Dir->setCond(Exprs.Cond);
|
||||
Dir->setInit(Exprs.Init);
|
||||
Dir->setInc(Exprs.Inc);
|
||||
Dir->setIsLastIterVariable(Exprs.IL);
|
||||
Dir->setLowerBoundVariable(Exprs.LB);
|
||||
Dir->setUpperBoundVariable(Exprs.UB);
|
||||
Dir->setStrideVariable(Exprs.ST);
|
||||
Dir->setEnsureUpperBound(Exprs.EUB);
|
||||
Dir->setNextLowerBound(Exprs.NLB);
|
||||
Dir->setNextUpperBound(Exprs.NUB);
|
||||
Dir->setCounters(Exprs.Counters);
|
||||
Dir->setPrivateCounters(Exprs.PrivateCounters);
|
||||
Dir->setInits(Exprs.Inits);
|
||||
Dir->setUpdates(Exprs.Updates);
|
||||
Dir->setFinals(Exprs.Finals);
|
||||
return Dir;
|
||||
}
|
||||
|
||||
OMPTaskLoopSimdDirective *
|
||||
OMPTaskLoopSimdDirective::CreateEmpty(const ASTContext &C, unsigned NumClauses,
|
||||
unsigned CollapsedNum, EmptyShell) {
|
||||
unsigned Size = llvm::RoundUpToAlignment(sizeof(OMPTaskLoopSimdDirective),
|
||||
llvm::alignOf<OMPClause *>());
|
||||
void *Mem = C.Allocate(Size + sizeof(OMPClause *) * NumClauses +
|
||||
sizeof(Stmt *) *
|
||||
numLoopChildren(CollapsedNum, OMPD_taskloop_simd));
|
||||
return new (Mem) OMPTaskLoopSimdDirective(CollapsedNum, NumClauses);
|
||||
}
|
||||
|
||||
|
|
|
@ -1041,6 +1041,12 @@ void StmtPrinter::VisitOMPTaskLoopDirective(OMPTaskLoopDirective *Node) {
|
|||
PrintOMPExecutableDirective(Node);
|
||||
}
|
||||
|
||||
void StmtPrinter::VisitOMPTaskLoopSimdDirective(
|
||||
OMPTaskLoopSimdDirective *Node) {
|
||||
Indent() << "#pragma omp taskloop simd ";
|
||||
PrintOMPExecutableDirective(Node);
|
||||
}
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// Expr printing methods.
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
|
|
@ -589,6 +589,11 @@ void StmtProfiler::VisitOMPTaskLoopDirective(const OMPTaskLoopDirective *S) {
|
|||
VisitOMPLoopDirective(S);
|
||||
}
|
||||
|
||||
void StmtProfiler::VisitOMPTaskLoopSimdDirective(
|
||||
const OMPTaskLoopSimdDirective *S) {
|
||||
VisitOMPLoopDirective(S);
|
||||
}
|
||||
|
||||
void StmtProfiler::VisitExpr(const Expr *S) {
|
||||
VisitStmt(S);
|
||||
}
|
||||
|
|
|
@ -404,7 +404,7 @@ bool clang::isAllowedClauseForDirective(OpenMPDirectiveKind DKind,
|
|||
break;
|
||||
case OMPD_ordered:
|
||||
switch (CKind) {
|
||||
#define OPENMP_ORDERED_CLAUSE(Name) \
|
||||
#define OPENMP_ORDERED_CLAUSE(Name) \
|
||||
case OMPC_##Name: \
|
||||
return true;
|
||||
#include "clang/Basic/OpenMPKinds.def"
|
||||
|
@ -417,6 +417,16 @@ bool clang::isAllowedClauseForDirective(OpenMPDirectiveKind DKind,
|
|||
#define OPENMP_TASKLOOP_CLAUSE(Name) \
|
||||
case OMPC_##Name: \
|
||||
return true;
|
||||
#include "clang/Basic/OpenMPKinds.def"
|
||||
default:
|
||||
break;
|
||||
}
|
||||
break;
|
||||
case OMPD_taskloop_simd:
|
||||
switch (CKind) {
|
||||
#define OPENMP_TASKLOOP_SIMD_CLAUSE(Name) \
|
||||
case OMPC_##Name: \
|
||||
return true;
|
||||
#include "clang/Basic/OpenMPKinds.def"
|
||||
default:
|
||||
break;
|
||||
|
@ -440,7 +450,8 @@ bool clang::isAllowedClauseForDirective(OpenMPDirectiveKind DKind,
|
|||
bool clang::isOpenMPLoopDirective(OpenMPDirectiveKind DKind) {
|
||||
return DKind == OMPD_simd || DKind == OMPD_for || DKind == OMPD_for_simd ||
|
||||
DKind == OMPD_parallel_for || DKind == OMPD_parallel_for_simd ||
|
||||
DKind == OMPD_taskloop; // TODO add next directives.
|
||||
DKind == OMPD_taskloop ||
|
||||
DKind == OMPD_taskloop_simd; // TODO add next directives.
|
||||
}
|
||||
|
||||
bool clang::isOpenMPWorksharingDirective(OpenMPDirectiveKind DKind) {
|
||||
|
@ -451,6 +462,10 @@ bool clang::isOpenMPWorksharingDirective(OpenMPDirectiveKind DKind) {
|
|||
DKind == OMPD_parallel_sections; // TODO add next directives.
|
||||
}
|
||||
|
||||
bool clang::isOpenMPTaskLoopDirective(OpenMPDirectiveKind DKind) {
|
||||
return DKind == OMPD_taskloop || DKind == OMPD_taskloop_simd;
|
||||
}
|
||||
|
||||
bool clang::isOpenMPParallelDirective(OpenMPDirectiveKind DKind) {
|
||||
return DKind == OMPD_parallel || DKind == OMPD_parallel_for ||
|
||||
DKind == OMPD_parallel_for_simd ||
|
||||
|
@ -467,7 +482,8 @@ bool clang::isOpenMPTeamsDirective(OpenMPDirectiveKind DKind) {
|
|||
|
||||
bool clang::isOpenMPSimdDirective(OpenMPDirectiveKind DKind) {
|
||||
return DKind == OMPD_simd || DKind == OMPD_for_simd ||
|
||||
DKind == OMPD_parallel_for_simd; // TODO add next directives.
|
||||
DKind == OMPD_parallel_for_simd ||
|
||||
DKind == OMPD_taskloop_simd; // TODO add next directives.
|
||||
}
|
||||
|
||||
bool clang::isOpenMPPrivate(OpenMPClauseKind Kind) {
|
||||
|
|
|
@ -259,6 +259,9 @@ void CodeGenFunction::EmitStmt(const Stmt *S) {
|
|||
case Stmt::OMPTaskLoopDirectiveClass:
|
||||
EmitOMPTaskLoopDirective(cast<OMPTaskLoopDirective>(*S));
|
||||
break;
|
||||
case Stmt::OMPTaskLoopSimdDirectiveClass:
|
||||
EmitOMPTaskLoopSimdDirective(cast<OMPTaskLoopSimdDirective>(*S));
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
@ -2602,3 +2602,12 @@ void CodeGenFunction::EmitOMPTaskLoopDirective(const OMPTaskLoopDirective &S) {
|
|||
[&CS](CodeGenFunction &CGF) { CGF.EmitStmt(CS->getCapturedStmt()); });
|
||||
}
|
||||
|
||||
void CodeGenFunction::EmitOMPTaskLoopSimdDirective(
|
||||
const OMPTaskLoopSimdDirective &S) {
|
||||
// emit the code inside the construct for now
|
||||
auto CS = cast<CapturedStmt>(S.getAssociatedStmt());
|
||||
CGM.getOpenMPRuntime().emitInlinedDirective(
|
||||
*this, OMPD_taskloop_simd,
|
||||
[&CS](CodeGenFunction &CGF) { CGF.EmitStmt(CS->getCapturedStmt()); });
|
||||
}
|
||||
|
||||
|
|
|
@ -2338,6 +2338,7 @@ public:
|
|||
EmitOMPCancellationPointDirective(const OMPCancellationPointDirective &S);
|
||||
void EmitOMPCancelDirective(const OMPCancelDirective &S);
|
||||
void EmitOMPTaskLoopDirective(const OMPTaskLoopDirective &S);
|
||||
void EmitOMPTaskLoopSimdDirective(const OMPTaskLoopSimdDirective &S);
|
||||
|
||||
/// \brief Emit inner loop of the worksharing/simd construct.
|
||||
///
|
||||
|
|
|
@ -37,7 +37,8 @@ static OpenMPDirectiveKind ParseOpenMPDirectiveKind(Parser &P) {
|
|||
{OMPD_for, OMPD_simd, OMPD_for_simd},
|
||||
{OMPD_parallel, OMPD_for, OMPD_parallel_for},
|
||||
{OMPD_parallel_for, OMPD_simd, OMPD_parallel_for_simd},
|
||||
{OMPD_parallel, OMPD_sections, OMPD_parallel_sections}};
|
||||
{OMPD_parallel, OMPD_sections, OMPD_parallel_sections},
|
||||
{OMPD_taskloop, OMPD_simd, OMPD_taskloop_simd}};
|
||||
auto Tok = P.getCurToken();
|
||||
auto DKind =
|
||||
Tok.isAnnotation()
|
||||
|
@ -138,6 +139,7 @@ Parser::DeclGroupPtrTy Parser::ParseOpenMPDeclarativeDirective() {
|
|||
case OMPD_cancel:
|
||||
case OMPD_target_data:
|
||||
case OMPD_taskloop:
|
||||
case OMPD_taskloop_simd:
|
||||
Diag(Tok, diag::err_omp_unexpected_directive)
|
||||
<< getOpenMPDirectiveName(DKind);
|
||||
break;
|
||||
|
@ -158,7 +160,7 @@ Parser::DeclGroupPtrTy Parser::ParseOpenMPDeclarativeDirective() {
|
|||
/// 'parallel for' | 'parallel sections' | 'task' | 'taskyield' |
|
||||
/// 'barrier' | 'taskwait' | 'flush' | 'ordered' | 'atomic' |
|
||||
/// 'for simd' | 'parallel for simd' | 'target' | 'target data' |
|
||||
/// 'taskgroup' | 'teams' {clause}
|
||||
/// 'taskgroup' | 'teams' | 'taskloop' | 'taskloop simd' {clause}
|
||||
/// annot_pragma_openmp_end
|
||||
///
|
||||
StmtResult
|
||||
|
@ -234,7 +236,8 @@ Parser::ParseOpenMPDeclarativeOrExecutableDirective(bool StandAloneAllowed) {
|
|||
case OMPD_teams:
|
||||
case OMPD_taskgroup:
|
||||
case OMPD_target_data:
|
||||
case OMPD_taskloop: {
|
||||
case OMPD_taskloop:
|
||||
case OMPD_taskloop_simd: {
|
||||
ConsumeToken();
|
||||
// Parse directive name of the 'critical' directive if any.
|
||||
if (DKind == OMPD_critical) {
|
||||
|
|
|
@ -346,7 +346,7 @@ public:
|
|||
bool isParallelOrTaskRegion(OpenMPDirectiveKind DKind) {
|
||||
return isOpenMPParallelDirective(DKind) || DKind == OMPD_task ||
|
||||
isOpenMPTeamsDirective(DKind) || DKind == OMPD_unknown ||
|
||||
DKind == OMPD_taskloop;
|
||||
isOpenMPTaskLoopDirective(DKind);
|
||||
}
|
||||
} // namespace
|
||||
|
||||
|
@ -1560,6 +1560,14 @@ void Sema::ActOnOpenMPRegionStart(OpenMPDirectiveKind DKind, Scope *CurScope) {
|
|||
Params);
|
||||
break;
|
||||
}
|
||||
case OMPD_taskloop_simd: {
|
||||
Sema::CapturedParamNameType Params[] = {
|
||||
std::make_pair(StringRef(), QualType()) // __context with shared vars
|
||||
};
|
||||
ActOnCapturedRegionStart(DSAStack->getConstructLoc(), CurScope, CR_OpenMP,
|
||||
Params);
|
||||
break;
|
||||
}
|
||||
case OMPD_threadprivate:
|
||||
case OMPD_taskyield:
|
||||
case OMPD_barrier:
|
||||
|
@ -1643,6 +1651,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | ! |
|
||||
// | parallel | cancel | ! |
|
||||
// | parallel | taskloop | * |
|
||||
// | parallel | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | for | parallel | * |
|
||||
// | for | for | + |
|
||||
|
@ -1670,6 +1679,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | ! |
|
||||
// | for | cancel | ! |
|
||||
// | for | taskloop | * |
|
||||
// | for | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | master | parallel | * |
|
||||
// | master | for | + |
|
||||
|
@ -1697,6 +1707,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | |
|
||||
// | master | cancel | |
|
||||
// | master | taskloop | * |
|
||||
// | master | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | critical | parallel | * |
|
||||
// | critical | for | + |
|
||||
|
@ -1723,6 +1734,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | |
|
||||
// | critical | cancel | |
|
||||
// | critical | taskloop | * |
|
||||
// | critical | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | simd | parallel | |
|
||||
// | simd | for | |
|
||||
|
@ -1750,6 +1762,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | |
|
||||
// | simd | cancel | |
|
||||
// | simd | taskloop | |
|
||||
// | simd | taskloop simd | |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | for simd | parallel | |
|
||||
// | for simd | for | |
|
||||
|
@ -1777,6 +1790,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | |
|
||||
// | for simd | cancel | |
|
||||
// | for simd | taskloop | |
|
||||
// | for simd | taskloop simd | |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | parallel for simd| parallel | |
|
||||
// | parallel for simd| for | |
|
||||
|
@ -1804,6 +1818,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | |
|
||||
// | parallel for simd| cancel | |
|
||||
// | parallel for simd| taskloop | |
|
||||
// | parallel for simd| taskloop simd | |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | sections | parallel | * |
|
||||
// | sections | for | + |
|
||||
|
@ -1831,6 +1846,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | ! |
|
||||
// | sections | cancel | ! |
|
||||
// | sections | taskloop | * |
|
||||
// | sections | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | section | parallel | * |
|
||||
// | section | for | + |
|
||||
|
@ -1858,6 +1874,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | ! |
|
||||
// | section | cancel | ! |
|
||||
// | section | taskloop | * |
|
||||
// | section | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | single | parallel | * |
|
||||
// | single | for | + |
|
||||
|
@ -1885,6 +1902,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | |
|
||||
// | single | cancel | |
|
||||
// | single | taskloop | * |
|
||||
// | single | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | parallel for | parallel | * |
|
||||
// | parallel for | for | + |
|
||||
|
@ -1912,6 +1930,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | ! |
|
||||
// | parallel for | cancel | ! |
|
||||
// | parallel for | taskloop | * |
|
||||
// | parallel for | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | parallel sections| parallel | * |
|
||||
// | parallel sections| for | + |
|
||||
|
@ -1939,6 +1958,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | ! |
|
||||
// | parallel sections| cancel | ! |
|
||||
// | parallel sections| taskloop | * |
|
||||
// | parallel sections| taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | task | parallel | * |
|
||||
// | task | for | + |
|
||||
|
@ -1966,6 +1986,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | ! |
|
||||
// | task | cancel | ! |
|
||||
// | task | taskloop | * |
|
||||
// | task | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | ordered | parallel | * |
|
||||
// | ordered | for | + |
|
||||
|
@ -1993,6 +2014,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | |
|
||||
// | ordered | cancel | |
|
||||
// | ordered | taskloop | * |
|
||||
// | ordered | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | atomic | parallel | |
|
||||
// | atomic | for | |
|
||||
|
@ -2020,6 +2042,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | |
|
||||
// | atomic | cancel | |
|
||||
// | atomic | taskloop | |
|
||||
// | atomic | taskloop simd | |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | target | parallel | * |
|
||||
// | target | for | * |
|
||||
|
@ -2047,6 +2070,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | |
|
||||
// | target | cancel | |
|
||||
// | target | taskloop | * |
|
||||
// | target | taskloop simd | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | teams | parallel | * |
|
||||
// | teams | for | + |
|
||||
|
@ -2074,6 +2098,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | | point | |
|
||||
// | teams | cancel | |
|
||||
// | teams | taskloop | + |
|
||||
// | teams | taskloop simd | + |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | taskloop | parallel | * |
|
||||
// | taskloop | for | + |
|
||||
|
@ -2102,6 +2127,34 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// | taskloop | cancel | |
|
||||
// | taskloop | taskloop | * |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
// | taskloop simd | parallel | |
|
||||
// | taskloop simd | for | |
|
||||
// | taskloop simd | for simd | |
|
||||
// | taskloop simd | master | |
|
||||
// | taskloop simd | critical | |
|
||||
// | taskloop simd | simd | |
|
||||
// | taskloop simd | sections | |
|
||||
// | taskloop simd | section | |
|
||||
// | taskloop simd | single | |
|
||||
// | taskloop simd | parallel for | |
|
||||
// | taskloop simd |parallel for simd| |
|
||||
// | taskloop simd |parallel sections| |
|
||||
// | taskloop simd | task | |
|
||||
// | taskloop simd | taskyield | |
|
||||
// | taskloop simd | barrier | |
|
||||
// | taskloop simd | taskwait | |
|
||||
// | taskloop simd | taskgroup | |
|
||||
// | taskloop simd | flush | |
|
||||
// | taskloop simd | ordered | + (with simd clause) |
|
||||
// | taskloop simd | atomic | |
|
||||
// | taskloop simd | target | |
|
||||
// | taskloop simd | teams | |
|
||||
// | taskloop simd | cancellation | |
|
||||
// | | point | |
|
||||
// | taskloop simd | cancel | |
|
||||
// | taskloop simd | taskloop | |
|
||||
// | taskloop simd | taskloop simd | |
|
||||
// +------------------+-----------------+------------------------------------+
|
||||
if (Stack->getCurScope()) {
|
||||
auto ParentRegion = Stack->getParentDirective();
|
||||
bool NestingProhibited = false;
|
||||
|
@ -2172,7 +2225,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// atomic, or explicit task region.
|
||||
NestingProhibited = isOpenMPWorksharingDirective(ParentRegion) ||
|
||||
ParentRegion == OMPD_task ||
|
||||
ParentRegion == OMPD_taskloop;
|
||||
isOpenMPTaskLoopDirective(ParentRegion);
|
||||
} else if (CurrentRegion == OMPD_critical && CurrentName.getName()) {
|
||||
// OpenMP [2.16, Nesting of Regions]
|
||||
// A critical region may not be nested (closely or otherwise) inside a
|
||||
|
@ -2210,7 +2263,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
isOpenMPWorksharingDirective(ParentRegion) ||
|
||||
ParentRegion == OMPD_task || ParentRegion == OMPD_master ||
|
||||
ParentRegion == OMPD_critical || ParentRegion == OMPD_ordered ||
|
||||
ParentRegion == OMPD_taskloop;
|
||||
isOpenMPTaskLoopDirective(ParentRegion);
|
||||
} else if (isOpenMPWorksharingDirective(CurrentRegion) &&
|
||||
!isOpenMPParallelDirective(CurrentRegion)) {
|
||||
// OpenMP [2.16, Nesting of Regions]
|
||||
|
@ -2220,7 +2273,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
isOpenMPWorksharingDirective(ParentRegion) ||
|
||||
ParentRegion == OMPD_task || ParentRegion == OMPD_master ||
|
||||
ParentRegion == OMPD_critical || ParentRegion == OMPD_ordered ||
|
||||
ParentRegion == OMPD_taskloop;
|
||||
isOpenMPTaskLoopDirective(ParentRegion);
|
||||
Recommend = ShouldBeInParallelRegion;
|
||||
} else if (CurrentRegion == OMPD_ordered) {
|
||||
// OpenMP [2.16, Nesting of Regions]
|
||||
|
@ -2233,7 +2286,7 @@ static bool CheckNestingOfRegions(Sema &SemaRef, DSAStackTy *Stack,
|
|||
// that can appear in the simd region.
|
||||
NestingProhibited = ParentRegion == OMPD_critical ||
|
||||
ParentRegion == OMPD_task ||
|
||||
ParentRegion == OMPD_taskloop ||
|
||||
isOpenMPTaskLoopDirective(ParentRegion) ||
|
||||
!(isOpenMPSimdDirective(ParentRegion) ||
|
||||
Stack->isParentOrderedRegion());
|
||||
Recommend = ShouldBeInOrderedRegion;
|
||||
|
@ -2516,6 +2569,11 @@ StmtResult Sema::ActOnOpenMPExecutableDirective(
|
|||
EndLoc, VarsWithInheritedDSA);
|
||||
AllowedNameModifiers.push_back(OMPD_taskloop);
|
||||
break;
|
||||
case OMPD_taskloop_simd:
|
||||
Res = ActOnOpenMPTaskLoopSimdDirective(ClausesWithImplicit, AStmt, StartLoc,
|
||||
EndLoc, VarsWithInheritedDSA);
|
||||
AllowedNameModifiers.push_back(OMPD_taskloop);
|
||||
break;
|
||||
case OMPD_threadprivate:
|
||||
llvm_unreachable("OpenMP Directive is not allowed");
|
||||
case OMPD_unknown:
|
||||
|
@ -3382,8 +3440,8 @@ static bool CheckOpenMPIterationSpace(
|
|||
// Build the loop's iteration space representation.
|
||||
ResultIterSpace.PreCond = ISC.BuildPreCond(DSA.getCurScope(), For->getCond());
|
||||
ResultIterSpace.NumIterations = ISC.BuildNumIterations(
|
||||
DSA.getCurScope(),
|
||||
(isOpenMPWorksharingDirective(DKind) || DKind == OMPD_taskloop));
|
||||
DSA.getCurScope(), (isOpenMPWorksharingDirective(DKind) ||
|
||||
isOpenMPTaskLoopDirective(DKind)));
|
||||
ResultIterSpace.CounterVar = ISC.BuildCounterVar();
|
||||
ResultIterSpace.PrivateCounterVar = ISC.BuildPrivateCounterVar();
|
||||
ResultIterSpace.CounterInit = ISC.BuildCounterInit();
|
||||
|
@ -3691,7 +3749,7 @@ CheckOpenMPLoop(OpenMPDirectiveKind DKind, Expr *CollapseLoopCountExpr,
|
|||
QualType VType = LastIteration.get()->getType();
|
||||
// Build variables passed into runtime, nesessary for worksharing directives.
|
||||
ExprResult LB, UB, IL, ST, EUB;
|
||||
if ((isOpenMPWorksharingDirective(DKind) || DKind == OMPD_taskloop)) {
|
||||
if (isOpenMPWorksharingDirective(DKind) || isOpenMPTaskLoopDirective(DKind)) {
|
||||
// Lower bound variable, initialized with zero.
|
||||
VarDecl *LBDecl = buildVarDecl(SemaRef, InitLoc, VType, ".omp.lb");
|
||||
LB = buildDeclRefExpr(SemaRef, LBDecl, VType, InitLoc);
|
||||
|
@ -3739,7 +3797,8 @@ CheckOpenMPLoop(OpenMPDirectiveKind DKind, Expr *CollapseLoopCountExpr,
|
|||
{
|
||||
VarDecl *IVDecl = buildVarDecl(SemaRef, InitLoc, VType, ".omp.iv");
|
||||
IV = buildDeclRefExpr(SemaRef, IVDecl, VType, InitLoc);
|
||||
Expr *RHS = (isOpenMPWorksharingDirective(DKind) || DKind == OMPD_taskloop)
|
||||
Expr *RHS = (isOpenMPWorksharingDirective(DKind) ||
|
||||
isOpenMPTaskLoopDirective(DKind))
|
||||
? LB.get()
|
||||
: SemaRef.ActOnIntegerConstant(SourceLocation(), 0).get();
|
||||
Init = SemaRef.BuildBinOp(CurScope, InitLoc, BO_Assign, IV.get(), RHS);
|
||||
|
@ -3749,7 +3808,7 @@ CheckOpenMPLoop(OpenMPDirectiveKind DKind, Expr *CollapseLoopCountExpr,
|
|||
// Loop condition (IV < NumIterations) or (IV <= UB) for worksharing loops.
|
||||
SourceLocation CondLoc;
|
||||
ExprResult Cond =
|
||||
(isOpenMPWorksharingDirective(DKind) || DKind == OMPD_taskloop)
|
||||
(isOpenMPWorksharingDirective(DKind) || isOpenMPTaskLoopDirective(DKind))
|
||||
? SemaRef.BuildBinOp(CurScope, CondLoc, BO_LE, IV.get(), UB.get())
|
||||
: SemaRef.BuildBinOp(CurScope, CondLoc, BO_LT, IV.get(),
|
||||
NumIterations.get());
|
||||
|
@ -3769,7 +3828,7 @@ CheckOpenMPLoop(OpenMPDirectiveKind DKind, Expr *CollapseLoopCountExpr,
|
|||
// Increments for worksharing loops (LB = LB + ST; UB = UB + ST).
|
||||
// Used for directives with static scheduling.
|
||||
ExprResult NextLB, NextUB;
|
||||
if (isOpenMPWorksharingDirective(DKind) || DKind == OMPD_taskloop) {
|
||||
if (isOpenMPWorksharingDirective(DKind) || isOpenMPTaskLoopDirective(DKind)) {
|
||||
// LB + ST
|
||||
NextLB = SemaRef.BuildBinOp(CurScope, IncLoc, BO_Add, LB.get(), ST.get());
|
||||
if (!NextLB.isUsable())
|
||||
|
@ -5247,7 +5306,7 @@ StmtResult Sema::ActOnOpenMPTaskLoopDirective(
|
|||
// define the nested loops number.
|
||||
unsigned NestedLoopCount =
|
||||
CheckOpenMPLoop(OMPD_taskloop, getCollapseNumberExpr(Clauses),
|
||||
getOrderedNumberExpr(Clauses), AStmt, *this, *DSAStack,
|
||||
/*OrderedLoopCountExpr=*/nullptr, AStmt, *this, *DSAStack,
|
||||
VarsWithImplicitDSA, B);
|
||||
if (NestedLoopCount == 0)
|
||||
return StmtError();
|
||||
|
@ -5260,6 +5319,32 @@ StmtResult Sema::ActOnOpenMPTaskLoopDirective(
|
|||
NestedLoopCount, Clauses, AStmt, B);
|
||||
}
|
||||
|
||||
StmtResult Sema::ActOnOpenMPTaskLoopSimdDirective(
|
||||
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
|
||||
SourceLocation EndLoc,
|
||||
llvm::DenseMap<VarDecl *, Expr *> &VarsWithImplicitDSA) {
|
||||
if (!AStmt)
|
||||
return StmtError();
|
||||
|
||||
assert(isa<CapturedStmt>(AStmt) && "Captured statement expected");
|
||||
OMPLoopDirective::HelperExprs B;
|
||||
// In presence of clause 'collapse' or 'ordered' with number of loops, it will
|
||||
// define the nested loops number.
|
||||
unsigned NestedLoopCount =
|
||||
CheckOpenMPLoop(OMPD_taskloop_simd, getCollapseNumberExpr(Clauses),
|
||||
/*OrderedLoopCountExpr=*/nullptr, AStmt, *this, *DSAStack,
|
||||
VarsWithImplicitDSA, B);
|
||||
if (NestedLoopCount == 0)
|
||||
return StmtError();
|
||||
|
||||
assert((CurContext->isDependentContext() || B.builtAll()) &&
|
||||
"omp for loop exprs were not built");
|
||||
|
||||
getCurFunction()->setHasBranchProtectedScope();
|
||||
return OMPTaskLoopSimdDirective::Create(Context, StartLoc, EndLoc,
|
||||
NestedLoopCount, Clauses, AStmt, B);
|
||||
}
|
||||
|
||||
OMPClause *Sema::ActOnOpenMPSingleExprClause(OpenMPClauseKind Kind, Expr *Expr,
|
||||
SourceLocation StartLoc,
|
||||
SourceLocation LParenLoc,
|
||||
|
|
|
@ -7364,6 +7364,17 @@ TreeTransform<Derived>::TransformOMPTaskLoopDirective(OMPTaskLoopDirective *D) {
|
|||
return Res;
|
||||
}
|
||||
|
||||
template <typename Derived>
|
||||
StmtResult TreeTransform<Derived>::TransformOMPTaskLoopSimdDirective(
|
||||
OMPTaskLoopSimdDirective *D) {
|
||||
DeclarationNameInfo DirName;
|
||||
getDerived().getSema().StartOpenMPDSABlock(OMPD_taskloop_simd, DirName,
|
||||
nullptr, D->getLocStart());
|
||||
StmtResult Res = getDerived().TransformOMPExecutableDirective(D);
|
||||
getDerived().getSema().EndOpenMPDSABlock(Res.get());
|
||||
return Res;
|
||||
}
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// OpenMP clause transformation
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
|
|
@ -2424,6 +2424,10 @@ void ASTStmtReader::VisitOMPTaskLoopDirective(OMPTaskLoopDirective *D) {
|
|||
VisitOMPLoopDirective(D);
|
||||
}
|
||||
|
||||
void ASTStmtReader::VisitOMPTaskLoopSimdDirective(OMPTaskLoopSimdDirective *D) {
|
||||
VisitOMPLoopDirective(D);
|
||||
}
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// ASTReader Implementation
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
@ -3054,6 +3058,14 @@ Stmt *ASTReader::ReadStmtFromStream(ModuleFile &F) {
|
|||
break;
|
||||
}
|
||||
|
||||
case STMT_OMP_TASKLOOP_SIMD_DIRECTIVE: {
|
||||
unsigned NumClauses = Record[ASTStmtReader::NumStmtFields];
|
||||
unsigned CollapsedNum = Record[ASTStmtReader::NumStmtFields + 1];
|
||||
S = OMPTaskLoopSimdDirective::CreateEmpty(Context, NumClauses,
|
||||
CollapsedNum, Empty);
|
||||
break;
|
||||
}
|
||||
|
||||
case EXPR_CXX_OPERATOR_CALL:
|
||||
S = new (Context) CXXOperatorCallExpr(Context, Empty);
|
||||
break;
|
||||
|
|
|
@ -2249,6 +2249,11 @@ void ASTStmtWriter::VisitOMPTaskLoopDirective(OMPTaskLoopDirective *D) {
|
|||
Code = serialization::STMT_OMP_TASKLOOP_DIRECTIVE;
|
||||
}
|
||||
|
||||
void ASTStmtWriter::VisitOMPTaskLoopSimdDirective(OMPTaskLoopSimdDirective *D) {
|
||||
VisitOMPLoopDirective(D);
|
||||
Code = serialization::STMT_OMP_TASKLOOP_SIMD_DIRECTIVE;
|
||||
}
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// ASTWriter Implementation
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
|
|
@ -830,6 +830,7 @@ void ExprEngine::Visit(const Stmt *S, ExplodedNode *Pred,
|
|||
case Stmt::OMPCancellationPointDirectiveClass:
|
||||
case Stmt::OMPCancelDirectiveClass:
|
||||
case Stmt::OMPTaskLoopDirectiveClass:
|
||||
case Stmt::OMPTaskLoopSimdDirectiveClass:
|
||||
llvm_unreachable("Stmt should not be in analyzer evaluation loop");
|
||||
|
||||
case Stmt::ObjCSubscriptRefExprClass:
|
||||
|
|
|
@ -0,0 +1,90 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp -ferror-limit 100 %s
|
||||
|
||||
void foo() {
|
||||
}
|
||||
|
||||
bool foobool(int argc) {
|
||||
return argc;
|
||||
}
|
||||
|
||||
struct S1; // expected-note {{declared here}}
|
||||
|
||||
template <class T, class S> // expected-note {{declared here}}
|
||||
int tmain(T argc, S **argv) {
|
||||
#pragma omp taskloop final // expected-error {{expected '(' after 'final'}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final() // expected-error {{expected expression}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argc)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop' are ignored}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argc > 0 ? argv[1] : argv[2])
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(foobool(argc)), final(true) // expected-error {{directive '#pragma omp taskloop' cannot contain more than one 'final' clause}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(S) // expected-error {{'S' does not refer to a value}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argv[1] = 2) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argc argc) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argc)
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
#pragma omp taskloop final // expected-error {{expected '(' after 'final'}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final() // expected-error {{expected expression}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argc)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop' are ignored}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argc > 0 ? argv[1] : argv[2])
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(foobool(argc)), final(true) // expected-error {{directive '#pragma omp taskloop' cannot contain more than one 'final' clause}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argv[1] = 2) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(argc argc) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(1 0) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop final(if (tmain(argc, argv) // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
|
||||
return tmain(argc, argv);
|
||||
}
|
|
@ -0,0 +1,202 @@
|
|||
// RUN: %clang_cc1 -x c++ -std=c++11 -verify -fopenmp %s
|
||||
|
||||
struct B {
|
||||
static int ib[20]; // expected-note 0 {{'B::ib' declared here}}
|
||||
static constexpr int bfoo() { return 8; }
|
||||
};
|
||||
namespace X {
|
||||
B x; // expected-note {{'x' defined here}}
|
||||
};
|
||||
constexpr int bfoo() { return 4; }
|
||||
|
||||
int **z;
|
||||
const int C1 = 1;
|
||||
const int C2 = 2;
|
||||
void test_aligned_colons(int *&rp)
|
||||
{
|
||||
int *B = 0;
|
||||
#pragma omp taskloop simd aligned(B:bfoo())
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
// expected-error@+1 {{unexpected ':' in nested name specifier; did you mean '::'}}
|
||||
#pragma omp taskloop simd aligned(B::ib:B:bfoo())
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
#pragma omp taskloop simd aligned(B:B::bfoo())
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
// expected-error@+1 {{unexpected ':' in nested name specifier; did you mean '::'?}}
|
||||
#pragma omp taskloop simd aligned(z:B:bfoo())
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
#pragma omp taskloop simd aligned(B:B::bfoo())
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
// expected-error@+2 {{integral constant expression must have integral or unscoped enumeration type, not 'int **'}}
|
||||
// expected-error@+1 {{argument of aligned clause should be array, pointer, reference to array or reference to pointer, not 'B'}}
|
||||
#pragma omp taskloop simd aligned(X::x : ::z)
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
// expected-error@+1 {{integral constant expression must have integral or unscoped enumeration type, not 'B'}}
|
||||
#pragma omp taskloop simd aligned(B,rp,::z: X::x)
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
#pragma omp taskloop simd aligned(::z)
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
// expected-error@+1 {{expected variable name}}
|
||||
#pragma omp taskloop simd aligned(B::bfoo())
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
// expected-warning@+1 {{aligned clause will be ignored because the requested alignment is not a power of 2}}
|
||||
#pragma omp taskloop simd aligned(B::ib,B:C1+C2)
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
}
|
||||
|
||||
// expected-note@+1 {{'num' defined here}}
|
||||
template<int L, class T, class N> T test_template(T* arr, N num) {
|
||||
N i;
|
||||
T sum = (T)0;
|
||||
T ind2 = - num * L;
|
||||
// Negative number is passed as L.
|
||||
// expected-error@+1 {{argument to 'aligned' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd aligned(arr:L)
|
||||
for (i = 0; i < num; ++i) {
|
||||
T cur = arr[(int)ind2];
|
||||
ind2 += L;
|
||||
sum += cur;
|
||||
}
|
||||
// expected-error@+1 {{argument of aligned clause should be array, pointer, reference to array or reference to pointer, not 'int'}}
|
||||
#pragma omp taskloop simd aligned(num:4)
|
||||
for (i = 0; i < num; ++i);
|
||||
return T();
|
||||
}
|
||||
|
||||
template<int LEN> int test_warn() {
|
||||
int *ind2 = 0;
|
||||
// expected-error@+1 {{argument to 'aligned' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd aligned(ind2:LEN)
|
||||
for (int i = 0; i < 100; i++) {
|
||||
ind2 += LEN;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
struct S1; // expected-note 2 {{declared here}}
|
||||
extern S1 a; // expected-note {{'a' declared here}}
|
||||
class S2 {
|
||||
mutable int a;
|
||||
public:
|
||||
S2():a(0) { }
|
||||
};
|
||||
const S2 b; // expected-note 1 {{'b' defined here}}
|
||||
const S2 ba[5];
|
||||
class S3 {
|
||||
int a;
|
||||
public:
|
||||
S3():a(0) { }
|
||||
};
|
||||
const S3 ca[5];
|
||||
class S4 {
|
||||
int a;
|
||||
S4();
|
||||
public:
|
||||
S4(int v):a(v) { }
|
||||
};
|
||||
class S5 {
|
||||
int a;
|
||||
S5():a(0) {}
|
||||
public:
|
||||
S5(int v):a(v) { }
|
||||
};
|
||||
|
||||
S3 h; // expected-note 2 {{'h' defined here}}
|
||||
#pragma omp threadprivate(h)
|
||||
|
||||
template<class I, class C> int foomain(I argc, C **argv) {
|
||||
I e(argc);
|
||||
I g(argc);
|
||||
int i; // expected-note {{declared here}} expected-note {{'i' defined here}}
|
||||
// expected-note@+2 {{declared here}}
|
||||
// expected-note@+1 {{reference to 'i' is not a constant expression}}
|
||||
int &j = i;
|
||||
#pragma omp taskloop simd aligned // expected-error {{expected '(' after 'aligned'}}
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned () // expected-error {{expected expression}}
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned (argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned (argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned (argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned (argc : 5) // expected-warning {{aligned clause will be ignored because the requested alignment is not a power of 2}}
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned (S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned (argv[1]) // expected-error {{expected variable name}}
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned(e, g)
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
// expected-error@+1 {{argument of aligned clause should be array, pointer, reference to array or reference to pointer, not 'S3'}}
|
||||
#pragma omp taskloop simd aligned(h)
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
// expected-error@+1 {{argument of aligned clause should be array, pointer, reference to array or reference to pointer, not 'int'}}
|
||||
#pragma omp taskloop simd aligned(i)
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp parallel
|
||||
{
|
||||
int *v = 0;
|
||||
I i;
|
||||
#pragma omp taskloop simd aligned(v:16)
|
||||
for (I k = 0; k < argc; ++k) { i = k; v += 2; }
|
||||
}
|
||||
float *f;
|
||||
#pragma omp taskloop simd aligned(f)
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
int v = 0;
|
||||
// expected-note@+2 {{initializer of 'j' is not a constant expression}}
|
||||
// expected-error@+1 {{expression is not an integral constant expression}}
|
||||
#pragma omp taskloop simd aligned(f:j)
|
||||
for (I k = 0; k < argc; ++k) { ++k; v += j; }
|
||||
#pragma omp taskloop simd aligned(f)
|
||||
for (I k = 0; k < argc; ++k) ++k;
|
||||
return 0;
|
||||
}
|
||||
|
||||
// expected-note@+1 2 {{'argc' defined here}}
|
||||
int main(int argc, char **argv) {
|
||||
double darr[100];
|
||||
// expected-note@+1 {{in instantiation of function template specialization 'test_template<-4, double, int>' requested here}}
|
||||
test_template<-4>(darr, 4);
|
||||
test_warn<4>(); // ok
|
||||
// expected-note@+1 {{in instantiation of function template specialization 'test_warn<0>' requested here}}
|
||||
test_warn<0>();
|
||||
|
||||
int i;
|
||||
int &j = i;
|
||||
#pragma omp taskloop simd aligned // expected-error {{expected '(' after 'aligned'}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned () // expected-error {{expected expression}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned (argv // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
// expected-error@+1 {{argument of aligned clause should be array, pointer, reference to array or reference to pointer, not 'int'}}
|
||||
#pragma omp taskloop simd aligned (argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned (argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
// expected-error@+1 {{argument of aligned clause should be array, pointer, reference to array or reference to pointer, not 'int'}}
|
||||
#pragma omp taskloop simd aligned (argc)
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned (S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
// expected-error@+2 {{argument of aligned clause should be array, pointer, reference to array or reference to pointer, not 'S1'}}
|
||||
// expected-error@+1 {{argument of aligned clause should be array, pointer, reference to array or reference to pointer, not 'S2'}}
|
||||
#pragma omp taskloop simd aligned (a, b)
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd aligned (argv[1]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
// expected-error@+1 {{argument of aligned clause should be array, pointer, reference to array or reference to pointer, not 'S3'}}
|
||||
#pragma omp taskloop simd aligned(h)
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
int *pargc = &argc;
|
||||
foomain<int*,char>(pargc,argv);
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -0,0 +1,75 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp -ast-print %s | FileCheck %s
|
||||
// RUN: %clang_cc1 -fopenmp -x c++ -std=c++11 -emit-pch -o %t %s
|
||||
// RUN: %clang_cc1 -fopenmp -std=c++11 -include-pch %t -fsyntax-only -verify %s -ast-print | FileCheck %s
|
||||
// expected-no-diagnostics
|
||||
|
||||
#ifndef HEADER
|
||||
#define HEADER
|
||||
|
||||
void foo() {}
|
||||
|
||||
template <class T, int N>
|
||||
T tmain(T argc) {
|
||||
T b = argc, c, d, e, f, g;
|
||||
T *ptr;
|
||||
static T a;
|
||||
// CHECK: static T a;
|
||||
#pragma omp taskloop simd if(taskloop: argc > N) default(shared) untied priority(N) safelen(N) linear(c) aligned(ptr)
|
||||
// CHECK-NEXT: #pragma omp taskloop simd if(taskloop: argc > N) default(shared) untied priority(N) safelen(N) linear(c) aligned(ptr)
|
||||
for (int i = 0; i < 2; ++i)
|
||||
a = 2;
|
||||
// CHECK-NEXT: for (int i = 0; i < 2; ++i)
|
||||
// CHECK-NEXT: a = 2;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd private(argc, b), firstprivate(c, d), lastprivate(d, f) collapse(N) shared(g) if (c) final(d) mergeable priority(f) simdlen(N)
|
||||
for (int i = 0; i < 2; ++i)
|
||||
for (int j = 0; j < 2; ++j)
|
||||
for (int j = 0; j < 2; ++j)
|
||||
for (int j = 0; j < 2; ++j)
|
||||
for (int j = 0; j < 2; ++j)
|
||||
for (int i = 0; i < 2; ++i)
|
||||
for (int j = 0; j < 2; ++j)
|
||||
for (int j = 0; j < 2; ++j)
|
||||
for (int j = 0; j < 2; ++j)
|
||||
for (int j = 0; j < 2; ++j)
|
||||
foo();
|
||||
// CHECK-NEXT: #pragma omp parallel
|
||||
// CHECK-NEXT: #pragma omp taskloop simd private(argc,b) firstprivate(c,d) lastprivate(d,f) collapse(N) shared(g) if(c) final(d) mergeable priority(f)
|
||||
// CHECK-NEXT: for (int i = 0; i < 2; ++i)
|
||||
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||||
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||||
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||||
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||||
// CHECK-NEXT: for (int i = 0; i < 2; ++i)
|
||||
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||||
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||||
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||||
// CHECK-NEXT: for (int j = 0; j < 2; ++j)
|
||||
// CHECK-NEXT: foo();
|
||||
return T();
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
int b = argc, c, d, e, f, g;
|
||||
static int a;
|
||||
// CHECK: static int a;
|
||||
#pragma omp taskloop simd if(taskloop: a) default(none) shared(a) final(b) priority(5) safelen(8) linear(b), aligned(argv)
|
||||
// CHECK-NEXT: #pragma omp taskloop simd if(taskloop: a) default(none) shared(a) final(b) priority(5) safelen(8) linear(b) aligned(argv)
|
||||
for (int i = 0; i < 2; ++i)
|
||||
a = 2;
|
||||
// CHECK-NEXT: for (int i = 0; i < 2; ++i)
|
||||
// CHECK-NEXT: a = 2;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd private(argc, b), firstprivate(argv, c), lastprivate(d, f) collapse(2) shared(g) if(argc) mergeable priority(argc) simdlen(16)
|
||||
for (int i = 0; i < 10; ++i)
|
||||
for (int j = 0; j < 10; ++j)
|
||||
foo();
|
||||
// CHECK-NEXT: #pragma omp parallel
|
||||
// CHECK-NEXT: #pragma omp taskloop simd private(argc,b) firstprivate(argv,c) lastprivate(d,f) collapse(2) shared(g) if(argc) mergeable priority(argc) simdlen(16)
|
||||
// CHECK-NEXT: for (int i = 0; i < 10; ++i)
|
||||
// CHECK-NEXT: for (int j = 0; j < 10; ++j)
|
||||
// CHECK-NEXT: foo();
|
||||
return (tmain<int, 5>(argc) + tmain<char, 1>(argv[0][0]));
|
||||
}
|
||||
|
||||
#endif
|
|
@ -0,0 +1,83 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp %s
|
||||
|
||||
void foo() {
|
||||
}
|
||||
|
||||
bool foobool(int argc) {
|
||||
return argc;
|
||||
}
|
||||
|
||||
struct S1; // expected-note {{declared here}}
|
||||
|
||||
template <class T, typename S, int N, int ST> // expected-note {{declared here}}
|
||||
T tmain(T argc, S **argv) { //expected-note 2 {{declared here}}
|
||||
#pragma omp taskloop simd collapse // expected-error {{expected '(' after 'collapse'}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd collapse ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd collapse () // expected-error {{expected expression}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+3 {{expected ')'}} expected-note@+3 {{to match this '('}}
|
||||
// expected-error@+2 2 {{expression is not an integral constant expression}}
|
||||
// expected-note@+1 2 {{read of non-const variable 'argc' is not allowed in a constant expression}}
|
||||
#pragma omp taskloop simd collapse (argc
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+1 2 {{argument to 'collapse' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd collapse (ST // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd collapse (1)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd collapse ((ST > 0) ? 1 + ST : 2) // expected-note 2 {{as specified in 'collapse' clause}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; // expected-error 2 {{expected 2 for loops after '#pragma omp taskloop simd', but found only 1}}
|
||||
// expected-error@+3 2 {{directive '#pragma omp taskloop simd' cannot contain more than one 'collapse' clause}}
|
||||
// expected-error@+2 2 {{argument to 'collapse' clause must be a strictly positive integer value}}
|
||||
// expected-error@+1 2 {{expression is not an integral constant expression}}
|
||||
#pragma omp taskloop simd collapse (foobool(argc)), collapse (true), collapse (-5)
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd collapse (S) // expected-error {{'S' does not refer to a value}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+1 2 {{expression is not an integral constant expression}}
|
||||
#pragma omp taskloop simd collapse (argv[1]=2) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd collapse (1)
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd collapse (N) // expected-error {{argument to 'collapse' clause must be a strictly positive integer value}}
|
||||
for (T i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd collapse (2) // expected-note {{as specified in 'collapse' clause}}
|
||||
foo(); // expected-error {{expected 2 for loops after '#pragma omp taskloop simd'}}
|
||||
return argc;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
#pragma omp taskloop simd collapse // expected-error {{expected '(' after 'collapse'}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd collapse ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd collapse () // expected-error {{expected expression}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd collapse (4 // expected-error {{expected ')'}} expected-note {{to match this '('}} expected-note {{as specified in 'collapse' clause}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4]; // expected-error {{expected 4 for loops after '#pragma omp taskloop simd', but found only 1}}
|
||||
#pragma omp taskloop simd collapse (2+2)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}} expected-note {{as specified in 'collapse' clause}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4]; // expected-error {{expected 4 for loops after '#pragma omp taskloop simd', but found only 1}}
|
||||
#pragma omp taskloop simd collapse (foobool(1) > 0 ? 1 : 2) // expected-error {{expression is not an integral constant expression}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
// expected-error@+3 {{expression is not an integral constant expression}}
|
||||
// expected-error@+2 2 {{directive '#pragma omp taskloop simd' cannot contain more than one 'collapse' clause}}
|
||||
// expected-error@+1 2 {{argument to 'collapse' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd collapse (foobool(argc)), collapse (true), collapse (-5)
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd collapse (S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
// expected-error@+1 {{expression is not an integral constant expression}}
|
||||
#pragma omp taskloop simd collapse (argv[1]=2) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
// expected-error@+3 {{statement after '#pragma omp taskloop simd' must be a for loop}}
|
||||
// expected-note@+1 {{in instantiation of function template specialization 'tmain<int, char, -1, -2>' requested here}}
|
||||
#pragma omp taskloop simd collapse(collapse(tmain<int, char, -1, -2>(argc, argv) // expected-error 2 {{expected ')'}} expected-note 2 {{to match this '('}}
|
||||
foo();
|
||||
#pragma omp taskloop simd collapse (2) // expected-note {{as specified in 'collapse' clause}}
|
||||
foo(); // expected-error {{expected 2 for loops after '#pragma omp taskloop simd'}}
|
||||
// expected-note@+1 {{in instantiation of function template specialization 'tmain<int, char, 1, 0>' requested here}}
|
||||
return tmain<int, char, 1, 0>(argc, argv);
|
||||
}
|
||||
|
|
@ -0,0 +1,90 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp -ferror-limit 100 %s
|
||||
|
||||
void foo() {
|
||||
}
|
||||
|
||||
bool foobool(int argc) {
|
||||
return argc;
|
||||
}
|
||||
|
||||
struct S1; // expected-note {{declared here}}
|
||||
|
||||
template <class T, class S> // expected-note {{declared here}}
|
||||
int tmain(T argc, S **argv) {
|
||||
#pragma omp taskloop simd final // expected-error {{expected '(' after 'final'}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final() // expected-error {{expected expression}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argc)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argc > 0 ? argv[1] : argv[2])
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(foobool(argc)), final(true) // expected-error {{directive '#pragma omp taskloop simd' cannot contain more than one 'final' clause}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(S) // expected-error {{'S' does not refer to a value}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argv[1] = 2) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argc argc) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argc)
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
#pragma omp taskloop simd final // expected-error {{expected '(' after 'final'}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final() // expected-error {{expected expression}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argc)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argc > 0 ? argv[1] : argv[2])
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(foobool(argc)), final(true) // expected-error {{directive '#pragma omp taskloop simd' cannot contain more than one 'final' clause}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argv[1] = 2) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(argc argc) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(1 0) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd final(if (tmain(argc, argv) // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
|
||||
return tmain(argc, argv);
|
||||
}
|
|
@ -0,0 +1,313 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp %s
|
||||
|
||||
void foo() {
|
||||
}
|
||||
|
||||
bool foobool(int argc) {
|
||||
return argc;
|
||||
}
|
||||
|
||||
struct S1; // expected-note 2 {{declared here}} expected-note 2 {{forward declaration of 'S1'}}
|
||||
extern S1 a;
|
||||
class S2 {
|
||||
mutable int a;
|
||||
|
||||
public:
|
||||
S2() : a(0) {}
|
||||
S2(const S2 &s2) : a(s2.a) {}
|
||||
static float S2s;
|
||||
static const float S2sc;
|
||||
};
|
||||
const float S2::S2sc = 0;
|
||||
const S2 b;
|
||||
const S2 ba[5];
|
||||
class S3 {
|
||||
int a;
|
||||
S3 &operator=(const S3 &s3);
|
||||
|
||||
public:
|
||||
S3() : a(0) {} // expected-note 2 {{candidate constructor not viable: requires 0 arguments, but 1 was provided}}
|
||||
S3(S3 &s3) : a(s3.a) {} // expected-note 2 {{candidate constructor not viable: 1st argument ('const S3') would lose const qualifier}}
|
||||
};
|
||||
const S3 c;
|
||||
const S3 ca[5];
|
||||
extern const int f;
|
||||
class S4 {
|
||||
int a;
|
||||
S4();
|
||||
S4(const S4 &s4); // expected-note 2 {{implicitly declared private here}}
|
||||
|
||||
public:
|
||||
S4(int v) : a(v) {}
|
||||
};
|
||||
class S5 {
|
||||
int a;
|
||||
S5(const S5 &s5) : a(s5.a) {} // expected-note 4 {{implicitly declared private here}}
|
||||
|
||||
public:
|
||||
S5() : a(0) {}
|
||||
S5(int v) : a(v) {}
|
||||
};
|
||||
class S6 {
|
||||
int a;
|
||||
S6() : a(0) {}
|
||||
|
||||
public:
|
||||
S6(const S6 &s6) : a(s6.a) {}
|
||||
S6(int v) : a(v) {}
|
||||
};
|
||||
|
||||
S3 h;
|
||||
#pragma omp threadprivate(h) // expected-note 2 {{defined as threadprivate or thread local}}
|
||||
|
||||
template <class I, class C>
|
||||
int foomain(int argc, char **argv) {
|
||||
I e(4);
|
||||
C g(5);
|
||||
int i;
|
||||
int &j = i;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate // expected-error {{expected '(' after 'firstprivate'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate() // expected-error {{expected expression}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(argc)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(a, b) // expected-error {{firstprivate variable with incomplete type 'S1'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(argv[1]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(e, g) // expected-error {{calling a private constructor of class 'S4'}} expected-error {{calling a private constructor of class 'S5'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(h) // expected-error {{threadprivate or thread local variable cannot be firstprivate}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
{
|
||||
int v = 0;
|
||||
int i;
|
||||
#pragma omp taskloop simd firstprivate(i)
|
||||
for (int k = 0; k < argc; ++k) {
|
||||
i = k;
|
||||
v += i;
|
||||
}
|
||||
}
|
||||
#pragma omp parallel shared(i)
|
||||
#pragma omp parallel private(i)
|
||||
#pragma omp taskloop simd firstprivate(j)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(i)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(g) firstprivate(g) // expected-error {{calling a private constructor of class 'S5'}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel private(i)
|
||||
#pragma omp taskloop simd firstprivate(i) // expected-note {{defined as firstprivate}}
|
||||
for (i = 0; i < argc; ++i) // expected-error {{loop iteration variable in the associated loop of 'omp taskloop simd' directive may not be firstprivate, predetermined as linear}}
|
||||
foo();
|
||||
#pragma omp parallel reduction(+ : i)
|
||||
#pragma omp taskloop simd firstprivate(i) // expected-note {{defined as firstprivate}}
|
||||
for (i = 0; i < argc; ++i) // expected-error {{loop iteration variable in the associated loop of 'omp taskloop simd' directive may not be firstprivate, predetermined as linear}}
|
||||
foo();
|
||||
return 0;
|
||||
}
|
||||
|
||||
void bar(S4 a[2]) {
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(a)
|
||||
for (int i = 0; i < 2; ++i)
|
||||
foo();
|
||||
}
|
||||
|
||||
namespace A {
|
||||
double x;
|
||||
#pragma omp threadprivate(x) // expected-note {{defined as threadprivate or thread local}}
|
||||
}
|
||||
namespace B {
|
||||
using A::x;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
const int d = 5;
|
||||
const int da[5] = {0};
|
||||
S4 e(4);
|
||||
S5 g(5);
|
||||
S3 m;
|
||||
S6 n(2);
|
||||
int i;
|
||||
int &j = i;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate // expected-error {{expected '(' after 'firstprivate'}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate() // expected-error {{expected expression}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(argc)
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(a, b, c, d, f) // expected-error {{firstprivate variable with incomplete type 'S1'}} expected-error {{no matching constructor for initialization of 'S3'}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(argv[1]) // expected-error {{expected variable name}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(2 * 2) // expected-error {{expected variable name}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(ba) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(ca) // expected-error {{no matching constructor for initialization of 'S3'}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(da) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
int xa;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(xa) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(S2::S2s) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(S2::S2sc) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd safelen(5)
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(e, g) // expected-error {{calling a private constructor of class 'S4'}} expected-error {{calling a private constructor of class 'S5'}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(m) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(h) // expected-error {{threadprivate or thread local variable cannot be firstprivate}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd private(xa), firstprivate(xa) // expected-error {{private variable cannot be firstprivate}} expected-note {{defined as private}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(i) // expected-note {{defined as firstprivate}}
|
||||
for (i = 0; i < argc; ++i) // expected-error {{loop iteration variable in the associated loop of 'omp taskloop simd' directive may not be firstprivate, predetermined as linear}}
|
||||
foo();
|
||||
#pragma omp parallel shared(xa)
|
||||
#pragma omp taskloop simd firstprivate(xa) // OK: may be firstprivate
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(j)
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(g) firstprivate(g) // expected-error {{calling a private constructor of class 'S5'}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(n) firstprivate(n) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
{
|
||||
int v = 0;
|
||||
int i;
|
||||
#pragma omp taskloop simd firstprivate(i)
|
||||
for (int k = 0; k < argc; ++k) {
|
||||
i = k;
|
||||
v += i;
|
||||
}
|
||||
}
|
||||
#pragma omp parallel private(i)
|
||||
#pragma omp taskloop simd firstprivate(i) // expected-note {{defined as firstprivate}}
|
||||
for (i = 0; i < argc; ++i) // expected-error {{loop iteration variable in the associated loop of 'omp taskloop simd' directive may not be firstprivate, predetermined as linear}}
|
||||
foo();
|
||||
#pragma omp parallel reduction(+ : i)
|
||||
#pragma omp taskloop simd firstprivate(i) // expected-note {{defined as firstprivate}}
|
||||
for (i = 0; i < argc; ++i) // expected-error {{loop iteration variable in the associated loop of 'omp taskloop simd' directive may not be firstprivate, predetermined as linear}}
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(B::x) // expected-error {{threadprivate or thread local variable cannot be firstprivate}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
static int si;
|
||||
#pragma omp taskloop simd firstprivate(si) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
si = i + 1;
|
||||
|
||||
return foomain<S4, S5>(argc, argv); // expected-note {{in instantiation of function template specialization 'foomain<S4, S5>' requested here}}
|
||||
}
|
||||
|
|
@ -0,0 +1,287 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp %s
|
||||
|
||||
void foo() {
|
||||
}
|
||||
|
||||
bool foobool(int argc) {
|
||||
return argc;
|
||||
}
|
||||
|
||||
struct S1; // expected-note 2 {{declared here}} expected-note 2 {{forward declaration of 'S1'}}
|
||||
extern S1 a;
|
||||
class S2 {
|
||||
mutable int a;
|
||||
|
||||
public:
|
||||
S2() : a(0) {}
|
||||
S2(S2 &s2) : a(s2.a) {}
|
||||
const S2 &operator =(const S2&) const;
|
||||
S2 &operator =(const S2&);
|
||||
static float S2s;
|
||||
static const float S2sc;
|
||||
};
|
||||
const float S2::S2sc = 0; // expected-note {{static data member is predetermined as shared}}
|
||||
const S2 b;
|
||||
const S2 ba[5];
|
||||
class S3 {
|
||||
int a;
|
||||
S3 &operator=(const S3 &s3); // expected-note 2 {{implicitly declared private here}}
|
||||
|
||||
public:
|
||||
S3() : a(0) {}
|
||||
S3(S3 &s3) : a(s3.a) {}
|
||||
};
|
||||
const S3 c; // expected-note {{global variable is predetermined as shared}}
|
||||
const S3 ca[5]; // expected-note {{global variable is predetermined as shared}}
|
||||
extern const int f; // expected-note {{global variable is predetermined as shared}}
|
||||
class S4 {
|
||||
int a;
|
||||
S4(); // expected-note 3 {{implicitly declared private here}}
|
||||
S4(const S4 &s4);
|
||||
|
||||
public:
|
||||
S4(int v) : a(v) {}
|
||||
};
|
||||
class S5 {
|
||||
int a;
|
||||
S5() : a(0) {} // expected-note {{implicitly declared private here}}
|
||||
|
||||
public:
|
||||
S5(const S5 &s5) : a(s5.a) {}
|
||||
S5(int v) : a(v) {}
|
||||
};
|
||||
class S6 {
|
||||
int a;
|
||||
S6() : a(0) {}
|
||||
|
||||
public:
|
||||
S6(const S6 &s6) : a(s6.a) {}
|
||||
S6(int v) : a(v) {}
|
||||
};
|
||||
|
||||
S3 h;
|
||||
#pragma omp threadprivate(h) // expected-note 2 {{defined as threadprivate or thread local}}
|
||||
|
||||
template <class I, class C>
|
||||
int foomain(int argc, char **argv) {
|
||||
I e(4);
|
||||
I g(5);
|
||||
int i;
|
||||
int &j = i;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate // expected-error {{expected '(' after 'lastprivate'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate() // expected-error {{expected expression}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(argc)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(a, b) // expected-error {{lastprivate variable with incomplete type 'S1'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(argv[1]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(e, g) // expected-error 2 {{calling a private constructor of class 'S4'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(h) // expected-error {{threadprivate or thread local variable cannot be lastprivate}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
{
|
||||
int v = 0;
|
||||
int i;
|
||||
#pragma omp taskloop simd lastprivate(i)
|
||||
for (int k = 0; k < argc; ++k) {
|
||||
i = k;
|
||||
v += i;
|
||||
}
|
||||
}
|
||||
#pragma omp parallel shared(i)
|
||||
#pragma omp parallel private(i)
|
||||
#pragma omp taskloop simd lastprivate(j)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(i)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
return 0;
|
||||
}
|
||||
|
||||
void bar(S4 a[2]) {
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(a)
|
||||
for (int i = 0; i < 2; ++i)
|
||||
foo();
|
||||
}
|
||||
|
||||
namespace A {
|
||||
double x;
|
||||
#pragma omp threadprivate(x) // expected-note {{defined as threadprivate or thread local}}
|
||||
}
|
||||
namespace B {
|
||||
using A::x;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
const int d = 5; // expected-note {{constant variable is predetermined as shared}}
|
||||
const int da[5] = {0}; // expected-note {{constant variable is predetermined as shared}}
|
||||
S4 e(4);
|
||||
S5 g(5);
|
||||
S3 m;
|
||||
S6 n(2);
|
||||
int i;
|
||||
int &j = i;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate // expected-error {{expected '(' after 'lastprivate'}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate() // expected-error {{expected expression}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(argc)
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(a, b, c, d, f) // expected-error {{lastprivate variable with incomplete type 'S1'}} expected-error 3 {{shared variable cannot be lastprivate}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(argv[1]) // expected-error {{expected variable name}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(2 * 2) // expected-error {{expected variable name}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(ba)
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(ca) // expected-error {{shared variable cannot be lastprivate}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(da) // expected-error {{shared variable cannot be lastprivate}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
int xa;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(xa) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(S2::S2s)
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(S2::S2sc) // expected-error {{shared variable cannot be lastprivate}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd safelen(5)
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(e, g) // expected-error {{calling a private constructor of class 'S4'}} expected-error {{calling a private constructor of class 'S5'}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(m) // expected-error {{'operator=' is a private member of 'S3'}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(h) // expected-error {{threadprivate or thread local variable cannot be lastprivate}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(B::x) // expected-error {{threadprivate or thread local variable cannot be lastprivate}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd private(xa), lastprivate(xa) // expected-error {{private variable cannot be lastprivate}} expected-note {{defined as private}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(i) // expected-note {{defined as lastprivate}}
|
||||
for (i = 0; i < argc; ++i) // expected-error {{loop iteration variable in the associated loop of 'omp taskloop simd' directive may not be lastprivate, predetermined as linear}}
|
||||
foo();
|
||||
#pragma omp parallel private(xa)
|
||||
#pragma omp taskloop simd lastprivate(xa)
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel reduction(+ : xa)
|
||||
#pragma omp taskloop simd lastprivate(xa)
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(j)
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd firstprivate(m) lastprivate(m) // expected-error {{'operator=' is a private member of 'S3'}}
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(n) firstprivate(n) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
foo();
|
||||
static int si;
|
||||
#pragma omp taskloop simd lastprivate(si) // OK
|
||||
for (i = 0; i < argc; ++i)
|
||||
si = i + 1;
|
||||
return foomain<S4, S5>(argc, argv); // expected-note {{in instantiation of function template specialization 'foomain<S4, S5>' requested here}}
|
||||
}
|
|
@ -0,0 +1,249 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp %s
|
||||
|
||||
namespace X {
|
||||
int x;
|
||||
};
|
||||
|
||||
struct B {
|
||||
static int ib; // expected-note {{'B::ib' declared here}}
|
||||
static int bfoo() { return 8; }
|
||||
};
|
||||
|
||||
int bfoo() { return 4; }
|
||||
|
||||
int z;
|
||||
const int C1 = 1;
|
||||
const int C2 = 2;
|
||||
void test_linear_colons()
|
||||
{
|
||||
int B = 0;
|
||||
#pragma omp taskloop simd linear(B:bfoo())
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
// expected-error@+1 {{unexpected ':' in nested name specifier; did you mean '::'}}
|
||||
#pragma omp taskloop simd linear(B::ib:B:bfoo())
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
// expected-error@+1 {{use of undeclared identifier 'ib'; did you mean 'B::ib'}}
|
||||
#pragma omp taskloop simd linear(B:ib)
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
// expected-error@+1 {{unexpected ':' in nested name specifier; did you mean '::'?}}
|
||||
#pragma omp taskloop simd linear(z:B:ib)
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
#pragma omp taskloop simd linear(B:B::bfoo())
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
#pragma omp taskloop simd linear(X::x : ::z)
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
#pragma omp taskloop simd linear(B,::z, X::x)
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
#pragma omp taskloop simd linear(::z)
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
// expected-error@+1 {{expected variable name}}
|
||||
#pragma omp taskloop simd linear(B::bfoo())
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
#pragma omp taskloop simd linear(B::ib,B:C1+C2)
|
||||
for (int i = 0; i < 10; ++i) ;
|
||||
}
|
||||
|
||||
template<int L, class T, class N> T test_template(T* arr, N num) {
|
||||
N i;
|
||||
T sum = (T)0;
|
||||
T ind2 = - num * L; // expected-note {{'ind2' defined here}}
|
||||
// expected-error@+1 {{argument of a linear clause should be of integral or pointer type}}
|
||||
#pragma omp taskloop simd linear(ind2:L)
|
||||
for (i = 0; i < num; ++i) {
|
||||
T cur = arr[(int)ind2];
|
||||
ind2 += L;
|
||||
sum += cur;
|
||||
}
|
||||
return T();
|
||||
}
|
||||
|
||||
template<int LEN> int test_warn() {
|
||||
int ind2 = 0;
|
||||
// expected-warning@+1 {{zero linear step (ind2 should probably be const)}}
|
||||
#pragma omp taskloop simd linear(ind2:LEN)
|
||||
for (int i = 0; i < 100; i++) {
|
||||
ind2 += LEN;
|
||||
}
|
||||
return ind2;
|
||||
}
|
||||
|
||||
struct S1; // expected-note 2 {{declared here}} expected-note 2 {{forward declaration of 'S1'}}
|
||||
extern S1 a;
|
||||
class S2 {
|
||||
mutable int a;
|
||||
public:
|
||||
S2():a(0) { }
|
||||
};
|
||||
const S2 b; // expected-note 2 {{'b' defined here}}
|
||||
const S2 ba[5];
|
||||
class S3 {
|
||||
int a;
|
||||
public:
|
||||
S3():a(0) { }
|
||||
};
|
||||
const S3 ca[5];
|
||||
class S4 {
|
||||
int a;
|
||||
S4();
|
||||
public:
|
||||
S4(int v):a(v) { }
|
||||
};
|
||||
class S5 {
|
||||
int a;
|
||||
S5():a(0) {}
|
||||
public:
|
||||
S5(int v):a(v) { }
|
||||
};
|
||||
|
||||
S3 h;
|
||||
#pragma omp threadprivate(h) // expected-note 2 {{defined as threadprivate or thread local}}
|
||||
|
||||
template<class I, class C> int foomain(I argc, C **argv) {
|
||||
I e(4);
|
||||
I g(5);
|
||||
int i;
|
||||
int &j = i;
|
||||
#pragma omp taskloop simd linear // expected-error {{expected '(' after 'linear'}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (val // expected-error {{use of undeclared identifier 'val'}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (uval( // expected-error {{expected expression}} expected-error 2 {{expected ')'}} expected-note 2 {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (ref() // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (foo() // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear () // expected-error {{expected expression}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (val argc // expected-error {{use of undeclared identifier 'val'}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (val(argc, // expected-error {{expected expression}} expected-error 2 {{expected ')'}} expected-note 2 {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (argc : 5)
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
// expected-error@+2 {{linear variable with incomplete type 'S1'}}
|
||||
// expected-error@+1 {{const-qualified variable cannot be linear}}
|
||||
#pragma omp taskloop simd linear (val(a, b):B::ib)
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (argv[1]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(ref(e, g)) // expected-error 2 {{variable of non-reference type 'int' can be used only with 'val' modifier, but used with 'ref'}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(h) // expected-error {{threadprivate or thread local variable cannot be linear}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(uval(i)) // expected-error {{variable of non-reference type 'int' can be used only with 'val' modifier, but used with 'uval'}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp parallel
|
||||
{
|
||||
int v = 0;
|
||||
int i;
|
||||
#pragma omp taskloop simd linear(v:i)
|
||||
for (int k = 0; k < argc; ++k) { i = k; v += i; }
|
||||
}
|
||||
#pragma omp taskloop simd linear(ref(j))
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(uval(j))
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
int v = 0;
|
||||
#pragma omp taskloop simd linear(v:j)
|
||||
for (int k = 0; k < argc; ++k) { ++k; v += j; }
|
||||
#pragma omp taskloop simd linear(i)
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
return 0;
|
||||
}
|
||||
|
||||
namespace A {
|
||||
double x;
|
||||
#pragma omp threadprivate(x) // expected-note {{defined as threadprivate or thread local}}
|
||||
}
|
||||
namespace C {
|
||||
using A::x;
|
||||
}
|
||||
|
||||
void linear_modifiers(int argc) {
|
||||
int &f = argc;
|
||||
#pragma omp taskloop simd linear(f)
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(val(f))
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(uval(f))
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(ref(f))
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(foo(f)) // expected-error {{expected one of 'ref', val' or 'uval' modifiers}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
}
|
||||
|
||||
int f;
|
||||
int main(int argc, char **argv) {
|
||||
double darr[100];
|
||||
// expected-note@+1 {{in instantiation of function template specialization 'test_template<-4, double, int>' requested here}}
|
||||
test_template<-4>(darr, 4);
|
||||
// expected-note@+1 {{in instantiation of function template specialization 'test_warn<0>' requested here}}
|
||||
test_warn<0>();
|
||||
|
||||
S4 e(4); // expected-note {{'e' defined here}}
|
||||
S5 g(5); // expected-note {{'g' defined here}}
|
||||
int i;
|
||||
int &j = i;
|
||||
#pragma omp taskloop simd linear(f) linear(f) // expected-error {{linear variable cannot be linear}} expected-note {{defined as linear}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear // expected-error {{expected '(' after 'linear'}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear () // expected-error {{expected expression}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (val // expected-error {{use of undeclared identifier 'val'}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (ref()) // expected-error {{expected expression}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (foo()) // expected-error {{expected expression}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (argc)
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
// expected-error@+2 {{linear variable with incomplete type 'S1'}}
|
||||
// expected-error@+1 {{const-qualified variable cannot be linear}}
|
||||
#pragma omp taskloop simd linear(a, b)
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear (argv[1]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
// expected-error@+2 {{argument of a linear clause should be of integral or pointer type, not 'S4'}}
|
||||
// expected-error@+1 {{argument of a linear clause should be of integral or pointer type, not 'S5'}}
|
||||
#pragma omp taskloop simd linear(val(e, g))
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(h, C::x) // expected-error 2 {{threadprivate or thread local variable cannot be linear}}
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp parallel
|
||||
{
|
||||
int i;
|
||||
#pragma omp taskloop simd linear(val(i))
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(uval(i) : 4) // expected-error {{variable of non-reference type 'int' can be used only with 'val' modifier, but used with 'uval'}}
|
||||
for (int k = 0; k < argc; ++k) { ++k; i += 4; }
|
||||
}
|
||||
#pragma omp taskloop simd linear(ref(j))
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
#pragma omp taskloop simd linear(i)
|
||||
for (int k = 0; k < argc; ++k) ++k;
|
||||
|
||||
foomain<int,char>(argc,argv); // expected-note {{in instantiation of function template specialization 'foomain<int, char>' requested here}}
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -0,0 +1,737 @@
|
|||
// RUN: %clang_cc1 -fsyntax-only -fopenmp -x c++ -std=c++11 -fexceptions -fcxx-exceptions -verify %s
|
||||
|
||||
class S {
|
||||
int a;
|
||||
S() : a(0) {}
|
||||
|
||||
public:
|
||||
S(int v) : a(v) {}
|
||||
S(const S &s) : a(s.a) {}
|
||||
};
|
||||
|
||||
static int sii;
|
||||
#pragma omp threadprivate(sii)
|
||||
static int globalii;
|
||||
|
||||
// Currently, we cannot use "0" for global register variables.
|
||||
// register int reg0 __asm__("0");
|
||||
int reg0;
|
||||
|
||||
int test_iteration_spaces() {
|
||||
const int N = 100;
|
||||
float a[N], b[N], c[N];
|
||||
int ii, jj, kk;
|
||||
float fii;
|
||||
double dii;
|
||||
register int reg; // expected-warning {{'register' storage class specifier is deprecated}}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0; i < 10; i += 1) {
|
||||
c[i] = a[i] + b[i];
|
||||
}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (char i = 0; i < 10; i++) {
|
||||
c[i] = a[i] + b[i];
|
||||
}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (char i = 0; i < 10; i += '\1') {
|
||||
c[i] = a[i] + b[i];
|
||||
}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (long long i = 0; i < 10; i++) {
|
||||
c[i] = a[i] + b[i];
|
||||
}
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expression must have integral or unscoped enumeration type, not 'double'}}
|
||||
#pragma omp taskloop simd
|
||||
for (long long i = 0; i < 10; i += 1.5) {
|
||||
c[i] = a[i] + b[i];
|
||||
}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (long long i = 0; i < 'z'; i += 1u) {
|
||||
c[i] = a[i] + b[i];
|
||||
}
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{variable must be of integer or random access iterator type}}
|
||||
#pragma omp taskloop simd
|
||||
for (float fi = 0; fi < 10.0; fi++) {
|
||||
c[(int)fi] = a[(int)fi] + b[(int)fi];
|
||||
}
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{variable must be of integer or random access iterator type}}
|
||||
#pragma omp taskloop simd
|
||||
for (double fi = 0; fi < 10.0; fi++) {
|
||||
c[(int)fi] = a[(int)fi] + b[(int)fi];
|
||||
}
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (int &ref = ii; ref < 10; ref++) {
|
||||
}
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (int i; i < 10; i++)
|
||||
c[i] = a[i];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0, j = 0; i < 10; ++i)
|
||||
c[i] = a[i];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (; ii < 10; ++ii)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-warning@+3 {{expression result unused}}
|
||||
// expected-error@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii + 1; ii < 10; ++ii)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (c[ii] = 0; ii < 10; ++ii)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// Ok to skip parenthesises.
|
||||
#pragma omp taskloop simd
|
||||
for (((ii)) = 0; ii < 10; ++ii)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{condition of OpenMP for loop must be a relational comparison ('<', '<=', '>', or '>=') of loop variable 'i'}}
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0; i; i++)
|
||||
c[i] = a[i];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+3 {{condition of OpenMP for loop must be a relational comparison ('<', '<=', '>', or '>=') of loop variable 'i'}}
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'i'}}
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0; jj < kk; ii++)
|
||||
c[i] = a[i];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{condition of OpenMP for loop must be a relational comparison ('<', '<=', '>', or '>=') of loop variable 'i'}}
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0; !!i; i++)
|
||||
c[i] = a[i];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{condition of OpenMP for loop must be a relational comparison ('<', '<=', '>', or '>=') of loop variable 'i'}}
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0; i != 1; i++)
|
||||
c[i] = a[i];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{condition of OpenMP for loop must be a relational comparison ('<', '<=', '>', or '>=') of loop variable 'i'}}
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0;; i++)
|
||||
c[i] = a[i];
|
||||
|
||||
#pragma omp parallel
|
||||
// Ok.
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 11; i > 10; i--)
|
||||
c[i] = a[i];
|
||||
|
||||
#pragma omp parallel
|
||||
// Ok.
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0; i < 10; ++i)
|
||||
c[i] = a[i];
|
||||
|
||||
#pragma omp parallel
|
||||
// Ok.
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; ++ii)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'ii'}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; ++jj)
|
||||
c[ii] = a[jj];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'ii'}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; ++++ii)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// Ok but undefined behavior (in general, cannot check that incr
|
||||
// is really loop-invariant).
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; ii = ii + ii)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expression must have integral or unscoped enumeration type, not 'float'}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; ii = ii + 1.0f)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// Ok - step was converted to integer type.
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; ii = ii + (int)1.1f)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'ii'}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; jj = ii + 2)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-warning@+3 {{relational comparison result unused}}
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'ii'}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii<10; jj> kk + 2)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'ii'}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10;)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-warning@+3 {{expression result unused}}
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'ii'}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; !ii)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'ii'}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; ii ? ++ii : ++jj)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'ii'}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; ii = ii < 10)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be positive due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'ii' to increase on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; ii = ii + 0)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be positive due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'ii' to increase on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; ii = ii + (int)(0.8 - 0.45))
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be positive due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'ii' to increase on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; (ii) < 10; ii -= 25)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be positive due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'ii' to increase on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; (ii < 10); ii -= 0)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be negative due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'ii' to decrease on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii > 10; (ii += 0))
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be positive due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'ii' to increase on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; ii < 10; (ii) = (1 - 1) + (ii))
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be negative due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'ii' to decrease on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for ((ii = 0); ii > 10; (ii -= 0))
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be positive due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'ii' to increase on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (ii = 0; (ii < 10); (ii -= 0))
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+2 {{defined as firstprivate}}
|
||||
// expected-error@+2 {{loop iteration variable in the associated loop of 'omp taskloop simd' directive may not be firstprivate, predetermined as linear}}
|
||||
#pragma omp taskloop simd firstprivate(ii)
|
||||
for (ii = 0; ii < 10; ii++)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd linear(ii)
|
||||
for (ii = 0; ii < 10; ii++)
|
||||
c[ii] = a[ii];
|
||||
|
||||
// expected-note@+3 {{defined as private}}
|
||||
// expected-error@+3 {{loop iteration variable in the associated loop of 'omp taskloop simd' directive may not be private, predetermined as linear}}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd private(ii)
|
||||
for (ii = 0; ii < 10; ii++)
|
||||
c[ii] = a[ii];
|
||||
|
||||
// expected-note@+3 {{defined as lastprivate}}
|
||||
// expected-error@+3 {{loop iteration variable in the associated loop of 'omp taskloop simd' directive may not be lastprivate, predetermined as linear}}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(ii)
|
||||
for (ii = 0; ii < 10; ii++)
|
||||
c[ii] = a[ii];
|
||||
|
||||
#pragma omp parallel
|
||||
{
|
||||
#pragma omp taskloop simd
|
||||
for (sii = 0; sii < 10; sii += 1)
|
||||
c[sii] = a[sii];
|
||||
}
|
||||
|
||||
#pragma omp parallel
|
||||
{
|
||||
#pragma omp taskloop simd
|
||||
for (reg0 = 0; reg0 < 10; reg0 += 1)
|
||||
c[reg0] = a[reg0];
|
||||
}
|
||||
|
||||
#pragma omp parallel
|
||||
{
|
||||
#pragma omp taskloop simd
|
||||
for (reg = 0; reg < 10; reg += 1)
|
||||
c[reg] = a[reg];
|
||||
}
|
||||
|
||||
#pragma omp parallel
|
||||
{
|
||||
#pragma omp taskloop simd
|
||||
for (globalii = 0; globalii < 10; globalii += 1)
|
||||
c[globalii] = a[globalii];
|
||||
}
|
||||
|
||||
#pragma omp parallel
|
||||
{
|
||||
#pragma omp taskloop simd collapse(2)
|
||||
for (ii = 0; ii < 10; ii += 1)
|
||||
for (globalii = 0; globalii < 10; globalii += 1)
|
||||
c[globalii] += a[globalii] + ii;
|
||||
}
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{statement after '#pragma omp taskloop simd' must be a for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (auto &item : a) {
|
||||
item = item + 1;
|
||||
}
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be positive due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'i' to increase on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (unsigned i = 9; i < 10; i--) {
|
||||
c[i] = a[i] + b[i];
|
||||
}
|
||||
|
||||
int(*lb)[4] = nullptr;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (int(*p)[4] = lb; p < lb + 8; ++p) {
|
||||
}
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-warning@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (int a{0}; a < 10; ++a) {
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
// Iterators allowed in openmp for-loops.
|
||||
namespace std {
|
||||
struct random_access_iterator_tag {};
|
||||
template <class Iter>
|
||||
struct iterator_traits {
|
||||
typedef typename Iter::difference_type difference_type;
|
||||
typedef typename Iter::iterator_category iterator_category;
|
||||
};
|
||||
template <class Iter>
|
||||
typename iterator_traits<Iter>::difference_type
|
||||
distance(Iter first, Iter last) { return first - last; }
|
||||
}
|
||||
class Iter0 {
|
||||
public:
|
||||
Iter0() {}
|
||||
Iter0(const Iter0 &) {}
|
||||
Iter0 operator++() { return *this; }
|
||||
Iter0 operator--() { return *this; }
|
||||
bool operator<(Iter0 a) { return true; }
|
||||
};
|
||||
// expected-note@+2 {{candidate function not viable: no known conversion from 'GoodIter' to 'Iter0' for 1st argument}}
|
||||
// expected-note@+1 2 {{candidate function not viable: no known conversion from 'Iter1' to 'Iter0' for 1st argument}}
|
||||
int operator-(Iter0 a, Iter0 b) { return 0; }
|
||||
class Iter1 {
|
||||
public:
|
||||
Iter1(float f = 0.0f, double d = 0.0) {}
|
||||
Iter1(const Iter1 &) {}
|
||||
Iter1 operator++() { return *this; }
|
||||
Iter1 operator--() { return *this; }
|
||||
bool operator<(Iter1 a) { return true; }
|
||||
bool operator>=(Iter1 a) { return false; }
|
||||
};
|
||||
class GoodIter {
|
||||
public:
|
||||
GoodIter() {}
|
||||
GoodIter(const GoodIter &) {}
|
||||
GoodIter(int fst, int snd) {}
|
||||
GoodIter &operator=(const GoodIter &that) { return *this; }
|
||||
GoodIter &operator=(const Iter0 &that) { return *this; }
|
||||
GoodIter &operator+=(int x) { return *this; }
|
||||
GoodIter &operator-=(int x) { return *this; }
|
||||
explicit GoodIter(void *) {}
|
||||
GoodIter operator++() { return *this; }
|
||||
GoodIter operator--() { return *this; }
|
||||
bool operator!() { return true; }
|
||||
bool operator<(GoodIter a) { return true; }
|
||||
bool operator<=(GoodIter a) { return true; }
|
||||
bool operator>=(GoodIter a) { return false; }
|
||||
typedef int difference_type;
|
||||
typedef std::random_access_iterator_tag iterator_category;
|
||||
};
|
||||
// expected-note@+2 {{candidate function not viable: no known conversion from 'Iter0' to 'GoodIter' for 2nd argument}}
|
||||
// expected-note@+1 2 {{candidate function not viable: no known conversion from 'Iter1' to 'GoodIter' for 1st argument}}
|
||||
int operator-(GoodIter a, GoodIter b) { return 0; }
|
||||
// expected-note@+1 3 {{candidate function not viable: requires single argument 'a', but 2 arguments were provided}}
|
||||
GoodIter operator-(GoodIter a) { return a; }
|
||||
// expected-note@+2 {{candidate function not viable: no known conversion from 'Iter0' to 'int' for 2nd argument}}
|
||||
// expected-note@+1 2 {{candidate function not viable: no known conversion from 'Iter1' to 'GoodIter' for 1st argument}}
|
||||
GoodIter operator-(GoodIter a, int v) { return GoodIter(); }
|
||||
// expected-note@+1 2 {{candidate function not viable: no known conversion from 'Iter0' to 'GoodIter' for 1st argument}}
|
||||
GoodIter operator+(GoodIter a, int v) { return GoodIter(); }
|
||||
// expected-note@+2 {{candidate function not viable: no known conversion from 'GoodIter' to 'int' for 1st argument}}
|
||||
// expected-note@+1 2 {{candidate function not viable: no known conversion from 'Iter1' to 'int' for 1st argument}}
|
||||
GoodIter operator-(int v, GoodIter a) { return GoodIter(); }
|
||||
// expected-note@+1 2 {{candidate function not viable: no known conversion from 'Iter0' to 'int' for 1st argument}}
|
||||
GoodIter operator+(int v, GoodIter a) { return GoodIter(); }
|
||||
|
||||
int test_with_random_access_iterator() {
|
||||
GoodIter begin, end;
|
||||
Iter0 begin0, end0;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I = begin; I < end; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter &I = begin; I < end; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I = begin; I >= end; --I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-warning@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I(begin); I < end; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-warning@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I(nullptr); I < end; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-warning@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I(0); I < end; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-warning@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I(1, 2); I < end; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (begin = GoodIter(0); begin < end; ++begin)
|
||||
++begin;
|
||||
// expected-error@+4 {{invalid operands to binary expression ('GoodIter' and 'Iter0')}}
|
||||
// expected-error@+3 {{could not calculate number of iterations calling 'operator-' with upper and lower loop bounds}}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (begin = begin0; begin < end; ++begin)
|
||||
++begin;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (++begin; begin < end; ++begin)
|
||||
++begin;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (begin = end; begin < end; ++begin)
|
||||
++begin;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{condition of OpenMP for loop must be a relational comparison ('<', '<=', '>', or '>=') of loop variable 'I'}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I = begin; I - I; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{condition of OpenMP for loop must be a relational comparison ('<', '<=', '>', or '>=') of loop variable 'I'}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I = begin; begin < end; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{condition of OpenMP for loop must be a relational comparison ('<', '<=', '>', or '>=') of loop variable 'I'}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I = begin; !I; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be negative due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'I' to decrease on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I = begin; I >= end; I = I + 1)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I = begin; I >= end; I = I - 1)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'I'}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I = begin; I >= end; I = -I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be negative due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'I' to decrease on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I = begin; I >= end; I = 2 + I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{increment clause of OpenMP for loop must perform simple addition or subtraction on loop variable 'I'}}
|
||||
#pragma omp taskloop simd
|
||||
for (GoodIter I = begin; I >= end; I = 2 - I)
|
||||
++I;
|
||||
// In the following example, we cannot update the loop variable using '+='
|
||||
// expected-error@+3 {{invalid operands to binary expression ('Iter0' and 'int')}}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (Iter0 I = begin0; I < end0; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// Initializer is constructor without params.
|
||||
// expected-error@+3 {{invalid operands to binary expression ('Iter0' and 'int')}}
|
||||
// expected-warning@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (Iter0 I; I < end0; ++I)
|
||||
++I;
|
||||
Iter1 begin1, end1;
|
||||
// expected-error@+4 {{invalid operands to binary expression ('Iter1' and 'Iter1')}}
|
||||
// expected-error@+3 {{could not calculate number of iterations calling 'operator-' with upper and lower loop bounds}}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (Iter1 I = begin1; I < end1; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be negative due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'I' to decrease on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (Iter1 I = begin1; I >= end1; ++I)
|
||||
++I;
|
||||
#pragma omp parallel
|
||||
// expected-error@+5 {{invalid operands to binary expression ('Iter1' and 'float')}}
|
||||
// expected-error@+4 {{could not calculate number of iterations calling 'operator-' with upper and lower loop bounds}}
|
||||
// Initializer is constructor with all default params.
|
||||
// expected-warning@+2 {{initialization clause of OpenMP for loop is not in canonical form ('var = init' or 'T var = init')}}
|
||||
#pragma omp taskloop simd
|
||||
for (Iter1 I; I < end1; ++I) {
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
template <typename IT, int ST>
|
||||
class TC {
|
||||
public:
|
||||
int dotest_lt(IT begin, IT end) {
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be positive due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'I' to increase on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (IT I = begin; I < end; I = I + ST) {
|
||||
++I;
|
||||
}
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be positive due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'I' to increase on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (IT I = begin; I <= end; I += ST) {
|
||||
++I;
|
||||
}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (IT I = begin; I < end; ++I) {
|
||||
++I;
|
||||
}
|
||||
}
|
||||
|
||||
static IT step() {
|
||||
return IT(ST);
|
||||
}
|
||||
};
|
||||
template <typename IT, int ST = 0>
|
||||
int dotest_gt(IT begin, IT end) {
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 2 {{loop step is expected to be negative due to this condition}}
|
||||
// expected-error@+2 2 {{increment expression must cause 'I' to decrease on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (IT I = begin; I >= end; I = I + ST) {
|
||||
++I;
|
||||
}
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 2 {{loop step is expected to be negative due to this condition}}
|
||||
// expected-error@+2 2 {{increment expression must cause 'I' to decrease on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (IT I = begin; I >= end; I += ST) {
|
||||
++I;
|
||||
}
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-note@+3 {{loop step is expected to be negative due to this condition}}
|
||||
// expected-error@+2 {{increment expression must cause 'I' to decrease on each iteration of OpenMP for loop}}
|
||||
#pragma omp taskloop simd
|
||||
for (IT I = begin; I >= end; ++I) {
|
||||
++I;
|
||||
}
|
||||
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (IT I = begin; I < end; I += TC<int, ST>::step()) {
|
||||
++I;
|
||||
}
|
||||
}
|
||||
|
||||
void test_with_template() {
|
||||
GoodIter begin, end;
|
||||
TC<GoodIter, 100> t1;
|
||||
TC<GoodIter, -100> t2;
|
||||
t1.dotest_lt(begin, end);
|
||||
t2.dotest_lt(begin, end); // expected-note {{in instantiation of member function 'TC<GoodIter, -100>::dotest_lt' requested here}}
|
||||
dotest_gt(begin, end); // expected-note {{in instantiation of function template specialization 'dotest_gt<GoodIter, 0>' requested here}}
|
||||
dotest_gt<unsigned, -10>(0, 100); // expected-note {{in instantiation of function template specialization 'dotest_gt<unsigned int, -10>' requested here}}
|
||||
}
|
||||
|
||||
void test_loop_break() {
|
||||
const int N = 100;
|
||||
float a[N], b[N], c[N];
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0; i < 10; i++) {
|
||||
c[i] = a[i] + b[i];
|
||||
for (int j = 0; j < 10; ++j) {
|
||||
if (a[i] > b[j])
|
||||
break; // OK in nested loop
|
||||
}
|
||||
switch (i) {
|
||||
case 1:
|
||||
b[i]++;
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
if (c[i] > 10)
|
||||
break; // expected-error {{'break' statement cannot be used in OpenMP for loop}}
|
||||
|
||||
if (c[i] > 11)
|
||||
break; // expected-error {{'break' statement cannot be used in OpenMP for loop}}
|
||||
}
|
||||
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0; i < 10; i++) {
|
||||
for (int j = 0; j < 10; j++) {
|
||||
c[i] = a[i] + b[i];
|
||||
if (c[i] > 10) {
|
||||
if (c[i] < 20) {
|
||||
break; // OK
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void test_loop_eh() {
|
||||
const int N = 100;
|
||||
float a[N], b[N], c[N];
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0; i < 10; i++) {
|
||||
c[i] = a[i] + b[i];
|
||||
try { // expected-error {{'try' statement cannot be used in OpenMP simd region}}
|
||||
for (int j = 0; j < 10; ++j) {
|
||||
if (a[i] > b[j])
|
||||
throw a[i]; // expected-error {{'throw' statement cannot be used in OpenMP simd region}}
|
||||
}
|
||||
throw a[i]; // expected-error {{'throw' statement cannot be used in OpenMP simd region}}
|
||||
} catch (float f) {
|
||||
if (f > 0.1)
|
||||
throw a[i]; // expected-error {{'throw' statement cannot be used in OpenMP simd region}}
|
||||
return; // expected-error {{cannot return from OpenMP region}}
|
||||
}
|
||||
switch (i) {
|
||||
case 1:
|
||||
b[i]++;
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
for (int j = 0; j < 10; j++) {
|
||||
if (c[i] > 10)
|
||||
throw c[i]; // expected-error {{'throw' statement cannot be used in OpenMP simd region}}
|
||||
}
|
||||
}
|
||||
if (c[9] > 10)
|
||||
throw c[9]; // OK
|
||||
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (int i = 0; i < 10; ++i) {
|
||||
struct S {
|
||||
void g() { throw 0; }
|
||||
};
|
||||
}
|
||||
}
|
||||
|
||||
void test_loop_firstprivate_lastprivate() {
|
||||
S s(4);
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(s) firstprivate(s)
|
||||
for (int i = 0; i < 16; ++i)
|
||||
;
|
||||
}
|
||||
|
|
@ -0,0 +1,368 @@
|
|||
// RUN: %clang_cc1 -fsyntax-only -fopenmp -triple x86_64-unknown-unknown -verify %s
|
||||
|
||||
// expected-error@+1 {{unexpected OpenMP directive '#pragma omp taskloop simd'}}
|
||||
#pragma omp taskloop simd
|
||||
|
||||
// expected-error@+1 {{unexpected OpenMP directive '#pragma omp taskloop simd'}}
|
||||
#pragma omp taskloop simd foo
|
||||
|
||||
void test_no_clause() {
|
||||
int i;
|
||||
#pragma omp taskloop simd
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
|
||||
// expected-error@+2 {{statement after '#pragma omp taskloop simd' must be a for loop}}
|
||||
#pragma omp taskloop simd
|
||||
++i;
|
||||
}
|
||||
|
||||
void test_branch_protected_scope() {
|
||||
int i = 0;
|
||||
L1:
|
||||
++i;
|
||||
|
||||
int x[24];
|
||||
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd
|
||||
for (i = 0; i < 16; ++i) {
|
||||
if (i == 5)
|
||||
goto L1; // expected-error {{use of undeclared label 'L1'}}
|
||||
else if (i == 6)
|
||||
return; // expected-error {{cannot return from OpenMP region}}
|
||||
else if (i == 7)
|
||||
goto L2;
|
||||
else if (i == 8) {
|
||||
L2:
|
||||
x[i]++;
|
||||
}
|
||||
}
|
||||
|
||||
if (x[0] == 0)
|
||||
goto L2; // expected-error {{use of undeclared label 'L2'}}
|
||||
else if (x[1] == 1)
|
||||
goto L1;
|
||||
}
|
||||
|
||||
void test_invalid_clause() {
|
||||
int i;
|
||||
#pragma omp parallel
|
||||
// expected-warning@+1 {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
#pragma omp taskloop simd foo bar
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
}
|
||||
|
||||
void test_non_identifiers() {
|
||||
int i, x;
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-warning@+1 {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
#pragma omp taskloop simd;
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
// expected-warning@+2 {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd linear(x);
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-warning@+1 {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
#pragma omp taskloop simd private(x);
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-warning@+1 {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
#pragma omp taskloop simd, private(x);
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
}
|
||||
|
||||
extern int foo();
|
||||
|
||||
void test_collapse() {
|
||||
int i;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected '('}}
|
||||
#pragma omp taskloop simd collapse
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected expression}} expected-error@+1 {{expected ')'}} expected-note@+1 {{to match this '('}}
|
||||
#pragma omp taskloop simd collapse(
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected expression}}
|
||||
#pragma omp taskloop simd collapse()
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected expression}} expected-error@+1 {{expected ')'}} expected-note@+1 {{to match this '('}}
|
||||
#pragma omp taskloop simd collapse(,
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected expression}} expected-error@+1 {{expected ')'}} expected-note@+1 {{to match this '('}}
|
||||
#pragma omp taskloop simd collapse(, )
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-warning@+2 {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
// expected-error@+1 {{expected '('}}
|
||||
#pragma omp taskloop simd collapse 4)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}}
|
||||
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
|
||||
#pragma omp taskloop simd collapse(4
|
||||
for (i = 0; i < 16; ++i)
|
||||
; // expected-error {{expected 4 for loops after '#pragma omp taskloop simd', but found only 1}}
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}}
|
||||
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
|
||||
#pragma omp taskloop simd collapse(4,
|
||||
for (i = 0; i < 16; ++i)
|
||||
; // expected-error {{expected 4 for loops after '#pragma omp taskloop simd', but found only 1}}
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}}
|
||||
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
|
||||
#pragma omp taskloop simd collapse(4, )
|
||||
for (i = 0; i < 16; ++i)
|
||||
; // expected-error {{expected 4 for loops after '#pragma omp taskloop simd', but found only 1}}
|
||||
#pragma omp parallel
|
||||
// expected-note@+1 {{as specified in 'collapse' clause}}
|
||||
#pragma omp taskloop simd collapse(4)
|
||||
for (i = 0; i < 16; ++i)
|
||||
; // expected-error {{expected 4 for loops after '#pragma omp taskloop simd', but found only 1}}
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}}
|
||||
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
|
||||
#pragma omp taskloop simd collapse(4 4)
|
||||
for (i = 0; i < 16; ++i)
|
||||
; // expected-error {{expected 4 for loops after '#pragma omp taskloop simd', but found only 1}}
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}}
|
||||
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
|
||||
#pragma omp taskloop simd collapse(4, , 4)
|
||||
for (i = 0; i < 16; ++i)
|
||||
; // expected-error {{expected 4 for loops after '#pragma omp taskloop simd', but found only 1}}
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd collapse(4)
|
||||
for (int i1 = 0; i1 < 16; ++i1)
|
||||
for (int i2 = 0; i2 < 16; ++i2)
|
||||
for (int i3 = 0; i3 < 16; ++i3)
|
||||
for (int i4 = 0; i4 < 16; ++i4)
|
||||
foo();
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}}
|
||||
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
|
||||
#pragma omp taskloop simd collapse(4, 8)
|
||||
for (i = 0; i < 16; ++i)
|
||||
; // expected-error {{expected 4 for loops after '#pragma omp taskloop simd', but found only 1}}
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expression is not an integer constant expression}}
|
||||
#pragma omp taskloop simd collapse(2.5)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expression is not an integer constant expression}}
|
||||
#pragma omp taskloop simd collapse(foo())
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{argument to 'collapse' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd collapse(-5)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{argument to 'collapse' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd collapse(0)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{argument to 'collapse' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd collapse(5 - 5)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
}
|
||||
|
||||
void test_private() {
|
||||
int i;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected expression}}
|
||||
// expected-error@+1 {{expected ')'}} expected-note@+1 {{to match this '('}}
|
||||
#pragma omp taskloop simd private(
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}} expected-note@+2 {{to match this '('}}
|
||||
// expected-error@+1 2 {{expected expression}}
|
||||
#pragma omp taskloop simd private(,
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 2 {{expected expression}}
|
||||
#pragma omp taskloop simd private(, )
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected expression}}
|
||||
#pragma omp taskloop simd private()
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected expression}}
|
||||
#pragma omp taskloop simd private(int)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected variable name}}
|
||||
#pragma omp taskloop simd private(0)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
|
||||
int x, y, z;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd private(x)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd private(x, y)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd private(x, y, z)
|
||||
for (i = 0; i < 16; ++i) {
|
||||
x = y * i + z;
|
||||
}
|
||||
}
|
||||
|
||||
void test_lastprivate() {
|
||||
int i;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}} expected-note@+2 {{to match this '('}}
|
||||
// expected-error@+1 {{expected expression}}
|
||||
#pragma omp taskloop simd lastprivate(
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}} expected-note@+2 {{to match this '('}}
|
||||
// expected-error@+1 2 {{expected expression}}
|
||||
#pragma omp taskloop simd lastprivate(,
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 2 {{expected expression}}
|
||||
#pragma omp taskloop simd lastprivate(, )
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected expression}}
|
||||
#pragma omp taskloop simd lastprivate()
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected expression}}
|
||||
#pragma omp taskloop simd lastprivate(int)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected variable name}}
|
||||
#pragma omp taskloop simd lastprivate(0)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
|
||||
int x, y, z;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(x)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(x, y)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(x, y, z)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
}
|
||||
|
||||
void test_firstprivate() {
|
||||
int i;
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}} expected-note@+2 {{to match this '('}}
|
||||
// expected-error@+1 {{expected expression}}
|
||||
#pragma omp taskloop simd firstprivate(
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{expected ')'}} expected-note@+2 {{to match this '('}}
|
||||
// expected-error@+1 2 {{expected expression}}
|
||||
#pragma omp taskloop simd firstprivate(,
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 2 {{expected expression}}
|
||||
#pragma omp taskloop simd firstprivate(, )
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected expression}}
|
||||
#pragma omp taskloop simd firstprivate()
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected expression}}
|
||||
#pragma omp taskloop simd firstprivate(int)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
// expected-error@+1 {{expected variable name}}
|
||||
#pragma omp taskloop simd firstprivate(0)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
|
||||
int x, y, z;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(x) firstprivate(x)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(x, y) firstprivate(x, y)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd lastprivate(x, y, z) firstprivate(x, y, z)
|
||||
for (i = 0; i < 16; ++i)
|
||||
;
|
||||
}
|
||||
|
||||
void test_loop_messages() {
|
||||
float a[100], b[100], c[100];
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{variable must be of integer or pointer type}}
|
||||
#pragma omp taskloop simd
|
||||
for (float fi = 0; fi < 10.0; fi++) {
|
||||
c[(int)fi] = a[(int)fi] + b[(int)fi];
|
||||
}
|
||||
#pragma omp parallel
|
||||
// expected-error@+2 {{variable must be of integer or pointer type}}
|
||||
#pragma omp taskloop simd
|
||||
for (double fi = 0; fi < 10.0; fi++) {
|
||||
c[(int)fi] = a[(int)fi] + b[(int)fi];
|
||||
}
|
||||
|
||||
// expected-warning@+2 {{OpenMP loop iteration variable cannot have more than 64 bits size and will be narrowed}}
|
||||
#pragma omp taskloop simd
|
||||
for (__int128 ii = 0; ii < 10; ii++) {
|
||||
c[ii] = a[ii] + b[ii];
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,93 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp -ferror-limit 100 %s
|
||||
|
||||
void foo() {
|
||||
}
|
||||
|
||||
bool foobool(int argc) {
|
||||
return argc;
|
||||
}
|
||||
|
||||
struct S1; // expected-note {{declared here}}
|
||||
|
||||
template <class T, class S> // expected-note {{declared here}}
|
||||
int tmain(T argc, S **argv) {
|
||||
#pragma omp taskloop simd priority // expected-error {{expected '(' after 'priority'}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority () // expected-error {{expected expression}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (argc)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (argc > 0 ? argv[1][0] : argv[2][argc])
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (foobool(argc)), priority (true) // expected-error {{directive '#pragma omp taskloop simd' cannot contain more than one 'priority' clause}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (S) // expected-error {{'S' does not refer to a value}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (argc argc) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority(0)
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority(-1) // expected-error {{argument to 'priority' clause must be a non-negative integer value}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
#pragma omp taskloop simd priority // expected-error {{expected '(' after 'priority'}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority () // expected-error {{expected expression}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (argc)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (argc > 0 ? argv[1][0] : argv[2][argc])
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (foobool(argc)), priority (true) // expected-error {{directive '#pragma omp taskloop simd' cannot contain more than one 'priority' clause}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (argc argc) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority (1 0) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority(if(tmain(argc, argv) // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority(0)
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
#pragma omp taskloop simd priority(-1) // expected-error {{argument to 'priority' clause must be a non-negative integer value}}
|
||||
for (int i = 0; i < 10; ++i)
|
||||
foo();
|
||||
|
||||
return tmain(argc, argv);
|
||||
}
|
|
@ -0,0 +1,195 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp %s
|
||||
|
||||
void foo() {
|
||||
}
|
||||
|
||||
bool foobool(int argc) {
|
||||
return argc;
|
||||
}
|
||||
|
||||
struct S1; // expected-note 2 {{declared here}} expected-note 2 {{forward declaration of 'S1'}}
|
||||
extern S1 a;
|
||||
class S2 {
|
||||
mutable int a;
|
||||
|
||||
public:
|
||||
S2() : a(0) {}
|
||||
};
|
||||
const S2 b;
|
||||
const S2 ba[5];
|
||||
class S3 {
|
||||
int a;
|
||||
|
||||
public:
|
||||
S3() : a(0) {}
|
||||
};
|
||||
const S3 ca[5];
|
||||
class S4 {
|
||||
int a;
|
||||
S4(); // expected-note {{implicitly declared private here}}
|
||||
|
||||
public:
|
||||
S4(int v) : a(v) {}
|
||||
};
|
||||
class S5 {
|
||||
int a;
|
||||
S5() : a(0) {} // expected-note {{implicitly declared private here}}
|
||||
|
||||
public:
|
||||
S5(int v) : a(v) {}
|
||||
};
|
||||
|
||||
S3 h;
|
||||
#pragma omp threadprivate(h) // expected-note 2 {{defined as threadprivate or thread local}}
|
||||
|
||||
template <class I, class C>
|
||||
int foomain(I argc, C **argv) {
|
||||
I e(4);
|
||||
I g(5);
|
||||
int i;
|
||||
int &j = i;
|
||||
#pragma omp taskloop simd private // expected-error {{expected '(' after 'private'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private() // expected-error {{expected expression}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(argc)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(a, b) // expected-error {{private variable with incomplete type 'S1'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(argv[1]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(e, g)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(h) // expected-error {{threadprivate or thread local variable cannot be private}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd shared(i)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
{
|
||||
int v = 0;
|
||||
int i;
|
||||
#pragma omp taskloop simd private(i)
|
||||
for (int k = 0; k < argc; ++k) {
|
||||
i = k;
|
||||
v += i;
|
||||
}
|
||||
}
|
||||
#pragma omp parallel shared(i)
|
||||
#pragma omp parallel private(i)
|
||||
#pragma omp taskloop simd private(j)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(i)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
return 0;
|
||||
}
|
||||
|
||||
void bar(S4 a[2]) {
|
||||
#pragma omp parallel
|
||||
#pragma omp taskloop simd private(a)
|
||||
for (int i = 0; i < 2; ++i)
|
||||
foo();
|
||||
}
|
||||
|
||||
namespace A {
|
||||
double x;
|
||||
#pragma omp threadprivate(x) // expected-note {{defined as threadprivate or thread local}}
|
||||
}
|
||||
namespace B {
|
||||
using A::x;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
S4 e(4);
|
||||
S5 g(5);
|
||||
int i;
|
||||
int &j = i;
|
||||
#pragma omp taskloop simd private // expected-error {{expected '(' after 'private'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private() // expected-error {{expected expression}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(argc // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(argc)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(a, b) // expected-error {{private variable with incomplete type 'S1'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(argv[1]) // expected-error {{expected variable name}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(e, g) // expected-error {{calling a private constructor of class 'S4'}} expected-error {{calling a private constructor of class 'S5'}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(h) // expected-error {{threadprivate or thread local variable cannot be private}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(B::x) // expected-error {{threadprivate or thread local variable cannot be private}}
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd shared(i)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp parallel
|
||||
{
|
||||
int i;
|
||||
#pragma omp taskloop simd private(i)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
}
|
||||
#pragma omp parallel shared(i)
|
||||
#pragma omp parallel private(i)
|
||||
#pragma omp taskloop simd private(j)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
#pragma omp taskloop simd private(i)
|
||||
for (int k = 0; k < argc; ++k)
|
||||
++k;
|
||||
static int si;
|
||||
#pragma omp taskloop simd private(si) // OK
|
||||
for(int k = 0; k < argc; ++k)
|
||||
si = k + 1;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
|
@ -0,0 +1,79 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp %s
|
||||
|
||||
void foo() {
|
||||
}
|
||||
|
||||
bool foobool(int argc) {
|
||||
return argc;
|
||||
}
|
||||
|
||||
struct S1; // expected-note {{declared here}}
|
||||
|
||||
template <class T, typename S, int N, int ST> // expected-note {{declared here}}
|
||||
T tmain(T argc, S **argv) { //expected-note 2 {{declared here}}
|
||||
#pragma omp taskloop simd safelen // expected-error {{expected '(' after 'safelen'}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd safelen ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd safelen () // expected-error {{expected expression}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+3 {{expected ')'}} expected-note@+3 {{to match this '('}}
|
||||
// expected-error@+2 2 {{expression is not an integral constant expression}}
|
||||
// expected-note@+1 2 {{read of non-const variable 'argc' is not allowed in a constant expression}}
|
||||
#pragma omp taskloop simd safelen (argc
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+1 {{argument to 'safelen' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd safelen (ST // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd safelen (1)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd safelen ((ST > 0) ? 1 + ST : 2)
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+3 2 {{directive '#pragma omp taskloop simd' cannot contain more than one 'safelen' clause}}
|
||||
// expected-error@+2 2 {{argument to 'safelen' clause must be a strictly positive integer value}}
|
||||
// expected-error@+1 2 {{expression is not an integral constant expression}}
|
||||
#pragma omp taskloop simd safelen (foobool(argc)), safelen (true), safelen (-5)
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd safelen (S) // expected-error {{'S' does not refer to a value}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+1 2 {{expression is not an integral constant expression}}
|
||||
#pragma omp taskloop simd safelen (argv[1]=2) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd safelen (4)
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd safelen (N) // expected-error {{argument to 'safelen' clause must be a strictly positive integer value}}
|
||||
for (T i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
return argc;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
#pragma omp taskloop simd safelen // expected-error {{expected '(' after 'safelen'}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd safelen ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd safelen () // expected-error {{expected expression}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd safelen (4 // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd safelen (2+2)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd safelen (foobool(1) > 0 ? 1 : 2) // expected-error {{expression is not an integral constant expression}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
// expected-error@+3 {{expression is not an integral constant expression}}
|
||||
// expected-error@+2 2 {{directive '#pragma omp taskloop simd' cannot contain more than one 'safelen' clause}}
|
||||
// expected-error@+1 2 {{argument to 'safelen' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd safelen (foobool(argc)), safelen (true), safelen (-5)
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd safelen (S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
// expected-error@+1 {{expression is not an integral constant expression}}
|
||||
#pragma omp taskloop simd safelen (argv[1]=2) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
// expected-error@+3 {{statement after '#pragma omp taskloop simd' must be a for loop}}
|
||||
// expected-note@+1 {{in instantiation of function template specialization 'tmain<int, char, -1, -2>' requested here}}
|
||||
#pragma omp taskloop simd safelen(safelen(tmain<int, char, -1, -2>(argc, argv) // expected-error 2 {{expected ')'}} expected-note 2 {{to match this '('}}
|
||||
foo();
|
||||
// expected-note@+1 {{in instantiation of function template specialization 'tmain<int, char, 12, 4>' requested here}}
|
||||
return tmain<int, char, 12, 4>(argc, argv);
|
||||
}
|
||||
|
|
@ -0,0 +1,79 @@
|
|||
// RUN: %clang_cc1 -verify -fopenmp %s
|
||||
|
||||
void foo() {
|
||||
}
|
||||
|
||||
bool foobool(int argc) {
|
||||
return argc;
|
||||
}
|
||||
|
||||
struct S1; // expected-note {{declared here}}
|
||||
|
||||
template <class T, typename S, int N, int ST> // expected-note {{declared here}}
|
||||
T tmain(T argc, S **argv) { //expected-note 2 {{declared here}}
|
||||
#pragma omp taskloop simd simdlen // expected-error {{expected '(' after 'simdlen'}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd simdlen ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd simdlen () // expected-error {{expected expression}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+3 {{expected ')'}} expected-note@+3 {{to match this '('}}
|
||||
// expected-error@+2 2 {{expression is not an integral constant expression}}
|
||||
// expected-note@+1 2 {{read of non-const variable 'argc' is not allowed in a constant expression}}
|
||||
#pragma omp taskloop simd simdlen (argc
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+1 {{argument to 'simdlen' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd simdlen (ST // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd simdlen (1)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd simdlen ((ST > 0) ? 1 + ST : 2)
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+3 2 {{directive '#pragma omp taskloop simd' cannot contain more than one 'simdlen' clause}}
|
||||
// expected-error@+2 2 {{argument to 'simdlen' clause must be a strictly positive integer value}}
|
||||
// expected-error@+1 2 {{expression is not an integral constant expression}}
|
||||
#pragma omp taskloop simd simdlen (foobool(argc)), simdlen (true), simdlen (-5)
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd simdlen (S) // expected-error {{'S' does not refer to a value}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
// expected-error@+1 2 {{expression is not an integral constant expression}}
|
||||
#pragma omp taskloop simd simdlen (argv[1]=2) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd simdlen (4)
|
||||
for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
#pragma omp taskloop simd simdlen (N) // expected-error {{argument to 'simdlen' clause must be a strictly positive integer value}}
|
||||
for (T i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST];
|
||||
return argc;
|
||||
}
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
#pragma omp taskloop simd simdlen // expected-error {{expected '(' after 'simdlen'}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd simdlen ( // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd simdlen () // expected-error {{expected expression}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd simdlen (4 // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd simdlen (2+2)) // expected-warning {{extra tokens at the end of '#pragma omp taskloop simd' are ignored}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd simdlen (foobool(1) > 0 ? 1 : 2) // expected-error {{expression is not an integral constant expression}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
// expected-error@+3 {{expression is not an integral constant expression}}
|
||||
// expected-error@+2 2 {{directive '#pragma omp taskloop simd' cannot contain more than one 'simdlen' clause}}
|
||||
// expected-error@+1 2 {{argument to 'simdlen' clause must be a strictly positive integer value}}
|
||||
#pragma omp taskloop simd simdlen (foobool(argc)), simdlen (true), simdlen (-5)
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
#pragma omp taskloop simd simdlen (S1) // expected-error {{'S1' does not refer to a value}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
// expected-error@+1 {{expression is not an integral constant expression}}
|
||||
#pragma omp taskloop simd simdlen (argv[1]=2) // expected-error {{expected ')'}} expected-note {{to match this '('}}
|
||||
for (int i = 4; i < 12; i++) argv[0][i] = argv[0][i] - argv[0][i-4];
|
||||
// expected-error@+3 {{statement after '#pragma omp taskloop simd' must be a for loop}}
|
||||
// expected-note@+1 {{in instantiation of function template specialization 'tmain<int, char, -1, -2>' requested here}}
|
||||
#pragma omp taskloop simd simdlen(simdlen(tmain<int, char, -1, -2>(argc, argv) // expected-error 2 {{expected ')'}} expected-note 2 {{to match this '('}}
|
||||
foo();
|
||||
// expected-note@+1 {{in instantiation of function template specialization 'tmain<int, char, 12, 4>' requested here}}
|
||||
return tmain<int, char, 12, 4>(argc, argv);
|
||||
}
|
||||
|
|
@ -1943,6 +1943,7 @@ public:
|
|||
void VisitOMPTargetDataDirective(const OMPTargetDataDirective *D);
|
||||
void VisitOMPTeamsDirective(const OMPTeamsDirective *D);
|
||||
void VisitOMPTaskLoopDirective(const OMPTaskLoopDirective *D);
|
||||
void VisitOMPTaskLoopSimdDirective(const OMPTaskLoopSimdDirective *D);
|
||||
|
||||
private:
|
||||
void AddDeclarationNameInfo(const Stmt *S);
|
||||
|
@ -2616,6 +2617,11 @@ void EnqueueVisitor::VisitOMPTaskLoopDirective(const OMPTaskLoopDirective *D) {
|
|||
VisitOMPLoopDirective(D);
|
||||
}
|
||||
|
||||
void EnqueueVisitor::VisitOMPTaskLoopSimdDirective(
|
||||
const OMPTaskLoopSimdDirective *D) {
|
||||
VisitOMPLoopDirective(D);
|
||||
}
|
||||
|
||||
void CursorVisitor::EnqueueWorkList(VisitorWorkList &WL, const Stmt *S) {
|
||||
EnqueueVisitor(WL, MakeCXCursor(S, StmtParent, TU,RegionOfInterest)).Visit(S);
|
||||
}
|
||||
|
@ -4474,6 +4480,8 @@ CXString clang_getCursorKindSpelling(enum CXCursorKind Kind) {
|
|||
return cxstring::createRef("OMPCancelDirective");
|
||||
case CXCursor_OMPTaskLoopDirective:
|
||||
return cxstring::createRef("OMPTaskLoopDirective");
|
||||
case CXCursor_OMPTaskLoopSimdDirective:
|
||||
return cxstring::createRef("OMPTaskLoopSimdDirective");
|
||||
case CXCursor_OverloadCandidate:
|
||||
return cxstring::createRef("OverloadCandidate");
|
||||
case CXCursor_TypeAliasTemplateDecl:
|
||||
|
|
|
@ -610,6 +610,9 @@ CXCursor cxcursor::MakeCXCursor(const Stmt *S, const Decl *Parent,
|
|||
case Stmt::OMPTaskLoopDirectiveClass:
|
||||
K = CXCursor_OMPTaskLoopDirective;
|
||||
break;
|
||||
case Stmt::OMPTaskLoopSimdDirectiveClass:
|
||||
K = CXCursor_OMPTaskLoopSimdDirective;
|
||||
break;
|
||||
}
|
||||
|
||||
CXCursor C = { K, 0, { Parent, S, TU } };
|
||||
|
|
Loading…
Reference in New Issue