Revision: 10407
Author: [email protected]
Date: Mon Jan 16 04:38:59 2012
Log: More spelling changes.
Review URL: http://codereview.chromium.org/9231009
http://code.google.com/p/v8/source/detail?r=10407
Modified:
/branches/bleeding_edge/src/arm/code-stubs-arm.cc
/branches/bleeding_edge/src/arm/constants-arm.h
/branches/bleeding_edge/src/arm/disasm-arm.cc
/branches/bleeding_edge/src/arm/full-codegen-arm.cc
/branches/bleeding_edge/src/arm/lithium-codegen-arm.cc
/branches/bleeding_edge/src/arm/macro-assembler-arm.cc
/branches/bleeding_edge/src/arm/macro-assembler-arm.h
/branches/bleeding_edge/src/arm/stub-cache-arm.cc
/branches/bleeding_edge/src/array.js
/branches/bleeding_edge/src/assembler.h
/branches/bleeding_edge/src/bignum-dtoa.h
/branches/bleeding_edge/src/dtoa.h
/branches/bleeding_edge/src/execution.cc
/branches/bleeding_edge/src/factory.h
/branches/bleeding_edge/src/full-codegen.h
/branches/bleeding_edge/src/global-handles.cc
/branches/bleeding_edge/src/heap.cc
/branches/bleeding_edge/src/heap.h
/branches/bleeding_edge/src/ia32/code-stubs-ia32.cc
/branches/bleeding_edge/src/ia32/full-codegen-ia32.cc
/branches/bleeding_edge/src/ia32/macro-assembler-ia32.cc
/branches/bleeding_edge/src/ia32/macro-assembler-ia32.h
/branches/bleeding_edge/src/ia32/regexp-macro-assembler-ia32.cc
/branches/bleeding_edge/src/ia32/stub-cache-ia32.cc
/branches/bleeding_edge/src/isolate.cc
/branches/bleeding_edge/src/isolate.h
/branches/bleeding_edge/src/json-parser.h
/branches/bleeding_edge/src/jsregexp.cc
/branches/bleeding_edge/src/jsregexp.h
/branches/bleeding_edge/src/list.h
/branches/bleeding_edge/src/liveedit-debugger.js
/branches/bleeding_edge/src/liveobjectlist.cc
/branches/bleeding_edge/src/macros.py
/branches/bleeding_edge/src/mark-compact.cc
/branches/bleeding_edge/src/mark-compact.h
/branches/bleeding_edge/src/mips/assembler-mips.h
/branches/bleeding_edge/src/mips/builtins-mips.cc
/branches/bleeding_edge/src/mips/code-stubs-mips.cc
/branches/bleeding_edge/src/mips/constants-mips.cc
/branches/bleeding_edge/src/mips/constants-mips.h
/branches/bleeding_edge/src/mips/full-codegen-mips.cc
/branches/bleeding_edge/src/mips/lithium-codegen-mips.cc
/branches/bleeding_edge/src/mips/macro-assembler-mips.cc
/branches/bleeding_edge/src/mips/macro-assembler-mips.h
/branches/bleeding_edge/src/mips/simulator-mips.cc
/branches/bleeding_edge/src/mips/stub-cache-mips.cc
/branches/bleeding_edge/src/objects-printer.cc
/branches/bleeding_edge/src/objects.cc
/branches/bleeding_edge/src/objects.h
/branches/bleeding_edge/src/parser.cc
/branches/bleeding_edge/src/parser.h
/branches/bleeding_edge/src/platform-cygwin.cc
/branches/bleeding_edge/src/platform-freebsd.cc
/branches/bleeding_edge/src/platform-linux.cc
/branches/bleeding_edge/src/platform-macos.cc
/branches/bleeding_edge/src/platform-openbsd.cc
/branches/bleeding_edge/src/platform-solaris.cc
/branches/bleeding_edge/src/platform-win32.cc
/branches/bleeding_edge/src/regexp-macro-assembler.cc
/branches/bleeding_edge/src/regexp.js
/branches/bleeding_edge/src/runtime.cc
/branches/bleeding_edge/src/serialize.h
/branches/bleeding_edge/src/spaces-inl.h
/branches/bleeding_edge/src/spaces.h
/branches/bleeding_edge/src/unicode.cc
/branches/bleeding_edge/src/v8threads.cc
/branches/bleeding_edge/src/v8utils.cc
/branches/bleeding_edge/src/x64/code-stubs-x64.cc
/branches/bleeding_edge/src/x64/full-codegen-x64.cc
/branches/bleeding_edge/src/x64/macro-assembler-x64.cc
/branches/bleeding_edge/src/x64/macro-assembler-x64.h
/branches/bleeding_edge/src/x64/regexp-macro-assembler-x64.cc
/branches/bleeding_edge/src/x64/stub-cache-x64.cc
=======================================
--- /branches/bleeding_edge/src/arm/code-stubs-arm.cc Mon Jan 16 01:46:21
2012
+++ /branches/bleeding_edge/src/arm/code-stubs-arm.cc Mon Jan 16 04:38:59
2012
@@ -5821,7 +5821,7 @@
__ b(eq, &return_r0);
Label result_longer_than_two;
- // Check for special case of two character ascii string, in which case
+ // Check for special case of two character ASCII string, in which case
// we do a lookup in the symbol table first.
__ cmp(r2, Operand(2));
__ b(gt, &result_longer_than_two);
@@ -5951,7 +5951,7 @@
__ tst(r1, Operand(kStringEncodingMask));
__ b(eq, &two_byte_sequential);
- // Allocate and copy the resulting ascii string.
+ // Allocate and copy the resulting ASCII string.
__ AllocateAsciiString(r0, r2, r4, r6, r7, &runtime);
// Locate first character of substring to copy.
=======================================
--- /branches/bleeding_edge/src/arm/constants-arm.h Tue Nov 29 02:56:11 2011
+++ /branches/bleeding_edge/src/arm/constants-arm.h Mon Jan 16 04:38:59 2012
@@ -573,13 +573,13 @@
// The naming of these accessor corresponds to figure A3-1.
//
// Two kind of accessors are declared:
- // - <Name>Field() will return the raw field, ie the field's bits at
their
+ // - <Name>Field() will return the raw field, i.e. the field's bits at
their
// original place in the instruction encoding.
- // eg. if instr is the 'addgt r0, r1, r2' instruction, encoded as
0xC0810002
- // ConditionField(instr) will return 0xC0000000.
+ // e.g. if instr is the 'addgt r0, r1, r2' instruction, encoded as
+ // 0xC0810002 ConditionField(instr) will return 0xC0000000.
// - <Name>Value() will return the field value, shifted back to bit 0.
- // eg. if instr is the 'addgt r0, r1, r2' instruction, encoded as
0xC0810002
- // ConditionField(instr) will return 0xC.
+ // e.g. if instr is the 'addgt r0, r1, r2' instruction, encoded as
+ // 0xC0810002 ConditionField(instr) will return 0xC.
// Generally applicable fields
=======================================
--- /branches/bleeding_edge/src/arm/disasm-arm.cc Fri Aug 5 04:32:46 2011
+++ /branches/bleeding_edge/src/arm/disasm-arm.cc Mon Jan 16 04:38:59 2012
@@ -473,7 +473,7 @@
return 1;
}
case 'i': { // 'i: immediate value from adjacent bits.
- // Expects tokens in the form imm%02d@%02d, ie. imm05@07, imm10@16
+ // Expects tokens in the form imm%02d@%02d, i.e. imm05@07, imm10@16
int width = (format[3] - '0') * 10 + (format[4] - '0');
int lsb = (format[6] - '0') * 10 + (format[7] - '0');
=======================================
--- /branches/bleeding_edge/src/arm/full-codegen-arm.cc Fri Jan 13 05:09:52
2012
+++ /branches/bleeding_edge/src/arm/full-codegen-arm.cc Mon Jan 16 04:38:59
2012
@@ -115,7 +115,7 @@
// function.
//
// The live registers are:
-// o r1: the JS function object being called (ie, ourselves)
+// o r1: the JS function object being called (i.e., ourselves)
// o cp: our context
// o fp: our caller's frame pointer
// o sp: stack pointer
@@ -3618,7 +3618,7 @@
// One-character separator case
__ bind(&one_char_separator);
- // Replace separator with its ascii character value.
+ // Replace separator with its ASCII character value.
__ ldrb(separator, FieldMemOperand(separator,
SeqAsciiString::kHeaderSize));
// Jump into the loop after the code that copies the separator, so the
first
// element is not preceded by a separator
@@ -3629,7 +3629,7 @@
// result_pos: the position to which we are currently copying
characters.
// element: Current array element.
// elements_end: Array end.
- // separator: Single separator ascii char (in lower byte).
+ // separator: Single separator ASCII char (in lower byte).
// Copy the separator character to the result.
__ strb(separator, MemOperand(result_pos, 1, PostIndex));
=======================================
--- /branches/bleeding_edge/src/arm/lithium-codegen-arm.cc Fri Jan 13
05:09:52 2012
+++ /branches/bleeding_edge/src/arm/lithium-codegen-arm.cc Mon Jan 16
04:38:59 2012
@@ -262,7 +262,7 @@
bool LCodeGen::GenerateDeoptJumpTable() {
// Check that the jump table is accessible from everywhere in the
function
- // code, ie that offsets to the table can be encoded in the 24bit signed
+ // code, i.e. that offsets to the table can be encoded in the 24bit
signed
// immediate of a branch instruction.
// To simplify we consider the code size from the first instruction to
the
// end of the jump table. We also don't consider the pc load delta.
=======================================
--- /branches/bleeding_edge/src/arm/macro-assembler-arm.cc Mon Jan 16
01:44:35 2012
+++ /branches/bleeding_edge/src/arm/macro-assembler-arm.cc Mon Jan 16
04:38:59 2012
@@ -2387,7 +2387,7 @@
b(gt, not_int32);
// We know the exponent is smaller than 30 (biased). If it is less
than
- // 0 (biased) then the number is smaller in magnitude than 1.0 * 2^0,
ie
+ // 0 (biased) then the number is smaller in magnitude than 1.0 * 2^0,
i.e.
// it rounds to zero.
const uint32_t zero_exponent = HeapNumber::kExponentBias + 0;
sub(scratch2, scratch2, Operand(zero_exponent - fudge_factor), SetCC);
=======================================
--- /branches/bleeding_edge/src/arm/macro-assembler-arm.h Fri Jan 13
05:09:52 2012
+++ /branches/bleeding_edge/src/arm/macro-assembler-arm.h Mon Jan 16
04:38:59 2012
@@ -243,7 +243,7 @@
Register scratch3,
Label* object_is_white_and_not_data);
- // Detects conservatively whether an object is data-only, ie it does
need to
+ // Detects conservatively whether an object is data-only, i.e. it does
need to
// be scanned by the garbage collector.
void JumpIfDataObject(Register value,
Register scratch,
@@ -606,7 +606,7 @@
}
// Check if the given instruction is a 'type' marker.
- // ie. check if is is a mov r<type>, r<type> (referenced as nop(type))
+ // i.e. check if is is a mov r<type>, r<type> (referenced as nop(type))
// These instructions are generated to mark special location in the code,
// like some special IC code.
static inline bool IsMarkedCode(Instr instr, int type) {
@@ -810,7 +810,7 @@
// Check if the map of an object is equal to a specified map and branch
to
// label if not. Skip the smi check if not required (object is known to
be a
// heap object). If mode is ALLOW_ELEMENT_TRANSITION_MAPS, then also
match
- // against maps that are ElementsKind transition maps of the specificed
map.
+ // against maps that are ElementsKind transition maps of the specified
map.
void CheckMap(Register obj,
Register scratch,
Handle<Map> map,
@@ -908,7 +908,7 @@
// Truncates a double using a specific rounding mode.
// Clears the z flag (ne condition) if an overflow occurs.
// If exact_conversion is true, the z flag is also cleared if the
conversion
- // was inexact, ie. if the double value could not be converted exactly
+ // was inexact, i.e. if the double value could not be converted exactly
// to a 32bit integer.
void EmitVFPTruncate(VFPRoundingMode rounding_mode,
SwVfpRegister result,
@@ -1025,7 +1025,7 @@
// Calls an API function. Allocates HandleScope, extracts returned value
// from handle and propagates exceptions. Restores context. stack_space
- // - space to be unwound on exit (includes the call js arguments space
and
+ // - space to be unwound on exit (includes the call JS arguments space
and
// the additional space allocated for the fast call).
void CallApiFunctionAndReturn(ExternalReference function, int
stack_space);
=======================================
--- /branches/bleeding_edge/src/arm/stub-cache-arm.cc Fri Jan 13 05:09:52
2012
+++ /branches/bleeding_edge/src/arm/stub-cache-arm.cc Mon Jan 16 04:38:59
2012
@@ -562,11 +562,11 @@
int argc) {
// ----------- S t a t e -------------
// -- sp[0] : holder (set by CheckPrototypes)
- // -- sp[4] : callee js function
+ // -- sp[4] : callee JS function
// -- sp[8] : call data
- // -- sp[12] : last js argument
+ // -- sp[12] : last JS argument
// -- ...
- // -- sp[(argc + 3) * 4] : first js argument
+ // -- sp[(argc + 3) * 4] : first JS argument
// -- sp[(argc + 4) * 4] : receiver
// -----------------------------------
// Get the function and setup the context.
@@ -583,7 +583,7 @@
} else {
__ Move(r6, call_data);
}
- // Store js function and call data.
+ // Store JS function and call data.
__ stm(ib, sp, r5.bit() | r6.bit());
// r2 points to call data as expected by Arguments
@@ -1983,7 +1983,7 @@
__ vmrs(r3);
// Set custom FPCSR:
// - Set rounding mode to "Round towards Minus Infinity"
- // (ie bits [23:22] = 0b10).
+ // (i.e. bits [23:22] = 0b10).
// - Clear vfp cumulative exception flags (bits [3:0]).
// - Make sure Flush-to-zero mode control bit is unset (bit 22).
__ bic(r9, r3,
=======================================
--- /branches/bleeding_edge/src/array.js Mon Nov 28 04:11:00 2011
+++ /branches/bleeding_edge/src/array.js Mon Jan 16 04:38:59 2012
@@ -204,7 +204,7 @@
if (IS_NULL_OR_UNDEFINED(e)) {
return '';
} else {
- // According to ES5, seciton 15.4.4.3, the toLocaleString conversion
+ // According to ES5, section 15.4.4.3, the toLocaleString conversion
// must throw a TypeError if ToObject(e).toLocaleString isn't
// callable.
var e_obj = ToObject(e);
=======================================
--- /branches/bleeding_edge/src/assembler.h Fri Jan 13 05:09:52 2012
+++ /branches/bleeding_edge/src/assembler.h Mon Jan 16 04:38:59 2012
@@ -271,7 +271,7 @@
INLINE(void apply(intptr_t delta));
// Is the pointer this relocation info refers to coded like a plain
pointer
- // or is it strange in some way (eg relative or patched into a series of
+ // or is it strange in some way (e.g. relative or patched into a series
of
// instructions).
bool IsCodedSpecially();
=======================================
--- /branches/bleeding_edge/src/bignum-dtoa.h Tue Dec 7 03:01:02 2010
+++ /branches/bleeding_edge/src/bignum-dtoa.h Mon Jan 16 04:38:59 2012
@@ -44,7 +44,7 @@
BIGNUM_DTOA_PRECISION
};
-// Converts the given double 'v' to ascii.
+// Converts the given double 'v' to ASCII.
// The result should be interpreted as buffer * 10^(point-length).
// The buffer will be null-terminated.
//
=======================================
--- /branches/bleeding_edge/src/dtoa.h Tue Nov 29 02:56:11 2011
+++ /branches/bleeding_edge/src/dtoa.h Mon Jan 16 04:38:59 2012
@@ -49,7 +49,7 @@
// be at least kBase10MaximalLength + 1 characters long.
const int kBase10MaximalLength = 17;
-// Converts the given double 'v' to ascii.
+// Converts the given double 'v' to ASCII.
// The result should be interpreted as buffer * 10^(point-length).
//
// The output depends on the given mode:
=======================================
--- /branches/bleeding_edge/src/execution.cc Mon Jan 16 01:46:21 2012
+++ /branches/bleeding_edge/src/execution.cc Mon Jan 16 04:38:59 2012
@@ -356,7 +356,7 @@
void StackGuard::SetStackLimit(uintptr_t limit) {
ExecutionAccess access(isolate_);
- // If the current limits are special (eg due to a pending interrupt) then
+ // If the current limits are special (e.g. due to a pending interrupt)
then
// leave them alone.
uintptr_t jslimit = SimulatorStack::JsLimitFromCLimit(isolate_, limit);
if (thread_local_.jslimit_ == thread_local_.real_jslimit_) {
=======================================
--- /branches/bleeding_edge/src/factory.h Mon Jan 16 01:44:35 2012
+++ /branches/bleeding_edge/src/factory.h Mon Jan 16 04:38:59 2012
@@ -233,7 +233,7 @@
Handle<FixedDoubleArray> CopyFixedDoubleArray(
Handle<FixedDoubleArray> array);
- // Numbers (eg, literals) are pretenured by the parser.
+ // Numbers (e.g. literals) are pretenured by the parser.
Handle<Object> NewNumber(double value,
PretenureFlag pretenure = NOT_TENURED);
=======================================
--- /branches/bleeding_edge/src/full-codegen.h Wed Nov 30 10:04:12 2011
+++ /branches/bleeding_edge/src/full-codegen.h Mon Jan 16 04:38:59 2012
@@ -618,8 +618,8 @@
Label** if_false,
Label** fall_through) const = 0;
- // Returns true if we are evaluating only for side effects (ie if the
result
- // will be discarded).
+ // Returns true if we are evaluating only for side effects (i.e. if the
+ // result will be discarded).
virtual bool IsEffect() const { return false; }
// Returns true if we are evaluating for the value (in accu/on stack).
=======================================
--- /branches/bleeding_edge/src/global-handles.cc Mon Jun 6 09:18:59 2011
+++ /branches/bleeding_edge/src/global-handles.cc Mon Jan 16 04:38:59 2012
@@ -232,7 +232,7 @@
VMState state(isolate, EXTERNAL);
func(object, par);
}
- // Absense of explicit cleanup or revival of weak handle
+ // Absence of explicit cleanup or revival of weak handle
// in most of the cases would lead to memory leak.
ASSERT(state_ != NEAR_DEATH);
return true;
=======================================
--- /branches/bleeding_edge/src/heap.cc Mon Jan 16 01:44:35 2012
+++ /branches/bleeding_edge/src/heap.cc Mon Jan 16 04:38:59 2012
@@ -2923,8 +2923,8 @@
bool is_ascii_data_in_two_byte_string = false;
if (!is_ascii) {
// At least one of the strings uses two-byte representation so we
- // can't use the fast case code for short ascii strings below, but
- // we can try to save memory if all chars actually fit in ascii.
+ // can't use the fast case code for short ASCII strings below, but
+ // we can try to save memory if all chars actually fit in ASCII.
is_ascii_data_in_two_byte_string =
first->HasOnlyAsciiChars() && second->HasOnlyAsciiChars();
if (is_ascii_data_in_two_byte_string) {
@@ -3635,8 +3635,8 @@
// TODO(1240798): Initialize the object's body using valid initial values
// according to the object's initial map. For example, if the map's
// instance type is JS_ARRAY_TYPE, the length field should be initialized
- // to a number (eg, Smi::FromInt(0)) and the elements initialized to a
- // fixed array (eg, Heap::empty_fixed_array()). Currently, the object
+ // to a number (e.g. Smi::FromInt(0)) and the elements initialized to a
+ // fixed array (e.g. Heap::empty_fixed_array()). Currently, the object
// verification code has to cope with (temporarily) invalid objects. See
// for example, JSArray::JSArrayVerify).
Object* filler;
@@ -4103,7 +4103,7 @@
ASSERT(chars >= 0);
// Ensure the chars matches the number of characters in the buffer.
ASSERT(static_cast<unsigned>(chars) == buffer->Length());
- // Determine whether the string is ascii.
+ // Determine whether the string is ASCII.
bool is_ascii = true;
while (buffer->has_more()) {
if (buffer->GetNext() > unibrow::Utf8::kMaxOneByteChar) {
@@ -5596,7 +5596,7 @@
// goes wrong, just return false. The caller should check the results and
// call Heap::TearDown() to release allocated memory.
//
- // If the heap is not yet configured (eg, through the API), configure it.
+ // If the heap is not yet configured (e.g. through the API), configure
it.
// Configuration is based on the flags new-space-size (really the
semispace
// size) and old-space-size if set or the initial values of
semispace_size_
// and old_generation_size_ otherwise.
=======================================
--- /branches/bleeding_edge/src/heap.h Mon Jan 16 01:44:35 2012
+++ /branches/bleeding_edge/src/heap.h Mon Jan 16 04:38:59 2012
@@ -690,7 +690,7 @@
PretenureFlag pretenure = NOT_TENURED);
// Computes a single character string where the character has code.
- // A cache is used for ascii codes.
+ // A cache is used for ASCII codes.
// Returns Failure::RetryAfterGC(requested_bytes, space) if the
allocation
// failed. Please note this does not perform a garbage collection.
MUST_USE_RESULT MaybeObject* LookupSingleCharacterStringFromCode(
@@ -2376,7 +2376,7 @@
intptr_t start_size_; // Size of objects in heap set in constructor.
GarbageCollector collector_; // Type of collector.
- // A count (including this one, eg, the first collection is 1) of the
+ // A count (including this one, e.g. the first collection is 1) of the
// number of garbage collections.
unsigned int gc_count_;
=======================================
--- /branches/bleeding_edge/src/ia32/code-stubs-ia32.cc Fri Jan 13 05:09:52
2012
+++ /branches/bleeding_edge/src/ia32/code-stubs-ia32.cc Mon Jan 16 04:38:59
2012
@@ -749,7 +749,7 @@
// Exponent word in scratch, exponent part of exponent word in
scratch2.
// Zero in ecx.
// We know the exponent is smaller than 30 (biased). If it is less
than
- // 0 (biased) then the number is smaller in magnitude than 1.0 * 2^0,
ie
+ // 0 (biased) then the number is smaller in magnitude than 1.0 * 2^0,
i.e.
// it rounds to zero.
const uint32_t zero_exponent =
(HeapNumber::kExponentBias + 0) << HeapNumber::kExponentShift;
@@ -3723,7 +3723,7 @@
kShortExternalStringMask);
STATIC_ASSERT((kStringTag | kSeqStringTag | kTwoByteStringTag) == 0);
__ j(zero, &seq_two_byte_string, Label::kNear);
- // Any other flat string must be a flat ascii string. None of the
following
+ // Any other flat string must be a flat ASCII string. None of the
following
// string type tests will succeed if subject is not a string or a short
// external string.
__ and_(ebx, Immediate(kIsNotStringMask |
@@ -3772,16 +3772,16 @@
kStringRepresentationMask | kStringEncodingMask);
STATIC_ASSERT((kSeqStringTag | kTwoByteStringTag) == 0);
__ j(zero, &seq_two_byte_string, Label::kNear);
- // Any other flat string must be sequential ascii or external.
+ // Any other flat string must be sequential ASCII or external.
__ test_b(FieldOperand(ebx, Map::kInstanceTypeOffset),
kStringRepresentationMask);
__ j(not_zero, &external_string);
__ bind(&seq_ascii_string);
- // eax: subject string (flat ascii)
+ // eax: subject string (flat ASCII)
// ecx: RegExp data (FixedArray)
__ mov(edx, FieldOperand(ecx, JSRegExp::kDataAsciiCodeOffset));
- __ Set(ecx, Immediate(1)); // Type is ascii.
+ __ Set(ecx, Immediate(1)); // Type is ASCII.
__ jmp(&check_code, Label::kNear);
__ bind(&seq_two_byte_string);
@@ -3798,7 +3798,7 @@
// eax: subject string
// edx: code
- // ecx: encoding of subject string (1 if ascii, 0 if two_byte);
+ // ecx: encoding of subject string (1 if ASCII, 0 if two_byte);
// Load used arguments before starting to push arguments for call to
native
// RegExp code to avoid handling changing stack height.
__ mov(ebx, Operand(esp, kPreviousIndexOffset));
@@ -3807,7 +3807,7 @@
// eax: subject string
// ebx: previous index
// edx: code
- // ecx: encoding of subject string (1 if ascii 0 if two_byte);
+ // ecx: encoding of subject string (1 if ASCII 0 if two_byte);
// All checks done. Now push arguments for native regexp code.
Counters* counters = masm->isolate()->counters();
__ IncrementCounter(counters->regexp_entry_native(), 1);
@@ -3847,7 +3847,7 @@
// esi: original subject string
// eax: underlying subject string
// ebx: previous index
- // ecx: encoding of subject string (1 if ascii 0 if two_byte);
+ // ecx: encoding of subject string (1 if ASCII 0 if two_byte);
// edx: code
// Argument 4: End of string data
// Argument 3: Start of string data
@@ -4475,7 +4475,7 @@
__ JumpIfNotBothSequentialAsciiStrings(edx, eax, ecx, ebx,
&check_unequal_objects);
- // Inline comparison of ascii strings.
+ // Inline comparison of ASCII strings.
if (cc_ == equal) {
StringCompareStub::GenerateFlatAsciiStringEquals(masm,
edx,
@@ -5428,7 +5428,7 @@
STATIC_ASSERT(kSmiTag == 0);
STATIC_ASSERT(kSmiTagSize == 1);
STATIC_ASSERT(kSmiShiftSize == 0);
- // At this point code register contains smi tagged ascii char code.
+ // At this point code register contains smi tagged ASCII char code.
__ mov(result_, FieldOperand(result_,
code_, times_half_pointer_size,
FixedArray::kHeaderSize));
@@ -5548,7 +5548,7 @@
__ cmp(ebx, Immediate(Smi::FromInt(2)));
__ j(not_equal, &longer_than_two);
- // Check that both strings are non-external ascii strings.
+ // Check that both strings are non-external ASCII strings.
__ JumpIfNotBothSequentialAsciiStrings(eax, edx, ebx, ecx,
&call_runtime);
// Get the two characters forming the new string.
@@ -5589,7 +5589,7 @@
__ j(below, &string_add_flat_result);
// If result is not supposed to be flat allocate a cons string object.
If both
- // strings are ascii the result is an ascii cons string.
+ // strings are ASCII the result is an ASCII cons string.
Label non_ascii, allocated, ascii_data;
__ mov(edi, FieldOperand(eax, HeapObject::kMapOffset));
__ movzx_b(ecx, FieldOperand(edi, Map::kInstanceTypeOffset));
@@ -5601,7 +5601,7 @@
__ test(ecx, Immediate(kStringEncodingMask));
__ j(zero, &non_ascii);
__ bind(&ascii_data);
- // Allocate an acsii cons string.
+ // Allocate an ASCII cons string.
__ AllocateAsciiConsString(ecx, edi, no_reg, &call_runtime);
__ bind(&allocated);
// Fill the fields of the cons string.
@@ -5616,7 +5616,7 @@
__ ret(2 * kPointerSize);
__ bind(&non_ascii);
// At least one of the strings is two-byte. Check whether it happens
- // to contain only ascii characters.
+ // to contain only ASCII characters.
// ecx: first instance type AND second instance type.
// edi: second instance type.
__ test(ecx, Immediate(kAsciiDataHintMask));
@@ -5691,7 +5691,7 @@
__ test_b(edi, kStringEncodingMask);
__ j(zero, &non_ascii_string_add_flat_result);
- // Both strings are ascii strings.
+ // Both strings are ASCII strings.
// ebx: length of resulting flat string as a smi
__ SmiUntag(ebx);
__ AllocateAsciiString(eax, ebx, ecx, edx, edi, &call_runtime_drop_two);
@@ -6001,7 +6001,7 @@
__ push(mask);
Register temp = mask;
- // Check that the candidate is a non-external ascii string.
+ // Check that the candidate is a non-external ASCII string.
__ mov(temp, FieldOperand(candidate, HeapObject::kMapOffset));
__ movzx_b(temp, FieldOperand(temp, Map::kInstanceTypeOffset));
__ JumpIfInstanceTypeIsNotSequentialAscii(
@@ -6280,7 +6280,7 @@
__ test_b(ebx, kStringEncodingMask);
__ j(zero, &two_byte_sequential);
- // Sequential ascii string. Allocate the result.
+ // Sequential ASCII string. Allocate the result.
__ AllocateAsciiString(eax, ecx, ebx, edx, edi, &runtime_drop_two);
// eax: result string
@@ -6493,10 +6493,10 @@
__ bind(¬_same);
- // Check that both objects are sequential ascii strings.
+ // Check that both objects are sequential ASCII strings.
__ JumpIfNotBothSequentialAsciiStrings(edx, eax, ecx, ebx, &runtime);
- // Compare flat ascii strings.
+ // Compare flat ASCII strings.
// Drop arguments from the stack.
__ pop(ecx);
__ add(esp, Immediate(2 * kPointerSize));
=======================================
--- /branches/bleeding_edge/src/ia32/full-codegen-ia32.cc Fri Jan 13
05:09:52 2012
+++ /branches/bleeding_edge/src/ia32/full-codegen-ia32.cc Mon Jan 16
04:38:59 2012
@@ -106,7 +106,7 @@
// formal parameter count expected by the function.
//
// The live registers are:
-// o edi: the JS function object being called (ie, ourselves)
+// o edi: the JS function object being called (i.e. ourselves)
// o esi: our context
// o ebp: our caller's frame pointer
// o esp: stack pointer (pointing to return address)
@@ -3571,7 +3571,7 @@
// One-character separator case
__ bind(&one_char_separator);
- // Replace separator with its ascii character value.
+ // Replace separator with its ASCII character value.
__ mov_b(scratch, FieldOperand(string, SeqAsciiString::kHeaderSize));
__ mov_b(separator_operand, scratch);
=======================================
--- /branches/bleeding_edge/src/ia32/macro-assembler-ia32.cc Mon Jan 16
01:44:35 2012
+++ /branches/bleeding_edge/src/ia32/macro-assembler-ia32.cc Mon Jan 16
04:38:59 2012
@@ -1387,7 +1387,7 @@
add(scratch1, Immediate(kObjectAlignmentMask));
and_(scratch1, Immediate(~kObjectAlignmentMask));
- // Allocate ascii string in new space.
+ // Allocate ASCII string in new space.
AllocateInNewSpace(SeqAsciiString::kHeaderSize,
times_1,
scratch1,
@@ -1415,7 +1415,7 @@
Label* gc_required) {
ASSERT(length > 0);
- // Allocate ascii string in new space.
+ // Allocate ASCII string in new space.
AllocateInNewSpace(SeqAsciiString::SizeFor(length),
result,
scratch1,
@@ -2464,7 +2464,7 @@
movzx_b(scratch1, FieldOperand(scratch1, Map::kInstanceTypeOffset));
movzx_b(scratch2, FieldOperand(scratch2, Map::kInstanceTypeOffset));
- // Check that both are flat ascii strings.
+ // Check that both are flat ASCII strings.
const int kFlatAsciiStringMask =
kIsNotStringMask | kStringRepresentationMask | kStringEncodingMask;
const int kFlatAsciiStringTag = ASCII_STRING_TYPE;
=======================================
--- /branches/bleeding_edge/src/ia32/macro-assembler-ia32.h Fri Jan 13
05:09:52 2012
+++ /branches/bleeding_edge/src/ia32/macro-assembler-ia32.h Mon Jan 16
04:38:59 2012
@@ -368,7 +368,7 @@
// Check if the map of an object is equal to a specified map and branch
to
// label if not. Skip the smi check if not required (object is known to
be a
// heap object). If mode is ALLOW_ELEMENT_TRANSITION_MAPS, then also
match
- // against maps that are ElementsKind transition maps of the specificed
map.
+ // against maps that are ElementsKind transition maps of the specified
map.
void CheckMap(Register obj,
Handle<Map> map,
Label* fail,
@@ -791,7 +791,7 @@
//
---------------------------------------------------------------------------
// String utilities.
- // Check whether the instance type represents a flat ascii string. Jump
to the
+ // Check whether the instance type represents a flat ASCII string. Jump
to the
// label if not. If the instance type can be scratched specify same
register
// for both instance type and scratch.
void JumpIfInstanceTypeIsNotSequentialAscii(Register instance_type,
=======================================
--- /branches/bleeding_edge/src/ia32/regexp-macro-assembler-ia32.cc Wed Oct
19 04:01:02 2011
+++ /branches/bleeding_edge/src/ia32/regexp-macro-assembler-ia32.cc Mon Jan
16 04:38:59 2012
@@ -210,7 +210,7 @@
bool check_end_of_string) {
#ifdef DEBUG
// If input is ASCII, don't even bother calling here if the string to
- // match contains a non-ascii character.
+ // match contains a non-ASCII character.
if (mode_ == ASCII) {
ASSERT(String::IsAscii(str.start(), str.length()));
}
=======================================
--- /branches/bleeding_edge/src/ia32/stub-cache-ia32.cc Fri Jan 13 05:09:52
2012
+++ /branches/bleeding_edge/src/ia32/stub-cache-ia32.cc Mon Jan 16 04:38:59
2012
@@ -992,7 +992,7 @@
__ push(scratch3); // Restore return address.
- // 3 elements array for v8::Agruments::values_, handler for name and
pointer
+ // 3 elements array for v8::Arguments::values_, handler for name and
pointer
// to the values (it considered as smi in GC).
const int kStackSpace = 5;
const int kApiArgc = 2;
=======================================
--- /branches/bleeding_edge/src/isolate.cc Fri Jan 13 05:09:52 2012
+++ /branches/bleeding_edge/src/isolate.cc Mon Jan 16 04:38:59 2012
@@ -1219,7 +1219,7 @@
ASSERT(has_pending_exception());
PropagatePendingExceptionToExternalTryCatch();
- // Allways reschedule out of memory exceptions.
+ // Always reschedule out of memory exceptions.
if (!is_out_of_memory()) {
bool is_termination_exception =
pending_exception() == heap_.termination_exception();
=======================================
--- /branches/bleeding_edge/src/isolate.h Thu Jan 5 09:16:19 2012
+++ /branches/bleeding_edge/src/isolate.h Mon Jan 16 04:38:59 2012
@@ -258,7 +258,7 @@
#endif
#endif // USE_SIMULATOR
- Address js_entry_sp_; // the stack pointer of the bottom js entry frame
+ Address js_entry_sp_; // the stack pointer of the bottom JS entry frame
Address external_callback_; // the external callback we're currently in
StateTag current_vm_state_;
@@ -485,7 +485,7 @@
bool IsDefaultIsolate() const { return this == default_isolate_; }
// Ensures that process-wide resources and the default isolate have been
- // allocated. It is only necessary to call this method in rare casses,
for
+ // allocated. It is only necessary to call this method in rare cases, for
// example if you are using V8 from within the body of a static
initializer.
// Safe to call multiple times.
static void EnsureDefaultIsolate();
@@ -635,7 +635,7 @@
void* formal_count_address() { return &thread_local_top_.formal_count_; }
// Returns the global object of the current context. It could be
- // a builtin object, or a js global object.
+ // a builtin object, or a JS global object.
Handle<GlobalObject> global() {
return Handle<GlobalObject>(context()->global());
}
=======================================
--- /branches/bleeding_edge/src/json-parser.h Thu Jan 5 09:16:19 2012
+++ /branches/bleeding_edge/src/json-parser.h Mon Jan 16 04:38:59 2012
@@ -130,7 +130,7 @@
// An object literal is a squiggly-braced and comma separated sequence
// (possibly empty) of key/value pairs, where the key is a JSON string
// literal, the value is a JSON value, and the two are separated by a
colon.
- // A JSON array dosn't allow numbers and identifiers as keys, like a
+ // A JSON array doesn't allow numbers and identifiers as keys, like a
// JavaScript array.
Handle<Object> ParseJsonObject();
@@ -177,7 +177,7 @@
// Set initial position right before the string.
position_ = -1;
- // Advance to the first character (posibly EOS)
+ // Advance to the first character (possibly EOS)
AdvanceSkipWhitespace();
Handle<Object> result = ParseJsonValue();
if (result.is_null() || c0_ != kEndOfString) {
=======================================
--- /branches/bleeding_edge/src/jsregexp.cc Mon Jan 16 01:46:21 2012
+++ /branches/bleeding_edge/src/jsregexp.cc Mon Jan 16 04:38:59 2012
@@ -704,7 +704,7 @@
// the virtualized backtrack stack and some register changes. When a
node is
// to be emitted it can flush the Trace or update it. Flushing the Trace
// will emit code to bring the actual state into line with the virtual
state.
-// Avoiding flushing the state can postpone some work (eg updates of
capture
+// Avoiding flushing the state can postpone some work (e.g. updates of
capture
// registers). Postponing work can save time when executing the regular
// expression since it may be found that the work never has to be done
as a
// failure to match can occur. In addition it is much faster to jump to
a
=======================================
--- /branches/bleeding_edge/src/jsregexp.h Fri Oct 7 07:41:08 2011
+++ /branches/bleeding_edge/src/jsregexp.h Mon Jan 16 04:38:59 2012
@@ -634,7 +634,7 @@
static const int kNodeIsTooComplexForGreedyLoops = -1;
virtual int GreedyLoopTextLength() { return
kNodeIsTooComplexForGreedyLoops; }
Label* label() { return &label_; }
- // If non-generic code is generated for a node (ie the node is not at the
+ // If non-generic code is generated for a node (i.e. the node is not at
the
// start of the trace) then it cannot be reused. This variable sets a
limit
// on how often we allow that to happen before we insist on starting a
new
// trace and generating generic code for a node that can be reused by
flushing
=======================================
--- /branches/bleeding_edge/src/list.h Wed Oct 26 03:45:24 2011
+++ /branches/bleeding_edge/src/list.h Mon Jan 16 04:38:59 2012
@@ -67,7 +67,7 @@
// Returns a reference to the element at index i. This reference is
// not safe to use after operations that can change the list's
- // backing store (eg, Add).
+ // backing store (e.g. Add).
inline T& operator[](int i) const {
ASSERT(0 <= i);
ASSERT(i < length_);
=======================================
--- /branches/bleeding_edge/src/liveedit-debugger.js Mon Nov 28 04:11:00
2011
+++ /branches/bleeding_edge/src/liveedit-debugger.js Mon Jan 16 04:38:59
2012
@@ -581,7 +581,7 @@
// children of unchanged functions are ignored.
function MarkChangedFunctions(code_info_tree, chunks) {
- // A convenient interator over diff chunks that also translates
+ // A convenient iterator over diff chunks that also translates
// positions from old to new in a current non-changed part of script.
var chunk_it = new function() {
var chunk_index = 0;
=======================================
--- /branches/bleeding_edge/src/liveobjectlist.cc Fri Jan 13 05:09:52 2012
+++ /branches/bleeding_edge/src/liveobjectlist.cc Mon Jan 16 04:38:59 2012
@@ -462,7 +462,7 @@
char prev_ch = 0;
while (*dst != '\0') {
char ch = *src++;
- // We will treat non-ascii chars as '?'.
+ // We will treat non-ASCII chars as '?'.
if ((ch & 0x80) != 0) {
ch = '?';
}
=======================================
--- /branches/bleeding_edge/src/macros.py Thu Jan 5 04:55:06 2012
+++ /branches/bleeding_edge/src/macros.py Mon Jan 16 04:38:59 2012
@@ -26,7 +26,7 @@
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
# Dictionary that is passed as defines for js2c.py.
-# Used for defines that must be defined for all native js files.
+# Used for defines that must be defined for all native JS files.
const NONE = 0;
const READ_ONLY = 1;
=======================================
--- /branches/bleeding_edge/src/mark-compact.cc Wed Jan 11 02:33:34 2012
+++ /branches/bleeding_edge/src/mark-compact.cc Mon Jan 16 04:38:59 2012
@@ -737,7 +737,7 @@
// it in place to its left substring. Return the updated value.
//
// Here we assume that if we change *p, we replace it with a heap object
- // (ie, the left substring of a cons string is always a heap object).
+ // (i.e., the left substring of a cons string is always a heap object).
//
// The check performed is:
// object->IsConsString() && !object->IsSymbol() &&
@@ -1196,7 +1196,7 @@
return;
}
JSRegExp* re = reinterpret_cast<JSRegExp*>(object);
- // Flush code or set age on both ascii and two byte code.
+ // Flush code or set age on both ASCII and two byte code.
UpdateRegExpCodeAgeAndFlush(heap, re, true);
UpdateRegExpCodeAgeAndFlush(heap, re, false);
// Visit the fields of the RegExp, including the updated FixedArray.
=======================================
--- /branches/bleeding_edge/src/mark-compact.h Thu Dec 8 08:07:07 2011
+++ /branches/bleeding_edge/src/mark-compact.h Mon Jan 16 04:38:59 2012
@@ -407,7 +407,7 @@
// object from the forwarding address of the previous live object in the
// page as input, and is updated to contain the offset to be used for the
// next live object in the same page. For spaces using a different
- // encoding (ie, contiguous spaces), the offset parameter is ignored.
+ // encoding (i.e., contiguous spaces), the offset parameter is ignored.
typedef void (*EncodingFunction)(Heap* heap,
HeapObject* old_object,
int object_size,
=======================================
--- /branches/bleeding_edge/src/mips/assembler-mips.h Wed Oct 26 01:17:24
2011
+++ /branches/bleeding_edge/src/mips/assembler-mips.h Mon Jan 16 04:38:59
2012
@@ -667,7 +667,7 @@
// Never use the int16_t b(l)cond version with a branch offset
// instead of using the Label* version.
- // Jump targets must be in the current 256 MB-aligned region. ie 28 bits.
+ // Jump targets must be in the current 256 MB-aligned region. i.e. 28
bits.
void j(int32_t target);
void jal(int32_t target);
void jalr(Register rs, Register rd = ra);
=======================================
--- /branches/bleeding_edge/src/mips/builtins-mips.cc Fri Jan 13 05:09:52
2012
+++ /branches/bleeding_edge/src/mips/builtins-mips.cc Mon Jan 16 04:38:59
2012
@@ -895,7 +895,7 @@
// Initialize the FixedArray.
// a1: constructor
- // a3: number of elements in properties array (un-tagged)
+ // a3: number of elements in properties array (untagged)
// t4: JSObject
// t5: start of next object
__ LoadRoot(t6, Heap::kFixedArrayMapRootIndex);
@@ -1099,7 +1099,7 @@
// ----------- S t a t e -------------
// -- a0: code entry
// -- a1: function
- // -- a2: reveiver_pointer
+ // -- a2: receiver_pointer
// -- a3: argc
// -- s0: argv
// -----------------------------------
@@ -1121,7 +1121,7 @@
// Copy arguments to the stack in a loop.
// a3: argc
- // s0: argv, ie points to first arg
+ // s0: argv, i.e. points to first arg
Label loop, entry;
__ sll(t0, a3, kPointerSizeLog2);
__ addu(t2, s0, t0);
=======================================
--- /branches/bleeding_edge/src/mips/code-stubs-mips.cc Mon Jan 16 01:46:21
2012
+++ /branches/bleeding_edge/src/mips/code-stubs-mips.cc Mon Jan 16 04:38:59
2012
@@ -4061,7 +4061,7 @@
// Registers:
// a0: entry address
// a1: function
- // a2: reveiver
+ // a2: receiver
// a3: argc
//
// Stack:
@@ -4103,7 +4103,7 @@
// Registers:
// a0: entry_address
// a1: function
- // a2: reveiver_pointer
+ // a2: receiver_pointer
// a3: argc
// s0: argv
//
@@ -4170,7 +4170,7 @@
// Registers:
// a0: entry_address
// a1: function
- // a2: reveiver_pointer
+ // a2: receiver_pointer
// a3: argc
// s0: argv
//
@@ -5006,9 +5006,9 @@
STATIC_ASSERT(kAsciiStringTag == 4);
STATIC_ASSERT(kTwoByteStringTag == 0);
// Find the code object based on the assumptions above.
- __ And(a0, a0, Operand(kStringEncodingMask)); // Non-zero for ascii.
+ __ And(a0, a0, Operand(kStringEncodingMask)); // Non-zero for ASCII.
__ lw(t9, FieldMemOperand(regexp_data, JSRegExp::kDataAsciiCodeOffset));
- __ sra(a3, a0, 2); // a3 is 1 for ascii, 0 for UC16 (usyed below).
+ __ sra(a3, a0, 2); // a3 is 1 for ASCII, 0 for UC16 (used below).
__ lw(t1, FieldMemOperand(regexp_data, JSRegExp::kDataUC16CodeOffset));
__ movz(t9, t1, a0); // If UC16 (a0 is 0), replace t9
w/kDataUC16CodeOffset.
@@ -6033,7 +6033,7 @@
Label result_longer_than_two;
- // Check for special case of two character ascii string, in which case
+ // Check for special case of two character ASCII string, in which case
// we do a lookup in the symbol table first.
__ li(t0, 2);
__ Branch(&result_longer_than_two, gt, a2, Operand(t0));
@@ -6164,7 +6164,7 @@
__ And(t0, a1, Operand(kStringEncodingMask));
__ Branch(&two_byte_sequential, eq, t0, Operand(zero_reg));
- // Allocate and copy the resulting ascii string.
+ // Allocate and copy the resulting ASCII string.
__ AllocateAsciiString(v0, a2, t0, t2, t3, &runtime);
// Locate first character of substring to copy.
@@ -6508,7 +6508,7 @@
}
Label non_ascii, allocated, ascii_data;
STATIC_ASSERT(kTwoByteStringTag == 0);
- // Branch to non_ascii if either string-encoding field is zero
(non-ascii).
+ // Branch to non_ascii if either string-encoding field is zero
(non-ASCII).
__ And(t4, t0, Operand(t1));
__ And(t4, t4, Operand(kStringEncodingMask));
__ Branch(&non_ascii, eq, t4, Operand(zero_reg));
=======================================
--- /branches/bleeding_edge/src/mips/constants-mips.cc Tue Sep 13 05:12:25
2011
+++ /branches/bleeding_edge/src/mips/constants-mips.cc Mon Jan 16 04:38:59
2012
@@ -302,7 +302,7 @@
return kRegisterType;
};
break;
- // 16 bits Immediate type instructions. eg: addi dest, src, imm16.
+ // 16 bits Immediate type instructions. e.g.: addi dest, src, imm16.
case REGIMM:
case BEQ:
case BNE:
@@ -337,7 +337,7 @@
case SWC1:
case SDC1:
return kImmediateType;
- // 26 bits immediate type instructions. eg: j imm26.
+ // 26 bits immediate type instructions. e.g.: j imm26.
case J:
case JAL:
return kJumpType;
=======================================
--- /branches/bleeding_edge/src/mips/constants-mips.h Fri Jan 13 05:09:52
2012
+++ /branches/bleeding_edge/src/mips/constants-mips.h Mon Jan 16 04:38:59
2012
@@ -747,7 +747,7 @@
// Say if the instruction should not be used in a branch delay slot.
bool IsForbiddenInBranchDelay() const;
- // Say if the instruction 'links'. eg: jal, bal.
+ // Say if the instruction 'links'. e.g. jal, bal.
bool IsLinkingInstruction() const;
// Say if the instruction is a break or a trap.
bool IsTrap() const;
=======================================
--- /branches/bleeding_edge/src/mips/full-codegen-mips.cc Fri Jan 13
05:09:52 2012
+++ /branches/bleeding_edge/src/mips/full-codegen-mips.cc Mon Jan 16
04:38:59 2012
@@ -125,7 +125,7 @@
// function.
//
// The live registers are:
-// o a1: the JS function object being called (ie, ourselves)
+// o a1: the JS function object being called (i.e. ourselves)
// o cp: our context
// o fp: our caller's frame pointer
// o sp: stack pointer
@@ -3655,7 +3655,7 @@
// One-character separator case.
__ bind(&one_char_separator);
- // Replace separator with its ascii character value.
+ // Replace separator with its ASCII character value.
__ lbu(separator, FieldMemOperand(separator,
SeqAsciiString::kHeaderSize));
// Jump into the loop after the code that copies the separator, so the
first
// element is not preceded by a separator.
@@ -3666,7 +3666,7 @@
// result_pos: the position to which we are currently copying
characters.
// element: Current array element.
// elements_end: Array end.
- // separator: Single separator ascii char (in lower byte).
+ // separator: Single separator ASCII char (in lower byte).
// Copy the separator character to the result.
__ sb(separator, MemOperand(result_pos));
=======================================
--- /branches/bleeding_edge/src/mips/lithium-codegen-mips.cc Fri Jan 13
05:09:52 2012
+++ /branches/bleeding_edge/src/mips/lithium-codegen-mips.cc Mon Jan 16
04:38:59 2012
@@ -2884,7 +2884,7 @@
__ mov(result, input);
ASSERT_EQ(2, masm()->InstructionsGeneratedSince(&done));
__ subu(result, zero_reg, input);
- // Overflow if result is still negative, ie 0x80000000.
+ // Overflow if result is still negative, i.e. 0x80000000.
DeoptimizeIf(lt, instr->environment(), result, Operand(zero_reg));
__ bind(&done);
}
=======================================
--- /branches/bleeding_edge/src/mips/macro-assembler-mips.cc Mon Jan 16
01:44:35 2012
+++ /branches/bleeding_edge/src/mips/macro-assembler-mips.cc Mon Jan 16
04:38:59 2012
@@ -1176,7 +1176,7 @@
Branch(not_int32, gt, scratch2, Operand(non_smi_exponent));
// We know the exponent is smaller than 30 (biased). If it is less than
- // 0 (biased) then the number is smaller in magnitude than 1.0 * 2^0, ie
+ // 0 (biased) then the number is smaller in magnitude than 1.0 * 2^0,
i.e.
// it rounds to zero.
const uint32_t zero_exponent =
(HeapNumber::kExponentBias + 0) << HeapNumber::kExponentShift;
=======================================
--- /branches/bleeding_edge/src/mips/macro-assembler-mips.h Fri Jan 13
05:09:52 2012
+++ /branches/bleeding_edge/src/mips/macro-assembler-mips.h Mon Jan 16
04:38:59 2012
@@ -340,7 +340,7 @@
Register scratch3,
Label* object_is_white_and_not_data);
- // Detects conservatively whether an object is data-only, ie it does
need to
+ // Detects conservatively whether an object is data-only, i.e. it does
need to
// be scanned by the garbage collector.
void JumpIfDataObject(Register value,
Register scratch,
@@ -421,7 +421,7 @@
}
// Check if the given instruction is a 'type' marker.
- // ie. check if it is a sll zero_reg, zero_reg, <type> (referenced as
+ // i.e. check if it is a sll zero_reg, zero_reg, <type> (referenced as
// nop(type)). These instructions are generated to mark special location
in
// the code, like some special IC code.
static inline bool IsMarkedCode(Instr instr, int type) {
@@ -1132,7 +1132,7 @@
// Calls an API function. Allocates HandleScope, extracts returned value
// from handle and propagates exceptions. Restores context. stack_space
- // - space to be unwound on exit (includes the call js arguments space
and
+ // - space to be unwound on exit (includes the call JS arguments space
and
// the additional space allocated for the fast call).
void CallApiFunctionAndReturn(ExternalReference function, int
stack_space);
=======================================
--- /branches/bleeding_edge/src/mips/simulator-mips.cc Fri Jan 13 05:09:52
2012
+++ /branches/bleeding_edge/src/mips/simulator-mips.cc Mon Jan 16 04:38:59
2012
@@ -2291,7 +2291,7 @@
}
-// Type 2: instructions using a 16 bytes immediate. (eg: addi, beq).
+// Type 2: instructions using a 16 bytes immediate. (e.g. addi, beq).
void Simulator::DecodeTypeImmediate(Instruction* instr) {
// Instruction fields.
Opcode op = instr->OpcodeFieldRaw();
@@ -2614,7 +2614,7 @@
}
-// Type 3: instructions using a 26 bytes immediate. (eg: j, jal).
+// Type 3: instructions using a 26 bytes immediate. (e.g. j, jal).
void Simulator::DecodeTypeJump(Instruction* instr) {
// Get current pc.
int32_t current_pc = get_pc();
=======================================
--- /branches/bleeding_edge/src/mips/stub-cache-mips.cc Fri Jan 13 05:09:52
2012
+++ /branches/bleeding_edge/src/mips/stub-cache-mips.cc Mon Jan 16 04:38:59
2012
@@ -565,11 +565,11 @@
int argc) {
// ----------- S t a t e -------------
// -- sp[0] : holder (set by CheckPrototypes)
- // -- sp[4] : callee js function
+ // -- sp[4] : callee JS function
// -- sp[8] : call data
- // -- sp[12] : last js argument
+ // -- sp[12] : last JS argument
// -- ...
- // -- sp[(argc + 3) * 4] : first js argument
+ // -- sp[(argc + 3) * 4] : first JS argument
// -- sp[(argc + 4) * 4] : receiver
// -----------------------------------
// Get the function and setup the context.
@@ -587,7 +587,7 @@
__ li(t2, call_data);
}
- // Store js function and call data.
+ // Store JS function and call data.
__ sw(t1, MemOperand(sp, 1 * kPointerSize));
__ sw(t2, MemOperand(sp, 2 * kPointerSize));
=======================================
--- /branches/bleeding_edge/src/objects-printer.cc Tue Jan 10 08:11:33 2012
+++ /branches/bleeding_edge/src/objects-printer.cc Mon Jan 16 04:38:59 2012
@@ -627,7 +627,7 @@
// This method is only meant to be called from gdb for debugging purposes.
-// Since the string can also be in two-byte encoding, non-ascii characters
+// Since the string can also be in two-byte encoding, non-ASCII characters
// will be ignored in the output.
char* String::ToAsciiArray() {
// Static so that subsequent calls frees previously allocated space.
=======================================
--- /branches/bleeding_edge/src/objects.cc Mon Jan 16 01:44:35 2012
+++ /branches/bleeding_edge/src/objects.cc Mon Jan 16 04:38:59 2012
@@ -10885,7 +10885,7 @@
// Optimized for symbol key. Knowledge of the key type allows:
// 1. Move the check if the key is a symbol out of the loop.
- // 2. Avoid comparing hash codes in symbol to symbol comparision.
+ // 2. Avoid comparing hash codes in symbol to symbol comparison.
// 3. Detect a case when a dictionary key is not a symbol but the key is.
// In case of positive result the dictionary key may be replaced by
// the symbol with minimal performance penalty. It gives a chance to
=======================================
--- /branches/bleeding_edge/src/objects.h Mon Jan 16 01:44:35 2012
+++ /branches/bleeding_edge/src/objects.h Mon Jan 16 04:38:59 2012
@@ -217,7 +217,7 @@
// encoding is considered TWO_BYTE. It is not mentioned in the name.
ASCII
// encoding is mentioned explicitly in the name. Likewise, the default
// representation is considered sequential. It is not mentioned in the
-// name. The other representations (eg, CONS, EXTERNAL) are explicitly
+// name. The other representations (e.g. CONS, EXTERNAL) are explicitly
// mentioned. Finally, the string is either a SYMBOL_TYPE (if it is a
// symbol) or a STRING_TYPE (if it is not a symbol).
//
@@ -492,7 +492,7 @@
STATIC_ASSERT(IS_POWER_OF_TWO(kSlicedNotConsMask) && kSlicedNotConsMask !=
0);
// If bit 7 is clear, then bit 3 indicates whether this two-byte
-// string actually contains ascii data.
+// string actually contains ASCII data.
const uint32_t kAsciiDataHintMask = 0x08;
const uint32_t kAsciiDataHintTag = 0x08;
@@ -1086,7 +1086,7 @@
// Heap objects typically have a map pointer in their first word. However,
-// during GC other data (eg, mark bits, forwarding addresses) is sometimes
+// during GC other data (e.g. mark bits, forwarding addresses) is sometimes
// encoded in the first word. The class MapWord is an abstraction of the
// value in a heap object's first word.
class MapWord BASE_EMBEDDED {
@@ -1105,7 +1105,7 @@
// True if this map word is a forwarding address for a scavenge
// collection. Only valid during a scavenge collection (specifically,
- // when all map words are heap object pointers, ie. not during a full
GC).
+ // when all map words are heap object pointers, i.e. not during a full
GC).
inline bool IsForwardingAddress();
// Create a map word from a forwarding address.
@@ -6489,7 +6489,7 @@
inline String* GetUnderlying();
// Mark the string as an undetectable object. It only applies to
- // ascii and two byte string types.
+ // ASCII and two byte string types.
bool MarkAsUndetectable();
// Return a substring.
@@ -6586,7 +6586,7 @@
// value into an array index.
static const int kMaxArrayIndexSize = 10;
- // Max ascii char code.
+ // Max ASCII char code.
static const int kMaxAsciiCharCode = unibrow::Utf8::kMaxOneByteChar;
static const unsigned kMaxAsciiCharCodeU =
unibrow::Utf8::kMaxOneByteChar;
static const int kMaxUC16CharCode = 0xffff;
@@ -6772,8 +6772,8 @@
};
-// The AsciiString class captures sequential ascii string objects.
-// Each character in the AsciiString is an ascii character.
+// The AsciiString class captures sequential ASCII string objects.
+// Each character in the AsciiString is an ASCII character.
class SeqAsciiString: public SeqString {
public:
static const bool kHasAsciiEncoding = true;
=======================================
--- /branches/bleeding_edge/src/parser.cc Fri Jan 13 05:09:52 2012
+++ /branches/bleeding_edge/src/parser.cc Mon Jan 16 04:38:59 2012
@@ -3757,7 +3757,7 @@
RelocInfo::kNoPosition,
FunctionLiteral::ANONYMOUS_EXPRESSION,
CHECK_OK);
- // Allow any number of parameters for compatiabilty with JSC.
+ // Allow any number of parameters for compatibilty with JSC.
// Specification only allows zero parameters for get and one for set.
ObjectLiteral::Property* property =
new(zone()) ObjectLiteral::Property(is_getter, value);
=======================================
***Additional files exist in this changeset.***
--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev
