lili/opennurbs
1
0
Fork 0
mirror of https://github.com/mcneel/opennurbs.git synced 2026-03-02 12:29:28 +08:00
Code Issues Packages Projects Releases Wiki Activity
Files
01cdb463e645a2f0829dd87bb1fe29b5bb5bc306
opennurbs/opennurbs_subd_heap.cpp
Bozo The Builder 01cdb463e6 Sync changes from upstream repository 
Co-authored-by: Andrew Le Bihan <andy@mcneel.com>
Co-authored-by: chuck <chuck@mcneel.com>
Co-authored-by: Dale Fugier <dale@mcneel.com>
Co-authored-by: Dale Lear <dalelear@mcneel.com>
Co-authored-by: David Eränen <david.eranen@mcneel.com>
Co-authored-by: Greg Arden <greg@mcneel.com>
Co-authored-by: John Croudy <john.croudy@mcneel.com>
Co-authored-by: Lowell Walmsley <lowell@mcneel.com>
Co-authored-by: Nathan Letwory <nathan@mcneel.com>
Co-authored-by: piac <giulio@mcneel.com>
Co-authored-by: Steve Baer <steve@mcneel.com>
Co-authored-by: Tim Hemmelman <tim@mcneel.com>
2020-03-12 09:00:26 -07:00

1971 lines
56 KiB
C++
Raw Blame History

