/* * ***** 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * * The Original Code is Copyright (C) 2004 by Blender Foundation. * All rights reserved. * * The Original Code is: all of this file. * * Contributor(s): Joseph Eagar * * ***** END GPL LICENSE BLOCK ***** */ #include #include #include #include #include #include "MEM_guardedalloc.h" #include "PIL_time.h" #include "BLO_sys_types.h" // for intptr_t support #include "DNA_mesh_types.h" #include "DNA_material_types.h" #include "DNA_meshdata_types.h" #include "DNA_modifier_types.h" #include "DNA_object_types.h" #include "DNA_scene_types.h" #include "DNA_screen_types.h" #include "DNA_view3d_types.h" #include "DNA_key_types.h" #include "RNA_types.h" #include "RNA_define.h" #include "RNA_access.h" #include "BLI_utildefines.h" #include "BLI_blenlib.h" #include "BLI_math.h" #include "BLI_editVert.h" #include "BLI_rand.h" #include "BLI_ghash.h" #include "BLI_linklist.h" #include "BLI_heap.h" #include "BLI_array.h" #include "BKE_context.h" #include "BKE_customdata.h" #include "BKE_depsgraph.h" #include "BKE_global.h" #include "BKE_library.h" #include "BKE_key.h" #include "BKE_mesh.h" #include "BKE_object.h" #include "BKE_bmesh.h" #include "BKE_report.h" #include "BKE_tessmesh.h" #include "bmesh.h" #include "BIF_gl.h" #include "BIF_glutil.h" #include "WM_api.h" #include "WM_types.h" #include "ED_mesh.h" #include "ED_view3d.h" #include "ED_util.h" #include "ED_screen.h" #include "UI_interface.h" #include "editbmesh_bvh.h" #include "mesh_intern.h" void EDBM_RecalcNormals(BMEditMesh *em) { BM_Compute_Normals(em->bm); } void EDBM_ClearMesh(BMEditMesh *em) { /*clear bmesh*/ BM_Clear_Mesh(em->bm); /*free derived meshes*/ if (em->derivedCage) { em->derivedCage->needsFree = 1; em->derivedCage->release(em->derivedCage); } if (em->derivedFinal && em->derivedFinal != em->derivedCage) { em->derivedFinal->needsFree = 1; em->derivedFinal->release(em->derivedFinal); } em->derivedCage = em->derivedFinal = NULL; /*free tesselation data*/ em->tottri = 0; if (em->looptris) MEM_freeN(em->looptris); } void EDBM_stats_update(BMEditMesh *em) { BMIter iter; BMHeader *ele; const char itypes[3] = {BM_VERTS_OF_MESH, BM_EDGES_OF_MESH, BM_FACES_OF_MESH}; int *tots[3]; int i; tots[0] = &em->bm->totvertsel; tots[1] = &em->bm->totedgesel; tots[2] = &em->bm->totfacesel; em->bm->totvertsel = em->bm->totedgesel = em->bm->totfacesel = 0; for (i=0; i<3; i++) { ele = BMIter_New(&iter, em->bm, itypes[i], NULL); for ( ; ele; ele=BMIter_Step(&iter)) { if (BM_TestHFlag(ele, BM_SELECT)) { (*tots[i])++; } } } } int EDBM_InitOpf(BMEditMesh *em, BMOperator *bmop, wmOperator *op, const char *fmt, ...) { BMesh *bm = em->bm; va_list list; va_start(list, fmt); if (!BMO_VInitOpf(bm, bmop, fmt, list)) { BKE_report(op->reports, RPT_ERROR, "Parse error in EDBM_CallOpf"); va_end(list); return 0; } if (!em->emcopy) em->emcopy = BMEdit_Copy(em); em->emcopyusers++; va_end(list); return 1; } /*returns 0 on error, 1 on success. executes and finishes a bmesh operator*/ int EDBM_FinishOp(BMEditMesh *em, BMOperator *bmop, wmOperator *op, int report) { const char *errmsg; BMO_Finish_Op(em->bm, bmop); if (BMO_GetError(em->bm, &errmsg, NULL)) { BMEditMesh *emcopy = em->emcopy; if (report) BKE_report(op->reports, RPT_ERROR, errmsg); BMEdit_Free(em); *em = *emcopy; BMEdit_RecalcTesselation(em); MEM_freeN(emcopy); em->emcopyusers = 0; em->emcopy = NULL; return 0; } else { em->emcopyusers--; if (em->emcopyusers < 0) { printf("warning: em->emcopyusers was less then zero.\n"); } if (em->emcopyusers <= 0) { BMEdit_Free(em->emcopy); MEM_freeN(em->emcopy); em->emcopy = NULL; } } return 1; } int EDBM_CallOpf(BMEditMesh *em, wmOperator *op, const char *fmt, ...) { BMesh *bm = em->bm; BMOperator bmop; va_list list; va_start(list, fmt); if (!BMO_VInitOpf(bm, &bmop, fmt, list)) { BKE_report(op->reports, RPT_ERROR, "Parse error in EDBM_CallOpf"); va_end(list); return 0; } if (!em->emcopy) em->emcopy = BMEdit_Copy(em); em->emcopyusers++; BMO_Exec_Op(bm, &bmop); va_end(list); return EDBM_FinishOp(em, &bmop, op, 1); } int EDBM_CallAndSelectOpf(BMEditMesh *em, wmOperator *op, const char *selectslot, const char *fmt, ...) { BMesh *bm = em->bm; BMOperator bmop; va_list list; va_start(list, fmt); if (!BMO_VInitOpf(bm, &bmop, fmt, list)) { BKE_report(op->reports, RPT_ERROR, "Parse error in EDBM_CallOpf"); va_end(list); return 0; } if (!em->emcopy) em->emcopy = BMEdit_Copy(em); em->emcopyusers++; BMO_Exec_Op(bm, &bmop); BMO_HeaderFlag_Buffer(em->bm, &bmop, selectslot, BM_SELECT, BM_ALL); va_end(list); return EDBM_FinishOp(em, &bmop, op, 1); } int EDBM_CallOpfSilent(BMEditMesh *em, const char *fmt, ...) { BMesh *bm = em->bm; BMOperator bmop; va_list list; va_start(list, fmt); if (!BMO_VInitOpf(bm, &bmop, fmt, list)) { va_end(list); return 0; } if (!em->emcopy) em->emcopy = BMEdit_Copy(em); em->emcopyusers++; BMO_Exec_Op(bm, &bmop); va_end(list); return EDBM_FinishOp(em, &bmop, NULL, 0); } void EDBM_selectmode_to_scene(bContext *C) { Scene *scene = CTX_data_scene(C); Object *obedit = CTX_data_edit_object(C); BMEditMesh *em = ((Mesh*)obedit->data)->edit_btmesh; if (!em) return; scene->toolsettings->selectmode = em->selectmode; /* Request redraw of header buttons (to show new select mode) */ WM_event_add_notifier(C, NC_SCENE|ND_TOOLSETTINGS, scene); } void EDBM_MakeEditBMesh(ToolSettings *ts, Scene *UNUSED(scene), Object *ob) { Mesh *me = ob->data; BMesh *bm; if (!me->mpoly && me->totface) { fprintf(stderr, "%s: bmesh conversion issue! may lose lots of geometry! (bmesh internal error)\n", __func__); /*BMESH_TODO need to write smarter code here*/ bm = BKE_mesh_to_bmesh(me, ob); } else { bm = BKE_mesh_to_bmesh(me, ob); } if (me->edit_btmesh) { /* this happens when switching shape keys */ BMEdit_Free(me->edit_btmesh); MEM_freeN(me->edit_btmesh); } me->edit_btmesh = BMEdit_Create(bm, TRUE); me->edit_btmesh->selectmode= me->edit_btmesh->bm->selectmode= ts->selectmode; me->edit_btmesh->me = me; me->edit_btmesh->ob = ob; } void EDBM_LoadEditBMesh(Scene *scene, Object *ob) { Mesh *me = ob->data; BMesh *bm = me->edit_btmesh->bm; BMO_CallOpf(bm, "object_load_bmesh scene=%p object=%p", scene, ob); } void EDBM_FreeEditBMesh(BMEditMesh *tm) { BMEdit_Free(tm); } void EDBM_init_index_arrays(BMEditMesh *tm, int forvert, int foredge, int forface) { EDBM_free_index_arrays(tm); if (forvert) { BMIter iter; BMVert *ele; int i=0; tm->vert_index = MEM_mallocN(sizeof(void**)*tm->bm->totvert, "tm->vert_index"); ele = BMIter_New(&iter, tm->bm, BM_VERTS_OF_MESH, NULL); for ( ; ele; ele=BMIter_Step(&iter)) { tm->vert_index[i++] = ele; } } if (foredge) { BMIter iter; BMEdge *ele; int i=0; tm->edge_index = MEM_mallocN(sizeof(void**)*tm->bm->totedge, "tm->edge_index"); ele = BMIter_New(&iter, tm->bm, BM_EDGES_OF_MESH, NULL); for ( ; ele; ele=BMIter_Step(&iter)) { tm->edge_index[i++] = ele; } } if (forface) { BMIter iter; BMFace *ele; int i=0; tm->face_index = MEM_mallocN(sizeof(void**)*tm->bm->totface, "tm->face_index"); ele = BMIter_New(&iter, tm->bm, BM_FACES_OF_MESH, NULL); for ( ; ele; ele=BMIter_Step(&iter)) { tm->face_index[i++] = ele; } } } void EDBM_free_index_arrays(BMEditMesh *tm) { if (tm->vert_index) { MEM_freeN(tm->vert_index); tm->vert_index = NULL; } if (tm->edge_index) { MEM_freeN(tm->edge_index); tm->edge_index = NULL; } if (tm->face_index) { MEM_freeN(tm->face_index); tm->face_index = NULL; } } BMVert *EDBM_get_vert_for_index(BMEditMesh *tm, int index) { return tm->vert_index && index < tm->bm->totvert ?tm->vert_index[index]:NULL; } BMEdge *EDBM_get_edge_for_index(BMEditMesh *tm, int index) { return tm->edge_index && index < tm->bm->totedge ?tm->edge_index[index]:NULL; } BMFace *EDBM_get_face_for_index(BMEditMesh *tm, int index) { return (tm->face_index && indexbm->totface && index>=0) ? tm->face_index[index] : NULL; } void EDBM_select_flush(BMEditMesh *em, int selectmode) { em->bm->selectmode = selectmode; BM_SelectMode_Flush(em->bm); em->bm->selectmode = em->selectmode; } /*BMESH_TODO*/ void EDBM_deselect_flush(BMEditMesh *UNUSED(em)) { } void EDBM_selectmode_flush(BMEditMesh *em) { em->bm->selectmode = em->selectmode; BM_SelectMode_Flush(em->bm); } /*EDBM_select_[more/less] are api functions, I think the uv editor uses them? though the select more/less ops themselves do not.*/ static void EDBM_select_more(BMEditMesh *em) { BMOperator bmop; int usefaces = em->selectmode > SCE_SELECT_EDGE; BMO_InitOpf(em->bm, &bmop, "regionextend geom=%hvef constrict=%d usefaces=%d", BM_SELECT, 0, usefaces); BMO_Exec_Op(em->bm, &bmop); BMO_HeaderFlag_Buffer(em->bm, &bmop, "geomout", BM_SELECT, BM_ALL); BMO_Finish_Op(em->bm, &bmop); EDBM_selectmode_flush(em); } static void EDBM_select_less(BMEditMesh *em) { BMOperator bmop; int usefaces = em->selectmode > SCE_SELECT_EDGE; BMO_InitOpf(em->bm, &bmop, "regionextend geom=%hvef constrict=%d usefaces=%d", BM_SELECT, 0, usefaces); BMO_Exec_Op(em->bm, &bmop); BMO_HeaderFlag_Buffer(em->bm, &bmop, "geomout", BM_SELECT, BM_ALL); BMO_Finish_Op(em->bm, &bmop); EDBM_selectmode_flush(em); } int EDBM_get_actSelection(BMEditMesh *em, BMEditSelection *ese) { BMEditSelection *ese_last = em->bm->selected.last; BMFace *efa = BM_get_actFace(em->bm, 0); ese->next = ese->prev = NULL; if (ese_last) { if (ese_last->htype == BM_FACE) { /* if there is an active face, use it over the last selected face */ if (efa) { ese->data = (void *)efa; } else { ese->data = ese_last->data; } ese->htype = BM_FACE; } else { ese->data = ese_last->data; ese->htype = ese_last->htype; } } else if (efa) { /* no */ ese->data= (void *)efa; ese->htype= BM_FACE; } else { ese->data = NULL; return 0; } return 1; } void EDBM_clear_flag_all(BMEditMesh *em, const char hflag) { int types[3] = {BM_VERTS_OF_MESH, BM_EDGES_OF_MESH, BM_FACES_OF_MESH}; BMIter iter; BMHeader *ele; int i; if (hflag & BM_SELECT) BM_clear_selection_history(em->bm); for (i=0; i<3; i++) { BM_ITER(ele, &iter, em->bm, types[i], NULL) { if (hflag & BM_SELECT) BM_Select(em->bm, ele, FALSE); BM_ClearHFlag(ele, hflag); } } } void EDBM_set_flag_all(BMEditMesh *em, const char hflag) { const char itypes[3] = {BM_VERTS_OF_MESH, BM_EDGES_OF_MESH, BM_FACES_OF_MESH}; BMIter iter; BMHeader *ele; int i; for (i=0; i<3; i++) { ele= BMIter_New(&iter, em->bm, itypes[i], NULL); for ( ; ele; ele=BMIter_Step(&iter)) { if (hflag & BM_SELECT) { BM_Select(em->bm, ele, TRUE); } else { BM_SetHFlag(ele, hflag); } } } } /**************-------------- Undo ------------*****************/ /* for callbacks */ static void *getEditMesh(bContext *C) { Object *obedit= CTX_data_edit_object(C); if(obedit && obedit->type==OB_MESH) { Mesh *me= obedit->data; return me->edit_btmesh; } return NULL; } typedef struct undomesh { Mesh me; int selectmode; char obname[64]; } undomesh; /*undo simply makes copies of a bmesh*/ static void *editbtMesh_to_undoMesh(void *emv, void *obdata) { BMEditMesh *em = emv; Mesh *obme = obdata; undomesh *me = MEM_callocN(sizeof(undomesh), "undo Mesh"); strcpy(me->obname, em->bm->ob->id.name+2); /*make sure shape keys work*/ me->me.key = obme->key ? copy_key_nolib(obme->key) : NULL; #ifdef BMESH_EM_UNDO_RECALC_TESSFACE_WORKAROUND /*we recalc the tesselation here, to avoid seeding calls to BMEdit_RecalcTesselation throughout the code.*/ BMEdit_RecalcTesselation(em); #endif BMO_CallOpf(em->bm, "bmesh_to_mesh mesh=%p notesselation=%i", me, 1); me->selectmode = em->selectmode; return me; } static void undoMesh_to_editbtMesh(void *umv, void *emv, void *UNUSED(obdata)) { BMEditMesh *em = emv, *em2; Object *ob; undomesh *me = umv; BMesh *bm; int allocsize[4] = {512, 512, 2048, 512}; ob = (Object*)find_id("OB", me->obname); ob->shapenr = em->bm->shapenr; BMEdit_Free(em); bm = BM_Make_Mesh(ob, allocsize); BMO_CallOpf(bm, "mesh_to_bmesh mesh=%p object=%p set_shapekey=%i", me, ob, 0); em2 = BMEdit_Create(bm, TRUE); *em = *em2; em->selectmode = me->selectmode; MEM_freeN(em2); } static void free_undo(void *umv) { if (((Mesh*)umv)->key) { free_key(((Mesh*)umv)->key); MEM_freeN(((Mesh*)umv)->key); } free_mesh(umv, 0); MEM_freeN(umv); } /* and this is all the undo system needs to know */ void undo_push_mesh(bContext *C, const char *name) { undo_editmode_push(C, name, getEditMesh, free_undo, undoMesh_to_editbtMesh, editbtMesh_to_undoMesh, NULL); } /*write comment here*/ UvVertMap *EDBM_make_uv_vert_map(BMEditMesh *em, int selected, int do_face_idx_array, float *limit) { BMVert *ev; BMFace *efa; BMLoop *l; BMIter iter, liter; /* vars from original func */ UvVertMap *vmap; UvMapVert *buf; /* MTexPoly *tf; */ /* UNUSED */ MLoopUV *luv; unsigned int a; int totverts, i, totuv; if (do_face_idx_array) EDBM_init_index_arrays(em, 0, 0, 1); BM_ElemIndex_Ensure(em->bm, BM_VERT); totverts= em->bm->totvert; totuv = 0; /* generate UvMapVert array */ BM_ITER(efa, &iter, em->bm, BM_FACES_OF_MESH, NULL) { if(!selected || ((!BM_TestHFlag(efa, BM_HIDDEN)) && BM_TestHFlag(efa, BM_SELECT))) totuv += efa->len; } if(totuv==0) { if (do_face_idx_array) EDBM_free_index_arrays(em); return NULL; } vmap= (UvVertMap*)MEM_callocN(sizeof(*vmap), "UvVertMap"); if (!vmap) { if (do_face_idx_array) EDBM_free_index_arrays(em); return NULL; } vmap->vert= (UvMapVert**)MEM_callocN(sizeof(*vmap->vert)*totverts, "UvMapVert*"); buf= vmap->buf= (UvMapVert*)MEM_callocN(sizeof(*vmap->buf)*totuv, "UvMapVert"); if (!vmap->vert || !vmap->buf) { free_uv_vert_map(vmap); if (do_face_idx_array) EDBM_free_index_arrays(em); return NULL; } a = 0; BM_ITER(efa, &iter, em->bm, BM_FACES_OF_MESH, NULL) { if(!selected || ((!BM_TestHFlag(efa, BM_HIDDEN)) && BM_TestHFlag(efa, BM_SELECT))) { i = 0; BM_ITER(l, &liter, em->bm, BM_LOOPS_OF_FACE, efa) { buf->tfindex= i; buf->f= a; buf->separate = 0; buf->next= vmap->vert[BM_GetIndex(l->v)]; vmap->vert[BM_GetIndex(l->v)]= buf; buf++; i++; } } a++; } /* sort individual uvs for each vert */ a = 0; BM_ITER(ev, &iter, em->bm, BM_VERTS_OF_MESH, NULL) { UvMapVert *newvlist= NULL, *vlist=vmap->vert[a]; UvMapVert *iterv, *v, *lastv, *next; float *uv, *uv2, uvdiff[2]; while(vlist) { v= vlist; vlist= vlist->next; v->next= newvlist; newvlist= v; efa = EDBM_get_face_for_index(em, v->f); /* tf = CustomData_bmesh_get(&em->bm->pdata, efa->head.data, CD_MTEXPOLY); */ /* UNUSED */ l = BMIter_AtIndex(em->bm, BM_LOOPS_OF_FACE, efa, v->tfindex); luv = CustomData_bmesh_get(&em->bm->ldata, l->head.data, CD_MLOOPUV); uv = luv->uv; lastv= NULL; iterv= vlist; while(iterv) { next= iterv->next; efa = EDBM_get_face_for_index(em, iterv->f); /* tf = CustomData_bmesh_get(&em->bm->pdata, efa->head.data, CD_MTEXPOLY); */ /* UNUSED */ l = BMIter_AtIndex(em->bm, BM_LOOPS_OF_FACE, efa, iterv->tfindex); luv = CustomData_bmesh_get(&em->bm->ldata, l->head.data, CD_MLOOPUV); uv2 = luv->uv; sub_v2_v2v2(uvdiff, uv2, uv); if(fabs(uv[0]-uv2[0]) < limit[0] && fabs(uv[1]-uv2[1]) < limit[1]) { if(lastv) lastv->next= next; else vlist= next; iterv->next= newvlist; newvlist= iterv; } else lastv=iterv; iterv= next; } newvlist->separate = 1; } vmap->vert[a]= newvlist; a++; } if (do_face_idx_array) EDBM_free_index_arrays(em); return vmap; } UvMapVert *EDBM_get_uv_map_vert(UvVertMap *vmap, unsigned int v) { return vmap->vert[v]; } /* from editmesh_lib.c in trunk */ #if 0 /* BMESH_TODO */ /* A specialized vert map used by stitch operator */ UvElementMap *EDBM_make_uv_element_map(EditMesh *em, int selected, int do_islands) { EditVert *ev; EditFace *efa; /* vars from original func */ UvElementMap *vmap; UvElement *buf; UvElement *islandbuf; MTFace *tf; unsigned int a; int i,j, totuv, nverts, nislands = 0, islandbufsize = 0; unsigned int *map; /* for uv island creation */ EditFace **stack; int stacksize = 0; /* we need the vert */ for(ev = em->verts.first, i = 0; ev; ev = ev->next, i++) ev->tmp.l = i; totuv = 0; for(efa = em->faces.first; efa; efa = efa->next) if(!selected || ((!efa->h) && (efa->f & SELECT))) totuv += (efa->v4)? 4: 3; if(totuv == 0) return NULL; vmap = (UvElementMap *)MEM_callocN(sizeof(*vmap), "UvVertElementMap"); if(!vmap) return NULL; vmap->vert = (UvElement**)MEM_callocN(sizeof(*vmap->vert)*em->totvert, "UvElementVerts"); buf = vmap->buf = (UvElement*)MEM_callocN(sizeof(*vmap->buf)*totuv, "UvElement"); if(!vmap->vert || !vmap->buf) { EDBM_free_uv_element_map(vmap); return NULL; } vmap->totalUVs = totuv; for(efa = em->faces.first; efa; a++, efa = efa->next) { if(!selected || ((!efa->h) && (efa->f & SELECT))) { nverts = (efa->v4)? 4: 3; for(i = 0; itfindex = i; buf->face = efa; buf->separate = 0; buf->island = INVALID_ISLAND; buf->next = vmap->vert[(*(&efa->v1 + i))->tmp.l]; vmap->vert[(*(&efa->v1 + i))->tmp.l] = buf; buf++; } } efa->tmp.l = INVALID_ISLAND; } /* sort individual uvs for each vert */ for(a = 0, ev = em->verts.first; ev; a++, ev = ev->next) { UvElement *newvlist = NULL, *vlist = vmap->vert[a]; UvElement *iterv, *v, *lastv, *next; float *uv, *uv2; while(vlist) { v= vlist; vlist= vlist->next; v->next= newvlist; newvlist= v; efa = v->face; tf = CustomData_em_get(&em->fdata, efa->data, CD_MTFACE); uv = tf->uv[v->tfindex]; lastv= NULL; iterv= vlist; while(iterv) { next= iterv->next; efa = iterv->face; tf = CustomData_em_get(&em->fdata, efa->data, CD_MTFACE); uv2 = tf->uv[iterv->tfindex]; if(fabsf(uv[0]-uv2[0]) < STD_UV_CONNECT_LIMIT && fabsf(uv[1]-uv2[1]) < STD_UV_CONNECT_LIMIT) { if(lastv) lastv->next = next; else vlist = next; iterv->next = newvlist; newvlist = iterv; } else lastv = iterv; iterv = next; } newvlist->separate = 1; } vmap->vert[a] = newvlist; } if(do_islands) { /* at this point, every UvElement in vert points to a UvElement sharing the same vertex. Now we should sort uv's in islands. */ /* map holds the map from current vmap->buf to the new, sorted map*/ map = MEM_mallocN(sizeof(*map)*totuv, "uvelement_remap"); stack = MEM_mallocN(sizeof(*stack)*em->totface, "uv_island_face_stack"); islandbuf = MEM_callocN(sizeof(*islandbuf)*totuv, "uvelement_island_buffer"); for(i = 0; i < totuv; i++) { if(vmap->buf[i].island == INVALID_ISLAND) { vmap->buf[i].island = nislands; stack[0] = vmap->buf[i].face; stack[0]->tmp.l = nislands; stacksize=1; while(stacksize > 0) { efa = stack[--stacksize]; nverts = efa->v4? 4 : 3; for(j = 0; j < nverts; j++) { UvElement *element, *initelement = vmap->vert[(*(&efa->v1 + j))->tmp.l]; for(element = initelement; element; element = element->next) { if(element->separate) initelement = element; if(element->face == efa) { /* found the uv corresponding to our face and vertex. Now fill it to the buffer */ element->island = nislands; map[element - vmap->buf] = islandbufsize; islandbuf[islandbufsize].tfindex = element->tfindex; islandbuf[islandbufsize].face = element->face; islandbuf[islandbufsize].separate = element->separate; islandbuf[islandbufsize].island = nislands; islandbufsize++; for(element = initelement; element; element = element->next) { if(element->separate && element != initelement) break; if(element->face->tmp.l == INVALID_ISLAND) { stack[stacksize++] = element->face; element->face->tmp.l = nislands; } } break; } } } } nislands++; } } /* remap */ for(i = 0; i < em->totvert; i++) { /* important since we may do selection only. Some of these may be NULL */ if(vmap->vert[i]) vmap->vert[i] = &islandbuf[map[vmap->vert[i] - vmap->buf]]; } vmap->islandIndices = MEM_callocN(sizeof(*vmap->islandIndices)*nislands,"UvVertMap2_island_indices"); if(!vmap->islandIndices) { MEM_freeN(islandbuf); MEM_freeN(stack); MEM_freeN(map); EDBM_free_uv_element_map(vmap); } j = 0; for(i = 0; i < totuv; i++) { UvElement *element = vmap->buf[i].next; if(element == NULL) islandbuf[map[i]].next = NULL; else islandbuf[map[i]].next = &islandbuf[map[element - vmap->buf]]; if(islandbuf[i].island != j) { j++; vmap->islandIndices[j] = i; } } MEM_freeN(vmap->buf); vmap->buf = islandbuf; vmap->totalIslands = nislands; MEM_freeN(stack); MEM_freeN(map); } return vmap; } #else UvElementMap *EDBM_make_uv_element_map(BMEditMesh *em, int selected, int do_islands) { (void)em; (void)selected; (void)do_islands; return NULL; } #endif /* BMESH_TODO */ UvMapVert *EM_get_uv_map_vert(UvVertMap *vmap, unsigned int v) { return vmap->vert[v]; } void EDBM_free_uv_vert_map(UvVertMap *vmap) { if (vmap) { if (vmap->vert) MEM_freeN(vmap->vert); if (vmap->buf) MEM_freeN(vmap->buf); MEM_freeN(vmap); } } void EDBM_free_uv_element_map(UvElementMap *vmap) { if (vmap) { if (vmap->vert) MEM_freeN(vmap->vert); if (vmap->buf) MEM_freeN(vmap->buf); if (vmap->islandIndices) MEM_freeN(vmap->islandIndices); MEM_freeN(vmap); } } /* last_sel, use em->act_face otherwise get the last selected face in the editselections * at the moment, last_sel is mainly useful for gaking sure the space image dosnt flicker */ MTexPoly *EDBM_get_active_mtexpoly(BMEditMesh *em, BMFace **act_efa, int sloppy) { BMFace *efa = NULL; if(!EDBM_texFaceCheck(em)) return NULL; efa = BM_get_actFace(em->bm, sloppy); if (efa) { if (act_efa) *act_efa = efa; return CustomData_bmesh_get(&em->bm->pdata, efa->head.data, CD_MTEXPOLY); } if (act_efa) *act_efa= NULL; return NULL; } /* can we edit UV's for this mesh?*/ int EDBM_texFaceCheck(BMEditMesh *em) { /* some of these checks could be a touch overkill */ return em && em->bm->totface && CustomData_has_layer(&em->bm->pdata, CD_MTEXPOLY) && CustomData_has_layer(&em->bm->ldata, CD_MLOOPUV); } int EDBM_vertColorCheck(BMEditMesh *em) { /* some of these checks could be a touch overkill */ return em && em->bm->totface && CustomData_has_layer(&em->bm->ldata, CD_MLOOPCOL); } static BMVert *cache_mirr_intptr_as_bmvert(intptr_t *index_lookup, int index) { intptr_t eve_i= index_lookup[index]; return (eve_i == -1) ? NULL : (BMVert *)eve_i; } /* BM_SEARCH_MAXDIST is too big, copied from 2.6x MOC_THRESH, should become a * preference */ #define BM_SEARCH_MAXDIST_MIRR 0.00002f #define BM_CD_LAYER_ID "__mirror_index" void EDBM_CacheMirrorVerts(BMEditMesh *em, const short use_select) { Mesh *me = em->me; BMesh *bm = em->bm; BMIter iter; BMVert *v; int li, topo = 0; /* one or the other is used depending if topo is enabled */ BMBVHTree *tree= NULL; MirrTopoStore_t mesh_topo_store= {NULL, -1, -1, -1}; if (me && (me->editflag & ME_EDIT_MIRROR_TOPO)) { topo = 1; } if (!em->vert_index) { EDBM_init_index_arrays(em, 1, 0, 0); em->mirr_free_arrays = 1; } if (!CustomData_get_layer_named(&bm->vdata, CD_PROP_INT, BM_CD_LAYER_ID)) { BM_add_data_layer_named(bm, &bm->vdata, CD_PROP_INT, BM_CD_LAYER_ID); } li= CustomData_get_named_layer_index(&bm->vdata, CD_PROP_INT, BM_CD_LAYER_ID); bm->vdata.layers[li].flag |= CD_FLAG_TEMPORARY; BM_ElemIndex_Ensure(bm, BM_VERT); if (topo) { ED_mesh_mirrtopo_init(me, -1, &mesh_topo_store, TRUE); } else { tree= BMBVH_NewBVH(em, 0, NULL, NULL); } BM_ITER(v, &iter, bm, BM_VERTS_OF_MESH, NULL) { /* temporary for testing, check for selection */ if (use_select && !BM_TestHFlag(v, BM_SELECT)) { /* do nothing */ } else { BMVert *mirr; int *idx = CustomData_bmesh_get_layer_n(&bm->vdata, v->head.data, li); if (topo) { mirr= cache_mirr_intptr_as_bmvert(mesh_topo_store.index_lookup, BM_GetIndex(v)); } else { float co[3] = {-v->co[0], v->co[1], v->co[2]}; mirr= BMBVH_FindClosestVert(tree, co, BM_SEARCH_MAXDIST_MIRR); } if (mirr && mirr != v) { *idx = BM_GetIndex(mirr); idx = CustomData_bmesh_get_layer_n(&bm->vdata, mirr->head.data, li); *idx = BM_GetIndex(v); } else { *idx = -1; } } } if (topo) { ED_mesh_mirrtopo_free(&mesh_topo_store); } else { BMBVH_FreeBVH(tree); } em->mirror_cdlayer= li; } BMVert *EDBM_GetMirrorVert(BMEditMesh *em, BMVert *v) { int *mirr = CustomData_bmesh_get_layer_n(&em->bm->vdata, v->head.data, em->mirror_cdlayer); BLI_assert(em->mirror_cdlayer != -1); /* invalid use */ if (mirr && *mirr >=0 && *mirr < em->bm->totvert) { if (!em->vert_index) { printf("err: should only be called between " "EDBM_CacheMirrorVerts and EDBM_EndMirrorCache"); return NULL; } return em->vert_index[*mirr]; } return NULL; } void EDBM_ClearMirrorVert(BMEditMesh *em, BMVert *v) { int *mirr = CustomData_bmesh_get_layer_n(&em->bm->vdata, v->head.data, em->mirror_cdlayer); BLI_assert(em->mirror_cdlayer != -1); /* invalid use */ if (mirr) { *mirr= -1; } } void EDBM_EndMirrorCache(BMEditMesh *em) { if (em->mirr_free_arrays) { MEM_freeN(em->vert_index); em->vert_index = NULL; } em->mirror_cdlayer= -1; } void EDBM_ApplyMirrorCache(BMEditMesh *em, const int sel_from, const int sel_to) { BMIter iter; BMVert *v; BLI_assert(em->vert_index != NULL); BM_ITER(v, &iter, em->bm, BM_VERTS_OF_MESH, NULL) { if (BM_TestHFlag(v, BM_SELECT) == sel_from) { BMVert *mirr= EDBM_GetMirrorVert(em, v); if (mirr) { if (BM_TestHFlag(mirr, BM_SELECT) == sel_to) { copy_v3_v3(mirr->co, v->co); mirr->co[0] *= -1.0f; } } } } }