#include "CmVertexDeclaration.h" #include "CmVertexDeclarationRTTI.h" #include "CmHardwareBufferManager.h" #include "CmRenderSystem.h" #include "CmUtil.h" namespace CamelotFramework { VertexElement::VertexElement(unsigned short source, UINT32 offset, VertexElementType theType, VertexElementSemantic semantic, unsigned short index) : mSource(source), mOffset(offset), mType(theType), mSemantic(semantic), mIndex(index) { } //----------------------------------------------------------------------------- UINT32 VertexElement::getSize(void) const { return getTypeSize(mType); } //----------------------------------------------------------------------------- UINT32 VertexElement::getTypeSize(VertexElementType etype) { switch(etype) { case VET_COLOR: case VET_COLOR_ABGR: case VET_COLOR_ARGB: return sizeof(RGBA); case VET_FLOAT1: return sizeof(float); case VET_FLOAT2: return sizeof(float)*2; case VET_FLOAT3: return sizeof(float)*3; case VET_FLOAT4: return sizeof(float)*4; case VET_SHORT1: return sizeof(short); case VET_SHORT2: return sizeof(short)*2; case VET_SHORT3: return sizeof(short)*3; case VET_SHORT4: return sizeof(short)*4; case VET_UBYTE4: return sizeof(unsigned char)*4; } return 0; } //----------------------------------------------------------------------------- unsigned short VertexElement::getTypeCount(VertexElementType etype) { switch (etype) { case VET_COLOR: case VET_COLOR_ABGR: case VET_COLOR_ARGB: return 4; case VET_FLOAT1: return 1; case VET_FLOAT2: return 2; case VET_FLOAT3: return 3; case VET_FLOAT4: return 4; case VET_SHORT1: return 1; case VET_SHORT2: return 2; case VET_SHORT3: return 3; case VET_SHORT4: return 4; case VET_UBYTE4: return 4; } CM_EXCEPT(InvalidParametersException, "Invalid type"); } //----------------------------------------------------------------------------- VertexElementType VertexElement::multiplyTypeCount(VertexElementType baseType, unsigned short count) { switch (baseType) { case VET_FLOAT1: switch(count) { case 1: return VET_FLOAT1; case 2: return VET_FLOAT2; case 3: return VET_FLOAT3; case 4: return VET_FLOAT4; default: break; } break; case VET_SHORT1: switch(count) { case 1: return VET_SHORT1; case 2: return VET_SHORT2; case 3: return VET_SHORT3; case 4: return VET_SHORT4; default: break; } break; default: break; } CM_EXCEPT(InvalidParametersException, "Invalid base type"); } //-------------------------------------------------------------------------- VertexElementType VertexElement::getBestColourVertexElementType(void) { // Use the current render system to determine if possible if (CamelotFramework::RenderSystem::instancePtr()) { return CamelotFramework::RenderSystem::instancePtr()->getColorVertexElementType(); } else { // We can't know the specific type right now, so pick a type // based on platform #if CM_PLATFORM == CM_PLATFORM_WIN32 return VET_COLOR_ARGB; // prefer D3D format on windows #else return VET_COLOR_ABGR; // prefer GL format on everything else #endif } } //-------------------------------------------------------------------------- void VertexElement::convertColourValue(VertexElementType srcType, VertexElementType dstType, UINT32* ptr) { if (srcType == dstType) return; // Conversion between ARGB and ABGR is always a case of flipping R/B *ptr = ((*ptr&0x00FF0000)>>16)|((*ptr&0x000000FF)<<16)|(*ptr&0xFF00FF00); } //-------------------------------------------------------------------------- UINT32 VertexElement::convertColourValue(const Color& src, VertexElementType dst) { switch(dst) { #if CM_PLATFORM == CM_PLATFORM_WIN32 default: #endif case VET_COLOR_ARGB: return src.getAsARGB(); #if CM_PLATFORM != CM_PLATFORM_WIN32 default: #endif case VET_COLOR_ABGR: return src.getAsABGR(); }; } //----------------------------------------------------------------------------- VertexElementType VertexElement::getBaseType(VertexElementType multiType) { switch (multiType) { case VET_FLOAT1: case VET_FLOAT2: case VET_FLOAT3: case VET_FLOAT4: return VET_FLOAT1; case VET_COLOR: return VET_COLOR; case VET_COLOR_ABGR: return VET_COLOR_ABGR; case VET_COLOR_ARGB: return VET_COLOR_ARGB; case VET_SHORT1: case VET_SHORT2: case VET_SHORT3: case VET_SHORT4: return VET_SHORT1; case VET_UBYTE4: return VET_UBYTE4; }; // To keep compiler happy return VET_FLOAT1; } //----------------------------------------------------------------------------- size_t VertexElement::calculateHash() const { size_t hash = 0; hash_combine(hash, mSource); hash_combine(hash, mOffset); hash_combine(hash, mType); hash_combine(hash, mSemantic); hash_combine(hash, mIndex); return hash; } //----------------------------------------------------------------------------- VertexDeclaration::VertexDeclaration() :mHash(0) { } //----------------------------------------------------------------------------- VertexDeclaration::~VertexDeclaration() { } //----------------------------------------------------------------------------- const VertexDeclaration::VertexElementList& VertexDeclaration::getElements(void) const { return mElementList; } //----------------------------------------------------------------------------- const VertexElement& VertexDeclaration::addElement(unsigned short source, UINT32 offset, VertexElementType theType, VertexElementSemantic semantic, unsigned short index) { // Refine colour type to a specific type if (theType == VET_COLOR) { theType = VertexElement::getBestColourVertexElementType(); } mElementList.push_back( VertexElement(source, offset, theType, semantic, index) ); recalculateHash(); return mElementList.back(); } //----------------------------------------------------------------------------- const VertexElement& VertexDeclaration::insertElement(unsigned short atPosition, unsigned short source, UINT32 offset, VertexElementType theType, VertexElementSemantic semantic, unsigned short index) { if (atPosition >= mElementList.size()) { return addElement(source, offset, theType, semantic, index); } VertexElementList::iterator i = mElementList.begin(); for (unsigned short n = 0; n < atPosition; ++n) ++i; i = mElementList.insert(i, VertexElement(source, offset, theType, semantic, index)); recalculateHash(); return *i; } //----------------------------------------------------------------------------- const VertexElement* VertexDeclaration::getElement(unsigned short index) { assert(index < mElementList.size() && "Index out of bounds"); VertexElementList::iterator i = mElementList.begin(); for (unsigned short n = 0; n < index; ++n) ++i; return &(*i); } //----------------------------------------------------------------------------- void VertexDeclaration::removeElement(unsigned short elem_index) { assert(elem_index < mElementList.size() && "Index out of bounds"); VertexElementList::iterator i = mElementList.begin(); for (unsigned short n = 0; n < elem_index; ++n) ++i; mElementList.erase(i); recalculateHash(); } //----------------------------------------------------------------------------- void VertexDeclaration::removeElement(VertexElementSemantic semantic, unsigned short index) { VertexElementList::iterator ei, eiend; eiend = mElementList.end(); for (ei = mElementList.begin(); ei != eiend; ++ei) { if (ei->getSemantic() == semantic && ei->getSemanticIdx() == index) { mElementList.erase(ei); break; } } recalculateHash(); } //----------------------------------------------------------------------------- void VertexDeclaration::removeAllElements(void) { mElementList.clear(); recalculateHash(); } //----------------------------------------------------------------------------- void VertexDeclaration::modifyElement(unsigned short elem_index, unsigned short source, UINT32 offset, VertexElementType theType, VertexElementSemantic semantic, unsigned short index) { assert(elem_index < mElementList.size() && "Index out of bounds"); VertexElementList::iterator i = mElementList.begin(); std::advance(i, elem_index); (*i) = VertexElement(source, offset, theType, semantic, index); recalculateHash(); } //----------------------------------------------------------------------------- const VertexElement* VertexDeclaration::findElementBySemantic( VertexElementSemantic sem, unsigned short index) { VertexElementList::const_iterator ei, eiend; eiend = mElementList.end(); for (ei = mElementList.begin(); ei != eiend; ++ei) { if (ei->getSemantic() == sem && ei->getSemanticIdx() == index) { return &(*ei); } } return NULL; } //----------------------------------------------------------------------------- VertexDeclaration::VertexElementList VertexDeclaration::findElementsBySource( unsigned short source) { VertexElementList retList; VertexElementList::const_iterator ei, eiend; eiend = mElementList.end(); for (ei = mElementList.begin(); ei != eiend; ++ei) { if (ei->getStreamIdx() == source) { retList.push_back(*ei); } } return retList; } //----------------------------------------------------------------------------- UINT32 VertexDeclaration::getVertexSize(unsigned short source) { VertexElementList::const_iterator i, iend; iend = mElementList.end(); UINT32 sz = 0; for (i = mElementList.begin(); i != iend; ++i) { if (i->getStreamIdx() == source) { sz += i->getSize(); } } return sz; } //----------------------------------------------------------------------------- VertexDeclarationPtr VertexDeclaration::clone(HardwareBufferManager* mgr) { HardwareBufferManager* pManager = mgr ? mgr : HardwareBufferManager::instancePtr(); VertexDeclarationPtr ret = pManager->createVertexDeclaration(); VertexElementList::const_iterator i, iend; iend = mElementList.end(); for (i = mElementList.begin(); i != iend; ++i) { ret->addElement(i->getStreamIdx(), i->getOffset(), i->getType(), i->getSemantic(), i->getSemanticIdx()); } ret->mHash = mHash; return ret; } //----------------------------------------------------------------------------- // Sort routine for VertexElement bool VertexDeclaration::vertexElementLess(const VertexElement& e1, const VertexElement& e2) { // Sort by source first if (e1.getStreamIdx() < e2.getStreamIdx()) { return true; } else if (e1.getStreamIdx() == e2.getStreamIdx()) { // Use ordering of semantics to sort if (e1.getSemantic() < e2.getSemantic()) { return true; } else if (e1.getSemantic() == e2.getSemantic()) { // Use index to sort if (e1.getSemanticIdx() < e2.getSemanticIdx()) { return true; } } } return false; } void VertexDeclaration::sort(void) { mElementList.sort(VertexDeclaration::vertexElementLess); } //----------------------------------------------------------------------------- void VertexDeclaration::closeGapsInSource(void) { if (mElementList.empty()) return; // Sort first sort(); VertexElementList::iterator i, iend; iend = mElementList.end(); unsigned short targetIdx = 0; unsigned short lastIdx = getElement(0)->getStreamIdx(); unsigned short c = 0; for (i = mElementList.begin(); i != iend; ++i, ++c) { VertexElement& elem = *i; if (lastIdx != elem.getStreamIdx()) { targetIdx++; lastIdx = elem.getStreamIdx(); } if (targetIdx != elem.getStreamIdx()) { modifyElement(c, targetIdx, elem.getOffset(), elem.getType(), elem.getSemantic(), elem.getSemanticIdx()); } } } //----------------------------------------------------------------------------- unsigned short VertexDeclaration::getMaxSource(void) const { VertexElementList::const_iterator i, iend; iend = mElementList.end(); unsigned short ret = 0; for (i = mElementList.begin(); i != iend; ++i) { if (i->getStreamIdx() > ret) { ret = i->getStreamIdx(); } } return ret; } //---------------------------------------------------------------------------- void VertexDeclaration::recalculateHash() { mHash = 0; for(auto iter = mElementList.begin(); iter != mElementList.end(); ++iter) { hash_combine(mHash, iter->calculateHash()); } } /************************************************************************/ /* SERIALIZATION */ /************************************************************************/ RTTITypeBase* VertexDeclaration::getRTTIStatic() { return VertexDeclarationRTTI::instance(); } RTTITypeBase* VertexDeclaration::getRTTI() const { return getRTTIStatic(); } }