js/src/jit/EdgeCaseAnalysis.cpp@129ffea94266 (annotated)
js/src/jit/EdgeCaseAnalysis.cpp
Sat, 03 Jan 2015 20:18:00 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Sat, 03 Jan 2015 20:18:00 +0100
- branch
- TOR_BUG_3246
- changeset 7
- 129ffea94266
- permissions
- -rw-r--r--
Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.
| michael@0 | 1 | /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*- |
| michael@0 | 2 | * vim: set ts=8 sts=4 et sw=4 tw=99: |
| michael@0 | 3 | * This Source Code Form is subject to the terms of the Mozilla Public |
| michael@0 | 4 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
| michael@0 | 5 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
| michael@0 | 6 | |
| michael@0 | 7 | #include "jit/EdgeCaseAnalysis.h" |
| michael@0 | 8 | |
| michael@0 | 9 | #include "jit/MIR.h" |
| michael@0 | 10 | #include "jit/MIRGraph.h" |
| michael@0 | 11 | |
| michael@0 | 12 | using namespace js; |
| michael@0 | 13 | using namespace js::jit; |
| michael@0 | 14 | |
| michael@0 | 15 | EdgeCaseAnalysis::EdgeCaseAnalysis(MIRGenerator *mir, MIRGraph &graph) |
| michael@0 | 16 | : mir(mir), graph(graph) |
| michael@0 | 17 | { |
| michael@0 | 18 | } |
| michael@0 | 19 | |
| michael@0 | 20 | bool |
| michael@0 | 21 | EdgeCaseAnalysis::analyzeLate() |
| michael@0 | 22 | { |
| michael@0 | 23 | // Renumber definitions for NeedNegativeZeroCheck under analyzeEdgeCasesBackward. |
| michael@0 | 24 | uint32_t nextId = 1; |
| michael@0 | 25 | |
| michael@0 | 26 | for (ReversePostorderIterator block(graph.rpoBegin()); block != graph.rpoEnd(); block++) { |
| michael@0 | 27 | if (mir->shouldCancel("Analyze Late (first loop)")) |
| michael@0 | 28 | return false; |
| michael@0 | 29 | for (MDefinitionIterator iter(*block); iter; iter++) { |
| michael@0 | 30 | iter->setId(nextId++); |
| michael@0 | 31 | iter->analyzeEdgeCasesForward(); |
| michael@0 | 32 | } |
| michael@0 | 33 | block->lastIns()->setId(nextId++); |
| michael@0 | 34 | } |
| michael@0 | 35 | |
| michael@0 | 36 | for (PostorderIterator block(graph.poBegin()); block != graph.poEnd(); block++) { |
| michael@0 | 37 | if (mir->shouldCancel("Analyze Late (second loop)")) |
| michael@0 | 38 | return false; |
| michael@0 | 39 | for (MInstructionReverseIterator riter(block->rbegin()); riter != block->rend(); riter++) |
| michael@0 | 40 | riter->analyzeEdgeCasesBackward(); |
| michael@0 | 41 | } |
| michael@0 | 42 | |
| michael@0 | 43 | return true; |
| michael@0 | 44 | } |
