/*
 * Copyright 2011 Google Inc.
 *
 * Use of this source code is governed by a BSD-style license that can be
 * found in the LICENSE file.
 */
#include "bench/Benchmark.h"
#include "include/core/SkRegion.h"
#include "include/core/SkString.h"
#include "src/core/SkRandom.h"

static bool union_proc(SkRegion& a, SkRegion& b) {
    SkRegion result;
    return result.op(a, b, SkRegion::kUnion_Op);
}

static bool sect_proc(SkRegion& a, SkRegion& b) {
    SkRegion result;
    return result.op(a, b, SkRegion::kIntersect_Op);
}

static bool diff_proc(SkRegion& a, SkRegion& b) {
    SkRegion result;
    return result.op(a, b, SkRegion::kDifference_Op);
}

static bool diffrect_proc(SkRegion& a, SkRegion& b) {
    SkRegion result;
    return result.op(a, b.getBounds(), SkRegion::kDifference_Op);
}

static bool diffrectbig_proc(SkRegion& a, SkRegion& b) {
    SkRegion result;
    return result.op(a, a.getBounds(), SkRegion::kDifference_Op);
}

static bool containsrect_proc(SkRegion& a, SkRegion& b) {
    SkIRect r = a.getBounds();
    r.inset(r.width()/4, r.height()/4);
    (void)a.contains(r);

    r = b.getBounds();
    r.inset(r.width()/4, r.height()/4);
    return b.contains(r);
}

static bool sectsrgn_proc(SkRegion& a, SkRegion& b) {
    return a.intersects(b);
}

static bool sectsrect_proc(SkRegion& a, SkRegion& b) {
    SkIRect r = a.getBounds();
    r.inset(r.width()/4, r.height()/4);
    return a.intersects(r);
}

static bool containsxy_proc(SkRegion& a, SkRegion& b) {
    const SkIRect& r = a.getBounds();
    const int dx = r.width() / 8;
    const int dy = r.height() / 8;
    for (int y = r.fTop; y < r.fBottom; y += dy) {
        for (int x = r.fLeft; x < r.fRight; x += dx) {
            (void)a.contains(x, y);
        }
    }
    return true;
}

class RegionBench : public Benchmark {
    using Proc = bool (*)(SkRegion& a, SkRegion& b);
public:
    SkIRect randrect(SkRandom& rand) {
        int x = rand.nextU() % W;
        int y = rand.nextU() % H;
        int w = rand.nextU() % W;
        int h = rand.nextU() % H;
        return SkIRect::MakeXYWH(x, y, w >> 1, h >> 1);
    }

    RegionBench(int count, Proc proc, const char name[])  {
        fProc = proc;
        fName.printf("region_%s_%d", name, count);

        SkRandom rand;
        for (int i = 0; i < count; i++) {
            fA.op(randrect(rand), SkRegion::kXOR_Op);
            fB.op(randrect(rand), SkRegion::kXOR_Op);
        }
    }

    bool isSuitableFor(Backend backend) override {
        return backend == Backend::kNonRendering;
    }

protected:
    const char* onGetName() override { return fName.c_str(); }

    void onDraw(int loops, SkCanvas* canvas) override {
        Proc proc = fProc;
        for (int i = 0; i < loops; ++i) {
            proc(fA, fB);
        }
    }

private:

    SkRegion fA, fB;
    Proc     fProc;
    SkString fName;

    static constexpr int W = 1024;
    static constexpr int H = 768;
};

class RegionSetRectsBench : public Benchmark {
public:
    RegionSetRectsBench(int count, bool sorted) {
        fName.printf("region_setRects_%d%s", count, sorted ? "_sorted" : "");

        if (sorted) {
            // A grid of non-overlapping rectangles, naturally ordered by Y then X.
            int side = 1;
            while (side * side < count) side++;
            for (int i = 0; i < count; i++) {
                int x = i % side;
                int y = i / side;
                fRects.push_back(SkIRect::MakeXYWH(x * 20, y * 20, 10, 10));
            }
        } else {
            // Random rectangles, likely overlapping and in arbitrary order.
            SkRandom rand;
            for (int i = 0; i < count; i++) {
                int x = rand.nextU() % 1024;
                int y = rand.nextU() % 768;
                int w = rand.nextU() % 1024;
                int h = rand.nextU() % 768;
                fRects.push_back(SkIRect::MakeXYWH(x, y, w >> 1, h >> 1));
            }
        }
    }

    bool isSuitableFor(Backend backend) override {
        return backend == Backend::kNonRendering;
    }

protected:
    const char* onGetName() override { return fName.c_str(); }

    void onDraw(int loops, SkCanvas* canvas) override {
        for (int i = 0; i < loops; ++i) {
            SkRegion rgn;
            rgn.setRects(fRects);
        }
    }

private:
    SkString fName;
    std::vector<SkIRect> fRects;
};

///////////////////////////////////////////////////////////////////////////////

#define SMALL   16

DEF_BENCH(return new RegionBench(SMALL, union_proc, "union");)
DEF_BENCH(return new RegionBench(SMALL, sect_proc, "intersect");)
DEF_BENCH(return new RegionBench(SMALL, diff_proc, "difference");)
DEF_BENCH(return new RegionBench(SMALL, diffrect_proc, "differencerect");)
DEF_BENCH(return new RegionBench(SMALL, diffrectbig_proc, "differencerectbig");)
DEF_BENCH(return new RegionBench(SMALL, containsrect_proc, "containsrect");)
DEF_BENCH(return new RegionBench(SMALL, sectsrgn_proc, "intersectsrgn");)
DEF_BENCH(return new RegionBench(SMALL, sectsrect_proc, "intersectsrect");)
DEF_BENCH(return new RegionBench(SMALL, containsxy_proc, "containsxy");)

DEF_BENCH(return new RegionSetRectsBench(50, false);)
DEF_BENCH(return new RegionSetRectsBench(500, false);)
DEF_BENCH(return new RegionSetRectsBench(2500, false);)
DEF_BENCH(return new RegionSetRectsBench(10000, false);)
DEF_BENCH(return new RegionSetRectsBench(50, true);)
DEF_BENCH(return new RegionSetRectsBench(500, true);)
DEF_BENCH(return new RegionSetRectsBench(2500, true);)
DEF_BENCH(return new RegionSetRectsBench(10000, true);)

class RegionCheckerboardBench : public Benchmark {
public:
    RegionCheckerboardBench() {}

protected:
    const char* onGetName() override { return "region_checkerboard"; }

    bool isSuitableFor(Backend backend) override {
        return backend == Backend::kNonRendering;
    }

    void onDraw(int loops, SkCanvas* canvas) override {
        for (int i = 0; i < loops; ++i) {
            SkRegion rgn;
            // Simulate a 300x200 grid of tiles where every other tile is missing.
            // This creates 30,000 non-merging rectangles with high coordinate values
            // similar to b/511952524.
            for (int y = 0; y < 300; ++y) {
                for (int x = 0; x < 200; ++x) {
                    if ((x + y) % 2 == 0) {
                        rgn.op(SkIRect::MakeXYWH(x * 256, y * 256, 256, 256), SkRegion::kUnion_Op);
                    }
                }
            }
        }
    }
};

DEF_BENCH(return new RegionCheckerboardBench();)