opcode_make_test.cpp 1.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445
  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. #include "test/unit_spirv.h"
  15. namespace spvtools {
  16. namespace {
  17. // A sampling of word counts. Covers extreme points well, and all bit
  18. // positions, and some combinations of bit positions.
  19. const uint16_t kSampleWordCounts[] = {
  20. 0, 1, 2, 3, 4, 8, 16, 32, 64, 127, 128,
  21. 256, 511, 512, 1024, 2048, 4096, 8192, 16384, 32768, 0xfffe, 0xffff};
  22. // A sampling of opcode values. Covers the lower values well, a few samples
  23. // around the number of core instructions (as of this writing), and some
  24. // higher values.
  25. const uint16_t kSampleOpcodes[] = {0, 1, 2, 3, 4, 100,
  26. 300, 305, 1023, 0xfffe, 0xffff};
  27. TEST(OpcodeMake, Samples) {
  28. for (auto wordCount : kSampleWordCounts) {
  29. for (auto opcode : kSampleOpcodes) {
  30. uint32_t word = 0;
  31. word |= uint32_t(opcode);
  32. word |= uint32_t(wordCount) << 16;
  33. EXPECT_EQ(word, spvOpcodeMake(wordCount, SpvOp(opcode)));
  34. }
  35. }
  36. }
  37. } // namespace
  38. } // namespace spvtools