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/param.h>
31#include <sys/sysctl.h>
32#include <sys/user.h>
33#include <stdlib.h>
34#include <string.h>
35
36#include "libutil.h"
37
38
39/*
40 * Sort processes first by pid and then tid.
41 */
42static int
43kinfo_proc_compare(const void *a, const void *b)
44{
45	int i;
46
47	i = ((const struct kinfo_proc *)a)->ki_pid -
48	    ((const struct kinfo_proc *)b)->ki_pid;
49	if (i != 0)
50		return (i);
51	i = ((const struct kinfo_proc *)a)->ki_tid -
52	    ((const struct kinfo_proc *)b)->ki_tid;
53	return (i);
54}
55
56static void
57kinfo_proc_sort(struct kinfo_proc *kipp, int count)
58{
59
60	qsort(kipp, count, sizeof(*kipp), kinfo_proc_compare);
61}
62
63struct kinfo_proc *
64kinfo_getallproc(int *cntp)
65{
66	struct kinfo_proc *kipp;
67	size_t len;
68	int mib[3];
69
70	mib[0] = CTL_KERN;
71	mib[1] = KERN_PROC;
72	mib[2] = KERN_PROC_PROC;
73
74	len = 0;
75	if (sysctl(mib, nitems(mib), NULL, &len, NULL, 0) < 0)
76		return (NULL);
77
78	kipp = malloc(len);
79	if (kipp == NULL)
80		return (NULL);
81
82	if (sysctl(mib, nitems(mib), kipp, &len, NULL, 0) < 0)
83		goto bad;
84	if (len % sizeof(*kipp) != 0)
85		goto bad;
86	if (kipp->ki_structsize != sizeof(*kipp))
87		goto bad;
88	*cntp = len / sizeof(*kipp);
89	kinfo_proc_sort(kipp, len / sizeof(*kipp));
90	return (kipp);
91bad:
92	*cntp = 0;
93	free(kipp);
94	return (NULL);
95}
96