diff options
author | Sebastian Poeplau <sebastian.poeplau@eurecom.fr> | 2018-07-25 14:56:39 +0200 |
---|---|---|
committer | Cristian Cadar <c.cadar@imperial.ac.uk> | 2020-09-03 19:16:15 +0100 |
commit | 5a4823df4f3ead642e4a6e84a972db5ed61a075a (patch) | |
tree | 040ae71f53609017471f568095de24c3359a5d5f /unittests/Searcher | |
parent | 97e87ce0bed503b3e13b4d161e25bed1e47cd31e (diff) | |
download | klee-5a4823df4f3ead642e4a6e84a972db5ed61a075a.tar.gz |
Fix PTree::remove to clean the tree properly
The previous version left unnecessary intermediate nodes behind, sometimes leading to very long paths in the tree.
Diffstat (limited to 'unittests/Searcher')
-rw-r--r-- | unittests/Searcher/SearcherTest.cpp | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/unittests/Searcher/SearcherTest.cpp b/unittests/Searcher/SearcherTest.cpp index fdd93e62..eff5a8af 100644 --- a/unittests/Searcher/SearcherTest.cpp +++ b/unittests/Searcher/SearcherTest.cpp @@ -51,13 +51,13 @@ TEST(SearcherTest, RandomPath) { } rp.update(&es, {&es1}, {&es}); - PTree::remove(es.ptreeNode); + processTree.remove(es.ptreeNode); for (int i = 0; i < 100; i++) { EXPECT_EQ(&rp.selectState(), &es1); } rp.update(&es1, {}, {&es1}); - PTree::remove(es1.ptreeNode); + processTree.remove(es1.ptreeNode); EXPECT_TRUE(rp.empty()); } @@ -103,16 +103,16 @@ TEST(SearcherTest, TwoRandomPath) { } rp1.update(&es, {}, {&es}); - PTree::remove(es.ptreeNode); + processTree.remove(es.ptreeNode); EXPECT_TRUE(rp1.empty()); EXPECT_EQ(&rp.selectState(), &es1); rp.update(&es1, {}, {&es1}); - PTree::remove(es1.ptreeNode); + processTree.remove(es1.ptreeNode); EXPECT_TRUE(rp.empty()); EXPECT_TRUE(rp1.empty()); - PTree::remove(root.ptreeNode); + processTree.remove(root.ptreeNode); } TEST(SearcherTest, TwoRandomPathDot) { @@ -174,7 +174,7 @@ TEST(SearcherTest, TwoRandomPathDot) { rp1.update(nullptr, {&es}, {&es1}); rp1.update(&es, {}, {&es}); - PTree::remove(es.ptreeNode); + processTree.remove(es.ptreeNode); modelPTreeDot.str(""); modelPTreeDot @@ -198,15 +198,15 @@ TEST(SearcherTest, TwoRandomPathDot) { pTreeDot = ""; processTree.dump(pTreeDotStream); EXPECT_EQ(modelPTreeDot.str(), pTreeDotStream.str()); - PTree::remove(es1.ptreeNode); - PTree::remove(root.ptreeNode); + processTree.remove(es1.ptreeNode); + processTree.remove(root.ptreeNode); } TEST(SearcherDeathTest, TooManyRandomPaths) { // First state ExecutionState es; PTree processTree(&es); es.ptreeNode = processTree.root.getPointer(); - PTree::remove(es.ptreeNode); // Need to remove to avoid leaks + processTree.remove(es.ptreeNode); // Need to remove to avoid leaks RNG rng; RandomPathSearcher rp(processTree, rng); |