/*
 * Copyright 2021 Google LLC
 *
 * Use of this source code is governed by a BSD-style license that can be
 * found in the LICENSE file.
 */

#include "tests/Test.h"

#include "experimental/graphite/include/Context.h"
#include "experimental/graphite/include/Recorder.h"
#include "experimental/graphite/src/ContextUtils.h"
#include "experimental/graphite/src/UniformCache.h"
#include "src/core/SkUniform.h"
#include "src/core/SkUniformData.h"

using namespace skgpu;

namespace {

std::unique_ptr<SkUniformBlock> make_ub(int numUniforms, int dataSize) {
    static constexpr int kMaxUniforms = 3;
    static constexpr SkUniform kUniforms[kMaxUniforms] {
        {"point0",   SkSLType::kFloat2 },
        {"point1",   SkSLType::kFloat2 },
        {"point2",   SkSLType::kFloat2 },
    };

    SkASSERT(numUniforms <= kMaxUniforms);

    sk_sp<SkUniformData> ud = SkUniformData::Make(SkSpan<const SkUniform>(kUniforms, numUniforms),
                                                  dataSize);
    for (int i = 0; i < numUniforms; ++i) {
        ud->offsets()[i] = i;
    }
    for (int i = 0; i < dataSize; ++i) {
        ud->data()[i] = i % 255;
    }

    return std::make_unique<SkUniformBlock>(std::move(ud));
}

} // anonymous namespace

DEF_GRAPHITE_TEST_FOR_CONTEXTS(UniformCacheTest, reporter, context) {
    std::unique_ptr<Recorder> recorder = context->makeRecorder();

    auto cache = recorder->uniformCache();

    REPORTER_ASSERT(reporter, cache->count() == 0);

    // Nullptr should already be in the cache and return kInvalidUniformID
    {
        uint32_t result0 = cache->insert(nullptr);
        REPORTER_ASSERT(reporter, result0 == UniformCache::kInvalidUniformID);
        REPORTER_ASSERT(reporter, cache->count() == 0);
    }

    // Add a new unique UB
    SkUniformBlock* danglingUB1 = nullptr;
    uint32_t result1;
    {
        std::unique_ptr<SkUniformBlock> ub1 = make_ub(2, 16);
        danglingUB1 = ub1.get();
        result1 = cache->insert(std::move(ub1));
        REPORTER_ASSERT(reporter, result1 != UniformCache::kInvalidUniformID);
        SkUniformBlock* lookup = cache->lookup(result1);
        REPORTER_ASSERT(reporter, lookup == danglingUB1);

        REPORTER_ASSERT(reporter, cache->count() == 1);
    }

    // Try to add a duplicate UB
    {
        std::unique_ptr<SkUniformBlock> ub2 = make_ub(2, 16);
        SkUniformBlock* danglingUB2 = ub2.get();
        uint32_t result2 = cache->insert(std::move(ub2));
        REPORTER_ASSERT(reporter, result2 != UniformCache::kInvalidUniformID);
        REPORTER_ASSERT(reporter, result2 == result1);
        SkUniformBlock* lookup = cache->lookup(result2);
        REPORTER_ASSERT(reporter, lookup != danglingUB2);
        REPORTER_ASSERT(reporter, lookup == danglingUB1);

        REPORTER_ASSERT(reporter, cache->count() == 1);
    }

    // Add a second new unique UB
    {
        std::unique_ptr<SkUniformBlock> ub3 = make_ub(3, 16);
        SkUniformBlock* danglingUB3 = ub3.get();
        uint32_t result3 = cache->insert(std::move(ub3));
        REPORTER_ASSERT(reporter, result3 != UniformCache::kInvalidUniformID);
        REPORTER_ASSERT(reporter, result3 != result1);
        SkUniformBlock* lookup = cache->lookup(result3);
        REPORTER_ASSERT(reporter, lookup == danglingUB3);
        REPORTER_ASSERT(reporter, lookup != danglingUB1);

        REPORTER_ASSERT(reporter, cache->count() == 2);
    }

    // TODO(robertphillips): expand this test to exercise all the UD comparison failure modes
}