crush.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126
  1. #ifdef __KERNEL__
  2. # include <linux/slab.h>
  3. #else
  4. # include <stdlib.h>
  5. # include <assert.h>
  6. # define kfree(x) do { if (x) free(x); } while (0)
  7. # define BUG_ON(x) assert(!(x))
  8. #endif
  9. #include <linux/crush/crush.h>
  10. const char *crush_bucket_alg_name(int alg)
  11. {
  12. switch (alg) {
  13. case CRUSH_BUCKET_UNIFORM: return "uniform";
  14. case CRUSH_BUCKET_LIST: return "list";
  15. case CRUSH_BUCKET_TREE: return "tree";
  16. case CRUSH_BUCKET_STRAW: return "straw";
  17. default: return "unknown";
  18. }
  19. }
  20. /**
  21. * crush_get_bucket_item_weight - Get weight of an item in given bucket
  22. * @b: bucket pointer
  23. * @p: item index in bucket
  24. */
  25. int crush_get_bucket_item_weight(const struct crush_bucket *b, int p)
  26. {
  27. if ((__u32)p >= b->size)
  28. return 0;
  29. switch (b->alg) {
  30. case CRUSH_BUCKET_UNIFORM:
  31. return ((struct crush_bucket_uniform *)b)->item_weight;
  32. case CRUSH_BUCKET_LIST:
  33. return ((struct crush_bucket_list *)b)->item_weights[p];
  34. case CRUSH_BUCKET_TREE:
  35. return ((struct crush_bucket_tree *)b)->node_weights[crush_calc_tree_node(p)];
  36. case CRUSH_BUCKET_STRAW:
  37. return ((struct crush_bucket_straw *)b)->item_weights[p];
  38. }
  39. return 0;
  40. }
  41. void crush_destroy_bucket_uniform(struct crush_bucket_uniform *b)
  42. {
  43. kfree(b->h.perm);
  44. kfree(b->h.items);
  45. kfree(b);
  46. }
  47. void crush_destroy_bucket_list(struct crush_bucket_list *b)
  48. {
  49. kfree(b->item_weights);
  50. kfree(b->sum_weights);
  51. kfree(b->h.perm);
  52. kfree(b->h.items);
  53. kfree(b);
  54. }
  55. void crush_destroy_bucket_tree(struct crush_bucket_tree *b)
  56. {
  57. kfree(b->h.perm);
  58. kfree(b->h.items);
  59. kfree(b->node_weights);
  60. kfree(b);
  61. }
  62. void crush_destroy_bucket_straw(struct crush_bucket_straw *b)
  63. {
  64. kfree(b->straws);
  65. kfree(b->item_weights);
  66. kfree(b->h.perm);
  67. kfree(b->h.items);
  68. kfree(b);
  69. }
  70. void crush_destroy_bucket(struct crush_bucket *b)
  71. {
  72. switch (b->alg) {
  73. case CRUSH_BUCKET_UNIFORM:
  74. crush_destroy_bucket_uniform((struct crush_bucket_uniform *)b);
  75. break;
  76. case CRUSH_BUCKET_LIST:
  77. crush_destroy_bucket_list((struct crush_bucket_list *)b);
  78. break;
  79. case CRUSH_BUCKET_TREE:
  80. crush_destroy_bucket_tree((struct crush_bucket_tree *)b);
  81. break;
  82. case CRUSH_BUCKET_STRAW:
  83. crush_destroy_bucket_straw((struct crush_bucket_straw *)b);
  84. break;
  85. }
  86. }
  87. /**
  88. * crush_destroy - Destroy a crush_map
  89. * @map: crush_map pointer
  90. */
  91. void crush_destroy(struct crush_map *map)
  92. {
  93. /* buckets */
  94. if (map->buckets) {
  95. __s32 b;
  96. for (b = 0; b < map->max_buckets; b++) {
  97. if (map->buckets[b] == NULL)
  98. continue;
  99. crush_destroy_bucket(map->buckets[b]);
  100. }
  101. kfree(map->buckets);
  102. }
  103. /* rules */
  104. if (map->rules) {
  105. __u32 b;
  106. for (b = 0; b < map->max_rules; b++)
  107. kfree(map->rules[b]);
  108. kfree(map->rules);
  109. }
  110. kfree(map);
  111. }