Escape % in SNPrintF call in pretenuring test.

test/cctest/test-heap.cc

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 2195 matching lines @@
       "var number_elements = %d;"
       "var elements = new Array();"
       "function f() {"
       "  for (var i = 0; i < number_elements; i++) {"
       "    elements[i] = [[{}], [1.1]];"
       "  }"
       "  return elements[number_elements-1]"
       "};"
       "f(); gc();"
       "f(); f();"
-      "%OptimizeFunctionOnNextCall(f);"
+      "%%OptimizeFunctionOnNextCall(f);"
       "f();",
       AllocationSite::kPretenureMinimumCreated);
 
   v8::Local<v8::Value> res = CompileRun(source.start());
 
   v8::Local<v8::Value> int_array = v8::Object::Cast(*res)->Get(v8_str("0"));
   Handle<JSObject> int_array_handle =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(int_array));
   v8::Local<v8::Value> double_array = v8::Object::Cast(*res)->Get(v8_str("1"));
   Handle<JSObject> double_array_handle =
@@ skipping 23 matching lines @@
       "var number_elements = %d;"
       "var elements = new Array(number_elements);"
       "function f() {"
       "  for (var i = 0; i < number_elements; i++) {"
       "    elements[i] = [{}, {}, {}];"
       "  }"
       "  return elements[number_elements - 1];"
       "};"
       "f(); gc();"
       "f(); f();"
-      "%OptimizeFunctionOnNextCall(f);"
+      "%%OptimizeFunctionOnNextCall(f);"
       "f();",
       AllocationSite::kPretenureMinimumCreated);
 
   v8::Local<v8::Value> res = CompileRun(source.start());
 
   Handle<JSObject> o =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(res));
 
   CHECK(CcTest::heap()->InOldPointerSpace(o->elements()));
   CHECK(CcTest::heap()->InOldPointerSpace(*o));
@@ skipping 14 matching lines @@
       "var number_elements = %d;"
       "var elements = new Array(number_elements);"
       "function f() {"
       "  for (var i = 0; i < number_elements; i++) {"
       "    elements[i] = {a: {c: 2.2, d: {}}, b: 1.1};"
       "  }"
       "  return elements[number_elements - 1];"
       "};"
       "f(); gc();"
       "f(); f();"
-      "%OptimizeFunctionOnNextCall(f);"
+      "%%OptimizeFunctionOnNextCall(f);"
       "f();",
       AllocationSite::kPretenureMinimumCreated);
 
   v8::Local<v8::Value> res = CompileRun(source.start());
 
   Handle<JSObject> o =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(res));
 
   CHECK(CcTest::heap()->InOldPointerSpace(*o));
   CHECK(CcTest::heap()->InOldPointerSpace(o->RawFastPropertyAt(0)));
@@ skipping 20 matching lines @@
       "var number_elements = %d;"
       "var elements = new Array(number_elements);"
       "function f() {"
       "  for (var i = 0; i < number_elements; i++) {"
       "    elements[i] = {a: 1.1, b: 2.2};"
       "  }"
       "  return elements[i - 1];"
       "};"
       "f(); gc();"
       "f(); f();"
-      "%OptimizeFunctionOnNextCall(f);"
+      "%%OptimizeFunctionOnNextCall(f);"
       "f();",
       AllocationSite::kPretenureMinimumCreated);
 
   v8::Local<v8::Value> res = CompileRun(source.start());
 
   Handle<JSObject> o =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(res));
 
   CHECK(CcTest::heap()->InOldPointerSpace(*o));
   CHECK(CcTest::heap()->InOldDataSpace(o->properties()));
@@ skipping 14 matching lines @@
       "var number_elements = %d;"
       "var elements = new Array(number_elements);"
       "function f() {"
       "  for (var i = 0; i < number_elements; i++) {"
       "    elements[i] = [1.1, 2.2, 3.3];"
       "  }"
       "  return elements[number_elements - 1];"
       "};"
       "f(); gc();"
       "f(); f();"
-      "%OptimizeFunctionOnNextCall(f);"
+      "%%OptimizeFunctionOnNextCall(f);"
       "f();",
       AllocationSite::kPretenureMinimumCreated);
 
   v8::Local<v8::Value> res = CompileRun(source.start());
 
   Handle<JSObject> o =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(res));
 
   CHECK(CcTest::heap()->InOldDataSpace(o->elements()));
   CHECK(CcTest::heap()->InOldPointerSpace(*o));
@@ skipping 14 matching lines @@
       "var number_elements = 100;"
       "var elements = new Array(number_elements);"
       "function f() {"
       "  for (var i = 0; i < number_elements; i++) {"
       "    elements[i] = [[{}, {}, {}], [1.1, 2.2, 3.3]];"
       "  }"
       "  return elements[number_elements - 1];"
       "};"
       "f(); gc();"
       "f(); f();"
