diff options
| author | Sergey Sharybin <sergey.vfx@gmail.com> | 2019-10-02 13:49:18 +0300 |
|---|---|---|
| committer | Sergey Sharybin <sergey.vfx@gmail.com> | 2019-10-03 13:36:01 +0300 |
| commit | 9a4042bed80737a80a8fc6b75372e532f8fb05c7 (patch) | |
| tree | 3ed78bbc9bd139f205ef7e5fa17f3c4f4bd3bd3c /source/blender/blenkernel/BKE_subdiv_ccg.h | |
| parent | 0cc45eaac4b9a285e1d1eea12adb355c661f2da7 (diff) | |
Subdiv CCG: Cleanup, remove unused data from adjacency storage
Makes it easier to initialze adjacency, avoid extra re-allocations during
initialization, reduces memory footprint.
Diffstat (limited to 'source/blender/blenkernel/BKE_subdiv_ccg.h')
| -rw-r--r-- | source/blender/blenkernel/BKE_subdiv_ccg.h | 4 |
1 files changed, 0 insertions, 4 deletions
diff --git a/source/blender/blenkernel/BKE_subdiv_ccg.h b/source/blender/blenkernel/BKE_subdiv_ccg.h index e235193a486..9b7c613aa94 100644 --- a/source/blender/blenkernel/BKE_subdiv_ccg.h +++ b/source/blender/blenkernel/BKE_subdiv_ccg.h @@ -106,8 +106,6 @@ typedef struct SubdivCCGFace { /* Definition of an edge which is adjacent to at least one of the faces. */ typedef struct SubdivCCGAdjacentEdge { int num_adjacent_faces; - /* Indexed by adjacent face index. */ - SubdivCCGFace **faces; /* Indexed by adjacent face index, then by point index on the edge. * points to a grid element. */ struct CCGElem ***boundary_elements; @@ -116,8 +114,6 @@ typedef struct SubdivCCGAdjacentEdge { /* Definition of a vertex which is adjacent to at least one of the faces. */ typedef struct SubdivCCGAdjacentVertex { int num_adjacent_faces; - /* Indexed by adjacent face index. */ - SubdivCCGFace **faces; /* Indexed by adjacent face index, points to a grid element. */ struct CCGElem **corner_elements; } SubdivCCGAdjacentVertex; |