]> git.proxmox.com Git - mirror_frr.git/blob - lib/memory.c
Merge pull request #805 from Orange-OpenSource/master
[mirror_frr.git] / lib / memory.c
1 /*
2 * Copyright (c) 2015-16 David Lamparter, for NetDEF, Inc.
3 *
4 * Permission to use, copy, modify, and distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
7 *
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
15 */
16
17 #include <zebra.h>
18
19 #include <stdlib.h>
20
21 #include "memory.h"
22 #include "log.h"
23
24 static struct memgroup *mg_first = NULL;
25 struct memgroup **mg_insert = &mg_first;
26
27 DEFINE_MGROUP(LIB, "libfrr")
28 DEFINE_MTYPE(LIB, TMP, "Temporary memory")
29
30 static inline void mt_count_alloc(struct memtype *mt, size_t size)
31 {
32 size_t oldsize;
33
34 atomic_fetch_add_explicit(&mt->n_alloc, 1, memory_order_relaxed);
35
36 oldsize = atomic_load_explicit(&mt->size, memory_order_relaxed);
37 if (oldsize == 0)
38 oldsize = atomic_exchange_explicit(&mt->size, size,
39 memory_order_relaxed);
40 if (oldsize != 0 && oldsize != size && oldsize != SIZE_VAR)
41 atomic_store_explicit(&mt->size, SIZE_VAR,
42 memory_order_relaxed);
43 }
44
45 static inline void mt_count_free(struct memtype *mt)
46 {
47 assert(mt->n_alloc);
48 atomic_fetch_sub_explicit(&mt->n_alloc, 1, memory_order_relaxed);
49 }
50
51 static inline void *mt_checkalloc(struct memtype *mt, void *ptr, size_t size)
52 {
53 if (__builtin_expect(ptr == NULL, 0)) {
54 memory_oom(size, mt->name);
55 return NULL;
56 }
57 mt_count_alloc(mt, size);
58 return ptr;
59 }
60
61 void *qmalloc(struct memtype *mt, size_t size)
62 {
63 return mt_checkalloc(mt, malloc(size), size);
64 }
65
66 void *qcalloc(struct memtype *mt, size_t size)
67 {
68 return mt_checkalloc(mt, calloc(size, 1), size);
69 }
70
71 void *qrealloc(struct memtype *mt, void *ptr, size_t size)
72 {
73 if (ptr)
74 mt_count_free(mt);
75 return mt_checkalloc(mt, ptr ? realloc(ptr, size) : malloc(size), size);
76 }
77
78 void *qstrdup(struct memtype *mt, const char *str)
79 {
80 return mt_checkalloc(mt, strdup(str), strlen(str) + 1);
81 }
82
83 void qfree(struct memtype *mt, void *ptr)
84 {
85 if (ptr)
86 mt_count_free(mt);
87 free(ptr);
88 }
89
90 int qmem_walk(qmem_walk_fn *func, void *arg)
91 {
92 struct memgroup *mg;
93 struct memtype *mt;
94 int rv;
95
96 for (mg = mg_first; mg; mg = mg->next) {
97 if ((rv = func(arg, mg, NULL)))
98 return rv;
99 for (mt = mg->types; mt; mt = mt->next)
100 if ((rv = func(arg, mg, mt)))
101 return rv;
102 }
103 return 0;
104 }
105
106 struct exit_dump_args {
107 const char *prefix;
108 int error;
109 };
110
111 static int qmem_exit_walker(void *arg, struct memgroup *mg, struct memtype *mt)
112 {
113 struct exit_dump_args *eda = arg;
114
115 if (!mt) {
116 fprintf(stderr,
117 "%s: showing active allocations in "
118 "memory group %s\n",
119 eda->prefix, mg->name);
120
121 } else if (mt->n_alloc) {
122 char size[32];
123 eda->error++;
124 snprintf(size, sizeof(size), "%10zu", mt->size);
125 fprintf(stderr, "%s: memstats: %-30s: %6zu * %s\n",
126 eda->prefix, mt->name, mt->n_alloc,
127 mt->size == SIZE_VAR ? "(variably sized)" : size);
128 }
129 return 0;
130 }
131
132 void log_memstats_stderr(const char *prefix)
133 {
134 struct exit_dump_args eda = {.prefix = prefix, .error = 0};
135 qmem_walk(qmem_exit_walker, &eda);
136 }