ESP-IDF
Select one of the symbols to view example projects that use it.
 
Outline
#include <freertos/FreeRTOS.h>
#include <freertos/task.h>
#include <multi_heap.h>
#include "multi_heap_internal.h"
#include "heap_private.h"
#include "esp_heap_task_info.h"
heap_caps_get_per_task_info(heap_task_info_params_t *)
Files
loading (3/5)...
SourceVuESP-IDF Framework and ExamplesESP-IDFcomponents/heap/heap_task_info.c
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
/* * SPDX-FileCopyrightText: 2018-2022 Espressif Systems (Shanghai) CO LTD * * SPDX-License-Identifier: Apache-2.0 *//* ... */ #include <freertos/FreeRTOS.h> #include <freertos/task.h> #include <multi_heap.h> #include "multi_heap_internal.h" #include "heap_private.h" #include "esp_heap_task_info.h"6 includes #ifdef CONFIG_HEAP_TASK_TRACKING /* * Return per-task heap allocation totals and lists of blocks. * * For each task that has allocated memory from the heap, return totals for * allocations within regions matching one or more sets of capabilities. * * Optionally also return an array of structs providing details about each * block allocated by one or more requested tasks, or by all tasks. * * Returns the number of block detail structs returned. *//* ... */ size_t heap_caps_get_per_task_info(heap_task_info_params_t *params) { heap_t *reg; heap_task_block_t *blocks = params->blocks; size_t count = *params->num_totals; size_t remaining = params->max_blocks; // Clear out totals for any prepopulated tasks. if (params->totals) { for (size_t i = 0; i < count; ++i) { for (size_t type = 0; type < NUM_HEAP_TASK_CAPS; ++type) { params->totals[i].size[type] = 0; params->totals[i].count[type] = 0; }{...} }{...} }{...} SLIST_FOREACH(reg, &registered_heaps, next) { multi_heap_handle_t heap = reg->heap; if (heap == NULL) { continue; }{...} // Find if the capabilities of this heap region match on of the desired // sets of capabilities. uint32_t caps = get_all_caps(reg); uint32_t type; for (type = 0; type < NUM_HEAP_TASK_CAPS; ++type) { if ((caps & params->mask[type]) == params->caps[type]) { break; }{...} }{...} if (type == NUM_HEAP_TASK_CAPS) { continue; }{...} multi_heap_block_handle_t b = multi_heap_get_first_block(heap); multi_heap_internal_lock(heap); for ( ; b ; b = multi_heap_get_next_block(heap, b)) { if (multi_heap_is_free(b)) { continue; }{...} void *p = multi_heap_get_block_address(b); // Safe, only arithmetic size_t bsize = multi_heap_get_allocated_size(heap, p); // Validates TaskHandle_t btask = MULTI_HEAP_GET_BLOCK_OWNER(p); // Accumulate per-task allocation totals. if (params->totals) { size_t i; for (i = 0; i < count; ++i) { if (params->totals[i].task == btask) { break; }{...} }{...} if (i < count) { params->totals[i].size[type] += bsize; params->totals[i].count[type] += 1; }{...} else { if (count < params->max_totals) { params->totals[count].task = btask; params->totals[count].size[type] = bsize; params->totals[i].count[type] = 1; ++count; }{...} }{...} }{...} // Return details about allocated blocks for selected tasks. if (blocks && remaining > 0) { if (params->tasks) { size_t i; for (i = 0; i < params->num_tasks; ++i) { if (btask == params->tasks[i]) { break; }{...} }{...} if (i == params->num_tasks) { continue; }{...} }{...} blocks->task = btask; blocks->address = p; blocks->size = bsize; ++blocks; --remaining; }{...} }{...} multi_heap_internal_unlock(heap); }{...} *params->num_totals = count; return params->max_blocks - remaining; }{ ... } /* ... */#endif // CONFIG_HEAP_TASK_TRACKING
Details
Show:
from
Types: Columns: