Implement Object.prototype.hasOwnProperty in generated code.

src/array.js

 // Copyright 2010 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 215 matching lines @@
   for (var k = 0; k < length; k++) {
     var key = intervals[k];
     if (key < 0) {
       var j = -1 - key;
       var interval_limit = j + intervals[++k];
       if (j < start_i) {
         j = start_i;
       }
       for (; j < interval_limit; j++) {
         // ECMA-262 15.4.4.12 line 10.  The spec could also be
-        // interpreted such that %HasLocalProperty would be the
+        // interpreted such that %HasOwnProperty would be the
         // appropriate test.  We follow KJS in consulting the
         // prototype.
         var current = array[j];
         if (!IS_UNDEFINED(current) || j in array) {
           deleted_elements[j - start_i] = current;
         }
       }
     } else {
       if (!IS_UNDEFINED(key)) {
         if (key >= start_i) {
           // ECMA-262 15.4.4.12 line 10.  The spec could also be
-          // interpreted such that %HasLocalProperty would be the
+          // interpreted such that %HasOwnProperty would be the
           // appropriate test.  We follow KJS in consulting the
           // prototype.
           var current = array[key];
           if (!IS_UNDEFINED(current) || key in array) {
             deleted_elements[key - start_i] = current;
           }
         }
       }
     }
   }
 }
 
 
 // This function implements the optimized splice implementation that can use
 // special array operations to handle sparse arrays in a sensible fashion.
 function SmartMove(array, start_i, del_count, len, num_additional_args) {
   // Move data to new array.
   var new_array = new InternalArray(len - del_count + num_additional_args);
   var intervals = %GetArrayKeys(array, len);
   var length = intervals.length;
   for (var k = 0; k < length; k++) {
     var key = intervals[k];
     if (key < 0) {
       var j = -1 - key;
       var interval_limit = j + intervals[++k];
       while (j < start_i && j < interval_limit) {
         // The spec could also be interpreted such that
-        // %HasLocalProperty would be the appropriate test.  We follow
+        // %HasOwnProperty would be the appropriate test.  We follow
         // KJS in consulting the prototype.
         var current = array[j];
         if (!IS_UNDEFINED(current) || j in array) {
           new_array[j] = current;
         }
         j++;
       }
       j = start_i + del_count;
       while (j < interval_limit) {
         // ECMA-262 15.4.4.12 lines 24 and 41.  The spec could also be
-        // interpreted such that %HasLocalProperty would be the
+        // interpreted such that %HasOwnProperty would be the
         // appropriate test.  We follow KJS in consulting the
         // prototype.
         var current = array[j];
         if (!IS_UNDEFINED(current) || j in array) {
           new_array[j - del_count + num_additional_args] = current;
         }
         j++;
       }
     } else {
       if (!IS_UNDEFINED(key)) {
         if (key < start_i) {
           // The spec could also be interpreted such that
-          // %HasLocalProperty would be the appropriate test.  We follow
+          // %HasOwnProperty would be the appropriate test.  We follow
           // KJS in consulting the prototype.
           var current = array[key];
           if (!IS_UNDEFINED(current) || key in array) {
             new_array[key] = current;
           }
         } else if (key >= start_i + del_count) {
           // ECMA-262 15.4.4.12 lines 24 and 41.  The spec could also
-          // be interpreted such that %HasLocalProperty would be the
+          // be interpreted such that %HasOwnProperty would be the
           // appropriate test.  We follow KJS in consulting the
           // prototype.
           var current = array[key];
           if (!IS_UNDEFINED(current) || key in array) {
             new_array[key - del_count + num_additional_args] = current;
           }
         }
       }
     }
   }
   // Move contents of new_array into this array
   %MoveArrayContents(new_array, array);
 }
 
 
 // This is part of the old simple-minded splice.  We are using it either
 // because the receiver is not an array (so we have no choice) or because we
 // know we are not deleting or moving a lot of elements.
 function SimpleSlice(array, start_i, del_count, len, deleted_elements) {
   for (var i = 0; i < del_count; i++) {
     var index = start_i + i;
-    // The spec could also be interpreted such that %HasLocalProperty
+    // The spec could also be interpreted such that %HasOwnProperty
     // would be the appropriate test.  We follow KJS in consulting the
     // prototype.
     var current = array[index];
     if (!IS_UNDEFINED(current) || index in array)
       deleted_elements[i] = current;
   }
 }
 
 
 function SimpleMove(array, start_i, del_count, len, num_additional_args) {
   if (num_additional_args !== del_count) {
     // Move the existing elements after the elements to be deleted
     // to the right position in the resulting array.
     if (num_additional_args > del_count) {
       for (var i = len - del_count; i > start_i; i--) {
         var from_index = i + del_count - 1;
         var to_index = i + num_additional_args - 1;
         // The spec could also be interpreted such that
-        // %HasLocalProperty would be the appropriate test.  We follow
+        // %HasOwnProperty would be the appropriate test.  We follow
         // KJS in consulting the prototype.
         var current = array[from_index];
         if (!IS_UNDEFINED(current) || from_index in array) {
           array[to_index] = current;
         } else {
           delete array[to_index];
         }
       }
     } else {
       for (var i = start_i; i < len - del_count; i++) {
         var from_index = i + del_count;
         var to_index = i + num_additional_args;
         // The spec could also be interpreted such that
-        // %HasLocalProperty would be the appropriate test.  We follow
+        // %HasOwnProperty would be the appropriate test.  We follow
         // KJS in consulting the prototype.
         var current = array[from_index];
         if (!IS_UNDEFINED(current) || from_index in array) {
           array[to_index] = current;
         } else {
           delete array[to_index];
         }
       }
       for (var i = len; i > len - del_count + num_additional_args; i--) {
         delete array[i - 1];
@@ skipping 986 matching lines @@
   InternalArray.prototype.join = getFunction("join", ArrayJoin);
   InternalArray.prototype.pop = getFunction("pop", ArrayPop);
   InternalArray.prototype.push = getFunction("push", ArrayPush);
   InternalArray.prototype.toString = function() {
     return "Internal Array, length " + this.length;
   };
 }
 
 
 SetupArray();