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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
|
/**
* BME_mesh.c jan 2007
*
* BM mesh level functions.
*
* $Id: BME_eulers.c,v 1.00 2007/01/17 17:42:01 Briggs Exp $
*
* ***** 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.
* about this.
*
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* The Original Code is Copyright (C) 2007 Blender Foundation.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): Geoffrey Bantle.
*
* ***** END GPL LICENSE BLOCK *****
*/
#include "MEM_guardedalloc.h"
#include "DNA_listBase.h"
#include "BLI_blenlib.h"
#include "BLI_math.h"
#include "BKE_utildefines.h"
#include "bmesh.h"
#include "bmesh_private.h"
void BME_error(void);
/*bmesh_error stub*/
void bmesh_error(void)
{
printf("BM modelling error!");
}
/*
* BMESH SET SYSFLAG
*
* Sets a bitflag for a given element.
*
*/
void bmesh_set_sysflag(BMHeader *head, int flag)
{
head->flag |= flag;
}
/*
* BMESH CLEAR SYSFLAG
*
* Clears a bitflag for a given element.
*
*/
void bmesh_clear_sysflag(BMHeader *head, int flag)
{
head->flag &= ~flag;
}
/*
* BMESH TEST SYSFLAG
*
* Tests whether a bitflag is set for a given element.
*
*/
int bmesh_test_sysflag(BMHeader *head, int flag)
{
if(head->flag & flag)
return 1;
return 0;
}
/*
* BMESH MAKE MESH
*
* Allocates a new BMesh structure.
* Returns -
* Pointer to a BM
*
*/
BMesh *BM_Make_Mesh(int allocsize[4])
{
/*allocate the structure*/
BMesh *bm = MEM_callocN(sizeof(BMesh),"BM");
int vsize, esize, lsize, fsize, lstsize;
int baselevel = LAYER_ADJ;
if (baselevel == LAYER_BASE) {
vsize = sizeof(BMBaseVert);
esize = sizeof(BMBaseEdge);
lsize = sizeof(BMBaseLoop);
fsize = sizeof(BMBaseFace);
lstsize = sizeof(BMBaseLoopList);
} else {
vsize = sizeof(BMVert);
esize = sizeof(BMEdge);
lsize = sizeof(BMLoop);
fsize = sizeof(BMFace);
lstsize = sizeof(BMLoopList);
}
bm->baselevel = baselevel;
/*allocate the memory pools for the mesh elements*/
bm->vpool = BLI_mempool_create(vsize, allocsize[0], allocsize[0], 0, 1);
bm->epool = BLI_mempool_create(esize, allocsize[1], allocsize[1], 0, 1);
bm->lpool = BLI_mempool_create(lsize, allocsize[2], allocsize[2], 0, 0);
bm->looplistpool = BLI_mempool_create(lstsize, allocsize[3], allocsize[3], 0, 0);
bm->fpool = BLI_mempool_create(fsize, allocsize[3], allocsize[3], 0, 1);
/*allocate one flag pool that we dont get rid of.*/
bm->toolflagpool = BLI_mempool_create(sizeof(BMFlagLayer), 512, 512, 0, 0);
bm->stackdepth = 1;
bm->totflags = 1;
return bm;
}
/*
* BMESH FREE MESH
*
* Frees a BMesh structure.
*/
void BM_Free_Mesh_Data(BMesh *bm)
{
BMVert *v;
BMEdge *e;
BMLoop *l;
BMFace *f;
BMIter verts;
BMIter edges;
BMIter faces;
BMIter loops;
for(v = BMIter_New(&verts, bm, BM_VERTS_OF_MESH, bm ); v; v = BMIter_Step(&verts)) CustomData_bmesh_free_block( &(bm->vdata), &(v->head.data) );
for(e = BMIter_New(&edges, bm, BM_EDGES_OF_MESH, bm ); e; e = BMIter_Step(&edges)) CustomData_bmesh_free_block( &(bm->edata), &(e->head.data) );
for(f = BMIter_New(&faces, bm, BM_FACES_OF_MESH, bm ); f; f = BMIter_Step(&faces)){
CustomData_bmesh_free_block( &(bm->pdata), &(f->head.data) );
for(l = BMIter_New(&loops, bm, BM_LOOPS_OF_FACE, f ); l; l = BMIter_Step(&loops)) CustomData_bmesh_free_block( &(bm->ldata), &(l->head.data) );
}
/*Free custom data pools, This should probably go in CustomData_free?*/
if(bm->vdata.totlayer) BLI_mempool_destroy(bm->vdata.pool);
if(bm->edata.totlayer) BLI_mempool_destroy(bm->edata.pool);
if(bm->ldata.totlayer) BLI_mempool_destroy(bm->ldata.pool);
if(bm->pdata.totlayer) BLI_mempool_destroy(bm->pdata.pool);
/*free custom data*/
CustomData_free(&bm->vdata,0);
CustomData_free(&bm->edata,0);
CustomData_free(&bm->ldata,0);
CustomData_free(&bm->pdata,0);
/*destroy element pools*/
BLI_mempool_destroy(bm->vpool);
BLI_mempool_destroy(bm->epool);
BLI_mempool_destroy(bm->lpool);
BLI_mempool_destroy(bm->fpool);
if (bm->svpool)
BLI_mempool_destroy(bm->svpool);
if (bm->sepool)
BLI_mempool_destroy(bm->sepool);
if (bm->slpool)
BLI_mempool_destroy(bm->slpool);
if (bm->sfpool)
BLI_mempool_destroy(bm->sfpool);
/*destroy flag pool*/
BLI_mempool_destroy(bm->toolflagpool);
BLI_mempool_destroy(bm->looplistpool);
BLI_freelistN(&bm->selected);
BMO_ClearStack(bm);
}
void BM_Free_Mesh(BMesh *bm)
{
BM_Free_Mesh_Data(bm);
MEM_freeN(bm);
}
/*
* BMESH COMPUTE NORMALS
*
* Updates the normals of a mesh.
* Note that this can only be called
*
*/
void BM_Compute_Normals(BMesh *bm)
{
BMVert *v;
BMFace *f;
BMLoop *l;
BMIter verts;
BMIter faces;
BMIter loops;
unsigned int maxlength = 0, i;
float (*projectverts)[3];
/*first, find out the largest face in mesh*/
BM_ITER(f, &faces, bm, BM_FACES_OF_MESH, NULL) {
if (BM_TestHFlag(f, BM_HIDDEN))
continue;
if(f->len > maxlength) maxlength = f->len;
}
/*make sure we actually have something to do*/
if(maxlength < 3) return;
/*allocate projectverts array*/
projectverts = MEM_callocN(sizeof(float) * maxlength * 3, "BM normal computation array");
/*calculate all face normals*/
BM_ITER(f, &faces, bm, BM_FACES_OF_MESH, NULL) {
if (BM_TestHFlag(f, BM_HIDDEN))
continue;
if (f->head.flag & BM_NONORMCALC)
continue;
bmesh_update_face_normal(bm, f, projectverts);
}
/*Zero out vertex normals*/
BM_ITER(v, &verts, bm, BM_VERTS_OF_MESH, NULL) {
if (BM_TestHFlag(v, BM_HIDDEN))
continue;
v->no[0] = v->no[1] = v->no[2] = 0.0;
}
/*add face normals to vertices*/
i = 0;
BM_ITER(f, &faces, bm, BM_FACES_OF_MESH, NULL) {
i += 1;
if (BM_TestHFlag(f, BM_HIDDEN))
continue;
for(l = BMIter_New(&loops, bm, BM_LOOPS_OF_FACE, f ); l; l = BMIter_Step(&loops))
add_v3_v3v3(l->v->no, l->v->no, f->no);
}
/*average the vertex normals*/
BM_ITER(v, &verts, bm, BM_VERTS_OF_MESH, NULL) {
if (BM_TestHFlag(v, BM_HIDDEN))
continue;
if (normalize_v3(v->no)==0.0) {
copy_v3_v3(v->no, v->co);
normalize_v3(v->no);
}
}
MEM_freeN(projectverts);
}
/*
* BMESH BEGIN/END EDIT
*
* Functions for setting up a mesh for editing and cleaning up after
* the editing operations are done. These are called by the tools/operator
* API for each time a tool is executed.
*
* Returns -
* Nothing
*
*/
void bmesh_begin_edit(BMesh *UNUSED(bm)){
}
void bmesh_end_edit(BMesh *bm, int UNUSED(flag)){
/*compute normals, clear temp flags and flush selections*/
BM_Compute_Normals(bm);
BM_SelectMode_Flush(bm);
}
|