crush.c 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
  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 "crush.h"
  10. /**
  11. * crush_get_bucket_item_weight - Get weight of an item in given bucket
  12. * @b: bucket pointer
  13. * @p: item index in bucket
  14. */
  15. int crush_get_bucket_item_weight(struct crush_bucket *b, int p)
  16. {
  17. if (p >= b->size)
  18. return 0;
  19. switch (b->alg) {
  20. case CRUSH_BUCKET_UNIFORM:
  21. return ((struct crush_bucket_uniform *)b)->item_weight;
  22. case CRUSH_BUCKET_LIST:
  23. return ((struct crush_bucket_list *)b)->item_weights[p];
  24. case CRUSH_BUCKET_TREE:
  25. if (p & 1)
  26. return ((struct crush_bucket_tree *)b)->node_weights[p];
  27. return 0;
  28. case CRUSH_BUCKET_STRAW:
  29. return ((struct crush_bucket_straw *)b)->item_weights[p];
  30. }
  31. return 0;
  32. }
  33. /**
  34. * crush_calc_parents - Calculate parent vectors for the given crush map.
  35. * @map: crush_map pointer
  36. */
  37. void crush_calc_parents(struct crush_map *map)
  38. {
  39. int i, b, c;
  40. for (b = 0; b < map->max_buckets; b++) {
  41. if (map->buckets[b] == NULL)
  42. continue;
  43. for (i = 0; i < map->buckets[b]->size; i++) {
  44. c = map->buckets[b]->items[i];
  45. BUG_ON(c >= map->max_devices ||
  46. c < -map->max_buckets);
  47. if (c >= 0)
  48. map->device_parents[c] = map->buckets[b]->id;
  49. else
  50. map->bucket_parents[-1-c] = map->buckets[b]->id;
  51. }
  52. }
  53. }
  54. void crush_destroy_bucket_uniform(struct crush_bucket_uniform *b)
  55. {
  56. kfree(b->h.perm);
  57. kfree(b->h.items);
  58. kfree(b);
  59. }
  60. void crush_destroy_bucket_list(struct crush_bucket_list *b)
  61. {
  62. kfree(b->item_weights);
  63. kfree(b->sum_weights);
  64. kfree(b->h.perm);
  65. kfree(b->h.items);
  66. kfree(b);
  67. }
  68. void crush_destroy_bucket_tree(struct crush_bucket_tree *b)
  69. {
  70. kfree(b->node_weights);
  71. kfree(b);
  72. }
  73. void crush_destroy_bucket_straw(struct crush_bucket_straw *b)
  74. {
  75. kfree(b->straws);
  76. kfree(b->item_weights);
  77. kfree(b->h.perm);
  78. kfree(b->h.items);
  79. kfree(b);
  80. }
  81. void crush_destroy_bucket(struct crush_bucket *b)
  82. {
  83. switch (b->alg) {
  84. case CRUSH_BUCKET_UNIFORM:
  85. crush_destroy_bucket_uniform((struct crush_bucket_uniform *)b);
  86. break;
  87. case CRUSH_BUCKET_LIST:
  88. crush_destroy_bucket_list((struct crush_bucket_list *)b);
  89. break;
  90. case CRUSH_BUCKET_TREE:
  91. crush_destroy_bucket_tree((struct crush_bucket_tree *)b);
  92. break;
  93. case CRUSH_BUCKET_STRAW:
  94. crush_destroy_bucket_straw((struct crush_bucket_straw *)b);
  95. break;
  96. }
  97. }
  98. /**
  99. * crush_destroy - Destroy a crush_map
  100. * @map: crush_map pointer
  101. */
  102. void crush_destroy(struct crush_map *map)
  103. {
  104. int b;
  105. /* buckets */
  106. if (map->buckets) {
  107. for (b = 0; b < map->max_buckets; b++) {
  108. if (map->buckets[b] == NULL)
  109. continue;
  110. crush_destroy_bucket(map->buckets[b]);
  111. }
  112. kfree(map->buckets);
  113. }
  114. /* rules */
  115. if (map->rules) {
  116. for (b = 0; b < map->max_rules; b++)
  117. kfree(map->rules[b]);
  118. kfree(map->rules);
  119. }
  120. kfree(map->bucket_parents);
  121. kfree(map->device_parents);
  122. kfree(map);
  123. }