crush: comments

diff --git a/src/crush/mapper.c b/src/crush/mapper.c
index 8dfe212e65a1864083d4294597e901607063cf3a..a4b37fe8796acbb570830aa2ff3e3e5c26e2256d 100644 (file)
--- a/src/crush/mapper.c
+++ b/src/crush/mapper.c
@@ -21,6 +21,9 @@
 #include "crush.h"
 #include "hash.h"
 
+/*
+ * Implement the core CRUSH mapping algorithm.
+ */
 
 /**
  * crush_find_rule - find a crush_rule id for a given ruleset, type, and size.

diff --git a/src/kernel/import_patch_set_into_linux_git.sh b/src/kernel/import_patch_set_into_linux_git.sh
index 8bf59a69cb4439e8248db24d1499ae2c25c877cb..90b62c184e43d9ce2265f78963bb5bf673613f0b 100755 (executable)
--- a/src/kernel/import_patch_set_into_linux_git.sh
+++ b/src/kernel/import_patch_set_into_linux_git.sh
@@ -206,13 +206,14 @@ git add $target/ceph/crush/hash.h
 git commit -s -F - <<EOF
 ceph: CRUSH mapping algorithm
 
-CRUSH is a fancy hash function designed to map inputs onto a dynamic
-hierarchy of devices while minimizing the extent to which inputs are
-remapped when the devices are added or removed.  It includes some
-features that are specifically useful for storage, most notably the
-ability to map each input onto a set of N devices that are separated
-across administrator-defined failure domains.  CRUSH is used to
-distribute data across the cluster of Ceph storage nodes.
+CRUSH is a pseudorandom data distribution function designed to map
+inputs onto a dynamic hierarchy of devices, while minimizing the
+extent to which inputs are remapped when the devices are added or
+removed.  It includes some features that are specifically useful for
+storage, most notably the ability to map each input onto a set of N
+devices that are separated across administrator-defined failure
+domains.  CRUSH is used to distribute data across the cluster of Ceph
+storage nodes.
 
 More information about CRUSH can be found in this paper: