&& c_parser_peek_nth_token (parser, 4)->type == CPP_CLOSE_PAREN)
{
tree val = c_parser_peek_nth_token (parser, 3)->value;
- if (integer_onep (val)
- && comptypes (TREE_TYPE (val), integer_type_node))
+ if (integer_onep (val))
{
c_parser_consume_token (parser);
c_parser_consume_token (parser);
&& cp_lexer_nth_token_is (parser->lexer, 4, CPP_CLOSE_PAREN))
{
tree val = cp_lexer_peek_nth_token (parser->lexer, 3)->u.value;
- if (integer_onep (val)
- && same_type_p (TREE_TYPE (val), integer_type_node))
+ if (integer_onep (val))
{
cp_lexer_consume_token (parser->lexer);
cp_lexer_consume_token (parser->lexer);
#pragma omp for ordered
for (i = 0; i < 8; i += n)
{
- #pragma omp ordered doacross(sink:omp_cur_iteration - 1LL) /* { dg-error "'omp_cur_iteration' undeclared \\\(first use in this function\\\)" "" { target c } } */
- } /* { dg-error "'omp_cur_iteration' has not been declared" "" { target c++ } .-1 } */
+ #pragma omp ordered doacross(sink:omp_cur_iteration - 1)
+ }
+ #pragma omp for ordered
+ for (i = 0; i < 8; i += n)
+ {
+ #pragma omp ordered doacross(sink:omp_cur_iteration - 1LL)
+ }
+ #pragma omp for ordered
+ for (i = 0; i < 8; i += n)
+ {
+ #pragma omp ordered doacross(sink:omp_cur_iteration - 0x00001)
+ }
+ #pragma omp for ordered
+ for (i = 0; i < 8; i += n)
+ {
+ #pragma omp ordered doacross(sink:omp_cur_iteration - 001)
+ }
+ #pragma omp for ordered
+ for (i = 0; i < 8; i += n)
+ {
+ #pragma omp ordered doacross(sink:omp_cur_iteration - 1ULL)
+ }
}