Proof-reading comments in base/message_loop/.

base/message_loop/incoming_task_queue.cc

 // Copyright 2013 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "base/message_loop/incoming_task_queue.h"
 
 #include <limits>
 
 #include "base/location.h"
 #include "base/message_loop/message_loop.h"
@@ skipping 129 matching lines @@
 
   // This should only be called while the lock is taken.
   incoming_queue_lock_.AssertAcquired();
 
   if (!message_loop_) {
     pending_task->task.Reset();
     return false;
   }
 
   // Initialize the sequence number. The sequence number is used for delayed
-  // tasks (to faciliate FIFO sorting when two tasks have the same
+  // tasks (to facilitate FIFO sorting when two tasks have the same
   // delayed_run_time value) and for identifying the task in about:tracing.
   pending_task->sequence_num = next_sequence_num_++;
 
   message_loop_->task_annotator()->DidQueueTask("MessageLoop::PostTask",
                                                 *pending_task);
 
   bool was_empty = incoming_queue_.empty();
   incoming_queue_.push(*pending_task);
   pending_task->task.Reset();
 
@@ skipping 12 matching lines @@
   // After we've scheduled the message loop, we do not need to do so again
   // until we know it has processed all of the work in our queue and is
   // waiting for more work again. The message loop will always attempt to
   // reload from the incoming queue before waiting again so we clear this flag
   // in ReloadWorkQueue().
   message_loop_scheduled_ = true;
 }
 
 }  // namespace internal
 }  // namespace base