skia2/tests/MemsetTest.cpp
Mike Klein c0bd9f9fe5 rewrite includes to not need so much -Ifoo
Current strategy: everything from the top

Things to look at first are the manual changes:

   - added tools/rewrite_includes.py
   - removed -Idirectives from BUILD.gn
   - various compile.sh simplifications
   - tweak tools/embed_resources.py
   - update gn/find_headers.py to write paths from the top
   - update gn/gn_to_bp.py SkUserConfig.h layout
     so that #include "include/config/SkUserConfig.h" always
     gets the header we want.

No-Presubmit: true
Change-Id: I73a4b181654e0e38d229bc456c0d0854bae3363e
Reviewed-on: https://skia-review.googlesource.com/c/skia/+/209706
Commit-Queue: Mike Klein <mtklein@google.com>
Reviewed-by: Hal Canary <halcanary@google.com>
Reviewed-by: Brian Osman <brianosman@google.com>
Reviewed-by: Florin Malita <fmalita@chromium.org>
2019-04-24 16:27:11 +00:00

90 lines
2.6 KiB
C++

/*
* 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 "include/utils/SkRandom.h"
#include "src/core/SkUtils.h"
#include "tests/Test.h"
static void set_zero(void* dst, size_t bytes) {
char* ptr = (char*)dst;
for (size_t i = 0; i < bytes; ++i) {
ptr[i] = 0;
}
}
#define MAX_ALIGNMENT 64
#define MAX_COUNT ((MAX_ALIGNMENT) * 32)
#define PAD 32
#define TOTAL (PAD + MAX_ALIGNMENT + MAX_COUNT + PAD)
#define VALUE16 0x1234
#define VALUE32 0x12345678
static void compare16(skiatest::Reporter* r, const uint16_t base[],
uint16_t value, int count) {
for (int i = 0; i < count; ++i) {
if (base[i] != value) {
ERRORF(r, "[%d] expected %x found %x\n", i, value, base[i]);
return;
}
}
}
static void compare32(skiatest::Reporter* r, const uint32_t base[],
uint32_t value, int count) {
for (int i = 0; i < count; ++i) {
if (base[i] != value) {
ERRORF(r, "[%d] expected %x found %x\n", i, value, base[i]);
return;
}
}
}
static void test_16(skiatest::Reporter* reporter) {
uint16_t buffer[TOTAL];
for (int count = 0; count < MAX_COUNT; ++count) {
for (int alignment = 0; alignment < MAX_ALIGNMENT; ++alignment) {
set_zero(buffer, sizeof(buffer));
uint16_t* base = &buffer[PAD + alignment];
sk_memset16(base, VALUE16, count);
compare16(reporter, buffer, 0, PAD + alignment);
compare16(reporter, base, VALUE16, count);
compare16(reporter, base + count, 0, TOTAL - count - PAD - alignment);
}
}
}
static void test_32(skiatest::Reporter* reporter) {
uint32_t buffer[TOTAL];
for (int count = 0; count < MAX_COUNT; ++count) {
for (int alignment = 0; alignment < MAX_ALIGNMENT; ++alignment) {
set_zero(buffer, sizeof(buffer));
uint32_t* base = &buffer[PAD + alignment];
sk_memset32(base, VALUE32, count);
compare32(reporter, buffer, 0, PAD + alignment);
compare32(reporter, base, VALUE32, count);
compare32(reporter, base + count, 0, TOTAL - count - PAD - alignment);
}
}
}
/**
* Test sk_memset16 and sk_memset32.
* For performance considerations, implementations may take different paths
* depending on the alignment of the dst, and/or the size of the count.
*/
DEF_TEST(Memset, reporter) {
test_16(reporter);
test_32(reporter);
}