toc_test.cc (2928B)
1 // Copyright (c) the JPEG XL Project Authors. All rights reserved. 2 // 3 // Use of this source code is governed by a BSD-style 4 // license that can be found in the LICENSE file. 5 6 #include "lib/jxl/toc.h" 7 8 #include <vector> 9 10 #include "lib/jxl/base/common.h" 11 #include "lib/jxl/base/random.h" 12 #include "lib/jxl/base/span.h" 13 #include "lib/jxl/coeff_order_fwd.h" 14 #include "lib/jxl/enc_aux_out.h" 15 #include "lib/jxl/enc_toc.h" 16 #include "lib/jxl/testing.h" 17 18 namespace jxl { 19 namespace { 20 21 void Roundtrip(size_t num_entries, bool permute, Rng* rng) { 22 // Generate a random permutation. 23 std::vector<coeff_order_t> permutation; 24 std::vector<coeff_order_t> inv_permutation(num_entries); 25 for (size_t i = 0; i < num_entries; i++) { 26 inv_permutation[i] = i; 27 } 28 if (permute) { 29 permutation.resize(num_entries); 30 for (size_t i = 0; i < num_entries; i++) { 31 permutation[i] = i; 32 } 33 rng->Shuffle(permutation.data(), permutation.size()); 34 for (size_t i = 0; i < num_entries; i++) { 35 inv_permutation[permutation[i]] = i; 36 } 37 } 38 39 // Generate num_entries groups of random (byte-aligned) length 40 std::vector<BitWriter> group_codes(num_entries); 41 for (BitWriter& writer : group_codes) { 42 const size_t max_bits = (*rng)() & 0xFFF; 43 BitWriter::Allotment allotment(&writer, max_bits + kBitsPerByte); 44 size_t i = 0; 45 for (; i + BitWriter::kMaxBitsPerCall < max_bits; 46 i += BitWriter::kMaxBitsPerCall) { 47 writer.Write(BitWriter::kMaxBitsPerCall, 0); 48 } 49 for (; i < max_bits; i += 1) { 50 writer.Write(/*n_bits=*/1, 0); 51 } 52 writer.ZeroPadToByte(); 53 AuxOut aux_out; 54 allotment.ReclaimAndCharge(&writer, 0, &aux_out); 55 } 56 57 BitWriter writer; 58 AuxOut aux_out; 59 ASSERT_TRUE(WriteGroupOffsets(group_codes, permutation, &writer, &aux_out)); 60 61 BitReader reader(writer.GetSpan()); 62 std::vector<uint64_t> group_offsets; 63 std::vector<uint32_t> group_sizes; 64 uint64_t total_size; 65 ASSERT_TRUE(ReadGroupOffsets(num_entries, &reader, &group_offsets, 66 &group_sizes, &total_size)); 67 ASSERT_EQ(num_entries, group_offsets.size()); 68 ASSERT_EQ(num_entries, group_sizes.size()); 69 EXPECT_TRUE(reader.Close()); 70 71 uint64_t prefix_sum = 0; 72 for (size_t i = 0; i < num_entries; ++i) { 73 EXPECT_EQ(prefix_sum, group_offsets[inv_permutation[i]]); 74 75 EXPECT_EQ(0u, group_codes[i].BitsWritten() % kBitsPerByte); 76 prefix_sum += group_codes[i].BitsWritten() / kBitsPerByte; 77 78 if (i + 1 < num_entries) { 79 EXPECT_EQ( 80 group_offsets[inv_permutation[i]] + group_sizes[inv_permutation[i]], 81 group_offsets[inv_permutation[i + 1]]); 82 } 83 } 84 EXPECT_EQ(prefix_sum, total_size); 85 } 86 87 TEST(TocTest, Test) { 88 Rng rng(0); 89 for (size_t num_entries = 1; num_entries < 10; ++num_entries) { 90 for (bool permute : std::vector<bool>{false, true}) { 91 Roundtrip(num_entries, permute, &rng); 92 } 93 } 94 } 95 96 } // namespace 97 } // namespace jxl