X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ian/git?p=moebius2.git;a=blobdiff_plain;f=mgraph.h;h=3995d463ed0bda1160791fa997d2da40fde6ea66;hp=46383677d2ec6c153e799d5936329529d3e75de2;hb=2a4bf2376456c0650ffea5d89e4b4cf4763af1ad;hpb=2c2c1cc2745430048709dc3b11aef7071d802c86

diff --git a/mgraph.h b/mgraph.h
index 4638367..3995d46 100644
--- a/mgraph.h
+++ b/mgraph.h
@@ -35,23 +35,19 @@
  *
  * We label edges as follows:
  *
- *			    \0   /1
+ *		e:	    \2   /1
  *			     \  /
  *			  ___ 0   __
- *			  2    1   3
+ *			  3    1   0
  *			     /  \
  *			   4/   5\
- *
- * (This numbering permits the order-4 nodes at the strip's edge
- *  to have a contiguous edge numbering 2..5 or 0..3.)
- *
- * When we iterate over edges, we iterate first over vertices and then
- * over edges 0 to 2, disregarding edges 3 to 5.
  */
 
 #ifndef MGRAPH_H
 #define MGRAPH_H
 
+#include "common.h"
+
 #define XBITS 4
 #define X (1<<XBITS)
 #define YBITS 4
@@ -65,18 +61,17 @@
 #define XMASK (X-1)
 #define YSHIFT XBITS
 #define Y1 (1 << YSHIFT)
-#define YMASK (Y-1 << YSHIFT)
+#define YMASK ((Y-1) << YSHIFT)
+
+#define DIM (N*D3)
 
 #define V6 6
 
 #define FOR_VERTEX(v) \
   for ((v)=0; (v)<N; (v)++)
 
-#define VE_MIN(v) ((v) & YMASK ? 0 : 2)
-#define VE_MAX(v) (~(v) & YMASK ? V6 : 4)
-
 #define FOR_VPEDGE(v,e) \
-  for ((e)=VE_MIN(v); (e)<VE_MAX(v); (e)++)
+  for ((e)=0; (e)<V6; (e)++)
 
 extern int edge_end2(unsigned v1, int e);
 #define EDGE_END2 edge_end2
@@ -85,7 +80,7 @@ extern int edge_end2(unsigned v1, int e);
   FOR_VPEDGE((v1),(e))				\
     if (((v2)= EDGE_END2((v1),(e)),		\
 	 (init),				\
-	 (v2)) < 0) { otherwise } else
+	 (v2)) < 0) { otherwise; } else
 
 #define NOTHING ((void)0)
 
@@ -96,11 +91,6 @@ extern int edge_end2(unsigned v1, int e);
   FOR_VERTEX((v1))				\
     FOR_VEDGE((v1),(e),(v2))
 
-#define FOR_COORD(k) \
-  for ((k)=0; (k)<D3; (k)++)
-
-#define K FOR_COORD(k)
-
 #define FOR_RIM_VERTEX(vy,vx,v)					\
   for ((vy)=0; (vy)<Y; (vy)+=Y-1)				\
     for ((vx)=0; (v)= (vy)<<YSHIFT | (vx), (vx)<X; (vx)++)