#include "opennurbs.h"
#if !defined(ON_COMPILING_OPENNURBS)
// This check is included in all opennurbs source .c and .cpp files to insure
// ON_COMPILING_OPENNURBS is defined when opennurbs source is compiled.
// When opennurbs source is being compiled, ON_COMPILING_OPENNURBS is defined
// and the opennurbs .h files alter what is declared and how it is declared.
#error ON_COMPILING_OPENNURBS must be defined when compiling opennurbs
#endif
#include "opennurbs_subd_data.h"
/* $NoKeywords: $ */
/*
//
// Copyright (c) 1993-2014 Robert McNeel & Associates. All rights reserved.
// OpenNURBS, Rhinoceros, and Rhino3D are registered trademarks of Robert
// McNeel & Associates.
//
// THIS SOFTWARE IS PROVIDED "AS IS" WITHOUT EXPRESS OR IMPLIED WARRANTY.
// ALL IMPLIED WARRANTIES OF FITNESS FOR ANY PARTICULAR PURPOSE AND OF
// MERCHANTABILITY ARE HEREBY DISCLAIMED.
//
// For complete openNURBS copyright information see <http://www.opennurbs.org>.
//
////////////////////////////////////////////////////////////////
*/
static void* ON_SubD__Allocate(size_t sz)
{
if (0 == sz)
return nullptr;
// double array allocation is used to insure the memory
// returned by new is properly aligned for any type.
double* a;
size_t sz1 = sz % sizeof(a[0]);
if (sz1 > 0)
sz += (sizeof(a[0]) - sz1);
a = new(std::nothrow) double[sz];
if (nullptr == a)
return ON_SUBD_RETURN_ERROR(nullptr);
return a;
}
static void ON_SubD__Free(void* p)
{
if (nullptr != p)
{
double* a = (double*)p;
delete[] a;
}
}
//////////////////////////////////////////////////////////////////////////
//
// ON_SubD_FixedSizeHeap
//
unsigned int ON_SubD_FixedSizeHeap::m__sn_factory = 0;
ON_SubD_FixedSizeHeap::~ON_SubD_FixedSizeHeap()
{
Destroy();
}
void ON_SubD_FixedSizeHeap::Destroy()
{
Reset();
m_v_capacity = 0;
m_e_capacity = 0;
m_f_capacity = 0;
m_p_capacity = 0;
m_h_capacity = 0;
m_h_count = 0;
void* p[6] = { m_v, m_e, m_f, m_p, m_hash_table, m_hash_elements };
m_v = nullptr;
m_e = nullptr;
m_f = nullptr;
m_p = nullptr;
m_hash_table = nullptr;
m_hash_elements = nullptr;
ON_SubD__Free(p[0]);
ON_SubD__Free(p[1]);
ON_SubD__Free(p[2]);
ON_SubD__Free(p[3]);
ON_SubD__Free(p[4]);
ON_SubD__Free(p[5]);
}
void ON_SubD_FixedSizeHeap::Reset()
{
if (m_h_capacity > 0)
memset(m_hash_table, 0, m_h_capacity * sizeof(*m_hash_table));
m_v_index = 0;
m_e_index = 0;
m_f_index = 0;
m_p_index = 0;
m_h_count = 0;
}
bool ON_SubD_FixedSizeHeap::InUse() const
{
return (m_v_index > 0 || m_e_index > 0 || m_f_index>0 || m_p_index>0);
}
class ON_SubD_FixedSizeHeap_ComponentPairHashElement
{
public:
//static const ON_SubD_FixedSizeHeap_ComponentPairHashElement Empty;
ON_SubDComponentPtrPair m_pair;
ON_SubD_FixedSizeHeap_ComponentPairHashElement* m_next;
};
bool ON_SubD_FixedSizeHeap::Internal_ReserveSubDWorkspace_HashTable()
{
const unsigned int hash_capacity = (m_v_capacity > 0) ? (m_v_capacity / 4 + 1) : 0;
m_h_count = 0;
if (hash_capacity > m_h_capacity)
{
m_h_capacity = 0;
if (nullptr != m_hash_elements)
{
ON_SubD__Free(m_hash_elements);
m_hash_elements = nullptr;
}
if (nullptr != m_hash_table)
{
ON_SubD__Free(m_hash_table);
m_hash_table = nullptr;
}
m_hash_table = (ON_SubD_FixedSizeHeap_ComponentPairHashElement**)ON_SubD__Allocate(hash_capacity * sizeof(*m_hash_table));
if (nullptr == m_hash_table)
return false;
m_hash_elements = (ON_SubD_FixedSizeHeap_ComponentPairHashElement*)ON_SubD__Allocate(m_v_capacity * sizeof(*m_hash_elements));
if (nullptr == m_hash_elements)
{
ON_SubD__Free(m_hash_table);
m_hash_table = nullptr;
return false;
}
m_h_capacity = hash_capacity;
}
if ( m_h_capacity > 0 && nullptr != m_hash_table)
memset(m_hash_table, 0, m_h_capacity * sizeof(*m_hash_table));
return true;
}
bool ON_SubD_FixedSizeHeap::Internal_ReserveSubDWorkspace(
size_t vertex_capacity,
size_t face_capacity,
size_t array_capacity,
bool bEnableHash
)
{
if ( vertex_capacity <= 0 || face_capacity <= 0 || array_capacity <= 0)
{
Destroy();
return ON_SUBD_RETURN_ERROR(false);
}
const size_t edge_capacity = vertex_capacity + face_capacity - 1; // Euler formula
if (m_v_capacity >= vertex_capacity
&& m_e_capacity >= edge_capacity
&& m_f_capacity >= face_capacity
&& m_p_capacity >= array_capacity
)
{
Reset();
if (bEnableHash)
Internal_ReserveSubDWorkspace_HashTable();
else
m_h_count = ON_SubD_FixedSizeHeap::DisabledHashCount;
return true;
}
Destroy();
size_t max_capacity = 0xFFFFFFU;
if (vertex_capacity > max_capacity || edge_capacity > max_capacity || face_capacity > max_capacity || array_capacity > max_capacity)
return ON_SUBD_RETURN_ERROR(false);
for (;;)
{
m_v = (ON_SubDVertex*)ON_SubD__Allocate(vertex_capacity*sizeof(m_v[0]));
if (nullptr == m_v && vertex_capacity > 0)
break;
m_e = (ON_SubDEdge*)ON_SubD__Allocate(edge_capacity*sizeof(m_e[0]));
if (nullptr == m_e && edge_capacity > 0)
break;
m_f = (ON_SubDFace*)ON_SubD__Allocate(face_capacity*sizeof(m_f[0]));
if (nullptr == m_f && face_capacity > 0)
break;
m_p = (ON__UINT_PTR*)ON_SubD__Allocate(array_capacity*sizeof(m_p[0]));
if (nullptr == m_p && array_capacity > 0)
break;
m_v_capacity = (unsigned int)vertex_capacity;
m_e_capacity = (unsigned int)edge_capacity;
m_f_capacity = (unsigned int)face_capacity;
m_p_capacity = (unsigned int)array_capacity;
if (bEnableHash)
Internal_ReserveSubDWorkspace_HashTable();
else
m_h_count = ON_SubD_FixedSizeHeap::DisabledHashCount;
return true;
}
Destroy();
return ON_SUBD_RETURN_ERROR(false);
}
bool ON_SubD_FixedSizeHeap::ReserveSubDWorkspace(
unsigned int sector_edge_count
)
{
if (0 == sector_edge_count)
{
Destroy();
return true;
}
const unsigned int k = (sector_edge_count <= 4) ? 0 : (sector_edge_count - 4);
const unsigned int v_capacity = 16 + 2 * k;
const unsigned int f_capacity = 9 + k;
const unsigned int p_capacity = 8*v_capacity + 2 * k;
return Internal_ReserveSubDWorkspace(v_capacity, f_capacity, p_capacity, false);
}
static unsigned int Internal_AtLeast4(unsigned int n)
{
return (n > 4U) ? n : 4U;
}
bool ON_SubD_FixedSizeHeap::ReserveSubDWorkspace(
const ON_SubDFace* center_face0
)
{
unsigned int v_capacity = 0;
unsigned int f_capacity = 0;
unsigned int a_capacity = 0;
for (;;)
{
if (nullptr == center_face0)
break;
const unsigned int N = center_face0->m_edge_count;
if (N <= 2)
break;
unsigned int S = 0; // Set S = sum of the number of edges attached to each vertex of center_face0.
unsigned int T = Internal_AtLeast4(N); // Set T = capacity required for vertex edge arrays on face subdivision vertices
unsigned int X = 0;
bool bValenceTwoVertices = false; // bValenceTwoVertices = true if center_face0 has a valence 2 vertex and we need the hash table
{
const ON_SubDEdgePtr* edges = center_face0->m_edge4;
ON__UINT_PTR edge_ptr;
const ON_SubDEdge* edge;
const ON_SubDVertex* vertex;
const ON_SubDFace* vertex_face;
unsigned int fei;
edge = center_face0->Edge(N - 1);
if (nullptr == edge)
break;
bool bEdgeIsHardCrease[2] = { false, edge->IsHardCrease() };
for (fei = 0; fei < N; fei++, edges++)
{
if (4 == fei)
{
edges = center_face0->m_edgex;
if (nullptr == edges)
break;
}
edge_ptr = edges->m_ptr;
edge = ON_SUBD_EDGE_POINTER(edge_ptr);
if (nullptr == edge)
break;
bEdgeIsHardCrease[0] = bEdgeIsHardCrease[1];
bEdgeIsHardCrease[1] = edge->IsHardCrease();
vertex = edge->m_vertex[ON_SUBD_EDGE_DIRECTION(edge_ptr)];
if (nullptr == vertex)
break;
if (vertex->m_edge_count < 2)
break;
if (vertex->m_edge_count < vertex->m_face_count)
break;
S += vertex->m_edge_count;
X += Internal_AtLeast4(vertex->m_edge_count);
if ( bEdgeIsHardCrease[0] && bEdgeIsHardCrease[1] && vertex->IsCreaseOrCorner() )
{
// If this vertex has multiple sectors, the other sectors are isolated from center_face0 by hard creases.
continue;
}
if (2 == vertex->m_edge_count)
{
// ring face has valence 2 vertex and the subdivision point for vertex_face
// may be reference by 2 different edges from center_face0
bValenceTwoVertices = true;
}
for (unsigned short vfi = 0; vfi < vertex->m_face_count; ++vfi)
{
vertex_face = vertex->m_faces[vfi];
if (nullptr == vertex_face || center_face0 == vertex_face)
continue;
T += Internal_AtLeast4(vertex_face->m_edge_count);
}
}
if (fei != N)
break;
}
// NOTE: S >= 2*N
v_capacity = 2*(S - N) + 1; // maximum possible and occurs when all face0 edges are distinct and smooth
f_capacity = S; // maximum possible and occurs when all face0 edges are distinct and smooth
// T = capacity required for vertex edge arrays on face subdivision vertices
// 4*(S-N) = capacity required for vertex edge arrays on edge subdivision vertices
// X = capacity required for vertex edge arrays on vertex subdivision vertices
//
a_capacity = 2*( X + T + 4 * (S - N) ); // Twice the number of edges from all subdivision vertices.
return Internal_ReserveSubDWorkspace(
v_capacity,
f_capacity,
a_capacity,
(0U == center_face0->SubdivisionLevel()) || bValenceTwoVertices
);
}
Destroy();
if (nullptr == center_face0 )
return true;
return ON_SUBD_RETURN_ERROR(false);
}
bool ON_SubD_FixedSizeHeap::Internal_HashEnabled() const
{
return (ON_SubD_FixedSizeHeap::DisabledHashCount != m_h_count && m_h_capacity > 0);
}
unsigned int ON_SubD_FixedSizeHeap::Internal_Hash(ON_SubDComponentPtr component0)
{
return Internal_HashEnabled() ? (((unsigned int)component0.Hash16FromTypeAndId()) % m_h_capacity) : 0U;
}
ON_SubDVertex* ON_SubD_FixedSizeHeap::Internal_HashFindVertex1(unsigned int hash, ON_SubDComponentPtr component0)
{
if (Internal_HashEnabled())
{
for (ON_SubD_FixedSizeHeap_ComponentPairHashElement* e = m_hash_table[hash]; nullptr != e; e = e->m_next)
{
if (component0.m_ptr == e->m_pair.m_pair[0].m_ptr)
return e->m_pair.m_pair[1].Vertex();
}
}
return nullptr;
}
void ON_SubD_FixedSizeHeap::Internal_HashAddPair(unsigned int hash, ON_SubDComponentPtr component0, class ON_SubDVertex* vertex1)
{
if (Internal_HashEnabled())
{
if (vertex1->m_id == m_v_index)
{
ON_SubD_FixedSizeHeap_ComponentPairHashElement* e = &m_hash_elements[vertex1->m_id - 1];
e->m_pair.m_pair[0] = component0;
e->m_pair.m_pair[1] = ON_SubDComponentPtr::Create(vertex1);
e->m_next = m_hash_table[hash];
m_hash_table[hash] = e;
++m_h_count;
}
else
{
ON_SUBD_ERROR("unexpected has table state");
}
}
}
ON_SubDVertex* ON_SubD_FixedSizeHeap::AllocateVertex(
const double vertexP[3],
unsigned int edge_capacity
)
{
if (nullptr == m_v || m_v_index >= m_v_capacity)
return ON_SUBD_RETURN_ERROR(nullptr);
const unsigned int face_capacity = edge_capacity;
if (edge_capacity + face_capacity + m_p_index > m_p_capacity )
return ON_SUBD_RETURN_ERROR(nullptr);
ON__UINT_PTR* a = nullptr;
if (0 != edge_capacity || 0 != face_capacity)
{
if ( edge_capacity > 0xFFFFu)
return ON_SUBD_RETURN_ERROR(nullptr);
if ( face_capacity > 0xFFFFu)
return ON_SUBD_RETURN_ERROR(nullptr);
a = AllocatePtrArray(edge_capacity + face_capacity, true);
if (nullptr == a)
return ON_SUBD_RETURN_ERROR(nullptr);
}
ON_SubDVertex* v = m_v + m_v_index;
memset(v, 0, sizeof(*v));
if (m_v_index > 0)
{
// code in ON_SubDFaceNeighborhood.Subdivide() relies on
// m_next_vertex being set this way.
m_v[m_v_index - 1].m_next_vertex = v;
v->m_prev_vertex = &m_v[m_v_index - 1];
}
v->m_id = ++m_v_index;
if (nullptr != vertexP)
{
v->m_P[0] = vertexP[0];
v->m_P[1] = vertexP[1];
v->m_P[2] = vertexP[2];
}
if (edge_capacity > 0)
{
v->m_edge_capacity = (unsigned short)edge_capacity;
v->m_edges = (ON_SubDEdgePtr*)a;
a += edge_capacity;
}
if (face_capacity > 0)
{
v->m_face_capacity = (unsigned short)face_capacity;
v->m_faces = (const ON_SubDFace**)a;
}
a = 0;
return v;
}
ON_SubDVertex* ON_SubD_FixedSizeHeap::AllocateVertex(
const ON_SubDVertex* vertex0,
unsigned int edge_capacity
)
{
if ( nullptr == vertex0)
return ON_SUBD_RETURN_ERROR(nullptr);
double subdP[3];
if (false == vertex0->GetSubdivisionPoint(subdP))
return ON_SUBD_RETURN_ERROR(nullptr);
ON_SubDVertex* v1 = AllocateVertex(subdP, edge_capacity);
if (nullptr == v1)
return ON_SUBD_RETURN_ERROR(nullptr);
v1->SetSubdivisionLevel( vertex0->SubdivisionLevel() + 1 );
v1->m_vertex_tag = vertex0->m_vertex_tag;
if (vertex0->SurfacePointIsSet())
{
// copy any cached limit point from vertex0 to v1.
ON_SubDSectorSurfacePoint limit_point;
if (vertex0->GetSurfacePoint(vertex0->m_faces[0], limit_point))
{
if (nullptr == limit_point.m_sector_face)
{
limit_point.m_next_sector_limit_point = (const ON_SubDSectorSurfacePoint*)1;
v1->SetSavedSurfacePoint(true, limit_point);
}
}
}
return v1;
}
ON_SubDVertex* ON_SubD_FixedSizeHeap::AllocateEdgeSubdivisionVertex(bool bUseFindOrAllocate, const ON_SubDEdge* edge0)
{
return bUseFindOrAllocate ? FindOrAllocateVertex(edge0) : AllocateVertex(edge0);
}
ON_SubDVertex * ON_SubD_FixedSizeHeap::FindOrAllocateVertex(const ON_SubDEdge * edge0)
{
if ( nullptr == edge0)
return ON_SUBD_RETURN_ERROR(nullptr);
const ON_SubDComponentPtr component0 = ON_SubDComponentPtr::Create(edge0);
const unsigned int hash = Internal_Hash(component0);
ON_SubDVertex* v1 = Internal_HashFindVertex1(hash, component0);
if (nullptr != v1)
{
// found the previously allocated vertex
if (((unsigned int)v1->m_edge_capacity) < 4)
{
ON_SUBD_ERROR("edge capacity was too small when vertex was created.");
}
return v1;
}
v1 = AllocateVertex(edge0);
if (nullptr == v1)
return ON_SUBD_RETURN_ERROR(nullptr);
Internal_HashAddPair(hash, component0, v1);
return v1;
}
ON_SubDVertex* ON_SubD_FixedSizeHeap::AllocateVertex(
const ON_SubDEdge* edge0
)
{
if ( nullptr == edge0)
return ON_SUBD_RETURN_ERROR(nullptr);
double subdP[3];
if (false == edge0->GetSubdivisionPoint(subdP))
return ON_SUBD_RETURN_ERROR(nullptr);
const unsigned int edge_capacity = 4;
ON_SubDVertex* v1 = AllocateVertex(subdP, edge_capacity);
if (nullptr == v1)
return ON_SUBD_RETURN_ERROR(nullptr);
v1->SetSubdivisionLevel( edge0->SubdivisionLevel() + 1 );
if (ON_SubD::EdgeTag::Smooth == edge0->m_edge_tag || ON_SubD::EdgeTag::SmoothX == edge0->m_edge_tag)
v1->m_vertex_tag = ON_SubD::VertexTag::Smooth;
else if (ON_SubD::EdgeTag::Crease == edge0->m_edge_tag)
v1->m_vertex_tag = ON_SubD::VertexTag::Crease;
return v1;
}
ON_SubDVertex * ON_SubD_FixedSizeHeap::FindOrAllocateVertex(const ON_SubDFace * face0)
{
const unsigned int face0_edge_count = (nullptr != face0) ? ((unsigned int)face0->m_edge_count) : 0U;
if (face0_edge_count < 3)
return ON_SUBD_RETURN_ERROR(nullptr);
const ON_SubDComponentPtr component0 = ON_SubDComponentPtr::Create(face0);
const unsigned int hash = Internal_Hash(component0);
ON_SubDVertex* v1 = Internal_HashFindVertex1(hash, component0);
if (nullptr != v1)
{
// found the previously allocated vertex
if (((unsigned int)v1->m_edge_capacity) < face0->m_edge_count)
{
ON_SUBD_ERROR("edge capacity was too small when vertex was created.");
}
return v1;
}
double subdP[3];
if (false == face0->GetSubdivisionPoint(subdP))
return ON_SUBD_RETURN_ERROR(nullptr);
v1 = AllocateVertex(subdP, face0_edge_count );
if (nullptr == v1)
return ON_SUBD_RETURN_ERROR(nullptr);
v1->SetSubdivisionLevel( face0->SubdivisionLevel() + 1 );
v1->m_vertex_tag = ON_SubD::VertexTag::Smooth;
Internal_HashAddPair(hash, component0, v1);
return v1;
}
ON_SubDVertex * ON_SubD_FixedSizeHeap::AllocateSectorFaceVertex(const ON_SubDFace * sector_face0)
{
if (nullptr == sector_face0)
return ON_SUBD_RETURN_ERROR(nullptr);
double subdP[3];
if (false == sector_face0->GetSubdivisionPoint(subdP))
return ON_SUBD_RETURN_ERROR(nullptr);
ON_SubDVertex* v1 = AllocateVertex(subdP, 3 );
if (nullptr == v1)
return ON_SUBD_RETURN_ERROR(nullptr);
v1->SetSubdivisionLevel( sector_face0->SubdivisionLevel() + 1 );
v1->m_vertex_tag = ON_SubD::VertexTag::Smooth;
return v1;
}
const ON_SubDEdgePtr ON_SubD_FixedSizeHeap::AllocateEdge(bool bUseFindOrAllocatEdge, ON_SubDVertex* v0, double v0_sector_weight, ON_SubDVertex* v1, double v1_sector_weight)
{
return bUseFindOrAllocatEdge ? FindOrAllocateEdge( v0, v0_sector_weight, v1, v1_sector_weight) : AllocateEdge(v0, v0_sector_weight, v1, v1_sector_weight);
}
const ON_SubDEdgePtr ON_SubD_FixedSizeHeap::FindOrAllocateEdge(ON_SubDVertex * v0, double v0_sector_weight, ON_SubDVertex * v1, double v1_sector_weight)
{
if ( nullptr == v0 || nullptr == v0->m_edges)
return ON_SUBD_RETURN_ERROR(ON_SubDEdgePtr::Null);
if ( nullptr == v1 || nullptr == v1->m_edges)
return ON_SUBD_RETURN_ERROR(ON_SubDEdgePtr::Null);
for (unsigned short v0ei = 0; v0ei < v0->m_edge_count; ++v0ei)
{
const ON_SubDEdgePtr ep = v0->m_edges[v0ei];
if (v0 == ep.RelativeVertex(0))
{
if (v1 == ep.RelativeVertex(1))
return ep;
}
else if (v0 == ep.RelativeVertex(1))
{
if (v1 == ep.RelativeVertex(0))
return ep.Reversed();
}
else
{
ON_SUBD_RETURN_ERROR("Invalid ON_SubDEdgePtr in vertex->m_edge[] array");
}
}
return AllocateEdge(v0, v0_sector_weight, v1, v1_sector_weight);
}
const ON_SubDEdgePtr ON_SubD_FixedSizeHeap::AllocateEdge(
ON_SubDVertex* v0,
double v0_sector_weight,
ON_SubDVertex* v1,
double v1_sector_weight
)
{
if ( nullptr != v0 && nullptr == v0->m_edges)
return ON_SUBD_RETURN_ERROR(ON_SubDEdgePtr::Null);
if ( nullptr != v1 && nullptr == v1->m_edges)
return ON_SUBD_RETURN_ERROR(ON_SubDEdgePtr::Null);
if (nullptr == m_e || m_e_index >= m_e_capacity)
return ON_SUBD_RETURN_ERROR(ON_SubDEdgePtr::Null);
bool bTaggedVertex[2];
if (nullptr != v0)
{
if (nullptr == v0->m_edges || v0->m_edge_count >= v0->m_edge_capacity)
return ON_SUBD_RETURN_ERROR(ON_SubDEdgePtr::Null);
if (ON_SubD::VertexTag::Smooth == v0->m_vertex_tag)
{
bTaggedVertex[0] = false;
v0_sector_weight = ON_SubDSectorType::IgnoredSectorCoefficient;
}
else
{
bTaggedVertex[0] = (ON_SubD::VertexTag::Unset != v0->m_vertex_tag);
}
}
else
bTaggedVertex[0] = false;
if (nullptr != v1)
{
if (nullptr == v1->m_edges || v1->m_edge_count >= v1->m_edge_capacity)
return ON_SUBD_RETURN_ERROR(ON_SubDEdgePtr::Null);
if (ON_SubD::VertexTag::Smooth == v1->m_vertex_tag)
{
bTaggedVertex[1] = false;
v1_sector_weight = ON_SubDSectorType::IgnoredSectorCoefficient;
}
else
{
bTaggedVertex[1] = (ON_SubD::VertexTag::Unset != v0->m_vertex_tag);
if (bTaggedVertex[0] && bTaggedVertex[1])
{
// crease edge - no weights
v0_sector_weight = ON_SubDSectorType::IgnoredSectorCoefficient;
v1_sector_weight = ON_SubDSectorType::IgnoredSectorCoefficient;
}
}
}
else
bTaggedVertex[1] = false;
if ( false == ON_SubDSectorType::IsValidSectorCoefficientValue(v0_sector_weight, true))
return ON_SUBD_RETURN_ERROR(ON_SubDEdgePtr::Null);
if ( false == ON_SubDSectorType::IsValidSectorCoefficientValue(v1_sector_weight, true))
return ON_SUBD_RETURN_ERROR(ON_SubDEdgePtr::Null);
ON_SubDEdge* e = m_e + m_e_index;
memset(e, 0, sizeof(*e));
if (m_e_index > 0)
{
// code in ON_SubDFaceNeighborhood.Subdivide() relies on m_next_edge being set this way.
m_e[m_e_index - 1].m_next_edge = e;
e->m_prev_edge = &m_e[m_e_index - 1];
}
e->m_id = ++m_e_index;
if (nullptr != v0)
{
e->m_vertex[0] = v0;
v0->m_edges[v0->m_edge_count++] = ON_SubDEdgePtr::Create(e,0);
//v0->m_vertex_edge_order = ON_SubD::VertexEdgeOrder::unset;
e->SetSubdivisionLevel(v0->SubdivisionLevel());
}
if (nullptr != v1)
{
e->m_vertex[1] = v1;
v1->m_edges[v1->m_edge_count++] = ON_SubDEdgePtr::Create(e,1);
//v1->m_vertex_edge_order = ON_SubD::VertexEdgeOrder::unset;
if ( e->SubdivisionLevel() < v1->SubdivisionLevel())
e->SetSubdivisionLevel(v1->SubdivisionLevel());
}
e->m_sector_coefficient[0] = v0_sector_weight;
e->m_sector_coefficient[1] = v1_sector_weight;
e->m_edge_tag = (bTaggedVertex[0] && bTaggedVertex[1]) ? ON_SubD::EdgeTag::Crease : ON_SubD::EdgeTag::Smooth;
return ON_SubDEdgePtr::Create(e,0);
}
ON_SubDFace* ON_SubD_FixedSizeHeap::Internal_AllocateFace(
unsigned int zero_face_id,
unsigned int parent_face_id
)
{
if (nullptr == m_f || m_f_index >= m_f_capacity)
return ON_SUBD_RETURN_ERROR(nullptr);
ON_SubDFace* f = m_f + m_f_index;
memset(f, 0, sizeof(*f));
if (m_f_index > 0)
{
// code in ON_SubDFaceNeighborhood.Subdivide() relies on
// m_next_face being set this way.
m_f[m_f_index-1].m_next_face = f;
f->m_prev_face = &m_f[m_f_index-1];
}
f->m_id = ++m_f_index;
f->m_zero_face_id = (0 == zero_face_id) ? parent_face_id : zero_face_id;
f->m_parent_face_id = parent_face_id;
return f;
}
ON_SubDFace* ON_SubD_FixedSizeHeap::AllocateQuad(
unsigned int zero_face_id,
unsigned int parent_face_id,
ON_SubDEdgePtr e0,
ON_SubDEdgePtr e1,
ON_SubDEdgePtr e2,
ON_SubDEdgePtr e3
)
{
const ON_SubDEdgePtr eptrs[4] = { e0,e1,e2,e3 };
return AllocateQuad(zero_face_id, parent_face_id, eptrs);
}
ON_SubDFace* ON_SubD_FixedSizeHeap::AllocateQuad(
unsigned int zero_face_id,
unsigned int parent_face_id,
const ON_SubDEdgePtr eptrs[4]
)
{
if (nullptr == eptrs)
return ON_SUBD_RETURN_ERROR(nullptr);
ON_SubDEdge* edges[4] = {
ON_SUBD_EDGE_POINTER(eptrs[0].m_ptr),
ON_SUBD_EDGE_POINTER(eptrs[1].m_ptr),
ON_SUBD_EDGE_POINTER(eptrs[2].m_ptr),
ON_SUBD_EDGE_POINTER(eptrs[3].m_ptr)};
if (nullptr == edges[0] || edges[0]->m_face_count > 1)
return ON_SUBD_RETURN_ERROR(nullptr);
if (nullptr == edges[1] || edges[1]->m_face_count > 1)
return ON_SUBD_RETURN_ERROR(nullptr);
if (nullptr == edges[2] || edges[2]->m_face_count > 1)
return ON_SUBD_RETURN_ERROR(nullptr);
if (nullptr == edges[3] || edges[3]->m_face_count > 1)
return ON_SUBD_RETURN_ERROR(nullptr);
ON__UINT_PTR edgedirs[4] = {
ON_SUBD_EDGE_DIRECTION(eptrs[0].m_ptr),
ON_SUBD_EDGE_DIRECTION(eptrs[1].m_ptr),
ON_SUBD_EDGE_DIRECTION(eptrs[2].m_ptr),
ON_SUBD_EDGE_DIRECTION(eptrs[3].m_ptr)};
ON_SubDVertex* vertices[4] = {
const_cast<ON_SubDVertex*>(edges[0]->m_vertex[edgedirs[0]]),
const_cast<ON_SubDVertex*>(edges[1]->m_vertex[edgedirs[1]]),
const_cast<ON_SubDVertex*>(edges[2]->m_vertex[edgedirs[2]]),
const_cast<ON_SubDVertex*>(edges[3]->m_vertex[edgedirs[3]]) };
if (nullptr == vertices[0] || nullptr == vertices[0]->m_faces || vertices[0]->m_face_count >= vertices[0]->m_face_capacity || vertices[0] != edges[3]->m_vertex[1-edgedirs[3]])
return ON_SUBD_RETURN_ERROR(nullptr);
if (nullptr == vertices[1] || nullptr == vertices[1]->m_faces || vertices[1]->m_face_count >= vertices[1]->m_face_capacity || vertices[1] != edges[0]->m_vertex[1-edgedirs[0]])
return ON_SUBD_RETURN_ERROR(nullptr);
if (nullptr == vertices[2] || nullptr == vertices[2]->m_faces || vertices[2]->m_face_count >= vertices[2]->m_face_capacity || vertices[2] != edges[1]->m_vertex[1-edgedirs[1]])
return ON_SUBD_RETURN_ERROR(nullptr);
if (nullptr == vertices[3] || nullptr == vertices[3]->m_faces || vertices[3]->m_face_count >= vertices[3]->m_face_capacity || vertices[3] != edges[2]->m_vertex[1-edgedirs[2]])
return ON_SUBD_RETURN_ERROR(nullptr);
ON_SubDFace* f = Internal_AllocateFace(zero_face_id,parent_face_id);
if (nullptr == f)
return ON_SUBD_RETURN_ERROR(nullptr);
f->m_edge_count = 4;
f->m_edge4[0] = eptrs[0];
f->m_edge4[1] = eptrs[1];
f->m_edge4[2] = eptrs[2];
f->m_edge4[3] = eptrs[3];
edges[0]->m_face2[edges[0]->m_face_count++] = ON_SubDFacePtr::Create(f,edgedirs[0]);
edges[1]->m_face2[edges[1]->m_face_count++] = ON_SubDFacePtr::Create(f,edgedirs[1]);
edges[2]->m_face2[edges[2]->m_face_count++] = ON_SubDFacePtr::Create(f,edgedirs[2]);
edges[3]->m_face2[edges[3]->m_face_count++] = ON_SubDFacePtr::Create(f,edgedirs[3]);
vertices[0]->m_faces[vertices[0]->m_face_count++] = f;
//vertices[0]->m_vertex_edge_order = ON_SubD::VertexEdgeOrder::unset;
vertices[1]->m_faces[vertices[1]->m_face_count++] = f;
//vertices[1]->m_vertex_edge_order = ON_SubD::VertexEdgeOrder::unset;
vertices[2]->m_faces[vertices[2]->m_face_count++] = f;
//vertices[2]->m_vertex_edge_order = ON_SubD::VertexEdgeOrder::unset;
vertices[3]->m_faces[vertices[3]->m_face_count++] = f;
//vertices[3]->m_vertex_edge_order = ON_SubD::VertexEdgeOrder::unset;
f->SetSubdivisionLevel( edges[0]->SubdivisionLevel() );
return f;
}
ON__UINT_PTR* ON_SubD_FixedSizeHeap::AllocatePtrArray(
unsigned int capacity,
bool bZeroMemory
)
{
if (0 == capacity)
return nullptr;
if (nullptr == m_p || capacity + m_p_index > m_p_capacity)
return ON_SUBD_RETURN_ERROR(nullptr);
ON__UINT_PTR* p = m_p + m_p_index;
m_p_index += capacity;
if (bZeroMemory)
{
ON__UINT_PTR* p1 = p + capacity;
while (p1 > p)
{
*(--p1) = 0;
}
}
return p;
}
bool ON_SubD_FixedSizeHeap::ReturnPtrArray(
void* p,
unsigned int capacity
)
{
if (nullptr != m_p && capacity <= m_p_index && p == m_p + (m_p_index - capacity))
{
m_p_index -= capacity;
return true;
}
return ON_SUBD_RETURN_ERROR(false);
}
//////////////////////////////////////////////////////////////////////////
//
// ON_SubDHeap
//
size_t ON_SubDHeap::m_offset_vertex_id = 0;
size_t ON_SubDHeap::m_offset_edge_id = 0;
size_t ON_SubDHeap::m_offset_face_id = 0;
ON_SubDHeap::ON_SubDHeap()
{
m_fspv.Create(sizeof(class ON_SubDVertex), 0, 0);
m_fspe.Create(sizeof(class ON_SubDEdge), 0, 0);
m_fspf.Create(sizeof(class ON_SubDFace), 0, 0);
m_fsp5.Create(5 * sizeof(ON__UINT_PTR), 0, 0);
m_fsp9.Create(9 * sizeof(ON__UINT_PTR), 0, 0);
m_fsp17.Create(17 * sizeof(ON__UINT_PTR), 0, 0);
if (0 == ON_SubDHeap::m_offset_vertex_id)
{
ON_SubDVertex v;
ON_SubDHeap::m_offset_vertex_id = ((const char*)(&v.m_id)) - ((const char*)&v);
ON_SubDEdge e;
ON_SubDHeap::m_offset_edge_id = ((const char*)(&e.m_id)) - ((const char*)&e);
ON_SubDFace f;
ON_SubDHeap::m_offset_face_id = ((const char*)(&f.m_id)) - ((const char*)&f);
}
}
ON_SubDHeap::~ON_SubDHeap()
{
Destroy();
}
class ON_SubDComponentBase* ON_SubDHeap::Internal_AllocateComponentAndSetId(
ON_FixedSizePool& fspc,
ON_SubDComponentBase*& unused_list,
unsigned int& max_id,
unsigned int candidate_id
)
{
// fspc is a m_fspv / m_fspe / m_fspf fixed size pool on an ON_SubDHeap.
// unused_list is the corresponding m_unused_vertex / m_unused_edge / m_unused_face list on that ON_SubDHeap.
// In order for m_fspv.ElementFromId(), m_fspe.ElementFromId() , m_fspf.ElementFromId()
// to work, it is critical that once a vertex/edge/face is allocated from m_fspv/mfspe/mfspf
// the value of m_id never changes. This is imporant because the value of m_id must persist
// in binary archives in order for ON_COMPONENT_INDEX values to persist in binary archives.
ON_SubDComponentBaseLink* c;
if (candidate_id >3000000000U)
{
// Requests for a candidate_id value above 3 billion are ignored to insure
// there is plenty of room for ids.
// It's almost certainly a bug if candidate_id > several millon or so.
candidate_id = 0;
}
if (nullptr != unused_list && candidate_id <= max_id)
{
ON_SubDComponentBaseLink* prev = nullptr;
if (candidate_id > 0 && candidate_id != unused_list->m_id)
{
// Caller wants a specific id. If it's found here, the context is probably
// some editing code where the caller deleted the component and now wants it back
// to preserve the id structure.
for (prev = static_cast<ON_SubDComponentBaseLink*>(unused_list); nullptr != prev; prev = const_cast<ON_SubDComponentBaseLink*>(prev->m_next))
{
// If candidate_id is somewhere in the unused list after the first element, return it.
if (nullptr != prev->m_next && candidate_id == prev->m_next->m_id)
break;
}
}
if (nullptr != prev)
{
// The candidate was found somewhere in the unused_list after the first element.
c = const_cast<ON_SubDComponentBaseLink*>(prev->m_next);
prev->m_next = c->m_next;
}
else
{
// Return element at the head of the unusued list.
c = static_cast<ON_SubDComponentBaseLink*>(unused_list);
unused_list = const_cast<ON_SubDComponentBaseLink*>(c->m_next);
}
const unsigned int id = c->m_id;
if (ON_UNSET_UINT_INDEX == (&c->m_id)[1] && c->m_status.IsDeleted() )
{
// When a vertex/edge/face is put on the unused list, m_archive_id is set to ON_UNSET_UINT_INDEX and m_status = ON_ComponentStatus::Deleted.
memset(c, 0, fspc.SizeofElement());
c->m_id = id;
}
else
{
// Something is modifying returned elements. This is a serious bug.
ON_SubDIncrementErrorCount();
memset(c, 0, fspc.SizeofElement());
c->m_id = ++max_id;
}
}
else
{
if (candidate_id > max_id)
{
// Caller wants a specific id. This is common when copying subds
// and some of the components of the original subd were deleted.
max_id = candidate_id;
}
else
{
#if defined(ON_DEBUG)
// TEMPORARY ERROR CHECK added Feb 2020 to test new code. Can be removed in April 2020 or earlier if needed.
// Ask Dale Lear if confused.
if (0 != candidate_id)
{
ON_SUBD_ERROR("Unable to assign candidate_id");
}
#endif
// otherwise assign the next id to this component.
candidate_id = ++max_id;
}
// allocate a new vertex.
c = (ON_SubDComponentBaseLink*)fspc.AllocateElement();
c->m_id = candidate_id;
}
return c;
}
class ON_SubDVertex* ON_SubDHeap::AllocateVertexAndSetId(unsigned int candidate_vertex_id)
{
ON_SubDComponentBase* unused_list = m_unused_vertex;
ON_SubDComponentBase* c = ON_SubDHeap::Internal_AllocateComponentAndSetId(
m_fspv,
unused_list,
m_max_vertex_id,
candidate_vertex_id
);
m_unused_vertex = static_cast<ON_SubDVertex*>(unused_list);
return static_cast<ON_SubDVertex*>(c);
}
void ON_SubDHeap::ReturnVertex(class ON_SubDVertex* v)
{
if (nullptr != v)
{
ReturnVertexEdgeAndFaceArrays(v);
(&v->m_id)[1] = ON_UNSET_UINT_INDEX; // m_archive_id == ON_UNSET_UINT_INDEX marks the fixed size pool element as unused
v->m_status = ON_ComponentStatus::Deleted;
v->m_next_vertex = m_unused_vertex;
m_unused_vertex = v;
// NO! // m_fspv.ReturnElement(v);
// See comments in AllocateVertexAndSetId();
}
}
class ON_SubDEdge* ON_SubDHeap::AllocateEdgeAndSetId(
unsigned int candidate_edge_id
)
{
ON_SubDComponentBase* unused_list = m_unused_edge;
ON_SubDComponentBase* c = ON_SubDHeap::Internal_AllocateComponentAndSetId(
m_fspe,
unused_list,
m_max_edge_id,
candidate_edge_id
);
m_unused_edge = static_cast<ON_SubDEdge*>(unused_list);
return static_cast<ON_SubDEdge*>(c);
}
void ON_SubDHeap::ReturnEdge(class ON_SubDEdge* e)
{
if (nullptr != e)
{
if (nullptr != e->m_facex)
ReturnArray(e->m_facex_capacity,(ON__UINT_PTR*)e->m_facex);
(&e->m_id)[1] = ON_UNSET_UINT_INDEX; // m_archive_id == ON_UNSET_UINT_INDEX marks the fixed size pool element as unused
e->m_status = ON_ComponentStatus::Deleted;
e->m_next_edge = m_unused_edge;
m_unused_edge = e;
// NO! // m_fspe.ReturnElement(e);
// See comments in AllocateVertexAndSetId();
}
}
class ON_SubDFace* ON_SubDHeap::AllocateFaceAndSetId(
unsigned int candidate_face_id
)
{
ON_SubDComponentBase* unused_list = m_unused_face;
ON_SubDComponentBase* c = ON_SubDHeap::Internal_AllocateComponentAndSetId(
m_fspf,
unused_list,
m_max_face_id,
candidate_face_id
);
m_unused_face = static_cast<ON_SubDFace*>(unused_list);
return static_cast<ON_SubDFace*>(c);
}
void ON_SubDHeap::ReturnFace(class ON_SubDFace* f)
{
if (nullptr != f)
{
ReturnArray(f->m_edgex_capacity,(ON__UINT_PTR*)f->m_edgex);
(&f->m_id)[1] = ON_UNSET_UINT_INDEX; // m_archive_id == ON_UNSET_UINT_INDEX marks the fixed size pool element as unused
f->m_status = ON_ComponentStatus::Deleted;
f->m_next_face = m_unused_face;
m_unused_face = f;
// NO! // m_fspf.ReturnElement(f);
// See comments in AllocateVertexAndSetId();
}
}
void ON_SubDHeap::Clear()
{
class tagWSItem* p = m_ws;
m_ws = 0;
while (p)
{
class tagWSItem* next = p->m_next;
onfree(p);
p = next;
}
m_fspv.ReturnAll();
m_fspe.ReturnAll();
m_fspf.ReturnAll();
m_fsp5.ReturnAll();
m_fsp9.ReturnAll();
m_fsp17.ReturnAll();
m_limit_block_pool.ReturnAll();
m_unused_full_fragments = nullptr;
m_unused_half_fragments = nullptr;
m_unused_limit_curves = nullptr;
m_unused_vertex = nullptr;
m_unused_edge = nullptr;
m_unused_face = nullptr;
m_max_vertex_id = 0;
m_max_edge_id = 0;
m_max_face_id = 0;
}
void ON_SubDHeap::Destroy()
{
Clear();
m_fspv.Destroy();
m_fspe.Destroy();
m_fspf.Destroy();
m_fsp5.Destroy();
m_fsp9.Destroy();
m_fsp17.Destroy();
}
void ON_SubDHeap::ClearArchiveId()
{
ON_FixedSizePoolIterator fit;
fit.Create(&m_fspv);
for (ON_SubDVertex* v = (ON_SubDVertex*)fit.FirstElement(); nullptr != v; v = (ON_SubDVertex*)fit.NextElement())
{
if ( ON_UNSET_UINT_INDEX != v->ArchiveId())
v->SetArchiveId(0);
}
fit.Create(&m_fspe);
for (ON_SubDEdge* e = (ON_SubDEdge*)fit.FirstElement(); nullptr != e; e = (ON_SubDEdge*)fit.NextElement())
{
if ( ON_UNSET_UINT_INDEX != e->ArchiveId())
e->SetArchiveId(0);
}
fit.Create(&m_fspf);
for (ON_SubDFace* f = (ON_SubDFace*)fit.FirstElement(); nullptr != f; f = (ON_SubDFace*)fit.NextElement())
{
if ( ON_UNSET_UINT_INDEX != f->ArchiveId())
f->SetArchiveId(0);
}
}
const class ON_SubDVertex* ON_SubDHeap::VertexFromId(
unsigned int vertex_id
) const
{
if ( 0 == vertex_id || ON_UNSET_UINT_INDEX == vertex_id)
return ON_SUBD_RETURN_ERROR(nullptr);
const class ON_SubDVertex* vertex = (const class ON_SubDVertex*)m_fspv.ElementFromId(ON_SubDHeap::m_offset_vertex_id,vertex_id);
if ( nullptr == vertex || vertex_id != vertex->m_id)
return ON_SUBD_RETURN_ERROR(nullptr);
if ( ON_UNSET_UINT_INDEX == vertex->ArchiveId() )
return ON_SUBD_RETURN_ERROR(nullptr);
return vertex;
}
const class ON_SubDEdge* ON_SubDHeap::EdgeFromId(
unsigned int edge_id
) const
{
if ( 0 == edge_id || ON_UNSET_UINT_INDEX == edge_id)
return ON_SUBD_RETURN_ERROR(nullptr);
const class ON_SubDEdge* edge = (const class ON_SubDEdge*)m_fspe.ElementFromId(ON_SubDHeap::m_offset_edge_id,edge_id);
if ( nullptr == edge || edge_id != edge->m_id)
return ON_SUBD_RETURN_ERROR(nullptr);
if ( ON_UNSET_UINT_INDEX == edge->ArchiveId() )
return ON_SUBD_RETURN_ERROR(nullptr);
return edge;
}
const class ON_SubDFace* ON_SubDHeap::FaceFromId(
unsigned int face_id
) const
{
if ( 0 == face_id || ON_UNSET_UINT_INDEX == face_id)
return ON_SUBD_RETURN_ERROR(nullptr);
const class ON_SubDFace* face = (const class ON_SubDFace*)m_fspf.ElementFromId(ON_SubDHeap::m_offset_face_id,face_id);
if ( nullptr == face || face_id != face->m_id)
return ON_SUBD_RETURN_ERROR(nullptr);
if ( ON_UNSET_UINT_INDEX == face->ArchiveId() )
return ON_SUBD_RETURN_ERROR(nullptr);
return face;
}
static bool ON_SubDHeapIsNotValid(bool bSilentError)
{
ON_SubDIncrementErrorCount();
return bSilentError ? false : ON_IsNotValid();
}
bool ON_SubDHeap::IsValid(
bool bSilentError,
ON_TextLog* text_log
) const
{
if (false == m_fspv.ElementIdIsIncreasing(ON_SubDHeap::m_offset_vertex_id))
{
if (nullptr != text_log)
text_log->Print("m_fspv.ElementIdIsIncreasing() is false.");
return ON_SubDHeapIsNotValid(bSilentError);
}
if (false == m_fspe.ElementIdIsIncreasing(ON_SubDHeap::m_offset_edge_id))
{
if (nullptr != text_log)
text_log->Print("m_fspe.ElementIdIsIncreasing() is false.");
return ON_SubDHeapIsNotValid(bSilentError);
}
if (false == m_fspf.ElementIdIsIncreasing(ON_SubDHeap::m_offset_face_id))
{
if (nullptr != text_log)
text_log->Print("m_fspf.ElementIdIsIncreasing() is false.");
return ON_SubDHeapIsNotValid(bSilentError);
}
const unsigned max_fspv_max_id = m_fspv.MaximumElementId(ON_SubDHeap::m_offset_vertex_id);
if (m_max_vertex_id != max_fspv_max_id)
{
if (nullptr != text_log)
text_log->Print("m_max_vertex_id = %u != %u = m_fspv.MaximumElementId()\n", m_max_vertex_id, max_fspv_max_id);
return ON_SubDHeapIsNotValid(bSilentError);
}
const unsigned max_fspe_max_id = m_fspe.MaximumElementId(ON_SubDHeap::m_offset_edge_id);
if (m_max_edge_id != max_fspe_max_id)
{
if (nullptr != text_log)
text_log->Print("m_max_edge_id = %u != %u = m_fspe.MaximumElementId()\n", m_max_edge_id, max_fspe_max_id);
return ON_SubDHeapIsNotValid(bSilentError);
}
const unsigned max_fspf_max_id = m_fspf.MaximumElementId(ON_SubDHeap::m_offset_face_id);
if (m_max_face_id != max_fspf_max_id)
{
if (nullptr != text_log)
text_log->Print("m_max_face_id = %u != %u = m_fspf.MaximumElementId()\n", m_max_face_id, max_fspf_max_id);
return ON_SubDHeapIsNotValid(bSilentError);
}
return true;
}
void ON_SubDHeap::ResetIds()
{
const unsigned int first_id = 1;
const unsigned int next_vertex_id = m_fspv.ResetElementId(ON_SubDHeap::m_offset_vertex_id,first_id);
const unsigned int next_edge_id = m_fspe.ResetElementId(ON_SubDHeap::m_offset_edge_id,first_id);
const unsigned int next_face_id = m_fspf.ResetElementId(ON_SubDHeap::m_offset_face_id,first_id);
// m_max_..._id = maximum assigned id = m_next_..._id - 1
m_max_vertex_id = (next_vertex_id > first_id) ? (next_vertex_id - 1U) : 0U;
m_max_edge_id = (next_edge_id > first_id) ? (next_edge_id - 1U) : 0U;
m_max_face_id = (next_face_id > first_id) ? (next_face_id - 1U) : 0U;
}
size_t ON_SubDHeap::OversizedElementCapacity(size_t count)
{
size_t capacity = 32 * (count / 32);
if (count % 32 > 0 || 0 == count)
capacity += 32;
return capacity;
}
ON__UINT_PTR* ON_SubDHeap::AllocateOversizedElement(size_t* capacity)
{
class tagWSItem* p;
size_t actual_capacity = ON_SubDHeap::OversizedElementCapacity(*capacity);
size_t sz = (actual_capacity + 1)*sizeof(ON__UINT_PTR);
sz += sizeof(*p);
p = (class tagWSItem*)onmalloc(sz);
p->m_next = m_ws;
if (p->m_next)
p->m_next->m_prev = p;
p->m_prev = 0;
m_ws = p;
ON__UINT_PTR* a = (ON__UINT_PTR*)(p + 1);
*a++ = actual_capacity;
*capacity = actual_capacity;
return a;
}
void ON_SubDHeap::ReturnOversizedElement(
size_t capacity,
ON__UINT_PTR* a
)
{
if (0 != a && capacity > 0)
{
class tagWSItem* p = ((class tagWSItem*)(a - 1)) - 1;
if (p == m_ws)
{
if (nullptr != p->m_next)
{
m_ws = p->m_next;
p->m_next->m_prev = 0;
}
else
m_ws = nullptr;
}
else
{
if (p->m_next)
p->m_next->m_prev = p->m_prev;
p->m_prev->m_next = p->m_next;
}
onfree(p);
}
}
ON__UINT_PTR* ON_SubDHeap::ResizeArray(
size_t current_count,
size_t current_capacity,
ON__UINT_PTR* current_a,
size_t* new_capacity
)
{
ON__UINT_PTR capacity = ON_SubDHeap::ArrayCapacity(current_capacity,current_a);
if (capacity <= 0)
{
return (ON__UINT_PTR*)AllocateArray(new_capacity);
}
if (*new_capacity <= 0)
{
ReturnArray(current_capacity,current_a);
*new_capacity = 0;
return nullptr;
}
if (*new_capacity <= capacity)
{
return current_a;
}
ON__UINT_PTR* new_a = AllocateArray(new_capacity);
ON__UINT_PTR* a1 = new_a + current_count;
while (new_a < a1)
{
*new_a++ = *current_a++;
}
ReturnArray(current_capacity,current_a - current_count);
return (a1 - current_count);
}
bool ON_SubDHeap::GrowVertexEdgeArray(
ON_SubDVertex* v,
size_t capacity
)
{
if ( nullptr == v)
return ON_SUBD_RETURN_ERROR(false);
if ( 0 == capacity )
capacity = v->m_edge_count+1;
if ( capacity <= v->m_edge_capacity)
return true;
ON__UINT_PTR* a = ResizeArray(v->m_edge_count,v->m_edge_capacity,(ON__UINT_PTR*)v->m_edges,&capacity);
if ( nullptr == a )
{
v->m_edge_count = 0;
v->m_edge_capacity = 0;
v->m_edges = 0;
return ON_SUBD_RETURN_ERROR(false);
}
v->m_edges = (ON_SubDEdgePtr*)a;
v->m_edge_capacity = (unsigned short)capacity;
return true;
}
bool ON_SubDHeap::GrowVertexFaceArray(
ON_SubDVertex* v,
size_t capacity
)
{
if ( nullptr == v)
return ON_SUBD_RETURN_ERROR(false);
if ( 0 == capacity )
capacity = v->m_face_count+1;
if ( capacity <= v->m_face_capacity)
return true;
ON__UINT_PTR* a = ResizeArray(v->m_face_count,v->m_face_capacity,(ON__UINT_PTR*)v->m_faces,&capacity);
if (nullptr == a)
{
v->m_face_count = 0;
v->m_face_capacity = 0;
v->m_faces = nullptr;
return ON_SUBD_RETURN_ERROR(false);
}
v->m_faces = (const ON_SubDFace**)a;
v->m_face_capacity = (unsigned short)capacity;
return true;
}
bool ON_SubDHeap::GrowEdgeFaceArray(
ON_SubDEdge* e,
size_t capacity
)
{
if ( nullptr == e)
return ON_SUBD_RETURN_ERROR(false);
if ( 0 == capacity )
capacity = e->m_face_count+1;
if ( capacity <= (size_t)(2 + e->m_facex_capacity))
return true;
size_t xcapacity = capacity-2;
ON__UINT_PTR* a = ResizeArray((e->m_face_count>2) ? (e->m_face_count-2) : 0,e->m_facex_capacity,(ON__UINT_PTR*)e->m_facex,&xcapacity);
if ( nullptr == a )
{
e->m_face_count = 0;
e->m_facex_capacity = 0;
e->m_facex = nullptr;
return ON_SUBD_RETURN_ERROR(false);
}
e->m_facex = (ON_SubDFacePtr*)a;
e->m_facex_capacity = (unsigned short)xcapacity;
return true;
}
bool ON_SubDHeap::GrowFaceEdgeArray(
ON_SubDFace* f,
size_t capacity
)
{
if ( nullptr == f)
return ON_SUBD_RETURN_ERROR(false);
if ( 0 == capacity )
capacity = f->m_edge_count+1;
if ( capacity <= (size_t)(4 + f->m_edgex_capacity))
return true;
size_t xcapacity = capacity-4;
ON__UINT_PTR* a = ResizeArray((f->m_edge_count>4) ? (f->m_edge_count-4) : 0,f->m_edgex_capacity,(ON__UINT_PTR*)f->m_edgex,&xcapacity);
if ( nullptr == a )
{
f->m_edge_count = 0;
f->m_edgex_capacity = 0;
f->m_edgex = nullptr;
return ON_SUBD_RETURN_ERROR(false);
}
f->m_edgex = (ON_SubDEdgePtr*)a;
f->m_edgex_capacity = (unsigned short)xcapacity;
return true;
}
bool ON_SubDHeap::GrowVertexEdgeArrayByOne(
ON_SubDVertex* v
)
{
return GrowVertexEdgeArray(v,0);
}
bool ON_SubDHeap::GrowVertexFaceArrayByOne(
ON_SubDVertex* v
)
{
return GrowVertexFaceArray(v,0);
}
bool ON_SubDHeap::GrowEdgeFaceArrayByOne(
ON_SubDEdge* e
)
{
return GrowEdgeFaceArray(e,0);
}
bool ON_SubDHeap::GrowFaceEdgeArrayByOne(
ON_SubDFace* f
)
{
return GrowFaceEdgeArray(f,0);
}
bool ON_SubDimple::GrowVertexEdgeArray(
ON_SubDVertex* v,
size_t capacity
)
{
return m_heap.GrowVertexEdgeArray(v,capacity);
}
bool ON_SubDimple::GrowVertexFaceArray(
ON_SubDVertex* v,
size_t capacity
)
{
return m_heap.GrowVertexFaceArray(v,capacity);
}
bool ON_SubDimple::GrowEdgeFaceArray(
ON_SubDEdge* e,
size_t capacity
)
{
return m_heap.GrowEdgeFaceArray(e,capacity);
}
bool ON_SubDimple::GrowFaceEdgeArray(
ON_SubDFace* f,
size_t capacity
)
{
return m_heap.GrowFaceEdgeArray(f,capacity);
}
bool ON_SubD::GrowVertexEdgeArray(
ON_SubDVertex* v,
size_t capacity
)
{
ON_SubDimple* subdimple = SubDimple(false);
if ( nullptr == subdimple )
return ON_SUBD_RETURN_ERROR(false);
return subdimple->GrowVertexEdgeArray(v,capacity);
}
bool ON_SubD::GrowVertexFaceArray(
ON_SubDVertex* v,
size_t capacity
)
{
ON_SubDimple* subdimple = SubDimple(false);
if ( nullptr == subdimple )
return ON_SUBD_RETURN_ERROR(false);
return subdimple->GrowVertexFaceArray(v,capacity);
}
bool ON_SubD::GrowEdgeFaceArray(
ON_SubDEdge* e,
size_t capacity
)
{
ON_SubDimple* subdimple = SubDimple(false);
if ( nullptr == subdimple )
return ON_SUBD_RETURN_ERROR(false);
return subdimple->GrowEdgeFaceArray(e,capacity);
}
bool ON_SubD::GrowFaceEdgeArray(
ON_SubDFace* f,
size_t capacity
)
{
ON_SubDimple* subdimple = SubDimple(false);
if ( nullptr == subdimple )
return ON_SUBD_RETURN_ERROR(false);
return subdimple->GrowFaceEdgeArray(f,capacity);
}
ON__UINT_PTR ON_SubDHeap::ArrayCapacity(
size_t capacity,
ON__UINT_PTR* a
)
{
#if defined(ON_DEBUG)
size_t acapacity = (nullptr == a) ? 0 : a[-1];
if (capacity != acapacity)
{
ON_SubDIncrementErrorCount();
}
#endif
return (nullptr == a) ? 0 : a[-1];
}
bool ON_SubDHeap::ReturnVertexEdgeAndFaceArrays(
ON_SubDVertex* v
)
{
if ( nullptr == v )
return ON_SUBD_RETURN_ERROR(false);
if (nullptr != v->m_edges || v->m_edge_capacity > 0 || v->m_edge_count > 0)
{
ReturnArray(v->m_edge_capacity,(ON__UINT_PTR*)v->m_edges);
v->m_edges = nullptr;
v->m_edge_capacity = 0;
v->m_edge_count = 0;
}
if (nullptr != v->m_faces || v->m_face_capacity > 0 || v->m_face_count > 0)
{
ReturnArray(v->m_face_capacity,(ON__UINT_PTR*)v->m_faces);
v->m_faces = nullptr;
v->m_face_capacity = 0;
v->m_face_count = 0;
}
return true;
}
bool ON_SubDHeap::ReturnEdgeExtraArray(
ON_SubDEdge* e
)
{
if ( nullptr == e )
return ON_SUBD_RETURN_ERROR(false);
if (nullptr != e->m_facex || e->m_facex_capacity > 0)
{
ReturnArray(e->m_facex_capacity,(ON__UINT_PTR*)e->m_facex);
e->m_facex = nullptr;
e->m_facex_capacity = 0;
}
if (e->m_face_count > 2)
e->m_face_count = 2;
return true;
}
bool ON_SubDHeap::ReturnFaceExtraArray(
ON_SubDFace* f
)
{
if ( nullptr == f )
return ON_SUBD_RETURN_ERROR(false);
if (nullptr != f->m_edgex || f->m_edgex_capacity > 0)
{
ReturnArray(f->m_edgex_capacity,(ON__UINT_PTR*)f->m_edgex);
f->m_edgex = nullptr;
f->m_edgex_capacity = 0;
}
if (f->m_edge_count > 4)
f->m_edge_count = 4;
return true;
}
ON__UINT_PTR* ON_SubDHeap::AllocateArray(size_t* capacity)
{
ON__UINT_PTR* a;
size_t requested_capacity = *capacity;
if (requested_capacity <= 0)
return nullptr;
if (requested_capacity <= 4)
{
a = (ON__UINT_PTR*)m_fsp5.AllocateElement();
*a++ = 4;
*capacity = 4;
return a;
}
if (requested_capacity <= 8)
{
a = (ON__UINT_PTR*)m_fsp9.AllocateElement();
*a++ = 8;
*capacity = 8;
return a;
}
if (requested_capacity <= 16)
{
a = (ON__UINT_PTR*)m_fsp17.AllocateElement();
*a++ = 16;
*capacity = 16;
return a;
}
return AllocateOversizedElement(capacity);
}
void ON_SubDHeap::ReturnArray(
size_t capacity,
ON__UINT_PTR* a
)
{
if (nullptr != a && 0 == capacity)
{
ON_SubDIncrementErrorCount();
}
switch (ON_SubDHeap::ArrayCapacity(capacity,a))
{
case 0:
break;
case 4:
m_fsp5.ReturnElement(a - 1);
break;
case 8:
m_fsp9.ReturnElement(a - 1);
break;
case 16:
m_fsp17.ReturnElement(a - 1);
break;
default:
ReturnOversizedElement(capacity,a);
break;
}
return;
}
bool ON_SubDHeap::Internal_InitializeLimitBlockPool()
{
if (0 == m_limit_block_pool.SizeofElement())
{
m_sizeof_full_fragment = ON_SubDMeshFragment::SizeofFragment(ON_SubDDisplayParameters::DefaultDensity);
m_sizeof_half_fragment = ON_SubDMeshFragment::SizeofFragment(ON_SubDDisplayParameters::DefaultDensity-1);
m_sizeof_limit_curve = sizeof(ON_SubDEdgeSurfaceCurve);
size_t sz = m_sizeof_full_fragment;
if (sz < 4 * m_sizeof_half_fragment)
sz = 4 * m_sizeof_half_fragment;
ON_SleepLockGuard guard(m_limit_block_pool);
m_limit_block_pool.Create(sz,0,0);
// check size again in case another thread beat this call
if (0 == m_limit_block_pool.SizeofElement())
m_limit_block_pool.Create(sz, 0, 0);
}
return (m_limit_block_pool.SizeofElement() > 0);
}
ON_SubDMeshFragment* ON_SubDHeap::AllocateMeshFragment(
const ON_SubDMeshFragment& src_fragment
)
{
// When 4 == ON_SubDDisplayParameters::DefaultDensity (setting used in February 2019)
// quads get a single fragment with a 16x16 face grid
// N-gons with N != 4 get N 8x8 grids.
const unsigned int density = (src_fragment.m_face_fragment_count > 1)
? (ON_SubDDisplayParameters::DefaultDensity-1)
: ((1==src_fragment.m_face_fragment_count) ? ON_SubDDisplayParameters::DefaultDensity : 0)
;
if (0 == density)
return ON_SUBD_RETURN_ERROR(nullptr);
const unsigned short side_seg_count = (unsigned short)ON_SubDMeshFragment::SideSegmentCountFromDisplayDensity(density);
const unsigned short vertex_capacity = (side_seg_count + 1)*(side_seg_count + 1);
if ( src_fragment.VertexCount() > 0 && src_fragment.VertexCount() < ((unsigned)vertex_capacity) )
return ON_SUBD_RETURN_ERROR(nullptr);
if (0 == m_limit_block_pool.SizeofElement())
Internal_InitializeLimitBlockPool();
ON_SubDMeshFragment* fragment;
{
char* p = nullptr;
char* p1 = nullptr;
ON_SleepLockGuard guard(m_limit_block_pool);
if (ON_SubDDisplayParameters::DefaultDensity == density)
{
if (nullptr == m_unused_full_fragments)
{
p = (char*)m_limit_block_pool.AllocateDirtyElement();
if (nullptr == p)
return ON_SUBD_RETURN_ERROR(nullptr);
p1 = p + m_limit_block_pool.SizeofElement();
m_unused_full_fragments = (ON_FixedSizePoolElement*)p;
m_unused_full_fragments->m_next = nullptr;
p += m_sizeof_full_fragment;
while (p + m_sizeof_full_fragment < p1)
{
ON_FixedSizePoolElement* ele = (ON_FixedSizePoolElement*)p;
ele->m_next = m_unused_full_fragments;
m_unused_full_fragments = ele;
p += m_sizeof_full_fragment;
}
}
fragment = (ON_SubDMeshFragment*)m_unused_full_fragments;
m_unused_full_fragments = m_unused_full_fragments->m_next;
}
else
{
if (nullptr == m_unused_half_fragments)
{
p = (char*)m_limit_block_pool.AllocateDirtyElement();
if (nullptr == p)
return ON_SUBD_RETURN_ERROR(nullptr);
p1 = p + m_limit_block_pool.SizeofElement();
m_unused_half_fragments = (ON_FixedSizePoolElement*)p;
m_unused_half_fragments->m_next = nullptr;
p += m_sizeof_half_fragment;
while (p + m_sizeof_half_fragment < p1)
{
ON_FixedSizePoolElement* ele = (ON_FixedSizePoolElement*)p;
ele->m_next = m_unused_half_fragments;
m_unused_half_fragments = ele;
p += m_sizeof_half_fragment;
}
}
fragment = (ON_SubDMeshFragment*)m_unused_half_fragments;
m_unused_half_fragments = m_unused_half_fragments->m_next;
}
if (nullptr != p)
{
while (p + m_sizeof_limit_curve < p1)
{
ON_FixedSizePoolElement* ele = (ON_FixedSizePoolElement*)p;
ele->m_next = m_unused_limit_curves;
m_unused_limit_curves = ele;
p += m_sizeof_limit_curve;
}
}
}
*fragment = src_fragment;
fragment->m_prev_fragment = nullptr;
fragment->m_next_fragment = nullptr;
double* a = (double*)(fragment + 1);
fragment->SetUnmanagedVertexCapacity(vertex_capacity);
fragment->SetVertexCount(0);
fragment->m_P = a;
fragment->m_P_stride = 3;
fragment->m_N = a + (vertex_capacity * 3);
fragment->m_N_stride = 3;
fragment->m_T = a + (vertex_capacity * 6);
fragment->m_T_stride = 3;
if (src_fragment.VertexCount() > 0)
fragment->CopyFrom(src_fragment,density);
return fragment;
}
bool ON_SubDHeap::ReturnMeshFragment(ON_SubDMeshFragment * fragment)
{
if (nullptr == fragment)
return false;
ON_FixedSizePoolElement* ele = (ON_FixedSizePoolElement*)fragment;
if (17 * 17 == fragment->VertexCapacity())
{
ON_SleepLockGuard guard(m_limit_block_pool);
((unsigned int*)ele)[5] = 0; // zero m_vertex_count_etc and m_vertex_capacity_etc
ele->m_next = m_unused_full_fragments;
m_unused_full_fragments = ele;
}
else if (9 * 9 == fragment->VertexCapacity())
{
ON_SleepLockGuard guard(m_limit_block_pool);
((unsigned int*)ele)[5] = 0; // zero m_vertex_count_etc and m_vertex_capacity_etc
ele->m_next = m_unused_half_fragments;
m_unused_half_fragments = ele;
}
else
return ON_SUBD_RETURN_ERROR(false);
return true;
}
bool ON_SubDHeap::ReturnMeshFragments(const ON_SubDFace * face)
{
if (nullptr != face)
{
face->Internal_ClearSurfacePointFlag();
ON_SubDMeshFragment* fragment = face->m_mesh_fragments;
face->m_mesh_fragments = nullptr;
while (nullptr != fragment)
{
if (face != fragment->m_face)
return ON_SUBD_RETURN_ERROR(false);
ON_SubDMeshFragment* next_fragment = fragment->m_next_fragment;
if (false == ReturnMeshFragment(fragment))
return false;
fragment = next_fragment;
}
}
return true;
}
class ON_SubDEdgeSurfaceCurve* ON_SubDHeap::AllocateEdgeSurfaceCurve(
unsigned int cv_capacity
)
{
if (cv_capacity < 1 || cv_capacity > ON_SubDEdgeSurfaceCurve::MaximumControlPointCapacity)
return ON_SUBD_RETURN_ERROR(nullptr);
if (0 == m_limit_block_pool.SizeofElement())
Internal_InitializeLimitBlockPool();
ON_SubDEdgeSurfaceCurve* limit_curve;
double* cvx = nullptr;
{
ON_SleepLockGuard guard(m_limit_block_pool);
if (
nullptr == m_unused_limit_curves
|| ( cv_capacity > ON_SubDEdgeSurfaceCurve::MinimumControlPointCapacity && nullptr == m_unused_limit_curves->m_next)
)
{
char* p = (char*)m_limit_block_pool.AllocateDirtyElement();
if (nullptr == p)
return ON_SUBD_RETURN_ERROR(nullptr);
char* p1 = p + m_limit_block_pool.SizeofElement();
while (p + m_sizeof_limit_curve < p1)
{
ON_FixedSizePoolElement* ele = (ON_FixedSizePoolElement*)p;
ele->m_next = m_unused_limit_curves;
m_unused_limit_curves = ele;
p += m_sizeof_limit_curve;
}
}
limit_curve = (ON_SubDEdgeSurfaceCurve*)m_unused_limit_curves;
m_unused_limit_curves = m_unused_limit_curves->m_next;
if (cv_capacity > ON_SubDEdgeSurfaceCurve::MinimumControlPointCapacity)
{
cvx = (double*)m_unused_limit_curves;
m_unused_limit_curves = m_unused_limit_curves->m_next;
}
}
memset(limit_curve, 0, sizeof(*limit_curve));
limit_curve->m_cv_capacity = ON_SubDEdgeSurfaceCurve::MinimumControlPointCapacity;
if (nullptr != cvx)
{
// increase capacity
limit_curve->m_cv_capacity = ON_SubDEdgeSurfaceCurve::MaximumControlPointCapacity;
limit_curve->m_cvx = cvx;
double* p1 = cvx + 3 * (ON_SubDEdgeSurfaceCurve::MaximumControlPointCapacity-ON_SubDEdgeSurfaceCurve::MinimumControlPointCapacity);
while (cvx < p1)
*cvx++ = ON_DBL_QNAN;
}
return limit_curve;
}
bool ON_SubDHeap::ReturnEdgeSurfaceCurve(
class ON_SubDEdgeSurfaceCurve* limit_curve
)
{
if (nullptr != limit_curve)
{
limit_curve->m_cv_count = 0;
ON_FixedSizePoolElement* ele0 = (ON_FixedSizePoolElement*)limit_curve;
ON_FixedSizePoolElement* ele1 = (ON_FixedSizePoolElement*)limit_curve->m_cvx;
if (nullptr != ele1)
{
((unsigned int*)ele1)[2] = 0; // zero cv_count and cv_capacity - to limit crashes caused by rogue references
ele0->m_next = ele1;
}
else
ele1 = ele0;
((unsigned int*)ele0)[2] = 0; // zero cv_count and cv_capacity - to limit crashes caused by rogue references
ON_SleepLockGuard guard(m_limit_block_pool);
ele1->m_next = m_unused_limit_curves;
m_unused_limit_curves = ele0;
}
return true;
}
bool ON_SubDHeap::ReturnEdgeSurfaceCurve(
const class ON_SubDEdge* edge
)
{
bool rc = true;
ON_SubDEdgeSurfaceCurve* limit_curve = (nullptr != edge) ? edge->m_limit_curve : nullptr;
if (nullptr != limit_curve)
{
edge->Internal_ClearSurfacePointFlag();
edge->m_limit_curve = nullptr;
rc = ReturnEdgeSurfaceCurve(limit_curve);
}
return rc;
}
Reference in New Issue View Git Blame Copy Permalink