dom/xslt/xpath/txBooleanExpr.cpp@97036ab72558 (annotated)
dom/xslt/xpath/txBooleanExpr.cpp
Tue, 06 Jan 2015 21:39:09 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Tue, 06 Jan 2015 21:39:09 +0100
- branch
- TOR_BUG_9701
- changeset 8
- 97036ab72558
- permissions
- -rw-r--r--
Conditionally force memory storage according to privacy.thirdparty.isolate;
This solves Tor bug #9701, complying with disk avoidance documented in
https://www.torproject.org/projects/torbrowser/design/#disk-avoidance.
| michael@0 | 1 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ |
| michael@0 | 2 | /* This Source Code Form is subject to the terms of the Mozilla Public |
| michael@0 | 3 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
| michael@0 | 4 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
| michael@0 | 5 | |
| michael@0 | 6 | |
| michael@0 | 7 | /** |
| michael@0 | 8 | * Represents a BooleanExpr, a binary expression that |
| michael@0 | 9 | * performs a boolean operation between its lvalue and rvalue. |
| michael@0 | 10 | **/ |
| michael@0 | 11 | |
| michael@0 | 12 | #include "txExpr.h" |
| michael@0 | 13 | #include "txIXPathContext.h" |
| michael@0 | 14 | |
| michael@0 | 15 | /** |
| michael@0 | 16 | * Evaluates this Expr based on the given context node and processor state |
| michael@0 | 17 | * @param context the context node for evaluation of this Expr |
| michael@0 | 18 | * @param ps the ContextState containing the stack information needed |
| michael@0 | 19 | * for evaluation |
| michael@0 | 20 | * @return the result of the evaluation |
| michael@0 | 21 | **/ |
| michael@0 | 22 | nsresult |
| michael@0 | 23 | BooleanExpr::evaluate(txIEvalContext* aContext, txAExprResult** aResult) |
| michael@0 | 24 | { |
| michael@0 | 25 | *aResult = nullptr; |
| michael@0 | 26 | |
| michael@0 | 27 | bool lval; |
| michael@0 | 28 | nsresult rv = leftExpr->evaluateToBool(aContext, lval); |
| michael@0 | 29 | NS_ENSURE_SUCCESS(rv, rv); |
| michael@0 | 30 | |
| michael@0 | 31 | // check for early decision |
| michael@0 | 32 | if (op == OR && lval) { |
| michael@0 | 33 | aContext->recycler()->getBoolResult(true, aResult); |
| michael@0 | 34 | |
| michael@0 | 35 | return NS_OK; |
| michael@0 | 36 | } |
| michael@0 | 37 | if (op == AND && !lval) { |
| michael@0 | 38 | aContext->recycler()->getBoolResult(false, aResult); |
| michael@0 | 39 | |
| michael@0 | 40 | return NS_OK; |
| michael@0 | 41 | } |
| michael@0 | 42 | |
| michael@0 | 43 | bool rval; |
| michael@0 | 44 | rv = rightExpr->evaluateToBool(aContext, rval); |
| michael@0 | 45 | NS_ENSURE_SUCCESS(rv, rv); |
| michael@0 | 46 | |
| michael@0 | 47 | // just use rval, since we already checked lval |
| michael@0 | 48 | aContext->recycler()->getBoolResult(rval, aResult); |
| michael@0 | 49 | |
| michael@0 | 50 | return NS_OK; |
| michael@0 | 51 | } //-- evaluate |
| michael@0 | 52 | |
| michael@0 | 53 | TX_IMPL_EXPR_STUBS_2(BooleanExpr, BOOLEAN_RESULT, leftExpr, rightExpr) |
| michael@0 | 54 | |
| michael@0 | 55 | bool |
| michael@0 | 56 | BooleanExpr::isSensitiveTo(ContextSensitivity aContext) |
| michael@0 | 57 | { |
| michael@0 | 58 | return leftExpr->isSensitiveTo(aContext) || |
| michael@0 | 59 | rightExpr->isSensitiveTo(aContext); |
| michael@0 | 60 | } |
| michael@0 | 61 | |
| michael@0 | 62 | #ifdef TX_TO_STRING |
| michael@0 | 63 | void |
| michael@0 | 64 | BooleanExpr::toString(nsAString& str) |
| michael@0 | 65 | { |
| michael@0 | 66 | if ( leftExpr ) leftExpr->toString(str); |
| michael@0 | 67 | else str.AppendLiteral("null"); |
| michael@0 | 68 | |
| michael@0 | 69 | switch ( op ) { |
| michael@0 | 70 | case OR: |
| michael@0 | 71 | str.AppendLiteral(" or "); |
| michael@0 | 72 | break; |
| michael@0 | 73 | default: |
| michael@0 | 74 | str.AppendLiteral(" and "); |
| michael@0 | 75 | break; |
| michael@0 | 76 | } |
| michael@0 | 77 | if ( rightExpr ) rightExpr->toString(str); |
| michael@0 | 78 | else str.AppendLiteral("null"); |
| michael@0 | 79 | |
| michael@0 | 80 | } |
| michael@0 | 81 | #endif |