-      "%OptimizeFunctionOnNextCall(f);"
+      "%%OptimizeFunctionOnNextCall(f);"
       "f();",
       AllocationSite::kPretenureMinimumCreated);
 
   v8::Local<v8::Value> res = CompileRun(source.start());
 
   v8::Local<v8::Value> int_array = v8::Object::Cast(*res)->Get(v8_str("0"));
   Handle<JSObject> int_array_handle =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(int_array));
   v8::Local<v8::Value> double_array = v8::Object::Cast(*res)->Get(v8_str("1"));
   Handle<JSObject> double_array_handle =
@@ skipping 23 matching lines @@
       "var number_elements = %d;"
       "var elements = new Array(number_elements);"
       "function f() {"
       "  for (var i = 0; i < number_elements; i++) {"
       "    elements[i] = [[{}, {}, {}],[{}, {}, {}]];"
       "  }"
       "  return elements[number_elements - 1];"
       "};"
       "f(); gc();"
       "f(); f();"
-      "%OptimizeFunctionOnNextCall(f);"
+      "%%OptimizeFunctionOnNextCall(f);"
       "f();",
       AllocationSite::kPretenureMinimumCreated);
 
   v8::Local<v8::Value> res = CompileRun(source.start());
 
   v8::Local<v8::Value> int_array_1 = v8::Object::Cast(*res)->Get(v8_str("0"));
   Handle<JSObject> int_array_handle_1 =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(int_array_1));
   v8::Local<v8::Value> int_array_2 = v8::Object::Cast(*res)->Get(v8_str("1"));
   Handle<JSObject> int_array_handle_2 =
@@ skipping 23 matching lines @@
       "var number_elements = %d;"
       "var elements = new Array(number_elements);"
       "function f() {"
       "  for (var i = 0; i < number_elements; i++) {"
       "    elements[i] = [[1.1, 1.2, 1.3],[2.1, 2.2, 2.3]];"
       "  }"
       "  return elements[number_elements - 1];"
       "};"
       "f(); gc();"
       "f(); f();"
-      "%OptimizeFunctionOnNextCall(f);"
+      "%%OptimizeFunctionOnNextCall(f);"
       "f();",
       AllocationSite::kPretenureMinimumCreated);
 
   v8::Local<v8::Value> res = CompileRun(source.start());
 
   v8::Local<v8::Value> double_array_1 =
       v8::Object::Cast(*res)->Get(v8_str("0"));
   Handle<JSObject> double_array_handle_1 =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(double_array_1));
   v8::Local<v8::Value> double_array_2 =
@@ skipping 35 matching lines @@
       "  this.b = {};"
       "}"
       "function f() {"
       "  for (var i = 0; i < number_elements; i++) {"
       "    elements[i] = new foo();"
       "  }"
       "  return elements[number_elements - 1];"
       "};"
       "f(); gc();"
       "f(); f();"
-      "%OptimizeFunctionOnNextCall(f);"
+      "%%OptimizeFunctionOnNextCall(f);"
       "f();",
       AllocationSite::kPretenureMinimumCreated);
 
   v8::Local<v8::Value> res = CompileRun(source.start());
 
   Handle<JSObject> o =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(res));
 
   CHECK(CcTest::heap()->InOldPointerSpace(*o));
 }
@@ skipping 18 matching lines @@
       "var elements = new Array(number_elements);"
       "function g() { this.a = 0; }"
       "function f() {"
       "  for (var i = 0; i < number_elements; i++) {"
       "    elements[i] = new g();"
       "  }"
       "  return elements[number_elements - 1];"
       "};"
       "f(); gc();"
       "f(); f();"
-      "%OptimizeFunctionOnNextCall(f);"
+      "%%OptimizeFunctionOnNextCall(f);"
       "f();",
       AllocationSite::kPretenureMinimumCreated);
 
   v8::Local<v8::Value> res = CompileRun(source.start());
 
   Handle<JSObject> o =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(res));
   CHECK(CcTest::heap()->InOldPointerSpace(*o));
 }
 
@@ skipping 1655 matching lines @@
       "array;");
 
   Handle<JSObject> o =
       v8::Utils::OpenHandle(*v8::Handle<v8::Object>::Cast(result));
   CHECK(heap->InOldPointerSpace(o->elements()));
   CHECK(heap->InOldPointerSpace(*o));
   Page* page = Page::FromAddress(o->elements()->address());
   CHECK(page->WasSwept() ||
         Marking::IsBlack(Marking::MarkBitFrom(o->elements())));
 }