Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "cc/output/overlay_strategy_single_on_top.h" | 5 #include "cc/output/overlay_strategy_single_on_top.h" |
| 6 | 6 |
| 7 #include <limits> | 7 #include <limits> |
| 8 | 8 |
| 9 #include "cc/output/overlay_candidate_validator.h" | 9 #include "cc/output/overlay_candidate_validator.h" |
| 10 #include "cc/quads/draw_quad.h" | 10 #include "cc/quads/draw_quad.h" |
| 11 | 11 |
| 12 namespace cc { | 12 namespace cc { |
| 13 | 13 |
| 14 OverlayStrategySingleOnTop::~OverlayStrategySingleOnTop() {} | 14 OverlayStrategySingleOnTop::~OverlayStrategySingleOnTop() {} |
| 15 | 15 |
| 16 bool OverlayStrategySingleOnTop::TryOverlay( | 16 QuadList::Iterator OverlayStrategySingleOnTop::TryOverlay( |
| 17 OverlayCandidateValidator* capability_checker, | 17 OverlayCandidateValidator* capability_checker, |
| 18 RenderPassList* render_passes_in_draw_order, | 18 RenderPassList* render_passes_in_draw_order, |
| 19 OverlayCandidateList* candidate_list, | 19 OverlayCandidateList* candidate_list, |
| 20 const OverlayCandidate& candidate, | 20 const OverlayCandidate& candidate, |
| 21 QuadList::Iterator candidate_iterator, | 21 QuadList::Iterator candidate_iterator, |
| 22 float device_scale_factor) { | 22 float device_scale_factor) { |
| 23 RenderPass* root_render_pass = render_passes_in_draw_order->back(); | 23 RenderPass* root_render_pass = render_passes_in_draw_order->back(); |
| 24 QuadList& quad_list = root_render_pass->quad_list; | 24 QuadList& quad_list = root_render_pass->quad_list; |
| 25 const DrawQuad* draw_quad = *candidate_iterator; | 25 const DrawQuad* draw_quad = *candidate_iterator; |
| 26 gfx::RectF rect = draw_quad->rect; | 26 gfx::RectF rect = draw_quad->rect; |
| 27 draw_quad->shared_quad_state->quad_to_target_transform.TransformRect(&rect); | 27 draw_quad->shared_quad_state->quad_to_target_transform.TransformRect(&rect); |
| 28 | 28 |
| 29 // Check that no prior quads overlap it. | 29 // Check that no prior quads overlap it. |
| 30 for (auto overlap_iter = quad_list.cbegin(); | 30 for (auto overlap_iter = quad_list.cbegin(); |
| 31 overlap_iter != candidate_iterator; ++overlap_iter) { | 31 overlap_iter != candidate_iterator; ++overlap_iter) { |
| 32 gfx::RectF overlap_rect = overlap_iter->rect; | 32 gfx::RectF overlap_rect = overlap_iter->rect; |
| 33 overlap_iter->shared_quad_state->quad_to_target_transform.TransformRect( | 33 overlap_iter->shared_quad_state->quad_to_target_transform.TransformRect( |
| 34 &overlap_rect); | 34 &overlap_rect); |
| 35 if (rect.Intersects(overlap_rect) && | 35 if (rect.Intersects(overlap_rect) && |
| 36 !OverlayStrategyCommon::IsInvisibleQuad(*overlap_iter)) | 36 !OverlayStrategyCommon::IsInvisibleQuad(*overlap_iter)) |
| 37 return false; | 37 return quad_list.end(); |
|
ccameron
2015/09/02 22:22:33
This shouldn't return the end() iter -- we want to
| |
| 38 } | 38 } |
| 39 | 39 |
| 40 // Add our primary surface. | 40 // Add our primary surface. |
| 41 OverlayCandidateList candidates; | 41 OverlayCandidateList candidates; |
| 42 OverlayCandidate main_image; | 42 OverlayCandidate main_image; |
| 43 main_image.display_rect = root_render_pass->output_rect; | 43 main_image.display_rect = root_render_pass->output_rect; |
| 44 candidates.push_back(main_image); | 44 candidates.push_back(main_image); |
| 45 | 45 |
| 46 // Add the overlay. | 46 // Add the overlay. |
| 47 candidates.push_back(candidate); | 47 candidates.push_back(candidate); |
| 48 candidates.back().plane_z_order = 1; | 48 candidates.back().plane_z_order = 1; |
| 49 | 49 |
| 50 // Check for support. | 50 // Check for support. |
| 51 capability_checker->CheckOverlaySupport(&candidates); | 51 capability_checker->CheckOverlaySupport(&candidates); |
| 52 | 52 |
| 53 // If the candidate can be handled by an overlay, create a pass for it. | 53 // If the candidate can be handled by an overlay, create a pass for it. |
| 54 if (candidates[1].overlay_handled) { | 54 if (candidates[1].overlay_handled) { |
| 55 quad_list.EraseAndInvalidateAllPointers(candidate_iterator); | 55 quad_list.EraseAndInvalidateAllPointers(candidate_iterator); |
| 56 DCHECK(candidate_list->empty()); | |
| 56 candidate_list->swap(candidates); | 57 candidate_list->swap(candidates); |
|
ccameron
2015/09/02 22:22:33
here we want to return STOP -- this strategy only
| |
| 57 return true; | |
| 58 } | 58 } |
| 59 return false; | 59 |
| 60 return quad_list.end(); | |
|
ccameron
2015/09/02 22:22:33
likewise about keeping trying.
| |
| 60 } | 61 } |
| 61 | 62 |
| 62 } // namespace cc | 63 } // namespace cc |
| OLD | NEW |