| 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 are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * 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 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 11 matching lines...) Expand all Loading... |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #include "config.h" | 31 #include "config.h" |
| 32 | |
| 33 #include "core/html/track/WebVTTParser.h" | 32 #include "core/html/track/WebVTTParser.h" |
| 34 | 33 |
| 35 #include "core/dom/ProcessingInstruction.h" | 34 #include "core/dom/ProcessingInstruction.h" |
| 36 #include "core/dom/Text.h" | 35 #include "core/dom/Text.h" |
| 37 #include "core/html/track/WebVTTElement.h" | 36 #include "core/html/track/WebVTTElement.h" |
| 38 #include "core/platform/text/SegmentedString.h" | 37 #include "core/platform/text/SegmentedString.h" |
| 39 #include <wtf/text/WTFString.h> | 38 #include "wtf/text/WTFString.h" |
| 40 | 39 |
| 41 namespace WebCore { | 40 namespace WebCore { |
| 42 | 41 |
| 43 const double secondsPerHour = 3600; | 42 const double secondsPerHour = 3600; |
| 44 const double secondsPerMinute = 60; | 43 const double secondsPerMinute = 60; |
| 45 const double secondsPerMillisecond = 0.001; | 44 const double secondsPerMillisecond = 0.001; |
| 46 const double malformedTime = -1; | 45 const double malformedTime = -1; |
| 47 const unsigned bomLength = 3; | 46 const unsigned bomLength = 3; |
| 48 const unsigned fileIdentifierLength = 6; | 47 const unsigned fileIdentifierLength = 6; |
| 49 | 48 |
| (...skipping 513 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 563 unsigned oldPosition = *position; | 562 unsigned oldPosition = *position; |
| 564 while (*position < length && data[*position] != '\r' && data[*position] != '
\n') | 563 while (*position < length && data[*position] != '\r' && data[*position] != '
\n') |
| 565 (*position)++; | 564 (*position)++; |
| 566 String line = String::fromUTF8(data + oldPosition, *position - oldPosition); | 565 String line = String::fromUTF8(data + oldPosition, *position - oldPosition); |
| 567 skipLineTerminator(data, length, position); | 566 skipLineTerminator(data, length, position); |
| 568 return line; | 567 return line; |
| 569 } | 568 } |
| 570 | 569 |
| 571 } | 570 } |
| 572 | 571 |
| OLD | NEW |