blob: 6a317217c3c5756076c706c37fdad67da10d0b20 [file] [log] [blame]
daniel@transgaming.com4167cc92013-01-11 04:11:53 +00001/*
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
26#include "compiler/ArrayBoundsClamper.h"
27
28const char* kIntClampBegin = "// BEGIN: Generated code for array bounds clamping\n\n";
29const char* kIntClampEnd = "// END: Generated code for array bounds clamping\n\n";
30const char* kIntClampDefinition = "int webgl_int_clamp(int value, int minValue, int maxValue) { return ((value < minValue) ? minValue : ((value > maxValue) ? maxValue : value)); }\n\n";
31
32namespace {
33
34class ArrayBoundsClamperMarker : public TIntermTraverser {
35public:
36 ArrayBoundsClamperMarker()
37 : mNeedsClamp(false)
38 {
39 }
40
41 virtual bool visitBinary(Visit visit, TIntermBinary* node)
42 {
43 if (node->getOp() == EOpIndexIndirect)
44 {
45 TIntermTyped* left = node->getLeft();
46 if (left->isArray() || left->isVector() || left->isMatrix())
47 {
48 node->setAddIndexClamp();
49 mNeedsClamp = true;
50 }
51 }
52 return true;
53 }
54
55 bool GetNeedsClamp() { return mNeedsClamp; }
56
57private:
58 bool mNeedsClamp;
59};
60
61} // anonymous namespace
62
63ArrayBoundsClamper::ArrayBoundsClamper()
64 : mArrayBoundsClampDefinitionNeeded(false)
65{
66}
67
68void ArrayBoundsClamper::OutputClampingFunctionDefinition(TInfoSinkBase& out) const
69{
70 if (!mArrayBoundsClampDefinitionNeeded)
71 {
72 return;
73 }
74 out << kIntClampBegin << kIntClampDefinition << kIntClampEnd;
75}
76
77void ArrayBoundsClamper::MarkIndirectArrayBoundsForClamping(TIntermNode* root)
78{
79 ASSERT(root);
80
81 ArrayBoundsClamperMarker clamper;
82 root->traverse(&clamper);
83 if (clamper.GetNeedsClamp())
84 {
85 SetArrayBoundsClampDefinitionNeeded();
86 }
87}
88