blob: 68901a5530a654d1d7e5c068846c283684830960 [file] [log] [blame]
Dave Barach6a5adc32018-07-04 10:56:23 -04001/*
2 * Copyright (c) 2015 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
6 *
7 * http://www.apache.org/licenses/LICENSE-2.0
8 *
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
14 */
15
16#include <vppinfra/format.h>
17#include <vppinfra/dlmalloc.h>
18#include <vppinfra/os.h>
19#include <vppinfra/lock.h>
20#include <vppinfra/hash.h>
21#include <vppinfra/elf_clib.h>
BenoƮt Ganne9fb6d402019-04-15 15:28:21 +020022#include <vppinfra/sanitizer.h>
Dave Barach6a5adc32018-07-04 10:56:23 -040023
24void *clib_per_cpu_mheaps[CLIB_MAX_MHEAPS];
25
26typedef struct
27{
28 /* Address of callers: outer first, inner last. */
29 uword callers[12];
30
31 /* Count of allocations with this traceback. */
32#if CLIB_VEC64 > 0
33 u64 n_allocations;
34#else
35 u32 n_allocations;
36#endif
37
38 /* Count of bytes allocated with this traceback. */
39 u32 n_bytes;
40
41 /* Offset of this item */
42 uword offset;
43} mheap_trace_t;
44
45typedef struct
46{
47 clib_spinlock_t lock;
48 uword enabled;
49
50 mheap_trace_t *traces;
51
52 /* Indices of free traces. */
53 u32 *trace_free_list;
54
55 /* Hash table mapping callers to trace index. */
56 uword *trace_by_callers;
57
58 /* Hash table mapping mheap offset to trace index. */
59 uword *trace_index_by_offset;
Dave Barachd67a4282019-06-15 12:46:13 -040060
61 /* So we can easily shut off current segment trace, if any */
62 void *current_traced_mheap;
63
Dave Barach6a5adc32018-07-04 10:56:23 -040064} mheap_trace_main_t;
65
66mheap_trace_main_t mheap_trace_main;
67
68void
69mheap_get_trace (uword offset, uword size)
70{
71 mheap_trace_main_t *tm = &mheap_trace_main;
72 mheap_trace_t *t;
73 uword i, n_callers, trace_index, *p;
74 mheap_trace_t trace;
75 uword save_enabled;
76
Dave Barachd67a4282019-06-15 12:46:13 -040077 if (tm->enabled == 0 || (clib_mem_get_heap () != tm->current_traced_mheap))
Dave Barach6a5adc32018-07-04 10:56:23 -040078 return;
79
80 /* Spurious Coverity warnings be gone. */
Dave Barachb7b92992018-10-17 10:38:51 -040081 clib_memset (&trace, 0, sizeof (trace));
Dave Barach6a5adc32018-07-04 10:56:23 -040082
83 /* Skip our frame and mspace_get_aligned's frame */
84 n_callers = clib_backtrace (trace.callers, ARRAY_LEN (trace.callers), 2);
85 if (n_callers == 0)
86 return;
87
Dave Barach6a5adc32018-07-04 10:56:23 -040088 clib_spinlock_lock (&tm->lock);
89
90 /* Turn off tracing to avoid embarrassment... */
91 save_enabled = tm->enabled;
92 tm->enabled = 0;
93
94 if (!tm->trace_by_callers)
95 tm->trace_by_callers =
96 hash_create_shmem (0, sizeof (trace.callers), sizeof (uword));
97
98 p = hash_get_mem (tm->trace_by_callers, &trace.callers);
99 if (p)
100 {
101 trace_index = p[0];
102 t = tm->traces + trace_index;
103 }
104 else
105 {
106 i = vec_len (tm->trace_free_list);
107 if (i > 0)
108 {
109 trace_index = tm->trace_free_list[i - 1];
110 _vec_len (tm->trace_free_list) = i - 1;
111 }
112 else
113 {
114 mheap_trace_t *old_start = tm->traces;
115 mheap_trace_t *old_end = vec_end (tm->traces);
116
117 vec_add2 (tm->traces, t, 1);
118
119 if (tm->traces != old_start)
120 {
121 hash_pair_t *p;
122 mheap_trace_t *q;
123 /* *INDENT-OFF* */
124 hash_foreach_pair (p, tm->trace_by_callers,
125 ({
126 q = uword_to_pointer (p->key, mheap_trace_t *);
127 ASSERT (q >= old_start && q < old_end);
128 p->key = pointer_to_uword (tm->traces + (q - old_start));
129 }));
130 /* *INDENT-ON* */
131 }
132 trace_index = t - tm->traces;
133 }
134
135 t = tm->traces + trace_index;
136 t[0] = trace;
137 t->n_allocations = 0;
138 t->n_bytes = 0;
139 hash_set_mem (tm->trace_by_callers, t->callers, trace_index);
140 }
141
142 t->n_allocations += 1;
143 t->n_bytes += size;
144 t->offset = offset; /* keep a sample to autopsy */
145 hash_set (tm->trace_index_by_offset, offset, t - tm->traces);
146 tm->enabled = save_enabled;
147 clib_spinlock_unlock (&tm->lock);
148}
149
150void
151mheap_put_trace (uword offset, uword size)
152{
153 mheap_trace_t *t;
154 uword trace_index, *p;
155 mheap_trace_main_t *tm = &mheap_trace_main;
156 uword save_enabled;
157
158 if (tm->enabled == 0)
159 return;
160
161 clib_spinlock_lock (&tm->lock);
162
163 /* Turn off tracing for a moment */
164 save_enabled = tm->enabled;
165 tm->enabled = 0;
166
167 p = hash_get (tm->trace_index_by_offset, offset);
168 if (!p)
169 {
170 tm->enabled = save_enabled;
171 clib_spinlock_unlock (&tm->lock);
172 return;
173 }
174
175 trace_index = p[0];
176 hash_unset (tm->trace_index_by_offset, offset);
177 ASSERT (trace_index < vec_len (tm->traces));
178
179 t = tm->traces + trace_index;
180 ASSERT (t->n_allocations > 0);
181 ASSERT (t->n_bytes >= size);
182 t->n_allocations -= 1;
183 t->n_bytes -= size;
184 if (t->n_allocations == 0)
185 {
186 hash_unset_mem (tm->trace_by_callers, t->callers);
187 vec_add1 (tm->trace_free_list, trace_index);
Dave Barachb7b92992018-10-17 10:38:51 -0400188 clib_memset (t, 0, sizeof (t[0]));
Dave Barach6a5adc32018-07-04 10:56:23 -0400189 }
190 tm->enabled = save_enabled;
191 clib_spinlock_unlock (&tm->lock);
192}
193
194always_inline void
195mheap_trace_main_free (mheap_trace_main_t * tm)
196{
197 vec_free (tm->traces);
198 vec_free (tm->trace_free_list);
199 hash_free (tm->trace_by_callers);
200 hash_free (tm->trace_index_by_offset);
201}
202
203/* Initialize CLIB heap based on memory/size given by user.
204 Set memory to 0 and CLIB will try to allocate its own heap. */
205void *
206clib_mem_init (void *memory, uword memory_size)
207{
208 u8 *heap;
209
210 if (memory)
211 {
212 heap = create_mspace_with_base (memory, memory_size, 1 /* locked */ );
213 mspace_disable_expand (heap);
214 }
215 else
216 heap = create_mspace (memory_size, 1 /* locked */ );
217
BenoƮt Ganneb2f09142019-12-16 15:37:28 +0100218 CLIB_MEM_POISON (mspace_least_addr (heap), mspace_footprint (heap));
219
Dave Barach6a5adc32018-07-04 10:56:23 -0400220 clib_mem_set_heap (heap);
221
222 if (mheap_trace_main.lock == 0)
223 clib_spinlock_init (&mheap_trace_main.lock);
224
225 return heap;
226}
227
228void *
229clib_mem_init_thread_safe (void *memory, uword memory_size)
230{
231 return clib_mem_init (memory, memory_size);
232}
233
Dave Barach6a5adc32018-07-04 10:56:23 -0400234u8 *
235format_clib_mem_usage (u8 * s, va_list * va)
236{
237 int verbose = va_arg (*va, int);
238 return format (s, "$$$$ heap at %llx verbose %d", clib_mem_get_heap (),
239 verbose);
240}
241
242/*
243 * Magic decoder ring for mallinfo stats (ala dlmalloc):
244 *
245 * size_t arena; / * Non-mmapped space allocated (bytes) * /
246 * size_t ordblks; / * Number of free chunks * /
247 * size_t smblks; / * Number of free fastbin blocks * /
248 * size_t hblks; / * Number of mmapped regions * /
249 * size_t hblkhd; / * Space allocated in mmapped regions (bytes) * /
250 * size_t usmblks; / * Maximum total allocated space (bytes) * /
251 * size_t fsmblks; / * Space in freed fastbin blocks (bytes) * /
252 * size_t uordblks; / * Total allocated space (bytes) * /
253 * size_t fordblks; / * Total free space (bytes) * /
254 * size_t keepcost; / * Top-most, releasable space (bytes) * /
255 *
256 */
257
258u8 *
259format_msize (u8 * s, va_list * va)
260{
261 uword a = va_arg (*va, uword);
262
263 if (a >= 1ULL << 30)
264 s = format (s, "%.2fG", (((f64) a) / ((f64) (1ULL << 30))));
265 else if (a >= 1ULL << 20)
266 s = format (s, "%.2fM", (((f64) a) / ((f64) (1ULL << 20))));
267 else if (a >= 1ULL << 10)
268 s = format (s, "%.2fK", (((f64) a) / ((f64) (1ULL << 10))));
269 else
270 s = format (s, "%lld", a);
271 return s;
272}
273
274static int
275mheap_trace_sort (const void *_t1, const void *_t2)
276{
277 const mheap_trace_t *t1 = _t1;
278 const mheap_trace_t *t2 = _t2;
279 word cmp;
280
281 cmp = (word) t2->n_bytes - (word) t1->n_bytes;
282 if (!cmp)
283 cmp = (word) t2->n_allocations - (word) t1->n_allocations;
284 return cmp;
285}
286
287u8 *
288format_mheap_trace (u8 * s, va_list * va)
289{
290 mheap_trace_main_t *tm = va_arg (*va, mheap_trace_main_t *);
291 int verbose = va_arg (*va, int);
292 int have_traces = 0;
293 int i;
294
295 clib_spinlock_lock (&tm->lock);
Dave Barachd67a4282019-06-15 12:46:13 -0400296 if (vec_len (tm->traces) > 0 &&
297 clib_mem_get_heap () == tm->current_traced_mheap)
Dave Barach6a5adc32018-07-04 10:56:23 -0400298 {
299 have_traces = 1;
300
301 /* Make a copy of traces since we'll be sorting them. */
302 mheap_trace_t *t, *traces_copy;
303 u32 indent, total_objects_traced;
304
305 traces_copy = vec_dup (tm->traces);
306
307 qsort (traces_copy, vec_len (traces_copy), sizeof (traces_copy[0]),
308 mheap_trace_sort);
309
310 total_objects_traced = 0;
311 s = format (s, "\n");
312 vec_foreach (t, traces_copy)
313 {
314 /* Skip over free elements. */
315 if (t->n_allocations == 0)
316 continue;
317
318 total_objects_traced += t->n_allocations;
319
320 /* When not verbose only report allocations of more than 1k. */
321 if (!verbose && t->n_bytes < 1024)
322 continue;
323
324 if (t == traces_copy)
325 s = format (s, "%=9s%=9s %=10s Traceback\n", "Bytes", "Count",
326 "Sample");
327 s = format (s, "%9d%9d %p", t->n_bytes, t->n_allocations, t->offset);
328 indent = format_get_indent (s);
329 for (i = 0; i < ARRAY_LEN (t->callers) && t->callers[i]; i++)
330 {
331 if (i > 0)
332 s = format (s, "%U", format_white_space, indent);
Damjan Marion4dffd1c2018-09-03 12:30:36 +0200333#if defined(CLIB_UNIX) && !defined(__APPLE__)
Dave Barach6a5adc32018-07-04 10:56:23 -0400334 /* $$$$ does this actually work? */
335 s =
336 format (s, " %U\n", format_clib_elf_symbol_with_address,
337 t->callers[i]);
338#else
339 s = format (s, " %p\n", t->callers[i]);
340#endif
341 }
342 }
343
344 s = format (s, "%d total traced objects\n", total_objects_traced);
345
346 vec_free (traces_copy);
347 }
348 clib_spinlock_unlock (&tm->lock);
349 if (have_traces == 0)
350 s = format (s, "no traced allocations\n");
351
352 return s;
353}
354
355
356u8 *
357format_mheap (u8 * s, va_list * va)
358{
359 void *heap = va_arg (*va, u8 *);
360 int verbose = va_arg (*va, int);
Dave Barachaf7dd5b2018-08-23 17:08:44 -0400361 struct dlmallinfo mi;
Dave Barach6a5adc32018-07-04 10:56:23 -0400362 mheap_trace_main_t *tm = &mheap_trace_main;
363
364 mi = mspace_mallinfo (heap);
365
366 s = format (s, "total: %U, used: %U, free: %U, trimmable: %U",
367 format_msize, mi.arena,
368 format_msize, mi.uordblks,
369 format_msize, mi.fordblks, format_msize, mi.keepcost);
370 if (verbose > 0)
371 {
372 s = format (s, "\n free chunks %llu free fastbin blks %llu",
373 mi.ordblks, mi.smblks);
374 s =
375 format (s, "\n max total allocated %U", format_msize, mi.usmblks);
376 }
377
Dave Barachd67a4282019-06-15 12:46:13 -0400378 if (mspace_is_traced (heap))
379 s = format (s, "\n%U", format_mheap_trace, tm, verbose);
Dave Barach6a5adc32018-07-04 10:56:23 -0400380 return s;
381}
382
383void
384clib_mem_usage (clib_mem_usage_t * u)
385{
386 clib_warning ("unimp");
387}
388
Ole Troan92e30822019-06-16 12:33:51 +0200389void
390mheap_usage (void *heap, clib_mem_usage_t * usage)
391{
392 struct dlmallinfo mi = mspace_mallinfo (heap);
393
394 /* TODO: Fill in some more values */
395 usage->object_count = 0;
396 usage->bytes_total = mi.arena;
397 usage->bytes_overhead = 0;
398 usage->bytes_max = 0;
399 usage->bytes_used = mi.uordblks;
400 usage->bytes_free = mi.fordblks;
401 usage->bytes_free_reclaimed = 0;
402}
403
Dave Barach6a5adc32018-07-04 10:56:23 -0400404/* Call serial number for debugger breakpoints. */
405uword clib_mem_validate_serial = 0;
406
407void
408clib_mem_validate (void)
409{
410 clib_warning ("unimp");
411}
412
413void
414mheap_trace (void *v, int enable)
415{
416 (void) mspace_enable_disable_trace (v, enable);
417
418 if (enable == 0)
419 mheap_trace_main_free (&mheap_trace_main);
420}
421
422void
423clib_mem_trace (int enable)
424{
425 mheap_trace_main_t *tm = &mheap_trace_main;
Dave Barachd67a4282019-06-15 12:46:13 -0400426 void *current_heap = clib_mem_get_heap ();
Dave Barach6a5adc32018-07-04 10:56:23 -0400427
428 tm->enabled = enable;
Dave Barachd67a4282019-06-15 12:46:13 -0400429 mheap_trace (current_heap, enable);
430
431 if (enable)
432 tm->current_traced_mheap = current_heap;
433 else
434 tm->current_traced_mheap = 0;
435}
436
437int
438clib_mem_is_traced (void)
439{
440 return mspace_is_traced (clib_mem_get_heap ());
Dave Barach6a5adc32018-07-04 10:56:23 -0400441}
442
443uword
444clib_mem_trace_enable_disable (uword enable)
445{
446 uword rv;
447 mheap_trace_main_t *tm = &mheap_trace_main;
448
449 rv = tm->enabled;
450 tm->enabled = enable;
451 return rv;
452}
453
454/*
455 * These API functions seem like layering violations, but
456 * by introducing them we greatly reduce the number
457 * of code changes required to use dlmalloc spaces
458 */
459void *
460mheap_alloc_with_lock (void *memory, uword size, int locked)
461{
462 void *rv;
463 if (memory == 0)
464 return create_mspace (size, locked);
465 else
466 {
467 rv = create_mspace_with_base (memory, size, locked);
468 if (rv)
469 mspace_disable_expand (rv);
470 return rv;
471 }
472}
473
474/*
475 * fd.io coding-style-patch-verification: ON
476 *
477 * Local Variables:
478 * eval: (c-set-style "gnu")
479 * End:
480 */