devres.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196
  1. /*
  2. * Copyright (C) 2015 Masahiro Yamada <yamada.masahiro@socionext.com>
  3. *
  4. * Based on the original work in Linux by
  5. * Copyright (c) 2006 SUSE Linux Products GmbH
  6. * Copyright (c) 2006 Tejun Heo <teheo@suse.de>
  7. *
  8. * SPDX-License-Identifier: GPL-2.0+
  9. */
  10. #include <common.h>
  11. #include <linux/compat.h>
  12. #include <linux/kernel.h>
  13. #include <linux/list.h>
  14. #include <dm/device.h>
  15. /**
  16. * struct devres - Bookkeeping info for managed device resource
  17. * @entry: List to associate this structure with a device
  18. * @release: Callback invoked when this resource is released
  19. * @probe: Flag to show when this resource was allocated
  20. (true = probe, false = bind)
  21. * @name: Name of release function
  22. * @size: Size of resource data
  23. * @data: Resource data
  24. */
  25. struct devres {
  26. struct list_head entry;
  27. dr_release_t release;
  28. bool probe;
  29. #ifdef CONFIG_DEBUG_DEVRES
  30. const char *name;
  31. size_t size;
  32. #endif
  33. unsigned long long data[];
  34. };
  35. #ifdef CONFIG_DEBUG_DEVRES
  36. static void set_node_dbginfo(struct devres *dr, const char *name, size_t size)
  37. {
  38. dr->name = name;
  39. dr->size = size;
  40. }
  41. static void devres_log(struct udevice *dev, struct devres *dr,
  42. const char *op)
  43. {
  44. printf("%s: DEVRES %3s %p %s (%lu bytes)\n",
  45. dev->name, op, dr, dr->name, (unsigned long)dr->size);
  46. }
  47. #else /* CONFIG_DEBUG_DEVRES */
  48. #define set_node_dbginfo(dr, n, s) do {} while (0)
  49. #define devres_log(dev, dr, op) do {} while (0)
  50. #endif
  51. #if CONFIG_DEBUG_DEVRES
  52. void *__devres_alloc(dr_release_t release, size_t size, gfp_t gfp,
  53. const char *name)
  54. #else
  55. void *_devres_alloc(dr_release_t release, size_t size, gfp_t gfp)
  56. #endif
  57. {
  58. size_t tot_size = sizeof(struct devres) + size;
  59. struct devres *dr;
  60. dr = kmalloc(tot_size, gfp);
  61. if (unlikely(!dr))
  62. return NULL;
  63. INIT_LIST_HEAD(&dr->entry);
  64. dr->release = release;
  65. set_node_dbginfo(dr, name, size);
  66. return dr->data;
  67. }
  68. void devres_free(void *res)
  69. {
  70. if (res) {
  71. struct devres *dr = container_of(res, struct devres, data);
  72. BUG_ON(!list_empty(&dr->entry));
  73. kfree(dr);
  74. }
  75. }
  76. void devres_add(struct udevice *dev, void *res)
  77. {
  78. struct devres *dr = container_of(res, struct devres, data);
  79. devres_log(dev, dr, "ADD");
  80. BUG_ON(!list_empty(&dr->entry));
  81. dr->probe = dev->flags & DM_FLAG_BOUND ? true : false;
  82. list_add_tail(&dr->entry, &dev->devres_head);
  83. }
  84. void *devres_find(struct udevice *dev, dr_release_t release,
  85. dr_match_t match, void *match_data)
  86. {
  87. struct devres *dr;
  88. list_for_each_entry_reverse(dr, &dev->devres_head, entry) {
  89. if (dr->release != release)
  90. continue;
  91. if (match && !match(dev, dr->data, match_data))
  92. continue;
  93. return dr->data;
  94. }
  95. return NULL;
  96. }
  97. void *devres_get(struct udevice *dev, void *new_res,
  98. dr_match_t match, void *match_data)
  99. {
  100. struct devres *new_dr = container_of(new_res, struct devres, data);
  101. void *res;
  102. res = devres_find(dev, new_dr->release, match, match_data);
  103. if (!res) {
  104. devres_add(dev, new_res);
  105. res = new_res;
  106. new_res = NULL;
  107. }
  108. devres_free(new_res);
  109. return res;
  110. }
  111. void *devres_remove(struct udevice *dev, dr_release_t release,
  112. dr_match_t match, void *match_data)
  113. {
  114. void *res;
  115. res = devres_find(dev, release, match, match_data);
  116. if (res) {
  117. struct devres *dr = container_of(res, struct devres, data);
  118. list_del_init(&dr->entry);
  119. devres_log(dev, dr, "REM");
  120. }
  121. return res;
  122. }
  123. int devres_destroy(struct udevice *dev, dr_release_t release,
  124. dr_match_t match, void *match_data)
  125. {
  126. void *res;
  127. res = devres_remove(dev, release, match, match_data);
  128. if (unlikely(!res))
  129. return -ENOENT;
  130. devres_free(res);
  131. return 0;
  132. }
  133. int devres_release(struct udevice *dev, dr_release_t release,
  134. dr_match_t match, void *match_data)
  135. {
  136. void *res;
  137. res = devres_remove(dev, release, match, match_data);
  138. if (unlikely(!res))
  139. return -ENOENT;
  140. (*release)(dev, res);
  141. devres_free(res);
  142. return 0;
  143. }
  144. static void release_nodes(struct udevice *dev, struct list_head *head,
  145. bool probe_only)
  146. {
  147. struct devres *dr, *tmp;
  148. list_for_each_entry_safe_reverse(dr, tmp, head, entry) {
  149. if (probe_only && !dr->probe)
  150. break;
  151. devres_log(dev, dr, "REL");
  152. dr->release(dev, dr->data);
  153. list_del(&dr->entry);
  154. kfree(dr);
  155. }
  156. }
  157. void devres_release_probe(struct udevice *dev)
  158. {
  159. release_nodes(dev, &dev->devres_head, true);
  160. }
  161. void devres_release_all(struct udevice *dev)
  162. {
  163. release_nodes(dev, &dev->devres_head, false);
  164. }