1 // Copyright (c) 2015-2016 The Khronos Group Inc.
2 //
3 // Licensed under the Apache License, Version 2.0 (the "License");
4 // you may not use this file except in compliance with the License.
5 // You may obtain a copy of the License at
6 //
7 // http://www.apache.org/licenses/LICENSE-2.0
8 //
9 // Unless required by applicable law or agreed to in writing, software
10 // distributed under the License is distributed on an "AS IS" BASIS,
11 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 // See the License for the specific language governing permissions and
13 // limitations under the License.
14
15 #include "test/unit_spirv.h"
16
17 namespace spvtools {
18 namespace {
19
20 // A sampling of word counts. Covers extreme points well, and all bit
21 // positions, and some combinations of bit positions.
22 const uint16_t kSampleWordCounts[] = {
23 0, 1, 2, 3, 4, 8, 16, 32, 64, 127, 128,
24 256, 511, 512, 1024, 2048, 4096, 8192, 16384, 32768, 0xfffe, 0xffff};
25
26 // A sampling of opcode values. Covers the lower values well, a few samples
27 // around the number of core instructions (as of this writing), and some
28 // higher values.
29 const uint16_t kSampleOpcodes[] = {0, 1, 2, 3, 4, 100,
30 300, 305, 1023, 0xfffe, 0xffff};
31
TEST(OpcodeMake,Samples)32 TEST(OpcodeMake, Samples) {
33 for (auto wordCount : kSampleWordCounts) {
34 for (auto opcode : kSampleOpcodes) {
35 uint32_t word = 0;
36 word |= uint32_t(opcode);
37 word |= uint32_t(wordCount) << 16;
38 EXPECT_EQ(word, spvOpcodeMake(wordCount, SpvOp(opcode)));
39 }
40 }
41 }
42
43 } // namespace
44 } // namespace spvtools
45