7d3f089e58
When eliminating a CFG node, we now flag its exit nodes; if our optimization pass reaches one of those flagged nodes, we stop the current optimization process in its tracks and initiate a rescan. We do NOT recursively mark the exits of the exit nodes, so this fix is reliant on the CFG being ordered in a non-chaotic fashion, but in practice this seems to be sufficient for the CFGs we generate today. Change-Id: I892805361c5f4297e02146f37a759dfda83f5488 Bug: oss-fuzz:26942 Reviewed-on: https://skia-review.googlesource.com/c/skia/+/331597 Commit-Queue: John Stiles <johnstiles@google.com> Auto-Submit: John Stiles <johnstiles@google.com> Reviewed-by: Brian Osman <brianosman@google.com>
63 lines
2.1 KiB
C++
63 lines
2.1 KiB
C++
/*
|
|
* Copyright 2011 Google Inc.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
|
|
#include "src/utils/SkBitSet.h"
|
|
#include "tests/Test.h"
|
|
|
|
#include <vector>
|
|
|
|
DEF_TEST(BitSet, reporter) {
|
|
SkBitSet set0(65536);
|
|
REPORTER_ASSERT(reporter, set0.size() == 65536);
|
|
REPORTER_ASSERT(reporter, set0.test(0) == false);
|
|
REPORTER_ASSERT(reporter, set0.test(32767) == false);
|
|
REPORTER_ASSERT(reporter, set0.test(65535) == false);
|
|
REPORTER_ASSERT(reporter, !set0.findFirst());
|
|
|
|
set0.set(22);
|
|
REPORTER_ASSERT(reporter, set0.test(22) == true);
|
|
REPORTER_ASSERT(reporter, set0.findFirst());
|
|
REPORTER_ASSERT(reporter, *set0.findFirst() == 22);
|
|
set0.set(24);
|
|
REPORTER_ASSERT(reporter, set0.test(24) == true);
|
|
REPORTER_ASSERT(reporter, *set0.findFirst() == 22);
|
|
set0.set(35); // on a different DWORD
|
|
REPORTER_ASSERT(reporter, set0.test(35) == true);
|
|
REPORTER_ASSERT(reporter, *set0.findFirst() == 22);
|
|
REPORTER_ASSERT(reporter, set0.test(24) == true);
|
|
REPORTER_ASSERT(reporter, set0.test(35) == true);
|
|
set0.set(21);
|
|
REPORTER_ASSERT(reporter, set0.test(21) == true);
|
|
REPORTER_ASSERT(reporter, *set0.findFirst() == 21);
|
|
set0.reset(21);
|
|
REPORTER_ASSERT(reporter, set0.test(21) == false);
|
|
REPORTER_ASSERT(reporter, *set0.findFirst() == 22);
|
|
|
|
std::vector<unsigned int> data;
|
|
set0.forEachSetIndex([&data](unsigned v) { data.push_back(v); });
|
|
|
|
REPORTER_ASSERT(reporter, data.size() == 3);
|
|
REPORTER_ASSERT(reporter, data[0] == 22);
|
|
REPORTER_ASSERT(reporter, data[1] == 24);
|
|
REPORTER_ASSERT(reporter, data[2] == 35);
|
|
|
|
SkBitSet set1(65536);
|
|
set1.set(12345);
|
|
REPORTER_ASSERT(reporter, set0.test(12345) == false);
|
|
REPORTER_ASSERT(reporter, set1.test(12345) == true);
|
|
REPORTER_ASSERT(reporter, set1.test(22) == false);
|
|
REPORTER_ASSERT(reporter, set0.test(35) == true);
|
|
|
|
set0.reset();
|
|
REPORTER_ASSERT(reporter, !set0.findFirst());
|
|
REPORTER_ASSERT(reporter, set0.test(1234) == false);
|
|
|
|
set0.set();
|
|
REPORTER_ASSERT(reporter, !set0.findFirstUnset());
|
|
REPORTER_ASSERT(reporter, set0.test(5678) == true);
|
|
}
|