gfx/angle/src/compiler/depgraph/DependencyGraphOutput.cpp@129ffea94266 (annotated)
gfx/angle/src/compiler/depgraph/DependencyGraphOutput.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 | // |
| michael@0 | 2 | // Copyright (c) 2012 The ANGLE Project Authors. All rights reserved. |
| michael@0 | 3 | // Use of this source code is governed by a BSD-style license that can be |
| michael@0 | 4 | // found in the LICENSE file. |
| michael@0 | 5 | // |
| michael@0 | 6 | |
| michael@0 | 7 | #include "compiler/depgraph/DependencyGraphOutput.h" |
| michael@0 | 8 | |
| michael@0 | 9 | void TDependencyGraphOutput::outputIndentation() |
| michael@0 | 10 | { |
| michael@0 | 11 | for (int i = 0; i < getDepth(); ++i) |
| michael@0 | 12 | mSink << " "; |
| michael@0 | 13 | } |
| michael@0 | 14 | |
| michael@0 | 15 | void TDependencyGraphOutput::visitArgument(TGraphArgument* parameter) |
| michael@0 | 16 | { |
| michael@0 | 17 | outputIndentation(); |
| michael@0 | 18 | mSink << "argument " << parameter->getArgumentNumber() << " of call to " |
| michael@0 | 19 | << parameter->getIntermFunctionCall()->getName() << "\n"; |
| michael@0 | 20 | } |
| michael@0 | 21 | |
| michael@0 | 22 | void TDependencyGraphOutput::visitFunctionCall(TGraphFunctionCall* functionCall) |
| michael@0 | 23 | { |
| michael@0 | 24 | outputIndentation(); |
| michael@0 | 25 | mSink << "function call " << functionCall->getIntermFunctionCall()->getName() << "\n"; |
| michael@0 | 26 | } |
| michael@0 | 27 | |
| michael@0 | 28 | void TDependencyGraphOutput::visitSymbol(TGraphSymbol* symbol) |
| michael@0 | 29 | { |
| michael@0 | 30 | outputIndentation(); |
| michael@0 | 31 | mSink << symbol->getIntermSymbol()->getSymbol() << " (symbol id: " |
| michael@0 | 32 | << symbol->getIntermSymbol()->getId() << ")\n"; |
| michael@0 | 33 | } |
| michael@0 | 34 | |
| michael@0 | 35 | void TDependencyGraphOutput::visitSelection(TGraphSelection* selection) |
| michael@0 | 36 | { |
| michael@0 | 37 | outputIndentation(); |
| michael@0 | 38 | mSink << "selection\n"; |
| michael@0 | 39 | } |
| michael@0 | 40 | |
| michael@0 | 41 | void TDependencyGraphOutput::visitLoop(TGraphLoop* loop) |
| michael@0 | 42 | { |
| michael@0 | 43 | outputIndentation(); |
| michael@0 | 44 | mSink << "loop condition\n"; |
| michael@0 | 45 | } |
| michael@0 | 46 | |
| michael@0 | 47 | void TDependencyGraphOutput::visitLogicalOp(TGraphLogicalOp* logicalOp) |
| michael@0 | 48 | { |
| michael@0 | 49 | outputIndentation(); |
| michael@0 | 50 | mSink << "logical " << logicalOp->getOpString() << "\n"; |
| michael@0 | 51 | } |
| michael@0 | 52 | |
| michael@0 | 53 | void TDependencyGraphOutput::outputAllSpanningTrees(TDependencyGraph& graph) |
| michael@0 | 54 | { |
| michael@0 | 55 | mSink << "\n"; |
| michael@0 | 56 | |
| michael@0 | 57 | for (TGraphNodeVector::const_iterator iter = graph.begin(); iter != graph.end(); ++iter) |
| michael@0 | 58 | { |
| michael@0 | 59 | TGraphNode* symbol = *iter; |
| michael@0 | 60 | mSink << "--- Dependency graph spanning tree ---\n"; |
| michael@0 | 61 | clearVisited(); |
| michael@0 | 62 | symbol->traverse(this); |
| michael@0 | 63 | mSink << "\n"; |
| michael@0 | 64 | } |
| michael@0 | 65 | } |
