Test that I can submit to new repository and fix lots of typos in comments.

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@65 ce2b1a6d-e550-0410-aec6-3dcde31c8c00

src/accessors.cc

@@ -462,7 +462,8 @@ Object* Accessors::ObjectSetPrototype(JSObject* receiver,
                                       void*) {
   // Before we can set the prototype we need to be sure
   // prototype cycles are prevented.
-  // It is suficient to validate the receiver is not in the new prototype chain.
+  // It is sufficient to validate that the receiver is not in the new prototype
+  // chain.
 
   // Silently ignore the change if value is not a JSObject or null.
   // SpiderMonkey behaves this way.

src/api.cc

@@ -1867,7 +1867,7 @@ Handle<Value> v8::Object::GetRealNamedPropertyInPrototypeChain(
                                                       &attributes));
     return Utils::ToLocal(result);
   }
-  return Local<Value>();  // No real property was found in protoype chain.
+  return Local<Value>();  // No real property was found in prototype chain.
 }
 
 

src/assembler-arm.cc

@@ -742,7 +742,7 @@ void Assembler::addrmod5(Instr instr, CRegister crd, const MemOperand& x) {
 int Assembler::branch_offset(Label* L, bool jump_elimination_allowed) {
   // if we emit an unconditional jump/call and if the current position is the
   // target of the unbound label, we can change the binding position of the
-  // unbound label, thereby eliminating an unnessary jump
+  // unbound label, thereby eliminating an unnecessary jump
   bool can_eliminate = false;
   if (jump_elimination_allowed && FLAG_eliminate_jumps &&
       unbound_label_.is_linked() && binding_pos_ == pc_offset()) {

src/bootstrapper.cc

@@ -685,7 +685,7 @@ void Genesis::CreateRoots(v8::Handle<v8::ObjectTemplate> global_template,
 
     global_context()->set_arguments_boilerplate(*result);
     // Note: callee must be added as the first property and
-    //       lenght must be added as the second property.
+    //       length must be added as the second property.
     SetProperty(result, Factory::callee_symbol(), Factory::undefined_value(),
                 DONT_ENUM);
     SetProperty(result, Factory::length_symbol(), Factory::undefined_value(),
@@ -1031,7 +1031,7 @@ bool Genesis::InstallSpecialObjects() {
 
     // Set the security token for the debugger global object to the same as
     // the shell global object to allow calling between these (otherwise
-    // exposing debug global object dosen't make much sense).
+    // exposing debug global object doesn't make much sense).
     debug_global->set_security_token(global->security_token());
   }
 

src/builtins-arm.cc

@@ -357,7 +357,7 @@ void Builtins::Generate_KeyedLoadIC_DebugBreak(MacroAssembler* masm) {
 
 
 void Builtins::Generate_KeyedStoreIC_DebugBreak(MacroAssembler* masm) {
-  // Keyed store IC ont implemented on ARM.
+  // Keyed store IC not implemented on ARM.
 }
 
 

src/builtins-ia32.cc

@@ -837,7 +837,7 @@ void Builtins::Generate_CallIC_DebugBreak(MacroAssembler* masm) {
 
 
 void Builtins::Generate_ConstructCall_DebugBreak(MacroAssembler* masm) {
-  // Register state just before return fron JS function (from codegen-ia32.cc).
+  // Register state just before return from JS function (from codegen-ia32.cc).
   // eax is the actual number of arguments not encoded as a smi see comment
   // above IC call.
   // ----------- S t a t e -------------

src/builtins.cc

@@ -200,7 +200,7 @@ BUILTIN_0(ArrayCode) {
     if (__argc__ == 2) return array->SetElementsLength(BUILTIN_ARG(1));
   }
 
-  // Optimize the case where there are no paramaters passed.
+  // Optimize the case where there are no parameters passed.
   if (__argc__ == 1) return array->Initialize(4);
 
   // Take the arguments as elements.
@@ -664,7 +664,7 @@ void Builtins::Setup(bool create_heap_objects) {
 #undef DEF_FUNCTION_PTR_A
 
   // For now we generate builtin adaptor code into a stack-allocated
-  // buffer, before copying it into invididual code objects.
+  // buffer, before copying it into individual code objects.
   byte buffer[4*KB];
 
   // Traverse the list of builtins and generate an adaptor in a

src/codegen-arm.cc

@@ -534,7 +534,7 @@ void ArmCodeGenerator::GenCode(FunctionLiteral* fun) {
       // ProcessDeclarations calls DeclareGlobals indirectly
       ProcessDeclarations(scope->declarations());
 
-      // Bail out if a stack-overflow exception occured when
+      // Bail out if a stack-overflow exception occurred when
       // processing declarations.
       if (HasStackOverflow()) return;
     }
@@ -1843,7 +1843,7 @@ void ArmCodeGenerator::AccessReferenceProperty(
   // TODO(1241834): Make sure that this is sufficient. If there is a chance
   // that reference errors can be thrown below, we must distinguish
   // between the 2 kinds of loads (typeof expression loads must not
-  // throw a reference errror).
+  // throw a reference error).
   bool is_load = (access == CodeGenState::LOAD ||
                   access == CodeGenState::LOAD_TYPEOF_EXPR);
 

src/codegen-ia32.cc

@@ -584,7 +584,7 @@ void Ia32CodeGenerator::GenCode(FunctionLiteral* fun) {
     } else {
       Comment cmnt(masm_, "[ declarations");
       ProcessDeclarations(scope->declarations());
-      // Bail out if a stack-overflow exception occured when
+      // Bail out if a stack-overflow exception occurred when
       // processing declarations.
       if (HasStackOverflow()) return;
     }
@@ -997,7 +997,7 @@ void Ia32CodeGenerator::AccessReferenceProperty(
   // TODO(1241834): Make sure that this is sufficient. If there is a chance
   // that reference errors can be thrown below, we must distinguish
   // between the 2 kinds of loads (typeof expression loads must not
-  // throw a reference errror).
+  // throw a reference error).
   bool is_load = (access == CodeGenState::LOAD ||
                   access == CodeGenState::LOAD_TYPEOF_EXPR);
 
@@ -1180,7 +1180,7 @@ void GenericBinaryOpStub::Generate(MacroAssembler* masm) {
       // eax: y
       // edx: x
       // a) both operands smi and result fits into a smi -> return.
-      // b) at least one of operans non-smi -> non_smi_operands.
+      // b) at least one of operands non-smi -> non_smi_operands.
       // c) result does not fit in a smi -> non_smi_result.
       Label non_smi_operands, non_smi_result;
       // Tag check.
@@ -2212,7 +2212,7 @@ void CompareStub::Generate(MacroAssembler* masm) {
 
   // TODO(1243847): Use cmov below once CpuFeatures are properly hooked up.
   Label below_lbl, above_lbl;
-  // use edx, eax to convert unsigned to signed comparision
+  // use edx, eax to convert unsigned to signed comparison
   __ j(below, &below_lbl, not_taken);
   __ j(above, &above_lbl, not_taken);
 
@@ -3568,7 +3568,7 @@ class ObjectLiteralDeferred: public DeferredCode {
 
 
 void ObjectLiteralDeferred::Generate() {
-  // If the entry is undefined we call the runtime system to computed
+  // If the entry is undefined we call the runtime system to compute
   // the literal.
 
   // Literal array (0).
@@ -5212,7 +5212,7 @@ void CEntryStub::GenerateBody(MacroAssembler* masm, bool is_debug_break) {
     // CopyRegistersFromStackToMemory() but it isn't! esp is assumed
     // correct here, but computed for the other call. Very error
     // prone! FIX THIS.  Actually there are deeper problems with
-    // register saving than this assymetry (see the bug report
+    // register saving than this asymmetry (see the bug report
     // associated with this issue).
     __ PushRegistersFromMemory(kJSCallerSaved);
   }

src/debug.cc

@@ -282,7 +282,7 @@ void BreakLocationIterator::ClearOneShot() {
 
 void BreakLocationIterator::SetDebugBreak() {
   // If there is already a break point here just return. This might happen if
-  // the same code is flodded with break points twice. Flodding the same
+  // the same code is flooded with break points twice. Flooding the same
   // function twice might happen when stepping in a function with an exception
   // handler as the handler and the function is the same.
   if (IsDebugBreak()) {
@@ -344,7 +344,7 @@ void BreakLocationIterator::PrepareStepIn() {
       rinfo()->set_target_address(stub->entry());
     }
   } else {
-    // Step in through constructs call requires no changs to the running code.
+    // Step in through constructs call requires no changes to the running code.
     ASSERT(is_js_construct_call(rmode()));
   }
 }
@@ -705,7 +705,7 @@ Handle<Object> Debug::CheckBreakPoints(Handle<Object> break_point_objects) {
   int break_points_hit_count = 0;
   Handle<JSArray> break_points_hit = Factory::NewJSArray(1);
 
-  // If there are multiple break points they are in a Fixedrray.
+  // If there are multiple break points they are in a FixedArray.
   ASSERT(!break_point_objects->IsUndefined());
   if (break_point_objects->IsFixedArray()) {
     Handle<FixedArray> array(FixedArray::cast(*break_point_objects));
@@ -929,7 +929,7 @@ void Debug::PrepareStep(StepAction step_action, int step_count) {
     if (code->is_call_stub()) is_call_target = true;
   }
 
-  // If this is the last break code target step out is the only posibility.
+  // If this is the last break code target step out is the only possibility.
   if (it.IsExit() || step_action == StepOut) {
     // Step out: If there is a JavaScript caller frame, we need to
     // flood it with breakpoints.
@@ -967,7 +967,7 @@ void Debug::PrepareStep(StepAction step_action, int step_count) {
 // is used to have step next and step in only report break back to the debugger
 // if on a different frame or in a different statement. In some situations
 // there will be several break points in the same statement when the code is
-// flodded with one-shot break points. This function helps to perform several
+// flooded with one-shot break points. This function helps to perform several
 // steps before reporting break back to the debugger.
 bool Debug::StepNextContinue(BreakLocationIterator* break_location_iterator,
                              JavaScriptFrame* frame) {
@@ -1107,7 +1107,7 @@ void Debug::ClearStepping() {
 // are used to support stepping.
 void Debug::ClearOneShot() {
   // The current implementation just runs through all the breakpoints. When the
-  // last break point for a function is removed that function is automaticaly
+  // last break point for a function is removed that function is automatically
   // removed from the list.
 
   DebugInfoListNode* node = debug_info_list_;
@@ -1788,10 +1788,10 @@ void DebugMessageThread::DebugEvent(v8::DebugEvent event,
   bool interactive = false;
   switch (event) {
     case v8::Break:
-      interactive = true;  // Break event is always interavtive
+      interactive = true;  // Break event is always interactive
       break;
     case v8::Exception:
-      interactive = true;  // Exception event is always interavtive
+      interactive = true;  // Exception event is always interactive
       break;
     case v8::BeforeCompile:
       break;
@@ -1821,7 +1821,7 @@ void DebugMessageThread::DebugEvent(v8::DebugEvent event,
     return;
   }
 
-  // Notify the debugger that a debug event has occoured.
+  // Notify the debugger that a debug event has occurred.
   host_running_ = false;
   SetEventJSONFromEvent(event_data);
 

src/disasm-arm.cc

@@ -276,7 +276,7 @@ int Decoder::FormatOption(Instr* instr, const char* format) {
       }
       break;
     }
-    case 'p': {  // 'pu: P and U bits for load and store isntructions
+    case 'p': {  // 'pu: P and U bits for load and store instructions
       ASSERT(format[1] == 'u');
       switch (instr->PUField()) {
         case 0: {

src/execution.cc

@@ -200,7 +200,7 @@ StackGuard::StackGuard() {
 
     thread_local_.initial_jslimit_ = thread_local_.jslimit_ =
         GENERATED_CODE_STACK_LIMIT(kLimitSize);
-    // NOTE: The check for overflow is not safe as there is no guarentee that
+    // NOTE: The check for overflow is not safe as there is no guarantee that
     // the running thread has its stack in all memory up to address 0x00000000.
     thread_local_.initial_climit_ = thread_local_.climit_ =
         reinterpret_cast<uintptr_t>(this) >= kLimitSize ?
@@ -602,7 +602,7 @@ v8::Handle<v8::Value> LoadExtension::Load(const v8::Arguments& args) {
   v8::Handle<v8::Script> code =
       v8::Script::Compile(source, &origin);
 
-  // Run the code if no exception occured during the compilation. In
+  // Run the code if no exception occurred during the compilation. In
   // case of syntax errors, the code is empty and the exception is
   // scheduled and will be thrown when returning to JavaScript.
   if (!code.IsEmpty()) result = code->Run();

src/execution.h

@@ -229,7 +229,7 @@ class StackLimitCheck BASE_EMBEDDED {
 
 // Support for temporarily postponing interrupts. When the outermost
 // postpone scope is left the interrupts will be re-enabled and any
-// interrupts that occured while in the scope will be taken into
+// interrupts that occurred while in the scope will be taken into
 // account.
 class PostponeInterruptsScope BASE_EMBEDDED {
  public:

src/global-handles.cc

@@ -267,7 +267,7 @@ void GlobalHandles::PostGarbageCollectionProcessing() {
   // Process weak global handle callbacks. This must be done after the
   // GC is completely done, because the callbacks may invoke arbitrary
   // API functions.
-  // At the same time deallocate all DESTORYED nodes
+  // At the same time deallocate all DESTROYED nodes
   ASSERT(Heap::gc_state() == Heap::NOT_IN_GC);
   Node** p = &head_;
   while (*p != NULL) {

src/simulator-ia32.h

@@ -38,7 +38,7 @@
 // This macro must be called from a C++ method. It relies on being able to take
 // the address of "this" to get a value on the current execution stack and then
 // calculates the stack limit based on that value.
-// NOTE: The check for overflow is not safe as there is no guarentee that the
+// NOTE: The check for overflow is not safe as there is no guarantee that the
 // running thread has its stack in all memory up to address 0x00000000.
 #define GENERATED_CODE_STACK_LIMIT(limit) \
   (reinterpret_cast<uintptr_t>(this) >= limit ? \