mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-18 02:56:37 +00:00

- when developing the RootSignatureLexer library, we are creating new files so we should set the standard to adhere to the coding conventions for function naming - this was missed in the initial review but caught in the review of the parser pr [here](https://github.com/llvm/llvm-project/pull/133302#discussion_r2017632092) Co-authored-by: Finn Plummer <finnplummer@microsoft.com>
188 lines
5.4 KiB
C++
188 lines
5.4 KiB
C++
//=== LexHLSLRootSignatureTest.cpp - Lex Root Signature tests -------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "clang/Lex/LexHLSLRootSignature.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
using namespace clang;
|
|
using TokenKind = hlsl::RootSignatureToken::Kind;
|
|
|
|
namespace {
|
|
|
|
// The test fixture.
|
|
class LexHLSLRootSignatureTest : public ::testing::Test {
|
|
protected:
|
|
LexHLSLRootSignatureTest() {}
|
|
|
|
void checkTokens(hlsl::RootSignatureLexer &Lexer,
|
|
SmallVector<hlsl::RootSignatureToken> &Computed,
|
|
SmallVector<TokenKind> &Expected) {
|
|
for (unsigned I = 0, E = Expected.size(); I != E; ++I) {
|
|
// Skip these to help with the macro generated test
|
|
if (Expected[I] == TokenKind::invalid ||
|
|
Expected[I] == TokenKind::end_of_stream)
|
|
continue;
|
|
hlsl::RootSignatureToken Result = Lexer.consumeToken();
|
|
ASSERT_EQ(Result.TokKind, Expected[I]);
|
|
Computed.push_back(Result);
|
|
}
|
|
hlsl::RootSignatureToken EndOfStream = Lexer.consumeToken();
|
|
ASSERT_EQ(EndOfStream.TokKind, TokenKind::end_of_stream);
|
|
ASSERT_TRUE(Lexer.isEndOfBuffer());
|
|
}
|
|
};
|
|
|
|
// Lexing Tests
|
|
|
|
TEST_F(LexHLSLRootSignatureTest, ValidLexNumbersTest) {
|
|
// This test will check that we can lex different number tokens
|
|
const llvm::StringLiteral Source = R"cc(
|
|
-42 42 +42 +2147483648
|
|
)cc";
|
|
|
|
auto TokLoc = SourceLocation();
|
|
|
|
hlsl::RootSignatureLexer Lexer(Source, TokLoc);
|
|
|
|
SmallVector<hlsl::RootSignatureToken> Tokens;
|
|
SmallVector<TokenKind> Expected = {
|
|
TokenKind::pu_minus, TokenKind::int_literal, TokenKind::int_literal,
|
|
TokenKind::pu_plus, TokenKind::int_literal, TokenKind::pu_plus,
|
|
TokenKind::int_literal,
|
|
};
|
|
checkTokens(Lexer, Tokens, Expected);
|
|
|
|
// Sample negative: int component
|
|
hlsl::RootSignatureToken IntToken = Tokens[1];
|
|
ASSERT_EQ(IntToken.NumSpelling, "42");
|
|
|
|
// Sample unsigned int
|
|
IntToken = Tokens[2];
|
|
ASSERT_EQ(IntToken.NumSpelling, "42");
|
|
|
|
// Sample positive: int component
|
|
IntToken = Tokens[4];
|
|
ASSERT_EQ(IntToken.NumSpelling, "42");
|
|
|
|
// Sample positive int that would overflow the signed representation but
|
|
// is treated as an unsigned integer instead
|
|
IntToken = Tokens[6];
|
|
ASSERT_EQ(IntToken.NumSpelling, "2147483648");
|
|
}
|
|
|
|
TEST_F(LexHLSLRootSignatureTest, ValidLexAllTokensTest) {
|
|
// This test will check that we can lex all defined tokens as defined in
|
|
// HLSLRootSignatureTokenKinds.def, plus some additional integer variations
|
|
const llvm::StringLiteral Source = R"cc(
|
|
42
|
|
|
|
b0 t43 u987 s234
|
|
|
|
(),|=+-
|
|
|
|
RootSignature
|
|
|
|
DescriptorTable
|
|
|
|
CBV SRV UAV Sampler
|
|
space visibility flags
|
|
numDescriptors offset
|
|
|
|
DESCRIPTOR_RANGE_OFFSET_APPEND
|
|
|
|
DATA_VOLATILE
|
|
DATA_STATIC_WHILE_SET_AT_EXECUTE
|
|
DATA_STATIC
|
|
DESCRIPTORS_VOLATILE
|
|
DESCRIPTORS_STATIC_KEEPING_BUFFER_BOUNDS_CHECKS
|
|
|
|
shader_visibility_all
|
|
shader_visibility_vertex
|
|
shader_visibility_hull
|
|
shader_visibility_domain
|
|
shader_visibility_geometry
|
|
shader_visibility_pixel
|
|
shader_visibility_amplification
|
|
shader_visibility_mesh
|
|
)cc";
|
|
auto TokLoc = SourceLocation();
|
|
hlsl::RootSignatureLexer Lexer(Source, TokLoc);
|
|
|
|
SmallVector<hlsl::RootSignatureToken> Tokens;
|
|
SmallVector<TokenKind> Expected = {
|
|
#define TOK(NAME, SPELLING) TokenKind::NAME,
|
|
#include "clang/Lex/HLSLRootSignatureTokenKinds.def"
|
|
};
|
|
|
|
checkTokens(Lexer, Tokens, Expected);
|
|
}
|
|
|
|
TEST_F(LexHLSLRootSignatureTest, ValidCaseInsensitiveKeywordsTest) {
|
|
// This test will check that we can lex keywords in an case-insensitive
|
|
// manner
|
|
const llvm::StringLiteral Source = R"cc(
|
|
DeScRiPtOrTaBlE
|
|
|
|
CBV srv UAV sampler
|
|
SPACE visibility FLAGS
|
|
numDescriptors OFFSET
|
|
)cc";
|
|
auto TokLoc = SourceLocation();
|
|
hlsl::RootSignatureLexer Lexer(Source, TokLoc);
|
|
|
|
SmallVector<hlsl::RootSignatureToken> Tokens;
|
|
SmallVector<TokenKind> Expected = {
|
|
TokenKind::kw_DescriptorTable,
|
|
TokenKind::kw_CBV,
|
|
TokenKind::kw_SRV,
|
|
TokenKind::kw_UAV,
|
|
TokenKind::kw_Sampler,
|
|
TokenKind::kw_space,
|
|
TokenKind::kw_visibility,
|
|
TokenKind::kw_flags,
|
|
TokenKind::kw_numDescriptors,
|
|
TokenKind::kw_offset,
|
|
};
|
|
|
|
checkTokens(Lexer, Tokens, Expected);
|
|
}
|
|
|
|
TEST_F(LexHLSLRootSignatureTest, ValidLexPeekTest) {
|
|
// This test will check that we the peek api is correctly used
|
|
const llvm::StringLiteral Source = R"cc(
|
|
)1
|
|
)cc";
|
|
auto TokLoc = SourceLocation();
|
|
hlsl::RootSignatureLexer Lexer(Source, TokLoc);
|
|
|
|
// Test basic peek
|
|
hlsl::RootSignatureToken Res = Lexer.peekNextToken();
|
|
ASSERT_EQ(Res.TokKind, TokenKind::pu_r_paren);
|
|
|
|
// Ensure it doesn't peek past one element
|
|
Res = Lexer.peekNextToken();
|
|
ASSERT_EQ(Res.TokKind, TokenKind::pu_r_paren);
|
|
|
|
Res = Lexer.consumeToken();
|
|
ASSERT_EQ(Res.TokKind, TokenKind::pu_r_paren);
|
|
|
|
// Invoke after reseting the NextToken
|
|
Res = Lexer.peekNextToken();
|
|
ASSERT_EQ(Res.TokKind, TokenKind::int_literal);
|
|
|
|
// Ensure we can still consume the second token
|
|
Res = Lexer.consumeToken();
|
|
ASSERT_EQ(Res.TokKind, TokenKind::int_literal);
|
|
|
|
// Ensure end of stream token
|
|
Res = Lexer.peekNextToken();
|
|
ASSERT_EQ(Res.TokKind, TokenKind::end_of_stream);
|
|
}
|
|
|
|
} // anonymous namespace
|