OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 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 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
11 * contributors may be used to endorse or promote products derived from | 11 * contributors may be used to endorse or promote products derived from |
12 * this software without specific prior written permission. | 12 * this software without specific prior written permission. |
13 * | 13 * |
14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
25 */ | 25 */ |
26 | 26 |
27 #include "config.h" | 27 #include "config.h" |
28 #include "core/html/shadow/HTMLContentElement.h" | 28 #include "core/html/HTMLContentElement.h" |
29 | 29 |
30 #include "HTMLNames.h" | 30 #include "HTMLNames.h" |
31 #include "core/css/parser/BisonCSSParser.h" | |
32 #include "core/css/SelectorChecker.h" | 31 #include "core/css/SelectorChecker.h" |
33 #include "core/css/SiblingTraversalStrategies.h" | 32 #include "core/css/SiblingTraversalStrategies.h" |
| 33 #include "core/css/parser/BisonCSSParser.h" |
34 #include "core/dom/QualifiedName.h" | 34 #include "core/dom/QualifiedName.h" |
35 #include "core/dom/shadow/ElementShadow.h" | 35 #include "core/dom/shadow/ElementShadow.h" |
36 #include "core/dom/shadow/ShadowRoot.h" | 36 #include "core/dom/shadow/ShadowRoot.h" |
37 | 37 |
38 namespace WebCore { | 38 namespace WebCore { |
39 | 39 |
40 using namespace HTMLNames; | 40 using namespace HTMLNames; |
41 | 41 |
42 PassRefPtr<HTMLContentElement> HTMLContentElement::create(Document& document) | 42 PassRefPtr<HTMLContentElement> HTMLContentElement::create(Document& document) |
43 { | 43 { |
(...skipping 26 matching lines...) Expand all Loading... |
70 } | 70 } |
71 } | 71 } |
72 | 72 |
73 void HTMLContentElement::parseAttribute(const QualifiedName& name, const AtomicS
tring& value) | 73 void HTMLContentElement::parseAttribute(const QualifiedName& name, const AtomicS
tring& value) |
74 { | 74 { |
75 if (name == selectAttr) { | 75 if (name == selectAttr) { |
76 if (ShadowRoot* root = containingShadowRoot()) | 76 if (ShadowRoot* root = containingShadowRoot()) |
77 root->owner()->willAffectSelector(); | 77 root->owner()->willAffectSelector(); |
78 m_shouldParseSelect = true; | 78 m_shouldParseSelect = true; |
79 m_select = value; | 79 m_select = value; |
80 } else | 80 } else { |
81 InsertionPoint::parseAttribute(name, value); | 81 InsertionPoint::parseAttribute(name, value); |
| 82 } |
82 } | 83 } |
83 | 84 |
84 bool HTMLContentElement::validateSelect() const | 85 bool HTMLContentElement::validateSelect() const |
85 { | 86 { |
86 ASSERT(!m_shouldParseSelect); | 87 ASSERT(!m_shouldParseSelect); |
87 | 88 |
88 if (m_select.isNull() || m_select.isEmpty()) | 89 if (m_select.isNull() || m_select.isEmpty()) |
89 return true; | 90 return true; |
90 | 91 |
91 if (!m_selectorList.isValid()) | 92 if (!m_selectorList.isValid()) |
(...skipping 19 matching lines...) Expand all Loading... |
111 bool HTMLContentElement::matchSelector(const Vector<Node*, 32>& siblings, int nt
h) const | 112 bool HTMLContentElement::matchSelector(const Vector<Node*, 32>& siblings, int nt
h) const |
112 { | 113 { |
113 for (const CSSSelector* selector = selectorList().first(); selector; selecto
r = CSSSelectorList::next(*selector)) { | 114 for (const CSSSelector* selector = selectorList().first(); selector; selecto
r = CSSSelectorList::next(*selector)) { |
114 if (checkOneSelector(*selector, siblings, nth)) | 115 if (checkOneSelector(*selector, siblings, nth)) |
115 return true; | 116 return true; |
116 } | 117 } |
117 return false; | 118 return false; |
118 } | 119 } |
119 | 120 |
120 } | 121 } |
OLD | NEW |