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, 2014 Apple Inc. All rights reserved. | 3 * Copyright (C) 2011, 2014 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 466 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
477 { | 477 { |
478 return item->hasTagName(liTag); | 478 return item->hasTagName(liTag); |
479 } | 479 } |
480 | 480 |
481 bool isDdOrDt(const HTMLStackItem* item) | 481 bool isDdOrDt(const HTMLStackItem* item) |
482 { | 482 { |
483 return item->hasTagName(ddTag) | 483 return item->hasTagName(ddTag) |
484 || item->hasTagName(dtTag); | 484 || item->hasTagName(dtTag); |
485 } | 485 } |
486 | 486 |
487 } | 487 } // namespace |
488 | 488 |
489 template <bool shouldClose(const HTMLStackItem*)> | 489 template <bool shouldClose(const HTMLStackItem*)> |
490 void HTMLTreeBuilder::processCloseWhenNestedTag(AtomicHTMLToken* token) | 490 void HTMLTreeBuilder::processCloseWhenNestedTag(AtomicHTMLToken* token) |
491 { | 491 { |
492 m_framesetOk = false; | 492 m_framesetOk = false; |
493 HTMLElementStack::ElementRecord* nodeRecord = m_tree.openElements()->topReco
rd(); | 493 HTMLElementStack::ElementRecord* nodeRecord = m_tree.openElements()->topReco
rd(); |
494 while (1) { | 494 while (1) { |
495 RefPtrWillBeRawPtr<HTMLStackItem> item = nodeRecord->stackItem(); | 495 RefPtrWillBeRawPtr<HTMLStackItem> item = nodeRecord->stackItem(); |
496 if (shouldClose(item.get())) { | 496 if (shouldClose(item.get())) { |
497 ASSERT(item->isElementNode()); | 497 ASSERT(item->isElementNode()); |
(...skipping 2314 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2812 ASSERT(m_isAttached); | 2812 ASSERT(m_isAttached); |
2813 // Warning, this may detach the parser. Do not do anything else after this. | 2813 // Warning, this may detach the parser. Do not do anything else after this. |
2814 m_tree.finishedParsing(); | 2814 m_tree.finishedParsing(); |
2815 } | 2815 } |
2816 | 2816 |
2817 void HTMLTreeBuilder::parseError(AtomicHTMLToken*) | 2817 void HTMLTreeBuilder::parseError(AtomicHTMLToken*) |
2818 { | 2818 { |
2819 } | 2819 } |
2820 | 2820 |
2821 } // namespace blink | 2821 } // namespace blink |
OLD | NEW |