Update parser to match * and & spec change.
The * and & operator grammar was updated in the spec to closer match other languages. This CL updates the Tint WGSL parser to match the current spec. Bug: tint:1756 Change-Id: I81b7c373bbd6a540b9273813c63a29487e2907ce Reviewed-on: https://dawn-review.googlesource.com/c/dawn/+/111580 Kokoro: Kokoro <noreply+kokoro@google.com> Commit-Queue: Dan Sinclair <dsinclair@chromium.org> Reviewed-by: Ben Clayton <bclayton@google.com>
This commit is contained in:
parent
d6800098e7
commit
b785dc1e39
|
@ -3227,47 +3227,46 @@ Maybe<const ast::Expression*> ParserImpl::core_lhs_expression() {
|
|||
}
|
||||
|
||||
// lhs_expression
|
||||
// : ( STAR | AND )* core_lhs_expression component_or_swizzle_specifier?
|
||||
// : core_lhs_expression component_or_swizzle_specifier ?
|
||||
// | AND lhs_expression
|
||||
// | STAR lhs_expression
|
||||
Maybe<const ast::Expression*> ParserImpl::lhs_expression() {
|
||||
std::vector<const Token*> prefixes;
|
||||
while (peek_is(Token::Type::kStar) || peek_is(Token::Type::kAnd) ||
|
||||
peek_is(Token::Type::kAndAnd)) {
|
||||
auto& t = next();
|
||||
|
||||
// If an '&&' is provided split into '&' and '&'
|
||||
if (t.Is(Token::Type::kAndAnd)) {
|
||||
split_token(Token::Type::kAnd, Token::Type::kAnd);
|
||||
}
|
||||
|
||||
prefixes.push_back(&t);
|
||||
}
|
||||
|
||||
auto core_expr = core_lhs_expression();
|
||||
if (core_expr.errored) {
|
||||
return Failure::kErrored;
|
||||
} else if (!core_expr.matched) {
|
||||
if (prefixes.empty()) {
|
||||
return Failure::kNoMatch;
|
||||
}
|
||||
if (core_expr.matched) {
|
||||
return component_or_swizzle_specifier(core_expr.value);
|
||||
}
|
||||
|
||||
auto check_lhs = [&](ast::UnaryOp op) -> Maybe<const ast::Expression*> {
|
||||
auto& t = peek();
|
||||
auto expr = lhs_expression();
|
||||
if (expr.errored) {
|
||||
return Failure::kErrored;
|
||||
}
|
||||
|
||||
return add_error(peek(), "missing expression");
|
||||
}
|
||||
|
||||
const auto* expr = core_expr.value;
|
||||
for (auto it = prefixes.rbegin(); it != prefixes.rend(); ++it) {
|
||||
auto& t = **it;
|
||||
ast::UnaryOp op = ast::UnaryOp::kAddressOf;
|
||||
if (t.Is(Token::Type::kStar)) {
|
||||
op = ast::UnaryOp::kIndirection;
|
||||
if (!expr.matched) {
|
||||
return add_error(t, "missing expression");
|
||||
}
|
||||
expr = create<ast::UnaryOpExpression>(t.source(), op, expr);
|
||||
return create<ast::UnaryOpExpression>(t.source(), op, expr.value);
|
||||
};
|
||||
|
||||
// If an `&&` is encountered, split it into two `&`'s
|
||||
if (match(Token::Type::kAndAnd)) {
|
||||
// The first `&` is consumed as part of the `&&`, so this needs to run the check itself.
|
||||
split_token(Token::Type::kAnd, Token::Type::kAnd);
|
||||
return check_lhs(ast::UnaryOp::kAddressOf);
|
||||
}
|
||||
|
||||
auto e = component_or_swizzle_specifier(expr);
|
||||
if (e.errored) {
|
||||
return Failure::kErrored;
|
||||
if (match(Token::Type::kAnd)) {
|
||||
return check_lhs(ast::UnaryOp::kAddressOf);
|
||||
}
|
||||
return e.value;
|
||||
|
||||
if (match(Token::Type::kStar)) {
|
||||
return check_lhs(ast::UnaryOp::kIndirection);
|
||||
}
|
||||
|
||||
return Failure::kNoMatch;
|
||||
}
|
||||
|
||||
// variable_updating_statement
|
||||
|
|
|
@ -100,6 +100,31 @@ TEST_F(ParserImplTest, LHSExpression_Multiple) {
|
|||
EXPECT_TRUE(expr->Is<ast::IdentifierExpression>());
|
||||
}
|
||||
|
||||
TEST_F(ParserImplTest, LHSExpression_PostfixExpression_Array) {
|
||||
auto p = parser("*a[0]");
|
||||
auto e = p->lhs_expression();
|
||||
ASSERT_FALSE(p->has_error()) << p->error();
|
||||
ASSERT_FALSE(e.errored);
|
||||
EXPECT_TRUE(e.matched);
|
||||
ASSERT_NE(e.value, nullptr);
|
||||
ASSERT_TRUE(e->Is<ast::UnaryOpExpression>());
|
||||
|
||||
auto* u = e->As<ast::UnaryOpExpression>();
|
||||
EXPECT_EQ(u->op, ast::UnaryOp::kIndirection);
|
||||
|
||||
ASSERT_TRUE(u->expr->Is<ast::IndexAccessorExpression>());
|
||||
|
||||
auto* access = u->expr->As<ast::IndexAccessorExpression>();
|
||||
ASSERT_TRUE(access->object->Is<ast::IdentifierExpression>());
|
||||
|
||||
auto* obj = access->object->As<ast::IdentifierExpression>();
|
||||
EXPECT_EQ(obj->symbol, p->builder().Symbols().Get("a"));
|
||||
|
||||
ASSERT_TRUE(access->index->Is<ast::IntLiteralExpression>());
|
||||
auto* idx = access->index->As<ast::IntLiteralExpression>();
|
||||
EXPECT_EQ(0, idx->value);
|
||||
}
|
||||
|
||||
TEST_F(ParserImplTest, LHSExpression_PostfixExpression) {
|
||||
auto p = parser("*a.foo");
|
||||
auto e = p->lhs_expression();
|
||||
|
@ -107,16 +132,17 @@ TEST_F(ParserImplTest, LHSExpression_PostfixExpression) {
|
|||
ASSERT_FALSE(e.errored);
|
||||
EXPECT_TRUE(e.matched);
|
||||
ASSERT_NE(e.value, nullptr);
|
||||
ASSERT_TRUE(e->Is<ast::MemberAccessorExpression>());
|
||||
ASSERT_TRUE(e->Is<ast::UnaryOpExpression>());
|
||||
|
||||
auto* access = e->As<ast::MemberAccessorExpression>();
|
||||
ASSERT_TRUE(access->structure->Is<ast::UnaryOpExpression>());
|
||||
|
||||
auto* u = access->structure->As<ast::UnaryOpExpression>();
|
||||
auto* u = e->As<ast::UnaryOpExpression>();
|
||||
EXPECT_EQ(u->op, ast::UnaryOp::kIndirection);
|
||||
|
||||
ASSERT_TRUE(u->expr->Is<ast::IdentifierExpression>());
|
||||
auto* struct_ident = u->expr->As<ast::IdentifierExpression>();
|
||||
ASSERT_TRUE(u->expr->Is<ast::MemberAccessorExpression>());
|
||||
|
||||
auto* access = u->expr->As<ast::MemberAccessorExpression>();
|
||||
ASSERT_TRUE(access->structure->Is<ast::IdentifierExpression>());
|
||||
|
||||
auto* struct_ident = access->structure->As<ast::IdentifierExpression>();
|
||||
EXPECT_EQ(struct_ident->symbol, p->builder().Symbols().Get("a"));
|
||||
|
||||
ASSERT_TRUE(access->member->Is<ast::IdentifierExpression>());
|
||||
|
|
|
@ -1298,6 +1298,23 @@ TEST_F(ResolverTest, U32_Overflow) {
|
|||
EXPECT_EQ(r()->error(), "12:24 error: value 4294967296 cannot be represented as 'u32'");
|
||||
}
|
||||
|
||||
// var a: array<i32,2>;
|
||||
// *&a[0] = 1;
|
||||
TEST_F(ResolverTest, PointerIndexing_Fail) {
|
||||
// var a: array<i32,2>;
|
||||
// let p = &a;
|
||||
// *p[0] = 0;
|
||||
|
||||
auto* a = Var("a", ty.array<i32, 2>());
|
||||
auto* p = AddressOf("a");
|
||||
auto* idx = Assign(Deref(IndexAccessor(p, 0_u)), 0_u);
|
||||
|
||||
WrapInFunction(a, idx);
|
||||
|
||||
EXPECT_FALSE(r()->Resolve());
|
||||
EXPECT_EQ(r()->error(), "error: cannot index type 'ptr<function, array<i32, 2>, read_write>'");
|
||||
}
|
||||
|
||||
} // namespace
|
||||
} // namespace tint::resolver
|
||||
|
||||
|
|
Loading…
Reference in New Issue