OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2012 The WebM project authors. All Rights Reserved. | 2 * Copyright (c) 2012 The WebM project authors. All Rights Reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 4 * Use of this source code is governed by a BSD-style license |
5 * that can be found in the LICENSE file in the root of the source | 5 * that can be found in the LICENSE file in the root of the source |
6 * tree. An additional intellectual property rights grant can be found | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
(...skipping 17 matching lines...) Expand all Loading... |
28 | 28 |
29 // In a real use the 'decrypt_state' parameter will be a pointer to a struct | 29 // In a real use the 'decrypt_state' parameter will be a pointer to a struct |
30 // with whatever internal state the decryptor uses. For testing we'll just | 30 // with whatever internal state the decryptor uses. For testing we'll just |
31 // xor with a constant key, and decrypt_state will point to the start of | 31 // xor with a constant key, and decrypt_state will point to the start of |
32 // the original buffer. | 32 // the original buffer. |
33 const uint8_t secret_key[16] = { | 33 const uint8_t secret_key[16] = { |
34 0x01, 0x12, 0x23, 0x34, 0x45, 0x56, 0x67, 0x78, | 34 0x01, 0x12, 0x23, 0x34, 0x45, 0x56, 0x67, 0x78, |
35 0x89, 0x9a, 0xab, 0xbc, 0xcd, 0xde, 0xef, 0xf0 | 35 0x89, 0x9a, 0xab, 0xbc, 0xcd, 0xde, 0xef, 0xf0 |
36 }; | 36 }; |
37 | 37 |
38 void encrypt_buffer(uint8_t *buffer, int size) { | 38 void encrypt_buffer(uint8_t *buffer, size_t size) { |
39 for (int i = 0; i < size; ++i) { | 39 for (size_t i = 0; i < size; ++i) { |
40 buffer[i] ^= secret_key[i & 15]; | 40 buffer[i] ^= secret_key[i & 15]; |
41 } | 41 } |
42 } | 42 } |
43 | 43 |
44 void test_decrypt_cb(void *decrypt_state, const uint8_t *input, | 44 void test_decrypt_cb(void *decrypt_state, const uint8_t *input, |
45 uint8_t *output, int count) { | 45 uint8_t *output, int count) { |
46 const size_t offset = input - reinterpret_cast<uint8_t*>(decrypt_state); | 46 const size_t offset = input - reinterpret_cast<uint8_t*>(decrypt_state); |
47 for (int i = 0; i < count; i++) { | 47 for (int i = 0; i < count; i++) { |
48 output[i] = input[i] ^ secret_key[(offset + i) & 15]; | 48 output[i] = input[i] ^ secret_key[(offset + i) & 15]; |
49 } | 49 } |
50 } | 50 } |
51 | 51 |
52 } // namespace | 52 } // namespace |
53 | 53 |
54 using libvpx_test::ACMRandom; | 54 using libvpx_test::ACMRandom; |
55 | 55 |
(...skipping 55 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
111 } | 111 } |
112 GTEST_ASSERT_EQ(vp8dx_decode_bool(&br, probas[i]), bit) | 112 GTEST_ASSERT_EQ(vp8dx_decode_bool(&br, probas[i]), bit) |
113 << "pos: "<< i << " / " << kBitsToTest | 113 << "pos: "<< i << " / " << kBitsToTest |
114 << " bit_method: " << bit_method | 114 << " bit_method: " << bit_method |
115 << " method: " << method; | 115 << " method: " << method; |
116 } | 116 } |
117 } | 117 } |
118 } | 118 } |
119 } | 119 } |
120 } | 120 } |
OLD | NEW |