int
check_balance_seeds (p4est_quadrant_t * q, p4est_quadrant_t * p,
p4est_connect_type_t b, sc_array_t * seeds)
{
int ib;
int level = q->level;
p4est_quadrant_t *s, *t;
sc_array_t *thislevel = sc_array_new (sizeof (p4est_quadrant_t));
sc_array_t *nextlevel = sc_array_new (sizeof (p4est_quadrant_t));
sc_array_t *temparray;
p4est_quadrant_t temp1, temp2;
int f, c;
#ifdef P4_TO_P8
int e;
#endif
int stop = 0;
sc_array_resize (seeds, 0);
s = (p4est_quadrant_t *) sc_array_push (thislevel);
p4est_quadrant_sibling (q, s, 0);
#ifndef P4_TO_P8
if (b == P4EST_CONNECT_FACE) {
ib = 0;
}
else {
ib = 1;
}
#else
if (b == P8EST_CONNECT_FACE) {
ib = 0;
}
else if (b == P8EST_CONNECT_EDGE) {
ib = 1;
}
else {
ib = 2;
}
#endif
while (level > p->level + 1) {
size_t nlast = thislevel->elem_count;
size_t zz;
stop = 0;
for (zz = 0; zz < nlast; zz++) {
s = p4est_quadrant_array_index (thislevel, zz);
P4EST_ASSERT (p4est_quadrant_child_id (s) == 0);
p4est_quadrant_parent (s, &temp1);
for (f = 0; f < P4EST_FACES; f++) {
p4est_quadrant_face_neighbor (&temp1, f, &temp2);
if (is_farther (&temp1, p, &temp2)) {
continue;
}
if (p4est_quadrant_is_ancestor (p, &temp2)) {
stop = 1;
sc_array_resize (seeds, seeds->elem_count + 1);
t = p4est_quadrant_array_index (seeds, seeds->elem_count - 1);
p4est_quadrant_sibling (&temp2, t, 0);
}
else if (p4est_quadrant_is_inside_root (&temp2)) {
t = (p4est_quadrant_t *) sc_array_push (nextlevel);
p4est_quadrant_sibling (&temp2, t, 0);
}
}
if (ib == 0) {
continue;
}
#ifdef P4_TO_P8
for (e = 0; e < P8EST_EDGES; e++) {
p8est_quadrant_edge_neighbor (&temp1, e, &temp2);
if (is_farther (&temp1, p, &temp2)) {
continue;
}
if (p4est_quadrant_is_ancestor (p, &temp2)) {
stop = 1;
sc_array_resize (seeds, seeds->elem_count + 1);
t = p4est_quadrant_array_index (seeds, seeds->elem_count - 1);
p4est_quadrant_sibling (&temp2, t, 0);
}
else if (p4est_quadrant_is_inside_root (&temp2)) {
t = (p4est_quadrant_t *) sc_array_push (nextlevel);
p4est_quadrant_sibling (&temp2, t, 0);
}
}
if (ib == 1) {
continue;
}
#endif
for (c = 0; c < P4EST_CHILDREN; c++) {
p4est_quadrant_corner_neighbor (&temp1, c, &temp2);
if (is_farther (&temp1, p, &temp2)) {
continue;
}
if (p4est_quadrant_is_ancestor (p, &temp2)) {
stop = 1;
sc_array_resize (seeds, seeds->elem_count + 1);
t = p4est_quadrant_array_index (seeds, seeds->elem_count - 1);
p4est_quadrant_sibling (&temp2, t, 0);
}
else if (p4est_quadrant_is_inside_root (&temp2)) {
t = (p4est_quadrant_t *) sc_array_push (nextlevel);
p4est_quadrant_sibling (&temp2, t, 0);
}
}
}
if (stop) {
sc_array_sort (seeds, p4est_quadrant_compare);
sc_array_uniq (seeds, p4est_quadrant_compare);
#ifdef P4_TO_P8
if (!ib && seeds->elem_count == 1) {
sc_array_sort (nextlevel, p4est_quadrant_compare);
sc_array_uniq (nextlevel, p4est_quadrant_compare);
temparray = thislevel;
thislevel = nextlevel;
nextlevel = temparray;
sc_array_reset (nextlevel);
level--;
nlast = thislevel->elem_count;
for (zz = 0; zz < nlast; zz++) {
s = p4est_quadrant_array_index (thislevel, zz);
P4EST_ASSERT (p4est_quadrant_child_id (s) == 0);
p4est_quadrant_parent (s, &temp1);
for (f = 0; f < P4EST_FACES; f++) {
p4est_quadrant_face_neighbor (&temp1, f, &temp2);
if (p4est_quadrant_is_ancestor (p, &temp2)) {
int f2;
p4est_quadrant_t a;
p4est_quadrant_t u;
t = p4est_quadrant_array_index (seeds, 0);
p8est_quadrant_parent (t, &a);
for (f2 = 0; f2 < P8EST_FACES; f2++) {
if (f2 / 2 == f / 2) {
continue;
}
p8est_quadrant_face_neighbor (&a, f2, &u);
if (p8est_quadrant_is_equal (&temp2, &u) ||
p8est_quadrant_is_sibling (&temp2, &u)) {
break;
}
}
if (f2 == P8EST_FACES) {
sc_array_resize (seeds, seeds->elem_count + 1);
t = p4est_quadrant_array_index (seeds, seeds->elem_count - 1);
p4est_quadrant_sibling (&temp2, t, 0);
}
}
}
}
}
#endif
sc_array_sort (seeds, p4est_quadrant_compare);
sc_array_uniq (seeds, p4est_quadrant_compare);
break;
}
sc_array_sort (nextlevel, p4est_quadrant_compare);
sc_array_uniq (nextlevel, p4est_quadrant_compare);
temparray = thislevel;
thislevel = nextlevel;
nextlevel = temparray;
sc_array_reset (nextlevel);
level--;
}
sc_array_destroy (thislevel);
sc_array_destroy (nextlevel);
return stop;
}
void
p8est_quadrant_edge_neighbor_extra (const p4est_quadrant_t * q, p4est_topidx_t
t, int edge, sc_array_t * quads,
sc_array_t * treeids,
p4est_connectivity_t * conn)
{
p4est_quadrant_t temp;
p4est_quadrant_t *qp;
p4est_topidx_t *tp;
int face;
p8est_edge_info_t ei;
p8est_edge_transform_t *et;
sc_array_t *eta;
size_t etree;
eta = &ei.edge_transforms;
P4EST_ASSERT (SC_ARRAY_IS_OWNER (quads));
P4EST_ASSERT (quads->elem_count == 0);
P4EST_ASSERT (quads->elem_size == sizeof (p4est_quadrant_t));
P4EST_ASSERT (SC_ARRAY_IS_OWNER (treeids));
P4EST_ASSERT (treeids->elem_count == 0);
P4EST_ASSERT (treeids->elem_size == sizeof (p4est_topidx_t));
p8est_quadrant_edge_neighbor (q, edge, &temp);
if (p4est_quadrant_is_inside_root (&temp)) {
qp = p4est_quadrant_array_push (quads);
*qp = temp;
tp = (p4est_topidx_t *) sc_array_push (treeids);
*tp = t;
return;
}
if (!p8est_quadrant_is_outside_edge (&temp)) {
qp = p4est_quadrant_array_push (quads);
tp = (p4est_topidx_t *) sc_array_push (treeids);
face = p8est_edge_faces[edge][0];
p4est_quadrant_face_neighbor (q, face, &temp);
if (p4est_quadrant_is_inside_root (&temp)) {
face = p8est_edge_faces[edge][1];
*tp = p8est_quadrant_face_neighbor_extra (&temp, t, face, qp, conn);
if (*tp == -1) {
qp = (p4est_quadrant_t *) sc_array_pop (quads);
tp = (p4est_topidx_t *) sc_array_pop (treeids);
}
return;
}
face = p8est_edge_faces[edge][1];
p4est_quadrant_face_neighbor (q, face, &temp);
P4EST_ASSERT (p4est_quadrant_is_inside_root (&temp));
face = p8est_edge_faces[edge][0];
*tp = p8est_quadrant_face_neighbor_extra (&temp, t, face, qp, conn);
if (*tp == -1) {
qp = (p4est_quadrant_t *) sc_array_pop (quads);
tp = (p4est_topidx_t *) sc_array_pop (treeids);
}
return;
}
sc_array_init (eta, sizeof (p8est_edge_transform_t));
p8est_find_edge_transform (conn, t, edge, &ei);
sc_array_resize (quads, eta->elem_count);
sc_array_resize (treeids, eta->elem_count);
for (etree = 0; etree < eta->elem_count; etree++) {
qp = p4est_quadrant_array_index (quads, etree);
tp = (p4est_topidx_t *) sc_array_index (treeids, etree);
et = p8est_edge_array_index (eta, etree);
p8est_quadrant_transform_edge (&temp, qp, &ei, et, 1);
*tp = et->ntree;
}
sc_array_reset (eta);
}