out << "\tid " << i << "\n";
switch (crush.get_rule_type(i)) {
- case CEPH_PG_TYPE_REPLICATED:
+ case CRUSH_RULE_TYPE_REPLICATED:
out << "\ttype replicated\n";
break;
- case CEPH_PG_TYPE_ERASURE:
+ case CRUSH_RULE_TYPE_ERASURE:
out << "\ttype erasure\n";
break;
default:
string tname = string_node(i->children[start+2]);
int type;
if (tname == "replicated")
- type = CEPH_PG_TYPE_REPLICATED;
+ type = CRUSH_RULE_TYPE_REPLICATED;
else if (tname == "erasure")
- type = CEPH_PG_TYPE_ERASURE;
+ type = CRUSH_RULE_TYPE_ERASURE;
else
ceph_abort();
#define crush_rule_size(len) (sizeof(struct crush_rule) + \
(len)*sizeof(struct crush_rule_step))
-
+enum crush_rule_type {
+ CRUSH_RULE_TYPE_REPLICATED = 1,
+ CRUSH_RULE_TYPE_ERASURE = 3,
+ CRUSH_RULE_TYPE_MSR_FIRSTN = 4,
+ CRUSH_RULE_TYPE_MSR_INDEP = 5
+};
/*
* A bucket is a named container of other items (either devices or