Properly "handle" MOJO_RESULT_BUSY in a few flaces.

mojo/public/cpp/utility/lib/run_loop.cc

 // Copyright 2014 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 "mojo/public/cpp/utility/run_loop.h"
 
 #include <assert.h>
 
 #include <algorithm>
 #include <vector>
@@ skipping 151 matching lines @@
 
   Handle handle = wait_state.handles[wmr.index];
   assert(handler_data_.find(handle) != handler_data_.end());
   RunLoopHandler* handler = handler_data_[handle].handler;
 
   switch (wmr.result) {
     case MOJO_RESULT_OK:
       handler->OnHandleReady(handle);
       return true;
     case MOJO_RESULT_INVALID_ARGUMENT:
+    case MOJO_RESULT_CANCELLED:
+    case MOJO_RESULT_BUSY:
+      // These results indicate a bug in "our" code (e.g., race conditions).
+      assert(false);
+      // Fall through.
     case MOJO_RESULT_FAILED_PRECONDITION:
       // Remove the handle first, this way if OnHandleError() tries to remove
       // the handle our iterator isn't invalidated.
       handler_data_.erase(handle);
       handler->OnHandleError(handle, wmr.result);
       return true;
     default:
       assert(false);
       return false;
   }
@@ skipping 79 matching lines @@
     // std::priority_queue<> puts the least element at the end of the queue. We
     // want the soonest eligible task to be at the head of the queue, so
     // run_times further in the future are considered lesser.
     return run_time > other.run_time;
   }
 
   return sequence_number > other.sequence_number;
 }
 
 }  // namespace mojo