1/*
2 * Copyright (C) 2011 Google Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
6 * met:
7 *
8 *     * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 *     * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
13 * distribution.
14 *     * Neither the name of Google Inc. nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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.
29 */
30
31#ifndef ContentDistributor_h
32#define ContentDistributor_h
33
34#include <wtf/Forward.h>
35#include <wtf/HashMap.h>
36#include <wtf/RefCounted.h>
37#include <wtf/Vector.h>
38
39namespace WebCore {
40
41class ContainerNode;
42class Element;
43class InsertionPoint;
44class Node;
45class ShadowRoot;
46
47class ContentDistributor {
48    WTF_MAKE_NONCOPYABLE(ContentDistributor);
49public:
50    enum Validity {
51        Valid = 0,
52        Invalidated = 1,
53        Invalidating = 2,
54        Undetermined = 3
55    };
56
57    ContentDistributor();
58    ~ContentDistributor();
59
60    void invalidateInsertionPointList();
61
62    InsertionPoint* findInsertionPointFor(const Node* key) const;
63
64    void distributeSelectionsTo(InsertionPoint*, Element* host);
65
66    void invalidateDistribution(Element* host);
67    void didShadowBoundaryChange(Element* host);
68
69    static void ensureDistribution(ShadowRoot*);
70    void distribute(Element* host);
71    bool needsDistribution() const;
72
73private:
74    const Vector<RefPtr<InsertionPoint>>& ensureInsertionPointList(ShadowRoot*);
75
76    bool invalidate(Element* host);
77
78    void setValidity(Validity validity) { m_validity = validity; }
79    bool isValid() const { return m_validity == Valid; }
80    bool needsInvalidation() const { return m_validity != Invalidated; }
81
82    Vector<RefPtr<InsertionPoint>> m_insertionPointList;
83    HashMap<const Node*, RefPtr<InsertionPoint>> m_nodeToInsertionPoint;
84    bool m_insertionPointListIsValid;
85    unsigned m_validity : 2;
86};
87
88inline bool ContentDistributor::needsDistribution() const
89{
90    // During the invalidation, re-distribution should be supressed.
91    return m_validity != Valid && m_validity != Invalidating;
92}
93
94}
95
96#endif
97