117     heap_trace_record_t *r_cur = NULL;  in map_find()  local
118     TAILQ_FOREACH(r_cur, &hash_map[idx], tailq_hashmap) {  in map_find()
119         if (r_cur->address == p) {  in map_find()
121             return r_cur;  in map_find()
304     heap_trace_record_t *r_cur = TAILQ_FIRST(&records.list);  in heap_trace_dump_base()  local
309         if (r_cur == NULL) {  in heap_trace_dump_base()
314         bool should_print = r_cur->address != NULL &&  in heap_trace_dump_base()
316              (internal_ram && esp_ptr_internal(r_cur->address)) ||  in heap_trace_dump_base()
317              (psram && esp_ptr_external_ram(r_cur->address)));  in heap_trace_dump_base()
322             if (esp_ptr_internal(r_cur->address)) {  in heap_trace_dump_base()
325             if (esp_ptr_external_ram(r_cur->address)) {  in heap_trace_dump_base()
330                    r_cur->size, r_cur->address, label, r_cur->ccount & 1, r_cur->ccount & ~3);  in heap_trace_dump_base()
332             for (int j = 0; j < STACK_DEPTH && r_cur->alloced_by[j] != 0; j++) {  in heap_trace_dump_base()
333                 esp_rom_printf("%p%s", r_cur->alloced_by[j],  in heap_trace_dump_base()
337             if (mode != HEAP_TRACE_ALL || STACK_DEPTH == 0 || r_cur->freed_by[0] == NULL) {  in heap_trace_dump_base()
338                 delta_size += r_cur->size;  in heap_trace_dump_base()
344                     esp_rom_printf("%p%s", r_cur->freed_by[j],  in heap_trace_dump_base()
350         r_cur = TAILQ_NEXT(r_cur, tailq_list);  in heap_trace_dump_base()
467         heap_trace_record_t *r_cur = &records.buffer[i];  in list_setup()  local
469         TAILQ_INSERT_TAIL(&records.unused, r_cur, tailq_list);  in list_setup()
583     heap_trace_record_t *r_cur = NULL;  in list_find_address_reverse()  local
584     TAILQ_FOREACH(r_cur, &records.list, tailq_list) {  in list_find_address_reverse()
585         if (r_cur->address == p) {  in list_find_address_reverse()
586             r_found = r_cur;  in list_find_address_reverse()