[SCM] Gerris Flow Solver branch, upstream, updated. b3aa46814a06c9cb2912790b23916ffb44f1f203
Stephane Popinet
popinet at users.sf.net
Fri May 15 02:53:24 UTC 2009
The following commit has been merged in the upstream branch:
commit 8771535c3033bfe03598d38e1eae7d4d0ab8f601
Author: Stephane Popinet <popinet at users.sf.net>
Date: Fri Nov 24 14:08:42 2006 +1100
Fixed function inlining mess
darcs-hash:20061124030842-d4795-5fdb7d21181d3e05fd5282ca01092256dad48a8c.gz
diff --git a/src/Makefile.am b/src/Makefile.am
index 2c6a6ab..2d90dc2 100644
--- a/src/Makefile.am
+++ b/src/Makefile.am
@@ -31,7 +31,6 @@ endif
GFS_HDS = \
ftt.h \
- ftt_inline.h \
fluid.h \
variable.h \
output.h \
diff --git a/src/boundary.c b/src/boundary.c
index 8001935..98b7954 100644
--- a/src/boundary.c
+++ b/src/boundary.c
@@ -1376,30 +1376,3 @@ void gfs_box_set_relative_pos (GfsBox * box, GfsBox * reference, FttDirection d)
pos.z += rpos[d].z*size;
gfs_box_set_pos (box, &pos);
}
-
-#ifndef G_CAN_INLINE
-/**
- * gfs_box_domain:
- * @box: a #GfsBox.
- *
- * Returns: the #GfsDomain to which @box belongs or %NULL if @box does not
- * belong to any domain.
- */
-GfsDomain * gfs_box_domain (GfsBox * box)
-{
- GfsDomain * d;
-
- g_return_val_if_fail (box != NULL, NULL);
-
- d = GTS_OBJECT (box)->reserved;
- if (GTS_SLIST_CONTAINEE (box)->containers) {
- GSList * i = GTS_SLIST_CONTAINEE (box)->containers;
-
- while (i->next)
- i = i->next;
- d = i->data;
- }
- g_assert (GFS_IS_DOMAIN (d));
- return d;
-}
-#endif /* not G_CAN_INLINE */
diff --git a/src/boundary.h b/src/boundary.h
index 12a87e1..198b457 100644
--- a/src/boundary.h
+++ b/src/boundary.h
@@ -272,11 +272,8 @@ void gfs_box_set_pos (GfsBox * box,
void gfs_box_set_relative_pos (GfsBox * box,
GfsBox * reference,
FttDirection d);
-G_INLINE_FUNC
-GfsDomain * gfs_box_domain (GfsBox * box);
-#ifdef G_CAN_INLINE
-G_INLINE_FUNC
+static inline
GfsDomain * gfs_box_domain (GfsBox * box)
{
GfsDomain * d;
@@ -293,7 +290,6 @@ GfsDomain * gfs_box_domain (GfsBox * box)
}
return d;
}
-#endif /* G_CAN_INLINE */
/* GfsBoxNotAdapt: Header */
diff --git a/src/ftt.c b/src/ftt.c
index 1a910db..c307e88 100644
--- a/src/ftt.c
+++ b/src/ftt.c
@@ -41,10 +41,6 @@ typedef struct _FttRootCell FttRootCell;
#define FTT_ROOT_CELL(cell) ((FttRootCell *) cell)
-#ifndef G_CAN_INLINE
-# include "ftt_inline.h"
-#endif /* not G_CAN_INLINE */
-
static void oct_new (FttCell * parent,
gboolean check_neighbors,
FttCellInitFunc init,
@@ -2404,22 +2400,6 @@ FttCellTraverse * ftt_cell_traverse_new (FttCell * root,
return t;
}
-#ifndef G_CAN_INLINE
-/**
- * ftt_cell_traverse_next:
- * @t: a #FttCellTraverse.
- *
- * Returns: the next cell to visit or %NULL if all the cells have been
- * visited.
- */
-FttCell * ftt_cell_traverse_next (FttCellTraverse * t)
-{
- g_return_val_if_fail (t != NULL, NULL);
-
- return *(t->current++);
-}
-#endif /* not G_CAN_INLINE */
-
/**
* ftt_cell_traverse_rewind:
* @t: a #FttCellTraverse.
diff --git a/src/ftt.h b/src/ftt.h
index 590b389..6a39ae7 100644
--- a/src/ftt.h
+++ b/src/ftt.h
@@ -235,50 +235,455 @@ FttCell * ftt_cell_new (FttCellInitFunc init,
#else /* 2D or 3D */
# define ftt_cell_dz(c) (1.)
#endif /* 2D or 3D */
-guint ftt_cell_depth (const FttCell * root);
-G_INLINE_FUNC
-gdouble ftt_level_size (guint level);
-G_INLINE_FUNC
-gdouble ftt_cell_size (const FttCell * cell);
-G_INLINE_FUNC
-gdouble ftt_cell_volume (const FttCell * cell);
-G_INLINE_FUNC
-void ftt_cell_children (const FttCell * cell,
- FttCellChildren * children);
-G_INLINE_FUNC
-guint ftt_cell_children_direction (const FttCell * cell,
- FttDirection d,
- FttCellChildren * children);
-G_INLINE_FUNC
-FttCell * ftt_cell_child_corner (const FttCell * cell,
- FttDirection
- d[FTT_DIMENSION]);
-G_INLINE_FUNC
-void ftt_cell_neighbors_not_cached (const FttCell * cell,
- FttCellNeighbors * neighbors);
-G_INLINE_FUNC
-FttCell * ftt_cell_neighbor_not_cached (const FttCell * cell,
- FttDirection d);
-G_INLINE_FUNC
-void ftt_cell_neighbors (const FttCell * cell,
- FttCellNeighbors * neighbors);
-G_INLINE_FUNC
-FttCell * ftt_cell_neighbor (const FttCell * cell,
- FttDirection d);
-G_INLINE_FUNC
-FttCellFace ftt_cell_face (FttCell * cell,
- FttDirection d);
-G_INLINE_FUNC
-FttFaceType ftt_face_type (const FttCellFace * face);
-
-G_INLINE_FUNC
-gboolean ftt_cell_neighbor_is_brother (FttCell * cell,
- FttDirection d);
-
-#ifdef G_CAN_INLINE
-# include "ftt_inline.h"
-#endif /* G_CAN_INLINE */
+/**
+ * ftt_level_size:
+ * @level: a guint.
+ *
+ * Returns: the size of a cell of level @level.
+ */
+static inline
+gdouble ftt_level_size (guint level)
+{
+ gdouble size = 1.;
+
+ while (level) {
+ size /= 2.;
+ level--;
+ }
+
+ return size;
+}
+
+/**
+ * ftt_cell_size:
+ * @cell: a #FttCell.
+ *
+ * Returns: the size of @cell.
+ */
+static inline
+gdouble ftt_cell_size (const FttCell * cell)
+{
+ g_return_val_if_fail (cell != NULL, 0.);
+
+ return ftt_level_size (ftt_cell_level (cell));
+}
+
+/**
+ * ftt_cell_volume:
+ * @cell: a #FttCell.
+ *
+ * Returns: the volume (area in 2D) of @cell.
+ */
+static inline
+gdouble ftt_cell_volume (const FttCell * cell)
+{
+ gdouble size;
+
+ g_return_val_if_fail (cell != NULL, 0.);
+
+ size = ftt_level_size (ftt_cell_level (cell));
+#if (FTT_2D || FTT_2D3)
+ return size*size;
+#else /* FTT_3D */
+ return size*size*size;
+#endif /* FTT_3D */
+}
+
+/**
+ * ftt_cell_children:
+ * @cell: a #FttCell.
+ * @children: a #FttCellChildren.
+ *
+ * Fills @children with the children of @cell.
+ *
+ * This function fails if @cell is a leaf.
+ */
+static inline
+void ftt_cell_children (const FttCell * cell,
+ FttCellChildren * children)
+{
+ struct _FttOct * oct;
+ guint i;
+
+ g_return_if_fail (cell != NULL);
+ g_return_if_fail (!FTT_CELL_IS_LEAF (cell));
+ g_return_if_fail (children != NULL);
+
+ oct = cell->children;
+ for (i = 0; i < FTT_CELLS; i++)
+ children->c[i] = FTT_CELL_IS_DESTROYED (&(oct->cell[i])) ?
+ NULL : &(oct->cell[i]);
+}
+
+/**
+ * ftt_cell_children_direction:
+ * @cell: a #FttCell.
+ * @d: a direction.
+ * @children: a #FttCellChildren.
+ *
+ * Fills @children with the children (2 in 2D, 4 in 3D, 2 or 4 in 2D3)
+ * of @cell in direction @d.
+ *
+ * This function fails if @cell is a leaf.
+ *
+ * Returns: the number of children in direction @d.
+ */
+static inline
+guint ftt_cell_children_direction (const FttCell * cell,
+ FttDirection d,
+ FttCellChildren * children)
+{
+ struct _FttOct * oct;
+ guint i;
+#if (FTT_2D || FTT_2D3)
+ static gint index[FTT_NEIGHBORS_2D][FTT_CELLS/2] =
+ {{1, 3},
+ {0, 2},
+ {0, 1},
+ {2, 3}};
+#else /* FTT_3D */
+ static gint index[FTT_NEIGHBORS][FTT_CELLS/2] =
+ {{1, 3, 5, 7},
+ {0, 2, 4, 6},
+ {0, 1, 4, 5},
+ {2, 3, 6, 7},
+ {0, 1, 2, 3},
+ {4, 5, 6, 7}};
+#endif /* FTT_3D */
+
+ g_return_val_if_fail (cell != NULL, 0);
+ g_return_val_if_fail (!FTT_CELL_IS_LEAF (cell), 0);
+ g_return_val_if_fail (d < FTT_NEIGHBORS, 0);
+ g_return_val_if_fail (children != NULL, 0);
+
+ oct = cell->children;
+
+#if FTT_2D3
+ if (d >= FTT_NEIGHBORS_2D) {
+ for (i = 0; i < FTT_CELLS; i++)
+ children->c[i] = FTT_CELL_IS_DESTROYED (&(oct->cell[i])) ? NULL : &(oct->cell[i]);
+ return FTT_CELLS;
+ }
+#endif /* 2D3 */
+
+ for (i = 0; i < FTT_CELLS/2; i++)
+ children->c[i] = FTT_CELL_IS_DESTROYED (&(oct->cell[index[d][i]])) ?
+ NULL : &(oct->cell[index[d][i]]);
+ return FTT_CELLS/2;
+}
+
+/**
+ * ftt_cell_child_corner:
+ * @cell: a #FttCell.
+ * @d: a set of perpendicular directions.
+ *
+ * This function fails if @cell is a leaf.
+ *
+ * Returns: the children of @cell in the corner defined by directions @d.
+ */
+static inline
+FttCell * ftt_cell_child_corner (const FttCell * cell,
+ FttDirection d[FTT_DIMENSION])
+{
+#if (FTT_2D || FTT_2D3)
+ static gint index[FTT_NEIGHBORS_2D][FTT_NEIGHBORS_2D] = {
+ {-1,-1,1,3},
+ {-1,-1,0,2},
+ {1,0,-1,-1},
+ {3,2,-1,-1}
+ };
+ gint i;
+
+ g_return_val_if_fail (cell != NULL, NULL);
+ g_return_val_if_fail (!FTT_CELL_IS_LEAF (cell), NULL);
+
+ g_return_val_if_fail (d[0] < FTT_NEIGHBORS, NULL);
+ g_return_val_if_fail (d[1] < FTT_NEIGHBORS, NULL);
+
+# if FTT_2D3
+ if (d[0] >= FTT_NEIGHBORS_2D)
+ i = index[d[1]][d[2]];
+ else if (d[1] >= FTT_NEIGHBORS_2D)
+ i = index[d[0]][d[2]];
+ else
+# endif
+ i = index[d[0]][d[1]];
+#else /* FTT_3D */
+ static gint index[FTT_NEIGHBORS][FTT_NEIGHBORS][FTT_NEIGHBORS] = {
+ {{-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1},
+ {-1,-1,-1,-1,1,5},{-1,-1,-1,-1,3,7},
+ {-1,-1,1,3,-1,-1},{-1,-1,5,7,-1,-1}},
+ {{-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1},
+ {-1,-1,-1,-1,0,4},{-1,-1,-1,-1,2,6},
+ {-1,-1,0,2,-1,-1},{-1,-1,4,6,-1,-1}},
+ {{-1,-1,-1,-1,1,5},{-1,-1,-1,-1,0,4},
+ {-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1},
+ {1,0,-1,-1,-1,-1},{5,4,-1,-1,-1,-1}},
+ {{-1,-1,-1,-1,3,7},{-1,-1,-1,-1,2,6},
+ {-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1},
+ {3,2,-1,-1,-1,-1},{7,6,-1,-1,-1,-1}},
+ {{-1,-1,1,3,-1,-1},{-1,-1,0,2,-1,-1},
+ {1,0,-1,-1,-1,-1},{3,2,-1,-1,-1,-1},
+ {-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1}},
+ {{-1,-1,5,7,-1,-1},{-1,-1,4,6,-1,-1},
+ {5,4,-1,-1,-1,-1},{7,6,-1,-1,-1,-1},
+ {-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1}},
+ };
+ gint i;
+
+ g_return_val_if_fail (cell != NULL, NULL);
+ g_return_val_if_fail (!FTT_CELL_IS_LEAF (cell), NULL);
+ g_return_val_if_fail (d[0] < FTT_NEIGHBORS, NULL);
+ g_return_val_if_fail (d[1] < FTT_NEIGHBORS, NULL);
+ g_return_val_if_fail (d[2] < FTT_NEIGHBORS, NULL);
+
+ i = index[d[0]][d[1]][d[2]];
+#endif /* FTT_3D */
+
+ g_return_val_if_fail (i >= 0, NULL);
+
+ return FTT_CELL_IS_DESTROYED (&(cell->children->cell[i])) ? NULL:
+ &(cell->children->cell[i]);
+}
+
+/**
+ * ftt_cell_neighbors_not_cached:
+ * @cell: a #FttCell.
+ * @neighbors: a #FttCellNeighbors.
+ *
+ * Fills @neighbors with the neighbors of @cell (does not use saved
+ * values even if available).
+ */
+static inline
+void ftt_cell_neighbors_not_cached (const FttCell * cell,
+ FttCellNeighbors * neighbors)
+{
+ static gint neighbor_index[FTT_NEIGHBORS][FTT_CELLS]
+#if FTT_2D
+ = {{1,-1,3,-3},
+ {-2,0,-4,2},
+ {-3,-4,0,1},
+ {2,3,-1,-2}};
+#elif FTT_2D3
+ = {{1,-1,3,-3},
+ {-2,0,-4,2},
+ {-3,-4,0,1},
+ {2,3,-1,-2},
+ {-1,-2,-3,-4},
+ {-1,-2,-3,-4}};
+#else /* FTT_3D */
+ = {{1,-1,3,-3,5,-5,7,-7},
+ {-2,0,-4,2,-6,4,-8,6},
+ {-3,-4,0,1,-7,-8,4,5},
+ {2,3,-1,-2,6,7,-5,-6},
+ {-5,-6,-7,-8,0,1,2,3},
+ {4,5,6,7,-1,-2,-3,-4}};
+#endif /* FTT_3D */
+ guint n, d;
+ struct _FttOct * parent;
+
+ g_return_if_fail (cell != NULL);
+ g_return_if_fail (neighbors != NULL);
+
+ if (FTT_CELL_IS_ROOT (cell)) {
+ memcpy (neighbors, &((struct _FttRootCell *) cell)->neighbors,
+ sizeof (FttCellNeighbors));
+ return;
+ }
+
+ parent = cell->parent;
+ n = FTT_CELL_ID (cell);
+ for (d = 0; d < FTT_NEIGHBORS; d++) {
+ gint nn = neighbor_index[d][n];
+ FttCell * c;
+
+ if (nn >= 0) /* neighbor belongs to same Oct */
+ c = &(parent->cell[nn]);
+ else { /* neighbor belongs to neighboring Cell or Oct */
+ c = parent->neighbors.c[d];
+ if (c != NULL && c->children != NULL)
+ c = &(c->children->cell[- nn - 1]);
+ }
+ if (c == NULL || FTT_CELL_IS_DESTROYED (c))
+ neighbors->c[d] = NULL;
+ else
+ neighbors->c[d] = c;
+ }
+}
+
+/**
+ * ftt_cell_neighbor_not_cached:
+ * @cell: a #FttCell.
+ * @d: a direction.
+ *
+ * Returns: the neighbor of @cell in direction @d or %NULL if @cell
+ * has no neighbor in this direction (does not use saved values even
+ * if available).
+ */
+static inline
+FttCell * ftt_cell_neighbor_not_cached (const FttCell * cell,
+ FttDirection d)
+{
+ static gint neighbor_index[FTT_NEIGHBORS][FTT_CELLS]
+#if FTT_2D
+ = {{1,-1,3,-3},
+ {-2,0,-4,2},
+ {-3,-4,0,1},
+ {2,3,-1,-2}};
+#elif FTT_2D3
+ = {{1,-1,3,-3},
+ {-2,0,-4,2},
+ {-3,-4,0,1},
+ {2,3,-1,-2},
+ {-1,-2,-3,-4},
+ {-1,-2,-3,-4}};
+#else /* FTT_3D */
+ = {{1,-1,3,-3,5,-5,7,-7},
+ {-2,0,-4,2,-6,4,-8,6},
+ {-3,-4,0,1,-7,-8,4,5},
+ {2,3,-1,-2,6,7,-5,-6},
+ {-5,-6,-7,-8,0,1,2,3},
+ {4,5,6,7,-1,-2,-3,-4}};
+#endif /* FTT_3D */
+ gint n;
+ FttCell * c;
+
+ g_return_val_if_fail (cell != NULL, NULL);
+ g_return_val_if_fail (d < FTT_NEIGHBORS, NULL);
+
+ if (FTT_CELL_IS_ROOT (cell))
+ return ((struct _FttRootCell *) cell)->neighbors.c[d];
+
+ n = neighbor_index[d][FTT_CELL_ID (cell)];
+ if (n >= 0) /* neighbor belongs to same Oct */
+ c = &(cell->parent->cell[n]);
+ else { /* neighbor belongs to neighboring Cell or Oct */
+ c = cell->parent->neighbors.c[d];
+ if (c != NULL && c->children != NULL)
+ c = &(c->children->cell[- n - 1]);
+ }
+ if (c == NULL || FTT_CELL_IS_DESTROYED (c))
+ return NULL;
+ else
+ return c;
+}
+
+/**
+ * ftt_cell_neighbors:
+ * @cell: a #FttCell.
+ * @neighbors: a #FttCellNeighbors.
+ *
+ * Fills @neighbors with the neighbors of @cell.
+ */
+static inline
+void ftt_cell_neighbors (const FttCell * cell,
+ FttCellNeighbors * neighbors)
+{
+ g_return_if_fail (cell != NULL);
+ g_return_if_fail (neighbors != NULL);
+
+ if (!FTT_CELL_IS_LEAF (cell) && neighbors != &cell->children->neighbors) {
+ memcpy (neighbors, &cell->children->neighbors, sizeof (FttCellNeighbors));
+ return;
+ }
+
+ ftt_cell_neighbors_not_cached (cell, neighbors);
+}
+
+/**
+ * ftt_cell_neighbor:
+ * @cell: a #FttCell.
+ * @d: a direction.
+ *
+ * Returns: the neighbor of @cell in direction @d or %NULL if @cell
+ * has no neighbor in this direction.
+ */
+static inline
+FttCell * ftt_cell_neighbor (const FttCell * cell,
+ FttDirection d)
+{
+ g_return_val_if_fail (cell != NULL, NULL);
+ g_return_val_if_fail (d < FTT_NEIGHBORS, NULL);
+
+ if (!FTT_CELL_IS_LEAF (cell))
+ return cell->children->neighbors.c[d];
+
+ return ftt_cell_neighbor_not_cached (cell, d);
+}
+
+/**
+ * ftt_cell_face:
+ * @cell: a #FttCell.
+ * @d: a direction.
+ *
+ * Returns: the face of @cell in direction @d.
+ */
+static inline
+FttCellFace ftt_cell_face (FttCell * cell,
+ FttDirection d)
+{
+ FttCellFace f;
+
+ g_return_val_if_fail (cell != NULL, f);
+
+ f.cell = cell;
+ f.neighbor = ftt_cell_neighbor (cell, d);
+ f.d = d;
+
+ return f;
+}
+
+/**
+ * ftt_face_type:
+ * @face: a #FttCellFace.
+ *
+ * Returns: the type of @face.
+ */
+static inline
+FttFaceType ftt_face_type (const FttCellFace * face)
+{
+ g_return_val_if_fail (face != NULL, 0);
+
+ if (face->neighbor == NULL)
+ return FTT_BOUNDARY;
+ if (ftt_cell_level (face->cell) > ftt_cell_level (face->neighbor))
+ return FTT_FINE_COARSE;
+ g_assert (ftt_cell_level (face->cell) == ftt_cell_level (face->neighbor));
+ return FTT_FINE_FINE;
+}
+
+/**
+ * ftt_cell_neighbor_is_brother:
+ * @cell: a #FttCell.
+ * @d: a #FttDirection.
+ *
+ * Returns: %TRUE if a (potential) neighbor of @cell in direction @d
+ * and @cell would have the same parent, %FALSE otherwise.
+ */
+static inline
+gboolean ftt_cell_neighbor_is_brother (FttCell * cell,
+ FttDirection d)
+{
+ static gboolean b[FTT_CELLS][FTT_NEIGHBORS] = {
+#if FTT_2D
+ {1,0,0,1}, {0,1,0,1}, {1,0,1,0}, {0,1,1,0}
+#elif FTT_2D3
+ {1,0,0,1,0,0}, {0,1,0,1,0,0}, {1,0,1,0,0,0}, {0,1,1,0,0,0}
+#else /* 3D */
+ {1,0,0,1,0,1}, {0,1,0,1,0,1}, {1,0,1,0,0,1}, {0,1,1,0,0,1},
+ {1,0,0,1,1,0}, {0,1,0,1,1,0}, {1,0,1,0,1,0}, {0,1,1,0,1,0}
+#endif /* 3D */
+ };
+
+ g_return_val_if_fail (cell != NULL, FALSE);
+
+ if (FTT_CELL_IS_ROOT (cell))
+ return FALSE;
+ return b[FTT_CELL_ID (cell)][d];
+}
+
+guint ftt_cell_depth (const FttCell * root);
void ftt_cell_set_neighbor (FttCell * root,
FttCell * neighbor,
FttDirection d,
@@ -452,18 +857,14 @@ FttCellTraverse * ftt_cell_traverse_new (FttCell * root,
gint max_depth);
void ftt_cell_traverse_rewind (FttCellTraverse * t);
void ftt_cell_traverse_destroy (FttCellTraverse * t);
-G_INLINE_FUNC
-FttCell * ftt_cell_traverse_next (FttCellTraverse * t);
-#ifdef G_CAN_INLINE
-G_INLINE_FUNC
+static inline
FttCell * ftt_cell_traverse_next (FttCellTraverse * t)
{
g_return_val_if_fail (t != NULL, NULL);
return *(t->current++);
}
-#endif /* G_CAN_INLINE */
#ifdef __cplusplus
}
diff --git a/src/ftt_inline.h b/src/ftt_inline.h
deleted file mode 100644
index 6aa50bb..0000000
--- a/src/ftt_inline.h
+++ /dev/null
@@ -1,446 +0,0 @@
-/**
- * ftt_level_size:
- * @level: a guint.
- *
- * Returns: the size of a cell of level @level.
- */
-G_INLINE_FUNC
-gdouble ftt_level_size (guint level)
-{
- gdouble size = 1.;
-
- while (level) {
- size /= 2.;
- level--;
- }
-
- return size;
-}
-
-/**
- * ftt_cell_size:
- * @cell: a #FttCell.
- *
- * Returns: the size of @cell.
- */
-G_INLINE_FUNC
-gdouble ftt_cell_size (const FttCell * cell)
-{
- g_return_val_if_fail (cell != NULL, 0.);
-
- return ftt_level_size (ftt_cell_level (cell));
-}
-
-/**
- * ftt_cell_volume:
- * @cell: a #FttCell.
- *
- * Returns: the volume (area in 2D) of @cell.
- */
-G_INLINE_FUNC
-gdouble ftt_cell_volume (const FttCell * cell)
-{
- gdouble size;
-
- g_return_val_if_fail (cell != NULL, 0.);
-
- size = ftt_level_size (ftt_cell_level (cell));
-#if (FTT_2D || FTT_2D3)
- return size*size;
-#else /* FTT_3D */
- return size*size*size;
-#endif /* FTT_3D */
-}
-
-/**
- * ftt_cell_children:
- * @cell: a #FttCell.
- * @children: a #FttCellChildren.
- *
- * Fills @children with the children of @cell.
- *
- * This function fails if @cell is a leaf.
- */
-G_INLINE_FUNC
-void ftt_cell_children (const FttCell * cell,
- FttCellChildren * children)
-{
- struct _FttOct * oct;
- guint i;
-
- g_return_if_fail (cell != NULL);
- g_return_if_fail (!FTT_CELL_IS_LEAF (cell));
- g_return_if_fail (children != NULL);
-
- oct = cell->children;
- for (i = 0; i < FTT_CELLS; i++)
- children->c[i] = FTT_CELL_IS_DESTROYED (&(oct->cell[i])) ?
- NULL : &(oct->cell[i]);
-}
-
-/**
- * ftt_cell_children_direction:
- * @cell: a #FttCell.
- * @d: a direction.
- * @children: a #FttCellChildren.
- *
- * Fills @children with the children (2 in 2D, 4 in 3D, 2 or 4 in 2D3)
- * of @cell in direction @d.
- *
- * This function fails if @cell is a leaf.
- *
- * Returns: the number of children in direction @d.
- */
-G_INLINE_FUNC
-guint ftt_cell_children_direction (const FttCell * cell,
- FttDirection d,
- FttCellChildren * children)
-{
- struct _FttOct * oct;
- guint i;
-#if (FTT_2D || FTT_2D3)
- static gint index[FTT_NEIGHBORS_2D][FTT_CELLS/2] =
- {{1, 3},
- {0, 2},
- {0, 1},
- {2, 3}};
-#else /* FTT_3D */
- static gint index[FTT_NEIGHBORS][FTT_CELLS/2] =
- {{1, 3, 5, 7},
- {0, 2, 4, 6},
- {0, 1, 4, 5},
- {2, 3, 6, 7},
- {0, 1, 2, 3},
- {4, 5, 6, 7}};
-#endif /* FTT_3D */
-
- g_return_val_if_fail (cell != NULL, 0);
- g_return_val_if_fail (!FTT_CELL_IS_LEAF (cell), 0);
- g_return_val_if_fail (d < FTT_NEIGHBORS, 0);
- g_return_val_if_fail (children != NULL, 0);
-
- oct = cell->children;
-
-#if FTT_2D3
- if (d >= FTT_NEIGHBORS_2D) {
- for (i = 0; i < FTT_CELLS; i++)
- children->c[i] = FTT_CELL_IS_DESTROYED (&(oct->cell[i])) ? NULL : &(oct->cell[i]);
- return FTT_CELLS;
- }
-#endif /* 2D3 */
-
- for (i = 0; i < FTT_CELLS/2; i++)
- children->c[i] = FTT_CELL_IS_DESTROYED (&(oct->cell[index[d][i]])) ?
- NULL : &(oct->cell[index[d][i]]);
- return FTT_CELLS/2;
-}
-
-/**
- * ftt_cell_child_corner:
- * @cell: a #FttCell.
- * @d: a set of perpendicular directions.
- *
- * This function fails if @cell is a leaf.
- *
- * Returns: the children of @cell in the corner defined by directions @d.
- */
-G_INLINE_FUNC
-FttCell * ftt_cell_child_corner (const FttCell * cell,
- FttDirection d[FTT_DIMENSION])
-{
-#if (FTT_2D || FTT_2D3)
- static gint index[FTT_NEIGHBORS_2D][FTT_NEIGHBORS_2D] = {
- {-1,-1,1,3},
- {-1,-1,0,2},
- {1,0,-1,-1},
- {3,2,-1,-1}
- };
- gint i;
-
- g_return_val_if_fail (cell != NULL, NULL);
- g_return_val_if_fail (!FTT_CELL_IS_LEAF (cell), NULL);
-
- g_return_val_if_fail (d[0] < FTT_NEIGHBORS, NULL);
- g_return_val_if_fail (d[1] < FTT_NEIGHBORS, NULL);
-
-# if FTT_2D3
- if (d[0] >= FTT_NEIGHBORS_2D)
- i = index[d[1]][d[2]];
- else if (d[1] >= FTT_NEIGHBORS_2D)
- i = index[d[0]][d[2]];
- else
-# endif
- i = index[d[0]][d[1]];
-#else /* FTT_3D */
- static gint index[FTT_NEIGHBORS][FTT_NEIGHBORS][FTT_NEIGHBORS] = {
- {{-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1},
- {-1,-1,-1,-1,1,5},{-1,-1,-1,-1,3,7},
- {-1,-1,1,3,-1,-1},{-1,-1,5,7,-1,-1}},
- {{-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1},
- {-1,-1,-1,-1,0,4},{-1,-1,-1,-1,2,6},
- {-1,-1,0,2,-1,-1},{-1,-1,4,6,-1,-1}},
- {{-1,-1,-1,-1,1,5},{-1,-1,-1,-1,0,4},
- {-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1},
- {1,0,-1,-1,-1,-1},{5,4,-1,-1,-1,-1}},
- {{-1,-1,-1,-1,3,7},{-1,-1,-1,-1,2,6},
- {-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1},
- {3,2,-1,-1,-1,-1},{7,6,-1,-1,-1,-1}},
- {{-1,-1,1,3,-1,-1},{-1,-1,0,2,-1,-1},
- {1,0,-1,-1,-1,-1},{3,2,-1,-1,-1,-1},
- {-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1}},
- {{-1,-1,5,7,-1,-1},{-1,-1,4,6,-1,-1},
- {5,4,-1,-1,-1,-1},{7,6,-1,-1,-1,-1},
- {-1,-1,-1,-1,-1,-1},{-1,-1,-1,-1,-1,-1}},
- };
- gint i;
-
- g_return_val_if_fail (cell != NULL, NULL);
- g_return_val_if_fail (!FTT_CELL_IS_LEAF (cell), NULL);
- g_return_val_if_fail (d[0] < FTT_NEIGHBORS, NULL);
- g_return_val_if_fail (d[1] < FTT_NEIGHBORS, NULL);
- g_return_val_if_fail (d[2] < FTT_NEIGHBORS, NULL);
-
- i = index[d[0]][d[1]][d[2]];
-#endif /* FTT_3D */
-
- g_return_val_if_fail (i >= 0, NULL);
-
- return FTT_CELL_IS_DESTROYED (&(cell->children->cell[i])) ? NULL:
- &(cell->children->cell[i]);
-}
-
-/**
- * ftt_cell_neighbors_not_cached:
- * @cell: a #FttCell.
- * @neighbors: a #FttCellNeighbors.
- *
- * Fills @neighbors with the neighbors of @cell (does not use saved
- * values even if available).
- */
-G_INLINE_FUNC
-void ftt_cell_neighbors_not_cached (const FttCell * cell,
- FttCellNeighbors * neighbors)
-{
- static gint neighbor_index[FTT_NEIGHBORS][FTT_CELLS]
-#if FTT_2D
- = {{1,-1,3,-3},
- {-2,0,-4,2},
- {-3,-4,0,1},
- {2,3,-1,-2}};
-#elif FTT_2D3
- = {{1,-1,3,-3},
- {-2,0,-4,2},
- {-3,-4,0,1},
- {2,3,-1,-2},
- {-1,-2,-3,-4},
- {-1,-2,-3,-4}};
-#else /* FTT_3D */
- = {{1,-1,3,-3,5,-5,7,-7},
- {-2,0,-4,2,-6,4,-8,6},
- {-3,-4,0,1,-7,-8,4,5},
- {2,3,-1,-2,6,7,-5,-6},
- {-5,-6,-7,-8,0,1,2,3},
- {4,5,6,7,-1,-2,-3,-4}};
-#endif /* FTT_3D */
- guint n, d;
- struct _FttOct * parent;
-
- g_return_if_fail (cell != NULL);
- g_return_if_fail (neighbors != NULL);
-
- if (FTT_CELL_IS_ROOT (cell)) {
- memcpy (neighbors, &((struct _FttRootCell *) cell)->neighbors,
- sizeof (FttCellNeighbors));
- return;
- }
-
- parent = cell->parent;
- n = FTT_CELL_ID (cell);
- for (d = 0; d < FTT_NEIGHBORS; d++) {
- gint nn = neighbor_index[d][n];
- FttCell * c;
-
- if (nn >= 0) /* neighbor belongs to same Oct */
- c = &(parent->cell[nn]);
- else { /* neighbor belongs to neighboring Cell or Oct */
- c = parent->neighbors.c[d];
- if (c != NULL && c->children != NULL)
- c = &(c->children->cell[- nn - 1]);
- }
- if (c == NULL || FTT_CELL_IS_DESTROYED (c))
- neighbors->c[d] = NULL;
- else
- neighbors->c[d] = c;
- }
-}
-
-/**
- * ftt_cell_neighbor_not_cached:
- * @cell: a #FttCell.
- * @d: a direction.
- *
- * Returns: the neighbor of @cell in direction @d or %NULL if @cell
- * has no neighbor in this direction (does not use saved values even
- * if available).
- */
-G_INLINE_FUNC
-FttCell * ftt_cell_neighbor_not_cached (const FttCell * cell,
- FttDirection d)
-{
- static gint neighbor_index[FTT_NEIGHBORS][FTT_CELLS]
-#if FTT_2D
- = {{1,-1,3,-3},
- {-2,0,-4,2},
- {-3,-4,0,1},
- {2,3,-1,-2}};
-#elif FTT_2D3
- = {{1,-1,3,-3},
- {-2,0,-4,2},
- {-3,-4,0,1},
- {2,3,-1,-2},
- {-1,-2,-3,-4},
- {-1,-2,-3,-4}};
-#else /* FTT_3D */
- = {{1,-1,3,-3,5,-5,7,-7},
- {-2,0,-4,2,-6,4,-8,6},
- {-3,-4,0,1,-7,-8,4,5},
- {2,3,-1,-2,6,7,-5,-6},
- {-5,-6,-7,-8,0,1,2,3},
- {4,5,6,7,-1,-2,-3,-4}};
-#endif /* FTT_3D */
- gint n;
- FttCell * c;
-
- g_return_val_if_fail (cell != NULL, NULL);
- g_return_val_if_fail (d < FTT_NEIGHBORS, NULL);
-
- if (FTT_CELL_IS_ROOT (cell))
- return ((struct _FttRootCell *) cell)->neighbors.c[d];
-
- n = neighbor_index[d][FTT_CELL_ID (cell)];
- if (n >= 0) /* neighbor belongs to same Oct */
- c = &(cell->parent->cell[n]);
- else { /* neighbor belongs to neighboring Cell or Oct */
- c = cell->parent->neighbors.c[d];
- if (c != NULL && c->children != NULL)
- c = &(c->children->cell[- n - 1]);
- }
- if (c == NULL || FTT_CELL_IS_DESTROYED (c))
- return NULL;
- else
- return c;
-}
-
-/**
- * ftt_cell_neighbors:
- * @cell: a #FttCell.
- * @neighbors: a #FttCellNeighbors.
- *
- * Fills @neighbors with the neighbors of @cell.
- */
-G_INLINE_FUNC
-void ftt_cell_neighbors (const FttCell * cell,
- FttCellNeighbors * neighbors)
-{
- g_return_if_fail (cell != NULL);
- g_return_if_fail (neighbors != NULL);
-
- if (!FTT_CELL_IS_LEAF (cell) && neighbors != &cell->children->neighbors) {
- memcpy (neighbors, &cell->children->neighbors, sizeof (FttCellNeighbors));
- return;
- }
-
- ftt_cell_neighbors_not_cached (cell, neighbors);
-}
-
-/**
- * ftt_cell_neighbor:
- * @cell: a #FttCell.
- * @d: a direction.
- *
- * Returns: the neighbor of @cell in direction @d or %NULL if @cell
- * has no neighbor in this direction.
- */
-G_INLINE_FUNC
-FttCell * ftt_cell_neighbor (const FttCell * cell,
- FttDirection d)
-{
- g_return_val_if_fail (cell != NULL, NULL);
- g_return_val_if_fail (d < FTT_NEIGHBORS, NULL);
-
- if (!FTT_CELL_IS_LEAF (cell))
- return cell->children->neighbors.c[d];
-
- return ftt_cell_neighbor_not_cached (cell, d);
-}
-
-/**
- * ftt_cell_face:
- * @cell: a #FttCell.
- * @d: a direction.
- *
- * Returns: the face of @cell in direction @d.
- */
-G_INLINE_FUNC
-FttCellFace ftt_cell_face (FttCell * cell,
- FttDirection d)
-{
- FttCellFace f;
-
- g_return_val_if_fail (cell != NULL, f);
-
- f.cell = cell;
- f.neighbor = ftt_cell_neighbor (cell, d);
- f.d = d;
-
- return f;
-}
-
-/**
- * ftt_face_type:
- * @face: a #FttCellFace.
- *
- * Returns: the type of @face.
- */
-G_INLINE_FUNC
-FttFaceType ftt_face_type (const FttCellFace * face)
-{
- g_return_val_if_fail (face != NULL, 0);
-
- if (face->neighbor == NULL)
- return FTT_BOUNDARY;
- if (ftt_cell_level (face->cell) > ftt_cell_level (face->neighbor))
- return FTT_FINE_COARSE;
- g_assert (ftt_cell_level (face->cell) == ftt_cell_level (face->neighbor));
- return FTT_FINE_FINE;
-}
-
-/**
- * ftt_cell_neighbor_is_brother:
- * @cell: a #FttCell.
- * @d: a #FttDirection.
- *
- * Returns: %TRUE if a (potential) neighbor of @cell in direction @d
- * and @cell would have the same parent, %FALSE otherwise.
- */
-G_INLINE_FUNC
-gboolean ftt_cell_neighbor_is_brother (FttCell * cell,
- FttDirection d)
-{
- static gboolean b[FTT_CELLS][FTT_NEIGHBORS] = {
-#if FTT_2D
- {1,0,0,1}, {0,1,0,1}, {1,0,1,0}, {0,1,1,0}
-#elif FTT_2D3
- {1,0,0,1,0,0}, {0,1,0,1,0,0}, {1,0,1,0,0,0}, {0,1,1,0,0,0}
-#else /* 3D */
- {1,0,0,1,0,1}, {0,1,0,1,0,1}, {1,0,1,0,0,1}, {0,1,1,0,0,1},
- {1,0,0,1,1,0}, {0,1,0,1,1,0}, {1,0,1,0,1,0}, {0,1,1,0,1,0}
-#endif /* 3D */
- };
-
- g_return_val_if_fail (cell != NULL, FALSE);
-
- if (FTT_CELL_IS_ROOT (cell))
- return FALSE;
- return b[FTT_CELL_ID (cell)][d];
-}
--
Gerris Flow Solver
More information about the debian-science-commits
mailing list