mirror of
https://repo.dactyloidae.xyz/Dactyloidae/UXP.git
synced 2026-09-19 14:57:32 +09:00
Update aom to v1.0.0
Update aom to commit id d14c5bb4f336ef1842046089849dee4a301fbbf0.
This commit is contained in:
parent
bb61121b44
commit
48f6d2e034
1087 changed files with 154333 additions and 265310 deletions
61
third_party/aom/test/segment_binarization_sync.cc
vendored
Normal file
61
third_party/aom/test/segment_binarization_sync.cc
vendored
Normal file
|
|
@ -0,0 +1,61 @@
|
|||
/*
|
||||
* Copyright (c) 2018, 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 "third_party/googletest/src/googletest/include/gtest/gtest.h"
|
||||
#include "test/acm_random.h"
|
||||
|
||||
using libaom_test::ACMRandom;
|
||||
|
||||
extern "C" {
|
||||
int av1_neg_interleave(int x, int ref, int max);
|
||||
int av1_neg_deinterleave(int diff, int ref, int max);
|
||||
}
|
||||
|
||||
namespace {
|
||||
|
||||
struct Segment {
|
||||
int id;
|
||||
int pred;
|
||||
int last_id;
|
||||
};
|
||||
|
||||
Segment GenerateSegment(int seed) {
|
||||
static const int MAX_SEGMENTS = 8;
|
||||
|
||||
ACMRandom rnd_(seed);
|
||||
|
||||
Segment segment;
|
||||
const int last_segid = rnd_.PseudoUniform(MAX_SEGMENTS);
|
||||
segment.last_id = last_segid;
|
||||
segment.pred = rnd_.PseudoUniform(MAX_SEGMENTS);
|
||||
segment.id = rnd_.PseudoUniform(last_segid + 1);
|
||||
|
||||
return segment;
|
||||
}
|
||||
|
||||
// Try to reveal a mismatch between segment binarization and debinarization
|
||||
TEST(SegmentBinarizationSync, SearchForBinarizationMismatch) {
|
||||
const int count_tests = 1000;
|
||||
const int seed_init = 4321;
|
||||
|
||||
for (int i = 0; i < count_tests; ++i) {
|
||||
const Segment seg = GenerateSegment(seed_init + i);
|
||||
|
||||
const int max_segid = seg.last_id + 1;
|
||||
const int seg_diff = av1_neg_interleave(seg.id, seg.pred, max_segid);
|
||||
const int decoded_segid =
|
||||
av1_neg_deinterleave(seg_diff, seg.pred, max_segid);
|
||||
|
||||
ASSERT_EQ(decoded_segid, seg.id);
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace
|
||||
Loading…
Add table
Add a link
Reference in a new issue