btree-128.h 2.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. extern struct btree_geo btree_geo128;
  3. struct btree_head128 { struct btree_head h; };
  4. static inline void btree_init_mempool128(struct btree_head128 *head,
  5. mempool_t *mempool)
  6. {
  7. btree_init_mempool(&head->h, mempool);
  8. }
  9. static inline int btree_init128(struct btree_head128 *head)
  10. {
  11. return btree_init(&head->h);
  12. }
  13. static inline void btree_destroy128(struct btree_head128 *head)
  14. {
  15. btree_destroy(&head->h);
  16. }
  17. static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2)
  18. {
  19. u64 key[2] = {k1, k2};
  20. return btree_lookup(&head->h, &btree_geo128, (unsigned long *)&key);
  21. }
  22. static inline void *btree_get_prev128(struct btree_head128 *head,
  23. u64 *k1, u64 *k2)
  24. {
  25. u64 key[2] = {*k1, *k2};
  26. void *val;
  27. val = btree_get_prev(&head->h, &btree_geo128,
  28. (unsigned long *)&key);
  29. *k1 = key[0];
  30. *k2 = key[1];
  31. return val;
  32. }
  33. static inline int btree_insert128(struct btree_head128 *head, u64 k1, u64 k2,
  34. void *val, gfp_t gfp)
  35. {
  36. u64 key[2] = {k1, k2};
  37. return btree_insert(&head->h, &btree_geo128,
  38. (unsigned long *)&key, val, gfp);
  39. }
  40. static inline int btree_update128(struct btree_head128 *head, u64 k1, u64 k2,
  41. void *val)
  42. {
  43. u64 key[2] = {k1, k2};
  44. return btree_update(&head->h, &btree_geo128,
  45. (unsigned long *)&key, val);
  46. }
  47. static inline void *btree_remove128(struct btree_head128 *head, u64 k1, u64 k2)
  48. {
  49. u64 key[2] = {k1, k2};
  50. return btree_remove(&head->h, &btree_geo128, (unsigned long *)&key);
  51. }
  52. static inline void *btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2)
  53. {
  54. u64 key[2];
  55. void *val;
  56. val = btree_last(&head->h, &btree_geo128, (unsigned long *)&key[0]);
  57. if (val) {
  58. *k1 = key[0];
  59. *k2 = key[1];
  60. }
  61. return val;
  62. }
  63. static inline int btree_merge128(struct btree_head128 *target,
  64. struct btree_head128 *victim,
  65. gfp_t gfp)
  66. {
  67. return btree_merge(&target->h, &victim->h, &btree_geo128, gfp);
  68. }
  69. void visitor128(void *elem, unsigned long opaque, unsigned long *__key,
  70. size_t index, void *__func);
  71. typedef void (*visitor128_t)(void *elem, unsigned long opaque,
  72. u64 key1, u64 key2, size_t index);
  73. static inline size_t btree_visitor128(struct btree_head128 *head,
  74. unsigned long opaque,
  75. visitor128_t func2)
  76. {
  77. return btree_visitor(&head->h, &btree_geo128, opaque,
  78. visitor128, func2);
  79. }
  80. static inline size_t btree_grim_visitor128(struct btree_head128 *head,
  81. unsigned long opaque,
  82. visitor128_t func2)
  83. {
  84. return btree_grim_visitor(&head->h, &btree_geo128, opaque,
  85. visitor128, func2);
  86. }
  87. #define btree_for_each_safe128(head, k1, k2, val) \
  88. for (val = btree_last128(head, &k1, &k2); \
  89. val; \
  90. val = btree_get_prev128(head, &k1, &k2))