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