| Index: test/cctest/test-heap.cc
|
| diff --git a/test/cctest/test-heap.cc b/test/cctest/test-heap.cc
|
| index a4d4be481668964bbc83dff2fa91b690e0dc980f..a6dd83054b27a9f00f067d25cf45327133b859c8 100644
|
| --- a/test/cctest/test-heap.cc
|
| +++ b/test/cctest/test-heap.cc
|
| @@ -1328,35 +1328,6 @@ TEST(CollectingAllAvailableGarbageShrinksNewSpace) {
|
| CHECK(old_capacity == new_capacity);
|
| }
|
|
|
| -// This just checks the contract of the IdleNotification() function,
|
| -// and does not verify that it does reasonable work.
|
| -TEST(IdleNotificationAdvancesIncrementalMarking) {
|
| - if (!FLAG_incremental_marking || !FLAG_incremental_marking_steps) return;
|
| - InitializeVM();
|
| - v8::HandleScope scope;
|
| - const char* source = "function binom(n, m) {"
|
| - " var C = [[1]];"
|
| - " for (var i = 1; i <= n; ++i) {"
|
| - " C[i] = [1];"
|
| - " for (var j = 1; j < i; ++j) {"
|
| - " C[i][j] = C[i-1][j-1] + C[i-1][j];"
|
| - " }"
|
| - " C[i][i] = 1;"
|
| - " }"
|
| - " return C[n][m];"
|
| - "};"
|
| - "binom(1000, 500)";
|
| - {
|
| - AlwaysAllocateScope aa_scope;
|
| - CompileRun(source);
|
| - }
|
| - intptr_t old_size = HEAP->SizeOfObjects();
|
| - bool no_idle_work = v8::V8::IdleNotification(900);
|
| - while (!v8::V8::IdleNotification(900)) ;
|
| - intptr_t new_size = HEAP->SizeOfObjects();
|
| - CHECK(no_idle_work || new_size < old_size);
|
| -}
|
| -
|
|
|
| static int NumberOfGlobalObjects() {
|
| int count = 0;
|
|
|