1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/*
* ***** 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]];
}
int RAS_Polygon::GetVertexOffset(int i)
{
return m_offset[i];
}
/*
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;
}
|
