2006-11-22 22:09:48 +05:30
|
|
|
/* vi: set sw=4 ts=4: */
|
|
|
|
/*
|
|
|
|
* taskset - retrieve or set a processes' CPU affinity
|
2008-09-25 17:43:34 +05:30
|
|
|
* Copyright (c) 2006 Bernhard Reutner-Fischer
|
2006-11-22 22:09:48 +05:30
|
|
|
*
|
2010-08-16 23:44:46 +05:30
|
|
|
* Licensed under GPLv2 or later, see file LICENSE in this source tree.
|
2006-11-22 22:09:48 +05:30
|
|
|
*/
|
2014-08-17 23:06:22 +05:30
|
|
|
//config:config TASKSET
|
2018-12-28 07:50:17 +05:30
|
|
|
//config: bool "taskset (4.2 kb)"
|
2017-01-29 22:49:29 +05:30
|
|
|
//config: default y
|
2014-08-17 23:06:22 +05:30
|
|
|
//config: help
|
2017-07-21 13:20:55 +05:30
|
|
|
//config: Retrieve or set a processes's CPU affinity.
|
|
|
|
//config: This requires sched_{g,s}etaffinity support in your libc.
|
2014-08-17 23:06:22 +05:30
|
|
|
//config:
|
|
|
|
//config:config FEATURE_TASKSET_FANCY
|
|
|
|
//config: bool "Fancy output"
|
|
|
|
//config: default y
|
|
|
|
//config: depends on TASKSET
|
|
|
|
//config: help
|
2017-07-21 13:20:55 +05:30
|
|
|
//config: Needed for machines with more than 32-64 CPUs:
|
|
|
|
//config: affinity parameter 0xHHHHHHHHHHHHHHHHHHHH can be arbitrarily long
|
|
|
|
//config: in this case. Otherwise, it is limited to sizeof(long).
|
2019-11-01 20:14:49 +05:30
|
|
|
//config:
|
|
|
|
//config:config FEATURE_TASKSET_CPULIST
|
|
|
|
//config: bool "CPU list support (-c option)"
|
|
|
|
//config: default y
|
|
|
|
//config: depends on FEATURE_TASKSET_FANCY
|
|
|
|
//config: help
|
|
|
|
//config: Add support for taking/printing affinity as CPU list when '-c'
|
|
|
|
//config: option is used. For example, it prints '0-3,7' instead of mask '8f'.
|
2014-08-17 23:06:22 +05:30
|
|
|
|
2017-08-04 23:25:01 +05:30
|
|
|
//applet:IF_TASKSET(APPLET_NOEXEC(taskset, taskset, BB_DIR_USR_BIN, BB_SUID_DROP, taskset))
|
2017-09-18 19:58:43 +05:30
|
|
|
|
2014-08-17 23:06:22 +05:30
|
|
|
//kbuild:lib-$(CONFIG_TASKSET) += taskset.o
|
|
|
|
|
2011-04-11 06:59:49 +05:30
|
|
|
//usage:#define taskset_trivial_usage
|
2021-06-19 21:12:35 +05:30
|
|
|
//usage: "[-ap] [HEXMASK"IF_FEATURE_TASKSET_CPULIST(" | -c LIST")"] { PID | PROG ARGS }"
|
2011-04-11 06:59:49 +05:30
|
|
|
//usage:#define taskset_full_usage "\n\n"
|
|
|
|
//usage: "Set or get CPU affinity\n"
|
2021-06-19 21:12:35 +05:30
|
|
|
//usage: "\n -p Operate on PID"
|
|
|
|
//usage: "\n -a Operate on all threads"
|
|
|
|
//usage: "\n -c Affinity is a list, not mask"
|
2011-04-11 06:59:49 +05:30
|
|
|
//usage:
|
|
|
|
//usage:#define taskset_example_usage
|
|
|
|
//usage: "$ taskset 0x7 ./dgemm_test&\n"
|
|
|
|
//usage: "$ taskset -p 0x1 $!\n"
|
|
|
|
//usage: "pid 4790's current affinity mask: 7\n"
|
|
|
|
//usage: "pid 4790's new affinity mask: 1\n"
|
|
|
|
//usage: "$ taskset 0x7 /bin/sh -c './taskset -p 0x1 $$'\n"
|
|
|
|
//usage: "pid 6671's current affinity mask: 1\n"
|
|
|
|
//usage: "pid 6671's new affinity mask: 1\n"
|
|
|
|
//usage: "$ taskset -p 1\n"
|
|
|
|
//usage: "pid 1's current affinity mask: 3\n"
|
2014-08-17 23:06:22 +05:30
|
|
|
/*
|
2017-01-29 22:49:29 +05:30
|
|
|
* Not yet implemented:
|
2014-08-17 23:06:22 +05:30
|
|
|
* -a/--all-tasks (affect all threads)
|
2017-01-29 22:49:29 +05:30
|
|
|
* needs to get TIDs from /proc/PID/task/ and use _them_ as "pid" in sched_setaffinity(pid)
|
2014-08-17 23:06:22 +05:30
|
|
|
* -c/--cpu-list (specify CPUs via "1,3,5-7")
|
|
|
|
*/
|
2011-04-11 06:59:49 +05:30
|
|
|
|
2006-11-22 22:09:48 +05:30
|
|
|
#include <sched.h>
|
2007-05-27 00:30:18 +05:30
|
|
|
#include "libbb.h"
|
2006-11-22 22:09:48 +05:30
|
|
|
|
2017-01-29 22:49:29 +05:30
|
|
|
typedef unsigned long ul;
|
|
|
|
#define SZOF_UL (unsigned)(sizeof(ul))
|
|
|
|
#define BITS_UL (unsigned)(sizeof(ul)*8)
|
|
|
|
#define MASK_UL (unsigned)(sizeof(ul)*8 - 1)
|
|
|
|
|
2006-11-22 22:09:48 +05:30
|
|
|
#if ENABLE_FEATURE_TASKSET_FANCY
|
|
|
|
#define TASKSET_PRINTF_MASK "%s"
|
|
|
|
/* craft a string from the mask */
|
2017-01-29 22:49:29 +05:30
|
|
|
static char *from_mask(const ul *mask, unsigned sz_in_bytes)
|
2006-12-30 23:27:03 +05:30
|
|
|
{
|
2017-01-29 22:49:29 +05:30
|
|
|
char *str = xzalloc((sz_in_bytes+1) * 2); /* we will leak it */
|
|
|
|
char *p = str;
|
|
|
|
for (;;) {
|
|
|
|
ul v = *mask++;
|
|
|
|
if (SZOF_UL == 4)
|
|
|
|
p += sprintf(p, "%08lx", v);
|
|
|
|
if (SZOF_UL == 8)
|
|
|
|
p += sprintf(p, "%016lx", v);
|
|
|
|
if (SZOF_UL == 16)
|
|
|
|
p += sprintf(p, "%032lx", v); /* :) */
|
|
|
|
sz_in_bytes -= SZOF_UL;
|
|
|
|
if ((int)sz_in_bytes <= 0)
|
|
|
|
break;
|
2006-11-22 22:09:48 +05:30
|
|
|
}
|
2017-01-29 22:49:29 +05:30
|
|
|
while (str[0] == '0' && str[1])
|
|
|
|
str++;
|
|
|
|
return str;
|
2006-11-22 22:09:48 +05:30
|
|
|
}
|
|
|
|
#else
|
2017-01-29 22:49:29 +05:30
|
|
|
#define TASKSET_PRINTF_MASK "%lx"
|
|
|
|
static unsigned long long from_mask(ul *mask, unsigned sz_in_bytes UNUSED_PARAM)
|
2008-07-11 19:27:08 +05:30
|
|
|
{
|
2017-01-29 22:49:29 +05:30
|
|
|
return *mask;
|
2008-07-11 19:27:08 +05:30
|
|
|
}
|
2006-11-22 22:09:48 +05:30
|
|
|
#endif
|
|
|
|
|
2017-01-29 22:49:29 +05:30
|
|
|
static unsigned long *get_aff(int pid, unsigned *sz)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
unsigned long *mask = NULL;
|
|
|
|
unsigned sz_in_bytes = *sz;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
mask = xrealloc(mask, sz_in_bytes);
|
|
|
|
r = sched_getaffinity(pid, sz_in_bytes, (void*)mask);
|
|
|
|
if (r == 0)
|
|
|
|
break;
|
|
|
|
sz_in_bytes *= 2;
|
|
|
|
if (errno == EINVAL && (int)sz_in_bytes > 0)
|
|
|
|
continue;
|
|
|
|
bb_perror_msg_and_die("can't %cet pid %d's affinity", 'g', pid);
|
|
|
|
}
|
|
|
|
//bb_error_msg("get mask[0]:%lx sz_in_bytes:%d", mask[0], sz_in_bytes);
|
|
|
|
*sz = sz_in_bytes;
|
|
|
|
return mask;
|
|
|
|
}
|
2006-11-22 22:09:48 +05:30
|
|
|
|
2019-11-01 20:14:49 +05:30
|
|
|
#if ENABLE_FEATURE_TASKSET_CPULIST
|
|
|
|
/*
|
|
|
|
* Parse the CPU list and set the mask accordingly.
|
|
|
|
*
|
|
|
|
* The list element can be either a CPU index or a range of CPU indices.
|
2019-11-09 21:35:14 +05:30
|
|
|
* Example: "1,3,5-7". Stride can be specified: "0-7:2" is "0,2,4,6".
|
|
|
|
* Note: leading and trailing whitespace is not allowed.
|
2019-11-08 21:02:37 +05:30
|
|
|
* util-linux 2.31 allows leading and sometimes trailing whitespace:
|
|
|
|
* ok: taskset -c ' 1, 2'
|
|
|
|
* ok: taskset -c ' 1 , 2'
|
|
|
|
* ok: taskset -c ' 1-7: 2 ,8'
|
|
|
|
* not ok: taskset -c ' 1 '
|
|
|
|
* not ok: taskset -c ' 1-7: 2 '
|
2019-11-01 20:14:49 +05:30
|
|
|
*/
|
|
|
|
static void parse_cpulist(ul *mask, unsigned max, char *s)
|
|
|
|
{
|
|
|
|
char *aff = s;
|
|
|
|
for (;;) {
|
|
|
|
unsigned bit, end;
|
2019-11-09 21:35:14 +05:30
|
|
|
unsigned stride = 1;
|
2019-11-01 20:14:49 +05:30
|
|
|
|
|
|
|
bit = end = bb_strtou(s, &s, 10);
|
|
|
|
if (*s == '-') {
|
|
|
|
s++;
|
|
|
|
end = bb_strtou(s, &s, 10);
|
2019-11-09 21:35:14 +05:30
|
|
|
if (*s == ':') {
|
|
|
|
s++;
|
|
|
|
stride = bb_strtou(s, &s, 10);
|
|
|
|
}
|
2019-11-01 20:14:49 +05:30
|
|
|
}
|
|
|
|
if ((*s != ',' && *s != '\0')
|
|
|
|
|| bit > end
|
|
|
|
|| end == UINT_MAX /* bb_strtou returns this on malformed / ERANGE numbers */
|
2019-11-09 22:02:43 +05:30
|
|
|
|| (stride - 1) > (UINT_MAX / 4)
|
|
|
|
/* disallow 0, malformed input, and too large stride prone to overflows */
|
2019-11-01 20:14:49 +05:30
|
|
|
) {
|
|
|
|
bb_error_msg_and_die("bad affinity '%s'", aff);
|
|
|
|
}
|
|
|
|
while (bit <= end && bit < max) {
|
|
|
|
mask[bit / BITS_UL] |= (1UL << (bit & MASK_UL));
|
2019-11-09 21:35:14 +05:30
|
|
|
bit += stride;
|
2019-11-01 20:14:49 +05:30
|
|
|
}
|
|
|
|
if (*s == '\0')
|
|
|
|
break;
|
|
|
|
s++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
static void print_cpulist(const ul *mask, unsigned mask_size_in_bytes)
|
|
|
|
{
|
|
|
|
const ul *mask_end;
|
|
|
|
const char *delim;
|
|
|
|
unsigned pos;
|
|
|
|
ul bit;
|
|
|
|
|
|
|
|
mask_end = mask + mask_size_in_bytes / sizeof(mask[0]);
|
|
|
|
delim = "";
|
|
|
|
pos = 0;
|
|
|
|
bit = 1;
|
|
|
|
for (;;) {
|
|
|
|
if (*mask & bit) {
|
|
|
|
unsigned onebit = pos + 1;
|
|
|
|
printf("%s%u", delim, pos);
|
|
|
|
do {
|
|
|
|
pos++;
|
|
|
|
bit <<= 1;
|
|
|
|
if (bit == 0) {
|
|
|
|
mask++;
|
|
|
|
if (mask >= mask_end)
|
|
|
|
break;
|
|
|
|
bit = 1;
|
|
|
|
}
|
|
|
|
} while (*mask & bit);
|
|
|
|
if (onebit != pos)
|
|
|
|
printf("-%u", pos - 1);
|
|
|
|
delim = ",";
|
|
|
|
}
|
|
|
|
pos++;
|
|
|
|
bit <<= 1;
|
|
|
|
if (bit == 0) {
|
|
|
|
mask++;
|
|
|
|
if (mask >= mask_end)
|
|
|
|
break;
|
|
|
|
bit = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
bb_putchar('\n');
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2021-06-19 21:12:35 +05:30
|
|
|
enum {
|
|
|
|
OPT_p = 1 << 0,
|
|
|
|
OPT_a = 1 << 1,
|
|
|
|
OPT_c = (1 << 2) * ENABLE_FEATURE_TASKSET_CPULIST,
|
|
|
|
};
|
|
|
|
|
2021-06-24 15:32:17 +05:30
|
|
|
static int process_pid_str(const char *pid_str, unsigned opts, char *aff)
|
2006-11-22 22:09:48 +05:30
|
|
|
{
|
2017-01-29 22:49:29 +05:30
|
|
|
ul *mask;
|
|
|
|
unsigned mask_size_in_bytes;
|
2008-03-17 14:59:43 +05:30
|
|
|
const char *current_new;
|
2021-08-16 00:11:18 +05:30
|
|
|
pid_t pid = !pid_str ? 0 : xatou_range(pid_str, 1, INT_MAX); /* disallow "0": "taskset -p 0" should fail */
|
2006-11-22 22:09:48 +05:30
|
|
|
|
2017-01-29 22:49:29 +05:30
|
|
|
mask_size_in_bytes = SZOF_UL;
|
2017-01-29 23:29:38 +05:30
|
|
|
current_new = "current";
|
2006-12-30 23:27:03 +05:30
|
|
|
print_aff:
|
2017-01-29 22:49:29 +05:30
|
|
|
mask = get_aff(pid, &mask_size_in_bytes);
|
2019-11-01 20:14:49 +05:30
|
|
|
if (opts & OPT_p) {
|
|
|
|
#if ENABLE_FEATURE_TASKSET_CPULIST
|
|
|
|
if (opts & OPT_c) {
|
|
|
|
printf("pid %d's %s affinity list: ", pid, current_new);
|
|
|
|
print_cpulist(mask, mask_size_in_bytes);
|
|
|
|
} else
|
|
|
|
#endif
|
|
|
|
printf("pid %d's %s affinity mask: "TASKSET_PRINTF_MASK"\n",
|
2017-01-29 22:49:29 +05:30
|
|
|
pid, current_new, from_mask(mask, mask_size_in_bytes));
|
2021-06-19 21:12:35 +05:30
|
|
|
if (!aff) {
|
2008-03-17 14:59:43 +05:30
|
|
|
/* Either it was just "-p <pid>",
|
|
|
|
* or it was "-p <aff> <pid>" and we came here
|
|
|
|
* for the second time (see goto below) */
|
2021-06-24 15:32:17 +05:30
|
|
|
return 0;
|
2008-03-17 14:59:43 +05:30
|
|
|
}
|
2017-01-29 23:29:38 +05:30
|
|
|
current_new = "new";
|
2006-11-22 22:09:48 +05:30
|
|
|
}
|
2017-01-29 22:49:29 +05:30
|
|
|
memset(mask, 0, mask_size_in_bytes);
|
2006-11-22 22:09:48 +05:30
|
|
|
|
2017-01-29 22:49:29 +05:30
|
|
|
if (!ENABLE_FEATURE_TASKSET_FANCY) {
|
2019-11-01 20:14:49 +05:30
|
|
|
/* Affinity was specified, translate it into mask */
|
|
|
|
/* it is always in hex, skip "0x" if it exists */
|
|
|
|
if (aff[0] == '0' && (aff[1]|0x20) == 'x')
|
|
|
|
aff += 2;
|
2017-01-31 02:50:06 +05:30
|
|
|
mask[0] = xstrtoul(aff, 16);
|
2019-11-01 20:14:49 +05:30
|
|
|
}
|
|
|
|
#if ENABLE_FEATURE_TASKSET_CPULIST
|
|
|
|
else if (opts & OPT_c) {
|
|
|
|
parse_cpulist(mask, mask_size_in_bytes * 8, aff);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
else {
|
2014-08-17 23:06:22 +05:30
|
|
|
unsigned i;
|
2017-01-29 22:49:29 +05:30
|
|
|
char *last_char;
|
|
|
|
|
2019-11-01 20:14:49 +05:30
|
|
|
/* Affinity was specified, translate it into mask */
|
|
|
|
/* it is always in hex, skip "0x" if it exists */
|
|
|
|
if (aff[0] == '0' && (aff[1]|0x20) == 'x')
|
|
|
|
aff += 2;
|
|
|
|
|
2017-01-29 22:49:29 +05:30
|
|
|
i = 0; /* bit pos in mask[] */
|
|
|
|
|
|
|
|
/* aff is ASCII hex string, accept very long masks in this form.
|
|
|
|
* Process hex string AABBCCDD... to ulong mask[]
|
|
|
|
* from the rightmost nibble, which is least-significant.
|
|
|
|
* Bits not fitting into mask[] are ignored: (example: 1234
|
|
|
|
* in 12340000000000000000000000000000000000000ff)
|
|
|
|
*/
|
|
|
|
last_char = strchrnul(aff, '\0');
|
|
|
|
while (last_char > aff) {
|
|
|
|
char c;
|
|
|
|
ul val;
|
|
|
|
|
|
|
|
last_char--;
|
|
|
|
c = *last_char;
|
|
|
|
if (isdigit(c))
|
|
|
|
val = c - '0';
|
|
|
|
else if ((c|0x20) >= 'a' && (c|0x20) <= 'f')
|
|
|
|
val = (c|0x20) - ('a' - 10);
|
|
|
|
else
|
2014-08-17 23:06:22 +05:30
|
|
|
bb_error_msg_and_die("bad affinity '%s'", aff);
|
2008-04-25 22:31:06 +05:30
|
|
|
|
2017-01-29 22:49:29 +05:30
|
|
|
if (i < mask_size_in_bytes * 8) {
|
|
|
|
mask[i / BITS_UL] |= val << (i & MASK_UL);
|
2014-08-17 23:06:22 +05:30
|
|
|
//bb_error_msg("bit %d set", i);
|
|
|
|
}
|
2017-01-29 22:49:29 +05:30
|
|
|
/* else:
|
|
|
|
* We can error out here, but we don't.
|
|
|
|
* For one, kernel itself ignores bits in mask[]
|
2017-01-31 02:50:06 +05:30
|
|
|
* which do not map to any CPUs:
|
|
|
|
* if mask[] has one 32-bit long element,
|
2017-01-29 22:49:29 +05:30
|
|
|
* but you have only 8 CPUs, all bits beyond first 8
|
|
|
|
* are ignored, silently.
|
|
|
|
* No point in making bits past 31th to be errors.
|
|
|
|
*/
|
|
|
|
i += 4;
|
2008-03-17 14:59:43 +05:30
|
|
|
}
|
2006-11-22 22:09:48 +05:30
|
|
|
}
|
2008-03-17 14:59:43 +05:30
|
|
|
|
|
|
|
/* Set pid's or our own (pid==0) affinity */
|
2017-01-29 22:49:29 +05:30
|
|
|
if (sched_setaffinity(pid, mask_size_in_bytes, (void*)mask))
|
2008-03-17 14:59:43 +05:30
|
|
|
bb_perror_msg_and_die("can't %cet pid %d's affinity", 's', pid);
|
2017-01-29 22:49:29 +05:30
|
|
|
//bb_error_msg("set mask[0]:%lx", mask[0]);
|
2008-03-17 14:59:43 +05:30
|
|
|
|
2021-06-19 21:12:35 +05:30
|
|
|
if ((opts & OPT_p) && aff) { /* "-p <aff> <pid> [...ignored...]" */
|
|
|
|
aff = NULL;
|
2008-03-17 14:59:43 +05:30
|
|
|
goto print_aff; /* print new affinity and exit */
|
2021-06-19 21:12:35 +05:30
|
|
|
}
|
2021-06-24 15:32:17 +05:30
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int FAST_FUNC iter(const char *dn UNUSED_PARAM, struct dirent *ent, void *aff)
|
|
|
|
{
|
|
|
|
if (isdigit(ent->d_name[0]))
|
|
|
|
return process_pid_str(ent->d_name, option_mask32, aff);
|
|
|
|
return 0;
|
2021-06-19 21:12:35 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
int taskset_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
|
|
|
|
int taskset_main(int argc UNUSED_PARAM, char **argv)
|
|
|
|
{
|
|
|
|
const char *pid_str;
|
|
|
|
char *aff;
|
|
|
|
unsigned opts;
|
|
|
|
|
|
|
|
/* NB: we mimic util-linux's taskset: -p does not take
|
|
|
|
* an argument, i.e., "-pN" is NOT valid, only "-p N"!
|
|
|
|
* Indeed, util-linux-2.13-pre7 uses:
|
|
|
|
* getopt_long(argc, argv, "+pchV", ...), not "...p:..." */
|
|
|
|
|
|
|
|
opts = getopt32(argv, "^+" "pa"IF_FEATURE_TASKSET_CPULIST("c")
|
|
|
|
"\0" "-1" /* at least 1 arg */);
|
|
|
|
argv += optind;
|
2008-03-17 14:59:43 +05:30
|
|
|
|
2021-06-19 21:12:35 +05:30
|
|
|
aff = *argv++;
|
|
|
|
if (!(opts & OPT_p)) {
|
|
|
|
/* <aff> <cmd...> */
|
|
|
|
if (!*argv)
|
|
|
|
bb_show_usage();
|
2021-08-16 00:11:18 +05:30
|
|
|
process_pid_str(NULL, opts, aff);
|
2021-06-19 21:12:35 +05:30
|
|
|
BB_EXECVP_or_die(argv);
|
|
|
|
}
|
|
|
|
|
|
|
|
pid_str = aff;
|
|
|
|
if (*argv) /* "-p <aff> <pid> ...rest.is.ignored..." */
|
2021-06-24 15:32:17 +05:30
|
|
|
pid_str = *argv;
|
2021-06-19 21:12:35 +05:30
|
|
|
else
|
|
|
|
aff = NULL;
|
|
|
|
|
|
|
|
if (opts & OPT_a) {
|
2021-06-20 12:32:03 +05:30
|
|
|
char *dn;
|
2021-06-24 15:32:17 +05:30
|
|
|
int r;
|
2021-06-19 21:12:35 +05:30
|
|
|
|
2021-06-20 12:32:03 +05:30
|
|
|
dn = xasprintf("/proc/%s/task", pid_str);
|
2021-06-24 15:32:17 +05:30
|
|
|
r = iterate_on_dir(dn, iter, aff);
|
2021-06-20 12:32:03 +05:30
|
|
|
IF_FEATURE_CLEAN_UP(free(dn);)
|
2021-06-24 15:32:17 +05:30
|
|
|
if (r == 0)
|
|
|
|
return r; /* EXIT_SUCCESS */
|
|
|
|
/* else: no /proc/PID/task, act as if no -a was given */
|
2021-06-19 21:12:35 +05:30
|
|
|
}
|
2021-06-24 15:32:17 +05:30
|
|
|
return process_pid_str(pid_str, opts, aff);
|
2006-11-22 22:09:48 +05:30
|
|
|
}
|