68965c0fa9
It also removes some old code that ancient compilers used to need. However, the main issue is getting access to hash functions for unordered_map in portable way.
124 lines
4.4 KiB
C++
124 lines
4.4 KiB
C++
//
|
|
//Copyright (C) 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 _REFLECTION_INCLUDED
|
|
#define _REFLECTION_INCLUDED
|
|
|
|
#include "../Public/ShaderLang.h"
|
|
|
|
#include <list>
|
|
#include <set>
|
|
|
|
//
|
|
// A reflection database and its interface, consistent with the OpenGL API reflection queries.
|
|
//
|
|
|
|
namespace glslang {
|
|
|
|
class TIntermediate;
|
|
class TIntermAggregate;
|
|
class TLiveTraverser;
|
|
|
|
// Data needed for just a single object at the granularity exchanged by the reflection API
|
|
class TObjectReflection {
|
|
public:
|
|
TObjectReflection(const TString& pName, int pOffset, int pGLDefineType, int pSize, int pIndex) :
|
|
name(pName), offset(pOffset), glDefineType(pGLDefineType), size(pSize), index(pIndex) { }
|
|
void dump() const { printf("%s: offset %d, type %x, size %d, index %d\n", name.c_str(), offset, glDefineType, size, index); }
|
|
TString name;
|
|
int offset;
|
|
int glDefineType;
|
|
int size; // data size in bytes for a block, array size for a (non-block) object that's an array
|
|
int index;
|
|
};
|
|
|
|
// The full reflection database
|
|
class TReflection {
|
|
public:
|
|
TReflection() : badReflection("__bad__", -1, -1, -1, -1) {}
|
|
virtual ~TReflection() {}
|
|
|
|
// grow the reflection stage by stage
|
|
bool addStage(EShLanguage, const TIntermediate&);
|
|
|
|
// for mapping a uniform index to a uniform object's description
|
|
int getNumUniforms() { return (int)indexToUniform.size(); }
|
|
const TObjectReflection& getUniform(int i) const
|
|
{
|
|
if (i >= 0 && i < (int)indexToUniform.size())
|
|
return indexToUniform[i];
|
|
else
|
|
return badReflection;
|
|
}
|
|
|
|
// for mapping a block index to the block's description
|
|
int getNumUniformBlocks() const { return (int)indexToUniformBlock.size(); }
|
|
const TObjectReflection& getUniformBlock(int i) const
|
|
{
|
|
if (i >= 0 && i < (int)indexToUniformBlock.size())
|
|
return indexToUniformBlock[i];
|
|
else
|
|
return badReflection;
|
|
}
|
|
|
|
// for mapping any name to its index (both block names and uniforms names)
|
|
int getIndex(const char* name) const
|
|
{
|
|
TNameToIndex::const_iterator it = nameToIndex.find(name);
|
|
if (it == nameToIndex.end())
|
|
return -1;
|
|
else
|
|
return it->second;
|
|
}
|
|
|
|
void dump();
|
|
|
|
protected:
|
|
friend class glslang::TLiveTraverser;
|
|
|
|
// Need a TString hash: typedef std::unordered_map<TString, int> TNameToIndex;
|
|
typedef std::map<TString, int> TNameToIndex;
|
|
typedef std::vector<TObjectReflection> TMapIndexToReflection;
|
|
|
|
TObjectReflection badReflection; // return for queries of -1 or generally out of range; has expected descriptions with in it for this
|
|
TNameToIndex nameToIndex; // maps names to indexes; can hold all types of data: uniform/buffer and which function names have been processed
|
|
TMapIndexToReflection indexToUniform;
|
|
TMapIndexToReflection indexToUniformBlock;
|
|
};
|
|
|
|
} // end namespace glslang
|
|
|
|
#endif // _REFLECTION_INCLUDED
|