| 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 #include "MHTMLParser.h" | 32 #include "core/loader/archive/MHTMLParser.h" |
| 33 | 33 |
| 34 #include "MHTMLArchive.h" | 34 #include "core/loader/archive/MHTMLArchive.h" |
| 35 #include "core/platform/MIMETypeRegistry.h" | 35 #include "core/platform/MIMETypeRegistry.h" |
| 36 #include "core/platform/network/MIMEHeader.h" | 36 #include "core/platform/network/MIMEHeader.h" |
| 37 #include "core/platform/text/QuotedPrintable.h" | 37 #include "core/platform/text/QuotedPrintable.h" |
| 38 #include <wtf/HashMap.h> | 38 #include <wtf/HashMap.h> |
| 39 #include <wtf/NotFound.h> | 39 #include <wtf/NotFound.h> |
| 40 #include <wtf/text/Base64.h> | 40 #include <wtf/text/Base64.h> |
| 41 | 41 |
| 42 namespace WebCore { | 42 namespace WebCore { |
| 43 | 43 |
| 44 static bool skipLinesUntilBoundaryFound(SharedBufferChunkReader& lineReader, con
st String& boundary) | 44 static bool skipLinesUntilBoundaryFound(SharedBufferChunkReader& lineReader, con
st String& boundary) |
| (...skipping 189 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 234 { | 234 { |
| 235 return m_resources.size(); | 235 return m_resources.size(); |
| 236 } | 236 } |
| 237 | 237 |
| 238 ArchiveResource* MHTMLParser::subResourceAt(size_t index) const | 238 ArchiveResource* MHTMLParser::subResourceAt(size_t index) const |
| 239 { | 239 { |
| 240 return m_resources[index].get(); | 240 return m_resources[index].get(); |
| 241 } | 241 } |
| 242 | 242 |
| 243 } | 243 } |
| OLD | NEW |