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
|
/*
* Copyright (c) 2015-16 David Lamparter, for NetDEF, Inc.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <zebra.h>
#include <stdlib.h>
#include "memory.h"
#include "log.h"
static struct memgroup *mg_first = NULL;
struct memgroup **mg_insert = &mg_first;
DEFINE_MGROUP(LIB, "libfrr")
DEFINE_MTYPE(LIB, TMP, "Temporary memory")
static inline void mt_count_alloc(struct memtype *mt, size_t size)
{
mt->n_alloc++;
if (mt->size == 0)
mt->size = size;
else if (mt->size != size)
mt->size = SIZE_VAR;
}
static inline void mt_count_free(struct memtype *mt)
{
assert(mt->n_alloc);
mt->n_alloc--;
}
static inline void *mt_checkalloc(struct memtype *mt, void *ptr, size_t size)
{
if (__builtin_expect(ptr == NULL, 0)) {
memory_oom(size, mt->name);
return NULL;
}
mt_count_alloc(mt, size);
return ptr;
}
void *qmalloc(struct memtype *mt, size_t size)
{
return mt_checkalloc(mt, malloc(size), size);
}
void *qcalloc(struct memtype *mt, size_t size)
{
return mt_checkalloc(mt, calloc(size, 1), size);
}
void *qrealloc(struct memtype *mt, void *ptr, size_t size)
{
if (ptr)
mt_count_free(mt);
return mt_checkalloc(mt, ptr ? realloc(ptr, size) : malloc(size), size);
}
void *qstrdup(struct memtype *mt, const char *str)
{
return mt_checkalloc(mt, strdup(str), strlen(str) + 1);
}
void qfree(struct memtype *mt, void *ptr)
{
if (ptr)
mt_count_free(mt);
free(ptr);
}
int qmem_walk(qmem_walk_fn *func, void *arg)
{
struct memgroup *mg;
struct memtype *mt;
int rv;
for (mg = mg_first; mg; mg = mg->next) {
if ((rv = func(arg, mg, NULL)))
return rv;
for (mt = mg->types; mt; mt = mt->next)
if ((rv = func(arg, mg, mt)))
return rv;
}
return 0;
}
struct exit_dump_args {
const char *prefix;
int error;
};
static int qmem_exit_walker(void *arg, struct memgroup *mg, struct memtype *mt)
{
struct exit_dump_args *eda = arg;
if (!mt) {
fprintf(stderr,
"%s: showing active allocations in memory group %s\n",
eda->prefix, mg->name);
} else if (mt->n_alloc) {
char size[32];
eda->error++;
snprintf(size, sizeof(size), "%10zu", mt->size);
fprintf(stderr, "%s: memstats: %-30s: %6zu * %s\n",
eda->prefix, mt->name, mt->n_alloc,
mt->size == SIZE_VAR ? "(variably sized)" : size);
}
return 0;
}
void log_memstats_stderr(const char *prefix)
{
struct exit_dump_args eda = {.prefix = prefix, .error = 0};
qmem_walk(qmem_exit_walker, &eda);
}
|
