EXPORT boolean _delete_from_pointers_if_present(
POINTER p,
POINTER **parray)
{
if (parray && !pointer_is_in_array(p,*parray))
return FUNCTION_SUCCEEDED;
return delete_from_pointers(p,parray);
} /*end _delete_from_pointers_if_present*/
EXPORT boolean _unique_add_to_pointers(
POINTER newp,
POINTER **parray)
{
if (parray && pointer_is_in_array(newp,*parray))
return FUNCTION_SUCCEEDED;
return add_to_pointers(newp,parray);
} /*end _unique_add_to_pointers*/
LOCAL bool check_curve3d(
CURVE *c,
INTERFACE *intfc)
{
BOND *b;
BOND_TRI **bts, **bts0;
NODE *ns, *ne;
SURFACE *s, **ss;
TRI *tri, **tris;
bool status = YES;
char warn[1024];
int nsides, nbts, i;
int ntris;
(void) sprintf(warn,"WARNING in check_curve3d(), curve %llu inconsistent ",
curve_number(c));
if (c->interface != intfc)
{
(void) printf("%s c->interface (%llu) != intfc (%llu)\n",
warn,interface_number(c->interface),
interface_number(intfc));
status = NO;
}
ns = c->start;
if (!pointer_is_in_array(c,ns->out_curves))
{
(void) printf("%s curve in not in start node (%llu) "
"out_curves\n",warn,node_number(ns));
status = NO;
}
ne = c->end;
if (!pointer_is_in_array(c,ne->in_curves))
{
(void) printf("%s curve in not in end node (%llu) "
"in_curves\n",warn,node_number(ne));
status = NO;
}
if (ns->posn != c->first->start)
{
(void) printf("%s ns->posn != c->first->start\n"
"c->first->start = %llu, "
"ns = %llu, ns->posn = %llu\n",
warn,point_number(c->first->start),
node_number(ns),point_number(ns->posn));
status = NO;
}
if (ne->posn != c->last->end)
{
(void) printf("%s ne->posn != c->last->end\n"
"c->last->end = %llu, "
"ne = %llu, ne->posn = %llu\n",
warn,point_number(c->last->end),
node_number(ne),point_number(ne->posn));
print_general_vector("c->last->end", Coords(c->last->end), 3, "\n");
print_general_vector("ne->posn", Coords(ne->posn), 3, "\n");
print_curve(c);
status = NO;
}
if (!Boundary_point(ns->posn))
{
(void) printf("%s ns->posn (ns = %llu, ns->posn = %llu) is not a "
"boundary point\n",
warn,node_number(ns),point_number(ns->posn));
status = NO;
}
if (!Boundary_point(ne->posn))
{
(void) printf("%s ne->posn (ne = %llu, ne->posn = %llu) is not a "
"boundary point\n",
warn,node_number(ne),point_number(ne->posn));
status = NO;
}
if (!Boundary_point(c->first->start))
{
(void) printf("%s c->first->start = %llu is not a "
"boundary point\n",
warn,point_number(c->first->start));
status = NO;
}
if (!Boundary_point(c->last->end))
{
(void) printf("%s c->last->end = %llu is not a "
"boundary point\n",
warn,point_number(c->last->end));
status = NO;
}
for (ss = c->pos_surfaces; ss && *ss; ++ss)
{
if (!pointer_is_in_array(c,(*ss)->pos_curves))
{
(void) printf("%s curve in not s->pos_curves "
" s = %llu but s is in c->neg_surfaces\n",
warn,surface_number(*ss));
status = NO;
}
}
for (ss = c->neg_surfaces; ss && *ss; ++ss)
{
if (!pointer_is_in_array(c,(*ss)->neg_curves))
{
(void) printf("%s curve in not s->neg_curves "
" s = %llu but s is in c->neg_surfaces\n",
warn,surface_number(*ss));
status = NO;
}
}
b = c->first;
bts0 = Btris(b);
for (nbts = 0, bts = Btris(b); bts && *bts; ++nbts, ++bts);
if (nbts == 0)
{
if (c->pos_surfaces || c->neg_surfaces)
{
(void) printf("%s curve has no bond tris but is "
"connected to some surface\n",warn);
status = NO;
}
}
if (c->first->prev != NULL)
{
(void) printf("%s c->first->prev != NULL\n",warn);
print_bond(c->first);
print_bond(c->first->prev);
status = NO;
}
if (c->last->next != NULL)
{
(void) printf("%s c->last->next != NULL\n",warn);
print_bond(c->last);
print_bond(c->last->next);
status = NO;
}
for (b = c->first; b != NULL; b = b->next)
{
if (b->next && b->next->start != b->end)
{
(void) printf("%s bond pair (%llu -> %llu) point pointers "
"inconsistent\n",
warn,bond_number(b,intfc),
bond_number(b->next,intfc));
print_bond(b);
print_bond(b->next);
status = NO;
}
if (!Boundary_point(b->start))
{
(void) printf("%s b->start = %llu is not a "
"boundary point\n",
warn,point_number(b->start));
print_bond(b);
status = NO;
}
if (!Boundary_point(b->end))
{
(void) printf("%s b->end = %llu is not a "
"boundary point\n",
warn,point_number(b->end));
print_bond(b);
status = NO;
}
for (i = 0, bts = Btris(b); bts && *bts; ++i, ++bts)
{
if ((i < nbts) &&
!(((*bts)->surface == bts0[i]->surface) &&
((*bts)->orient == bts0[i]->orient)))
{
(void) printf("%s inconsistent surface numbers on "
"bond tri\n",warn);
(void) printf("surface = %llu surface[%d] = %llu\n",
surface_number((*bts)->surface),i,
surface_number(bts0[i]->surface));
(void) printf("orient = %s orient[%d] = %s\n",
orientation_name((*bts)->orient),i,
orientation_name(bts0[i]->orient));
print_bond(b);
status = NO;
}
}
if (i != nbts)
{
(void) printf("%s inconsistent %d != %d number of bond tris "
"on bond\n",warn,i,nbts);
print_bond(b);
status = NO;
}
for (bts = Btris(b); bts && *bts; ++bts)
{
if ((*bts)->curve != c)
{
(void) printf("%s bond tri curve field (%llu) != c\n",
warn,curve_number((*bts)->curve));
print_bond(b);
status = NO;
}
if ((*bts)->bond != b)
{
(void) printf("%s bond tri bond field (%llu) != b (%llu)\n",
warn,bond_number((*bts)->bond,intfc),
bond_number(b,intfc));
print_bond(b);
status = NO;
}
tri = (*bts)->tri;
s = Surface_of_tri(tri);
if ((*bts)->surface != s)
{
(void) printf("%s bond tri surface field (%llu)"
"!= Surface_of_tri(tri) (%llu)\n",
warn,surface_number((*bts)->surface),
surface_number(s));
print_bond(b);
status = NO;
}
for (nsides = 0, i = 0; i < 3; ++i)
{
if (is_side_bdry(tri,i) && (b==Bond_on_side(tri,i)))
++nsides;
}
if (nsides == 0)
{
(void) printf("%s bond not found on tri side\n",warn);
print_bond(b);
print_tri(tri,intfc);
status = NO;
}
else if (nsides > 1)
{
(void) printf("%s bond found on multiple tri sides\n",warn);
print_bond(b);
print_tri(tri,intfc);
status = NO;
}
else
{
if (orientation_of_bond_at_tri(b,tri) != (*bts)->orient)
{
(void) printf("%s inconsistent orientation at "
"bond tri\n",warn);
print_tri(tri,intfc);
print_bond(b);
status = NO;
}
switch ((*bts)->orient)
{
case POSITIVE_ORIENTATION:
if (!pointer_is_in_array(c,s->pos_curves))
{
(void) printf("%s curve in not s->pos_curves "
" s = %llu\n",
warn,surface_number(s));
print_bond(b);
print_tri(tri,intfc);
status = NO;
}
if (!pointer_is_in_array(s,c->pos_surfaces))
{
(void) printf("%s surface in not c->pos_surfaces "
" s = %llu\n",
warn,surface_number(s));
print_bond(b);
print_tri(tri,intfc);
status = NO;
}
break;
case NEGATIVE_ORIENTATION:
if (!pointer_is_in_array(c,s->neg_curves))
{
(void) printf("%s curve in not s->neg_curves "
" s = %llu\n",
warn,surface_number(s));
print_bond(b);
print_tri(tri,intfc);
status = NO;
}
if (!pointer_is_in_array(s,c->neg_surfaces))
{
(void) printf("%s surface in not c->neg_surfaces "
" s = %llu\n",
warn,surface_number(s));
print_bond(b);
print_tri(tri,intfc);
status = NO;
}
break;
case ORIENTATION_NOT_SET:
(void) printf("%s inconsistent point and tri "
"points\n",warn);
print_bond(b);
print_tri(tri,intfc);
status = NO;
break;
}
}
if (b->prev)
{
TRI *t0, *t1;
ntris = set_tri_list_around_point(b->start,tri,&tris,intfc);
t0 = tris[0]; t1 = tris[ntris-1];
if (!(((side_of_tri_with_bond(b,t0) < 3) &&
(side_of_tri_with_bond(b->prev,t1) < 3))
||
((side_of_tri_with_bond(b,t1) < 3) &&
(side_of_tri_with_bond(b->prev,t0) < 3)))
)
{
(void) printf("%s, corrupt tri list at b->start\n",
warn);
(void) printf("Bond b\n"); print_bond(b);
(void) printf("Bond b->prev\n"); print_bond(b->prev);
print_tri(tri,intfc);
(void) printf("number of tris at point = %d\n",ntris);
for (i = 0; i < ntris; ++i)
{
(void) printf("tris[%d] - ",i);
print_tri(tris[i],intfc);
}
status = NO;
}
}
}
}
return status;
} /*end check_curve3d*/
LOCAL bool check_curve2d(
CURVE *c,
INTERFACE *intfc)
{
BOND *b;
NODE *ns, *ne;
bool status = YES;
char warn[1024];
(void) sprintf(warn,"WARNING in check_curve(), curve %llu inconsistent ",
curve_number(c));
if (c->interface != intfc)
{
(void) printf("%s c->interface (%llu) != intfc (%llu)\n",
warn,interface_number(c->interface),
interface_number(intfc));
status = NO;
}
ns = c->start;
if (!pointer_is_in_array(c,ns->out_curves))
{
(void) printf("%s curve in not in start node (%llu) "
"out_curves\n",warn,node_number(ns));
status = NO;
}
ne = c->end;
if (!pointer_is_in_array(c,ne->in_curves))
{
(void) printf("%s curve in not in end node (%llu) "
"in_curves\n",warn,node_number(ne));
status = NO;
}
if (ns->posn != c->first->start)
{
(void) printf("%s ns->posn != c->first->start\n"
"c->first->start = %llu, "
"ns = %llu, ns->posn = %llu\n",
warn,point_number(c->first->start),
node_number(ns),point_number(ns->posn));
status = NO;
}
if (ne->posn != c->last->end)
{
(void) printf("%s ne->posn != c->last->end\n"
"c->last->end = %llu, "
"ne = %llu, ne->posn = %llu\n",
warn,point_number(c->last->end),
node_number(ne),point_number(ne->posn));
status = NO;
}
if (c->first->prev != NULL)
{
(void) printf("%s c->first->prev != NULL\n",warn);
print_bond(c->first);
print_bond(c->first->prev);
status = NO;
}
if (c->last->next != NULL)
{
(void) printf("%s c->last->next != NULL\n",warn);
print_bond(c->last);
print_bond(c->last->next);
status = NO;
}
for (b = c->first; b != NULL; b = b->next)
{
if (b->next && b->next->start != b->end)
{
(void) printf("%s bond pair (%llu -> %llu) point pointers "
"inconsistent\n",
warn,bond_number(b,intfc),
bond_number(b->next,intfc));
print_bond(b);
print_bond(b->next);
status = NO;
}
if ((b->next && b->next->prev != b) ||
(b->prev && b->prev->next != b) ||
b->next == b || b->prev == b)
{
(void) printf("%s bond pair (%llu -> %llu) link pointers "
"inconsistent\n",
warn,bond_number(b,intfc),
bond_number(b->next,intfc));
print_bond(b);
print_bond(b->next);
return NO; /* this is a potential deadloop, so exit */
}
}
return status;
} /*end check_curve2d*/