From b41f857b9eeb89f16120bb036ece9d249b3aa413 Mon Sep 17 00:00:00 2001 From: Julien Brianceau Date: Wed, 2 Aug 2017 10:23:36 +0200 Subject: [PATCH] Fix common misspellings Bug: chromium:750830 Cq-Include-Trybots: master.tryserver.blink:linux_trusty_blink_rel;master.tryserver.chromium.linux:linux_chromium_rel_ng;master.tryserver.v8:v8_linux_noi18n_rel_ng Change-Id: Icab7b5a1c469d5e77d04df8bfca8319784e92af4 Reviewed-on: https://chromium-review.googlesource.com/595655 Commit-Queue: Julien Brianceau Reviewed-by: Yang Guo Reviewed-by: Michael Starzinger Reviewed-by: Clemens Hammacher Reviewed-by: Daniel Ehrenberg Cr-Commit-Position: refs/heads/master@{#47072} --- benchmarks/deltablue.js | 2 +- gypfiles/landmine_utils.py | 2 +- include/v8-profiler.h | 4 ++-- include/v8.h | 4 ++-- samples/process.cc | 2 +- src/accessors.cc | 2 +- src/arm/assembler-arm.cc | 4 ++-- src/arm/assembler-arm.h | 2 +- src/arm/disasm-arm.cc | 4 ++-- src/arm/simulator-arm.cc | 2 +- src/arm/simulator-arm.h | 2 +- src/arm64/constants-arm64.h | 2 +- src/arm64/macro-assembler-arm64.cc | 2 +- src/arm64/macro-assembler-arm64.h | 2 +- src/assembler.h | 2 +- src/base/bits.h | 2 +- src/base/cpu.cc | 4 ++-- src/base/functional.h | 2 +- src/base/ieee754.cc | 2 +- src/base/platform/platform.h | 2 +- src/builtins/builtins-array-gen.cc | 2 +- src/builtins/ia32/builtins-ia32.cc | 2 +- src/codegen.cc | 2 +- src/compiler/bytecode-analysis.cc | 2 +- src/compiler/instruction-selector.cc | 2 +- .../js-native-context-specialization.cc | 6 +++--- src/compiler/load-elimination.h | 2 +- src/compiler/mips/code-generator-mips.cc | 6 +++--- src/compiler/mips64/code-generator-mips64.cc | 6 +++--- src/compiler/move-optimizer.h | 2 +- src/compiler/register-allocator.cc | 2 +- src/compiler/scheduler.cc | 2 +- src/conversions-inl.h | 2 +- src/d8-posix.cc | 2 +- src/debug/debug.cc | 2 +- src/debug/debug.js | 2 +- src/deoptimizer.cc | 2 +- src/elements.cc | 2 +- src/feedback-vector.h | 2 +- src/futex-emulation.cc | 2 +- src/heap/gc-idle-time-handler.cc | 2 +- src/heap/spaces.cc | 2 +- src/heap/spaces.h | 2 +- src/heap/store-buffer.h | 2 +- src/ia32/assembler-ia32.h | 2 +- src/inspector/OWNERS | 2 +- src/interpreter/bytecode-array-builder.h | 2 +- src/isolate.cc | 2 +- src/js/array.js | 2 +- src/js/intl.js | 4 ++-- src/mips/assembler-mips-inl.h | 4 ++-- src/mips/assembler-mips.h | 4 ++-- src/mips/code-stubs-mips.cc | 4 ++-- src/mips/codegen-mips.cc | 2 +- src/mips/macro-assembler-mips.cc | 8 ++++---- src/mips/macro-assembler-mips.h | 2 +- src/mips/simulator-mips.cc | 4 ++-- src/mips64/assembler-mips64-inl.h | 4 ++-- src/mips64/assembler-mips64.h | 4 ++-- src/mips64/code-stubs-mips64.cc | 4 ++-- src/mips64/codegen-mips64.cc | 2 +- src/mips64/disasm-mips64.cc | 2 +- src/mips64/macro-assembler-mips64.cc | 2 +- src/mips64/macro-assembler-mips64.h | 2 +- src/mips64/simulator-mips64.cc | 4 ++-- src/objects.cc | 2 +- src/parsing/scanner-character-streams.cc | 2 +- src/parsing/scanner.cc | 2 +- src/ppc/assembler-ppc.h | 4 ++-- src/ppc/disasm-ppc.cc | 2 +- src/ppc/macro-assembler-ppc.h | 2 +- src/ppc/simulator-ppc.cc | 2 +- src/ppc/simulator-ppc.h | 2 +- src/regexp/jsregexp.cc | 2 +- src/regexp/regexp-parser.cc | 2 +- src/runtime/runtime-debug.cc | 2 +- src/runtime/runtime-regexp.cc | 2 +- src/s390/assembler-s390.cc | 4 ++-- src/s390/codegen-s390.cc | 2 +- src/s390/disasm-s390.cc | 2 +- src/s390/macro-assembler-s390.h | 2 +- src/s390/simulator-s390.cc | 16 ++++++++-------- src/source-position-table.cc | 2 +- src/third_party/valgrind/valgrind.h | 2 +- src/third_party/vtune/jitprofiling.h | 10 +++++----- src/third_party/vtune/vtune-jit.cc | 2 +- src/wasm/function-body-decoder.cc | 2 +- src/wasm/wasm-debug.cc | 6 +++--- src/wasm/wasm-module.h | 6 +++--- src/wasm/wasm-objects.h | 4 ++-- src/x64/assembler-x64.cc | 2 +- src/x64/assembler-x64.h | 2 +- src/x64/macro-assembler-x64.h | 4 ++-- src/zone/zone-chunk-list.h | 2 +- src/zone/zone.cc | 2 +- test/cctest/heap/test-spaces.cc | 18 +++++++++--------- test/cctest/test-api.cc | 2 +- test/cctest/test-debug.cc | 6 +++--- test/cctest/test-inobject-slack-tracking.cc | 2 +- test/cctest/test-orderedhashtable.cc | 8 ++++---- test/debugger/debug/debug-receiver.js | 2 +- .../stop-without-preceeding-start-expected.txt | 2 +- .../stop-without-preceeding-start.js | 2 +- test/intl/general/case-mapping.js | 2 +- test/mjsunit/asm/poppler/poppler.js | 4 ++-- test/mjsunit/cyrillic.js | 2 +- test/mjsunit/date-parse.js | 2 +- test/mjsunit/es6/reflect-define-property.js | 2 +- test/mjsunit/es6/typedarray-slice.js | 2 +- test/mjsunit/large-object-literal.js | 2 +- test/mjsunit/migrations.js | 2 +- test/mjsunit/mjsunit.js | 2 +- test/mjsunit/object-define-property.js | 2 +- test/mjsunit/regress/regress-1708.js | 2 +- test/mjsunit/regress/regress-2595.js | 2 +- test/mjsunit/regress/regress-6288.js | 2 +- test/mjsunit/regress/regress-718891.js | 2 +- .../regress/regress-regexp-codeflush.js | 2 +- test/mjsunit/unicode-test.js | 6 +++--- test/mjsunit/wasm/async-compile.js | 2 +- test/promises-aplus/lib/require.js | 2 +- test/test262/test262.status | 2 +- test/unittests/base/platform/time-unittest.cc | 4 ++-- .../array-reset-large-index-expected.txt | 2 +- test/webkit/array-reset-large-index.js | 2 +- test/webkit/dfg-inline-unused-this.js | 2 +- test/webkit/dfg-intrinsic-unused-this.js | 2 +- test/webkit/fast/js/kde/operators.js | 2 +- test/webkit/fast/js/read-modify-eval.js | 2 +- test/webkit/regexp-compile-crash-expected.txt | 2 +- test/webkit/regexp-compile-crash.js | 2 +- tools/concatenate-files.py | 6 +++--- tools/grokdump.py | 2 +- tools/ic-explorer.html | 2 +- tools/js2c.py | 4 ++-- tools/mb/docs/user_guide.md | 2 +- tools/profviz/gnuplot-4.6.3-emscripten.js | 4 ++-- tools/release/update_node.py | 2 +- tools/run-tests.py | 2 +- tools/stats-viewer.py | 4 ++-- 140 files changed, 204 insertions(+), 204 deletions(-) diff --git a/benchmarks/deltablue.js b/benchmarks/deltablue.js index dacee3f13ff..f44973cb9f8 100644 --- a/benchmarks/deltablue.js +++ b/benchmarks/deltablue.js @@ -790,7 +790,7 @@ Plan.prototype.execute = function () { * In case 1, the added constraint is stronger than the stay * constraint and values must propagate down the entire length of the * chain. In case 2, the added constraint is weaker than the stay - * constraint so it cannot be accomodated. The cost in this case is, + * constraint so it cannot be accommodated. The cost in this case is, * of course, very low. Typical situations lie somewhere between these * two extremes. */ diff --git a/gypfiles/landmine_utils.py b/gypfiles/landmine_utils.py index cb3499132a3..8bdc2b648b3 100644 --- a/gypfiles/landmine_utils.py +++ b/gypfiles/landmine_utils.py @@ -76,7 +76,7 @@ def distributor(): @memoize() def platform(): """ - Returns a string representing the platform this build is targetted for. + Returns a string representing the platform this build is targeted for. Possible values: 'win', 'mac', 'linux', 'ios', 'android' """ if 'OS' in gyp_defines(): diff --git a/include/v8-profiler.h b/include/v8-profiler.h index e1a32ea5033..621ca8b2157 100644 --- a/include/v8-profiler.h +++ b/include/v8-profiler.h @@ -389,7 +389,7 @@ class V8_EXPORT HeapGraphNode { kRegExp = 6, // RegExp. kHeapNumber = 7, // Number stored in the heap. kNative = 8, // Native object (not from V8 heap). - kSynthetic = 9, // Synthetic object, usualy used for grouping + kSynthetic = 9, // Synthetic object, usually used for grouping // snapshot items together. kConsString = 10, // Concatenated string. A pair of pointers to strings. kSlicedString = 11, // Sliced string. A fragment of another string. @@ -784,7 +784,7 @@ class V8_EXPORT HeapProfiler { /** * Returns the sampled profile of allocations allocated (and still live) since * StartSamplingHeapProfiler was called. The ownership of the pointer is - * transfered to the caller. Returns nullptr if sampling heap profiler is not + * transferred to the caller. Returns nullptr if sampling heap profiler is not * active. */ AllocationProfile* GetAllocationProfile(); diff --git a/include/v8.h b/include/v8.h index 8c9afb74b94..cf70d8a80d3 100644 --- a/include/v8.h +++ b/include/v8.h @@ -6538,7 +6538,7 @@ struct JitCodeEvent { struct line_info_t { // PC offset size_t offset; - // Code postion + // Code position size_t pos; // The position type. PositionType position_type; @@ -7746,7 +7746,7 @@ typedef bool (*EntropySource)(unsigned char* buffer, size_t length); * ReturnAddressLocationResolver is used as a callback function when v8 is * resolving the location of a return address on the stack. Profilers that * change the return address on the stack can use this to resolve the stack - * location to whereever the profiler stashed the original return address. + * location to wherever the profiler stashed the original return address. * * \param return_addr_location A location on stack where a machine * return address resides. diff --git a/samples/process.cc b/samples/process.cc index 29ddb5cf2f1..a2d0ac88be6 100644 --- a/samples/process.cc +++ b/samples/process.cc @@ -305,7 +305,7 @@ bool JsHttpRequestProcessor::Process(HttpRequest* request) { JsHttpRequestProcessor::~JsHttpRequestProcessor() { - // Dispose the persistent handles. When noone else has any + // Dispose the persistent handles. When no one else has any // references to the objects stored in the handles they will be // automatically reclaimed. context_.Reset(); diff --git a/src/accessors.cc b/src/accessors.cc index 22e5558aac7..271626eb1f4 100644 --- a/src/accessors.cc +++ b/src/accessors.cc @@ -946,7 +946,7 @@ class FrameFunctionIterator { } } - // Iterate through functions until the first occurence of 'function'. + // Iterate through functions until the first occurrence of 'function'. // Returns true if 'function' is found, and false if the iterator ends // without finding it. bool Find(JSFunction* function) { diff --git a/src/arm/assembler-arm.cc b/src/arm/assembler-arm.cc index 876af4e6191..e52521202ca 100644 --- a/src/arm/assembler-arm.cc +++ b/src/arm/assembler-arm.cc @@ -1053,7 +1053,7 @@ void Assembler::next(Label* L) { DCHECK(L->is_linked()); int link = target_at(L->pos()); if (link == L->pos()) { - // Branch target points to the same instuction. This is the end of the link + // Branch target points to the same instruction. This is the end of the link // chain. L->Unuse(); } else { @@ -1361,7 +1361,7 @@ void Assembler::AddrMode3(Instr instr, Register rd, const MemOperand& x) { DCHECK(offset_8 >= 0); // no masking needed instr |= B | (offset_8 >> 4)*B8 | (offset_8 & 0xf); } else if (x.shift_imm_ != 0) { - // Scaled register offsets are not supported, compute the offset seperately + // Scaled register offsets are not supported, compute the offset separately // to a scratch register. UseScratchRegisterScope temps(this); // Allow re-using rd for load instructions if possible. diff --git a/src/arm/assembler-arm.h b/src/arm/assembler-arm.h index 962bfa6bf9e..96e7ff728dc 100644 --- a/src/arm/assembler-arm.h +++ b/src/arm/assembler-arm.h @@ -866,7 +866,7 @@ class Assembler : public AssemblerBase { // Distance between start of patched debug break slot and the emitted address // to jump to. // Patched debug break slot code is: - // ldr ip, [pc, #0] @ emited address and start + // ldr ip, [pc, #0] @ emitted address and start // blx ip static constexpr int kPatchDebugBreakSlotAddressOffset = 2 * kInstrSize; diff --git a/src/arm/disasm-arm.cc b/src/arm/disasm-arm.cc index 7f63b193b08..bd0d6b5b9a9 100644 --- a/src/arm/disasm-arm.cc +++ b/src/arm/disasm-arm.cc @@ -726,7 +726,7 @@ void Decoder::Format(Instruction* instr, const char* format) { // The disassembler may end up decoding data inlined in the code. We do not want -// it to crash if the data does not ressemble any known instruction. +// it to crash if the data does not resemble any known instruction. #define VERIFY(condition) \ if(!(condition)) { \ Unknown(instr); \ @@ -2602,7 +2602,7 @@ int Decoder::InstructionDecode(byte* instr_ptr) { DecodeConstantPoolLength(instruction_bits)); return Instruction::kInstrSize; } else if (instruction_bits == kCodeAgeJumpInstruction) { - // The code age prologue has a constant immediatly following the jump + // The code age prologue has a constant immediately following the jump // instruction. Instruction* target = Instruction::At(instr_ptr + Instruction::kInstrSize); DecodeType2(instr); diff --git a/src/arm/simulator-arm.cc b/src/arm/simulator-arm.cc index 7d0f64bf733..9a22e509188 100644 --- a/src/arm/simulator-arm.cc +++ b/src/arm/simulator-arm.cc @@ -5833,7 +5833,7 @@ void Simulator::Execute() { } } else { // FLAG_stop_sim_at is at the non-default value. Stop in the debugger when - // we reach the particular instuction count. + // we reach the particular instruction count. while (program_counter != end_sim_pc) { Instruction* instr = reinterpret_cast(program_counter); icount_++; diff --git a/src/arm/simulator-arm.h b/src/arm/simulator-arm.h index 35fc2f930e0..478b1fef258 100644 --- a/src/arm/simulator-arm.h +++ b/src/arm/simulator-arm.h @@ -444,7 +444,7 @@ class Simulator { }; StopCountAndDesc watched_stops_[kNumOfWatchedStops]; - // Syncronization primitives. See ARM DDI 0406C.b, A2.9. + // Synchronization primitives. See ARM DDI 0406C.b, A2.9. enum class MonitorAccess { Open, Exclusive, diff --git a/src/arm64/constants-arm64.h b/src/arm64/constants-arm64.h index dc2e55cf825..f9458300454 100644 --- a/src/arm64/constants-arm64.h +++ b/src/arm64/constants-arm64.h @@ -171,7 +171,7 @@ typedef uint16_t float16; V_(ImmAddSub, 21, 10, Bits) \ V_(ShiftAddSub, 23, 22, Bits) \ \ - /* Add/substract extend */ \ + /* Add/subtract extend */ \ V_(ImmExtendShift, 12, 10, Bits) \ V_(ExtendMode, 15, 13, Bits) \ \ diff --git a/src/arm64/macro-assembler-arm64.cc b/src/arm64/macro-assembler-arm64.cc index ad6e668edd1..f1a5b89632a 100644 --- a/src/arm64/macro-assembler-arm64.cc +++ b/src/arm64/macro-assembler-arm64.cc @@ -2455,7 +2455,7 @@ void TurboAssembler::TryConvertDoubleToInt64(Register result, // The values INT64_MIN (0x800...00) or INT64_MAX (0x7ff...ff) are not // representable using a double, so if the result is one of those then we know - // that saturation occured, and we need to manually handle the conversion. + // that saturation occurred, and we need to manually handle the conversion. // // It is easy to detect INT64_MIN and INT64_MAX because adding or subtracting // 1 will cause signed overflow. diff --git a/src/arm64/macro-assembler-arm64.h b/src/arm64/macro-assembler-arm64.h index f05ef4d8254..e7e58d7e6fe 100644 --- a/src/arm64/macro-assembler-arm64.h +++ b/src/arm64/macro-assembler-arm64.h @@ -2390,7 +2390,7 @@ class MacroAssembler : public TurboAssembler { }; -// Use this scope when you need a one-to-one mapping bewteen methods and +// Use this scope when you need a one-to-one mapping between methods and // instructions. This scope prevents the MacroAssembler from being called and // literal pools from being emitted. It also asserts the number of instructions // emitted is what you specified when creating the scope. diff --git a/src/assembler.h b/src/assembler.h index 31d9937fa28..258e3777f8f 100644 --- a/src/assembler.h +++ b/src/assembler.h @@ -373,7 +373,7 @@ class RelocInfo { NUMBER_OF_MODES, NONE32, // never recorded 32-bit value NONE64, // never recorded 64-bit value - CODE_AGE_SEQUENCE, // Not stored in RelocInfo array, used explictly by + CODE_AGE_SEQUENCE, // Not stored in RelocInfo array, used explicitly by // code aging. FIRST_REAL_RELOC_MODE = CODE_TARGET, diff --git a/src/base/bits.h b/src/base/bits.h index 496860faddd..1db96e6027a 100644 --- a/src/base/bits.h +++ b/src/base/bits.h @@ -333,7 +333,7 @@ FromCheckedNumeric(const internal::CheckedNumeric value); // checks and returns the result. V8_BASE_EXPORT int64_t SignedSaturatedAdd64(int64_t lhs, int64_t rhs); -// SignedSaturatedSub64(lhs, rhs) substracts |lhs| by |rhs|, +// SignedSaturatedSub64(lhs, rhs) subtracts |lhs| by |rhs|, // checks and returns the result. V8_BASE_EXPORT int64_t SignedSaturatedSub64(int64_t lhs, int64_t rhs); diff --git a/src/base/cpu.cc b/src/base/cpu.cc index bf530c62816..abbb824b6d9 100644 --- a/src/base/cpu.cc +++ b/src/base/cpu.cc @@ -221,14 +221,14 @@ class CPUInfo final { delete[] data_; } - // Extract the content of a the first occurence of a given field in + // Extract the content of a the first occurrence of a given field in // the content of the cpuinfo file and return it as a heap-allocated // string that must be freed by the caller using delete[]. // Return NULL if not found. char* ExtractField(const char* field) const { DCHECK(field != NULL); - // Look for first field occurence, and ensure it starts the line. + // Look for first field occurrence, and ensure it starts the line. size_t fieldlen = strlen(field); char* p = data_; for (;;) { diff --git a/src/base/functional.h b/src/base/functional.h index 53ccac5240e..1b632c6cc2a 100644 --- a/src/base/functional.h +++ b/src/base/functional.h @@ -25,7 +25,7 @@ namespace base { // the Draft Technical Report on C++ Library Extensions (TR1)). // // base::hash is implemented by calling the hash_value function. The namespace -// isn't specified so that it can detect overloads via argument dependant +// isn't specified so that it can detect overloads via argument dependent // lookup. So if there is a free function hash_value in the same namespace as a // custom type, it will get called. // diff --git a/src/base/ieee754.cc b/src/base/ieee754.cc index d0faeeea006..ca0c6d1314d 100644 --- a/src/base/ieee754.cc +++ b/src/base/ieee754.cc @@ -2401,7 +2401,7 @@ double cbrt(double x) { * error of about 1 in 16. Adding a bias of -0.03306235651 to the * (e%3+m)/3 term reduces the error to about 1 in 32. With the IEEE * floating point representation, for finite positive normal values, - * ordinary integer divison of the value in bits magically gives + * ordinary integer division of the value in bits magically gives * almost exactly the RHS of the above provided we first subtract the * exponent bias (1023 for doubles) and later add it back. We do the * subtraction virtually to keep e >= 0 so that ordinary integer diff --git a/src/base/platform/platform.h b/src/base/platform/platform.h index bcc9a9b92f5..7737001d5a5 100644 --- a/src/base/platform/platform.h +++ b/src/base/platform/platform.h @@ -237,7 +237,7 @@ class V8_BASE_EXPORT OS { static void StrNCpy(char* dest, int length, const char* src, size_t n); // Support for the profiler. Can do nothing, in which case ticks - // occuring in shared libraries will not be properly accounted for. + // occurring in shared libraries will not be properly accounted for. struct SharedLibraryAddress { SharedLibraryAddress(const std::string& library_path, uintptr_t start, uintptr_t end) diff --git a/src/builtins/builtins-array-gen.cc b/src/builtins/builtins-array-gen.cc index e9b7bffd51e..1818d3cfb28 100644 --- a/src/builtins/builtins-array-gen.cc +++ b/src/builtins/builtins-array-gen.cc @@ -764,7 +764,7 @@ class ArrayBuiltinCodeStubAssembler : public CodeStubAssembler { &runtime); // We need to be conservative and start with holey because the builtins - // that create output arrays aren't gauranteed to be called for every + // that create output arrays aren't guaranteed to be called for every // element in the input array (maybe the callback deletes an element). const ElementsKind elements_kind = GetHoleyElementsKind(GetInitialFastElementsKind()); diff --git a/src/builtins/ia32/builtins-ia32.cc b/src/builtins/ia32/builtins-ia32.cc index a3002f810e6..997407ad3c3 100644 --- a/src/builtins/ia32/builtins-ia32.cc +++ b/src/builtins/ia32/builtins-ia32.cc @@ -619,7 +619,7 @@ static void LeaveInterpreterFrame(MacroAssembler* masm, Register scratch1, Register args_count = scratch1; Register return_pc = scratch2; - // Get the arguments + reciever count. + // Get the arguments + receiver count. __ mov(args_count, Operand(ebp, InterpreterFrameConstants::kBytecodeArrayFromFp)); __ mov(args_count, diff --git a/src/codegen.cc b/src/codegen.cc index 5760a730f4a..c08418e99c5 100644 --- a/src/codegen.cc +++ b/src/codegen.cc @@ -195,7 +195,7 @@ static int PrintFunctionSource(CompilationInfo* info, } // Print information for the given inlining: which function was inlined and -// where the inlining occured. +// where the inlining occurred. static void PrintInlinedFunctionInfo( CompilationInfo* info, int source_id, int inlining_id, const CompilationInfo::InlinedFunctionHolder& h) { diff --git a/src/compiler/bytecode-analysis.cc b/src/compiler/bytecode-analysis.cc index 13185db208b..9f23aa6b45b 100644 --- a/src/compiler/bytecode-analysis.cc +++ b/src/compiler/bytecode-analysis.cc @@ -424,7 +424,7 @@ int BytecodeAnalysis::GetLoopOffsetFor(int offset) const { if (loop_end_to_header == end_to_header_.end()) { return -1; } - // If the header preceeds the offset, this is the loop + // If the header precedes the offset, this is the loop // // .> header <--loop_end_to_header // | diff --git a/src/compiler/instruction-selector.cc b/src/compiler/instruction-selector.cc index 8d5159001b1..c0317ee1af2 100644 --- a/src/compiler/instruction-selector.cc +++ b/src/compiler/instruction-selector.cc @@ -467,7 +467,7 @@ InstructionOperand OperandForDeopt(Isolate* isolate, OperandGenerator* g, return g->UseUniqueSlot(input); case FrameStateInputKind::kAny: // Currently deopts "wrap" other operations, so the deopt's inputs - // are potentially needed untill the end of the deoptimising code. + // are potentially needed until the end of the deoptimising code. return g->UseAnyAtEnd(input); } } diff --git a/src/compiler/js-native-context-specialization.cc b/src/compiler/js-native-context-specialization.cc index 3aff3306577..4410426200d 100644 --- a/src/compiler/js-native-context-specialization.cc +++ b/src/compiler/js-native-context-specialization.cc @@ -573,7 +573,7 @@ Reduction JSNativeContextSpecialization::ReduceGlobalAccess( value = effect = graph()->NewNode(simplified()->CheckHeapObject(), value, effect, control); - // Check {value} map agains the {property_cell} map. + // Check {value} map against the {property_cell} map. effect = graph()->NewNode(simplified()->CheckMaps( CheckMapsFlag::kNone, @@ -2289,12 +2289,12 @@ bool JSNativeContextSpecialization::ExtractReceiverMaps( DCHECK_EQ(0, receiver_maps->size()); // See if we can infer a concrete type for the {receiver}. if (InferReceiverMaps(receiver, effect, receiver_maps)) { - // We can assume that the {receiver} still has the infered {receiver_maps}. + // We can assume that the {receiver} still has the inferred {receiver_maps}. return true; } // Try to extract some maps from the {nexus}. if (nexus.ExtractMaps(receiver_maps) != 0) { - // Try to filter impossible candidates based on infered root map. + // Try to filter impossible candidates based on inferred root map. Handle receiver_map; if (InferReceiverRootMap(receiver).ToHandle(&receiver_map)) { receiver_maps->erase( diff --git a/src/compiler/load-elimination.h b/src/compiler/load-elimination.h index 41ccd17f28c..710a0559db6 100644 --- a/src/compiler/load-elimination.h +++ b/src/compiler/load-elimination.h @@ -19,7 +19,7 @@ class Factory; namespace compiler { -// Foward declarations. +// Forward declarations. class CommonOperatorBuilder; struct FieldAccess; class Graph; diff --git a/src/compiler/mips/code-generator-mips.cc b/src/compiler/mips/code-generator-mips.cc index 34ce8becb1f..6c2e359caf6 100644 --- a/src/compiler/mips/code-generator-mips.cc +++ b/src/compiler/mips/code-generator-mips.cc @@ -1081,7 +1081,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction( i.InputInt8(2)); break; case kMipsCmpS: - // Psuedo-instruction used for FP cmp/branch. No opcode emitted here. + // Pseudo-instruction used for FP cmp/branch. No opcode emitted here. break; case kMipsAddS: // TODO(plind): add special case: combine mult & add. @@ -1131,7 +1131,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction( i.InputDoubleRegister(1)); break; case kMipsCmpD: - // Psuedo-instruction used for FP cmp/branch. No opcode emitted here. + // Pseudo-instruction used for FP cmp/branch. No opcode emitted here. break; case kMipsAddPair: __ AddPair(i.OutputRegister(0), i.OutputRegister(1), i.InputRegister(0), @@ -2915,7 +2915,7 @@ void CodeGenerator::AssembleArchBoolean(Instruction* instr, Condition cc = kNoCondition; // MIPS does not have condition code flags, so compare and branch are // implemented differently than on the other arch's. The compare operations - // emit mips psuedo-instructions, which are checked and handled here. + // emit mips pseudo-instructions, which are checked and handled here. if (instr->arch_opcode() == kMipsTst) { cc = FlagsConditionToConditionTst(condition); diff --git a/src/compiler/mips64/code-generator-mips64.cc b/src/compiler/mips64/code-generator-mips64.cc index b86a64e16a6..e7aeb3916e9 100644 --- a/src/compiler/mips64/code-generator-mips64.cc +++ b/src/compiler/mips64/code-generator-mips64.cc @@ -1283,7 +1283,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction( break; case kMips64CmpS: - // Psuedo-instruction used for FP cmp/branch. No opcode emitted here. + // Pseudo-instruction used for FP cmp/branch. No opcode emitted here. break; case kMips64AddS: // TODO(plind): add special case: combine mult & add. @@ -1337,7 +1337,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction( i.InputDoubleRegister(1)); break; case kMips64CmpD: - // Psuedo-instruction used for FP cmp/branch. No opcode emitted here. + // Pseudo-instruction used for FP cmp/branch. No opcode emitted here. break; case kMips64AddD: // TODO(plind): add special case: combine mult & add. @@ -3022,7 +3022,7 @@ void AssembleBranchToLabels(CodeGenerator* gen, TurboAssembler* tasm, Condition cc = kNoCondition; // MIPS does not have condition code flags, so compare and branch are // implemented differently than on the other arch's. The compare operations - // emit mips psuedo-instructions, which are handled here by branch + // emit mips pseudo-instructions, which are handled here by branch // instructions that do the actual comparison. Essential that the input // registers to compare pseudo-op are not modified before this branch op, as // they are tested here. diff --git a/src/compiler/move-optimizer.h b/src/compiler/move-optimizer.h index 3844d330ec5..7c132ab1538 100644 --- a/src/compiler/move-optimizer.h +++ b/src/compiler/move-optimizer.h @@ -45,7 +45,7 @@ class V8_EXPORT_PRIVATE MoveOptimizer final { const Instruction* LastInstruction(const InstructionBlock* block) const; - // Consolidate common moves appearing accross all predecessors of a block. + // Consolidate common moves appearing across all predecessors of a block. void OptimizeMerge(InstructionBlock* block); void FinalizeMoves(Instruction* instr); diff --git a/src/compiler/register-allocator.cc b/src/compiler/register-allocator.cc index f5d43761d20..4c9725c1983 100644 --- a/src/compiler/register-allocator.cc +++ b/src/compiler/register-allocator.cc @@ -2234,7 +2234,7 @@ void LiveRangeBuilder::ProcessPhis(const InstructionBlock* block, // block. int phi_vreg = phi->virtual_register(); live->Remove(phi_vreg); - // Select a hint from a predecessor block that preceeds this block in the + // Select a hint from a predecessor block that precedes this block in the // rpo order. In order of priority: // - Avoid hints from deferred blocks. // - Prefer hints from allocated (or explicit) operands. diff --git a/src/compiler/scheduler.cc b/src/compiler/scheduler.cc index ed74489149c..75fb3f8ca5c 100644 --- a/src/compiler/scheduler.cc +++ b/src/compiler/scheduler.cc @@ -1396,7 +1396,7 @@ class ScheduleLateNodeVisitor { block->loop_depth(), min_block->id().ToInt()); // Hoist nodes out of loops if possible. Nodes can be hoisted iteratively - // into enclosing loop pre-headers until they would preceed their schedule + // into enclosing loop pre-headers until they would precede their schedule // early position. BasicBlock* hoist_block = GetHoistBlock(block); if (hoist_block && diff --git a/src/conversions-inl.h b/src/conversions-inl.h index fedeb4e9a8b..a0139f6848d 100644 --- a/src/conversions-inl.h +++ b/src/conversions-inl.h @@ -489,7 +489,7 @@ double InternalStringToInt(UnicodeCache* unicode_cache, // NOTE: The code for computing the value may seem a bit complex at // first glance. It is structured to use 32-bit multiply-and-add - // loops as long as possible to avoid loosing precision. + // loops as long as possible to avoid losing precision. double v = 0.0; bool done = false; diff --git a/src/d8-posix.cc b/src/d8-posix.cc index 7c843deff1a..4b5b1a5f541 100644 --- a/src/d8-posix.cc +++ b/src/d8-posix.cc @@ -359,7 +359,7 @@ static Local GetStdout(Isolate* isolate, int child_fd, // we don't get here before the child has closed stdout and most programs don't // do that before they exit. // -// We're disabling usage of waitid in Mac OS X because it doens't work for us: +// We're disabling usage of waitid in Mac OS X because it doesn't work for us: // a parent process hangs on waiting while a child process is already a zombie. // See http://code.google.com/p/v8/issues/detail?id=401. #if defined(WNOWAIT) && !defined(ANDROID) && !defined(__APPLE__) \ diff --git a/src/debug/debug.cc b/src/debug/debug.cc index ec4d4b5782f..123af7ed371 100644 --- a/src/debug/debug.cc +++ b/src/debug/debug.cc @@ -1792,7 +1792,7 @@ namespace { v8::Local GetDebugEventContext(Isolate* isolate) { Handle context = isolate->debug()->debugger_entry()->GetContext(); // Isolate::context() may have been NULL when "script collected" event - // occured. + // occurred. if (context.is_null()) return v8::Local(); Handle native_context(context->native_context()); return v8::Utils::ToLocal(native_context); diff --git a/src/debug/debug.js b/src/debug/debug.js index 0568efebfe0..43be3c424a9 100644 --- a/src/debug/debug.js +++ b/src/debug/debug.js @@ -29,7 +29,7 @@ var Debug = {}; // comments. var sourceLineBeginningSkip = /^(?:\s*(?:\/\*.*?\*\/)*)*/; -// Debug events which can occour in the V8 JavaScript engine. These originate +// Debug events which can occur in the V8 JavaScript engine. These originate // from the API include file debug.h. Debug.DebugEvent = { Break: 1, Exception: 2, diff --git a/src/deoptimizer.cc b/src/deoptimizer.cc index ab48c713e47..1aac19eac6d 100644 --- a/src/deoptimizer.cc +++ b/src/deoptimizer.cc @@ -3976,7 +3976,7 @@ Handle TranslatedState::MaterializeAt(int frame_index, int object_index = slot->object_index(); TranslatedState::ObjectPosition pos = object_positions_[object_index]; - // Make sure the duplicate is refering to a previous object. + // Make sure the duplicate is referring to a previous object. CHECK(pos.frame_index_ < frame_index || (pos.frame_index_ == frame_index && pos.value_index_ < *value_index - 1)); diff --git a/src/elements.cc b/src/elements.cc index 716cc00b9a2..0b7bd04c8ae 100644 --- a/src/elements.cc +++ b/src/elements.cc @@ -2265,7 +2265,7 @@ class FastElementsAccessor : public ElementsAccessorBase { } return Just(false); } else { - // Seach for The Hole in HOLEY_DOUBLE_ELEMENTS + // Search for The Hole in HOLEY_DOUBLE_ELEMENTS DCHECK_EQ(Subclass::kind(), HOLEY_DOUBLE_ELEMENTS); auto elements = FixedDoubleArray::cast(receiver->elements()); diff --git a/src/feedback-vector.h b/src/feedback-vector.h index ca8e46c9af6..d645ebcf74b 100644 --- a/src/feedback-vector.h +++ b/src/feedback-vector.h @@ -134,7 +134,7 @@ class FeedbackVector : public HeapObject { DECL_ACCESSORS(shared_function_info, SharedFunctionInfo) // [optimized_code_cell]: WeakCell containing optimized code or a Smi marker - // definining optimization behaviour. + // defining optimization behaviour. DECL_ACCESSORS(optimized_code_cell, Object) // [length]: The length of the feedback vector (not including the header, i.e. diff --git a/src/futex-emulation.cc b/src/futex-emulation.cc index 63ad213f8d0..af9cbeb12a2 100644 --- a/src/futex-emulation.cc +++ b/src/futex-emulation.cc @@ -153,7 +153,7 @@ Object* FutexEmulation::Wait(Isolate* isolate, mutex_.Pointer()->Lock(); if (node->interrupted_) { - // An interrupt occured while the mutex_ was unlocked. Don't wait yet. + // An interrupt occurred while the mutex_ was unlocked. Don't wait yet. continue; } diff --git a/src/heap/gc-idle-time-handler.cc b/src/heap/gc-idle-time-handler.cc index 6142a0c8e45..62c33139248 100644 --- a/src/heap/gc-idle-time-handler.cc +++ b/src/heap/gc-idle-time-handler.cc @@ -115,7 +115,7 @@ GCIdleTimeAction GCIdleTimeHandler::NothingOrDone(double idle_time_in_ms) { // a full GC. // (2) If the context disposal rate is high and we cannot perform a full GC, // we do nothing until the context disposal rate becomes lower. -// (3) If the new space is almost full and we can affort a scavenge or if the +// (3) If the new space is almost full and we can afford a scavenge or if the // next scavenge will very likely take long, then a scavenge is performed. // (4) If sweeping is in progress and we received a large enough idle time // request, we finalize sweeping here. diff --git a/src/heap/spaces.cc b/src/heap/spaces.cc index a7c7b723f46..7f2bd18b503 100644 --- a/src/heap/spaces.cc +++ b/src/heap/spaces.cc @@ -493,7 +493,7 @@ Address MemoryAllocator::AllocateAlignedMemory( if (base == NULL) { // Failed to commit the body. Release the mapping and any partially - // commited regions inside it. + // committed regions inside it. reservation.Release(); size_.Decrement(reserve_size); return NULL; diff --git a/src/heap/spaces.h b/src/heap/spaces.h index afac9812c97..5e8c4822ab9 100644 --- a/src/heap/spaces.h +++ b/src/heap/spaces.h @@ -2714,7 +2714,7 @@ class NewSpace : public Space { void RecordAllocation(HeapObject* obj); void RecordPromotion(HeapObject* obj); - // Return whether the operation succeded. + // Return whether the operation succeeded. bool CommitFromSpaceIfNeeded() { if (from_space_.is_committed()) return true; return from_space_.Commit(); diff --git a/src/heap/store-buffer.h b/src/heap/store-buffer.h index 1f2f4da20fb..f7993be6c3f 100644 --- a/src/heap/store-buffer.h +++ b/src/heap/store-buffer.h @@ -44,7 +44,7 @@ class StoreBuffer { // method takes a lock. void MoveEntriesToRememberedSet(int index); - // This method ensures that all used store buffer entries are transfered to + // This method ensures that all used store buffer entries are transferred to // the remembered set. void MoveAllEntriesToRememberedSet(); diff --git a/src/ia32/assembler-ia32.h b/src/ia32/assembler-ia32.h index 3e7243fb5df..618d004799f 100644 --- a/src/ia32/assembler-ia32.h +++ b/src/ia32/assembler-ia32.h @@ -1804,7 +1804,7 @@ class Assembler : public AssemblerBase { byte escape1, byte escape2, byte opcode); void vinstr(byte op, XMMRegister dst, XMMRegister src1, const Operand& src2, SIMDPrefix pp, LeadingOpcode m, VexW w); - // Most BMI instructions are similiar. + // Most BMI instructions are similar. void bmi1(byte op, Register reg, Register vreg, const Operand& rm); void bmi2(SIMDPrefix pp, byte op, Register reg, Register vreg, const Operand& rm); diff --git a/src/inspector/OWNERS b/src/inspector/OWNERS index 82ee735d554..db3c9062628 100644 --- a/src/inspector/OWNERS +++ b/src/inspector/OWNERS @@ -8,7 +8,7 @@ pfeldman@chromium.org yangguo@chromium.org # Changes to remote debugging protocol require devtools review to -# ensure backwards compatibility and committment to maintain. +# ensure backwards compatibility and commitment to maintain. per-file js_protocol.json=set noparent per-file js_protocol.json=dgozman@chromium.org per-file js_protocol.json=pfeldman@chromium.org diff --git a/src/interpreter/bytecode-array-builder.h b/src/interpreter/bytecode-array-builder.h index 2e4c781cbe7..bf77ebde1fb 100644 --- a/src/interpreter/bytecode-array-builder.h +++ b/src/interpreter/bytecode-array-builder.h @@ -530,7 +530,7 @@ class V8_EXPORT_PRIVATE BytecodeArrayBuilder final void WriteSwitch(BytecodeNode* node, BytecodeJumpTable* label); // Not implemented as the illegal bytecode is used inside internally - // to indicate a bytecode field is not valid or an error has occured + // to indicate a bytecode field is not valid or an error has occurred // during bytecode generation. BytecodeArrayBuilder& Illegal(); diff --git a/src/isolate.cc b/src/isolate.cc index b4ed763c5c1..8c5b545b6d4 100644 --- a/src/isolate.cc +++ b/src/isolate.cc @@ -1008,7 +1008,7 @@ void ReportBootstrappingException(Handle exception, // We are bootstrapping and caught an error where the location is set // and we have a script for the location. // In this case we could have an extension (or an internal error - // somewhere) and we print out the line number at which the error occured + // somewhere) and we print out the line number at which the error occurred // to the console for easier debugging. int line_number = location->script()->GetLineNumber(location->start_pos()) + 1; diff --git a/src/js/array.js b/src/js/array.js index 9da7be28486..3fdc8b98eea 100644 --- a/src/js/array.js +++ b/src/js/array.js @@ -952,7 +952,7 @@ function InnerArraySort(array, length, comparefn) { obj[i] = UNDEFINED; } for (i = length - num_holes; i < length; i++) { - // For compatability with Webkit, do not expose elements in the prototype. + // For compatibility with Webkit, do not expose elements in the prototype. if (i in %object_get_prototype_of(obj)) { obj[i] = UNDEFINED; } else { diff --git a/src/js/intl.js b/src/js/intl.js index 1579337fc13..42106a22b59 100644 --- a/src/js/intl.js +++ b/src/js/intl.js @@ -748,7 +748,7 @@ function canonicalizeLanguageTag(localeID) { // ECMA 402 6.2.3 var tag = %CanonicalizeLanguageTag(localeString); - // TODO(jshin): This should not happen because the structual validity + // TODO(jshin): This should not happen because the structural validity // is already checked. If that's the case, remove this. if (tag === 'invalid-tag') { throw %make_range_error(kInvalidLanguageTag, localeString); @@ -797,7 +797,7 @@ function initializeLocaleList(locales) { } /** - * Check the structual Validity of the language tag per ECMA 402 6.2.2: + * Check the structural Validity of the language tag per ECMA 402 6.2.2: * - Well-formed per RFC 5646 2.1 * - There are no duplicate variant subtags * - There are no duplicate singletion (extension) subtags diff --git a/src/mips/assembler-mips-inl.h b/src/mips/assembler-mips-inl.h index 50ec0dd83a8..d6f58e3ecc9 100644 --- a/src/mips/assembler-mips-inl.h +++ b/src/mips/assembler-mips-inl.h @@ -404,7 +404,7 @@ void Assembler::CheckForEmitInForbiddenSlot() { CheckBuffer(); } if (IsPrevInstrCompactBranch()) { - // Nop instruction to preceed a CTI in forbidden slot: + // Nop instruction to precede a CTI in forbidden slot: Instr nop = SPECIAL | SLL; *reinterpret_cast(pc_) = nop; pc_ += kInstrSize; @@ -417,7 +417,7 @@ void Assembler::CheckForEmitInForbiddenSlot() { void Assembler::EmitHelper(Instr x, CompactBranchType is_compact_branch) { if (IsPrevInstrCompactBranch()) { if (Instruction::IsForbiddenAfterBranchInstr(x)) { - // Nop instruction to preceed a CTI in forbidden slot: + // Nop instruction to precede a CTI in forbidden slot: Instr nop = SPECIAL | SLL; *reinterpret_cast(pc_) = nop; pc_ += kInstrSize; diff --git a/src/mips/assembler-mips.h b/src/mips/assembler-mips.h index eb50a5fe207..daa2134582b 100644 --- a/src/mips/assembler-mips.h +++ b/src/mips/assembler-mips.h @@ -575,7 +575,7 @@ class Operand BASE_EMBEDDED { }; -// On MIPS we have only one adressing mode with base_reg + offset. +// On MIPS we have only one addressing mode with base_reg + offset. // Class MemOperand represents a memory operand in load and store instructions. class MemOperand : public Operand { public: @@ -2288,7 +2288,7 @@ class Assembler : public AssemblerBase { // - space for labels. // // Space for trampoline slots is equal to slot_count * 2 * kInstrSize. - // Space for trampoline slots preceeds space for labels. Each label is of one + // Space for trampoline slots precedes space for labels. Each label is of one // instruction size, so total amount for labels is equal to // label_count * kInstrSize. class Trampoline { diff --git a/src/mips/code-stubs-mips.cc b/src/mips/code-stubs-mips.cc index b57c1a60f07..bfc8f6efe32 100644 --- a/src/mips/code-stubs-mips.cc +++ b/src/mips/code-stubs-mips.cc @@ -556,7 +556,7 @@ void CompareICStub::GenerateGeneric(MacroAssembler* masm) { if (!IsMipsArchVariant(kMips32r6)) { __ c(OLT, D, f12, f14); __ Movt(v0, t0); - // Use previous check to store conditionally to v0 oposite condition + // Use previous check to store conditionally to v0 opposite condition // (GREATER). If rhs is equal to lhs, this will be corrected in next // check. __ Movf(v0, t1); @@ -1693,7 +1693,7 @@ void CompareICStub::GenerateNumbers(MacroAssembler* masm) { // Test if less (unordered case is already handled). __ BranchF(&fpu_lt, NULL, lt, f0, f2); - // Otherwise it's greater, so just fall thru, and return. + // Otherwise it's greater, so just fall through, and return. DCHECK(is_int16(GREATER) && is_int16(EQUAL) && is_int16(LESS)); __ Ret(USE_DELAY_SLOT); __ li(v0, Operand(GREATER)); diff --git a/src/mips/codegen-mips.cc b/src/mips/codegen-mips.cc index 85f06714f37..25385d32677 100644 --- a/src/mips/codegen-mips.cc +++ b/src/mips/codegen-mips.cc @@ -208,7 +208,7 @@ MemCopyUint8Function CreateMemCopyUint8Function(Isolate* isolate, // one word at a time. Set a2 to count how many bytes we have to copy // after all the word chunks are copied and a3 to the dst pointer after // all the word chunks have been copied. We will loop, incrementing a0 - // and a1 untill a0 equals a3. + // and a1 until a0 equals a3. __ bind(&chk1w); __ andi(a2, t8, loadstore_chunk - 1); __ beq(a2, t8, &lastb); diff --git a/src/mips/macro-assembler-mips.cc b/src/mips/macro-assembler-mips.cc index 91b953b7adb..d29ad053340 100644 --- a/src/mips/macro-assembler-mips.cc +++ b/src/mips/macro-assembler-mips.cc @@ -1724,7 +1724,7 @@ void TurboAssembler::Neg_d(FPURegister fd, FPURegister fs) { void TurboAssembler::Cvt_d_uw(FPURegister fd, Register rs, FPURegister scratch) { - // In FP64Mode we do convertion from long. + // In FP64Mode we do conversion from long. if (IsFp64Mode()) { mtc1(rs, scratch); Mthc1(zero_reg, scratch); @@ -3532,7 +3532,7 @@ int TurboAssembler::CallSize(Register target, int16_t offset, Condition cond, } -// Note: To call gcc-compiled C code on mips, you must call thru t9. +// Note: To call gcc-compiled C code on mips, you must call through t9. void TurboAssembler::Call(Register target, int16_t offset, Condition cond, Register rs, const Operand& rt, BranchDelaySlot bd) { DCHECK(is_int16(offset)); @@ -3572,7 +3572,7 @@ void TurboAssembler::Call(Register target, int16_t offset, Condition cond, #endif } -// Note: To call gcc-compiled C code on mips, you must call thru t9. +// Note: To call gcc-compiled C code on mips, you must call through t9. void TurboAssembler::Call(Register target, Register base, int16_t offset, Condition cond, Register rs, const Operand& rt, BranchDelaySlot bd) { @@ -5216,7 +5216,7 @@ void MacroAssembler::EnterExitFrame(bool save_doubles, int stack_space, const int frame_alignment = MacroAssembler::ActivationFrameAlignment(); if (save_doubles) { - // The stack must be allign to 0 modulo 8 for stores with sdc1. + // The stack must be align to 0 modulo 8 for stores with sdc1. DCHECK(kDoubleSize == frame_alignment); if (frame_alignment > 0) { DCHECK(base::bits::IsPowerOfTwo(frame_alignment)); diff --git a/src/mips/macro-assembler-mips.h b/src/mips/macro-assembler-mips.h index 6b1abcf49b5..f4ad0904603 100644 --- a/src/mips/macro-assembler-mips.h +++ b/src/mips/macro-assembler-mips.h @@ -487,7 +487,7 @@ class TurboAssembler : public Assembler { Register scratch); void PrepareCallCFunction(int num_reg_arguments, Register scratch); - // Arguments 1-4 are placed in registers a0 thru a3 respectively. + // Arguments 1-4 are placed in registers a0 through a3 respectively. // Arguments 5..n are stored to stack using following: // sw(t0, CFunctionArgumentOperand(5)); diff --git a/src/mips/simulator-mips.cc b/src/mips/simulator-mips.cc index fec71d433db..268e9373d48 100644 --- a/src/mips/simulator-mips.cc +++ b/src/mips/simulator-mips.cc @@ -2542,7 +2542,7 @@ static bool FPUProcessNaNsAndZeros(T a, T b, MaxMinKind kind, T& result) { result = a; } else if (b == a) { // Handle -0.0 == 0.0 case. - // std::signbit() returns int 0 or 1 so substracting MaxMinKind::kMax + // std::signbit() returns int 0 or 1 so subtracting MaxMinKind::kMax // negates the result. result = std::signbit(b) - static_cast(kind) ? b : a; } else { @@ -5707,7 +5707,7 @@ void Simulator::Execute() { } } else { // FLAG_stop_sim_at is at the non-default value. Stop in the debugger when - // we reach the particular instuction count. + // we reach the particular instruction count. while (program_counter != end_sim_pc) { Instruction* instr = reinterpret_cast(program_counter); icount_++; diff --git a/src/mips64/assembler-mips64-inl.h b/src/mips64/assembler-mips64-inl.h index 4a3426f12b7..96aaf7d292a 100644 --- a/src/mips64/assembler-mips64-inl.h +++ b/src/mips64/assembler-mips64-inl.h @@ -379,7 +379,7 @@ void Assembler::CheckForEmitInForbiddenSlot() { CheckBuffer(); } if (IsPrevInstrCompactBranch()) { - // Nop instruction to preceed a CTI in forbidden slot: + // Nop instruction to precede a CTI in forbidden slot: Instr nop = SPECIAL | SLL; *reinterpret_cast(pc_) = nop; pc_ += kInstrSize; @@ -392,7 +392,7 @@ void Assembler::CheckForEmitInForbiddenSlot() { void Assembler::EmitHelper(Instr x, CompactBranchType is_compact_branch) { if (IsPrevInstrCompactBranch()) { if (Instruction::IsForbiddenAfterBranchInstr(x)) { - // Nop instruction to preceed a CTI in forbidden slot: + // Nop instruction to precede a CTI in forbidden slot: Instr nop = SPECIAL | SLL; *reinterpret_cast(pc_) = nop; pc_ += kInstrSize; diff --git a/src/mips64/assembler-mips64.h b/src/mips64/assembler-mips64.h index bd77f5102ff..6e61943deac 100644 --- a/src/mips64/assembler-mips64.h +++ b/src/mips64/assembler-mips64.h @@ -580,7 +580,7 @@ class Operand BASE_EMBEDDED { }; -// On MIPS we have only one adressing mode with base_reg + offset. +// On MIPS we have only one addressing mode with base_reg + offset. // Class MemOperand represents a memory operand in load and store instructions. class MemOperand : public Operand { public: @@ -2338,7 +2338,7 @@ class Assembler : public AssemblerBase { // - space for labels. // // Space for trampoline slots is equal to slot_count * 2 * kInstrSize. - // Space for trampoline slots preceeds space for labels. Each label is of one + // Space for trampoline slots precedes space for labels. Each label is of one // instruction size, so total amount for labels is equal to // label_count * kInstrSize. class Trampoline { diff --git a/src/mips64/code-stubs-mips64.cc b/src/mips64/code-stubs-mips64.cc index 6b34dec60b2..3e3195d0cf7 100644 --- a/src/mips64/code-stubs-mips64.cc +++ b/src/mips64/code-stubs-mips64.cc @@ -554,7 +554,7 @@ void CompareICStub::GenerateGeneric(MacroAssembler* masm) { if (kArchVariant != kMips64r6) { __ c(OLT, D, f12, f14); __ Movt(v0, a4); - // Use previous check to store conditionally to v0 oposite condition + // Use previous check to store conditionally to v0 opposite condition // (GREATER). If rhs is equal to lhs, this will be corrected in next // check. __ Movf(v0, a5); @@ -1698,7 +1698,7 @@ void CompareICStub::GenerateNumbers(MacroAssembler* masm) { // Test if less (unordered case is already handled). __ BranchF(&fpu_lt, NULL, lt, f0, f2); - // Otherwise it's greater, so just fall thru, and return. + // Otherwise it's greater, so just fall through, and return. DCHECK(is_int16(GREATER) && is_int16(EQUAL) && is_int16(LESS)); __ Ret(USE_DELAY_SLOT); __ li(v0, Operand(GREATER)); diff --git a/src/mips64/codegen-mips64.cc b/src/mips64/codegen-mips64.cc index 110a3e8f10e..a55ac11f7f7 100644 --- a/src/mips64/codegen-mips64.cc +++ b/src/mips64/codegen-mips64.cc @@ -209,7 +209,7 @@ MemCopyUint8Function CreateMemCopyUint8Function(Isolate* isolate, // one word at a time. Set a2 to count how many bytes we have to copy // after all the word chunks are copied and a3 to the dst pointer after // all the word chunks have been copied. We will loop, incrementing a0 - // and a1 untill a0 equals a3. + // and a1 until a0 equals a3. __ bind(&chk1w); __ andi(a2, t8, loadstore_chunk - 1); __ beq(a2, t8, &lastb); diff --git a/src/mips64/disasm-mips64.cc b/src/mips64/disasm-mips64.cc index debdf63215e..012886352dd 100644 --- a/src/mips64/disasm-mips64.cc +++ b/src/mips64/disasm-mips64.cc @@ -2895,7 +2895,7 @@ void Decoder::DecodeTypeMsa2RF(Instruction* instr) { // Disassemble the instruction at *instr_ptr into the output buffer. // All instructions are one word long, except for the simulator -// psuedo-instruction stop(msg). For that one special case, we return +// pseudo-instruction stop(msg). For that one special case, we return // size larger than one kInstrSize. int Decoder::InstructionDecode(byte* instr_ptr) { Instruction* instr = Instruction::At(instr_ptr); diff --git a/src/mips64/macro-assembler-mips64.cc b/src/mips64/macro-assembler-mips64.cc index 26cb37b7a51..e76d3955dc9 100644 --- a/src/mips64/macro-assembler-mips64.cc +++ b/src/mips64/macro-assembler-mips64.cc @@ -3895,7 +3895,7 @@ int TurboAssembler::CallSize(Register target, Condition cond, Register rs, } -// Note: To call gcc-compiled C code on mips, you must call thru t9. +// Note: To call gcc-compiled C code on mips, you must call through t9. void TurboAssembler::Call(Register target, Condition cond, Register rs, const Operand& rt, BranchDelaySlot bd) { #ifdef DEBUG diff --git a/src/mips64/macro-assembler-mips64.h b/src/mips64/macro-assembler-mips64.h index b712a7e53e5..255bb43ed5c 100644 --- a/src/mips64/macro-assembler-mips64.h +++ b/src/mips64/macro-assembler-mips64.h @@ -529,7 +529,7 @@ class TurboAssembler : public Assembler { Register scratch); void PrepareCallCFunction(int num_reg_arguments, Register scratch); - // Arguments 1-4 are placed in registers a0 thru a3 respectively. + // Arguments 1-4 are placed in registers a0 through a3 respectively. // Arguments 5..n are stored to stack using following: // Sw(a4, CFunctionArgumentOperand(5)); diff --git a/src/mips64/simulator-mips64.cc b/src/mips64/simulator-mips64.cc index 114a4b6654d..e3b5f8f8374 100644 --- a/src/mips64/simulator-mips64.cc +++ b/src/mips64/simulator-mips64.cc @@ -2488,7 +2488,7 @@ static bool FPUProcessNaNsAndZeros(T a, T b, MaxMinKind kind, T& result) { result = a; } else if (b == a) { // Handle -0.0 == 0.0 case. - // std::signbit() returns int 0 or 1 so substracting MaxMinKind::kMax + // std::signbit() returns int 0 or 1 so subtracting MaxMinKind::kMax // negates the result. result = std::signbit(b) - static_cast(kind) ? b : a; } else { @@ -6031,7 +6031,7 @@ void Simulator::Execute() { } } else { // FLAG_stop_sim_at is at the non-default value. Stop in the debugger when - // we reach the particular instuction count. + // we reach the particular instruction count. while (program_counter != end_sim_pc) { Instruction* instr = reinterpret_cast(program_counter); icount_++; diff --git a/src/objects.cc b/src/objects.cc index abc60aa4452..718c8569ddc 100644 --- a/src/objects.cc +++ b/src/objects.cc @@ -13762,7 +13762,7 @@ std::ostream& operator<<(std::ostream& os, const SourceCodeOf& v) { void SharedFunctionInfo::DisableOptimization(BailoutReason reason) { // Disable optimization for the shared function info and mark the // code as non-optimizable. The marker on the shared function info - // is there because we flush non-optimized code thereby loosing the + // is there because we flush non-optimized code thereby losing the // non-optimizable information for the code. When the code is // regenerated and set on the shared function info it is marked as // non-optimizable if optimization is disabled for the shared diff --git a/src/parsing/scanner-character-streams.cc b/src/parsing/scanner-character-streams.cc index 4a432d7b769..1c1d18cfb93 100644 --- a/src/parsing/scanner-character-streams.cc +++ b/src/parsing/scanner-character-streams.cc @@ -509,7 +509,7 @@ class Utf8ChunkSource : public ChunkSource { if (V8_LIKELY(t < kUtf8Bom)) { decoded_data[decoded_len++] = static_cast(t); } else if (V8_UNLIKELY(is_at_first_char_ && t == kUtf8Bom)) { - // Skip BOM at the beggining of the stream + // Skip BOM at the beginning of the stream is_at_first_char_ = false; } else if (t <= unibrow::Utf16::kMaxNonSurrogateCharCode) { decoded_data[decoded_len++] = static_cast(t); diff --git a/src/parsing/scanner.cc b/src/parsing/scanner.cc index a4d9d76da68..3d707288be8 100644 --- a/src/parsing/scanner.cc +++ b/src/parsing/scanner.cc @@ -1675,7 +1675,7 @@ bool Scanner::ScanRegExpPattern() { // or not, since any '/', '\\' or '[' is guaranteed to not be part // of the escape sequence. - // TODO(896): At some point, parse RegExps more throughly to capture + // TODO(896): At some point, parse RegExps more thoroughly to capture // octal esacpes in strict mode. } else { // Unescaped character. if (c0_ == '[') in_character_class = true; diff --git a/src/ppc/assembler-ppc.h b/src/ppc/assembler-ppc.h index 6f9ca984c5e..bc8b7c55e3c 100644 --- a/src/ppc/assembler-ppc.h +++ b/src/ppc/assembler-ppc.h @@ -871,8 +871,8 @@ class Assembler : public AssemblerBase { void b(Label* L, LKBit lk = LeaveLK) { b(branch_offset(L), lk); } inline CRegister cmpi_optimization(CRegister cr) { - // Check whether the branch is preceeded by an optimizable cmpi against 0. - // The cmpi can be deleted if it is also preceeded by an instruction that + // Check whether the branch is preceded by an optimizable cmpi against 0. + // The cmpi can be deleted if it is also preceded by an instruction that // sets the register used by the compare and supports a dot form. unsigned int sradi_mask = kOpcodeMask | kExt2OpcodeVariant2Mask; unsigned int srawi_mask = kOpcodeMask | kExt2OpcodeMask; diff --git a/src/ppc/disasm-ppc.cc b/src/ppc/disasm-ppc.cc index 6933e302a4b..a574cef13fc 100644 --- a/src/ppc/disasm-ppc.cc +++ b/src/ppc/disasm-ppc.cc @@ -345,7 +345,7 @@ void Decoder::Format(Instruction* instr, const char* format) { // The disassembler may end up decoding data inlined in the code. We do not want -// it to crash if the data does not ressemble any known instruction. +// it to crash if the data does not resemble any known instruction. #define VERIFY(condition) \ if (!(condition)) { \ Unknown(instr); \ diff --git a/src/ppc/macro-assembler-ppc.h b/src/ppc/macro-assembler-ppc.h index c3fa1e371b6..463a3fc14a8 100644 --- a/src/ppc/macro-assembler-ppc.h +++ b/src/ppc/macro-assembler-ppc.h @@ -1274,7 +1274,7 @@ class MacroAssembler : public TurboAssembler { #if V8_TARGET_ARCH_PPC64 - // Ensure it is permissable to read/write int value directly from + // Ensure it is permissible to read/write int value directly from // upper half of the smi. STATIC_ASSERT(kSmiTag == 0); STATIC_ASSERT(kSmiTagSize + kSmiShiftSize == 32); diff --git a/src/ppc/simulator-ppc.cc b/src/ppc/simulator-ppc.cc index 0face8c5628..ab5b2627e2d 100644 --- a/src/ppc/simulator-ppc.cc +++ b/src/ppc/simulator-ppc.cc @@ -4059,7 +4059,7 @@ void Simulator::Execute() { } } else { // FLAG_stop_sim_at is at the non-default value. Stop in the debugger when - // we reach the particular instuction count. + // we reach the particular instruction count. while (program_counter != end_sim_pc) { Instruction* instr = reinterpret_cast(program_counter); icount_++; diff --git a/src/ppc/simulator-ppc.h b/src/ppc/simulator-ppc.h index 92da0d5811e..aba6c3671b3 100644 --- a/src/ppc/simulator-ppc.h +++ b/src/ppc/simulator-ppc.h @@ -402,7 +402,7 @@ class Simulator { }; StopCountAndDesc watched_stops_[kNumOfWatchedStops]; - // Syncronization primitives. See ARM DDI 0406C.b, A2.9. + // Synchronization primitives. See ARM DDI 0406C.b, A2.9. enum class MonitorAccess { Open, Exclusive, diff --git a/src/regexp/jsregexp.cc b/src/regexp/jsregexp.cc index 19363ccc1de..ea07dabc1ba 100644 --- a/src/regexp/jsregexp.cc +++ b/src/regexp/jsregexp.cc @@ -1252,7 +1252,7 @@ void Trace::PerformDeferredActions(RegExpMacroAssembler* assembler, } // SET_REGISTER is currently only used for newly introduced loop // counters. They can have a significant previous value if they - // occour in a loop. TODO(lrn): Propagate this information, so + // occur in a loop. TODO(lrn): Propagate this information, so // we can set undo_action to IGNORE if we know there is no value to // restore. undo_action = RESTORE; diff --git a/src/regexp/regexp-parser.cc b/src/regexp/regexp-parser.cc index c8ef8328a73..6954b1f8288 100644 --- a/src/regexp/regexp-parser.cc +++ b/src/regexp/regexp-parser.cc @@ -238,7 +238,7 @@ RegExpTree* RegExpParser::ParseDisjunction() { builder = state->builder(); builder->AddAtom(body); - // For compatability with JSC and ES3, we allow quantifiers after + // For compatibility with JSC and ES3, we allow quantifiers after // lookaheads, and break in all cases. break; } diff --git a/src/runtime/runtime-debug.cc b/src/runtime/runtime-debug.cc index b58dce22b6b..8828c463b98 100644 --- a/src/runtime/runtime-debug.cc +++ b/src/runtime/runtime-debug.cc @@ -325,7 +325,7 @@ RUNTIME_FUNCTION(Runtime_DebugGetPropertyDetails) { // Make sure to set the current context to the context before the debugger was // entered (if the debugger is entered). The reason for switching context here // is that for some property lookups (accessors and interceptors) callbacks - // into the embedding application can occour, and the embedding application + // into the embedding application can occur, and the embedding application // could have the assumption that its own native context is the current // context and not some internal debugger context. SaveContext save(isolate); diff --git a/src/runtime/runtime-regexp.cc b/src/runtime/runtime-regexp.cc index 968a1361f4b..4894e5091a9 100644 --- a/src/runtime/runtime-regexp.cc +++ b/src/runtime/runtime-regexp.cc @@ -643,7 +643,7 @@ MUST_USE_RESULT static Object* StringReplaceGlobalRegExpWithString( int expected_parts = (compiled_replacement.parts() + 1) * 4 + 1; ReplacementStringBuilder builder(isolate->heap(), subject, expected_parts); - // Number of parts added by compiled replacement plus preceeding + // Number of parts added by compiled replacement plus preceding // string and possibly suffix after last match. It is possible for // all components to use two elements when encoded as two smis. const int parts_added_per_loop = 2 * (compiled_replacement.parts() + 2); diff --git a/src/s390/assembler-s390.cc b/src/s390/assembler-s390.cc index 31ca0592d3e..f1b7e42ff42 100644 --- a/src/s390/assembler-s390.cc +++ b/src/s390/assembler-s390.cc @@ -105,7 +105,7 @@ static bool supportsSTFLE() { static uint32_t auxv_hwcap = 0; if (!read_tried) { - // Open the AUXV (auxilliary vector) psuedo-file + // Open the AUXV (auxiliary vector) pseudo-file int fd = open("/proc/self/auxv", O_RDONLY); read_tried = true; @@ -1472,7 +1472,7 @@ void Assembler::risbgn(Register dst, Register src, const Operand& startBit, // --------------------------- // Move Character Instructions // --------------------------- -// Move charactor - mem to mem operation +// Move character - mem to mem operation void Assembler::mvc(const MemOperand& opnd1, const MemOperand& opnd2, uint32_t length) { ss_form(MVC, length - 1, opnd1.getBaseRegister(), opnd1.getDisplacement(), diff --git a/src/s390/codegen-s390.cc b/src/s390/codegen-s390.cc index b52bb791a37..92f7f91c980 100644 --- a/src/s390/codegen-s390.cc +++ b/src/s390/codegen-s390.cc @@ -218,7 +218,7 @@ void Code::PatchPlatformCodeAge(Isolate* isolate, byte* sequence, // We need to push lr on stack so that GenerateMakeCodeYoungAgainCommon // knows where to pick up the return address // - // Since we can no longer guarentee ip will hold the branch address + // Since we can no longer guarantee ip will hold the branch address // because of BRASL, use Call so that GenerateMakeCodeYoungAgainCommon // can calculate the branch address offset patcher.masm()->nop(); // marker to detect sequence (see IsOld) diff --git a/src/s390/disasm-s390.cc b/src/s390/disasm-s390.cc index 4ec911c1443..4df4053c569 100644 --- a/src/s390/disasm-s390.cc +++ b/src/s390/disasm-s390.cc @@ -472,7 +472,7 @@ void Decoder::Format(Instruction* instr, const char* format) { } // The disassembler may end up decoding data inlined in the code. We do not want -// it to crash if the data does not ressemble any known instruction. +// it to crash if the data does not resemble any known instruction. #define VERIFY(condition) \ if (!(condition)) { \ Unknown(instr); \ diff --git a/src/s390/macro-assembler-s390.h b/src/s390/macro-assembler-s390.h index c1747db7609..4eb47fce8f8 100644 --- a/src/s390/macro-assembler-s390.h +++ b/src/s390/macro-assembler-s390.h @@ -1438,7 +1438,7 @@ class MacroAssembler : public TurboAssembler { void AssertSmi(Register object); #if V8_TARGET_ARCH_S390X - // Ensure it is permissable to read/write int value directly from + // Ensure it is permissible to read/write int value directly from // upper half of the smi. STATIC_ASSERT(kSmiTag == 0); STATIC_ASSERT(kSmiTagSize + kSmiShiftSize == 32); diff --git a/src/s390/simulator-s390.cc b/src/s390/simulator-s390.cc index 0888beff2cd..d17b77bd7e4 100644 --- a/src/s390/simulator-s390.cc +++ b/src/s390/simulator-s390.cc @@ -2408,7 +2408,7 @@ void Simulator::PrintStopInfo(uint32_t code) { #define CheckOverflowForIntSub(src1, src2, type) \ OverflowFromSigned(src1 - src2, src1, src2, false); -// Method for checking overflow on unsigned addtion +// Method for checking overflow on unsigned addition #define CheckOverflowForUIntAdd(src1, src2) \ ((src1) + (src2) < (src1) || (src1) + (src2) < (src2)) @@ -2514,7 +2514,7 @@ void Simulator::Execute() { } } else { // FLAG_stop_sim_at is at the non-default value. Stop in the debugger when - // we reach the particular instuction count. + // we reach the particular instruction count. while (program_counter != end_sim_pc) { Instruction* instr = reinterpret_cast(program_counter); if (icount_ == ::v8::internal::FLAG_stop_sim_at) { @@ -4177,7 +4177,7 @@ EVALUATE(STM) { // Store Multiple 32-bits. int offset = d2; // Regs roll around if r3 is less than r1. - // Artifically increase r3 by 16 so we can calculate + // Artificially increase r3 by 16 so we can calculate // the number of regs stored properly. if (r3 < r1) r3 += 16; @@ -4259,7 +4259,7 @@ EVALUATE(LM) { // Store Multiple 32-bits. int offset = d2; // Regs roll around if r3 is less than r1. - // Artifically increase r3 by 16 so we can calculate + // Artificially increase r3 by 16 so we can calculate // the number of regs stored properly. if (r3 < r1) r3 += 16; @@ -8782,7 +8782,7 @@ EVALUATE(LMG) { int offset = d2; // Regs roll around if r3 is less than r1. - // Artifically increase r3 by 16 so we can calculate + // Artificially increase r3 by 16 so we can calculate // the number of regs stored properly. if (r3 < r1) r3 += 16; @@ -8948,7 +8948,7 @@ EVALUATE(STMG) { int offset = d2; // Regs roll around if r3 is less than r1. - // Artifically increase r3 by 16 so we can calculate + // Artificially increase r3 by 16 so we can calculate // the number of regs stored properly. if (r3 < r1) r3 += 16; @@ -9159,7 +9159,7 @@ EVALUATE(STMY) { int offset = d2; // Regs roll around if r3 is less than r1. - // Artifically increase r3 by 16 so we can calculate + // Artificially increase r3 by 16 so we can calculate // the number of regs stored properly. if (r3 < r1) r3 += 16; @@ -9186,7 +9186,7 @@ EVALUATE(LMY) { int offset = d2; // Regs roll around if r3 is less than r1. - // Artifically increase r3 by 16 so we can calculate + // Artificially increase r3 by 16 so we can calculate // the number of regs stored properly. if (r3 < r1) r3 += 16; diff --git a/src/source-position-table.cc b/src/source-position-table.cc index 4babd4c0eb3..f7697e56942 100644 --- a/src/source-position-table.cc +++ b/src/source-position-table.cc @@ -39,7 +39,7 @@ void AddAndSetEntry(PositionTableEntry& value, value.is_statement = other.is_statement; } -// Helper: Substract the offsets from 'other' from 'value'. +// Helper: Subtract the offsets from 'other' from 'value'. void SubtractFromEntry(PositionTableEntry& value, const PositionTableEntry& other) { value.code_offset -= other.code_offset; diff --git a/src/third_party/valgrind/valgrind.h b/src/third_party/valgrind/valgrind.h index fa3f53675ee..7e6b2a8a39a 100644 --- a/src/third_party/valgrind/valgrind.h +++ b/src/third_party/valgrind/valgrind.h @@ -3758,7 +3758,7 @@ VALGRIND_PRINTF_BACKTRACE(const char *format, ...) /* These requests allow control to move from the simulated CPU to the - real CPU, calling an arbitary function. + real CPU, calling an arbitrary function. Note that the current ThreadId is inserted as the first argument. So this call: diff --git a/src/third_party/vtune/jitprofiling.h b/src/third_party/vtune/jitprofiling.h index 193f243851c..e23e11941a0 100644 --- a/src/third_party/vtune/jitprofiling.h +++ b/src/third_party/vtune/jitprofiling.h @@ -203,11 +203,11 @@ typedef struct _iJIT_Method_NIDS typedef struct _LineNumberInfo { - /* x86 Offset from the begining of the method*/ - unsigned int Offset; + /* x86 Offset from the beginning of the method*/ + unsigned int Offset; - /* source line number from the begining of the source file */ - unsigned int LineNumber; + /* source line number from the beginning of the source file */ + unsigned int LineNumber; } *pLineNumberInfo, LineNumberInfo; @@ -232,7 +232,7 @@ typedef struct _iJIT_Method_Load /* Line Table size in number of entries - Zero if none */ unsigned int line_number_size; - /* Pointer to the begining of the line numbers info array */ + /* Pointer to the beginning of the line numbers info array */ pLineNumberInfo line_number_table; /* unique class ID */ diff --git a/src/third_party/vtune/vtune-jit.cc b/src/third_party/vtune/vtune-jit.cc index 0bd19546ac1..57d84440178 100644 --- a/src/third_party/vtune/vtune-jit.cc +++ b/src/third_party/vtune/vtune-jit.cc @@ -134,7 +134,7 @@ static JITCodeLineInfo* UntagLineInfo(void* ptr) { // The parameter str is a mixed pattern which contains the // function name and some other info. It comes from all the -// Logger::CodeCreateEvent(...) function. This funtion get the +// Logger::CodeCreateEvent(...) function. This function get the // pure function name from the input parameter. static char* GetFunctionNameFromMixedName(const char* str, int length) { int index = 0; diff --git a/src/wasm/function-body-decoder.cc b/src/wasm/function-body-decoder.cc index f558acf356b..32a02aac15e 100644 --- a/src/wasm/function-body-decoder.cc +++ b/src/wasm/function-body-decoder.cc @@ -455,7 +455,7 @@ class WasmDecoder : public Decoder { } case kExprTry: - case kExprIf: // fall thru + case kExprIf: // fall through case kExprLoop: case kExprBlock: { BlockTypeOperand operand(decoder, pc); diff --git a/src/wasm/wasm-debug.cc b/src/wasm/wasm-debug.cc index 3c9d4542991..fbbc35fc8ce 100644 --- a/src/wasm/wasm-debug.cc +++ b/src/wasm/wasm-debug.cc @@ -189,9 +189,9 @@ class InterpreterHandle { return interpreter()->GetThread(0)->GetFrameCount(); } - // Returns true if exited regularly, false if a trap/exception occured and was - // not handled inside this activation. In the latter case, a pending exception - // will have been set on the isolate. + // Returns true if exited regularly, false if a trap/exception occurred and + // was not handled inside this activation. In the latter case, a pending + // exception will have been set on the isolate. bool Execute(Handle instance_object, Address frame_pointer, uint32_t func_index, uint8_t* arg_buffer) { diff --git a/src/wasm/wasm-module.h b/src/wasm/wasm-module.h index 53563973f93..3f66f4a5ae6 100644 --- a/src/wasm/wasm-module.h +++ b/src/wasm/wasm-module.h @@ -525,9 +525,9 @@ void UnpackAndRegisterProtectedInstructions(Isolate* isolate, // Then triggers WasmCompiledModule::CompileLazy, taking care of correctly // patching the call site or indirect function tables. // Returns either the Code object that has been lazily compiled, or Illegal if -// an error occured. In the latter case, a pending exception has been set, which -// will be triggered when returning from the runtime function, i.e. the Illegal -// builtin will never be called. +// an error occurred. In the latter case, a pending exception has been set, +// which will be triggered when returning from the runtime function, i.e. the +// Illegal builtin will never be called. Handle CompileLazy(Isolate* isolate); // This class orchestrates the lazy compilation of wasm functions. It is diff --git a/src/wasm/wasm-objects.h b/src/wasm/wasm-objects.h index 8014aca22e9..0f7b9356f03 100644 --- a/src/wasm/wasm-objects.h +++ b/src/wasm/wasm-objects.h @@ -617,11 +617,11 @@ class WasmDebugInfo : public FixedArray { void PrepareStep(StepAction); - // Execute the specified funtion in the interpreter. Read arguments from + // Execute the specified function in the interpreter. Read arguments from // arg_buffer. // The frame_pointer will be used to identify the new activation of the // interpreter for unwinding and frame inspection. - // Returns true if exited regularly, false if a trap occured. In the latter + // Returns true if exited regularly, false if a trap occurred. In the latter // case, a pending exception will have been set on the isolate. bool RunInterpreter(Address frame_pointer, int func_index, uint8_t* arg_buffer); diff --git a/src/x64/assembler-x64.cc b/src/x64/assembler-x64.cc index 8c90fd60320..afd1aff83f1 100644 --- a/src/x64/assembler-x64.cc +++ b/src/x64/assembler-x64.cc @@ -4794,7 +4794,7 @@ void Assembler::RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data) { !serializer_enabled() && !emit_debug_code()) { return; } else if (rmode == RelocInfo::CODE_AGE_SEQUENCE) { - // Don't record psuedo relocation info for code age sequence mode. + // Don't record pseudo relocation info for code age sequence mode. return; } RelocInfo rinfo(pc_, rmode, data, NULL); diff --git a/src/x64/assembler-x64.h b/src/x64/assembler-x64.h index 695a4b69078..ebf182409f7 100644 --- a/src/x64/assembler-x64.h +++ b/src/x64/assembler-x64.h @@ -2492,7 +2492,7 @@ class Assembler : public AssemblerBase { arithmetic_op(0x31, src, dst, size); } - // Most BMI instructions are similiar. + // Most BMI instructions are similar. void bmi1q(byte op, Register reg, Register vreg, Register rm); void bmi1q(byte op, Register reg, Register vreg, const Operand& rm); void bmi1l(byte op, Register reg, Register vreg, Register rm); diff --git a/src/x64/macro-assembler-x64.h b/src/x64/macro-assembler-x64.h index a3c5c5e9aba..57e079f52b0 100644 --- a/src/x64/macro-assembler-x64.h +++ b/src/x64/macro-assembler-x64.h @@ -951,7 +951,7 @@ class MacroAssembler : public TurboAssembler { Label* on_not_smi_result = NULL, Label::Distance near_jump = Label::kFar); // Shifts a smi value to the right, shifting in zero bits at the top, and - // returns the unsigned intepretation of the result if that is a smi. + // returns the unsigned interpretation of the result if that is a smi. // Uses and clobbers rcx, so dst may not be rcx. void SmiShiftLogicalRight(Register dst, Register src1, @@ -959,7 +959,7 @@ class MacroAssembler : public TurboAssembler { Label* on_not_smi_result, Label::Distance near_jump = Label::kFar); // Shifts a smi value to the right, sign extending the top, and - // returns the signed intepretation of the result. That will always + // returns the signed interpretation of the result. That will always // be a valid smi value, since it's numerically smaller than the // original. // Uses and clobbers rcx, so dst may not be rcx. diff --git a/src/zone/zone-chunk-list.h b/src/zone/zone-chunk-list.h index 8c7e5d98d02..a0aaca8b09a 100644 --- a/src/zone/zone-chunk-list.h +++ b/src/zone/zone-chunk-list.h @@ -25,7 +25,7 @@ class ReverseZoneChunkListIterator; // collection that // * needs to grow indefinitely, // * will mostly grow at the back, but may sometimes grow in front as well -// (preferrably in batches), +// (preferably in batches), // * needs to have very low overhead, // * offers forward- and backwards-iteration, // * offers relatively fast seeking, diff --git a/src/zone/zone.cc b/src/zone/zone.cc index d2dd9ce0683..d9113a8f767 100644 --- a/src/zone/zone.cc +++ b/src/zone/zone.cc @@ -171,7 +171,7 @@ Address Zone::NewExpand(size_t size) { Address result = RoundUp(segment->start(), kAlignmentInBytes); position_ = result + size; // Check for address overflow. - // (Should not happen since the segment is guaranteed to accomodate + // (Should not happen since the segment is guaranteed to accommodate // size bytes + header and alignment padding) DCHECK(reinterpret_cast(position_) >= reinterpret_cast(result)); diff --git a/test/cctest/heap/test-spaces.cc b/test/cctest/heap/test-spaces.cc index 26b2fdd1930..24c2594f9b7 100644 --- a/test/cctest/heap/test-spaces.cc +++ b/test/cctest/heap/test-spaces.cc @@ -678,11 +678,11 @@ TEST(ShrinkPageToHighWaterMarkFreeSpaceEnd) { HeapObject* filler = HeapObject::FromAddress(array->address() + array->Size()); CHECK(filler->IsFreeSpace()); - size_t shrinked = page->ShrinkToHighWaterMark(); - size_t should_have_shrinked = + size_t shrunk = page->ShrinkToHighWaterMark(); + size_t should_have_shrunk = RoundDown(static_cast(Page::kAllocatableMemory - array->Size()), base::OS::CommitPageSize()); - CHECK_EQ(should_have_shrinked, shrinked); + CHECK_EQ(should_have_shrunk, shrunk); } TEST(ShrinkPageToHighWaterMarkNoFiller) { @@ -702,8 +702,8 @@ TEST(ShrinkPageToHighWaterMarkNoFiller) { CcTest::heap()->old_space()->ResetFreeList(); CcTest::heap()->old_space()->EmptyAllocationInfo(); - const size_t shrinked = page->ShrinkToHighWaterMark(); - CHECK_EQ(0u, shrinked); + const size_t shrunk = page->ShrinkToHighWaterMark(); + CHECK_EQ(0u, shrunk); } TEST(ShrinkPageToHighWaterMarkOneWordFiller) { @@ -728,8 +728,8 @@ TEST(ShrinkPageToHighWaterMarkOneWordFiller) { HeapObject::FromAddress(array->address() + array->Size()); CHECK_EQ(filler->map(), CcTest::heap()->one_pointer_filler_map()); - const size_t shrinked = page->ShrinkToHighWaterMark(); - CHECK_EQ(0u, shrinked); + const size_t shrunk = page->ShrinkToHighWaterMark(); + CHECK_EQ(0u, shrunk); } TEST(ShrinkPageToHighWaterMarkTwoWordFiller) { @@ -754,8 +754,8 @@ TEST(ShrinkPageToHighWaterMarkTwoWordFiller) { HeapObject::FromAddress(array->address() + array->Size()); CHECK_EQ(filler->map(), CcTest::heap()->two_pointer_filler_map()); - const size_t shrinked = page->ShrinkToHighWaterMark(); - CHECK_EQ(0u, shrinked); + const size_t shrunk = page->ShrinkToHighWaterMark(); + CHECK_EQ(0u, shrunk); } } // namespace internal diff --git a/test/cctest/test-api.cc b/test/cctest/test-api.cc index bef52fb70b7..1e2d4507916 100644 --- a/test/cctest/test-api.cc +++ b/test/cctest/test-api.cc @@ -9724,7 +9724,7 @@ static void UnreachableGetter( static void UnreachableSetter(Local, Local, const v8::PropertyCallbackInfo&) { - CHECK(false); // This function should nto be called. + CHECK(false); // This function should not be called. } diff --git a/test/cctest/test-debug.cc b/test/cctest/test-debug.cc index e6ac2eb9021..517202936f9 100644 --- a/test/cctest/test-debug.cc +++ b/test/cctest/test-debug.cc @@ -4052,7 +4052,7 @@ TEST(NoBreakWhenBootstrapping) { v8::HandleScope handle_scope(isolate); v8::Context::New(isolate, &extensions); } - // Check that no DebugBreak events occured during the context creation. + // Check that no DebugBreak events occurred during the context creation. CHECK_EQ(0, break_point_hit_count); // Get rid of the debug event listener. @@ -5176,7 +5176,7 @@ TEST(RegExpDebugBreak) { frame_function_name_source, "frame_function_name"); - // Test RegExp which matches white spaces and comments at the begining of a + // Test RegExp which matches white spaces and comments at the beginning of a // source line. const char* script = "var sourceLineBeginningSkip = /^(?:[ \\v\\h]*(?:\\/\\*.*?\\*\\/)*)*/;\n" @@ -5621,7 +5621,7 @@ static void DebugEventContextChecker(const v8::Debug::EventDetails& details) { } -// Check that event details contain context where debug event occured. +// Check that event details contain context where debug event occurred. TEST(DebugEventContext) { v8::Isolate* isolate = CcTest::isolate(); v8::HandleScope scope(isolate); diff --git a/test/cctest/test-inobject-slack-tracking.cc b/test/cctest/test-inobject-slack-tracking.cc index 321837326f9..95811724a89 100644 --- a/test/cctest/test-inobject-slack-tracking.cc +++ b/test/cctest/test-inobject-slack-tracking.cc @@ -525,7 +525,7 @@ TEST(SubclassBasicNoInlineNew) { } -// Creates class hierachy of length matching the |hierarchy_desc| length and +// Creates class hierarchy of length matching the |hierarchy_desc| length and // with the number of fields at i'th level equal to |hierarchy_desc[i]|. static void CreateClassHierarchy(const std::vector& hierarchy_desc) { std::ostringstream os; diff --git a/test/cctest/test-orderedhashtable.cc b/test/cctest/test-orderedhashtable.cc index 1e857325faa..e17a62dbd2d 100644 --- a/test/cctest/test-orderedhashtable.cc +++ b/test/cctest/test-orderedhashtable.cc @@ -702,7 +702,7 @@ TEST(OrderedHashMapDeletion) { CHECK(!OrderedHashMap::HasKey(isolate, *map, *key2)); CHECK(!OrderedHashMap::HasKey(isolate, *map, *key3)); - // Delete non existant key from non new hash table + // Delete non existent key from non new hash table CHECK(!OrderedHashMap::Delete(isolate, *map, *key3)); Verify(map); CHECK_EQ(2, map->NumberOfBuckets()); @@ -712,7 +712,7 @@ TEST(OrderedHashMapDeletion) { CHECK(!OrderedHashMap::HasKey(isolate, *map, *key2)); CHECK(!OrderedHashMap::HasKey(isolate, *map, *key3)); - // Delete non existant key from non empty hash table + // Delete non existent key from non empty hash table map = OrderedHashMap::Shrink(map); map = OrderedHashMap::Add(map, key1, value); Verify(map); @@ -852,7 +852,7 @@ TEST(OrderedHashSetDeletion) { CHECK(!OrderedHashSet::HasKey(isolate, *set, *key2)); CHECK(!OrderedHashSet::HasKey(isolate, *set, *key3)); - // Delete non existant key from non new hash table + // Delete non existent key from non new hash table CHECK(!OrderedHashSet::Delete(isolate, *set, *key3)); Verify(set); CHECK_EQ(2, set->NumberOfBuckets()); @@ -862,7 +862,7 @@ TEST(OrderedHashSetDeletion) { CHECK(!OrderedHashSet::HasKey(isolate, *set, *key2)); CHECK(!OrderedHashSet::HasKey(isolate, *set, *key3)); - // Delete non existant key from non empty hash table + // Delete non existent key from non empty hash table set = OrderedHashSet::Shrink(set); set = OrderedHashSet::Add(set, key1); Verify(set); diff --git a/test/debugger/debug/debug-receiver.js b/test/debugger/debug/debug-receiver.js index 9096e315f6e..d93c313fa7e 100644 --- a/test/debugger/debug/debug-receiver.js +++ b/test/debugger/debug/debug-receiver.js @@ -37,7 +37,7 @@ var end_test_count = 0; var break_count = 0; // Debug event listener which delegates. Exceptions have to be -// explictly caught here and checked later because exception in the +// explicitly caught here and checked later because exception in the // listener are not propagated to the surrounding JavaScript code. function listener(event, exec_state, event_data, data) { try { diff --git a/test/inspector/cpu-profiler/stop-without-preceeding-start-expected.txt b/test/inspector/cpu-profiler/stop-without-preceeding-start-expected.txt index 2c6dd1e38f7..0c0f6825131 100644 --- a/test/inspector/cpu-profiler/stop-without-preceeding-start-expected.txt +++ b/test/inspector/cpu-profiler/stop-without-preceeding-start-expected.txt @@ -1,2 +1,2 @@ -Test that profiler doesn't crash when we call stop without preceeding start. +Test that profiler doesn't crash when we call stop without preceding start. PASS: ProfileAgent.stop diff --git a/test/inspector/cpu-profiler/stop-without-preceeding-start.js b/test/inspector/cpu-profiler/stop-without-preceeding-start.js index 5f21e653f1e..848e1d2d355 100644 --- a/test/inspector/cpu-profiler/stop-without-preceeding-start.js +++ b/test/inspector/cpu-profiler/stop-without-preceeding-start.js @@ -2,7 +2,7 @@ // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. -let {session, contextGroup, Protocol} = InspectorTest.start("Test that profiler doesn't crash when we call stop without preceeding start."); +let {session, contextGroup, Protocol} = InspectorTest.start("Test that profiler doesn't crash when we call stop without preceding start."); Protocol.Profiler.stop().then(didStopProfile); function didStopProfile(messageObject) diff --git a/test/intl/general/case-mapping.js b/test/intl/general/case-mapping.js index a7273390207..79d16248212 100644 --- a/test/intl/general/case-mapping.js +++ b/test/intl/general/case-mapping.js @@ -61,7 +61,7 @@ assertEquals("ABCSS", "abCß".toLocaleUpperCase("tr")); // test262/intl402/Strings/* // Buffer size decrease with a single locale or locale list. -// In Turkic (tr, az), U+0307 preceeded by Capital Letter I is dropped. +// In Turkic (tr, az), U+0307 preceded by Capital Letter I is dropped. assertEquals("abci", "aBcI\u0307".toLocaleLowerCase("tr")); assertEquals("abci", "aBcI\u0307".toLocaleLowerCase("az")); assertEquals("abci", "aBcI\u0307".toLocaleLowerCase(["tr", "en"])); diff --git a/test/mjsunit/asm/poppler/poppler.js b/test/mjsunit/asm/poppler/poppler.js index b9087f1edfc..35156fbcfed 100644 --- a/test/mjsunit/asm/poppler/poppler.js +++ b/test/mjsunit/asm/poppler/poppler.js @@ -172,7 +172,7 @@ else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) { } } else { - // Unreachable because SHELL is dependant on the others + // Unreachable because SHELL is dependent on the others throw 'Unknown runtime environment. Where are we?'; } @@ -595,7 +595,7 @@ var globalScope = this; // @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C") // @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and // 'array' for JavaScript arrays and typed arrays; note that arrays are 8-bit). -// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType, +// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be omitted). Types are as in returnType, // except that 'array' is not possible (there is no way for us to know the length of the array) // @param args An array of the arguments to the function, as native JS values (as in returnType) // Note that string arguments will be stored on the stack (the JS string will become a C string on the stack). diff --git a/test/mjsunit/cyrillic.js b/test/mjsunit/cyrillic.js index 9b21c4f8eca..f74743a3169 100644 --- a/test/mjsunit/cyrillic.js +++ b/test/mjsunit/cyrillic.js @@ -132,7 +132,7 @@ for (var i = 0; i < 2; i++) { // Sigma is special because there are two lower case versions of the same upper -// case character. JS requires that case independece means that you should +// case character. JS requires that case independence means that you should // convert everything to upper case, so the two sigma variants are equal to each // other in a case independt comparison. for (var i = 0; i < 2; i++) { diff --git a/test/mjsunit/date-parse.js b/test/mjsunit/date-parse.js index 62dddfd1c24..59f0e367cac 100644 --- a/test/mjsunit/date-parse.js +++ b/test/mjsunit/date-parse.js @@ -207,7 +207,7 @@ var testCasesPDT = [ // Local time cases. var testCasesLocalTime = [ - // Allow timezone ommision. + // Allow timezone omission. 'Sat, 01-Jan-2000 08:00:00', 'Sat, 01 Jan 2000 08:00:00', 'Jan 01 2000 08:00:00', diff --git a/test/mjsunit/es6/reflect-define-property.js b/test/mjsunit/es6/reflect-define-property.js index 8eb3f6580ef..6ead02ba748 100644 --- a/test/mjsunit/es6/reflect-define-property.js +++ b/test/mjsunit/es6/reflect-define-property.js @@ -920,7 +920,7 @@ for (var i = 0; i < 1000; i++) { assertEquals(999, o[999]); -// Regression test: Bizzare behavior on non-strict arguments object. +// Regression test: Bizarre behavior on non-strict arguments object. // TODO(yangguo): Tests disabled, needs investigation! /* (function test(arg0) { diff --git a/test/mjsunit/es6/typedarray-slice.js b/test/mjsunit/es6/typedarray-slice.js index 4fa3b9f21fb..2f40fe54253 100644 --- a/test/mjsunit/es6/typedarray-slice.js +++ b/test/mjsunit/es6/typedarray-slice.js @@ -124,7 +124,7 @@ function testCustomSubclass(superClass, speciesClass) { // Custom constructor with shared buffer. exampleArray = new Array(64).fill(0).map((v,i) => i); let filledBuffer = new Uint8Array(exampleArray).buffer; - // Create a view for the begining of the buffer. + // Create a view for the beginning of the buffer. let customArray2 = new superClass(filledBuffer, 0, 3); customArray2.constructor = { [Symbol.species]: function(length) { diff --git a/test/mjsunit/large-object-literal.js b/test/mjsunit/large-object-literal.js index e44c05794a6..8bf4debbb79 100644 --- a/test/mjsunit/large-object-literal.js +++ b/test/mjsunit/large-object-literal.js @@ -78,7 +78,7 @@ for (var i = 0; i < sizes.length; i++) { } -// Larg Object dictionary mode literal. +// Large Object dictionary mode literal. function TestSlowLiteralOptimized() { diff --git a/test/mjsunit/migrations.js b/test/mjsunit/migrations.js index 2bd70fb7719..1828a612dc8 100644 --- a/test/mjsunit/migrations.js +++ b/test/mjsunit/migrations.js @@ -278,7 +278,7 @@ var migrations = [ migr: function(o, i) { Object.seal(o); }, }, { // Must be the last in the sequence, because after the global object freeze - // the other modifications does not make sence. + // the other modifications does not make sense. name: "freeze", migr: function(o, i) { Object.freeze(o); }, }, diff --git a/test/mjsunit/mjsunit.js b/test/mjsunit/mjsunit.js index 4d040763322..77f8b7605b2 100644 --- a/test/mjsunit/mjsunit.js +++ b/test/mjsunit/mjsunit.js @@ -80,7 +80,7 @@ var assertArrayEquals; var assertPropertiesEqual; // Assert that the string conversion of the found value is equal to -// the expected string. Only kept for backwards compatability, please +// the expected string. Only kept for backwards compatibility, please // check the real structure of the found value. var assertToStringEquals; diff --git a/test/mjsunit/object-define-property.js b/test/mjsunit/object-define-property.js index 1aac489839c..cc9c0b79a68 100644 --- a/test/mjsunit/object-define-property.js +++ b/test/mjsunit/object-define-property.js @@ -1014,7 +1014,7 @@ for (var i = 0; i < 1000; i++) { assertEquals(999, o[999]); -// Regression test: Bizzare behavior on non-strict arguments object. +// Regression test: Bizarre behavior on non-strict arguments object. // TODO(yangguo): Tests disabled, needs investigation! /* (function test(arg0) { diff --git a/test/mjsunit/regress/regress-1708.js b/test/mjsunit/regress/regress-1708.js index ed2ddb1458f..a2937750d74 100644 --- a/test/mjsunit/regress/regress-1708.js +++ b/test/mjsunit/regress/regress-1708.js @@ -57,7 +57,7 @@ assertEquals(50, array.length); // At this point "array" should have been trimmed from the left with - // marking bits being correctly transfered to the new object start. + // marking bits being correctly transferred to the new object start. // Scavenging operations cause concurrent sweeping to advance and verify // that marking bit patterns are still sane. for (var i = 0; i < 200; i++) { diff --git a/test/mjsunit/regress/regress-2595.js b/test/mjsunit/regress/regress-2595.js index 5bb5f6d16ae..c7e95711a8f 100644 --- a/test/mjsunit/regress/regress-2595.js +++ b/test/mjsunit/regress/regress-2595.js @@ -39,7 +39,7 @@ function F(x) { } // First make CALL IC in F go MEGAMORPHIC and ensure that we put the stub -// that calls p.f (guarded by a negative dictionary lookup on the reciever) +// that calls p.f (guarded by a negative dictionary lookup on the receiver) // into the stub cache assertEquals("p", F(o)); assertEquals("p", F(o)); diff --git a/test/mjsunit/regress/regress-6288.js b/test/mjsunit/regress/regress-6288.js index eb8e7359201..337af54c1a8 100644 --- a/test/mjsunit/regress/regress-6288.js +++ b/test/mjsunit/regress/regress-6288.js @@ -4,7 +4,7 @@ // Environment Variables: LC_ALL=pt-BR.UTF8 -// The data files packaged with d8 currently have Brazillian Portugese +// The data files packaged with d8 currently have Brazillian Portuguese // DateTimeFormat but not Collation if (this.Intl) { diff --git a/test/mjsunit/regress/regress-718891.js b/test/mjsunit/regress/regress-718891.js index 60ce380e011..209568dca3e 100644 --- a/test/mjsunit/regress/regress-718891.js +++ b/test/mjsunit/regress/regress-718891.js @@ -20,7 +20,7 @@ function TestDontSelfHealWithDeoptedCode(run_unoptimized, ClosureFactory) { unoptimized_closure(); } - // Run and optimize the code (do this in a seperate function + // Run and optimize the code (do this in a separate function // so that the closure doesn't leak in a dead register). (() => { var optimized_closure = ClosureFactory(); diff --git a/test/mjsunit/regress/regress-regexp-codeflush.js b/test/mjsunit/regress/regress-regexp-codeflush.js index 8e7b0396e80..03fe321690a 100644 --- a/test/mjsunit/regress/regress-regexp-codeflush.js +++ b/test/mjsunit/regress/regress-regexp-codeflush.js @@ -31,7 +31,7 @@ // internally calls RegExpImpl::IrregexpExecOnce more than once without // ensuring that the regexp is compiled. // This can create a crash if the code was exchanged with the sweep -// generation (for code flushing support) in GC durring the matching. +// generation (for code flushing support) in GC during the matching. var re = new RegExp('(s)', "g"); diff --git a/test/mjsunit/unicode-test.js b/test/mjsunit/unicode-test.js index 1d64420c302..509eb895668 100644 --- a/test/mjsunit/unicode-test.js +++ b/test/mjsunit/unicode-test.js @@ -4110,7 +4110,7 @@ var source = " if no space is available. Additionally, on failure, errno is\n" + " set to ENOMEM on ANSI C systems.\n" + "\n" + -" If n is zero, malloc returns a minumum-sized chunk. (The minimum\n" + +" If n is zero, malloc returns a minimum-sized chunk. (The minimum\n" + " size is 16 bytes on most 32bit systems, and 24 or 32 bytes on 64bit\n" + " systems.) On most systems, size_t is an unsigned type, so calls\n" + " with negative arguments are interpreted as requests for huge amounts\n" + @@ -5364,7 +5364,7 @@ var source = " and consolidated sets of chunks, which is what these bins hold, so\n" + " they can be found quickly. All procedures maintain the invariant\n" + " that no consolidated chunk physically borders another one, so each\n" + -" chunk in a list is known to be preceeded and followed by either\n" + +" chunk in a list is known to be preceded and followed by either\n" + " inuse chunks or the ends of memory.\n" + "\n" + " Chunks in bins are kept in size order, with ties going to the\n" + @@ -9097,7 +9097,7 @@ assertEquals(25640, hebrew.length, "hebrew utf8 in source"); assertEquals(31082, japanese.length, "japanese utf8 in source"); assertEquals(12291, korean.length, "korean utf8 in source"); assertEquals(13851, persian.length, "persian utf8 in source"); -assertEquals(177470, source.length, "source utf8 in source"); +assertEquals(177469, source.length, "source utf8 in source"); assertEquals(18315, thai.length, "thai utf8 in source"); munged_sizes = new Array(17197, 2511, 2645, 3820, 3086, 2609, diff --git a/test/mjsunit/wasm/async-compile.js b/test/mjsunit/wasm/async-compile.js index 854e8bb6c17..fe7b1aa8866 100644 --- a/test/mjsunit/wasm/async-compile.js +++ b/test/mjsunit/wasm/async-compile.js @@ -56,7 +56,7 @@ assertPromiseResult(async function basicCompile() { assertPromiseResult(async function badFunctionInTheMiddle() { // We had an error where an exception was generated by a background task and // later thrown in a foreground task. The handle to the exception died - // inbetween, since the HandleScope was left. + // between, since the HandleScope was left. // This test reproduced that error. let builder = new WasmModuleBuilder(); let sig = builder.addType(kSig_i_v); diff --git a/test/promises-aplus/lib/require.js b/test/promises-aplus/lib/require.js index 725e45e6483..b987a1a8623 100644 --- a/test/promises-aplus/lib/require.js +++ b/test/promises-aplus/lib/require.js @@ -40,7 +40,7 @@ var require = function(name) { } else if (name === 'sinon') { path = base + 'sinon/sinon.js'; } else { - throw Error('We cannnot load the library: ' + name); + throw Error('We cannot load the library: ' + name); } eval('(function() { ' + read(path) + '}())'); if (name === 'sinon') { diff --git a/test/test262/test262.status b/test/test262/test262.status index bbaec1bb541..8dc62e2696a 100644 --- a/test/test262/test262.status +++ b/test/test262/test262.status @@ -483,7 +483,7 @@ ##################### DELIBERATE INCOMPATIBILITIES ##################### # We do not expose Array.prototype.values due to webcompat issues. - # Most recent incompatability: https://crbug.com/615873 + # Most recent incompatibility: https://crbug.com/615873 # https://code.google.com/p/v8/issues/detail?id=4247 'built-ins/Array/prototype/Symbol.iterator': [FAIL], 'built-ins/Array/prototype/values/returns-iterator': [FAIL], diff --git a/test/unittests/base/platform/time-unittest.cc b/test/unittests/base/platform/time-unittest.cc index 8b81eb90d66..7417e1c70b8 100644 --- a/test/unittests/base/platform/time-unittest.cc +++ b/test/unittests/base/platform/time-unittest.cc @@ -243,13 +243,13 @@ TEST(TimeTicks, TimerPerformance) { for (int index = 0; index < kLoops; index++) test_case.func(); TimeTicks stop = TimeTicks::Now(); - // Turning off the check for acceptible delays. Without this check, + // Turning off the check for acceptable delays. Without this check, // the test really doesn't do much other than measure. But the // measurements are still useful for testing timers on various platforms. // The reason to remove the check is because the tests run on many // buildbots, some of which are VMs. These machines can run horribly // slow, and there is really no value for checking against a max timer. - // const int kMaxTime = 35; // Maximum acceptible milliseconds for test. + // const int kMaxTime = 35; // Maximum acceptable milliseconds for test. // EXPECT_LT((stop - start).InMilliseconds(), kMaxTime); printf("%s: %1.2fus per call\n", test_case.description, (stop - start).InMillisecondsF() * 1000 / kLoops); diff --git a/test/webkit/array-reset-large-index-expected.txt b/test/webkit/array-reset-large-index-expected.txt index 9ab93ccc979..404f12b9500 100644 --- a/test/webkit/array-reset-large-index-expected.txt +++ b/test/webkit/array-reset-large-index-expected.txt @@ -21,7 +21,7 @@ # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS # SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -This test puts an item in a big index and then tries to change it. It shoudl change successfully. +This test puts an item in a big index and then tries to change it. It should change successfully. On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE". diff --git a/test/webkit/array-reset-large-index.js b/test/webkit/array-reset-large-index.js index 532d9f0a8e5..d587ad3ffe4 100644 --- a/test/webkit/array-reset-large-index.js +++ b/test/webkit/array-reset-large-index.js @@ -22,7 +22,7 @@ // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. description( -"This test puts an item in a big index and then tries to change it. It shoudl change successfully." +"This test puts an item in a big index and then tries to change it. It should change successfully." ); var array = []; diff --git a/test/webkit/dfg-inline-unused-this.js b/test/webkit/dfg-inline-unused-this.js index 826008326bf..ece070b2372 100644 --- a/test/webkit/dfg-inline-unused-this.js +++ b/test/webkit/dfg-inline-unused-this.js @@ -45,7 +45,7 @@ for (var i = 0; i < 1000; ++i) { offset = 42; } - // Create some bizzare object to prevent method_check optimizations, since those will result in + // Create some bizarre object to prevent method_check optimizations, since those will result in // a failure while the function is still live. var object = {}; object["a" + i] = i; diff --git a/test/webkit/dfg-intrinsic-unused-this.js b/test/webkit/dfg-intrinsic-unused-this.js index fa2086873bc..33a3c3279d7 100644 --- a/test/webkit/dfg-intrinsic-unused-this.js +++ b/test/webkit/dfg-intrinsic-unused-this.js @@ -41,7 +41,7 @@ for (var i = 0; i < 1000; ++i) { offset = 42; } - // Create some bizzare object to prevent method_check optimizations, since those will result in + // Create some bizarre object to prevent method_check optimizations, since those will result in // a failure while the function is still live. var object = {}; object["a" + i] = i; diff --git a/test/webkit/fast/js/kde/operators.js b/test/webkit/fast/js/kde/operators.js index 38e658b2bdb..a3b6eb69742 100644 --- a/test/webkit/fast/js/kde/operators.js +++ b/test/webkit/fast/js/kde/operators.js @@ -240,7 +240,7 @@ shouldBe("'a' + null", "'anull'"); shouldBe("true+1", "2"); shouldBe("false+null", "0"); -// substraction +// subtraction shouldBe("1-3", "-2"); shouldBe("isNaN('a'-3)", "true"); shouldBe("'3'-'-1'", "4"); diff --git a/test/webkit/fast/js/read-modify-eval.js b/test/webkit/fast/js/read-modify-eval.js index 637bc5e8dad..2ba6579f8b9 100644 --- a/test/webkit/fast/js/read-modify-eval.js +++ b/test/webkit/fast/js/read-modify-eval.js @@ -132,7 +132,7 @@ function postDecTest() function primitiveThisTest() { - // Test that conversion of this is persistant over multiple calls to eval, + // Test that conversion of this is persistent over multiple calls to eval, // even where 'this' is not directly used within the function. eval('this.value = "Seekrit message";'); return eval('this.value') === "Seekrit message"; diff --git a/test/webkit/regexp-compile-crash-expected.txt b/test/webkit/regexp-compile-crash-expected.txt index 377e786363b..d654481b918 100644 --- a/test/webkit/regexp-compile-crash-expected.txt +++ b/test/webkit/regexp-compile-crash-expected.txt @@ -21,7 +21,7 @@ # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS # SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -Test regexp compiling to make sure it doens't crash like bug 16127 +Test regexp compiling to make sure it doesn't crash like bug 16127 On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE". diff --git a/test/webkit/regexp-compile-crash.js b/test/webkit/regexp-compile-crash.js index 87abbcb5e48..5149970f865 100644 --- a/test/webkit/regexp-compile-crash.js +++ b/test/webkit/regexp-compile-crash.js @@ -21,7 +21,7 @@ // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -description("Test regexp compiling to make sure it doens't crash like bug 16127"); +description("Test regexp compiling to make sure it doesn't crash like bug 16127"); shouldBeTrue('!!/\\)[;\s]+/'); shouldThrow('/[/'); diff --git a/tools/concatenate-files.py b/tools/concatenate-files.py index 86bdf563836..8a9012cfa28 100644 --- a/tools/concatenate-files.py +++ b/tools/concatenate-files.py @@ -31,7 +31,7 @@ # it is equivalent to: # cat file1 file2 file3 ...files... > target # -# The reason for writing a seperate utility is that 'cat' is not available +# The reason for writing a separate utility is that 'cat' is not available # on all supported build platforms, but Python is, and hence this provides # us with an easy and uniform way of doing this on all platforms. @@ -49,7 +49,7 @@ def Concatenate(filenames): True, if the operation was successful. """ if len(filenames) < 2: - print "An error occured generating %s:\nNothing to do." % filenames[-1] + print "An error occurred generating %s:\nNothing to do." % filenames[-1] return False try: @@ -59,7 +59,7 @@ def Concatenate(filenames): target.write(current.read()) return True except IOError as e: - print "An error occured when writing %s:\n%s" % (filenames[-1], e) + print "An error occurred when writing %s:\n%s" % (filenames[-1], e) return False diff --git a/tools/grokdump.py b/tools/grokdump.py index 883e4db9d9d..4d22333d7bd 100755 --- a/tools/grokdump.py +++ b/tools/grokdump.py @@ -3119,7 +3119,7 @@ def output_search_res(self, f, straddress): self.output_find_results(f, unaligned_res) if len(aligned_res) + len(unaligned_res) == 0: - f.write("

