OLD | NEW |
(Empty) | |
| 1 /* |
| 2 * Copyright (C) 2013 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 |
| 6 * are met: |
| 7 * 1. Redistributions of source code must retain the above copyright |
| 8 * notice, this list of conditions and the following disclaimer. |
| 9 * 2. Redistributions in binary form must reproduce the above copyright |
| 10 * notice, this list of conditions and the following disclaimer in the |
| 11 * documentation and/or other materials provided with the distribution. |
| 12 * |
| 13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY |
| 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR |
| 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
| 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 24 */ |
| 25 |
| 26 #ifndef HTMLToken_h |
| 27 #define HTMLToken_h |
| 28 |
| 29 #include <vector> |
| 30 |
| 31 #include "ios/third_party/blink/src/html_tokenizer_adapter.h" |
| 32 |
| 33 namespace WebCore { |
| 34 |
| 35 class HTMLToken { |
| 36 WTF_MAKE_NONCOPYABLE(HTMLToken); |
| 37 |
| 38 public: |
| 39 enum Type { |
| 40 Uninitialized, |
| 41 DOCTYPE, |
| 42 StartTag, |
| 43 EndTag, |
| 44 Comment, |
| 45 Character, |
| 46 EndOfFile, |
| 47 }; |
| 48 |
| 49 HTMLToken(); |
| 50 ~HTMLToken(); |
| 51 |
| 52 void clear() |
| 53 { |
| 54 m_type = Uninitialized; |
| 55 m_data.clear(); |
| 56 } |
| 57 |
| 58 Type type() const { return m_type; } |
| 59 |
| 60 void makeEndOfFile() |
| 61 { |
| 62 ASSERT(m_type == Uninitialized); |
| 63 m_type = EndOfFile; |
| 64 } |
| 65 |
| 66 void appendToName(LChar character) |
| 67 { |
| 68 ASSERT(m_type == StartTag || m_type == EndTag || m_type == DOCTYPE); |
| 69 ASSERT(character); |
| 70 m_data.push_back(character); |
| 71 } |
| 72 |
| 73 bool nameEquals(const LChar* name, size_t length) |
| 74 { |
| 75 ASSERT(m_type == StartTag || m_type == EndTag || m_type == DOCTYPE); |
| 76 if (length != m_data.size()) |
| 77 return false; |
| 78 |
| 79 for (size_t index = 0; index < length; ++index) { |
| 80 if (m_data.at(index) != name[index]) |
| 81 return false; |
| 82 } |
| 83 |
| 84 return true; |
| 85 } |
| 86 |
| 87 /* DOCTYPE Tokens */ |
| 88 |
| 89 void beginDOCTYPE() |
| 90 { |
| 91 ASSERT(m_type == Uninitialized); |
| 92 m_type = DOCTYPE; |
| 93 } |
| 94 |
| 95 /* Start/End Tag Tokens */ |
| 96 |
| 97 void beginStartTag(LChar character) |
| 98 { |
| 99 ASSERT(character); |
| 100 ASSERT(m_type == Uninitialized); |
| 101 m_type = StartTag; |
| 102 |
| 103 m_data.push_back(character); |
| 104 } |
| 105 |
| 106 void beginEndTag(LChar character) |
| 107 { |
| 108 ASSERT(m_type == Uninitialized); |
| 109 m_type = EndTag; |
| 110 |
| 111 m_data.push_back(character); |
| 112 } |
| 113 |
| 114 /* Character Tokens */ |
| 115 |
| 116 // Starting a character token works slightly differently than starting |
| 117 // other types of tokens because we want to save a per-character branch. |
| 118 void ensureIsCharacterToken() |
| 119 { |
| 120 ASSERT(m_type == Uninitialized || m_type == Character); |
| 121 m_type = Character; |
| 122 } |
| 123 |
| 124 /* Comment Tokens */ |
| 125 |
| 126 void beginComment() |
| 127 { |
| 128 ASSERT(m_type == Uninitialized); |
| 129 m_type = Comment; |
| 130 } |
| 131 |
| 132 private: |
| 133 Type m_type; |
| 134 std::vector<LChar> m_data; |
| 135 }; |
| 136 } |
| 137 |
| 138 #endif |
OLD | NEW |