| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2013 Google, Inc. All Rights Reserved. | 2 * Copyright (C) 2013 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 GOOGLE INC. ``AS IS'' AND ANY | 13 * THIS SOFTWARE IS PROVIDED BY GOOGLE 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 GOOGLE INC. OR | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GOOGLE 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 #include "core/html/parser/BackgroundHTMLParser.h" | 27 #include "core/html/parser/BackgroundHTMLParser.h" |
| 28 | 28 |
| 29 #include "core/html/parser/HTMLDocumentParser.h" | 29 #include "core/html/parser/HTMLDocumentParser.h" |
| 30 #include "core/html/parser/HTMLParserIdioms.h" | |
| 31 #include "core/html/parser/HTMLParserThread.h" | 30 #include "core/html/parser/HTMLParserThread.h" |
| 32 #include "core/html/parser/HTMLTokenizer.h" | 31 #include "core/html/parser/HTMLTokenizer.h" |
| 33 #include "core/html/parser/XSSAuditor.h" | 32 #include "core/html/parser/XSSAuditor.h" |
| 34 #include <wtf/MainThread.h> | 33 #include "wtf/MainThread.h" |
| 35 #include <wtf/text/TextPosition.h> | 34 #include "wtf/text/TextPosition.h" |
| 36 | 35 |
| 37 namespace WebCore { | 36 namespace WebCore { |
| 38 | 37 |
| 39 // On a network with high latency and high bandwidth, using a device | 38 // On a network with high latency and high bandwidth, using a device |
| 40 // with a fast CPU, we could end up speculatively tokenizing | 39 // with a fast CPU, we could end up speculatively tokenizing |
| 41 // the whole document, well ahead of when the main-thread actually needs it. | 40 // the whole document, well ahead of when the main-thread actually needs it. |
| 42 // This is a waste of memory (and potentially time if the speculation fails). | 41 // This is a waste of memory (and potentially time if the speculation fails). |
| 43 // So we limit our outstanding speculations arbitrarily to 10. | 42 // So we limit our outstanding speculations arbitrarily to 10. |
| 44 // Our maximal memory spent speculating will be approximately: | 43 // Our maximal memory spent speculating will be approximately: |
| 45 // outstandingCheckpointLimit * pendingTokenLimit * sizeof(CompactToken) | 44 // outstandingCheckpointLimit * pendingTokenLimit * sizeof(CompactToken) |
| (...skipping 149 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 195 chunk->tokenizerState = m_tokenizer->state(); | 194 chunk->tokenizerState = m_tokenizer->state(); |
| 196 chunk->treeBuilderState = m_treeBuilderSimulator.state(); | 195 chunk->treeBuilderState = m_treeBuilderSimulator.state(); |
| 197 chunk->inputCheckpoint = m_input.createCheckpoint(); | 196 chunk->inputCheckpoint = m_input.createCheckpoint(); |
| 198 chunk->preloadScannerCheckpoint = m_preloadScanner->createCheckpoint(); | 197 chunk->preloadScannerCheckpoint = m_preloadScanner->createCheckpoint(); |
| 199 callOnMainThread(bind(&HTMLDocumentParser::didReceiveParsedChunkFromBackgrou
ndParser, m_parser, chunk.release())); | 198 callOnMainThread(bind(&HTMLDocumentParser::didReceiveParsedChunkFromBackgrou
ndParser, m_parser, chunk.release())); |
| 200 | 199 |
| 201 m_pendingTokens = adoptPtr(new CompactHTMLTokenStream); | 200 m_pendingTokens = adoptPtr(new CompactHTMLTokenStream); |
| 202 } | 201 } |
| 203 | 202 |
| 204 } | 203 } |
| OLD | NEW |