Migrate error messages, part 3 (runtime.js).

src/runtime.js

 // Copyright 2006-2008 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 // This files contains runtime support implemented in JavaScript.
 
 // CAUTION: Some of the functions specified in this file are called
 // directly from compiled code. These are the functions with names in
 // ALL CAPS. The compiled code passes the first argument in 'this'.
 
@@ skipping 302 matching lines @@
 
 // ECMA-262, section 11.4.1, page 46.
 function DELETE(key, language_mode) {
   return %DeleteProperty(%ToObject(this), %ToName(key), language_mode);
 }
 
 
 // ECMA-262, section 11.8.7, page 54.
 function IN(x) {
   if (!IS_SPEC_OBJECT(x)) {
-    throw %MakeTypeError('invalid_in_operator_use', [this, x]);
+    throw %MakeTypeError(kInvalidInOperatorUse, this, x);
   }
   if (%_IsNonNegativeSmi(this)) {
     if (IS_ARRAY(x) && %_HasFastPackedElements(x)) {
       return this < x.length;
     }
     return %HasElement(x, this);
   }
   return %HasProperty(x, %ToName(this));
 }
 
 
 // ECMA-262, section 11.8.6, page 54. To make the implementation more
 // efficient, the return value should be zero if the 'this' is an
 // instance of F, and non-zero if not. This makes it possible to avoid
 // an expensive ToBoolean conversion in the generated code.
 function INSTANCE_OF(F) {
   var V = this;
   if (!IS_SPEC_FUNCTION(F)) {
-    throw %MakeTypeError('instanceof_function_expected', [F]);
+    throw %MakeTypeError(kInstanceofFunctionExpected, F);
   }
 
   // If V is not an object, return false.
   if (!IS_SPEC_OBJECT(V)) {
     return 1;
   }
 
   // Check if function is bound, if so, get [[BoundFunction]] from it
   // and use that instead of F.
   var bindings = %BoundFunctionGetBindings(F);
   if (bindings) {
     F = bindings[kBoundFunctionIndex];  // Always a non-bound function.
   }
   // Get the prototype of F; if it is not an object, throw an error.
   var O = F.prototype;
   if (!IS_SPEC_OBJECT(O)) {
-    throw %MakeTypeError('instanceof_nonobject_proto', [O]);
+    throw %MakeTypeError(kInstanceofNonobjectProto, O);
   }
 
   // Return whether or not O is in the prototype chain of V.
   return %IsInPrototypeChain(O, V) ? 0 : 1;
 }
 
 
 // Filter a given key against an object by checking if the object
 // has a property with the given key; return the key as a string if
 // it has. Otherwise returns 0 (smi). Used in for-in statements.
@@ skipping 52 matching lines @@
         IS_SPEC_FUNCTION(this)) {
       return length;
     }
   }
 
   length = (args == null) ? 0 : %ToUint32(args.length);
 
   // We can handle any number of apply arguments if the stack is
   // big enough, but sanity check the value to avoid overflow when
   // multiplying with pointer size.
