Still produce quad when tile OOM and on demand raster is not allowed

cc/resources/prioritized_tile_set.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 "cc/resources/prioritized_tile_set.h"
 
 #include <algorithm>
 
 #include "cc/resources/managed_tile_state.h"
 #include "cc/resources/tile.h"
@@ skipping 22 matching lines @@
     gfx::Rect a_rect = a->content_rect();
     gfx::Rect b_rect = b->content_rect();
     if (a_rect.y() != b_rect.y())
       return a_rect.y() < b_rect.y();
     return a_rect.x() < b_rect.x();
   }
 };
 
 namespace {
 
+bool TilePriorityTieBreaker(const Tile* tile_i, const Tile* tile_j) {
+  // When two tiles has same priority use Id as tie breaker.
+  return tile_i->id() < tile_j->id();
+}
+
 typedef std::vector<Tile*> TileVector;
 
 void SortBinTiles(ManagedTileBin bin, TileVector* tiles) {
   switch (bin) {
+    case NEVER_BIN:
+      break;
     case NOW_AND_READY_TO_DRAW_BIN:
-    case NEVER_BIN:
+      std::sort(tiles->begin(), tiles->end(), TilePriorityTieBreaker);
       break;
     case NOW_BIN:
     case SOON_BIN:
     case EVENTUALLY_AND_ACTIVE_BIN:
     case EVENTUALLY_BIN:
     case AT_LAST_AND_ACTIVE_BIN:
     case AT_LAST_BIN:
       std::sort(tiles->begin(), tiles->end(), BinComparator());
       break;
     default:
@@ skipping 80 matching lines @@
     if (use_priority_ordering_)
       tile_set_->SortBinIfNeeded(current_bin_);
 
     iterator_ = tile_set_->tiles_[current_bin_].begin();
     if (iterator_ != tile_set_->tiles_[current_bin_].end())
       break;
   }
 }
 
 }  // namespace cc