chromium/third_party/dawn/src/dawn/tests/unittests/ContentLessObjectCacheTests.cpp

// Copyright 2023 The Dawn & Tint Authors
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this
//    list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright notice,
//    this list of conditions and the following disclaimer in the documentation
//    and/or other materials provided with the distribution.
//
// 3. Neither the name of the copyright holder nor the names of its
//    contributors may be used to endorse or promote products derived from
//    this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
// OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

#include <condition_variable>
#include <functional>
#include <mutex>
#include <string>
#include <thread>
#include <vector>

#include "dawn/common/ContentLessObjectCache.h"
#include "dawn/utils/BinarySemaphore.h"
#include "gtest/gtest.h"

namespace dawn {
namespace {

BinarySemaphore;

class CacheableT : public RefCounted, public ContentLessObjectCacheable<CacheableT> { … };

// Empty cache returns true on Empty().
TEST(ContentLessObjectCacheTest, Empty) { … }

// Non-empty cache returns false on Empty().
TEST(ContentLessObjectCacheTest, NonEmpty) { … }

// Object inserted into the cache are findable.
TEST(ContentLessObjectCacheTest, Insert) { … }

// Duplicate insert calls on different equivalent objects only inserts the first.
TEST(ContentLessObjectCacheTest, InsertDuplicate) { … }

// Duplicate insert calls on different objects with the same hash inserts both objects.
TEST(ContentLessObjectCacheTest, InsertHashDuplicate) { … }

// Erasing the only entry leaves the cache empty.
TEST(ContentLessObjectCacheTest, Erase) { … }

// Erasing an equivalent but not pointer equivalent entry is a no-op.
TEST(ContentLessObjectCacheTest, EraseDuplicate) { … }

// Inserting and finding elements should respect the results from the insert call.
TEST(ContentLessObjectCacheTest, InsertingAndFinding) { … }

// Finding an element that is in the process of deletion should return nullptr.
TEST(ContentLessObjectCacheTest, FindDeleting) { … }

// Finding an equivalent element when the cached version is in the process of deletion and the
// last ref of the object is actually the one acquired inside the find operation does not deadlock
// and returns the cached value. This is a regression test for dawn:1993.
TEST(ContentLessObjectCacheTest, FindDeletingLastRef) { … }

// Finding a non-equivalent but hash equivalent element when the cached version is in the process
// of deletion and the last ref of the object is actually the one acquired inside the find operation
// does not deadlock and returns nullptr. This is a regression test for dawn:1993.
TEST(ContentLessObjectCacheTest, FindDeletingLastRefHashEquivalent) { … }

// Inserting an element that has an entry which is in process of deletion should insert the new
// object.
TEST(ContentLessObjectCacheTest, InsertDeleting) { … }

// Inserting an equivalent element when the cached version is in the process of deletion and the
// last ref of the object is actually the one acquired inside the find operation does not deadlock
// and no insert happens. This is a regression test for dawn:1993.
TEST(ContentLessObjectCacheTest, InsertDeletingLastRef) { … }

// Inserting a non-equivalent but hash equivalent element when the cached version is in the process
// of deletion and the last ref of the object is actually the one acquired inside the find operation
// does not deadlock and the insert occurs successfully. This is a regression test for dawn:1993.
TEST(ContentLessObjectCacheTest, InsertDeletingLastRefHashEquivalent) { … }

}  // anonymous namespace
}  // namespace dawn