-  if (length > kSafeArgumentsLength) {
-    throw %MakeRangeError('stack_overflow', []);
-  }
+  if (length > kSafeArgumentsLength) throw %MakeRangeError(kStackOverflow);
 
   if (!IS_SPEC_FUNCTION(this)) {
-    throw %MakeTypeError('apply_non_function',
-                         [ %ToString(this), typeof this ]);
+    throw %MakeTypeError(kApplyNonFunction, %ToString(this), typeof this);
   }
 
   // Make sure the arguments list has the right type.
   if (args != null && !IS_SPEC_OBJECT(args)) {
-    throw %MakeTypeError('apply_wrong_args', []);
+    throw %MakeTypeError(kWrongArgs, "Function.prototype.apply");
   }
 
   // Return the length which is the number of arguments to copy to the
   // stack. It is guaranteed to be a small integer at this point.
   return length;
 }
 
 
 function REFLECT_APPLY_PREPARE(args) {
   var length;
   // First check whether length is a positive Smi and args is an
   // array. This is the fast case. If this fails, we do the slow case
   // that takes care of more eventualities.
   if (IS_ARRAY(args)) {
     length = args.length;
     if (%_IsSmi(length) && length >= 0 && length < kSafeArgumentsLength &&
         IS_SPEC_FUNCTION(this)) {
       return length;
     }
   }
 
   if (!IS_SPEC_FUNCTION(this)) {
     throw %MakeTypeError(kCalledNonCallable, %ToString(this));
   }
 
   if (!IS_SPEC_OBJECT(args)) {
-    throw %MakeTypeError('reflect_apply_wrong_args', [ ]);
+    throw %MakeTypeError(kWrongArgs, "Reflect.apply");
   }
 
   length = %ToLength(args.length);
 
   // We can handle any number of apply arguments if the stack is
   // big enough, but sanity check the value to avoid overflow when
   // multiplying with pointer size.
-  if (length > kSafeArgumentsLength) {
-    throw %MakeRangeError('stack_overflow', []);
-  }
+  if (length > kSafeArgumentsLength) throw %MakeRangeError(kStackOverflow);
 
   // Return the length which is the number of arguments to copy to the
   // stack. It is guaranteed to be a small integer at this point.
   return length;
 }
 
 
 function REFLECT_CONSTRUCT_PREPARE(args, newTarget) {
   var length;
   var ctorOk = IS_SPEC_FUNCTION(this) && %IsConstructor(this);
   var newTargetOk = IS_SPEC_FUNCTION(newTarget) && %IsConstructor(newTarget);
 
   // First check whether length is a positive Smi and args is an
   // array. This is the fast case. If this fails, we do the slow case
   // that takes care of more eventualities.
   if (IS_ARRAY(args)) {
     length = args.length;
     if (%_IsSmi(length) && length >= 0 && length < kSafeArgumentsLength &&
         ctorOk && newTargetOk) {
       return length;
     }
   }
 
   if (!ctorOk) {
     if (!IS_SPEC_FUNCTION(this)) {
       throw %MakeTypeError(kCalledNonCallable, %ToString(this));
     } else {
-      throw %MakeTypeError('not_constructor', [ %ToString(this) ]);
+      throw %MakeTypeError(kNotConstructor, %ToString(this));
     }
   }
 
   if (!newTargetOk) {
     if (!IS_SPEC_FUNCTION(newTarget)) {
       throw %MakeTypeError(kCalledNonCallable, %ToString(newTarget));
     } else {
-      throw %MakeTypeError('not_constructor', [ %ToString(newTarget) ]);
+      throw %MakeTypeError(kNotConstructor, %ToString(newTarget));
     }
   }
 
   if (!IS_SPEC_OBJECT(args)) {
-    throw %MakeTypeError('reflect_construct_wrong_args', [ ]);
+    throw %MakeTypeError(kWrongArgs, "Reflect.construct");
   }
 
   length = %ToLength(args.length);
 
   // We can handle any number of apply arguments if the stack is
   // big enough, but sanity check the value to avoid overflow when
   // multiplying with pointer size.
-  if (length > kSafeArgumentsLength) {
-    throw %MakeRangeError('stack_overflow', []);
-  }
+  if (length > kSafeArgumentsLength) throw %MakeRangeError(kStackOverflow);
 
   // Return the length which is the number of arguments to copy to the
   // stack. It is guaranteed to be a small integer at this point.
   return length;
 }
 
 
 function STACK_OVERFLOW(length) {
-  throw %MakeRangeError('stack_overflow', []);
+  throw %MakeRangeError(kStackOverflow);
 }
 
 
 // Convert the receiver to an object - forward to ToObject.
 function TO_OBJECT() {
   return %ToObject(this);
 }
 
 
 // Convert the receiver to a number - forward to ToNumber.
