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 | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
12 * | 12 * |
13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY | 13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
24 */ | 24 */ |
25 | 25 |
26 #include "config.h" | 26 #include "config.h" |
27 | |
28 #include "core/html/track/LoadableTextTrack.h" | 27 #include "core/html/track/LoadableTextTrack.h" |
29 | 28 |
29 #include "RuntimeEnabledFeatures.h" | |
acolwell GONE FROM CHROMIUM
2013/10/08 22:09:06
nit: Not needed.
vcarbune.chromium
2013/10/12 22:33:55
Done.
| |
30 #include "core/html/HTMLTrackElement.h" | 30 #include "core/html/HTMLTrackElement.h" |
31 #include "core/html/track/TextTrackCueList.h" | 31 #include "core/html/track/TextTrackCueList.h" |
32 #include "core/html/track/TextTrackRegionList.h" | 32 #include "core/html/track/TextTrackRegionList.h" |
33 | 33 |
34 namespace WebCore { | 34 namespace WebCore { |
35 | 35 |
36 LoadableTextTrack::LoadableTextTrack(HTMLTrackElement* track, const String& kind , const String& label, const String& language) | 36 LoadableTextTrack::LoadableTextTrack(HTMLTrackElement* track, const String& kind , const String& label, const String& language) |
37 : TextTrack(&track->document(), track, kind, label, language, TrackElement) | 37 : TextTrack(&track->document(), track, kind, label, language, TrackElement) |
38 , m_trackElement(track) | 38 , m_trackElement(track) |
39 , m_loadTimer(this, &LoadableTextTrack::loadTimerFired) | 39 , m_loadTimer(this, &LoadableTextTrack::loadTimerFired) |
(...skipping 81 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
121 void LoadableTextTrack::cueLoadingCompleted(TextTrackLoader* loader, bool loadin gFailed) | 121 void LoadableTextTrack::cueLoadingCompleted(TextTrackLoader* loader, bool loadin gFailed) |
122 { | 122 { |
123 ASSERT_UNUSED(loader, m_loader == loader); | 123 ASSERT_UNUSED(loader, m_loader == loader); |
124 | 124 |
125 if (!m_trackElement) | 125 if (!m_trackElement) |
126 return; | 126 return; |
127 | 127 |
128 m_trackElement->didCompleteLoad(this, loadingFailed ? HTMLTrackElement::Fail ure : HTMLTrackElement::Success); | 128 m_trackElement->didCompleteLoad(this, loadingFailed ? HTMLTrackElement::Fail ure : HTMLTrackElement::Success); |
129 } | 129 } |
130 | 130 |
131 #if ENABLE(WEBVTT_REGIONS) | |
132 void LoadableTextTrack::newRegionsAvailable(TextTrackLoader* loader) | 131 void LoadableTextTrack::newRegionsAvailable(TextTrackLoader* loader) |
133 { | 132 { |
134 ASSERT_UNUSED(loader, m_loader == loader); | 133 ASSERT_UNUSED(loader, m_loader == loader); |
135 | 134 |
136 Vector<RefPtr<TextTrackRegion> > newRegions; | 135 Vector<RefPtr<TextTrackRegion> > newRegions; |
137 m_loader->getNewRegions(newRegions); | 136 m_loader->getNewRegions(newRegions); |
138 | 137 |
139 for (size_t i = 0; i < newRegions.size(); ++i) { | 138 for (size_t i = 0; i < newRegions.size(); ++i) { |
140 newRegions[i]->setTrack(this); | 139 newRegions[i]->setTrack(this); |
141 regionList()->add(newRegions[i]); | 140 regions()->add(newRegions[i]); |
142 } | 141 } |
143 } | 142 } |
144 #endif | |
145 | 143 |
146 size_t LoadableTextTrack::trackElementIndex() | 144 size_t LoadableTextTrack::trackElementIndex() |
147 { | 145 { |
148 ASSERT(m_trackElement); | 146 ASSERT(m_trackElement); |
149 ASSERT(m_trackElement->parentNode()); | 147 ASSERT(m_trackElement->parentNode()); |
150 | 148 |
151 size_t index = 0; | 149 size_t index = 0; |
152 for (Node* node = m_trackElement->parentNode()->firstChild(); node; node = n ode->nextSibling()) { | 150 for (Node* node = m_trackElement->parentNode()->firstChild(); node; node = n ode->nextSibling()) { |
153 if (!node->hasTagName(trackTag) || !node->parentNode()) | 151 if (!node->hasTagName(trackTag) || !node->parentNode()) |
154 continue; | 152 continue; |
155 if (node == m_trackElement) | 153 if (node == m_trackElement) |
156 return index; | 154 return index; |
157 ++index; | 155 ++index; |
158 } | 156 } |
159 ASSERT_NOT_REACHED(); | 157 ASSERT_NOT_REACHED(); |
160 | 158 |
161 return 0; | 159 return 0; |
162 } | 160 } |
163 | 161 |
164 } // namespace WebCore | 162 } // namespace WebCore |
165 | 163 |
OLD | NEW |