daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 1 | // |
shannonwoods@chromium.org | 96e7ba1 | 2013-05-30 00:02:41 +0000 | [diff] [blame] | 2 | // Copyright (c) 2002-2013 The ANGLE Project Authors. All rights reserved. |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 3 | // Use of this source code is governed by a BSD-style license that can be |
| 4 | // found in the LICENSE file. |
| 5 | // |
| 6 | |
| 7 | // |
| 8 | // Symbol table for parsing. Most functionaliy and main ideas |
| 9 | // are documented in the header file. |
| 10 | // |
| 11 | |
apatrick@chromium.org | e057c5d | 2012-01-26 19:18:24 +0000 | [diff] [blame] | 12 | #if defined(_MSC_VER) |
| 13 | #pragma warning(disable: 4718) |
| 14 | #endif |
| 15 | |
Geoff Lang | 1773282 | 2013-08-29 13:46:49 -0400 | [diff] [blame] | 16 | #include "compiler/translator/SymbolTable.h" |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 17 | |
apatrick@chromium.org | 8187fa8 | 2010-06-15 22:09:28 +0000 | [diff] [blame] | 18 | #include <stdio.h> |
kbr@chromium.org | 476541f | 2011-10-27 21:14:51 +0000 | [diff] [blame] | 19 | #include <algorithm> |
| 20 | |
Jamie Madill | bfa91f4 | 2014-06-05 15:45:18 -0400 | [diff] [blame^] | 21 | int TSymbolTable::uniqueIdCounter = 0; |
Nicolas Capens | bd10cf5 | 2013-06-20 09:51:51 -0400 | [diff] [blame] | 22 | |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 23 | // |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 24 | // Functions have buried pointers to delete. |
| 25 | // |
| 26 | TFunction::~TFunction() |
| 27 | { |
daniel@transgaming.com | 0578f81 | 2010-05-17 09:58:39 +0000 | [diff] [blame] | 28 | for (TParamList::iterator i = parameters.begin(); i != parameters.end(); ++i) |
| 29 | delete (*i).type; |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 30 | } |
| 31 | |
| 32 | // |
| 33 | // Symbol table levels are a map of pointers to symbols that have to be deleted. |
| 34 | // |
| 35 | TSymbolTableLevel::~TSymbolTableLevel() |
| 36 | { |
daniel@transgaming.com | 0578f81 | 2010-05-17 09:58:39 +0000 | [diff] [blame] | 37 | for (tLevel::iterator it = level.begin(); it != level.end(); ++it) |
| 38 | delete (*it).second; |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 39 | } |
| 40 | |
Jamie Madill | bfa91f4 | 2014-06-05 15:45:18 -0400 | [diff] [blame^] | 41 | bool TSymbolTableLevel::insert(const TString &name, TSymbol &symbol) |
| 42 | { |
| 43 | symbol.setUniqueId(TSymbolTable::nextUniqueId()); |
| 44 | |
| 45 | // returning true means symbol was added to the table |
| 46 | tInsertResult result = level.insert(tLevelPair(name, &symbol)); |
| 47 | |
| 48 | return result.second; |
| 49 | } |
| 50 | |
| 51 | bool TSymbolTableLevel::insert(TSymbol &symbol) |
| 52 | { |
| 53 | return insert(symbol.getMangledName(), symbol); |
| 54 | } |
| 55 | |
| 56 | TSymbol *TSymbolTableLevel::find(const TString &name) const |
| 57 | { |
| 58 | tLevel::const_iterator it = level.find(name); |
| 59 | if (it == level.end()) |
| 60 | return 0; |
| 61 | else |
| 62 | return (*it).second; |
| 63 | } |
| 64 | |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 65 | // |
| 66 | // Change all function entries in the table with the non-mangled name |
| 67 | // to be related to the provided built-in operation. This is a low |
| 68 | // performance operation, and only intended for symbol tables that |
| 69 | // live across a large number of compiles. |
| 70 | // |
Zhenyao Mo | 9eedea0 | 2014-05-12 16:02:35 -0700 | [diff] [blame] | 71 | void TSymbolTableLevel::relateToOperator(const char *name, TOperator op) |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 72 | { |
Zhenyao Mo | 9eedea0 | 2014-05-12 16:02:35 -0700 | [diff] [blame] | 73 | for (tLevel::iterator it = level.begin(); it != level.end(); ++it) |
| 74 | { |
| 75 | if ((*it).second->isFunction()) |
| 76 | { |
| 77 | TFunction *function = static_cast<TFunction*>((*it).second); |
daniel@transgaming.com | 0578f81 | 2010-05-17 09:58:39 +0000 | [diff] [blame] | 78 | if (function->getName() == name) |
| 79 | function->relateToOperator(op); |
| 80 | } |
| 81 | } |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 82 | } |
| 83 | |
alokp@chromium.org | 8815d7f | 2010-09-09 17:30:03 +0000 | [diff] [blame] | 84 | // |
| 85 | // Change all function entries in the table with the non-mangled name |
| 86 | // to be related to the provided built-in extension. This is a low |
| 87 | // performance operation, and only intended for symbol tables that |
| 88 | // live across a large number of compiles. |
| 89 | // |
Zhenyao Mo | 9eedea0 | 2014-05-12 16:02:35 -0700 | [diff] [blame] | 90 | void TSymbolTableLevel::relateToExtension(const char *name, const TString &ext) |
alokp@chromium.org | 8815d7f | 2010-09-09 17:30:03 +0000 | [diff] [blame] | 91 | { |
Zhenyao Mo | 9eedea0 | 2014-05-12 16:02:35 -0700 | [diff] [blame] | 92 | for (tLevel::iterator it = level.begin(); it != level.end(); ++it) |
| 93 | { |
| 94 | TSymbol *symbol = it->second; |
| 95 | if (symbol->getName() == name) |
Jamie Madill | 2aeb26a | 2013-07-08 14:02:55 -0400 | [diff] [blame] | 96 | symbol->relateToExtension(ext); |
alokp@chromium.org | 8815d7f | 2010-09-09 17:30:03 +0000 | [diff] [blame] | 97 | } |
| 98 | } |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 99 | |
Zhenyao Mo | 9eedea0 | 2014-05-12 16:02:35 -0700 | [diff] [blame] | 100 | TSymbol::TSymbol(const TSymbol ©Of) |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 101 | { |
daniel@transgaming.com | 0578f81 | 2010-05-17 09:58:39 +0000 | [diff] [blame] | 102 | name = NewPoolTString(copyOf.name->c_str()); |
| 103 | uniqueId = copyOf.uniqueId; |
daniel@transgaming.com | 4f39fd9 | 2010-03-08 20:26:45 +0000 | [diff] [blame] | 104 | } |
| 105 | |
shannonwoods@chromium.org | 96e7ba1 | 2013-05-30 00:02:41 +0000 | [diff] [blame] | 106 | TSymbol *TSymbolTable::find(const TString &name, int shaderVersion, bool *builtIn, bool *sameScope) |
| 107 | { |
| 108 | int level = currentLevel(); |
| 109 | TSymbol *symbol; |
| 110 | |
| 111 | do |
| 112 | { |
Zhenyao Mo | 9eedea0 | 2014-05-12 16:02:35 -0700 | [diff] [blame] | 113 | if (level == ESSL3_BUILTINS && shaderVersion != 300) |
| 114 | level--; |
| 115 | if (level == ESSL1_BUILTINS && shaderVersion != 100) |
| 116 | level--; |
shannonwoods@chromium.org | 96e7ba1 | 2013-05-30 00:02:41 +0000 | [diff] [blame] | 117 | |
| 118 | symbol = table[level]->find(name); |
| 119 | } |
| 120 | while (symbol == 0 && --level >= 0); |
| 121 | |
| 122 | if (builtIn) |
| 123 | *builtIn = (level <= LAST_BUILTIN_LEVEL); |
| 124 | if (sameScope) |
| 125 | *sameScope = (level == currentLevel()); |
| 126 | |
| 127 | return symbol; |
| 128 | } |
| 129 | |
| 130 | TSymbol *TSymbolTable::findBuiltIn(const TString &name, int shaderVersion) |
| 131 | { |
| 132 | for (int level = LAST_BUILTIN_LEVEL; level >= 0; level--) |
| 133 | { |
Zhenyao Mo | 9eedea0 | 2014-05-12 16:02:35 -0700 | [diff] [blame] | 134 | if (level == ESSL3_BUILTINS && shaderVersion != 300) |
| 135 | level--; |
| 136 | if (level == ESSL1_BUILTINS && shaderVersion != 100) |
| 137 | level--; |
shannonwoods@chromium.org | 96e7ba1 | 2013-05-30 00:02:41 +0000 | [diff] [blame] | 138 | |
| 139 | TSymbol *symbol = table[level]->find(name); |
| 140 | |
| 141 | if (symbol) |
| 142 | return symbol; |
| 143 | } |
| 144 | |
| 145 | return 0; |
| 146 | } |
Alok Priyadarshi | bc3f1ac | 2013-09-23 14:57:02 -0400 | [diff] [blame] | 147 | |
| 148 | TSymbolTable::~TSymbolTable() |
| 149 | { |
| 150 | while (table.size() > 0) |
| 151 | pop(); |
| 152 | } |
Zhenyao Mo | 9eedea0 | 2014-05-12 16:02:35 -0700 | [diff] [blame] | 153 | |
| 154 | void TSymbolTable::insertBuiltIn( |
| 155 | ESymbolLevel level, TType *rvalue, const char *name, |
| 156 | TType *ptype1, TType *ptype2, TType *ptype3, TType *ptype4, TType *ptype5) |
| 157 | { |
| 158 | if (ptype1->getBasicType() == EbtGSampler2D) |
| 159 | { |
| 160 | bool gvec4 = (rvalue->getBasicType() == EbtGVec4); |
| 161 | insertBuiltIn(level, gvec4 ? new TType(EbtFloat, 4) : rvalue, name, |
| 162 | new TType(EbtSampler2D), ptype2, ptype3, ptype4, ptype5); |
| 163 | insertBuiltIn(level, gvec4 ? new TType(EbtInt, 4) : rvalue, name, |
| 164 | new TType(EbtISampler2D), ptype2, ptype3, ptype4, ptype5); |
| 165 | insertBuiltIn(level, gvec4 ? new TType(EbtUInt, 4) : rvalue, name, |
| 166 | new TType(EbtUSampler2D), ptype2, ptype3, ptype4, ptype5); |
| 167 | return; |
| 168 | } |
| 169 | if (ptype1->getBasicType() == EbtGSampler3D) |
| 170 | { |
| 171 | bool gvec4 = (rvalue->getBasicType() == EbtGVec4); |
| 172 | insertBuiltIn(level, gvec4 ? new TType(EbtFloat, 4) : rvalue, name, |
| 173 | new TType(EbtSampler3D), ptype2, ptype3, ptype4, ptype5); |
| 174 | insertBuiltIn(level, gvec4 ? new TType(EbtInt, 4) : rvalue, name, |
| 175 | new TType(EbtISampler3D), ptype2, ptype3, ptype4, ptype5); |
| 176 | insertBuiltIn(level, gvec4 ? new TType(EbtUInt, 4) : rvalue, name, |
| 177 | new TType(EbtUSampler3D), ptype2, ptype3, ptype4, ptype5); |
| 178 | return; |
| 179 | } |
| 180 | if (ptype1->getBasicType() == EbtGSamplerCube) |
| 181 | { |
| 182 | bool gvec4 = (rvalue->getBasicType() == EbtGVec4); |
| 183 | insertBuiltIn(level, gvec4 ? new TType(EbtFloat, 4) : rvalue, name, |
| 184 | new TType(EbtSamplerCube), ptype2, ptype3, ptype4, ptype5); |
| 185 | insertBuiltIn(level, gvec4 ? new TType(EbtInt, 4) : rvalue, name, |
| 186 | new TType(EbtISamplerCube), ptype2, ptype3, ptype4, ptype5); |
| 187 | insertBuiltIn(level, gvec4 ? new TType(EbtUInt, 4) : rvalue, name, |
| 188 | new TType(EbtUSamplerCube), ptype2, ptype3, ptype4, ptype5); |
| 189 | return; |
| 190 | } |
| 191 | if (ptype1->getBasicType() == EbtGSampler2DArray) |
| 192 | { |
| 193 | bool gvec4 = (rvalue->getBasicType() == EbtGVec4); |
| 194 | insertBuiltIn(level, gvec4 ? new TType(EbtFloat, 4) : rvalue, name, |
| 195 | new TType(EbtSampler2DArray), ptype2, ptype3, ptype4, ptype5); |
| 196 | insertBuiltIn(level, gvec4 ? new TType(EbtInt, 4) : rvalue, name, |
| 197 | new TType(EbtISampler2DArray), ptype2, ptype3, ptype4, ptype5); |
| 198 | insertBuiltIn(level, gvec4 ? new TType(EbtUInt, 4) : rvalue, name, |
| 199 | new TType(EbtUSampler2DArray), ptype2, ptype3, ptype4, ptype5); |
| 200 | return; |
| 201 | } |
| 202 | |
| 203 | TFunction *function = new TFunction(NewPoolTString(name), *rvalue); |
| 204 | |
| 205 | TType *types[] = {ptype1, ptype2, ptype3, ptype4, ptype5}; |
| 206 | for (size_t ii = 0; ii < sizeof(types) / sizeof(types[0]); ++ii) |
| 207 | { |
| 208 | if (types[ii]) |
| 209 | { |
| 210 | TParameter param = {NULL, types[ii]}; |
| 211 | function->addParameter(param); |
| 212 | } |
| 213 | } |
| 214 | |
| 215 | insert(level, *function); |
| 216 | } |
| 217 | |
| 218 | TPrecision TSymbolTable::getDefaultPrecision(TBasicType type) |
| 219 | { |
| 220 | if (!SupportsPrecision(type)) |
| 221 | return EbpUndefined; |
| 222 | |
| 223 | // unsigned integers use the same precision as signed |
| 224 | TBasicType baseType = (type == EbtUInt) ? EbtInt : type; |
| 225 | |
| 226 | int level = static_cast<int>(precisionStack.size()) - 1; |
| 227 | assert(level >= 0); // Just to be safe. Should not happen. |
| 228 | // If we dont find anything we return this. Should we error check this? |
| 229 | TPrecision prec = EbpUndefined; |
| 230 | while (level >= 0) |
| 231 | { |
| 232 | PrecisionStackLevel::iterator it = precisionStack[level]->find(baseType); |
| 233 | if (it != precisionStack[level]->end()) |
| 234 | { |
| 235 | prec = (*it).second; |
| 236 | break; |
| 237 | } |
| 238 | level--; |
| 239 | } |
| 240 | return prec; |
| 241 | } |