OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 10 matching lines...) Expand all Loading... |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #ifndef SubtreeLayoutScope_h | 31 #ifndef ResourceLoadPriorityOptimizer_h |
32 #define SubtreeLayoutScope_h | 32 #define ResourceLoadPriorityOptimizer_h |
33 | 33 |
34 #include "wtf/HashSet.h" | 34 #include "core/fetch/ImageResource.h" |
| 35 #include "core/fetch/ResourcePtr.h" |
35 | 36 |
36 // This is the way to mark a subtree as needing layout during layout, | 37 #include "wtf/HashMap.h" |
37 // e.g. for the purposes of doing a multipass layout. | 38 #include "wtf/OwnPtr.h" |
38 // | |
39 // It should only be used during layout. Outside of layout, you should | |
40 // just call renderer->setNeedsLayout() directly. | |
41 // | |
42 // It ensures that you don't accidentally mark part of the tree as | |
43 // needing layout and not actually lay it out. | |
44 | 39 |
45 namespace WebCore { | 40 namespace WebCore { |
46 | 41 |
47 class RenderObject; | 42 class ResourceLoadPriorityOptimizer { |
48 | |
49 class SubtreeLayoutScope { | |
50 public: | 43 public: |
51 SubtreeLayoutScope(RenderObject* root); | 44 enum VisibilityStatus { |
52 ~SubtreeLayoutScope(); | 45 NotVisible, |
53 | 46 Visible, |
54 void setNeedsLayout(RenderObject* descendant); | 47 }; |
55 void setChildNeedsLayout(RenderObject* descendant); | 48 ResourceLoadPriorityOptimizer(); |
56 | 49 ~ResourceLoadPriorityOptimizer(); |
57 RenderObject* root() { return m_root; } | 50 void notifyImageResourceVisibility(ImageResource*, VisibilityStatus); |
58 void addRendererToLayout(RenderObject* renderer); | |
59 | 51 |
60 private: | 52 private: |
61 RenderObject* m_root; | 53 void updateImageResourcesWithLoadPriority(); |
62 | 54 |
63 #ifndef NDEBUG | 55 struct ResourceAndVisibility { |
64 HashSet<RenderObject*> m_renderersToLayout; | 56 ResourceAndVisibility(ImageResource*, VisibilityStatus); |
65 #endif | 57 ~ResourceAndVisibility(); |
| 58 ResourcePtr<ImageResource> imageResource; |
| 59 VisibilityStatus status; |
| 60 }; |
| 61 |
| 62 typedef HashMap<unsigned long, OwnPtr<ResourceAndVisibility> > ImageResource
Map; |
| 63 ImageResourceMap m_imageResources; |
66 }; | 64 }; |
67 | 65 |
68 } | 66 } |
69 | 67 |
70 #endif | 68 #endif |
OLD | NEW |