linux/crush/crush.h

7  * CRUSH is a pseudo-random data distribution algorithm that
14  *     http://www.ssrc.ucsc.edu/Papers/weil-sc06.pdf
28  * CRUSH uses user-defined "rules" to describe how inputs should be
55 #define CRUSH_CHOOSE_N_MINUS(x)   (-(x))
81  * A bucket is a named container of other items (either devices or
88  *  ------------------------------------------------
104 	__u16 type;      /* non-zero; type=0 is reserved for devices */
107 	__u32 weight;    /* 16-bit fixed point */
122 	__u32 item_weight;  /* 16-bit fixed point; all items equally weighted */
127 	__u32 *item_weights;  /* 16-bit fixed point */
128 	__u32 *sum_weights;   /* 16-bit fixed point.  element i is sum
141 	__u32 *item_weights;   /* 16-bit fixed point */
142 	__u32 *straws;         /* 16-bit fixed point */
148  * CRUSH map includes all buckets, rules, etc.
152 	struct crush_rule **rules;  member
158 	 * are processed in bucket id order, from -1 on down to
159 	 * -max_buckets.