33#include "range_tree.h"
127 return log->elem_to_id.lookup(
reinterpret_cast<BMElem *
>(
v));
133 log->id_to_elem.add_overwrite(
id,
reinterpret_cast<BMElem *
>(
v));
134 log->elem_to_id.add_overwrite(
reinterpret_cast<BMElem *
>(
v),
id);
140 return reinterpret_cast<BMVert *
>(
log->id_to_elem.lookup(
id));
146 return log->elem_to_id.lookup(
reinterpret_cast<BMElem *
>(f));
152 log->id_to_elem.add_overwrite(
id,
reinterpret_cast<BMElem *
>(f));
153 log->elem_to_id.add_overwrite(
reinterpret_cast<BMElem *
>(f),
id);
159 return reinterpret_cast<BMFace *
>(
log->id_to_elem.lookup(
id));
173 if (cd_vert_mask_offset != -1) {
184 if (cd_vert_mask_offset != -1) {
242 for (
const auto item : verts.
items()) {
255 for (
const uint id : faces.
keys()) {
257 std::array<BMEdge *, 3> e_tri;
260 for (
uint i = 0; i < e_tri.size(); i++, l_iter = l_iter->
next) {
261 e_tri[i] = l_iter->
e;
266 for (
uint i = 0; i < e_tri.size(); i++) {
279 for (
const auto item : verts.
items()) {
294 for (
const auto item : faces.
items()) {
307 if (cd_face_sets != -1) {
318 for (
const auto item : verts.
items()) {
334 for (
const auto item : faces.
items()) {
350 uint id = range_tree_uint_take_any(
log->unused_ids);
357 uint id = range_tree_uint_take_any(
log->unused_ids);
365 BMLogEntry *entry = MEM_new<BMLogEntry>(__func__);
398 BMLog *
log = MEM_new<BMLog>(__func__);
401 log->unused_ids = range_tree_uint_alloc(0,
uint(-1));
402 log->id_to_elem.reserve(reserve_num);
403 log->elem_to_id.reserve(reserve_num);
418 range_tree_uint_retake(
log->unused_ids,
id);
421 range_tree_uint_retake(
log->unused_ids,
id);
424 range_tree_uint_retake(
log->unused_ids,
id);
427 range_tree_uint_retake(
log->unused_ids,
id);
430 range_tree_uint_retake(
log->unused_ids,
id);
433 range_tree_uint_retake(
log->unused_ids,
id);
453 log->current_entry = entry;
456 log->current_entry =
nullptr;
460 log->entries.first_ =
log->entries.last_ = entry;
463 while (entry->
prev) {
465 log->entries.first_ = entry;
467 entry =
log->entries.last();
468 while (entry->
next) {
470 log->entries.last_ = entry;
474 for (entry =
log->entries.first(); entry; entry = entry->
next) {
479 range_tree_uint_retake(
log->unused_ids,
id);
482 range_tree_uint_retake(
log->unused_ids,
id);
485 range_tree_uint_retake(
log->unused_ids,
id);
488 range_tree_uint_retake(
log->unused_ids,
id);
491 range_tree_uint_retake(
log->unused_ids,
id);
494 range_tree_uint_retake(
log->unused_ids,
id);
503 if (
log->unused_ids) {
504 range_tree_uint_free(
log->unused_ids);
525 log->current_entry = entry;
540 else if (entry->
next) {
576 else if (!entry->
next) {
582 range_tree_uint_release(
log->unused_ids,
id);
585 range_tree_uint_release(
log->unused_ids,
id);
592 if (
log->current_entry == entry) {
593 log->current_entry = entry->
prev;
606 log->current_entry = entry->
prev;
628 entry =
log->entries.first();
630 else if (entry->
next) {
639 log->current_entry = entry;
673 const uint v_id = range_tree_uint_take_any(
log->unused_ids);
677 log->current_entry->added_verts.add(v_id, lv);
685 log->current_entry->modified_faces.add(f_id, lf);
690 const uint f_id = range_tree_uint_take_any(
log->unused_ids);
697 log->current_entry->added_faces.add(f_id, lf);
709 range_tree_uint_release(
log->unused_ids, v_id);
717 if (std::optional<BMLogVert *> lv_mod = entry->
modified_verts.lookup_try(v_id)) {
718 *lv = *lv_mod.value();
733 range_tree_uint_release(
log->unused_ids, f_id);
747 if (
log->current_entry->added_verts.is_empty()) {
751 if (
log->current_entry->added_faces.is_empty()) {
793 if (std::optional<BMLogVert *> log_vert = entry->
modified_verts.lookup_try(v_id)) {
794 return log_vert.value()->position;
804 if (std::optional<BMLogVert *> log_vert = entry->
modified_verts.lookup_try(v_id)) {
805 return &log_vert.value()->mask;
833 return log->current_entry;
838 return log->unused_ids;
847 const char *current =
" <-- current";
850 printf(
"%s:\n", description);
851 printf(
" % 2d: [ initial ]%s\n", 0, (!
log->current_entry) ? current :
"");
852 for (entry =
log->entries.first(), i = 1; entry; entry = entry->
next, i++) {
853 printf(
" % 2d: [%p]%s\n", i, entry, (entry ==
log->current_entry) ? current :
"");
860 printf(
"BM { totvert=%d totedge=%d totloop=%d faces_num=%d\n",
867 printf(
"%s: Warning: empty bmesh\n", __func__);
871 printf(
"BM { totvert=unknown totedge=unknown totloop=unknown faces_num=unknown\n");
874 printf(
"v | added: %d, removed: %d, modified: %d\n",
878 printf(
"f | added: %d, removed: %d, modified: %d\n",
CustomData interface, see also DNA_customdata_types.h.
Read Blender memory allocation and freeing.
#define BLI_assert_msg(a, msg)
#define BM_ELEM_CD_SET_FLOAT(ele, offset, f)
#define BM_ELEM_CD_GET_FLOAT(ele, offset)
#define BM_ELEM_CD_SET_INT(ele, offset, f)
#define BM_FACE_FIRST_LOOP(p)
#define BM_ITER_MESH(ele, iter, bm, itype)
KeyIterator keys() const &
ItemIterator items() const &
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
BMFace * BM_face_create_verts(BMesh *bm, BMVert **vert_arr, const int len, const BMFace *f_example, const eBMCreateFlag create_flag, const bool create_edges)
BMLogEntry * BM_log_current_entry(BMLog *log)
void BM_log_face_added(BMLog *log, BMFace *f)
BLI_INLINE bool BM_edge_is_wire(const BMEdge *e) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
static BMLogFace * bm_log_face_alloc(BMLog *log, BMFace *f)
static void bm_log_assign_ids(BMesh *bm, BMLog *log)
MINLINE void copy_v3_v3(float r[3], const float a[3])
static void bm_log_entry_free(BMLogEntry *entry)
void BM_log_original_vert_data(BMLog *log, BMVert *v, const float **r_co, const float **r_no)
void BM_vert_kill(BMesh *bm, BMVert *v)
void BM_log_print(const BMLog *log, const char *description)
static uint bm_log_face_id_get(BMLog *log, BMFace *f)
void BM_log_vert_added(BMLog *log, BMVert *v, const int cd_vert_mask_offset)
void BM_log_redo(BMesh *bm, BMLog *log)
static void bm_log_face_values_swap(BMLog *log, const Map< uint, BMLogFace *, 0 > &faces)
void BM_log_free(BMLog *log)
ATTR_WARN_UNUSED_RESULT const BMVert * v
BMVert * BM_vert_create(BMesh *bm, const float co[3], const BMVert *v_example, const eBMCreateFlag create_flag)
Main function for creating a new vertex.
static BMLogVert * bm_log_vert_alloc(BMLog *log, BMVert *v, const int cd_vert_mask_offset)
void BM_log_all_added(BMesh *bm, BMLog *log)
static void bm_log_faces_restore(BMesh *bm, BMLog *log, const Map< uint, BMLogFace *, 0 > &faces)
void BM_log_cleanup_entry(BMLogEntry *entry)
static void bm_log_vert_values_swap(BMesh *bm, BMLog *log, const Map< uint, BMLogVert *, 0 > &verts)
void BM_log_vert_removed(BMLog *log, BMVert *v, const int cd_vert_mask_offset)
void BM_log_before_all_removed(BMesh *bm, BMLog *log)
static BMFace * bm_log_face_from_id(BMLog *log, const uint id)
void BLI_remlink(ListBase *listbase, void *vlink) ATTR_NONNULL(1)
void BM_edge_kill(BMesh *bm, BMEdge *e)
MINLINE void swap_v3_v3(float a[3], float b[3])
int CustomData_get_offset_named(const CustomData *data, eCustomDataType type, StringRef name)
static float vert_mask_get(BMVert *v, const int cd_vert_mask_offset)
void BM_log_print_entry(BMesh *bm, BMLogEntry *entry)
BMLog * BM_log_from_existing_entries_create(BMesh *bm, BMLogEntry *entry)
static BMVert * bm_log_vert_from_id(BMLog *log, const uint id)
BMLog * BM_log_create(BMesh *bm)
const float * BM_log_find_original_vert_mask(BMLog *log, BMVert *v)
static void bm_log_face_id_set(BMLog *log, BMFace *f, const uint id)
static uint bm_log_vert_id_get(BMLog *log, BMVert *v)
static BMLogEntry * bm_log_entry_create()
void BM_face_as_array_vert_tri(BMFace *f, BMVert *r_verts[3])
void BM_log_face_modified(BMLog *log, BMFace *f)
BMLogEntry * BM_log_entry_add(BMLog *log)
void BM_log_undo(BMesh *bm, BMLog *log)
void BM_log_face_removed(BMLog *log, BMFace *f)
void BLI_addtail(ListBase *listbase, void *vlink) ATTR_NONNULL(1)
RangeTreeUInt * BM_log_unused_ids(BMLog *log)
void BM_face_kill(BMesh *bm, BMFace *f)
static void bm_log_verts_unmake(BMesh *bm, BMLog *log, const Map< uint, BMLogVert *, 0 > &verts)
static void vert_mask_set(BMVert *v, const float new_mask, const int cd_vert_mask_offset)
VecBase< float, 3 > float3
static void bm_log_vert_id_set(BMLog *log, BMVert *v, const uint id)
void BM_log_vert_before_modified(BMLog *log, BMVert *v, const int cd_vert_mask_offset)
const float * BM_log_find_original_vert_co(BMLog *log, BMVert *v)
static void bm_log_vert_bmvert_copy(BMLogVert *lv, BMVert *v, const int cd_vert_mask_offset)
static void bm_log_verts_restore(BMesh *bm, BMLog *log, const Map< uint, BMLogVert *, 0 > &verts)
void BM_log_entry_drop(BMLogEntry *entry)
static void bm_log_faces_unmake(BMesh *bm, BMLog *log, const Map< uint, BMLogFace *, 0 > &faces)
Map< uint, BMLogVert *, 0 > deleted_verts
Pool< BMLogFace > face_pool
Map< uint, BMLogVert *, 0 > modified_verts
Map< uint, BMLogFace *, 0 > deleted_faces
Pool< BMLogVert > vert_pool
Map< uint, BMLogVert *, 0 > added_verts
Map< uint, BMLogFace *, 0 > added_faces
Vector< BMLogVert *, 0 > allocated_verts
Vector< BMLogFace *, 0 > allocated_faces
Map< uint, BMLogFace *, 0 > modified_faces
std::array< uint, 3 > v_ids
Map< BMElem *, uint, 0 > elem_to_id
BMLogEntry * current_entry
ListBaseT< BMLogEntry > entries
RangeTreeUInt * unused_ids
Map< uint, BMElem *, 0 > id_to_elem