forked from bartvdbraak/blender
2a305580b2
Fix T38030. In c++ source we use one list for triangles and an other for quads, but KX_PolyProxy doesn't care about that and return the vertex offset in its list. So we just have to compute the offset of each RAS_DisplayArray to its previous to have an absolute vertex index. Reviewers: moguri, campbellbarton, kupoman, agoose77, brita_, hg1 Reviewed By: agoose77, hg1 Projects: #game_engine Maniphest Tasks: T38030 Differential Revision: https://developer.blender.org/D1324
124 lines
2.6 KiB
C++
124 lines
2.6 KiB
C++
/*
|
|
* ***** BEGIN GPL LICENSE BLOCK *****
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License
|
|
* as published by the Free Software Foundation; either version 2
|
|
* of the License, or (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*
|
|
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
|
|
* All rights reserved.
|
|
*
|
|
* The Original Code is: all of this file.
|
|
*
|
|
* Contributor(s): none yet.
|
|
*
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
*/
|
|
|
|
/** \file gameengine/Rasterizer/RAS_Polygon.cpp
|
|
* \ingroup bgerast
|
|
*/
|
|
|
|
#ifdef _MSC_VER
|
|
# pragma warning (disable:4786)
|
|
#endif
|
|
|
|
#include "RAS_Polygon.h"
|
|
#include "RAS_MaterialBucket.h"
|
|
|
|
RAS_Polygon::RAS_Polygon(RAS_MaterialBucket* bucket, RAS_DisplayArray *darray, int numvert)
|
|
{
|
|
m_bucket = bucket;
|
|
m_darray = darray;
|
|
m_offset[0] = m_offset[1] = m_offset[2] = m_offset[3] = 0;
|
|
m_numvert = numvert;
|
|
|
|
// m_edgecode = 255;
|
|
m_polyflags = 0;
|
|
}
|
|
|
|
int RAS_Polygon::VertexCount()
|
|
{
|
|
return m_numvert;
|
|
}
|
|
|
|
void RAS_Polygon::SetVertexOffset(int i, unsigned short offset)
|
|
{
|
|
m_offset[i] = offset;
|
|
}
|
|
|
|
RAS_TexVert *RAS_Polygon::GetVertex(int i)
|
|
{
|
|
return &m_darray->m_vertex[m_offset[i]];
|
|
}
|
|
|
|
unsigned int RAS_Polygon::GetVertexOffsetAbsolute(unsigned short i)
|
|
{
|
|
return m_offset[i] + m_darray->m_offset;
|
|
}
|
|
|
|
/*
|
|
int RAS_Polygon::GetEdgeCode()
|
|
{
|
|
return m_edgecode;
|
|
}
|
|
|
|
void RAS_Polygon::SetEdgeCode(int edgecode)
|
|
{
|
|
m_edgecode = edgecode;
|
|
}*/
|
|
|
|
|
|
bool RAS_Polygon::IsVisible()
|
|
{
|
|
return (m_polyflags & VISIBLE) != 0;
|
|
}
|
|
|
|
void RAS_Polygon::SetVisible(bool visible)
|
|
{
|
|
if (visible) m_polyflags |= VISIBLE;
|
|
else m_polyflags &= ~VISIBLE;
|
|
}
|
|
|
|
bool RAS_Polygon::IsCollider()
|
|
{
|
|
return (m_polyflags & COLLIDER) != 0;
|
|
}
|
|
|
|
void RAS_Polygon::SetCollider(bool visible)
|
|
{
|
|
if (visible) m_polyflags |= COLLIDER;
|
|
else m_polyflags &= ~COLLIDER;
|
|
}
|
|
|
|
bool RAS_Polygon::IsTwoside()
|
|
{
|
|
return (m_polyflags & TWOSIDE) != 0;
|
|
}
|
|
|
|
void RAS_Polygon::SetTwoside(bool twoside)
|
|
{
|
|
if (twoside) m_polyflags |= TWOSIDE;
|
|
else m_polyflags &= ~TWOSIDE;
|
|
}
|
|
|
|
RAS_MaterialBucket* RAS_Polygon::GetMaterial()
|
|
{
|
|
return m_bucket;
|
|
}
|
|
|
|
RAS_DisplayArray* RAS_Polygon::GetDisplayArray()
|
|
{
|
|
return m_darray;
|
|
}
|