2015-05-20 12:24:19 +08:00
// RUN: %clang_cc1 -verify -fopenmp -ferror-limit 150 -o - %s
2015-11-18 04:25:05 +08:00
// RUN: %clang_cc1 -verify -fopenmp -std=c++98 -ferror-limit 150 -o - %s
// RUN: %clang_cc1 -verify -fopenmp -std=c++11 -ferror-limit 150 -o - %s
2014-06-18 12:14:57 +08:00
void foo ( ) {
}
bool foobool ( int argc ) {
return argc ;
}
struct S1 ; // expected-note {{declared here}} expected-note 4 {{forward declaration of 'S1'}}
extern S1 a ;
class S2 {
mutable int a ;
2016-03-17 18:19:46 +08:00
S2 & operator + ( const S2 & arg ) { return ( * this ) ; } // expected-note 3 {{implicitly declared private here}}
2014-06-18 12:14:57 +08:00
public :
S2 ( ) : a ( 0 ) { }
S2 ( S2 & s2 ) : a ( s2 . a ) { }
2014-06-19 17:13:45 +08:00
static float S2s ; // expected-note 2 {{static data member is predetermined as shared}}
2014-06-18 12:14:57 +08:00
static const float S2sc ;
} ;
const float S2 : : S2sc = 0 ; // expected-note 2 {{'S2sc' defined here}}
2016-03-17 18:19:46 +08:00
S2 b ; // expected-note 3 {{'b' defined here}}
2014-06-18 12:14:57 +08:00
const S2 ba [ 5 ] ; // expected-note 2 {{'ba' defined here}}
class S3 {
int a ;
public :
S3 ( ) : a ( 0 ) { }
S3 ( const S3 & s3 ) : a ( s3 . a ) { }
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
S3 operator + ( const S3 & arg1 ) { return arg1 ; }
2014-06-18 12:14:57 +08:00
} ;
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
int operator + ( const S3 & arg1 , const S3 & arg2 ) { return 5 ; }
2016-03-17 18:19:46 +08:00
S3 c ; // expected-note 3 {{'c' defined here}}
2014-06-18 12:14:57 +08:00
const S3 ca [ 5 ] ; // expected-note 2 {{'ca' defined here}}
extern const int f ; // expected-note 4 {{'f' declared here}}
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
class S4 {
2014-06-18 12:14:57 +08:00
int a ;
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
S4 ( ) ; // expected-note {{implicitly declared private here}}
2014-06-18 12:14:57 +08:00
S4 ( const S4 & s4 ) ;
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
S4 & operator + ( const S4 & arg ) { return ( * this ) ; }
2014-06-18 12:14:57 +08:00
public :
S4 ( int v ) : a ( v ) { }
} ;
S4 & operator & = ( S4 & arg1 , S4 & arg2 ) { return arg1 ; }
class S5 {
int a ;
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
S5 ( ) : a ( 0 ) { } // expected-note {{implicitly declared private here}}
2014-06-18 12:14:57 +08:00
S5 ( const S5 & s5 ) : a ( s5 . a ) { }
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
S5 & operator + ( const S5 & arg ) ;
2014-06-18 12:14:57 +08:00
public :
S5 ( int v ) : a ( v ) { }
} ;
2016-03-17 18:19:46 +08:00
class S6 { // expected-note 3 {{candidate function (the implicit copy assignment operator) not viable: no known conversion from 'int' to 'const S6' for 1st argument}}
2015-11-18 04:25:05 +08:00
# if __cplusplus >= 201103L // C++11 or later
2016-03-17 18:19:46 +08:00
// expected-note@-2 3 {{candidate function (the implicit move assignment operator) not viable: no known conversion from 'int' to 'S6' for 1st argument}}
2015-11-18 04:25:05 +08:00
# endif
2014-06-18 12:14:57 +08:00
int a ;
public :
S6 ( ) : a ( 6 ) { }
operator int ( ) { return 6 ; }
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
} o ;
2014-06-18 12:14:57 +08:00
S3 h , k ;
# pragma omp threadprivate(h) // expected-note 2 {{defined as threadprivate or thread local}}
2015-10-08 17:10:53 +08:00
char * get ( ) ;
2014-06-18 12:14:57 +08:00
template < class T > // expected-note {{declared here}}
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
T tmain ( T argc ) {
2014-06-18 12:14:57 +08:00
const T d = T ( ) ; // expected-note 4 {{'d' defined here}}
const T da [ 5 ] = { T ( ) } ; // expected-note 2 {{'da' defined here}}
T qa [ 5 ] = { T ( ) } ;
T i ;
T & j = i ; // expected-note 4 {{'j' defined here}}
S3 & p = k ; // expected-note 2 {{'p' defined here}}
const T & r = da [ ( int ) i ] ; // expected-note 2 {{'r' defined here}}
T & q = qa [ ( int ) i ] ; // expected-note 2 {{'q' defined here}}
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
T fl ;
2014-06-18 12:14:57 +08:00
# pragma omp parallel
# pragma omp for reduction // expected-error {{expected '(' after 'reduction'}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction + // expected-error {{expected '(' after 'reduction'}} expected-warning {{extra tokens at the end of '#pragma omp for' are ignored}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction( // expected-error {{expected unqualified-id}} expected-warning {{missing ':' after reduction identifier - ignoring}} expected-error {{expected ')'}} expected-note {{to match this '('}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(- // expected-warning {{missing ':' after reduction identifier - ignoring}} expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction() // expected-error {{expected unqualified-id}} expected-warning {{missing ':' after reduction identifier - ignoring}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(*) // expected-warning {{missing ':' after reduction identifier - ignoring}} expected-error {{expected expression}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(\) // expected-error {{expected unqualified-id}} expected-warning {{missing ':' after reduction identifier - ignoring}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
# pragma omp for reduction(& : argc // expected-error {{expected ')'}} expected-note {{to match this '('}} expected-error {{invalid operands to binary expression ('float' and 'float')}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-04-01 16:43:42 +08:00
# pragma omp for reduction(| : argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}} expected-error {{invalid operands to binary expression ('float' and 'float')}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(|| : argc ? i : argc) // expected-error 2 {{expected variable name}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-03-17 18:19:46 +08:00
# pragma omp for reduction(foo : argc) // expected-error {{incorrect reduction identifier, expected one of '+', '-', '*', '&', '|', '^', '&&', '||', 'min' or 'max' or declare reduction for type 'float'}} expected-error {{incorrect reduction identifier, expected one of '+', '-', '*', '&', '|', '^', '&&', '||', 'min' or 'max' or declare reduction for type 'int'}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(&& : argc)
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(^ : T) // expected-error {{'T' does not refer to a value}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-03-17 18:19:46 +08:00
# pragma omp for reduction(+ : a, b, c, d, f) // expected-error {{a reduction list item with incomplete type 'S1'}} expected-error 3 {{const-qualified list item cannot be reduction}} expected-error 2 {{'operator+' is a private member of 'S2'}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-03-17 18:19:46 +08:00
# pragma omp for reduction(min : a, b, c, d, f) // expected-error {{a reduction list item with incomplete type 'S1'}} expected-error 4 {{arguments of OpenMP clause 'reduction' for 'min' or 'max' must be of arithmetic type}} expected-error 3 {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2015-09-30 17:22:36 +08:00
# pragma omp for reduction(max : qa[1])
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-01-26 20:20:39 +08:00
# pragma omp for reduction(+ : ba) // expected-error {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-01-26 20:20:39 +08:00
# pragma omp for reduction(* : ca) // expected-error {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-01-26 20:20:39 +08:00
# pragma omp for reduction(- : da) // expected-error {{const-qualified list item cannot be reduction}} expected-error {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
# pragma omp for reduction(^ : fl) // expected-error {{invalid operands to binary expression ('float' and 'float')}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(&& : S2::S2s) // expected-error {{shared variable cannot be reduction}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2015-09-30 17:22:36 +08:00
# pragma omp for reduction(&& : S2::S2sc) // expected-error {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(+ : h, k) // expected-error {{threadprivate or thread local variable cannot be reduction}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-03-17 18:19:46 +08:00
# pragma omp for reduction(+ : o) // expected-error 2 {{no viable overloaded '='}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for private(i), reduction(+ : j), reduction(+ : q) // expected-error 4 {{argument of OpenMP clause 'reduction' must reference the same object in all threads}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel private(k)
# pragma omp for reduction(+ : p), reduction(+ : p) // expected-error 2 {{argument of OpenMP clause 'reduction' must reference the same object in all threads}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-03-17 18:19:46 +08:00
# pragma omp for reduction(+ : p), reduction(+ : p) // expected-error 2 {{variable can appear only once in OpenMP 'reduction' clause}} expected-note 2 {{previously referenced here}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2015-09-30 17:22:36 +08:00
# pragma omp for reduction(+ : r) // expected-error 2 {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel shared(i)
# pragma omp parallel reduction(min : i)
# pragma omp for reduction(max : j) // expected-error 2 {{argument of OpenMP clause 'reduction' must reference the same object in all threads}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel private(fl) // expected-note 2 {{defined as private}}
# pragma omp for reduction(+ : fl) // expected-error 2 {{reduction variable must be shared}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
2015-10-08 17:10:53 +08:00
# pragma omp parallel private(qa) // expected-note 2 {{defined as private}}
# pragma omp for reduction(+ : qa[1], get()[0]) // expected-error 2 {{reduction variable must be shared}} expected-error {{expected variable name as a base of the array subscript}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel shared(qa)
# pragma omp for reduction(+ : qa[1], qa[0]) // expected-error 2 {{variable can appear only once in OpenMP 'reduction' clause}} expected-note 2 {{previously referenced here}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
2014-06-18 12:14:57 +08:00
# pragma omp parallel reduction(* : fl) // expected-note 2 {{defined as reduction}}
# pragma omp for reduction(+ : fl) // expected-error 2 {{reduction variable must be shared}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
return T ( ) ;
}
2015-04-16 21:49:42 +08:00
namespace A {
double x ;
# pragma omp threadprivate(x) // expected-note {{defined as threadprivate or thread local}}
}
namespace B {
using A : : x ;
}
2014-06-18 12:14:57 +08:00
int main ( int argc , char * * argv ) {
const int d = 5 ; // expected-note 2 {{'d' defined here}}
const int da [ 5 ] = { 0 } ; // expected-note {{'da' defined here}}
int qa [ 5 ] = { 0 } ;
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
S4 e ( 4 ) ;
S5 g ( 5 ) ;
2014-06-18 12:14:57 +08:00
int i ;
int & j = i ; // expected-note 2 {{'j' defined here}}
S3 & p = k ; // expected-note 2 {{'p' defined here}}
const int & r = da [ i ] ; // expected-note {{'r' defined here}}
int & q = qa [ i ] ; // expected-note {{'q' defined here}}
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
float fl ;
2014-06-18 12:14:57 +08:00
# pragma omp parallel
# pragma omp for reduction // expected-error {{expected '(' after 'reduction'}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction + // expected-error {{expected '(' after 'reduction'}} expected-warning {{extra tokens at the end of '#pragma omp for' are ignored}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction( // expected-error {{expected unqualified-id}} expected-warning {{missing ':' after reduction identifier - ignoring}} expected-error {{expected ')'}} expected-note {{to match this '('}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(- // expected-warning {{missing ':' after reduction identifier - ignoring}} expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction() // expected-error {{expected unqualified-id}} expected-warning {{missing ':' after reduction identifier - ignoring}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(*) // expected-warning {{missing ':' after reduction identifier - ignoring}} expected-error {{expected expression}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(\) // expected-error {{expected unqualified-id}} expected-warning {{missing ':' after reduction identifier - ignoring}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(foo : argc // expected-error {{expected ')'}} expected-note {{to match this '('}} expected-error {{incorrect reduction identifier, expected one of '+', '-', '*', '&', '|', '^', '&&', '||', 'min' or 'max'}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-04-01 16:43:42 +08:00
# pragma omp for reduction(| : argc, // expected-error {{expected expression}} expected-error {{expected ')'}} expected-note {{to match this '('}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(|| : argc > 0 ? argv[1] : argv[2]) // expected-error {{expected variable name}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(~ : argc) // expected-error {{expected unqualified-id}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(&& : argc)
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(^ : S1) // expected-error {{'S1' does not refer to a value}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2015-09-30 17:22:36 +08:00
# pragma omp for reduction(+ : a, b, c, d, f) // expected-error {{a reduction list item with incomplete type 'S1'}} expected-error 2 {{const-qualified list item cannot be reduction}} expected-error {{'operator+' is a private member of 'S2'}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2015-09-30 17:22:36 +08:00
# pragma omp for reduction(min : a, b, c, d, f) // expected-error {{a reduction list item with incomplete type 'S1'}} expected-error 2 {{arguments of OpenMP clause 'reduction' for 'min' or 'max' must be of arithmetic type}} expected-error 2 {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2015-09-30 17:22:36 +08:00
# pragma omp for reduction(max : argv[1])
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-01-26 20:20:39 +08:00
# pragma omp for reduction(+ : ba) // expected-error {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-01-26 20:20:39 +08:00
# pragma omp for reduction(* : ca) // expected-error {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2016-01-26 20:20:39 +08:00
# pragma omp for reduction(- : da) // expected-error {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
# pragma omp for reduction(^ : fl) // expected-error {{invalid operands to binary expression ('float' and 'float')}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(&& : S2::S2s) // expected-error {{shared variable cannot be reduction}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2015-09-30 17:22:36 +08:00
# pragma omp for reduction(&& : S2::S2sc) // expected-error {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
# pragma omp for reduction(& : e, g) // expected-error {{calling a private constructor of class 'S4'}} expected-error {{calling a private constructor of class 'S5'}} expected-error {{invalid operands to binary expression ('S4' and 'S4')}} expected-error {{invalid operands to binary expression ('S5' and 'S5')}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(+ : h, k) // expected-error {{threadprivate or thread local variable cannot be reduction}}
2015-04-16 21:49:42 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(+ : B::x, k) // expected-error {{threadprivate or thread local variable cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
[OPENMP] Codegen for 'reduction' clause in 'parallel' directive.
Emit a code for reduction clause. Next code should be emitted for reductions:
static kmp_critical_name lock = { 0 };
void reduce_func(void *lhs[<n>], void *rhs[<n>]) {
...
*(Type<i> *)lhs[i] = RedOp<i>(*(Type<i> *)lhs[i], *(Type<i> *)rhs[i]);
...
}
... void *RedList[<n>] = {&<RHSExprs>[0], ..., &<RHSExprs>[<n> - 1]};
switch (__kmpc_reduce{_nowait}(<loc>, <gtid>, <n>, sizeof(RedList), RedList, reduce_func, &<lock>)) {
case 1:
...
<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]);
...
__kmpc_end_reduce{_nowait}(<loc>, <gtid>, &<lock>);
break;
case 2:
...
Atomic(<LHSExprs>[i] = RedOp<i>(*<LHSExprs>[i], *<RHSExprs>[i]));
...
break;
default:
;
}
Reduction variables are a kind of a private variables, they have private copies, but initial values are chosen in accordance with the reduction operation.
Differential Revision: http://reviews.llvm.org/D8915
llvm-svn: 234583
2015-04-10 18:43:45 +08:00
# pragma omp for reduction(+ : o) // expected-error {{no viable overloaded '='}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for private(i), reduction(+ : j), reduction(+ : q) // expected-error 2 {{argument of OpenMP clause 'reduction' must reference the same object in all threads}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel private(k)
# pragma omp for reduction(+ : p), reduction(+ : p) // expected-error 2 {{argument of OpenMP clause 'reduction' must reference the same object in all threads}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
# pragma omp for reduction(+ : p), reduction(+ : p) // expected-error {{variable can appear only once in OpenMP 'reduction' clause}} expected-note {{previously referenced here}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel
2015-09-30 17:22:36 +08:00
# pragma omp for reduction(+ : r) // expected-error {{const-qualified list item cannot be reduction}}
2014-06-18 12:14:57 +08:00
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel shared(i)
# pragma omp parallel reduction(min : i)
# pragma omp for reduction(max : j) // expected-error {{argument of OpenMP clause 'reduction' must reference the same object in all threads}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel private(fl) // expected-note {{defined as private}}
# pragma omp for reduction(+ : fl) // expected-error {{reduction variable must be shared}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
2015-10-08 17:10:53 +08:00
# pragma omp parallel private(argv) // expected-note {{defined as private}}
# pragma omp for reduction(+ : argv[1], get()[0]) // expected-error {{reduction variable must be shared}} expected-error {{expected variable name as a base of the array subscript}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
# pragma omp parallel shared(qa)
# pragma omp for reduction(+ : qa[1], qa[0]) // expected-error {{variable can appear only once in OpenMP 'reduction' clause}} expected-note {{previously referenced here}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
2014-06-18 12:14:57 +08:00
# pragma omp parallel reduction(* : fl) // expected-note {{defined as reduction}}
# pragma omp for reduction(+ : fl) // expected-error {{reduction variable must be shared}}
for ( int i = 0 ; i < 10 ; + + i )
foo ( ) ;
2015-09-16 02:56:58 +08:00
static int m = 0 ;
# pragma omp for reduction(+:m)
for ( int i = 0 ; i < 10 ; + + i )
m + + ;
2014-06-18 12:14:57 +08:00
return tmain ( argc ) + tmain ( fl ) ; // expected-note {{in instantiation of function template specialization 'tmain<int>' requested here}} expected-note {{in instantiation of function template specialization 'tmain<float>' requested here}}
}