bd0747d6f0
This includes - doing prescan of shader to know version/profile before parsing it - putting precision qualifiers on built-in ES symbols - getting most built-in state correct for core/compatibility/missing profile - adding gl_VertexID and gl_InstanceID, among other ES 300 built-in symbols - adding the ES 300 gl_Max/Min constants - accepting shaders that contain nothing but whitespace without generating an error git-svn-id: https://cvs.khronos.org/svn/repos/ogl/trunk/ecosystem/public/sdk/tools/glslang@20627 e7fa87d3-cd2b-0410-9028-fcbf551c1848
400 lines
14 KiB
C++
400 lines
14 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.
|
|
//
|
|
|
|
#ifndef _TYPES_INCLUDED
|
|
#define _TYPES_INCLUDED
|
|
|
|
#include "../Include/Common.h"
|
|
#include "../Include/BaseTypes.h"
|
|
|
|
//
|
|
// Need to have association of line numbers to types in a list for building structs.
|
|
//
|
|
class TType;
|
|
struct TTypeLine {
|
|
TType* type;
|
|
int line;
|
|
};
|
|
typedef TVector<TTypeLine> TTypeList;
|
|
|
|
inline TTypeList* NewPoolTTypeList()
|
|
{
|
|
void* memory = GlobalPoolAllocator.allocate(sizeof(TTypeList));
|
|
return new(memory) TTypeList;
|
|
}
|
|
|
|
//
|
|
// TODO: TArraySizes memory: This could be replaced by something smaller.
|
|
// Almost all arrays could be handled by two sizes each fitting
|
|
// in 16 bits, needing a real vector only in the cases where there
|
|
// are more than 3 sizes or a size needing more than 16 bits.
|
|
//
|
|
// The type is a pointer, so that it can be non-allocated and zero
|
|
// for the vast majority of non-array types. Note that means if it
|
|
// is used, it will be containing at least one size.
|
|
|
|
typedef TVector<int>* TArraySizes;
|
|
|
|
inline TArraySizes NewPoolTArraySizes()
|
|
{
|
|
void* memory = GlobalPoolAllocator.allocate(sizeof(TVector<int>));
|
|
return new(memory) TVector<int>;
|
|
}
|
|
|
|
//
|
|
// This is a workaround for a problem with the yacc stack, It can't have
|
|
// types that it thinks have non-trivial constructors. It should
|
|
// just be used while recognizing the grammar, not anything else. Pointers
|
|
// could be used, but also trying to avoid lots of memory management overhead.
|
|
//
|
|
// Not as bad as it looks, there is no actual assumption that the fields
|
|
// match up or are name the same or anything like that.
|
|
//
|
|
|
|
class TQualifier {
|
|
public:
|
|
TStorageQualifier storage : 7;
|
|
TPrecisionQualifier precision : 3;
|
|
};
|
|
|
|
class TPublicType {
|
|
public:
|
|
TBasicType type;
|
|
TQualifier qualifier;
|
|
int vectorSize : 4;
|
|
int matrixCols : 4;
|
|
int matrixRows : 4;
|
|
TArraySizes arraySizes;
|
|
const TType* userDef;
|
|
int line;
|
|
|
|
void initType(int ln = 0)
|
|
{
|
|
type = EbtVoid;
|
|
vectorSize = 1;
|
|
matrixRows = 0;
|
|
matrixCols = 0;
|
|
arraySizes = 0;
|
|
userDef = 0;
|
|
line = ln;
|
|
}
|
|
|
|
void initQualifiers(bool global = false)
|
|
{
|
|
qualifier.storage = global ? EvqGlobal : EvqTemporary;
|
|
qualifier.precision = EpqNone;
|
|
}
|
|
|
|
void init(int line = 0, bool global = false)
|
|
{
|
|
initType(line);
|
|
initQualifiers(global);
|
|
}
|
|
|
|
void setVector(int s)
|
|
{
|
|
matrixRows = 0;
|
|
matrixCols = 0;
|
|
vectorSize = s;
|
|
}
|
|
|
|
void setMatrix(int c, int r)
|
|
{
|
|
matrixRows = r;
|
|
matrixCols = c;
|
|
vectorSize = 0;
|
|
}
|
|
};
|
|
|
|
typedef std::map<TTypeList*, TTypeList*> TStructureMap;
|
|
typedef std::map<TTypeList*, TTypeList*>::const_iterator TStructureMapIterator;
|
|
//
|
|
// Base class for things that have a type.
|
|
//
|
|
class TType {
|
|
public:
|
|
POOL_ALLOCATOR_NEW_DELETE(GlobalPoolAllocator)
|
|
explicit TType(TBasicType t, TStorageQualifier q = EvqTemporary, int vs = 1, int mc = 0, int mr = 0) :
|
|
type(t), vectorSize(vs), matrixCols(mc), matrixRows(mr), arraySizes(0),
|
|
structure(0), structureSize(0), maxArraySize(0), arrayInformationType(0),
|
|
fieldName(0), mangled(0), typeName(0)
|
|
{
|
|
qualifier.storage = q;
|
|
qualifier.precision = EpqNone;
|
|
}
|
|
TType(TBasicType t, TStorageQualifier q, TPrecisionQualifier p, int vs = 1, int mc = 0, int mr = 0) :
|
|
type(t), vectorSize(vs), matrixCols(mc), matrixRows(mr), arraySizes(0),
|
|
structure(0), structureSize(0), maxArraySize(0), arrayInformationType(0),
|
|
fieldName(0), mangled(0), typeName(0)
|
|
{
|
|
qualifier.storage = q;
|
|
qualifier.precision = p;
|
|
assert(p >= 0 && p <= EpqHigh);
|
|
}
|
|
explicit TType(const TPublicType &p) :
|
|
type(p.type), vectorSize(p.vectorSize), matrixCols(p.matrixCols), matrixRows(p.matrixRows), arraySizes(p.arraySizes),
|
|
structure(0), structureSize(0), maxArraySize(0), arrayInformationType(0), fieldName(0), mangled(0), typeName(0)
|
|
{
|
|
qualifier = p.qualifier;
|
|
if (p.userDef) {
|
|
structure = p.userDef->getStruct();
|
|
typeName = NewPoolTString(p.userDef->getTypeName().c_str());
|
|
}
|
|
}
|
|
explicit TType(TTypeList* userDef, const TString& n) :
|
|
type(EbtStruct), vectorSize(1), matrixCols(0), matrixRows(0), arraySizes(0),
|
|
structure(userDef), maxArraySize(0), arrayInformationType(0), fieldName(0), mangled(0)
|
|
{
|
|
qualifier.storage = EvqTemporary;
|
|
qualifier.precision = EpqNone;
|
|
typeName = NewPoolTString(n.c_str());
|
|
}
|
|
explicit TType() {}
|
|
virtual ~TType() {}
|
|
|
|
TType(const TType& type) { *this = type; }
|
|
|
|
void copyType(const TType& copyOf, const TStructureMap& remapper)
|
|
{
|
|
type = copyOf.type;
|
|
qualifier = copyOf.qualifier;
|
|
vectorSize = copyOf.vectorSize;
|
|
matrixCols = copyOf.matrixCols;
|
|
matrixRows = copyOf.matrixRows;
|
|
|
|
if (copyOf.arraySizes) {
|
|
arraySizes = NewPoolTArraySizes();
|
|
*arraySizes = *copyOf.arraySizes;
|
|
} else
|
|
arraySizes = 0;
|
|
|
|
TStructureMapIterator iter;
|
|
if (copyOf.structure) {
|
|
if ((iter = remapper.find(structure)) == remapper.end()) {
|
|
// create the new structure here
|
|
structure = NewPoolTTypeList();
|
|
for (unsigned int i = 0; i < copyOf.structure->size(); ++i) {
|
|
TTypeLine typeLine;
|
|
typeLine.line = (*copyOf.structure)[i].line;
|
|
typeLine.type = (*copyOf.structure)[i].type->clone(remapper);
|
|
structure->push_back(typeLine);
|
|
}
|
|
} else {
|
|
structure = iter->second;
|
|
}
|
|
} else
|
|
structure = 0;
|
|
|
|
fieldName = 0;
|
|
if (copyOf.fieldName)
|
|
fieldName = NewPoolTString(copyOf.fieldName->c_str());
|
|
typeName = 0;
|
|
if (copyOf.typeName)
|
|
typeName = NewPoolTString(copyOf.typeName->c_str());
|
|
|
|
mangled = 0;
|
|
if (copyOf.mangled)
|
|
mangled = NewPoolTString(copyOf.mangled->c_str());
|
|
|
|
structureSize = copyOf.structureSize;
|
|
maxArraySize = copyOf.maxArraySize;
|
|
assert(copyOf.arrayInformationType == 0);
|
|
arrayInformationType = 0; // arrayInformationType should not be set for builtIn symbol table level
|
|
}
|
|
|
|
TType* clone(const TStructureMap& remapper)
|
|
{
|
|
TType *newType = new TType();
|
|
newType->copyType(*this, remapper);
|
|
|
|
return newType;
|
|
}
|
|
|
|
virtual void dereference()
|
|
{
|
|
if (arraySizes) {
|
|
arraySizes = 0;
|
|
maxArraySize = 0;
|
|
} else if (matrixCols > 0) {
|
|
vectorSize = matrixRows;
|
|
matrixCols = 0;
|
|
matrixRows = 0;
|
|
} else if (vectorSize > 1)
|
|
vectorSize = 1;
|
|
}
|
|
|
|
virtual void setElementType(TBasicType t, int s, int mc, int mr, const TType* userDef)
|
|
{
|
|
type = t;
|
|
vectorSize = s;
|
|
matrixCols = mc;
|
|
matrixRows = mr;
|
|
if (userDef)
|
|
structure = userDef->getStruct();
|
|
// leave array information intact.
|
|
}
|
|
virtual void setTypeName(const TString& n) { typeName = NewPoolTString(n.c_str()); }
|
|
virtual void setFieldName(const TString& n) { fieldName = NewPoolTString(n.c_str()); }
|
|
virtual const TString& getTypeName() const
|
|
{
|
|
assert(typeName);
|
|
return *typeName;
|
|
}
|
|
|
|
virtual const TString& getFieldName() const
|
|
{
|
|
assert(fieldName);
|
|
return *fieldName;
|
|
}
|
|
|
|
virtual TBasicType getBasicType() const { return type; }
|
|
virtual TQualifier& getQualifier() { return qualifier; }
|
|
virtual const TQualifier& getQualifier() const { return qualifier; }
|
|
|
|
virtual int getVectorSize() const { return vectorSize; }
|
|
virtual int getMatrixCols() const { return matrixCols; }
|
|
virtual int getMatrixRows() const { return matrixRows; }
|
|
|
|
virtual bool isMatrix() const { return matrixCols ? true : false; }
|
|
virtual bool isArray() const { return arraySizes != 0; }
|
|
int getArraySize() const { return arraySizes->front(); }
|
|
void setArraySizes(TArraySizes s) {
|
|
// copy; we don't want distinct types sharing the same descriptor
|
|
if (! arraySizes)
|
|
arraySizes = NewPoolTArraySizes();
|
|
*arraySizes = *s;
|
|
}
|
|
void changeArraySize(int s) { arraySizes->front() = s; }
|
|
void setMaxArraySize (int s) { maxArraySize = s; }
|
|
int getMaxArraySize () const { return maxArraySize; }
|
|
void setArrayInformationType(TType* t) { arrayInformationType = t; }
|
|
TType* getArrayInformationType() { return arrayInformationType; }
|
|
virtual bool isVector() const { return vectorSize > 1; }
|
|
static const char* getBasicString(TBasicType t) {
|
|
switch (t) {
|
|
case EbtVoid: return "void"; break;
|
|
case EbtFloat: return "float"; break;
|
|
case EbtDouble: return "double"; break;
|
|
case EbtInt: return "int"; break;
|
|
case EbtBool: return "bool"; break;
|
|
case EbtSampler1D: return "sampler1D"; break;
|
|
case EbtSampler2D: return "sampler2D"; break;
|
|
case EbtSampler3D: return "sampler3D"; break;
|
|
case EbtSamplerCube: return "samplerCube"; break;
|
|
case EbtSampler1DShadow: return "sampler1DShadow"; break;
|
|
case EbtSampler2DShadow: return "sampler2DShadow"; break;
|
|
case EbtSamplerRect: return "samplerRect"; break; // ARB_texture_rectangle
|
|
case EbtSamplerRectShadow: return "samplerRectShadow"; break; // ARB_texture_rectangle
|
|
case EbtStruct: return "structure"; break;
|
|
default: return "unknown type";
|
|
}
|
|
}
|
|
const char* getBasicString() const { return TType::getBasicString(type); }
|
|
const char* getStorageQualifierString() const { return ::getStorageQualifierString(qualifier.storage); }
|
|
const char* getPrecisionQualifierString() const { return ::getPrecisionQualifierString(qualifier.precision); }
|
|
TTypeList* getStruct() { return structure; }
|
|
|
|
int getObjectSize() const
|
|
{
|
|
int totalSize;
|
|
|
|
if (getBasicType() == EbtStruct)
|
|
totalSize = getStructSize();
|
|
else if (matrixCols)
|
|
totalSize = matrixCols * matrixRows;
|
|
else
|
|
totalSize = vectorSize;
|
|
|
|
if (isArray())
|
|
totalSize *= Max(getArraySize(), getMaxArraySize());
|
|
|
|
return totalSize;
|
|
}
|
|
|
|
TTypeList* getStruct() const { return structure; }
|
|
TString& getMangledName() {
|
|
if (!mangled) {
|
|
mangled = NewPoolTString("");
|
|
buildMangledName(*mangled);
|
|
*mangled += ';' ;
|
|
}
|
|
|
|
return *mangled;
|
|
}
|
|
bool sameElementType(const TType& right) const {
|
|
return type == right.type &&
|
|
vectorSize == right.vectorSize &&
|
|
matrixCols == right.matrixCols &&
|
|
matrixRows == right.matrixRows &&
|
|
structure == right.structure;
|
|
}
|
|
bool operator==(const TType& right) const {
|
|
return type == right.type &&
|
|
vectorSize == right.vectorSize &&
|
|
matrixCols == right.matrixCols &&
|
|
matrixRows == right.matrixRows &&
|
|
(arraySizes == 0 && right.arraySizes == 0 || (arraySizes && right.arraySizes && *arraySizes == *right.arraySizes)) &&
|
|
structure == right.structure;
|
|
// don't check the qualifier, it's not ever what's being sought after
|
|
}
|
|
bool operator!=(const TType& right) const {
|
|
return !operator==(right);
|
|
}
|
|
TString getCompleteString() const;
|
|
|
|
protected:
|
|
void buildMangledName(TString&);
|
|
int getStructSize() const;
|
|
|
|
TBasicType type : 8;
|
|
int vectorSize : 4;
|
|
int matrixCols : 4;
|
|
int matrixRows : 4;
|
|
TQualifier qualifier;
|
|
|
|
TArraySizes arraySizes;
|
|
|
|
TTypeList* structure; // 0 unless this is a struct
|
|
mutable int structureSize;
|
|
int maxArraySize;
|
|
TType* arrayInformationType;
|
|
TString *fieldName; // for structure field names
|
|
TString *mangled;
|
|
TString *typeName; // for structure field type name
|
|
};
|
|
|
|
#endif // _TYPES_INCLUDED_
|