2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2005-2006 Robert N. M. Watson
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 #include <sys/param.h>
32 #include <sys/cpuset.h>
33 #include <sys/sysctl.h>
36 #include <vm/uma_int.h>
49 #include "memstat_internal.h"
51 static struct nlist namelist[] = {
53 { .n_name = "_uma_kegs" },
55 { .n_name = "_mp_maxid" },
57 { .n_name = "_all_cpus" },
58 #define X_VM_NDOMAINS 3
59 { .n_name = "_vm_ndomains" },
64 * Extract uma(9) statistics from the running kernel, and store all memory
65 * type information in the passed list. For each type, check the list for an
66 * existing entry with the right name/allocator -- if present, update that
67 * entry. Otherwise, add a new entry. On error, the entire list will be
68 * cleared, as entries will be in an inconsistent state.
70 * To reduce the level of work for a list that starts empty, we keep around a
71 * hint as to whether it was empty when we began, so we can avoid searching
72 * the list for entries to update. Updates are O(n^2) due to searching for
73 * each entry before adding it.
76 memstat_sysctl_uma(struct memory_type_list *list, int flags)
78 struct uma_stream_header *ushp;
79 struct uma_type_header *uthp;
80 struct uma_percpu_stat *upsp;
81 struct memory_type *mtp;
82 int count, hint_dontsearch, i, j, maxcpus, maxid;
86 hint_dontsearch = LIST_EMPTY(&list->mtl_list);
89 * Query the number of CPUs, number of malloc types so that we can
90 * guess an initial buffer size. We loop until we succeed or really
91 * fail. Note that the value of maxcpus we query using sysctl is not
92 * the version we use when processing the real data -- that is read
97 if (sysctlbyname("kern.smp.maxid", &maxid, &size, NULL, 0) < 0) {
98 if (errno == EACCES || errno == EPERM)
99 list->mtl_error = MEMSTAT_ERROR_PERMISSION;
101 list->mtl_error = MEMSTAT_ERROR_DATAERROR;
104 if (size != sizeof(maxid)) {
105 list->mtl_error = MEMSTAT_ERROR_DATAERROR;
109 size = sizeof(count);
110 if (sysctlbyname("vm.zone_count", &count, &size, NULL, 0) < 0) {
111 if (errno == EACCES || errno == EPERM)
112 list->mtl_error = MEMSTAT_ERROR_PERMISSION;
114 list->mtl_error = MEMSTAT_ERROR_VERSION;
117 if (size != sizeof(count)) {
118 list->mtl_error = MEMSTAT_ERROR_DATAERROR;
122 size = sizeof(*uthp) + count * (sizeof(*uthp) + sizeof(*upsp) *
125 buffer = malloc(size);
126 if (buffer == NULL) {
127 list->mtl_error = MEMSTAT_ERROR_NOMEMORY;
131 if (sysctlbyname("vm.zone_stats", buffer, &size, NULL, 0) < 0) {
133 * XXXRW: ENOMEM is an ambiguous return, we should bound the
134 * number of loops, perhaps.
136 if (errno == ENOMEM) {
140 if (errno == EACCES || errno == EPERM)
141 list->mtl_error = MEMSTAT_ERROR_PERMISSION;
143 list->mtl_error = MEMSTAT_ERROR_VERSION;
153 if (size < sizeof(*ushp)) {
154 list->mtl_error = MEMSTAT_ERROR_VERSION;
159 ushp = (struct uma_stream_header *)p;
162 if (ushp->ush_version != UMA_STREAM_VERSION) {
163 list->mtl_error = MEMSTAT_ERROR_VERSION;
169 * For the remainder of this function, we are quite trusting about
170 * the layout of structures and sizes, since we've determined we have
171 * a matching version and acceptable CPU count.
173 maxcpus = ushp->ush_maxcpus;
174 count = ushp->ush_count;
175 for (i = 0; i < count; i++) {
176 uthp = (struct uma_type_header *)p;
179 if (hint_dontsearch == 0) {
180 mtp = memstat_mtl_find(list, ALLOCATOR_UMA,
185 mtp = _memstat_mt_allocate(list, ALLOCATOR_UMA,
186 uthp->uth_name, maxid + 1);
188 _memstat_mtl_empty(list);
190 list->mtl_error = MEMSTAT_ERROR_NOMEMORY;
195 * Reset the statistics on a current node.
197 _memstat_mt_reset_stats(mtp, maxid + 1);
199 mtp->mt_numallocs = uthp->uth_allocs;
200 mtp->mt_numfrees = uthp->uth_frees;
201 mtp->mt_failures = uthp->uth_fails;
202 mtp->mt_sleeps = uthp->uth_sleeps;
204 for (j = 0; j < maxcpus; j++) {
205 upsp = (struct uma_percpu_stat *)p;
208 mtp->mt_percpu_cache[j].mtp_free =
209 upsp->ups_cache_free;
210 mtp->mt_free += upsp->ups_cache_free;
211 mtp->mt_numallocs += upsp->ups_allocs;
212 mtp->mt_numfrees += upsp->ups_frees;
215 mtp->mt_size = uthp->uth_size;
216 mtp->mt_rsize = uthp->uth_rsize;
217 mtp->mt_memalloced = mtp->mt_numallocs * uthp->uth_size;
218 mtp->mt_memfreed = mtp->mt_numfrees * uthp->uth_size;
219 mtp->mt_bytes = mtp->mt_memalloced - mtp->mt_memfreed;
220 mtp->mt_countlimit = uthp->uth_limit;
221 mtp->mt_byteslimit = uthp->uth_limit * uthp->uth_size;
223 mtp->mt_count = mtp->mt_numallocs - mtp->mt_numfrees;
224 mtp->mt_zonefree = uthp->uth_zone_free;
227 * UMA secondary zones share a keg with the primary zone. To
228 * avoid double-reporting of free items, report keg free
229 * items only in the primary zone.
231 if (!(uthp->uth_zone_flags & UTH_ZONE_SECONDARY)) {
232 mtp->mt_kegfree = uthp->uth_keg_free;
233 mtp->mt_free += mtp->mt_kegfree;
235 mtp->mt_free += mtp->mt_zonefree;
244 kread(kvm_t *kvm, void *kvm_pointer, void *address, size_t size,
249 ret = kvm_read(kvm, (unsigned long)kvm_pointer + offset, address,
252 return (MEMSTAT_ERROR_KVM);
253 if ((size_t)ret != size)
254 return (MEMSTAT_ERROR_KVM_SHORTREAD);
259 kread_string(kvm_t *kvm, const void *kvm_pointer, char *buffer, int buflen)
264 for (i = 0; i < buflen; i++) {
265 ret = kvm_read(kvm, (unsigned long)kvm_pointer + i,
266 &(buffer[i]), sizeof(char));
268 return (MEMSTAT_ERROR_KVM);
269 if ((size_t)ret != sizeof(char))
270 return (MEMSTAT_ERROR_KVM_SHORTREAD);
271 if (buffer[i] == '\0')
280 kread_symbol(kvm_t *kvm, int index, void *address, size_t size,
285 ret = kvm_read(kvm, namelist[index].n_value + offset, address, size);
287 return (MEMSTAT_ERROR_KVM);
288 if ((size_t)ret != size)
289 return (MEMSTAT_ERROR_KVM_SHORTREAD);
294 * memstat_kvm_uma() is similar to memstat_sysctl_uma(), only it extracts
295 * UMA(9) statistics from a kernel core/memory file.
298 memstat_kvm_uma(struct memory_type_list *list, void *kvm_handle)
300 LIST_HEAD(, uma_keg) uma_kegs;
301 struct memory_type *mtp;
302 struct uma_zone_domain uzd;
303 struct uma_bucket *ubp, ub;
304 struct uma_cache *ucp, *ucp_array;
305 struct uma_zone *uzp, uz;
306 struct uma_keg *kzp, kz;
307 int hint_dontsearch, i, mp_maxid, ndomains, ret;
308 char name[MEMTYPE_MAXNAME];
313 kvm = (kvm_t *)kvm_handle;
314 hint_dontsearch = LIST_EMPTY(&list->mtl_list);
315 if (kvm_nlist(kvm, namelist) != 0) {
316 list->mtl_error = MEMSTAT_ERROR_KVM;
319 if (namelist[X_UMA_KEGS].n_type == 0 ||
320 namelist[X_UMA_KEGS].n_value == 0) {
321 list->mtl_error = MEMSTAT_ERROR_KVM_NOSYMBOL;
324 ret = kread_symbol(kvm, X_MP_MAXID, &mp_maxid, sizeof(mp_maxid), 0);
326 list->mtl_error = ret;
329 ret = kread_symbol(kvm, X_VM_NDOMAINS, &ndomains,
330 sizeof(ndomains), 0);
332 list->mtl_error = ret;
335 ret = kread_symbol(kvm, X_UMA_KEGS, &uma_kegs, sizeof(uma_kegs), 0);
337 list->mtl_error = ret;
340 cpusetsize = sysconf(_SC_CPUSET_SIZE);
341 if (cpusetsize == -1 || (u_long)cpusetsize > sizeof(cpuset_t)) {
342 list->mtl_error = MEMSTAT_ERROR_KVM_NOSYMBOL;
346 ret = kread_symbol(kvm, X_ALL_CPUS, &all_cpus, cpusetsize, 0);
348 list->mtl_error = ret;
351 ucp_array = malloc(sizeof(struct uma_cache) * (mp_maxid + 1));
352 if (ucp_array == NULL) {
353 list->mtl_error = MEMSTAT_ERROR_NOMEMORY;
356 for (kzp = LIST_FIRST(&uma_kegs); kzp != NULL; kzp =
357 LIST_NEXT(&kz, uk_link)) {
358 ret = kread(kvm, kzp, &kz, sizeof(kz), 0);
361 _memstat_mtl_empty(list);
362 list->mtl_error = ret;
365 for (uzp = LIST_FIRST(&kz.uk_zones); uzp != NULL; uzp =
366 LIST_NEXT(&uz, uz_link)) {
367 ret = kread(kvm, uzp, &uz, sizeof(uz), 0);
370 _memstat_mtl_empty(list);
371 list->mtl_error = ret;
374 ret = kread(kvm, uzp, ucp_array,
375 sizeof(struct uma_cache) * (mp_maxid + 1),
376 offsetof(struct uma_zone, uz_cpu[0]));
379 _memstat_mtl_empty(list);
380 list->mtl_error = ret;
383 ret = kread_string(kvm, uz.uz_name, name,
387 _memstat_mtl_empty(list);
388 list->mtl_error = ret;
391 if (hint_dontsearch == 0) {
392 mtp = memstat_mtl_find(list, ALLOCATOR_UMA,
397 mtp = _memstat_mt_allocate(list, ALLOCATOR_UMA,
401 _memstat_mtl_empty(list);
402 list->mtl_error = MEMSTAT_ERROR_NOMEMORY;
406 * Reset the statistics on a current node.
408 _memstat_mt_reset_stats(mtp, mp_maxid + 1);
409 mtp->mt_numallocs = uz.uz_allocs;
410 mtp->mt_numfrees = uz.uz_frees;
411 mtp->mt_failures = uz.uz_fails;
412 mtp->mt_sleeps = uz.uz_sleeps;
413 if (kz.uk_flags & UMA_ZFLAG_INTERNAL)
415 for (i = 0; i < mp_maxid + 1; i++) {
416 if (!CPU_ISSET(i, &all_cpus))
419 mtp->mt_numallocs += ucp->uc_allocs;
420 mtp->mt_numfrees += ucp->uc_frees;
422 if (ucp->uc_allocbucket != NULL) {
423 ret = kread(kvm, ucp->uc_allocbucket,
427 _memstat_mtl_empty(list);
428 list->mtl_error = ret;
431 mtp->mt_free += ub.ub_cnt;
433 if (ucp->uc_freebucket != NULL) {
434 ret = kread(kvm, ucp->uc_freebucket,
438 _memstat_mtl_empty(list);
439 list->mtl_error = ret;
442 mtp->mt_free += ub.ub_cnt;
446 mtp->mt_size = kz.uk_size;
447 mtp->mt_rsize = kz.uk_rsize;
448 mtp->mt_memalloced = mtp->mt_numallocs * mtp->mt_size;
449 mtp->mt_memfreed = mtp->mt_numfrees * mtp->mt_size;
450 mtp->mt_bytes = mtp->mt_memalloced - mtp->mt_memfreed;
452 mtp->mt_countlimit = kz.uk_maxpages /
455 mtp->mt_countlimit = kz.uk_maxpages *
457 mtp->mt_byteslimit = mtp->mt_countlimit * mtp->mt_size;
458 mtp->mt_count = mtp->mt_numallocs - mtp->mt_numfrees;
459 for (i = 0; i < ndomains; i++) {
460 ret = kread(kvm, &uz.uz_domain[i], &uzd,
463 LIST_FIRST(&uzd.uzd_buckets);
465 ubp = LIST_NEXT(&ub, ub_link)) {
466 ret = kread(kvm, ubp, &ub,
468 mtp->mt_zonefree += ub.ub_cnt;
471 if (!((kz.uk_flags & UMA_ZONE_SECONDARY) &&
472 LIST_FIRST(&kz.uk_zones) != uzp)) {
473 mtp->mt_kegfree = kz.uk_free;
474 mtp->mt_free += mtp->mt_kegfree;
476 mtp->mt_free += mtp->mt_zonefree;