@@ skipping 19 matching lines @@
    -------------------------------------
 */
 
 // ECMA-262, section 9.1, page 30. Use null/undefined for no hint,
 // (1) for number hint, and (2) for string hint.
 function ToPrimitive(x, hint) {
   // Fast case check.
   if (IS_STRING(x)) return x;
   // Normal behavior.
   if (!IS_SPEC_OBJECT(x)) return x;
-  if (IS_SYMBOL_WRAPPER(x)) throw MakeTypeError('symbol_to_primitive', []);
+  if (IS_SYMBOL_WRAPPER(x)) throw MakeTypeError(kSymbolToPrimitive);
   if (hint == NO_HINT) hint = (IS_DATE(x)) ? STRING_HINT : NUMBER_HINT;
   return (hint == NUMBER_HINT) ? %DefaultNumber(x) : %DefaultString(x);
 }
 
 
 // ECMA-262, section 9.2, page 30
 function ToBoolean(x) {
   if (IS_BOOLEAN(x)) return x;
   if (IS_STRING(x)) return x.length != 0;
   if (x == null) return false;
   if (IS_NUMBER(x)) return !((x == 0) || NUMBER_IS_NAN(x));
   return true;
 }
 
 
 // ECMA-262, section 9.3, page 31.
 function ToNumber(x) {
   if (IS_NUMBER(x)) return x;
   if (IS_STRING(x)) {
     return %_HasCachedArrayIndex(x) ? %_GetCachedArrayIndex(x)
                                     : %StringToNumber(x);
   }
   if (IS_BOOLEAN(x)) return x ? 1 : 0;
   if (IS_UNDEFINED(x)) return NAN;
-  if (IS_SYMBOL(x)) throw MakeTypeError('symbol_to_number', []);
+  if (IS_SYMBOL(x)) throw MakeTypeError(kSymbolToNumber);
   return (IS_NULL(x)) ? 0 : ToNumber(%DefaultNumber(x));
 }
 
 function NonNumberToNumber(x) {
   if (IS_STRING(x)) {
     return %_HasCachedArrayIndex(x) ? %_GetCachedArrayIndex(x)
                                     : %StringToNumber(x);
   }
   if (IS_BOOLEAN(x)) return x ? 1 : 0;
   if (IS_UNDEFINED(x)) return NAN;
-  if (IS_SYMBOL(x)) throw MakeTypeError('symbol_to_number', []);
+  if (IS_SYMBOL(x)) throw MakeTypeError(kSymbolToNumber);
   return (IS_NULL(x)) ? 0 : ToNumber(%DefaultNumber(x));
 }
 
 
 // ECMA-262, section 9.8, page 35.
 function ToString(x) {
   if (IS_STRING(x)) return x;
   if (IS_NUMBER(x)) return %_NumberToString(x);
   if (IS_BOOLEAN(x)) return x ? 'true' : 'false';
   if (IS_UNDEFINED(x)) return 'undefined';
-  if (IS_SYMBOL(x)) throw %MakeTypeError('symbol_to_string', []);
+  if (IS_SYMBOL(x)) throw %MakeTypeError(kSymbolToString);
   return (IS_NULL(x)) ? 'null' : %ToString(%DefaultString(x));
 }
 
 function NonStringToString(x) {
   if (IS_NUMBER(x)) return %_NumberToString(x);
   if (IS_BOOLEAN(x)) return x ? 'true' : 'false';
   if (IS_UNDEFINED(x)) return 'undefined';
-  if (IS_SYMBOL(x)) throw %MakeTypeError('symbol_to_string', []);
+  if (IS_SYMBOL(x)) throw %MakeTypeError(kSymbolToString);
   return (IS_NULL(x)) ? 'null' : %ToString(%DefaultString(x));
 }
 
 
 // ES6 symbols
 function ToName(x) {
   return IS_SYMBOL(x) ? x : %ToString(x);
 }
 
 
 // ECMA-262, section 9.9, page 36.
 function ToObject(x) {
   if (IS_STRING(x)) return new $String(x);
   if (IS_NUMBER(x)) return new $Number(x);
   if (IS_BOOLEAN(x)) return new $Boolean(x);
   if (IS_SYMBOL(x)) return %NewSymbolWrapper(x);
   if (IS_NULL_OR_UNDEFINED(x) && !IS_UNDETECTABLE(x)) {
-    throw %MakeTypeError('undefined_or_null_to_object', []);
+    throw %MakeTypeError(kUndefinedOrNullToObject);
   }
   return x;
 }
 
 
 // ECMA-262, section 9.4, page 34.
 function ToInteger(x) {
   if (%_IsSmi(x)) return x;
   return %NumberToInteger(ToNumber(x));
 }
@@ skipping 76 matching lines @@
       var v = %_CallFunction(x, valueOf);
       if (%IsPrimitive(v)) return v;
     }
 
     var toString = x.toString;
     if (IS_SPEC_FUNCTION(toString)) {
       var s = %_CallFunction(x, toString);
       if (%IsPrimitive(s)) return s;
     }
   }
-  throw %MakeTypeError('cannot_convert_to_primitive', []);
+  throw %MakeTypeError(kCannotConvertToPrimitive);
 }
 
 // ECMA-262, section 8.6.2.6, page 28.
 function DefaultString(x) {
   if (!IS_SYMBOL_WRAPPER(x)) {
     var toString = x.toString;
     if (IS_SPEC_FUNCTION(toString)) {
       var s = %_CallFunction(x, toString);
       if (%IsPrimitive(s)) return s;
     }
 
     var valueOf = x.valueOf;
     if (IS_SPEC_FUNCTION(valueOf)) {
       var v = %_CallFunction(x, valueOf);
       if (%IsPrimitive(v)) return v;
     }
   }
-  throw %MakeTypeError('cannot_convert_to_primitive', []);
+  throw %MakeTypeError(kCannotConvertToPrimitive);
 }
 
 function ToPositiveInteger(x, rangeErrorName) {
   var i = TO_INTEGER_MAP_MINUS_ZERO(x);
   if (i < 0) throw MakeRangeError(rangeErrorName);
   return i;
 }
 
 
 // NOTE: Setting the prototype for Array must take place as early as
 // possible due to code generation for array literals.  When
 // generating code for a array literal a boilerplate array is created
 // that is cloned when running the code.  It is essential that the
 // boilerplate gets the right prototype.
 %FunctionSetPrototype($Array, new $Array(0));
 
 
 /* -----------------------------------------------
    - - -   J a v a S c r i p t   S t u b s   - - -
    -----------------------------------------------
 */
 
 function STRING_LENGTH_STUB(name) {
   var receiver = this;  // implicit first parameter
   return %_StringGetLength(%_JSValueGetValue(receiver));
 }