1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/*
* Copyright (C) 2011 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef WebVTTToken_h
#define WebVTTToken_h
#if ENABLE(VIDEO_TRACK)
namespace WebCore {
class WebVTTTokenTypes {
public:
enum Type {
Uninitialized,
Character,
StartTag,
EndTag,
TimestampTag,
EndOfFile,
};
};
class WebVTTToken {
WTF_MAKE_NONCOPYABLE(WebVTTToken);
WTF_MAKE_FAST_ALLOCATED;
public:
typedef WebVTTTokenTypes Type;
typedef WTF::Vector<UChar, 1024> DataVector; // FIXME: Is this too large for WebVTT?
WebVTTToken() { clear(); }
void appendToName(UChar character)
{
ASSERT(m_type == WebVTTTokenTypes::StartTag || m_type == WebVTTTokenTypes::EndTag);
ASSERT(character);
m_data.append(character);
}
Type::Type type() const { return m_type; }
const DataVector& name() const
{
return m_data;
}
const DataVector& characters() const
{
ASSERT(m_type == Type::Character || m_type == Type::TimestampTag);
return m_data;
}
// Starting a character token works slightly differently than starting
// other types of tokens because we want to save a per-character branch.
void ensureIsCharacterToken()
{
ASSERT(m_type == Type::Uninitialized || m_type == Type::Character);
m_type = Type::Character;
}
void appendToCharacter(char character)
{
ASSERT(m_type == Type::Character);
m_data.append(character);
}
void appendToCharacter(UChar character)
{
ASSERT(m_type == Type::Character);
m_data.append(character);
}
void appendToCharacter(const Vector<LChar, 32>& characters)
{
ASSERT(m_type == Type::Character);
m_data.appendVector(characters);
}
void beginEmptyStartTag()
{
ASSERT(m_type == Type::Uninitialized);
m_type = Type::StartTag;
m_data.clear();
}
void beginStartTag(UChar character)
{
ASSERT(character);
ASSERT(m_type == Type::Uninitialized);
m_type = Type::StartTag;
m_data.append(character);
}
void beginEndTag(LChar character)
{
ASSERT(m_type == Type::Uninitialized);
m_type = Type::EndTag;
m_data.append(character);
}
void beginTimestampTag(UChar character)
{
ASSERT(character);
ASSERT(m_type == Type::Uninitialized);
m_type = Type::TimestampTag;
m_data.append(character);
}
void appendToTimestamp(UChar character)
{
ASSERT(character);
ASSERT(m_type == Type::TimestampTag);
m_data.append(character);
}
void appendToClass(UChar character)
{
appendToStartType(character);
}
void addNewClass()
{
ASSERT(m_type == Type::StartTag);
if (!m_classes.isEmpty())
m_classes.append(' ');
m_classes.appendVector(m_currentBuffer);
m_currentBuffer.clear();
}
const DataVector& classes() const
{
return m_classes;
}
void appendToAnnotation(UChar character)
{
appendToStartType(character);
}
void addNewAnnotation()
{
ASSERT(m_type == Type::StartTag);
m_annotation.clear();
m_annotation.appendVector(m_currentBuffer);
m_currentBuffer.clear();
}
const DataVector& annotation() const
{
return m_annotation;
}
void makeEndOfFile()
{
ASSERT(m_type == Type::Uninitialized);
m_type = Type::EndOfFile;
}
void clear()
{
m_type = Type::Uninitialized;
m_data.clear();
m_annotation.clear();
m_classes.clear();
m_currentBuffer.clear();
}
private:
void appendToStartType(UChar character)
{
ASSERT(character);
ASSERT(m_type == Type::StartTag);
m_currentBuffer.append(character);
}
Type::Type m_type;
DataVector m_data;
DataVector m_annotation;
DataVector m_classes;
DataVector m_currentBuffer;
};
}
#endif
#endif
|
