Upgrade V8 Benchmark from v4 to v6.

chrome/test/data/v8_benchmark/splay.js

 // Copyright 2009 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 15 matching lines @@
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 // This benchmark is based on a JavaScript log processing module used
 // by the V8 profiler to generate execution time profiles for runs of
 // JavaScript applications, and it effectively measures how fast the
 // JavaScript engine is at allocating nodes and reclaiming the memory
 // used for old nodes. Because of the way splay trees work, the engine
 // also has to deal with a lot of changes to the large tree object
 // graph.
 
-var Splay = new BenchmarkSuite('Splay', 126125, [
+var Splay = new BenchmarkSuite('Splay', 81491, [
   new Benchmark("Splay", SplayRun, SplaySetup, SplayTearDown)
 ]);
 
 
 // Configuration.
 var kSplayTreeSize = 8000;
 var kSplayTreeModifications = 80;
 var kSplayTreePayloadDepth = 5;
 
 var splayTree = null;
 
 
-function GeneratePayloadTree(depth, key) {
+function GeneratePayloadTree(depth, tag) {
   if (depth == 0) {
     return {
       array  : [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ],
-      string : 'String for key ' + key + ' in leaf node'
+      string : 'String for key ' + tag + ' in leaf node'
     };
   } else {
     return {
-      left:  GeneratePayloadTree(depth - 1, key),
-      right: GeneratePayloadTree(depth - 1, key)
+      left:  GeneratePayloadTree(depth - 1, tag),
+      right: GeneratePayloadTree(depth - 1, tag)
     };
   }
 }
 
 
 function GenerateKey() {
   // The benchmark framework guarantees that Math.random is
   // deterministic; see base.js.
   return Math.random();
 }
 
 
 function InsertNewNode() {
   // Insert new node with a unique key.
   var key;
   do {
     key = GenerateKey();
   } while (splayTree.find(key) != null);
-  splayTree.insert(key, GeneratePayloadTree(kSplayTreePayloadDepth, key));
+  var payload = GeneratePayloadTree(kSplayTreePayloadDepth, String(key));
+  splayTree.insert(key, payload);
   return key;
 }
 
 
 
 function SplaySetup() {
   splayTree = new SplayTree();
   for (var i = 0; i < kSplayTreeSize; i++) InsertNewNode();
 }
 
@@ skipping 135 matching lines @@
 SplayTree.prototype.find = function(key) {
   if (this.isEmpty()) {
     return null;
   }
   this.splay_(key);
   return this.root_.key == key ? this.root_ : null;
 };
 
 
 /**
+ * @return {SplayTree.Node} Node having the maximum key value.
+ */
+SplayTree.prototype.findMax = function(opt_startNode) {
+  if (this.isEmpty()) {
+    return null;
+  }
+  var current = opt_startNode || this.root_;
+  while (current.right) {
+    current = current.right;
+  }
+  return current;
+};
+
+
+/**
  * @return {SplayTree.Node} Node having the maximum key value that
- *     is less or equal to the specified key value.
+ *     is less than the specified key value.
  */
 SplayTree.prototype.findGreatestLessThan = function(key) {
   if (this.isEmpty()) {
     return null;
   }
   // Splay on the key to move the node with the given key or the last
   // node on the search path to the top of the tree.
   this.splay_(key);
   // Now the result is either the root node or the greatest node in
   // the left subtree.
-  if (this.root_.key <= key) {
+  if (this.root_.key < key) {
     return this.root_;
   } else if (this.root_.left) {
     return this.findMax(this.root_.left);
   } else {
     return null;
   }
 };
 
 
 /**
@@ skipping 113 matching lines @@
  */
 SplayTree.Node.prototype.traverse_ = function(f) {
   var current = this;
   while (current) {
     var left = current.left;
     if (left) left.traverse_(f);
     f(current);
     current = current.right;
   }
 };