0209e95cc2
This should make the LSAN bots able to see all our pointers. BUG=skia: R=reed@google.com, robertphillips@google.com, mtklein@google.com Author: mtklein@chromium.org Review URL: https://codereview.chromium.org/517073002
106 lines
2.7 KiB
C++
106 lines
2.7 KiB
C++
/*
|
|
* Copyright 2014 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 "SkBitmap.h"
|
|
#include "SkImageInfo.h"
|
|
#include "SkShader.h"
|
|
#include "SkRecord.h"
|
|
#include "SkRecords.h"
|
|
|
|
// Sums the area of any DrawRect command it sees.
|
|
class AreaSummer {
|
|
public:
|
|
AreaSummer() : fArea(0) {}
|
|
|
|
template <typename T> void operator()(const T&) { }
|
|
|
|
void operator()(const SkRecords::DrawRect& draw) {
|
|
fArea += (int)(draw.rect.width() * draw.rect.height());
|
|
}
|
|
|
|
int area() const { return fArea; }
|
|
|
|
void apply(const SkRecord& record) {
|
|
for (unsigned i = 0; i < record.count(); i++) {
|
|
record.visit<void>(i, *this);
|
|
}
|
|
}
|
|
|
|
private:
|
|
int fArea;
|
|
};
|
|
|
|
// Scales out the bottom-right corner of any DrawRect command it sees by 2x.
|
|
struct Stretch {
|
|
template <typename T> void operator()(T*) {}
|
|
void operator()(SkRecords::DrawRect* draw) {
|
|
draw->rect.fRight *= 2;
|
|
draw->rect.fBottom *= 2;
|
|
}
|
|
|
|
void apply(SkRecord* record) {
|
|
for (unsigned i = 0; i < record->count(); i++) {
|
|
record->mutate<void>(i, *this);
|
|
}
|
|
}
|
|
};
|
|
|
|
#define APPEND(record, type, ...) SkNEW_PLACEMENT_ARGS(record.append<type>(), type, (__VA_ARGS__))
|
|
|
|
// Basic tests for the low-level SkRecord code.
|
|
DEF_TEST(Record, r) {
|
|
SkRecord record;
|
|
|
|
// Add a simple DrawRect command.
|
|
SkRect rect = SkRect::MakeWH(10, 10);
|
|
SkPaint paint;
|
|
APPEND(record, SkRecords::DrawRect, paint, rect);
|
|
|
|
// Its area should be 100.
|
|
AreaSummer summer;
|
|
summer.apply(record);
|
|
REPORTER_ASSERT(r, summer.area() == 100);
|
|
|
|
// Scale 2x.
|
|
Stretch stretch;
|
|
stretch.apply(&record);
|
|
|
|
// Now its area should be 100 + 400.
|
|
summer.apply(record);
|
|
REPORTER_ASSERT(r, summer.area() == 500);
|
|
}
|
|
|
|
#undef APPEND
|
|
|
|
template <typename T>
|
|
static bool is_aligned(const T* p) {
|
|
return (((uintptr_t)p) & (sizeof(T) - 1)) == 0;
|
|
}
|
|
|
|
DEF_TEST(Record_Alignment, r) {
|
|
SkRecord record;
|
|
|
|
// Of course a byte's always aligned.
|
|
REPORTER_ASSERT(r, is_aligned(record.alloc<uint8_t>()));
|
|
|
|
// (If packed tightly, the rest below here would be off by one.)
|
|
|
|
// It happens that the first implementation always aligned to 4 bytes,
|
|
// so these two were always correct.
|
|
REPORTER_ASSERT(r, is_aligned(record.alloc<uint16_t>()));
|
|
REPORTER_ASSERT(r, is_aligned(record.alloc<uint32_t>()));
|
|
|
|
// These two are regression tests (void* only on 64-bit machines).
|
|
REPORTER_ASSERT(r, is_aligned(record.alloc<uint64_t>()));
|
|
REPORTER_ASSERT(r, is_aligned(record.alloc<void*>()));
|
|
|
|
// We're not testing beyond sizeof(void*), which is where the current implementation will break.
|
|
}
|
|
|