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