1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 3 * 4 * Copyright (c) 2007 Robert N. M. Watson 5 * Copyright (c) 2009 Ulf Lilleengen 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29 30 #include <sys/cdefs.h> 31 #include <sys/param.h> 32 #include <sys/sysctl.h> 33 #include <sys/user.h> 34 #include <stdlib.h> 35 #include <string.h> 36 37 #include "libutil.h" 38 39 40 /* 41 * Sort processes first by pid and then tid. 42 */ 43 static int 44 kinfo_proc_compare(const void *a, const void *b) 45 { 46 int i; 47 48 i = ((const struct kinfo_proc *)a)->ki_pid - 49 ((const struct kinfo_proc *)b)->ki_pid; 50 if (i != 0) 51 return (i); 52 i = ((const struct kinfo_proc *)a)->ki_tid - 53 ((const struct kinfo_proc *)b)->ki_tid; 54 return (i); 55 } 56 57 static void 58 kinfo_proc_sort(struct kinfo_proc *kipp, int count) 59 { 60 61 qsort(kipp, count, sizeof(*kipp), kinfo_proc_compare); 62 } 63 64 struct kinfo_proc * 65 kinfo_getallproc(int *cntp) 66 { 67 struct kinfo_proc *kipp; 68 size_t len; 69 int mib[3]; 70 71 mib[0] = CTL_KERN; 72 mib[1] = KERN_PROC; 73 mib[2] = KERN_PROC_PROC; 74 75 len = 0; 76 if (sysctl(mib, nitems(mib), NULL, &len, NULL, 0) < 0) 77 return (NULL); 78 79 kipp = malloc(len); 80 if (kipp == NULL) 81 return (NULL); 82 83 if (sysctl(mib, nitems(mib), kipp, &len, NULL, 0) < 0) 84 goto bad; 85 if (len % sizeof(*kipp) != 0) 86 goto bad; 87 if (kipp->ki_structsize != sizeof(*kipp)) 88 goto bad; 89 *cntp = len / sizeof(*kipp); 90 kinfo_proc_sort(kipp, len / sizeof(*kipp)); 91 return (kipp); 92 bad: 93 *cntp = 0; 94 free(kipp); 95 return (NULL); 96 } 97