1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
/*
* Copyright (c) 2016, Alliance for Open Media. All rights reserved
*
* This source code is subject to the terms of the BSD 2 Clause License and
* the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License
* was not distributed with this source code in the LICENSE file, you can
* obtain it at www.aomedia.org/license/software. If the Alliance for Open
* Media Patent License 1.0 was not distributed with this source code in the
* PATENTS file, you can obtain it at www.aomedia.org/license/patent.
*/
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include "third_party/googletest/src/googletest/include/gtest/gtest.h"
#include "test/acm_random.h"
#include "aom/aom_integer.h"
#include "aom_dsp/bitreader.h"
#include "aom_dsp/bitwriter.h"
using libaom_test::ACMRandom;
TEST(AV1, TestAccounting) {
const int kBufferSize = 10000;
const int kSymbols = 1024;
aom_writer bw;
uint8_t bw_buffer[kBufferSize];
aom_start_encode(&bw, bw_buffer);
for (int i = 0; i < kSymbols; i++) {
aom_write(&bw, 0, 32);
aom_write(&bw, 0, 32);
aom_write(&bw, 0, 32);
}
GTEST_ASSERT_GE(aom_stop_encode(&bw), 0);
aom_reader br;
aom_reader_init(&br, bw_buffer, bw.pos);
Accounting accounting;
aom_accounting_init(&accounting);
br.accounting = &accounting;
for (int i = 0; i < kSymbols; i++) {
aom_read(&br, 32, "A");
}
// Consecutive symbols that are the same are coalesced.
GTEST_ASSERT_EQ(accounting.syms.num_syms, 1);
GTEST_ASSERT_EQ(accounting.syms.syms[0].samples, (unsigned int)kSymbols);
aom_accounting_reset(&accounting);
GTEST_ASSERT_EQ(accounting.syms.num_syms, 0);
// Should record 2 * kSymbols accounting symbols.
aom_reader_init(&br, bw_buffer, bw.pos);
br.accounting = &accounting;
for (int i = 0; i < kSymbols; i++) {
aom_read(&br, 32, "A");
aom_read(&br, 32, "B");
aom_read(&br, 32, "B");
}
GTEST_ASSERT_EQ(accounting.syms.num_syms, kSymbols * 2);
uint32_t tell_frac = aom_reader_tell_frac(&br);
for (int i = 0; i < accounting.syms.num_syms; i++) {
tell_frac -= accounting.syms.syms[i].bits;
}
GTEST_ASSERT_EQ(tell_frac, 0U);
GTEST_ASSERT_EQ(aom_accounting_dictionary_lookup(&accounting, "A"),
aom_accounting_dictionary_lookup(&accounting, "A"));
// Check for collisions. The current aom_accounting_hash function returns
// the same hash code for AB and BA.
GTEST_ASSERT_NE(aom_accounting_dictionary_lookup(&accounting, "AB"),
aom_accounting_dictionary_lookup(&accounting, "BA"));
}
|
