Skip to content

TS-4953: Memory leaks in priority queue test #1094

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
bryancall merged 1 commit into from
Oct 11, 2016
Merged

TS-4953: Memory leaks in priority queue test #1094

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
78 changes: 78 additions & 0 deletions lib/ts/test_PriorityQueue.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -74,6 +74,10 @@ REGRESSION_TEST(PriorityQueue_1)(RegressionTest *t, int /* atype ATS_UNUSED */,

pq->pop();
box.check(pq->top() == NULL, "top should be NULL");

delete pq;
delete a;
delete entry_a;
}

// Increase weight
Expand Down Expand Up @@ -107,6 +111,16 @@ REGRESSION_TEST(PriorityQueue_2)(RegressionTest *t, int /* atype ATS_UNUSED */,
pq->update(entry_b, true);

box.check(pq->top() == entry_c, "top should be entry_c");

delete pq;

delete a;
delete b;
delete c;

delete entry_a;
delete entry_b;
delete entry_c;
}

// Decrease weight
Expand Down Expand Up @@ -140,6 +154,16 @@ REGRESSION_TEST(PriorityQueue_3)(RegressionTest *t, int /* atype ATS_UNUSED */,
pq->update(entry_c, false);

box.check(pq->top() == entry_c, "top should be entry_c");

delete pq;

delete a;
delete b;
delete c;

delete entry_a;
delete entry_b;
delete entry_c;
}

// Push, top, and pop 9 entries
Expand Down Expand Up @@ -200,6 +224,28 @@ REGRESSION_TEST(PriorityQueue_4)(RegressionTest *t, int /* atype ATS_UNUSED */,
pq->pop();

box.check(pq->top() == NULL, "top should be NULL");

delete pq;

delete a;
delete b;
delete c;
delete d;
delete e;
delete f;
delete g;
delete h;
delete i;

delete entry_a;
delete entry_b;
delete entry_c;
delete entry_d;
delete entry_e;
delete entry_f;
delete entry_g;
delete entry_h;
delete entry_i;
}

// // Push, top, pop, and update 9 entries
Expand Down Expand Up @@ -276,6 +322,28 @@ REGRESSION_TEST(PriorityQueue_5)(RegressionTest *t, int /* atype ATS_UNUSED */,
pq->pop();

box.check(pq->top() == NULL, "top should be NULL");

delete pq;

delete a;
delete b;
delete c;
delete d;
delete e;
delete f;
delete g;
delete h;
delete i;

delete entry_a;
delete entry_b;
delete entry_c;
delete entry_d;
delete entry_e;
delete entry_f;
delete entry_g;
delete entry_h;
delete entry_i;
}

// Test erase method
Expand Down Expand Up @@ -306,4 +374,14 @@ REGRESSION_TEST(PriorityQueue_6)(RegressionTest *t, int /* atype ATS_UNUSED */,
pq->erase(entry_b);
box.check(pq->top() == NULL, "top should be NULL");
box.check(pq->empty(), "should be empty");

delete pq;

delete a;
delete b;
delete c;

delete entry_a;
delete entry_b;
delete entry_c;
}