ba04210097
Also, add more safety to the types involved regarding copy constructors, operator=, etc. git-svn-id: https://cvs.khronos.org/svn/repos/ogl/trunk/ecosystem/public/sdk/tools/glslang@21106 e7fa87d3-cd2b-0410-9028-fcbf551c1848
286 lines
8.3 KiB
C++
286 lines
8.3 KiB
C++
//
|
|
//Copyright (C) 2002-2005 3Dlabs Inc. Ltd.
|
|
//Copyright (C) 2012-2013 LunarG, Inc.
|
|
//
|
|
//All rights reserved.
|
|
//
|
|
//Redistribution and use in source and binary forms, with or without
|
|
//modification, are permitted provided that the following conditions
|
|
//are met:
|
|
//
|
|
// Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
//
|
|
// Redistributions in binary form must reproduce the above
|
|
// copyright notice, this list of conditions and the following
|
|
// disclaimer in the documentation and/or other materials provided
|
|
// with the distribution.
|
|
//
|
|
// Neither the name of 3Dlabs Inc. Ltd. nor the names of its
|
|
// contributors may be used to endorse or promote products derived
|
|
// from this software without specific prior written permission.
|
|
//
|
|
//THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
//"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
//LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
|
//FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
//COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
//INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|
//BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
//LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
//CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
//LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
//ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
//POSSIBILITY OF SUCH DAMAGE.
|
|
//
|
|
|
|
//
|
|
// Symbol table for parsing. Most functionaliy and main ideas
|
|
// are documented in the header file.
|
|
//
|
|
|
|
#include "SymbolTable.h"
|
|
|
|
//
|
|
// TType helper function needs a place to live.
|
|
//
|
|
|
|
//
|
|
// Recursively generate mangled names.
|
|
//
|
|
void TType::buildMangledName(TString& mangledName)
|
|
{
|
|
if (isMatrix())
|
|
mangledName += 'm';
|
|
else if (isVector())
|
|
mangledName += 'v';
|
|
|
|
switch (basicType) {
|
|
case EbtFloat: mangledName += 'f'; break;
|
|
case EbtDouble: mangledName += 'd'; break;
|
|
case EbtInt: mangledName += 'i'; break;
|
|
case EbtUint: mangledName += 'u'; break;
|
|
case EbtBool: mangledName += 'b'; break;
|
|
case EbtSampler:
|
|
switch (sampler.type) {
|
|
case EbtInt: mangledName += "i"; break;
|
|
case EbtUint: mangledName += "u"; break;
|
|
default: break; // some compilers want this
|
|
}
|
|
if (sampler.image)
|
|
mangledName += "I";
|
|
else
|
|
mangledName += "s";
|
|
if (sampler.arrayed)
|
|
mangledName += "A";
|
|
if (sampler.shadow)
|
|
mangledName += "S";
|
|
switch (sampler.dim) {
|
|
case Esd1D: mangledName += "1"; break;
|
|
case Esd2D: mangledName += "2"; break;
|
|
case Esd3D: mangledName += "3"; break;
|
|
case EsdCube: mangledName += "C"; break;
|
|
case EsdRect: mangledName += "R2"; break;
|
|
case EsdBuffer: mangledName += "B"; break;
|
|
default: break; // some compilers want this
|
|
}
|
|
break;
|
|
case EbtStruct:
|
|
mangledName += "struct-";
|
|
if (typeName)
|
|
mangledName += *typeName;
|
|
for (unsigned int i = 0; i < structure->size(); ++i) {
|
|
mangledName += '-';
|
|
(*structure)[i].type->buildMangledName(mangledName);
|
|
}
|
|
default:
|
|
break;
|
|
}
|
|
|
|
if (getVectorSize() > 0)
|
|
mangledName += static_cast<char>('0' + getVectorSize());
|
|
else {
|
|
mangledName += static_cast<char>('0' + getMatrixCols());
|
|
mangledName += static_cast<char>('0' + getMatrixRows());
|
|
}
|
|
|
|
if (arraySizes) {
|
|
const int maxSize = 10;
|
|
char buf[maxSize];
|
|
snprintf(buf, maxSize, "%d", arraySizes->front());
|
|
mangledName += '[';
|
|
mangledName += buf;
|
|
mangledName += ']';
|
|
}
|
|
}
|
|
|
|
int TType::getStructSize() const
|
|
{
|
|
if (!getStruct()) {
|
|
assert(false && "Not a struct");
|
|
return 0;
|
|
}
|
|
|
|
if (structureSize == 0)
|
|
for (TTypeList::iterator tl = getStruct()->begin(); tl != getStruct()->end(); tl++)
|
|
structureSize += ((*tl).type)->getObjectSize();
|
|
|
|
return structureSize;
|
|
}
|
|
|
|
//
|
|
// Dump functions.
|
|
//
|
|
|
|
void TVariable::dump(TInfoSink& infoSink) const
|
|
{
|
|
infoSink.debug << getName().c_str() << ": " << type.getStorageQualifierString() << " " << type.getCompleteTypeString();
|
|
if (type.isArray()) {
|
|
infoSink.debug << "[0]";
|
|
}
|
|
infoSink.debug << "\n";
|
|
}
|
|
|
|
void TFunction::dump(TInfoSink& infoSink) const
|
|
{
|
|
infoSink.debug << getName().c_str() << ": " << returnType.getCompleteTypeString() << " " << getMangledName().c_str() << "\n";
|
|
}
|
|
|
|
void TAnonMember::dump(TInfoSink& TInfoSink) const
|
|
{
|
|
TInfoSink.debug << "anonymous member " << getMemberNumber() << " of " << getAnonContainer().getName().c_str() << "\n";
|
|
}
|
|
|
|
void TSymbolTableLevel::dump(TInfoSink &infoSink) const
|
|
{
|
|
tLevel::const_iterator it;
|
|
for (it = level.begin(); it != level.end(); ++it)
|
|
(*it).second->dump(infoSink);
|
|
}
|
|
|
|
void TSymbolTable::dump(TInfoSink &infoSink) const
|
|
{
|
|
for (int level = currentLevel(); level >= 0; --level) {
|
|
infoSink.debug << "LEVEL " << level << "\n";
|
|
table[level]->dump(infoSink);
|
|
}
|
|
}
|
|
|
|
//
|
|
// Functions have buried pointers to delete.
|
|
//
|
|
TFunction::~TFunction()
|
|
{
|
|
for (TParamList::iterator i = parameters.begin(); i != parameters.end(); ++i)
|
|
delete (*i).type;
|
|
}
|
|
|
|
//
|
|
// Symbol table levels are a map of pointers to symbols that have to be deleted.
|
|
//
|
|
TSymbolTableLevel::~TSymbolTableLevel()
|
|
{
|
|
for (tLevel::iterator it = level.begin(); it != level.end(); ++it)
|
|
delete (*it).second;
|
|
|
|
delete [] defaultPrecision;
|
|
}
|
|
|
|
//
|
|
// Change all function entries in the table with the non-mangled name
|
|
// to be related to the provided built-in operation. This is a low
|
|
// performance operation, and only intended for symbol tables that
|
|
// live across a large number of compiles.
|
|
//
|
|
void TSymbolTableLevel::relateToOperator(const char* name, TOperator op)
|
|
{
|
|
tLevel::iterator it;
|
|
for (it = level.begin(); it != level.end(); ++it) {
|
|
TFunction* function = (*it).second->getAsFunction();
|
|
if (function) {
|
|
if (function->getName() == name)
|
|
function->relateToOperator(op);
|
|
}
|
|
}
|
|
}
|
|
|
|
TSymbol::TSymbol(const TSymbol& copyOf)
|
|
{
|
|
name = NewPoolTString(copyOf.name->c_str());
|
|
uniqueId = copyOf.uniqueId;
|
|
}
|
|
|
|
TVariable::TVariable(const TVariable& copyOf, TStructureMap& remapper) : TSymbol(copyOf)
|
|
{
|
|
type.copyType(copyOf.type, remapper);
|
|
userType = copyOf.userType;
|
|
// for builtIn symbol table level, unionArray and arrayInformation pointers should be NULL
|
|
assert(copyOf.arrayInformationType == 0);
|
|
arrayInformationType = 0;
|
|
|
|
if (copyOf.unionArray) {
|
|
assert(!copyOf.type.getStruct());
|
|
assert(copyOf.type.getObjectSize() == 1);
|
|
unionArray = new constUnion[1];
|
|
unionArray[0] = copyOf.unionArray[0];
|
|
} else
|
|
unionArray = 0;
|
|
}
|
|
|
|
TVariable* TVariable::clone(TStructureMap& remapper)
|
|
{
|
|
TVariable *variable = new TVariable(*this, remapper);
|
|
|
|
return variable;
|
|
}
|
|
|
|
TFunction::TFunction(const TFunction& copyOf, const TStructureMap& remapper) : TSymbol(copyOf)
|
|
{
|
|
for (unsigned int i = 0; i < copyOf.parameters.size(); ++i) {
|
|
TParameter param;
|
|
parameters.push_back(param);
|
|
parameters.back().copyParam(copyOf.parameters[i], remapper);
|
|
}
|
|
|
|
returnType.copyType(copyOf.returnType, remapper);
|
|
mangledName = copyOf.mangledName;
|
|
op = copyOf.op;
|
|
defined = copyOf.defined;
|
|
}
|
|
|
|
TFunction* TFunction::clone(TStructureMap& remapper)
|
|
{
|
|
TFunction *function = new TFunction(*this, remapper);
|
|
|
|
return function;
|
|
}
|
|
|
|
TAnonMember* TAnonMember::clone(TStructureMap& remapper)
|
|
{
|
|
// need to implement this once built-in symbols include interface blocks
|
|
assert(0);
|
|
|
|
return 0;
|
|
}
|
|
|
|
TSymbolTableLevel* TSymbolTableLevel::clone(TStructureMap& remapper)
|
|
{
|
|
TSymbolTableLevel *symTableLevel = new TSymbolTableLevel();
|
|
symTableLevel->anonId = anonId;
|
|
tLevel::iterator iter;
|
|
for (iter = level.begin(); iter != level.end(); ++iter) {
|
|
symTableLevel->insert(*iter->second->clone(remapper));
|
|
}
|
|
|
|
return symTableLevel;
|
|
}
|
|
|
|
void TSymbolTable::copyTable(const TSymbolTable& copyOf)
|
|
{
|
|
TStructureMap remapper;
|
|
uniqueId = copyOf.uniqueId;
|
|
for (unsigned int i = 0; i < copyOf.table.size(); ++i) {
|
|
table.push_back(copyOf.table[i]->clone(remapper));
|
|
}
|
|
}
|