Shorten constructor names in JS tickprocessor.

test/mjsunit/tools/profile_view.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 12 matching lines @@
 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 // Load source code files from <project root>/tools.
 // Files: tools/consarray.js tools/profile.js tools/profile_view.js
 
 
 function createNode(name, time, opt_parent) {
-  var node = new devtools.profiler.ProfileView.Node(name, time, time, null);
+  var node = new ProfileView.Node(name, time, time, null);
   if (opt_parent) {
     opt_parent.addChild(node);
   }
   return node;
 }
 
 
 (function testSorting() {
    //
    // Build a tree:
@@ skipping 10 matching lines @@
    createNode('a', 2, root);
    var a1 = createNode('a', 1, root);
    createNode('c', 1, root);
    var b3 = createNode('b', 3, a1);
    createNode('c', 1, a1);
    createNode('b', 2, a1);
    createNode('c', 5, b3);
    createNode('d', 4, b3);
    createNode('d', 2, b3);
 
-   var view = new devtools.profiler.ProfileView(root);
+   var view = new ProfileView(root);
    var flatTree = [];
 
    function fillFlatTree(node) {
      flatTree.push(node.internalFuncName);
      flatTree.push(node.selfTime);
    }
 
    view.traverse(fillFlatTree);
    assertEquals(
      ['root', 0,
@@ skipping 11 matching lines @@
    });
 
    flatTree = [];
    view.traverse(fillFlatTree);
    assertEquals(
      ['root', 0,
       'a', 1, 'a', 2, 'c', 1,
       'b', 2, 'b', 3, 'c', 1,
       'c', 5, 'd', 2, 'd', 4], flatTree);
 })();