forked from eclipse-wakaama/wakaama
-
Notifications
You must be signed in to change notification settings - Fork 0
/
memtrace.c
182 lines (165 loc) · 5.46 KB
/
memtrace.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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
/*******************************************************************************
*
* Copyright (c) 2015 Bosch Software Innvoations GmbH and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v2.0
* and Eclipse Distribution License v1.0 which accompany this distribution.
*
* The Eclipse Public License is available at
* http://www.eclipse.org/legal/epl-v20.html
* The Eclipse Distribution License is available at
* http://www.eclipse.org/org/documents/edl-v10.php.
*
* Contributors:
* Bosch Software Innovations GmbH - Please refer to git log
*
*******************************************************************************/
#include "internals.h"
#ifdef LWM2M_MEMORY_TRACE
#undef malloc
#undef free
#undef strdup
typedef struct MemoryEntry {
struct MemoryEntry* next;
const char *file;
const char *function;
int lineno;
size_t size;
int count;
uint32_t data[1];
} memory_entry_t;
static memory_entry_t prv_memory_malloc_list = { .next = NULL, .file = "head", .function="malloc", .lineno = 0, .size = 0, .count = 0};
static memory_entry_t prv_memory_free_list = { .next = NULL, .file = "head", .function="free", .lineno = 0, .size = 0, .count = 0};
static memory_entry_t* prv_memory_find_previous(memory_entry_t* list, void* memory)
{
while (NULL != list->next)
{
if (list->next->data == memory)
{
return list;
}
list = list->next;
}
return NULL;
}
static void prv_trace_add_free_list(memory_entry_t* remove, const char* file, const char* function, int lineno)
{
remove->next = prv_memory_free_list.next;
prv_memory_free_list.next = remove;
remove->file = file;
remove->function = function;
remove->lineno = lineno;
if (prv_memory_free_list.count < 200)
{
++prv_memory_free_list.count;
}
else if (NULL != remove->next)
{
while (NULL != remove->next->next)
{
remove = remove->next;
}
free(remove->next);
remove->next = NULL;
}
}
char* lwm2m_trace_strdup(const char* str, const char* file, const char* function, int lineno)
{
size_t length = strlen(str);
char* result = lwm2m_trace_malloc(length +1, file, function, lineno);
memcpy(result, str, length);
result[length] = 0;
return result;
}
void* lwm2m_trace_malloc(size_t size, const char* file, const char* function, int lineno)
{
static int counter = 0;
memory_entry_t* entry = malloc(size + sizeof(memory_entry_t));
entry->next = prv_memory_malloc_list.next;
prv_memory_malloc_list.next = entry;
++prv_memory_malloc_list.count;
prv_memory_malloc_list.size += size;
prv_memory_malloc_list.lineno = 1;
entry->file = file;
entry->function = function;
entry->lineno = lineno;
entry->size = size;
entry->count = ++counter;
return &(entry->data);
}
void lwm2m_trace_free(void* mem, const char* file, const char* function, int lineno)
{
if (NULL != mem)
{
memory_entry_t* entry = prv_memory_find_previous(&prv_memory_malloc_list, mem);
if (NULL != entry)
{
memory_entry_t* remove = entry->next;
entry->next = remove->next;
--prv_memory_malloc_list.count;
prv_memory_malloc_list.size -= remove->size;
prv_memory_malloc_list.lineno = 1;
prv_trace_add_free_list(remove, file, function, lineno);
}
else
{
fprintf(stderr, "memory: free error (no malloc) %s, %d, %s\n", file, lineno, function);
memory_entry_t* entry = prv_memory_find_previous(&prv_memory_free_list, mem);
if (NULL != entry)
{
entry = entry->next;
fprintf(stderr, "memory: already frees at %s, %d, %s\n", entry->file, entry->lineno, entry->function);
}
}
}
}
void trace_print(int loops, int level)
{
static int counter = 0;
if (0 == loops)
{
counter = 0;
}
else
{
++counter;
}
if (0 == loops || (((counter % loops) == 0) && prv_memory_malloc_list.lineno))
{
prv_memory_malloc_list.lineno = 0;
if (1 == level)
{
size_t total = 0;
int entries = 0;
memory_entry_t* entry = prv_memory_malloc_list.next;
while (NULL != entry)
{
fprintf(stdout,"memory: #%d, %lu bytes, %s, %d, %s\n", entry->count, (unsigned long) entry->size, entry->file, entry->lineno, entry->function);
++entries;
total += entry->size;
entry = entry->next;
}
if (entries != prv_memory_malloc_list.count)
{
fprintf(stderr,"memory: error %d entries != %d\n", prv_memory_malloc_list.count, entries);
}
if (total != prv_memory_malloc_list.size)
{
fprintf(stdout,"memory: error %lu total bytes != %lu\n", (unsigned long) prv_memory_malloc_list.size, (unsigned long) total);
}
}
fprintf(stdout,"memory: %d entries, %lu total bytes\n", prv_memory_malloc_list.count, (unsigned long) prv_memory_malloc_list.size);
}
}
void trace_status(int* blocks, size_t* size)
{
if (NULL != blocks)
{
*blocks = prv_memory_malloc_list.count;
}
if (NULL != size)
{
*size = prv_memory_malloc_list.size;
}
}
#endif