crush: cleanup

diff --git a/src/crush/crush.h b/src/crush/crush.h
index 1d89bfde4778e74b783efbf441b2de86d1751e86..9ac7e091126f29f21913762e2dd0362b811afe53 100644 (file)
--- a/src/crush/crush.h
+++ b/src/crush/crush.h
@@ -17,11 +17,11 @@
  */
 
 
-#define CRUSH_MAGIC 0x00010000ul
+#define CRUSH_MAGIC 0x00010000ul   /* for detecting algorithm revisions */
 
 
-#define CRUSH_MAX_DEPTH 10
-#define CRUSH_MAX_SET   10
+#define CRUSH_MAX_DEPTH 10  /* max crush hierarchy depth */
+#define CRUSH_MAX_SET   10  /* max size of a mapping result */
 
 
 /*

diff --git a/src/crush/mapper.h b/src/crush/mapper.h
index 9ca9cd5d9f2f9610122e91fb3636989bc007491b..98e90046fd9f89a07835647ac3f845429ebe90fc 100644 (file)
--- a/src/crush/mapper.h
+++ b/src/crush/mapper.h
@@ -1,19 +1,20 @@
 #ifndef _CRUSH_MAPPER_H
 #define _CRUSH_MAPPER_H
 
-#include "crush.h"
-
 /*
  * CRUSH functions for find rules and then mapping an input to an
  * output set.
  *
  * LGPL2
  */
+
+#include "crush.h"
+
 extern int crush_find_rule(struct crush_map *map, int pool, int type, int size);
 extern int crush_do_rule(struct crush_map *map,
                         int ruleno,
                         int x, int *result, int result_max,
-                        int forcefeed,
-                        __u32 *weights); /* -1 for none */
+                        int forcefeed,    /* -1 for none */
+                        __u32 *weights);
 
 #endif