mirror of
https://github.com/encounter/dawn-cmake.git
synced 2025-05-14 19:31:25 +00:00
In order to remove the kMaxBindingsPerGroup limit in Dawn, some static ityp::arrays need to be made dynamically sized. This CL adds ityp::vector wrapping std::vector. This CL also fixes the assumption that ityp::stack_vec iterators are pointers Bug: dawn:442, dawn:443 Change-Id: I8698cbba3ea80ac063ab918a77f223c527720d08 Reviewed-on: https://dawn-review.googlesource.com/c/dawn/+/24480 Commit-Queue: Austin Eng <enga@chromium.org> Reviewed-by: Stephen White <senorblanco@chromium.org>
185 lines
5.0 KiB
C++
185 lines
5.0 KiB
C++
// Copyright 2020 The Dawn Authors
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WvecANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
#include "common/TypedInteger.h"
|
|
#include "common/ityp_vector.h"
|
|
|
|
class ITypVectorTest : public testing::Test {
|
|
protected:
|
|
using Key = TypedInteger<struct KeyT, uint32_t>;
|
|
using Val = TypedInteger<struct ValT, uint32_t>;
|
|
|
|
using Vector = ityp::vector<Key, Val>;
|
|
};
|
|
|
|
// Test creation and initialization of the vector.
|
|
TEST_F(ITypVectorTest, Creation) {
|
|
// Default constructor initializes to 0
|
|
{
|
|
Vector vec;
|
|
ASSERT_EQ(vec.size(), Key(0));
|
|
}
|
|
|
|
// Size constructor initializes contents to 0
|
|
{
|
|
Vector vec(Key(10));
|
|
ASSERT_EQ(vec.size(), Key(10));
|
|
|
|
for (Key i(0); i < Key(10); ++i) {
|
|
ASSERT_EQ(vec[i], Val(0));
|
|
}
|
|
}
|
|
|
|
// Size and initial value constructor initializes contents to the inital value
|
|
{
|
|
Vector vec(Key(10), Val(7));
|
|
ASSERT_EQ(vec.size(), Key(10));
|
|
|
|
for (Key i(0); i < Key(10); ++i) {
|
|
ASSERT_EQ(vec[i], Val(7));
|
|
}
|
|
}
|
|
|
|
// Initializer list constructor
|
|
{
|
|
Vector vec = {Val(2), Val(8), Val(1)};
|
|
ASSERT_EQ(vec.size(), Key(3));
|
|
ASSERT_EQ(vec[Key(0)], Val(2));
|
|
ASSERT_EQ(vec[Key(1)], Val(8));
|
|
ASSERT_EQ(vec[Key(2)], Val(1));
|
|
}
|
|
}
|
|
|
|
// Test copy construction/assignment
|
|
TEST_F(ITypVectorTest, CopyConstructAssign) {
|
|
// Test the copy constructor
|
|
{
|
|
Vector rhs = {Val(2), Val(8), Val(1)};
|
|
|
|
Vector vec(rhs);
|
|
ASSERT_EQ(vec.size(), Key(3));
|
|
ASSERT_EQ(vec[Key(0)], Val(2));
|
|
ASSERT_EQ(vec[Key(1)], Val(8));
|
|
ASSERT_EQ(vec[Key(2)], Val(1));
|
|
|
|
ASSERT_EQ(rhs.size(), Key(3));
|
|
ASSERT_EQ(rhs[Key(0)], Val(2));
|
|
ASSERT_EQ(rhs[Key(1)], Val(8));
|
|
ASSERT_EQ(rhs[Key(2)], Val(1));
|
|
}
|
|
|
|
// Test the copy assignment
|
|
{
|
|
Vector rhs = {Val(2), Val(8), Val(1)};
|
|
|
|
Vector vec = rhs;
|
|
ASSERT_EQ(vec.size(), Key(3));
|
|
ASSERT_EQ(vec[Key(0)], Val(2));
|
|
ASSERT_EQ(vec[Key(1)], Val(8));
|
|
ASSERT_EQ(vec[Key(2)], Val(1));
|
|
|
|
ASSERT_EQ(rhs.size(), Key(3));
|
|
ASSERT_EQ(rhs[Key(0)], Val(2));
|
|
ASSERT_EQ(rhs[Key(1)], Val(8));
|
|
ASSERT_EQ(rhs[Key(2)], Val(1));
|
|
}
|
|
}
|
|
|
|
// Test move construction/assignment
|
|
TEST_F(ITypVectorTest, MoveConstructAssign) {
|
|
// Test the move constructor
|
|
{
|
|
Vector rhs = {Val(2), Val(8), Val(1)};
|
|
|
|
Vector vec(std::move(rhs));
|
|
ASSERT_EQ(vec.size(), Key(3));
|
|
ASSERT_EQ(vec[Key(0)], Val(2));
|
|
ASSERT_EQ(vec[Key(1)], Val(8));
|
|
ASSERT_EQ(vec[Key(2)], Val(1));
|
|
|
|
ASSERT_EQ(rhs.size(), Key(0));
|
|
}
|
|
|
|
// Test the move assignment
|
|
{
|
|
Vector rhs = {Val(2), Val(8), Val(1)};
|
|
|
|
Vector vec = std::move(rhs);
|
|
ASSERT_EQ(vec.size(), Key(3));
|
|
ASSERT_EQ(vec[Key(0)], Val(2));
|
|
ASSERT_EQ(vec[Key(1)], Val(8));
|
|
ASSERT_EQ(vec[Key(2)], Val(1));
|
|
|
|
ASSERT_EQ(rhs.size(), Key(0));
|
|
}
|
|
}
|
|
|
|
// Test that values can be set at an index and retrieved from the same index.
|
|
TEST_F(ITypVectorTest, Indexing) {
|
|
Vector vec(Key(10));
|
|
{
|
|
vec[Key(2)] = Val(5);
|
|
vec[Key(1)] = Val(9);
|
|
vec[Key(9)] = Val(2);
|
|
|
|
ASSERT_EQ(vec[Key(2)], Val(5));
|
|
ASSERT_EQ(vec[Key(1)], Val(9));
|
|
ASSERT_EQ(vec[Key(9)], Val(2));
|
|
}
|
|
{
|
|
vec.at(Key(4)) = Val(5);
|
|
vec.at(Key(3)) = Val(8);
|
|
vec.at(Key(1)) = Val(7);
|
|
|
|
ASSERT_EQ(vec.at(Key(4)), Val(5));
|
|
ASSERT_EQ(vec.at(Key(3)), Val(8));
|
|
ASSERT_EQ(vec.at(Key(1)), Val(7));
|
|
}
|
|
}
|
|
|
|
// Test that the vector can be iterated in order with a range-based for loop
|
|
TEST_F(ITypVectorTest, RangeBasedIteration) {
|
|
Vector vec(Key(10));
|
|
|
|
// Assign in a non-const range-based for loop
|
|
uint32_t i = 0;
|
|
for (Val& val : vec) {
|
|
val = Val(i);
|
|
}
|
|
|
|
// Check values in a const range-based for loop
|
|
i = 0;
|
|
for (Val val : static_cast<const Vector&>(vec)) {
|
|
ASSERT_EQ(val, vec[Key(i++)]);
|
|
}
|
|
}
|
|
|
|
// Test that begin/end/front/back/data return pointers/references to the correct elements.
|
|
TEST_F(ITypVectorTest, BeginEndFrontBackData) {
|
|
Vector vec(Key(10));
|
|
|
|
// non-const versions
|
|
ASSERT_EQ(&vec.front(), &vec[Key(0)]);
|
|
ASSERT_EQ(&vec.back(), &vec[Key(9)]);
|
|
ASSERT_EQ(vec.data(), &vec[Key(0)]);
|
|
|
|
// const versions
|
|
const Vector& constVec = vec;
|
|
ASSERT_EQ(&constVec.front(), &constVec[Key(0)]);
|
|
ASSERT_EQ(&constVec.back(), &constVec[Key(9)]);
|
|
ASSERT_EQ(constVec.data(), &constVec[Key(0)]);
|
|
}
|