Use >>> instead of >> in order to cover the full 32 bit range when...

tools/codemap.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 108 matching lines @@
   this.statics_.insert(start, codeEntry);
 };
 
 
 /**
  * @private
  */
 devtools.profiler.CodeMap.prototype.markPages_ = function(start, end) {
   for (var addr = start; addr <= end;
        addr += devtools.profiler.CodeMap.PAGE_SIZE) {
-    this.pages_[addr >> devtools.profiler.CodeMap.PAGE_ALIGNMENT] = 1;
+    this.pages_[addr >>> devtools.profiler.CodeMap.PAGE_ALIGNMENT] = 1;
   }
 };
 
 
 /**
  * @private
  */
 devtools.profiler.CodeMap.prototype.isAddressBelongsTo_ = function(addr, node) {
   return addr >= node.key && addr < (node.key + node.value.size);
 };
 
 
 /**
  * @private
  */
 devtools.profiler.CodeMap.prototype.findInTree_ = function(tree, addr) {
   var node = tree.findGreatestLessThan(addr);
   return node && this.isAddressBelongsTo_(addr, node) ? node.value : null;
 };
 
 
 /**
  * Finds a code entry that contains the specified address. Both static and
  * dynamic code entries are considered.
  *
  * @param {number} addr Address.
  */
 devtools.profiler.CodeMap.prototype.findEntry = function(addr) {
-  var pageAddr = addr >> devtools.profiler.CodeMap.PAGE_ALIGNMENT;
+  var pageAddr = addr >>> devtools.profiler.CodeMap.PAGE_ALIGNMENT;
   if (pageAddr in this.pages_) {
     return this.findInTree_(this.statics_, addr);
   }
   var min = this.dynamics_.findMin();
   var max = this.dynamics_.findMax();
   if (max != null && addr < (max.key + max.value.size) && addr >= min.key) {
     var dynaEntry = this.findInTree_(this.dynamics_, addr);
     if (dynaEntry == null) return null;
     // Dedupe entry name.
     if (!dynaEntry.nameUpdated_) {
@@ skipping 52 matching lines @@
 
 
 devtools.profiler.CodeMap.NameGenerator.prototype.getName = function(name) {
   if (!(name in this.knownNames_)) {
     this.knownNames_[name] = 0;
     return name;
   }
   var count = ++this.knownNames_[name];
   return name + ' {' + count + '}';
 };