OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2010 Google, Inc. All Rights Reserved. | 2 * Copyright (C) 2010 Google, Inc. All Rights Reserved. |
3 * Copyright (C) 2011 Apple Inc. All rights reserved. | 3 * Copyright (C) 2011 Apple Inc. All rights reserved. |
4 * | 4 * |
5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
7 * are met: | 7 * are met: |
8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. 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 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
(...skipping 207 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
218 // tokens produce only one DOM mutation. | 218 // tokens produce only one DOM mutation. |
219 typedef WillBeHeapVector<HTMLConstructionSiteTask, 1> TaskQueue; | 219 typedef WillBeHeapVector<HTMLConstructionSiteTask, 1> TaskQueue; |
220 | 220 |
221 void setCompatibilityMode(Document::CompatibilityMode); | 221 void setCompatibilityMode(Document::CompatibilityMode); |
222 void setCompatibilityModeFromDoctype(const String& name, const String& publi
cId, const String& systemId); | 222 void setCompatibilityModeFromDoctype(const String& name, const String& publi
cId, const String& systemId); |
223 | 223 |
224 void attachLater(ContainerNode* parent, PassRefPtrWillBeRawPtr<Node> child,
bool selfClosing = false); | 224 void attachLater(ContainerNode* parent, PassRefPtrWillBeRawPtr<Node> child,
bool selfClosing = false); |
225 | 225 |
226 void findFosterSite(HTMLConstructionSiteTask&); | 226 void findFosterSite(HTMLConstructionSiteTask&); |
227 | 227 |
228 PassRefPtrWillBeRawPtr<Element> createHTMLElement(AtomicHTMLToken*); | 228 PassRefPtrWillBeRawPtr<HTMLElement> createHTMLElement(AtomicHTMLToken*); |
229 PassRefPtrWillBeRawPtr<Element> createElement(AtomicHTMLToken*, const Atomic
String& namespaceURI); | 229 PassRefPtrWillBeRawPtr<Element> createElement(AtomicHTMLToken*, const Atomic
String& namespaceURI); |
230 | 230 |
231 void mergeAttributesFromTokenIntoElement(AtomicHTMLToken*, Element*); | 231 void mergeAttributesFromTokenIntoElement(AtomicHTMLToken*, Element*); |
232 void dispatchDocumentElementAvailableIfNeeded(); | 232 void dispatchDocumentElementAvailableIfNeeded(); |
233 | 233 |
234 void executeTask(HTMLConstructionSiteTask&); | 234 void executeTask(HTMLConstructionSiteTask&); |
235 void queueTask(const HTMLConstructionSiteTask&); | 235 void queueTask(const HTMLConstructionSiteTask&); |
236 | 236 |
237 RawPtrWillBeMember<Document> m_document; | 237 RawPtrWillBeMember<Document> m_document; |
238 | 238 |
(...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
307 // "whenever a node would be inserted into the current node, it must instead | 307 // "whenever a node would be inserted into the current node, it must instead |
308 // be foster parented." This flag tracks whether we're in that state. | 308 // be foster parented." This flag tracks whether we're in that state. |
309 bool m_redirectAttachToFosterParent; | 309 bool m_redirectAttachToFosterParent; |
310 | 310 |
311 bool m_inQuirksMode; | 311 bool m_inQuirksMode; |
312 }; | 312 }; |
313 | 313 |
314 } // namespace blink | 314 } // namespace blink |
315 | 315 |
316 #endif | 316 #endif |
OLD | NEW |