8729e5bbf7
It's easier to work on SkJumper if everything funnels through run(). I don't anticipate huge benefit from compile() without JITing, but it's something we can always put back if we find a need. Change-Id: Id5256fd21495e8195cad1924dbad81856416d913 Reviewed-on: https://skia-review.googlesource.com/8468 Commit-Queue: Mike Klein <mtklein@chromium.org> Reviewed-by: Mike Klein <mtklein@chromium.org>
82 lines
2.5 KiB
C++
82 lines
2.5 KiB
C++
/*
|
|
* Copyright 2016 Google Inc.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
|
|
#include "Test.h"
|
|
#include "SkHalf.h"
|
|
#include "SkRasterPipeline.h"
|
|
|
|
DEF_TEST(SkRasterPipeline, r) {
|
|
// Build and run a simple pipeline to exercise SkRasterPipeline,
|
|
// drawing 50% transparent blue over opaque red in half-floats.
|
|
uint64_t red = 0x3c00000000003c00ull,
|
|
blue = 0x3800380000000000ull,
|
|
result;
|
|
|
|
void* load_s_ctx = &blue;
|
|
void* load_d_ctx = &red;
|
|
void* store_ctx = &result;
|
|
|
|
SkRasterPipeline p;
|
|
p.append(SkRasterPipeline::load_f16, &load_s_ctx);
|
|
p.append(SkRasterPipeline::move_src_dst);
|
|
p.append(SkRasterPipeline::load_f16, &load_d_ctx);
|
|
p.append(SkRasterPipeline::swap);
|
|
p.append(SkRasterPipeline::srcover);
|
|
p.append(SkRasterPipeline::store_f16, &store_ctx);
|
|
p.run(0,1);
|
|
|
|
// We should see half-intensity magenta.
|
|
REPORTER_ASSERT(r, ((result >> 0) & 0xffff) == 0x3800);
|
|
REPORTER_ASSERT(r, ((result >> 16) & 0xffff) == 0x0000);
|
|
REPORTER_ASSERT(r, ((result >> 32) & 0xffff) == 0x3800);
|
|
REPORTER_ASSERT(r, ((result >> 48) & 0xffff) == 0x3c00);
|
|
}
|
|
|
|
DEF_TEST(SkRasterPipeline_empty, r) {
|
|
// No asserts... just a test that this is safe to run.
|
|
SkRasterPipeline p;
|
|
p.run(0,20);
|
|
}
|
|
|
|
DEF_TEST(SkRasterPipeline_nonsense, r) {
|
|
// No asserts... just a test that this is safe to run and terminates.
|
|
// srcover() calls st->next(); this makes sure we've always got something there to call.
|
|
SkRasterPipeline p;
|
|
p.append(SkRasterPipeline::srcover);
|
|
p.run(0,20);
|
|
}
|
|
|
|
DEF_TEST(SkRasterPipeline_JIT, r) {
|
|
// This tests a couple odd corners that a JIT backend can stumble over.
|
|
|
|
uint32_t buf[72] = {
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,
|
|
13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
};
|
|
|
|
const uint32_t* src = buf + 0;
|
|
uint32_t* dst = buf + 36;
|
|
|
|
// Copy buf[x] to buf[x+36] for x in [15,35).
|
|
SkRasterPipeline p;
|
|
p.append(SkRasterPipeline:: load_8888, &src);
|
|
p.append(SkRasterPipeline::store_8888, &dst);
|
|
p.run(15, 20);
|
|
|
|
for (int i = 0; i < 36; i++) {
|
|
if (i < 15 || i == 35) {
|
|
REPORTER_ASSERT(r, dst[i] == 0);
|
|
} else {
|
|
REPORTER_ASSERT(r, dst[i] == (uint32_t)(i - 11));
|
|
}
|
|
}
|
|
}
|