| OLD | NEW |
| 1 // Copyright 2011 The Chromium Authors. All rights reserved. | 1 // Copyright 2011 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 #ifndef CC_TREES_LAYER_TREE_HOST_H_ | 5 #ifndef CC_TREES_LAYER_TREE_HOST_H_ |
| 6 #define CC_TREES_LAYER_TREE_HOST_H_ | 6 #define CC_TREES_LAYER_TREE_HOST_H_ |
| 7 | 7 |
| 8 #include <stddef.h> | 8 #include <stddef.h> |
| 9 #include <stdint.h> | 9 #include <stdint.h> |
| 10 | 10 |
| (...skipping 321 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 332 void RemoveSwapPromiseMonitor(SwapPromiseMonitor* monitor); | 332 void RemoveSwapPromiseMonitor(SwapPromiseMonitor* monitor); |
| 333 | 333 |
| 334 // Call this function when you expect there to be a swap buffer. | 334 // Call this function when you expect there to be a swap buffer. |
| 335 // See swap_promise.h for how to use SwapPromise. | 335 // See swap_promise.h for how to use SwapPromise. |
| 336 void QueueSwapPromise(std::unique_ptr<SwapPromise> swap_promise); | 336 void QueueSwapPromise(std::unique_ptr<SwapPromise> swap_promise); |
| 337 | 337 |
| 338 void BreakSwapPromises(SwapPromise::DidNotSwapReason reason); | 338 void BreakSwapPromises(SwapPromise::DidNotSwapReason reason); |
| 339 | 339 |
| 340 size_t num_queued_swap_promises() const { return swap_promise_list_.size(); } | 340 size_t num_queued_swap_promises() const { return swap_promise_list_.size(); } |
| 341 | 341 |
| 342 void set_surface_id_namespace(uint32_t id_namespace); | 342 void set_surface_client_id(uint32_t client_id); |
| 343 SurfaceSequence CreateSurfaceSequence(); | 343 SurfaceSequence CreateSurfaceSequence(); |
| 344 | 344 |
| 345 PropertyTrees* property_trees() { return &property_trees_; } | 345 PropertyTrees* property_trees() { return &property_trees_; } |
| 346 bool needs_meta_info_recomputation() { | 346 bool needs_meta_info_recomputation() { |
| 347 return needs_meta_info_recomputation_; | 347 return needs_meta_info_recomputation_; |
| 348 } | 348 } |
| 349 | 349 |
| 350 void SetLayerTreeMutator(std::unique_ptr<LayerTreeMutator> mutator); | 350 void SetLayerTreeMutator(std::unique_ptr<LayerTreeMutator> mutator); |
| 351 | 351 |
| 352 Layer* LayerById(int id) const; | 352 Layer* LayerById(int id) const; |
| (...skipping 238 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 591 | 591 |
| 592 using LayerIdMap = std::unordered_map<int, Layer*>; | 592 using LayerIdMap = std::unordered_map<int, Layer*>; |
| 593 LayerIdMap layer_id_map_; | 593 LayerIdMap layer_id_map_; |
| 594 | 594 |
| 595 using ElementLayersMap = std::unordered_map<ElementId, Layer*, ElementIdHash>; | 595 using ElementLayersMap = std::unordered_map<ElementId, Layer*, ElementIdHash>; |
| 596 ElementLayersMap element_layers_map_; | 596 ElementLayersMap element_layers_map_; |
| 597 | 597 |
| 598 // Set of layers that need to push properties. | 598 // Set of layers that need to push properties. |
| 599 std::unordered_set<Layer*> layers_that_should_push_properties_; | 599 std::unordered_set<Layer*> layers_that_should_push_properties_; |
| 600 | 600 |
| 601 uint32_t surface_id_namespace_; | 601 uint32_t surface_client_id_; |
| 602 uint32_t next_surface_sequence_; | 602 uint32_t next_surface_sequence_; |
| 603 | 603 |
| 604 DISALLOW_COPY_AND_ASSIGN(LayerTreeHost); | 604 DISALLOW_COPY_AND_ASSIGN(LayerTreeHost); |
| 605 }; | 605 }; |
| 606 | 606 |
| 607 } // namespace cc | 607 } // namespace cc |
| 608 | 608 |
| 609 #endif // CC_TREES_LAYER_TREE_HOST_H_ | 609 #endif // CC_TREES_LAYER_TREE_HOST_H_ |
| OLD | NEW |