sleep_retention.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557
  1. /*
  2. * SPDX-FileCopyrightText: 2022-2023 Espressif Systems (Shanghai) CO LTD
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. */
  6. #include <stddef.h>
  7. #include <string.h>
  8. #include <sys/lock.h>
  9. #include <sys/param.h>
  10. #include "esp_err.h"
  11. #include "esp_attr.h"
  12. #include "esp_log.h"
  13. #include "esp_heap_caps.h"
  14. #include "esp_sleep.h"
  15. #include "soc/soc_caps.h"
  16. #include "esp_private/esp_regdma.h"
  17. #include "esp_private/esp_pau.h"
  18. #include "esp_private/sleep_retention.h"
  19. #include "sdkconfig.h"
  20. #include "esp_pmu.h"
  21. static __attribute__((unused)) const char *TAG = "sleep";
  22. /**
  23. * Internal structure which holds all requested sleep retention parameters
  24. */
  25. typedef struct {
  26. /* The hardware retention module (REGDMA and PMU) uses 4 linked lists to
  27. * record the hardware context information that needs to be backed up and
  28. * restored when switching between different power states. The 4 linked
  29. * lists are linked by 8 types of nodes. The 4 linked lists can reuse some
  30. * nodes with each other, or separate their own unique nodes after branch
  31. * type nodes.
  32. * The REGDMA module iterates the entire linked list from the head of a
  33. * linked list and backs up and restores the corresponding register context
  34. * information according to the configuration information of the linked list
  35. * nodes.
  36. * The PMU module triggers REGDMA to use the corresponding linked list when
  37. * swtiching between different power states. For example:
  38. *
  39. * +---------------+---------------+-------------------+-----------+
  40. * | Current | The next | The entry will be | Retention |
  41. * | PMU state | PMU state | used by REGDMA | clock |
  42. * +---------------+---------------+-------------------+-----------+
  43. * | PMU_HP_ACTIVE | PMU_HP_SLEEP | entry0 | XTAL |
  44. * | PMU_HP_SLEEP | PMU_HP_ACTIVE | entry0 | XTAL |
  45. * | PMU_HP_MODEM | PMU_HP_SLEEP | ------ | XTAL |
  46. * | PMU_HP_SLEEP | PMU_HP_MODEM | entry1 | XTAL |
  47. * | PMU_HP_MODEM | PMU_HP_ACTIVE | entry2 | PLL |
  48. * |---------------------------------------------------------------|
  49. * | PMU_HP_ACTIVE | PMU_HP_ACTIVE | entry3 | PLL | (Clock BUG)
  50. * +---------------+---------------+-------------------+-----------+
  51. *
  52. * +--------+ +-------------------------+ +-------------+ +-----------+ +--------+ +-----+
  53. * entry2 -> | | -> | WiFi MAC Minimum System | -> | | -------------------------> | ######### | -> | ###### | -> | End |
  54. * | SOC | +-------------------------+ | Digital | | Bluetooth | | Zigbee | +-----+
  55. * | System | +--------+ | Peripherals | +------+ +------+ | / BLE | | | +-----+
  56. * entry0 -> | | ----------> | | ---------> | | -> | | -> | | -> | | -> | | -> | End |
  57. * +--------+ | Modem | +-------------+ | WiFi | | WiFi | +-----------+ +--------+ +-----+
  58. * | System | | MAC | | BB | +-----+
  59. * entry1 ------------------------> | |-----------------------------> | | -> | | -> | End |
  60. * +--------+ +------+ +------+ +-----+
  61. *
  62. * The entry3 (alias: extra linked list) is used for backup and restore of
  63. * modules (such as BLE or 15.4 modules) with retention clock bugs.
  64. *
  65. * +---------+ +----------+ +-------------+ +-----+
  66. * entry3 -> | BLE MAC | -> | 15.4 MAC | -> | BLE/15.4 BB | -> | End |
  67. * +---------+ +----------+ +-------------+ +-----+
  68. *
  69. * Using it (extra linked list) for retention has the following constraints:
  70. * 1. The PLL clock must be enabled (can be done with esp_pm_lock_acquire()
  71. * interface to acquire a pm lock of type ESP_PM_APB_FREQ_MAX.
  72. * 2. When using the sleep_retention_entries_create() interface to create an
  73. * extra linked list, the node owner must be equal to BIT(3).
  74. * 3. Use the sleep_retention_do_extra_retention() interface to backup or
  75. * restore the register context, which ensures only one backup or restore
  76. * when multiple modules (BLE and 15.4) exists.
  77. */
  78. #define SLEEP_RETENTION_REGDMA_LINK_NR_PRIORITIES (8u)
  79. #define SLEEP_RETENTION_REGDMA_LINK_HIGHEST_PRIORITY (0)
  80. #define SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY (SLEEP_RETENTION_REGDMA_LINK_NR_PRIORITIES - 1)
  81. struct {
  82. sleep_retention_entries_t entries;
  83. uint32_t entries_bitmap: REGDMA_LINK_ENTRY_NUM,
  84. runtime_bitmap: REGDMA_LINK_ENTRY_NUM,
  85. reserved: 32-(2*REGDMA_LINK_ENTRY_NUM);
  86. void *entries_tail;
  87. } lists[SLEEP_RETENTION_REGDMA_LINK_NR_PRIORITIES];
  88. _lock_t lock;
  89. regdma_link_priority_t highpri;
  90. uint32_t modules;
  91. #if SOC_PM_RETENTION_HAS_CLOCK_BUG
  92. #define EXTRA_LINK_NUM (REGDMA_LINK_ENTRY_NUM - 1)
  93. int extra_refs;
  94. #endif
  95. } sleep_retention_t;
  96. static DRAM_ATTR __attribute__((unused)) sleep_retention_t s_retention = {
  97. .highpri = (uint8_t)-1, .modules = 0
  98. #if SOC_PM_RETENTION_HAS_CLOCK_BUG
  99. , .extra_refs = 0
  100. #endif
  101. };
  102. #define SLEEP_RETENTION_ENTRY_BITMAP_MASK (BIT(REGDMA_LINK_ENTRY_NUM) - 1)
  103. #define SLEEP_RETENTION_ENTRY_BITMAP(bitmap) ((bitmap) & SLEEP_RETENTION_ENTRY_BITMAP_MASK)
  104. static esp_err_t sleep_retention_entries_create_impl(const sleep_retention_entries_config_t retent[], int num, regdma_link_priority_t priority, int module);
  105. static void sleep_retention_entries_join(void);
  106. static inline bool sleep_retention_entries_require_branch(uint32_t owner, uint32_t runtime_bitmap)
  107. {
  108. bool use_new_entry = SLEEP_RETENTION_ENTRY_BITMAP(owner & ~runtime_bitmap) ? true : false;
  109. bool intersection_exist = SLEEP_RETENTION_ENTRY_BITMAP(owner & runtime_bitmap) ? true : false;
  110. return use_new_entry && intersection_exist;
  111. }
  112. static esp_err_t sleep_retention_entries_check_and_create_default(uint32_t owner, uint32_t runtime_bitmap, uint32_t entries_bitmap, regdma_link_priority_t priority, uint32_t module)
  113. {
  114. assert(sleep_retention_entries_require_branch(owner, runtime_bitmap));
  115. static sleep_retention_entries_config_t dummy = { REGDMA_LINK_WAIT_INIT(0xffff, 0, 0, 0, 1, 1), 0 };
  116. dummy.owner = SLEEP_RETENTION_ENTRY_BITMAP(owner & ~entries_bitmap);
  117. if (dummy.owner) {
  118. return sleep_retention_entries_create_impl(&dummy, 1, priority, module);
  119. }
  120. return ESP_OK;
  121. }
  122. static esp_err_t sleep_retention_entries_check_and_create_final_default(void)
  123. {
  124. static const sleep_retention_entries_config_t final_dummy = { REGDMA_LINK_WAIT_INIT(0xffff, 0, 0, 0, 1, 1), SLEEP_RETENTION_ENTRY_BITMAP_MASK };
  125. esp_err_t err = ESP_OK;
  126. _lock_acquire_recursive(&s_retention.lock);
  127. if (s_retention.lists[SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY].entries_bitmap == 0) {
  128. err = sleep_retention_entries_create_impl(&final_dummy, 1, SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY, 0);
  129. }
  130. _lock_release_recursive(&s_retention.lock);
  131. return err;
  132. }
  133. static void sleep_retention_entries_update(uint32_t owner, void *new_link, regdma_link_priority_t priority)
  134. {
  135. _lock_acquire_recursive(&s_retention.lock);
  136. sleep_retention_entries_t retention_entries = {
  137. (owner & BIT(0)) ? new_link : s_retention.lists[priority].entries[0],
  138. (owner & BIT(1)) ? new_link : s_retention.lists[priority].entries[1],
  139. (owner & BIT(2)) ? new_link : s_retention.lists[priority].entries[2],
  140. (owner & BIT(3)) ? new_link : s_retention.lists[priority].entries[3]
  141. };
  142. if (s_retention.lists[priority].entries_bitmap == 0) {
  143. s_retention.lists[priority].entries_tail = new_link;
  144. }
  145. memcpy(s_retention.lists[priority].entries, retention_entries, sizeof(sleep_retention_entries_t));
  146. s_retention.lists[priority].runtime_bitmap = owner;
  147. s_retention.lists[priority].entries_bitmap |= owner;
  148. _lock_release_recursive(&s_retention.lock);
  149. }
  150. static void * sleep_retention_entries_try_create(const regdma_link_config_t *config, uint32_t owner, regdma_link_priority_t priority, uint32_t module)
  151. {
  152. void *link = NULL;
  153. assert(owner > 0 && owner < BIT(REGDMA_LINK_ENTRY_NUM));
  154. _lock_acquire_recursive(&s_retention.lock);
  155. if (sleep_retention_entries_require_branch(owner, s_retention.lists[priority].runtime_bitmap)) {
  156. if (sleep_retention_entries_check_and_create_default(owner, s_retention.lists[priority].runtime_bitmap,
  157. s_retention.lists[priority].entries_bitmap, priority, module) == ESP_OK) { /* branch node can't as tail node */
  158. link = regdma_link_init_safe(
  159. config, true, module,
  160. (owner & BIT(0)) ? s_retention.lists[priority].entries[0] : NULL,
  161. (owner & BIT(1)) ? s_retention.lists[priority].entries[1] : NULL,
  162. (owner & BIT(2)) ? s_retention.lists[priority].entries[2] : NULL,
  163. (owner & BIT(3)) ? s_retention.lists[priority].entries[3] : NULL
  164. );
  165. }
  166. } else {
  167. link = regdma_link_init_safe(config, false, module, s_retention.lists[priority].entries[__builtin_ffs(owner) - 1]);
  168. }
  169. _lock_release_recursive(&s_retention.lock);
  170. return link;
  171. }
  172. static void * sleep_retention_entries_try_create_bonding(const regdma_link_config_t *config, uint32_t owner, regdma_link_priority_t priority, uint32_t module)
  173. {
  174. assert(owner > 0 && owner < BIT(REGDMA_LINK_ENTRY_NUM));
  175. _lock_acquire_recursive(&s_retention.lock);
  176. void *link = regdma_link_init_safe(
  177. config, true, module,
  178. (owner & BIT(0)) ? s_retention.lists[priority].entries[0] : NULL,
  179. (owner & BIT(1)) ? s_retention.lists[priority].entries[1] : NULL,
  180. (owner & BIT(2)) ? s_retention.lists[priority].entries[2] : NULL,
  181. (owner & BIT(3)) ? s_retention.lists[priority].entries[3] : NULL
  182. );
  183. _lock_release_recursive(&s_retention.lock);
  184. return link;
  185. }
  186. static void sleep_retention_entries_stats(void)
  187. {
  188. _lock_acquire_recursive(&s_retention.lock);
  189. if (s_retention.highpri >= SLEEP_RETENTION_REGDMA_LINK_HIGHEST_PRIORITY && s_retention.highpri <= SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY) {
  190. for (int entry = 0; entry < ARRAY_SIZE(s_retention.lists[s_retention.highpri].entries); entry++) {
  191. regdma_link_stats(s_retention.lists[s_retention.highpri].entries[entry], entry);
  192. }
  193. }
  194. _lock_release_recursive(&s_retention.lock);
  195. }
  196. #if REGDMA_LINK_DBG
  197. void sleep_retention_entries_show_memories(void)
  198. {
  199. _lock_acquire_recursive(&s_retention.lock);
  200. if (s_retention.highpri >= SLEEP_RETENTION_REGDMA_LINK_HIGHEST_PRIORITY && s_retention.highpri <= SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY) {
  201. for (int entry = 0; entry < ARRAY_SIZE(s_retention.lists[s_retention.highpri].entries); entry++) {
  202. ESP_LOGW(TAG, "Print sleep retention entries[%d] memories:", entry);
  203. regdma_link_show_memories(s_retention.lists[s_retention.highpri].entries[entry], entry);
  204. }
  205. }
  206. _lock_release_recursive(&s_retention.lock);
  207. }
  208. #endif
  209. void * sleep_retention_find_link_by_id(int id)
  210. {
  211. void *link = NULL;
  212. _lock_acquire_recursive(&s_retention.lock);
  213. if (s_retention.highpri >= SLEEP_RETENTION_REGDMA_LINK_HIGHEST_PRIORITY &&
  214. s_retention.highpri <= SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY) {
  215. for (int entry = 0; (link == NULL && entry < ARRAY_SIZE(s_retention.lists[s_retention.highpri].entries)); entry++) {
  216. link = regdma_find_link_by_id(s_retention.lists[s_retention.highpri].entries[entry], entry, id);
  217. }
  218. }
  219. _lock_release_recursive(&s_retention.lock);
  220. return link;
  221. }
  222. static uint32_t sleep_retention_entries_owner_bitmap(sleep_retention_entries_t *entries, sleep_retention_entries_t *tails)
  223. {
  224. uint32_t owner = 0;
  225. _lock_acquire_recursive(&s_retention.lock);
  226. for (int entry = 0; entry < ARRAY_SIZE(*entries); entry++) {
  227. owner |= regdma_link_get_owner_bitmap((*entries)[entry], (*tails)[entry], entry);
  228. }
  229. _lock_release_recursive(&s_retention.lock);
  230. return owner;
  231. }
  232. static bool sleep_retention_entries_get_destroy_context(regdma_link_priority_t priority, uint32_t module, sleep_retention_entries_t *destroy_entries, void **destroy_tail, sleep_retention_entries_t *next_entries, void **prev_tail)
  233. {
  234. bool exist = false;
  235. sleep_retention_entries_t destroy_tails, prev_tails;
  236. memset(&destroy_tails, 0, sizeof(sleep_retention_entries_t));
  237. memset(&prev_tails, 0, sizeof(sleep_retention_entries_t));
  238. _lock_acquire_recursive(&s_retention.lock);
  239. for (int entry = 0; entry < ARRAY_SIZE(s_retention.lists[priority].entries); entry++) {
  240. (*destroy_entries)[entry] = regdma_find_module_link_head(
  241. s_retention.lists[priority].entries[entry], s_retention.lists[priority].entries_tail, entry, module);
  242. destroy_tails [entry] = regdma_find_module_link_tail(
  243. s_retention.lists[priority].entries[entry], s_retention.lists[priority].entries_tail, entry, module);
  244. (*next_entries) [entry] = regdma_find_next_module_link_head(
  245. s_retention.lists[priority].entries[entry], s_retention.lists[priority].entries_tail, entry, module);
  246. prev_tails [entry] = regdma_find_prev_module_link_tail(
  247. s_retention.lists[priority].entries[entry], s_retention.lists[priority].entries_tail, entry, module);
  248. if ((*destroy_entries)[entry] && destroy_tails[entry]) {
  249. exist = true;
  250. }
  251. assert(destroy_tails[entry] == destroy_tails[0]);
  252. assert(prev_tails[entry] == prev_tails[0]);
  253. }
  254. *destroy_tail = destroy_tails[0];
  255. *prev_tail = prev_tails[0];
  256. _lock_release_recursive(&s_retention.lock);
  257. return exist;
  258. }
  259. static void sleep_retention_entries_context_update(regdma_link_priority_t priority)
  260. {
  261. _lock_acquire_recursive(&s_retention.lock);
  262. sleep_retention_entries_t tails = {
  263. s_retention.lists[priority].entries_tail, s_retention.lists[priority].entries_tail,
  264. s_retention.lists[priority].entries_tail, s_retention.lists[priority].entries_tail
  265. };
  266. s_retention.lists[priority].entries_bitmap = sleep_retention_entries_owner_bitmap(&s_retention.lists[priority].entries, &tails);
  267. s_retention.lists[priority].runtime_bitmap = sleep_retention_entries_owner_bitmap(&s_retention.lists[priority].entries, &s_retention.lists[priority].entries);
  268. _lock_release_recursive(&s_retention.lock);
  269. }
  270. static bool sleep_retention_entries_dettach(regdma_link_priority_t priority, sleep_retention_entries_t *destroy_entries, void *destroy_tail, sleep_retention_entries_t *next_entries, void *prev_tail)
  271. {
  272. _lock_acquire_recursive(&s_retention.lock);
  273. bool is_head = (memcmp(destroy_entries, &s_retention.lists[priority].entries, sizeof(sleep_retention_entries_t)) == 0);
  274. bool is_tail = (destroy_tail == s_retention.lists[priority].entries_tail);
  275. if (is_head && is_tail) {
  276. memset(s_retention.lists[priority].entries, 0, sizeof(sleep_retention_entries_t));
  277. s_retention.lists[priority].entries_tail = NULL;
  278. } else if (is_head) {
  279. memcpy(&s_retention.lists[priority].entries, next_entries, sizeof(sleep_retention_entries_t));
  280. } else if (is_tail) {
  281. s_retention.lists[priority].entries_tail = prev_tail;
  282. } else {
  283. regdma_link_update_next_safe(prev_tail, (*next_entries)[0], (*next_entries)[1], (*next_entries)[2], (*next_entries)[3]);
  284. }
  285. sleep_retention_entries_context_update(priority);
  286. regdma_link_update_next_safe(destroy_tail, NULL, NULL, NULL, NULL);
  287. _lock_release_recursive(&s_retention.lock);
  288. return (is_head || is_tail);
  289. }
  290. static void sleep_retention_entries_destroy_wrapper(sleep_retention_entries_t *destroy_entries)
  291. {
  292. for (int entry = 0; entry < ARRAY_SIZE(*destroy_entries); entry++) {
  293. regdma_link_destroy((*destroy_entries)[entry], entry);
  294. }
  295. }
  296. static void sleep_retention_entries_check_and_distroy_final_default(void)
  297. {
  298. _lock_acquire_recursive(&s_retention.lock);
  299. assert(s_retention.highpri == SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY);
  300. assert(s_retention.modules == 0);
  301. sleep_retention_entries_destroy_wrapper(&s_retention.lists[SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY].entries);
  302. _lock_release_recursive(&s_retention.lock);
  303. }
  304. static void sleep_retention_entries_all_destroy_wrapper(uint32_t module)
  305. {
  306. void *destroy_tail = NULL, *prev_tail = NULL;
  307. sleep_retention_entries_t destroy_entries, next_entries;
  308. memset(&destroy_entries, 0, sizeof(sleep_retention_entries_t));
  309. memset(&next_entries, 0, sizeof(sleep_retention_entries_t));
  310. _lock_acquire_recursive(&s_retention.lock);
  311. regdma_link_priority_t priority = 0;
  312. do {
  313. bool exist = sleep_retention_entries_get_destroy_context(priority, module, &destroy_entries, &destroy_tail, &next_entries, &prev_tail);
  314. if (s_retention.lists[priority].entries_bitmap && exist) {
  315. if (sleep_retention_entries_dettach(priority, &destroy_entries, destroy_tail, &next_entries, prev_tail)) {
  316. sleep_retention_entries_join();
  317. }
  318. sleep_retention_entries_destroy_wrapper(&destroy_entries);
  319. } else {
  320. priority++;
  321. }
  322. } while (priority < SLEEP_RETENTION_REGDMA_LINK_NR_PRIORITIES);
  323. s_retention.modules &= ~module;
  324. _lock_release_recursive(&s_retention.lock);
  325. }
  326. static void sleep_retention_entries_do_destroy(int module)
  327. {
  328. assert(module != 0);
  329. _lock_acquire_recursive(&s_retention.lock);
  330. sleep_retention_entries_join();
  331. sleep_retention_entries_stats();
  332. sleep_retention_entries_all_destroy_wrapper(module);
  333. _lock_release_recursive(&s_retention.lock);
  334. }
  335. void sleep_retention_entries_destroy(int module)
  336. {
  337. assert(module != 0);
  338. _lock_acquire_recursive(&s_retention.lock);
  339. sleep_retention_entries_do_destroy(module);
  340. if (s_retention.modules == 0) {
  341. sleep_retention_entries_check_and_distroy_final_default();
  342. pmu_sleep_disable_regdma_backup();
  343. memset((void *)s_retention.lists, 0, sizeof(s_retention.lists));
  344. s_retention.highpri = (uint8_t)-1;
  345. _lock_release_recursive(&s_retention.lock);
  346. _lock_close_recursive(&s_retention.lock);
  347. s_retention.lock = NULL;
  348. return;
  349. }
  350. _lock_release_recursive(&s_retention.lock);
  351. }
  352. static esp_err_t sleep_retention_entries_create_impl(const sleep_retention_entries_config_t retent[], int num, regdma_link_priority_t priority, int module)
  353. {
  354. _lock_acquire_recursive(&s_retention.lock);
  355. for (int i = num - 1; i >= 0; i--) {
  356. #if SOC_PM_RETENTION_HAS_CLOCK_BUG
  357. if ((retent[i].owner > BIT(EXTRA_LINK_NUM)) && (retent[i].config.id != 0xffff)) {
  358. _lock_release_recursive(&s_retention.lock);
  359. sleep_retention_entries_do_destroy(module);
  360. return ESP_ERR_NOT_SUPPORTED;
  361. }
  362. #endif
  363. void *link = sleep_retention_entries_try_create(&retent[i].config, retent[i].owner, priority, module);
  364. if (link == NULL) {
  365. _lock_release_recursive(&s_retention.lock);
  366. sleep_retention_entries_do_destroy(module);
  367. return ESP_ERR_NO_MEM;
  368. }
  369. sleep_retention_entries_update(retent[i].owner, link, priority);
  370. }
  371. _lock_release_recursive(&s_retention.lock);
  372. return ESP_OK;
  373. }
  374. static esp_err_t sleep_retention_entries_create_bonding(regdma_link_priority_t priority, uint32_t module)
  375. {
  376. static const sleep_retention_entries_config_t bonding_dummy = { REGDMA_LINK_WAIT_INIT(0xffff, 0, 0, 0, 1, 1), SLEEP_RETENTION_ENTRY_BITMAP_MASK };
  377. _lock_acquire_recursive(&s_retention.lock);
  378. void *link = sleep_retention_entries_try_create_bonding(&bonding_dummy.config, bonding_dummy.owner, priority, module);
  379. if (link == NULL) {
  380. _lock_release_recursive(&s_retention.lock);
  381. sleep_retention_entries_do_destroy(module);
  382. return ESP_ERR_NO_MEM;
  383. }
  384. sleep_retention_entries_update(bonding_dummy.owner, link, priority);
  385. _lock_release_recursive(&s_retention.lock);
  386. return ESP_OK;
  387. }
  388. static void sleep_retention_entries_join(void)
  389. {
  390. void *entries_tail = NULL;
  391. _lock_acquire_recursive(&s_retention.lock);
  392. s_retention.highpri = SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY;
  393. for (regdma_link_priority_t priority = 0; priority < SLEEP_RETENTION_REGDMA_LINK_NR_PRIORITIES; priority++) {
  394. if (s_retention.lists[priority].entries_bitmap == 0) continue;
  395. if (priority < s_retention.highpri) { s_retention.highpri = priority; }
  396. if (entries_tail) {
  397. regdma_link_update_next_safe(
  398. entries_tail,
  399. s_retention.lists[priority].entries[0],
  400. s_retention.lists[priority].entries[1],
  401. s_retention.lists[priority].entries[2],
  402. s_retention.lists[priority].entries[3]
  403. );
  404. }
  405. entries_tail = s_retention.lists[priority].entries_tail;
  406. }
  407. pau_regdma_set_entry_link_addr(&(s_retention.lists[s_retention.highpri].entries));
  408. _lock_release_recursive(&s_retention.lock);
  409. }
  410. static esp_err_t sleep_retention_entries_create_wrapper(const sleep_retention_entries_config_t retent[], int num, regdma_link_priority_t priority, uint32_t module)
  411. {
  412. _lock_acquire_recursive(&s_retention.lock);
  413. esp_err_t err = sleep_retention_entries_create_bonding(priority, module);
  414. if(err) goto error;
  415. err = sleep_retention_entries_create_impl(retent, num, priority, module);
  416. if(err) goto error;
  417. err = sleep_retention_entries_create_bonding(priority, module);
  418. if(err) goto error;
  419. s_retention.modules |= module;
  420. sleep_retention_entries_join();
  421. error:
  422. _lock_release_recursive(&s_retention.lock);
  423. return err;
  424. }
  425. esp_err_t sleep_retention_entries_create(const sleep_retention_entries_config_t retent[], int num, regdma_link_priority_t priority, int module)
  426. {
  427. if (!(retent && num > 0 && (priority < SLEEP_RETENTION_REGDMA_LINK_NR_PRIORITIES) && (module != 0))) {
  428. return ESP_ERR_INVALID_ARG;
  429. }
  430. if (s_retention.lock == NULL) {
  431. _lock_init_recursive(&s_retention.lock);
  432. if (s_retention.lock == NULL) {
  433. ESP_LOGE(TAG, "Create sleep retention lock failed");
  434. return ESP_ERR_NO_MEM;
  435. }
  436. }
  437. esp_err_t err = sleep_retention_entries_check_and_create_final_default();
  438. if (err) goto error;
  439. err = sleep_retention_entries_create_wrapper(retent, num, priority, module);
  440. if (err) goto error;
  441. pmu_sleep_enable_regdma_backup();
  442. ESP_ERROR_CHECK(esp_deep_sleep_register_hook(&pmu_sleep_disable_regdma_backup));
  443. error:
  444. return err;
  445. }
  446. void sleep_retention_entries_get(sleep_retention_entries_t *entries)
  447. {
  448. memset(entries, 0, sizeof(sleep_retention_entries_t));
  449. _lock_acquire_recursive(&s_retention.lock);
  450. if (s_retention.highpri >= SLEEP_RETENTION_REGDMA_LINK_HIGHEST_PRIORITY &&
  451. s_retention.highpri <= SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY) {
  452. memcpy(entries, &s_retention.lists[s_retention.highpri].entries, sizeof(sleep_retention_entries_t));
  453. }
  454. _lock_release_recursive(&s_retention.lock);
  455. }
  456. uint32_t IRAM_ATTR sleep_retention_get_modules(void)
  457. {
  458. return s_retention.modules;
  459. }
  460. #if SOC_PM_RETENTION_HAS_CLOCK_BUG
  461. void sleep_retention_do_extra_retention(bool backup_or_restore)
  462. {
  463. _lock_acquire_recursive(&s_retention.lock);
  464. if (s_retention.highpri < SLEEP_RETENTION_REGDMA_LINK_HIGHEST_PRIORITY ||
  465. s_retention.highpri > SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY) {
  466. _lock_release_recursive(&s_retention.lock);
  467. return;
  468. }
  469. const uint32_t clk_bug_modules = SLEEP_RETENTION_MODULE_BLE_MAC | SLEEP_RETENTION_MODULE_802154_MAC;
  470. const int cnt_modules = __builtin_popcount(clk_bug_modules & s_retention.modules);
  471. // Set extra linked list head pointer to hardware
  472. pau_regdma_set_extra_link_addr(s_retention.lists[s_retention.highpri].entries[EXTRA_LINK_NUM]);
  473. if (backup_or_restore) {
  474. if (s_retention.extra_refs++ == (cnt_modules - 1)) {
  475. pau_regdma_trigger_extra_link_backup();
  476. }
  477. } else {
  478. if (--s_retention.extra_refs == (cnt_modules - 1)) {
  479. pau_regdma_trigger_extra_link_restore();
  480. }
  481. }
  482. int refs = s_retention.extra_refs;
  483. _lock_release_recursive(&s_retention.lock);
  484. assert(refs >= 0 && refs <= cnt_modules);
  485. }
  486. void sleep_retention_module_deinit(void)
  487. {
  488. _lock_acquire_recursive(&s_retention.lock);
  489. if (s_retention.extra_refs) {
  490. s_retention.extra_refs--;
  491. }
  492. _lock_release_recursive(&s_retention.lock);
  493. }
  494. #endif
  495. #if SOC_PM_RETENTION_HAS_REGDMA_POWER_BUG
  496. void IRAM_ATTR sleep_retention_do_system_retention(bool backup_or_restore)
  497. {
  498. #define SYSTEM_LINK_NUM (0)
  499. if (s_retention.highpri >= SLEEP_RETENTION_REGDMA_LINK_HIGHEST_PRIORITY &&
  500. s_retention.highpri <= SLEEP_RETENTION_REGDMA_LINK_LOWEST_PRIORITY) {
  501. // Set extra linked list head pointer to hardware
  502. pau_regdma_set_system_link_addr(s_retention.lists[s_retention.highpri].entries[SYSTEM_LINK_NUM]);
  503. if (backup_or_restore) {
  504. pau_regdma_trigger_system_link_backup();
  505. } else {
  506. pau_regdma_trigger_system_link_restore();
  507. }
  508. }
  509. }
  510. #endif