2 * Copyright 2011 Google Inc.
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
8 #include "SkPackBits.h"
11 static const uint16_t gTest0[] = { 0, 0, 1, 1 };
12 static const uint16_t gTest1[] = { 1, 2, 3, 4, 5, 6 };
13 static const uint16_t gTest2[] = { 0, 0, 0, 1, 2, 3, 3, 3 };
14 static const uint16_t gTest3[] = { 0, 0, 0, 0, 0, 0, 1, 2, 3, 3, 3, 0, 0, 1 };
17 static SkRandom gRand;
18 static void rand_fill(uint16_t buffer[], int count) {
19 for (int i = 0; i < count; i++)
20 buffer[i] = (uint16_t)gRand.nextU();
23 static void test_pack16(skiatest::Reporter* reporter) {
28 { gTest0, SK_ARRAY_COUNT(gTest0) },
29 { gTest1, SK_ARRAY_COUNT(gTest1) },
30 { gTest2, SK_ARRAY_COUNT(gTest2) },
31 { gTest3, SK_ARRAY_COUNT(gTest3) }
34 for (size_t i = 0; i < SK_ARRAY_COUNT(gTests); i++) {
36 size_t dstSize = SkPackBits::Pack16(gTests[i].fSrc,
37 gTests[i].fCount, dst);
39 int srcCount = SkPackBits::Unpack16(dst, dstSize, src);
40 bool match = gTests[i].fCount == srcCount && memcmp(gTests[i].fSrc, src,
41 gTests[i].fCount * sizeof(uint16_t)) == 0;
42 REPORTER_ASSERT(reporter, match);
45 for (int n = 1000; n; n--) {
47 uint16_t src[100], src2[100];
51 size_t dstSize = SkPackBits::Pack16(src, size, dst);
52 size_t maxSize = SkPackBits::ComputeMaxSize16(size);
53 REPORTER_ASSERT(reporter, maxSize >= dstSize);
55 size_t srcCount = SkPackBits::Unpack16(dst, dstSize, src2);
56 REPORTER_ASSERT(reporter, size == srcCount);
57 bool match = memcmp(src, src2, size * sizeof(uint16_t)) == 0;
58 REPORTER_ASSERT(reporter, match);
62 static const uint8_t gTest80[] = { 0, 0, 1, 1 };
63 static const uint8_t gTest81[] = { 1, 2, 3, 4, 5, 6 };
64 static const uint8_t gTest82[] = { 0, 0, 0, 1, 2, 3, 3, 3 };
65 static const uint8_t gTest83[] = { 0, 0, 0, 0, 0, 0, 1, 2, 3, 3, 3, 0, 0, 1 };
66 static const uint8_t gTest84[] = { 1, 0, 3, 0, 0, 0, 2, 1, 1, 2 };
68 static void rand_fill(uint8_t buffer[], int count) {
69 for (int i = 0; i < count; i++)
70 buffer[i] = (uint8_t)((gRand.nextU() >> 8) & 0x3);
73 static void test_pack8(skiatest::Reporter* reporter) {
78 { gTest80, SK_ARRAY_COUNT(gTest80) },
79 { gTest81, SK_ARRAY_COUNT(gTest81) },
80 { gTest82, SK_ARRAY_COUNT(gTest82) },
81 { gTest83, SK_ARRAY_COUNT(gTest83) },
82 { gTest84, SK_ARRAY_COUNT(gTest84) }
85 for (size_t i = 4; i < SK_ARRAY_COUNT(gTests); i++) {
87 size_t maxSize = SkPackBits::ComputeMaxSize8(gTests[i].fCount);
88 size_t dstSize = SkPackBits::Pack8(gTests[i].fSrc,
89 gTests[i].fCount, dst);
90 REPORTER_ASSERT(reporter, dstSize <= maxSize);
92 int srcCount = SkPackBits::Unpack8(dst, dstSize, src);
93 bool match = gTests[i].fCount == srcCount &&
94 memcmp(gTests[i].fSrc, src,
95 gTests[i].fCount * sizeof(uint8_t)) == 0;
96 REPORTER_ASSERT(reporter, match);
99 for (size_t size = 1; size <= 512; size += 1) {
100 for (int n = 100; n; n--) {
101 uint8_t src[600], src2[600];
103 rand_fill(src, size);
105 size_t dstSize = SkPackBits::Pack8(src, size, dst);
106 size_t maxSize = SkPackBits::ComputeMaxSize8(size);
107 REPORTER_ASSERT(reporter, maxSize >= dstSize);
109 size_t srcCount = SkPackBits::Unpack8(dst, dstSize, src2);
110 REPORTER_ASSERT(reporter, size == srcCount);
111 bool match = memcmp(src, src2, size * sizeof(uint8_t)) == 0;
112 REPORTER_ASSERT(reporter, match);
114 for (int j = 0; j < 100; j++) {
115 size_t skip = gRand.nextU() % size;
116 size_t write = gRand.nextU() % size;
117 if (skip + write > size) {
120 SkPackBits::Unpack8(src, skip, write, dst);
121 bool match = memcmp(src, src2 + skip, write) == 0;
122 REPORTER_ASSERT(reporter, match);
128 DEF_TEST(PackBits, reporter) {
129 test_pack8(reporter);
130 test_pack16(reporter);