idset.c 2.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130
  1. /*
  2. * Copyright IBM Corp. 2007
  3. * Author(s): Peter Oberparleiter <peter.oberparleiter@de.ibm.com>
  4. */
  5. #include <linux/vmalloc.h>
  6. #include <linux/bitops.h>
  7. #include "idset.h"
  8. #include "css.h"
  9. struct idset {
  10. int num_ssid;
  11. int num_id;
  12. unsigned long bitmap[0];
  13. };
  14. static inline unsigned long bitmap_size(int num_ssid, int num_id)
  15. {
  16. return __BITOPS_WORDS(num_ssid * num_id) * sizeof(unsigned long);
  17. }
  18. static struct idset *idset_new(int num_ssid, int num_id)
  19. {
  20. struct idset *set;
  21. set = vmalloc(sizeof(struct idset) + bitmap_size(num_ssid, num_id));
  22. if (set) {
  23. set->num_ssid = num_ssid;
  24. set->num_id = num_id;
  25. memset(set->bitmap, 0, bitmap_size(num_ssid, num_id));
  26. }
  27. return set;
  28. }
  29. void idset_free(struct idset *set)
  30. {
  31. vfree(set);
  32. }
  33. void idset_clear(struct idset *set)
  34. {
  35. memset(set->bitmap, 0, bitmap_size(set->num_ssid, set->num_id));
  36. }
  37. void idset_fill(struct idset *set)
  38. {
  39. memset(set->bitmap, 0xff, bitmap_size(set->num_ssid, set->num_id));
  40. }
  41. static inline void idset_add(struct idset *set, int ssid, int id)
  42. {
  43. set_bit(ssid * set->num_id + id, set->bitmap);
  44. }
  45. static inline void idset_del(struct idset *set, int ssid, int id)
  46. {
  47. clear_bit(ssid * set->num_id + id, set->bitmap);
  48. }
  49. static inline int idset_contains(struct idset *set, int ssid, int id)
  50. {
  51. return test_bit(ssid * set->num_id + id, set->bitmap);
  52. }
  53. static inline int idset_get_first(struct idset *set, int *ssid, int *id)
  54. {
  55. int bitnum;
  56. bitnum = find_first_bit(set->bitmap, set->num_ssid * set->num_id);
  57. if (bitnum >= set->num_ssid * set->num_id)
  58. return 0;
  59. *ssid = bitnum / set->num_id;
  60. *id = bitnum % set->num_id;
  61. return 1;
  62. }
  63. struct idset *idset_sch_new(void)
  64. {
  65. return idset_new(max_ssid + 1, __MAX_SUBCHANNEL + 1);
  66. }
  67. void idset_sch_add(struct idset *set, struct subchannel_id schid)
  68. {
  69. idset_add(set, schid.ssid, schid.sch_no);
  70. }
  71. void idset_sch_del(struct idset *set, struct subchannel_id schid)
  72. {
  73. idset_del(set, schid.ssid, schid.sch_no);
  74. }
  75. int idset_sch_contains(struct idset *set, struct subchannel_id schid)
  76. {
  77. return idset_contains(set, schid.ssid, schid.sch_no);
  78. }
  79. int idset_sch_get_first(struct idset *set, struct subchannel_id *schid)
  80. {
  81. int ssid = 0;
  82. int id = 0;
  83. int rc;
  84. rc = idset_get_first(set, &ssid, &id);
  85. if (rc) {
  86. init_subchannel_id(schid);
  87. schid->ssid = ssid;
  88. schid->sch_no = id;
  89. }
  90. return rc;
  91. }
  92. int idset_is_empty(struct idset *set)
  93. {
  94. int bitnum;
  95. bitnum = find_first_bit(set->bitmap, set->num_ssid * set->num_id);
  96. if (bitnum >= set->num_ssid * set->num_id)
  97. return 1;
  98. return 0;
  99. }
  100. void idset_add_set(struct idset *to, struct idset *from)
  101. {
  102. unsigned long i, len;
  103. len = min(__BITOPS_WORDS(to->num_ssid * to->num_id),
  104. __BITOPS_WORDS(from->num_ssid * from->num_id));
  105. for (i = 0; i < len ; i++)
  106. to->bitmap[i] |= from->bitmap[i];
  107. }