Adapt code flushing tests to new code aging.

R=danno@chromium.org
TEST=cctest/test-heap/TestCodeFlushing

Review URL: https://codereview.chromium.org/11434082

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@13111 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent 45f42b04
...@@ -1116,8 +1116,10 @@ TEST(TestCodeFlushingIncrementalScavenge) { ...@@ -1116,8 +1116,10 @@ TEST(TestCodeFlushingIncrementalScavenge) {
// Bump the code age so that flushing is triggered while the function // Bump the code age so that flushing is triggered while the function
// object is still located in new-space. // object is still located in new-space.
const int kAgingThreshold = 6; const int kAgingThreshold = 6;
function->shared()->set_code_age(kAgingThreshold); for (int i = 0; i < kAgingThreshold; i++) {
function2->shared()->set_code_age(kAgingThreshold); function->shared()->code()->MakeOlder(static_cast<MarkingParity>(i % 2));
function2->shared()->code()->MakeOlder(static_cast<MarkingParity>(i % 2));
}
// Simulate incremental marking so that the functions are enqueued as // Simulate incremental marking so that the functions are enqueued as
// code flushing candidates. Then kill one of the functions. Finally // code flushing candidates. Then kill one of the functions. Finally
...@@ -1166,7 +1168,9 @@ TEST(TestCodeFlushingIncrementalAbort) { ...@@ -1166,7 +1168,9 @@ TEST(TestCodeFlushingIncrementalAbort) {
// Bump the code age so that flushing is triggered. // Bump the code age so that flushing is triggered.
const int kAgingThreshold = 6; const int kAgingThreshold = 6;
function->shared()->set_code_age(kAgingThreshold); for (int i = 0; i < kAgingThreshold; i++) {
function->shared()->code()->MakeOlder(static_cast<MarkingParity>(i % 2));
}
// Simulate incremental marking so that the function is enqueued as // Simulate incremental marking so that the function is enqueued as
// code flushing candidate. // code flushing candidate.
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment