switch (crush->buckets[i]->alg) {
case CRUSH_BUCKET_UNIFORM:
- ::encode(((crush_bucket_uniform*)crush->buckets[i])->item_weight, bl);
+ ::encode((reinterpret_cast<crush_bucket_uniform*>(crush->buckets[i]))->item_weight, bl);
break;
case CRUSH_BUCKET_LIST:
for (unsigned j=0; j<crush->buckets[i]->size; j++) {
- ::encode(((crush_bucket_list*)crush->buckets[i])->item_weights[j], bl);
- ::encode(((crush_bucket_list*)crush->buckets[i])->sum_weights[j], bl);
+ ::encode((reinterpret_cast<crush_bucket_list*>(crush->buckets[i]))->item_weights[j], bl);
+ ::encode((reinterpret_cast<crush_bucket_list*>(crush->buckets[i]))->sum_weights[j], bl);
}
break;
case CRUSH_BUCKET_TREE:
- ::encode(((crush_bucket_tree*)crush->buckets[i])->num_nodes, bl);
- for (unsigned j=0; j<((crush_bucket_tree*)crush->buckets[i])->num_nodes; j++)
- ::encode(((crush_bucket_tree*)crush->buckets[i])->node_weights[j], bl);
+ ::encode((reinterpret_cast<crush_bucket_tree*>(crush->buckets[i]))->num_nodes, bl);
+ for (unsigned j=0; j<(reinterpret_cast<crush_bucket_tree*>(crush->buckets[i]))->num_nodes; j++)
+ ::encode((reinterpret_cast<crush_bucket_tree*>(crush->buckets[i]))->node_weights[j], bl);
break;
case CRUSH_BUCKET_STRAW:
for (unsigned j=0; j<crush->buckets[i]->size; j++) {
- ::encode(((crush_bucket_straw*)crush->buckets[i])->item_weights[j], bl);
- ::encode(((crush_bucket_straw*)crush->buckets[i])->straws[j], bl);
+ ::encode((reinterpret_cast<crush_bucket_straw*>(crush->buckets[i]))->item_weights[j], bl);
+ ::encode((reinterpret_cast<crush_bucket_straw*>(crush->buckets[i]))->straws[j], bl);
}
break;
__u32 len;
::decode(len, blp);
- crush->rules[i] = (crush_rule*)calloc(1, crush_rule_size(len));
+ crush->rules[i] = reinterpret_cast<crush_rule*>(calloc(1, crush_rule_size(len)));
crush->rules[i]->len = len;
::decode(crush->rules[i]->mask, blp);
for (unsigned j=0; j<crush->rules[i]->len; j++)
throw buffer::malformed_input(str);
}
}
- crush_bucket *bucket = (crush_bucket*)calloc(1, size);
+ crush_bucket *bucket = reinterpret_cast<crush_bucket*>(calloc(1, size));
*bptr = bucket;
::decode(bucket->id, blp);
switch (bucket->alg) {
case CRUSH_BUCKET_UNIFORM:
- ::decode(((crush_bucket_uniform*)bucket)->item_weight, blp);
+ ::decode((reinterpret_cast<crush_bucket_uniform*>(bucket))->item_weight, blp);
break;
case CRUSH_BUCKET_LIST: {
- crush_bucket_list* cbl = (crush_bucket_list*)bucket;
+ crush_bucket_list* cbl = reinterpret_cast<crush_bucket_list*>(bucket);
cbl->item_weights = (__u32*)calloc(1, bucket->size * sizeof(__u32));
cbl->sum_weights = (__u32*)calloc(1, bucket->size * sizeof(__u32));
}
case CRUSH_BUCKET_TREE: {
- crush_bucket_tree* cbt = (crush_bucket_tree*)bucket;
+ crush_bucket_tree* cbt = reinterpret_cast<crush_bucket_tree*>(bucket);
::decode(cbt->num_nodes, blp);
cbt->node_weights = (__u32*)calloc(1, cbt->num_nodes * sizeof(__u32));
for (unsigned j=0; j<cbt->num_nodes; j++) {
}
case CRUSH_BUCKET_STRAW: {
- crush_bucket_straw* cbs = (crush_bucket_straw*)bucket;
+ crush_bucket_straw* cbs = reinterpret_cast<crush_bucket_straw*>(bucket);
cbs->straws = (__u32*)calloc(1, bucket->size * sizeof(__u32));
cbs->item_weights = (__u32*)calloc(1, bucket->size * sizeof(__u32));
for (unsigned j = 0; j < bucket->size; ++j) {