daniel@transgaming.com | 4167cc9 | 2013-01-11 04:11:53 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2012 Apple Inc. All rights reserved. |
| 3 | * |
| 4 | * Redistribution and use in source and binary forms, with or without |
| 5 | * modification, are permitted provided that the following conditions |
| 6 | * are met: |
| 7 | * 1. Redistributions of source code must retain the above copyright |
| 8 | * notice, this list of conditions and the following disclaimer. |
| 9 | * 2. Redistributions in binary form must reproduce the above copyright |
| 10 | * notice, this list of conditions and the following disclaimer in the |
| 11 | * documentation and/or other materials provided with the distribution. |
| 12 | * |
| 13 | * THIS SOFTWARE IS PROVIDED BY APPLE, INC. ``AS IS'' AND ANY |
| 14 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 15 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE, INC. OR |
| 17 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| 18 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 19 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| 20 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
| 21 | * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 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. |
| 24 | */ |
| 25 | |
shannon.woods@transgaming.com | da1ed36 | 2013-01-25 21:54:57 +0000 | [diff] [blame] | 26 | #include "third_party/compiler/ArrayBoundsClamper.h" |
daniel@transgaming.com | 4167cc9 | 2013-01-11 04:11:53 +0000 | [diff] [blame] | 27 | |
shannon.woods@transgaming.com | 2496673 | 2013-01-25 21:55:08 +0000 | [diff] [blame] | 28 | // The built-in 'clamp' instruction only accepts floats and returns a float. I |
| 29 | // iterated a few times with our driver team who examined the output from our |
| 30 | // compiler - they said the multiple casts generates more code than a single |
| 31 | // function call. An inline ternary operator might have been better, but since |
| 32 | // the index value might be an expression itself, we'd have to make temporary |
| 33 | // variables to avoid evaluating the expression multiple times. And making |
| 34 | // temporary variables was difficult because ANGLE would then need to make more |
| 35 | // brutal changes to the expression tree. |
| 36 | |
daniel@transgaming.com | 4167cc9 | 2013-01-11 04:11:53 +0000 | [diff] [blame] | 37 | const char* kIntClampBegin = "// BEGIN: Generated code for array bounds clamping\n\n"; |
| 38 | const char* kIntClampEnd = "// END: Generated code for array bounds clamping\n\n"; |
| 39 | const char* kIntClampDefinition = "int webgl_int_clamp(int value, int minValue, int maxValue) { return ((value < minValue) ? minValue : ((value > maxValue) ? maxValue : value)); }\n\n"; |
| 40 | |
| 41 | namespace { |
| 42 | |
| 43 | class ArrayBoundsClamperMarker : public TIntermTraverser { |
| 44 | public: |
| 45 | ArrayBoundsClamperMarker() |
Olli Etuaho | 3d0d9a4 | 2015-06-01 12:16:36 +0300 | [diff] [blame^] | 46 | : TIntermTraverser(true, false, false), |
| 47 | mNeedsClamp(false) |
daniel@transgaming.com | 4167cc9 | 2013-01-11 04:11:53 +0000 | [diff] [blame] | 48 | { |
| 49 | } |
| 50 | |
| 51 | virtual bool visitBinary(Visit visit, TIntermBinary* node) |
| 52 | { |
| 53 | if (node->getOp() == EOpIndexIndirect) |
| 54 | { |
| 55 | TIntermTyped* left = node->getLeft(); |
| 56 | if (left->isArray() || left->isVector() || left->isMatrix()) |
| 57 | { |
| 58 | node->setAddIndexClamp(); |
| 59 | mNeedsClamp = true; |
| 60 | } |
| 61 | } |
| 62 | return true; |
| 63 | } |
| 64 | |
| 65 | bool GetNeedsClamp() { return mNeedsClamp; } |
| 66 | |
| 67 | private: |
| 68 | bool mNeedsClamp; |
| 69 | }; |
| 70 | |
| 71 | } // anonymous namespace |
| 72 | |
| 73 | ArrayBoundsClamper::ArrayBoundsClamper() |
shannon.woods@transgaming.com | 1d432bb | 2013-01-25 21:57:28 +0000 | [diff] [blame] | 74 | : mClampingStrategy(SH_CLAMP_WITH_CLAMP_INTRINSIC) |
| 75 | , mArrayBoundsClampDefinitionNeeded(false) |
daniel@transgaming.com | 4167cc9 | 2013-01-11 04:11:53 +0000 | [diff] [blame] | 76 | { |
| 77 | } |
| 78 | |
shannon.woods@transgaming.com | 1d432bb | 2013-01-25 21:57:28 +0000 | [diff] [blame] | 79 | void ArrayBoundsClamper::SetClampingStrategy(ShArrayIndexClampingStrategy clampingStrategy) |
daniel@transgaming.com | 4167cc9 | 2013-01-11 04:11:53 +0000 | [diff] [blame] | 80 | { |
shannon.woods@transgaming.com | 1d432bb | 2013-01-25 21:57:28 +0000 | [diff] [blame] | 81 | mClampingStrategy = clampingStrategy; |
daniel@transgaming.com | 4167cc9 | 2013-01-11 04:11:53 +0000 | [diff] [blame] | 82 | } |
| 83 | |
| 84 | void ArrayBoundsClamper::MarkIndirectArrayBoundsForClamping(TIntermNode* root) |
| 85 | { |
| 86 | ASSERT(root); |
| 87 | |
| 88 | ArrayBoundsClamperMarker clamper; |
| 89 | root->traverse(&clamper); |
| 90 | if (clamper.GetNeedsClamp()) |
| 91 | { |
| 92 | SetArrayBoundsClampDefinitionNeeded(); |
| 93 | } |
| 94 | } |
| 95 | |
shannon.woods@transgaming.com | 1d432bb | 2013-01-25 21:57:28 +0000 | [diff] [blame] | 96 | void ArrayBoundsClamper::OutputClampingFunctionDefinition(TInfoSinkBase& out) const |
| 97 | { |
| 98 | if (!mArrayBoundsClampDefinitionNeeded) |
| 99 | { |
| 100 | return; |
| 101 | } |
| 102 | if (mClampingStrategy != SH_CLAMP_WITH_USER_DEFINED_INT_CLAMP_FUNCTION) |
| 103 | { |
| 104 | return; |
| 105 | } |
| 106 | out << kIntClampBegin << kIntClampDefinition << kIntClampEnd; |
| 107 | } |