Currently there is a "calc_face_normal" argument to mesh to bmesh
conversion, but vertex normals had always implicitly inherited whatever
dirty state the mesh input's vertex normals were in. Probably they were
most often assumed to not be dirty, but this was never really correct in
the general case.
Ever since the refactor to move vertex normals out of mesh vertices,
cfa53e0fbe, the copying logic has been explicit: copy the
normals when they are not dirty. But it turns out that more control is
needed, and sometimes normals should be calculated for the resulting
BMesh.
This commit adds an option to the conversion to calculate vertex
normals, true by default. In almost all places except the decimate
and edge split modifiers, I just copied the value of the
"calc_face_normals" argument.
Differential Revision: https://developer.blender.org/D14406
207 lines
6.2 KiB
C
207 lines
6.2 KiB
C
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
#pragma once
|
|
|
|
/** \file
|
|
* \ingroup bmesh
|
|
*/
|
|
|
|
#include "bmesh_class.h"
|
|
|
|
struct BMAllocTemplate;
|
|
struct BMLoopNorEditDataArray;
|
|
struct BMPartialUpdate;
|
|
struct MLoopNorSpaceArray;
|
|
|
|
void BM_mesh_elem_toolflags_ensure(BMesh *bm);
|
|
void BM_mesh_elem_toolflags_clear(BMesh *bm);
|
|
|
|
struct BMeshCreateParams {
|
|
bool use_toolflags : true;
|
|
};
|
|
|
|
/**
|
|
* \brief BMesh Make Mesh
|
|
*
|
|
* Allocates a new BMesh structure.
|
|
*
|
|
* \return The New bmesh
|
|
*
|
|
* \note ob is needed by multires
|
|
*/
|
|
BMesh *BM_mesh_create(const struct BMAllocTemplate *allocsize,
|
|
const struct BMeshCreateParams *params);
|
|
|
|
/**
|
|
* \brief BMesh Free Mesh
|
|
*
|
|
* Frees a BMesh data and its structure.
|
|
*/
|
|
void BM_mesh_free(BMesh *bm);
|
|
/**
|
|
* \brief BMesh Free Mesh Data
|
|
*
|
|
* Frees a BMesh structure.
|
|
*
|
|
* \note frees mesh, but not actual BMesh struct
|
|
*/
|
|
void BM_mesh_data_free(BMesh *bm);
|
|
/**
|
|
* \brief BMesh Clear Mesh
|
|
*
|
|
* Clear all data in bm
|
|
*/
|
|
void BM_mesh_clear(BMesh *bm);
|
|
|
|
/**
|
|
* \brief BMesh Begin 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.
|
|
*/
|
|
void bmesh_edit_begin(BMesh *bm, BMOpTypeFlag type_flag);
|
|
/**
|
|
* \brief BMesh End Edit
|
|
*/
|
|
void bmesh_edit_end(BMesh *bm, BMOpTypeFlag type_flag);
|
|
|
|
void BM_mesh_elem_index_ensure_ex(BMesh *bm, char htype, int elem_offset[4]);
|
|
void BM_mesh_elem_index_ensure(BMesh *bm, char htype);
|
|
/**
|
|
* Array checking/setting macros.
|
|
*
|
|
* Currently vert/edge/loop/face index data is being abused, in a few areas of the code.
|
|
*
|
|
* To avoid correcting them afterwards, set 'bm->elem_index_dirty' however its possible
|
|
* this flag is set incorrectly which could crash blender.
|
|
*
|
|
* Functions that calls this function may depend on dirty indices on being set.
|
|
*
|
|
* This is read-only, so it can be used for assertions that don't impact behavior.
|
|
*/
|
|
void BM_mesh_elem_index_validate(
|
|
BMesh *bm, const char *location, const char *func, const char *msg_a, const char *msg_b);
|
|
|
|
#ifndef NDEBUG
|
|
/**
|
|
* \see #BM_mesh_elem_index_validate the same rationale applies to this function.
|
|
*/
|
|
bool BM_mesh_elem_table_check(BMesh *bm);
|
|
#endif
|
|
|
|
/**
|
|
* Re-allocates mesh data with/without toolflags.
|
|
*/
|
|
void BM_mesh_toolflags_set(BMesh *bm, bool use_toolflags);
|
|
|
|
void BM_mesh_elem_table_ensure(BMesh *bm, char htype);
|
|
/* use BM_mesh_elem_table_ensure where possible to avoid full rebuild */
|
|
void BM_mesh_elem_table_init(BMesh *bm, char htype);
|
|
void BM_mesh_elem_table_free(BMesh *bm, char htype);
|
|
|
|
BLI_INLINE BMVert *BM_vert_at_index(BMesh *bm, const int index)
|
|
{
|
|
BLI_assert((index >= 0) && (index < bm->totvert));
|
|
BLI_assert((bm->elem_table_dirty & BM_VERT) == 0);
|
|
return bm->vtable[index];
|
|
}
|
|
BLI_INLINE BMEdge *BM_edge_at_index(BMesh *bm, const int index)
|
|
{
|
|
BLI_assert((index >= 0) && (index < bm->totedge));
|
|
BLI_assert((bm->elem_table_dirty & BM_EDGE) == 0);
|
|
return bm->etable[index];
|
|
}
|
|
BLI_INLINE BMFace *BM_face_at_index(BMesh *bm, const int index)
|
|
{
|
|
BLI_assert((index >= 0) && (index < bm->totface));
|
|
BLI_assert((bm->elem_table_dirty & BM_FACE) == 0);
|
|
return bm->ftable[index];
|
|
}
|
|
|
|
BMVert *BM_vert_at_index_find(BMesh *bm, int index);
|
|
BMEdge *BM_edge_at_index_find(BMesh *bm, int index);
|
|
BMFace *BM_face_at_index_find(BMesh *bm, int index);
|
|
BMLoop *BM_loop_at_index_find(BMesh *bm, int index);
|
|
|
|
/**
|
|
* Use lookup table when available, else use slower find functions.
|
|
*
|
|
* \note Try to use #BM_mesh_elem_table_ensure instead.
|
|
*/
|
|
BMVert *BM_vert_at_index_find_or_table(BMesh *bm, int index);
|
|
BMEdge *BM_edge_at_index_find_or_table(BMesh *bm, int index);
|
|
BMFace *BM_face_at_index_find_or_table(BMesh *bm, int index);
|
|
|
|
// XXX
|
|
|
|
/**
|
|
* Return the amount of element of type 'type' in a given bmesh.
|
|
*/
|
|
int BM_mesh_elem_count(BMesh *bm, char htype);
|
|
|
|
/**
|
|
* Remaps the vertices, edges and/or faces of the bmesh as indicated by vert/edge/face_idx arrays
|
|
* (xxx_idx[org_index] = new_index).
|
|
*
|
|
* A NULL array means no changes.
|
|
*
|
|
* \note
|
|
* - Does not mess with indices, just sets elem_index_dirty flag.
|
|
* - For verts/edges/faces only (as loops must remain "ordered" and "aligned"
|
|
* on a per-face basis...).
|
|
*
|
|
* \warning Be careful if you keep pointers to affected BM elements,
|
|
* or arrays, when using this func!
|
|
*/
|
|
void BM_mesh_remap(BMesh *bm, const uint *vert_idx, const uint *edge_idx, const uint *face_idx);
|
|
|
|
/**
|
|
* Use new memory pools for this mesh.
|
|
*
|
|
* \note needed for re-sizing elements (adding/removing tool flags)
|
|
* but could also be used for packing fragmented bmeshes.
|
|
*/
|
|
void BM_mesh_rebuild(BMesh *bm,
|
|
const struct BMeshCreateParams *params,
|
|
struct BLI_mempool *vpool,
|
|
struct BLI_mempool *epool,
|
|
struct BLI_mempool *lpool,
|
|
struct BLI_mempool *fpool);
|
|
|
|
typedef struct BMAllocTemplate {
|
|
int totvert, totedge, totloop, totface;
|
|
} BMAllocTemplate;
|
|
|
|
/* used as an extern, defined in bmesh.h */
|
|
extern const BMAllocTemplate bm_mesh_allocsize_default;
|
|
extern const BMAllocTemplate bm_mesh_chunksize_default;
|
|
|
|
#define BMALLOC_TEMPLATE_FROM_BM(bm) \
|
|
{ \
|
|
(CHECK_TYPE_INLINE(bm, BMesh *), (bm)->totvert), (bm)->totedge, (bm)->totloop, (bm)->totface \
|
|
}
|
|
|
|
#define _VA_BMALLOC_TEMPLATE_FROM_ME_1(me) \
|
|
{ \
|
|
(CHECK_TYPE_INLINE(me, Mesh *), (me)->totvert), (me)->totedge, (me)->totloop, (me)->totpoly, \
|
|
}
|
|
#define _VA_BMALLOC_TEMPLATE_FROM_ME_2(me_a, me_b) \
|
|
{ \
|
|
(CHECK_TYPE_INLINE(me_a, Mesh *), \
|
|
CHECK_TYPE_INLINE(me_b, Mesh *), \
|
|
(me_a)->totvert + (me_b)->totvert), \
|
|
(me_a)->totedge + (me_b)->totedge, (me_a)->totloop + (me_b)->totloop, \
|
|
(me_a)->totpoly + (me_b)->totpoly, \
|
|
}
|
|
#define BMALLOC_TEMPLATE_FROM_ME(...) \
|
|
VA_NARGS_CALL_OVERLOAD(_VA_BMALLOC_TEMPLATE_FROM_ME_, __VA_ARGS__)
|
|
|
|
/* Vertex coords access. */
|
|
void BM_mesh_vert_coords_get(BMesh *bm, float (*vert_coords)[3]);
|
|
float (*BM_mesh_vert_coords_alloc(BMesh *bm, int *r_vert_len))[3];
|
|
void BM_mesh_vert_coords_apply(BMesh *bm, const float (*vert_coords)[3]);
|
|
void BM_mesh_vert_coords_apply_with_mat4(BMesh *bm,
|
|
const float (*vert_coords)[3],
|
|
const float mat[4][4]);
|