No occurences of 0x%x found in the dump

" % address) + f.write("

No occurrences of 0x%x found in the dump

" % address) self.output_footer(f) diff --git a/tools/ic-explorer.html b/tools/ic-explorer.html index c557de8c0fb..d28f8b94388 100644 --- a/tools/ic-explorer.html +++ b/tools/ic-explorer.html @@ -64,7 +64,7 @@ 'state', 'key', 'map', 'reason', 'file', ]; - // For compatiblity with console scripts: + // For compatibility with console scripts: print = console.log; class CustomIcProcessor extends IcProcessor { diff --git a/tools/js2c.py b/tools/js2c.py index f6dcf90b7b2..7c92a4ef6ed 100755 --- a/tools/js2c.py +++ b/tools/js2c.py @@ -217,7 +217,7 @@ def ExpandInlineMacros(lines): name_pattern = re.compile("\\b%s\\(" % name) macro = TextMacro(args, body) - # advance position to where the macro defintion was + # advance position to where the macro definition was pos = macro_match.start() def non_expander(s): @@ -242,7 +242,7 @@ def ExpandInlineConstants(lines): lines = (lines[:const_match.start()] + re.sub(name_pattern, replacement, lines[const_match.end():])) - # advance position to where the constant defintion was + # advance position to where the constant definition was pos = const_match.start() diff --git a/tools/mb/docs/user_guide.md b/tools/mb/docs/user_guide.md index 9817553bf6a..b897fa4d671 100644 --- a/tools/mb/docs/user_guide.md +++ b/tools/mb/docs/user_guide.md @@ -20,7 +20,7 @@ For more discussion of MB, see also [the design spec](design_spec.md). ### `mb analyze` -`mb analyze` is reponsible for determining what targets are affected by +`mb analyze` is responsible for determining what targets are affected by a list of files (e.g., the list of files in a patch on a trybot): ``` diff --git a/tools/profviz/gnuplot-4.6.3-emscripten.js b/tools/profviz/gnuplot-4.6.3-emscripten.js index 42a21c8919c..99a986eb803 100644 --- a/tools/profviz/gnuplot-4.6.3-emscripten.js +++ b/tools/profviz/gnuplot-4.6.3-emscripten.js @@ -158,7 +158,7 @@ if (ENVIRONMENT_IS_WORKER) { Module['load'] = importScripts; } if (!ENVIRONMENT_IS_WORKER && !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_SHELL) { - // Unreachable because SHELL is dependant on the others + // Unreachable because SHELL is dependent on the others throw 'Unknown runtime environment. Where are we?'; } function globalEval(x) { @@ -491,7 +491,7 @@ var globalScope = this; // @param ident The name of the C function (note that C++ functions will be name-mangled - use extern "C") // @param returnType The return type of the function, one of the JS types 'number', 'string' or 'array' (use 'number' for any C pointer, and // 'array' for JavaScript arrays and typed arrays). -// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be ommitted). Types are as in returnType, +// @param argTypes An array of the types of arguments for the function (if there are no arguments, this can be omitted). Types are as in returnType, // except that 'array' is not possible (there is no way for us to know the length of the array) // @param args An array of the arguments to the function, as native JS values (as in returnType) // Note that string arguments will be stored on the stack (the JS string will become a C string on the stack). diff --git a/tools/release/update_node.py b/tools/release/update_node.py index de6bb06838b..5ce32e4ec24 100755 --- a/tools/release/update_node.py +++ b/tools/release/update_node.py @@ -70,7 +70,7 @@ def CommitPatch(options): the fake git clone fetch it into node.js. We can leave the commit, as bot_update will ensure a clean state on each run. """ - print ">> Comitting patch" + print ">> Committing patch" subprocess.check_call( ["git", "-c", "user.name=fake", "-c", "user.email=fake@chromium.org", "commit", "--allow-empty", "-m", "placeholder-commit"], diff --git a/tools/run-tests.py b/tools/run-tests.py index 377b6ae25d7..6dfbea25014 100755 --- a/tools/run-tests.py +++ b/tools/run-tests.py @@ -61,7 +61,7 @@ # Map of test name synonyms to lists of test suites. Should be ordered by # expected runtimes (suites with slow test cases first). These groups are -# invoked in seperate steps on the bots. +# invoked in separate steps on the bots. TEST_MAP = { # This needs to stay in sync with test/bot_default.isolate. "bot_default": [ diff --git a/tools/stats-viewer.py b/tools/stats-viewer.py index ab8e28767d1..e8fc69e3c2f 100755 --- a/tools/stats-viewer.py +++ b/tools/stats-viewer.py @@ -325,7 +325,7 @@ def CharAt(self, index): class Counter(object): - """A pointer to a single counter withing a binary counters file.""" + """A pointer to a single counter within a binary counters file.""" def __init__(self, data, offset): """Create a new instance. @@ -381,7 +381,7 @@ def CounterSize(self): class ChromeCounter(object): - """A pointer to a single counter withing a binary counters file.""" + """A pointer to a single counter within a binary counters file.""" def __init__(self, data, name_offset, value_offset): """Create a new instance.