代码拉取完成,页面将自动刷新
同步操作将从 HoperunHarmony/stress-ng 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
/*
* Copyright (C) 2013-2021 Canonical, Ltd.
* Copyright (C) 2022 Colin Ian King.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "stress-ng.h"
#if defined(NSIG)
#define MAX_SIGNUM NSIG
#elif defined(_NSIG)
#define MAX_SIGNUM _NSIG
#else
#define MAX_SIGNUM (256)
#endif
#define MAX_BACKOFF (10000)
static const stress_help_t help[] = {
{ NULL, "daemon N", "start N workers creating multiple daemons" },
{ NULL, "daemon-ops N", "stop when N daemons have been created" },
{ NULL, NULL, NULL }
};
/*
* daemons()
* fork off a child and let the parent die
*/
static void daemons(const stress_args_t *args, const int fd)
{
int fds[3];
int i;
sigset_t set;
uint64_t backoff = 100;
if (stress_sig_stop_stressing(args->name, SIGALRM) < 0)
goto err;
if (setsid() < 0)
goto err;
(void)close(0);
(void)close(1);
(void)close(2);
for (i = 0; i < MAX_SIGNUM; i++)
(void)signal(i, SIG_DFL);
(void)sigemptyset(&set);
(void)sigprocmask(SIG_SETMASK, &set, NULL);
#if defined(HAVE_CLEARENV)
(void)clearenv();
#endif
if ((fds[0] = open("/dev/null", O_RDWR)) < 0)
goto err;
if ((fds[1] = dup(0)) < 0)
goto err0;
if ((fds[2] = dup(0)) < 0)
goto err1;
while (keep_stressing_flag()) {
pid_t pid;
pid = fork();
if (pid < 0) {
/* A slow init? no pids or memory, retry */
if ((errno == EAGAIN) || (errno == ENOMEM)) {
/* Minor backoff before retrying */
(void)shim_usleep_interruptible(backoff);
backoff += 100;
if (backoff > MAX_BACKOFF)
backoff = MAX_BACKOFF;
continue;
}
goto tidy;
} else if (pid == 0) {
/* Child */
uint8_t buf[1] = { 0xff };
ssize_t sz;
int ret;
if (chdir("/") < 0)
goto err2;
(void)umask(0);
ret = stress_drop_capabilities(args->name);
(void)ret;
sz = write(fd, buf, sizeof(buf));
if (sz != sizeof(buf))
goto err2;
} else {
/* Parent, will be reaped by init */
break;
}
}
tidy:
(void)close(fds[2]);
(void)close(fds[1]);
(void)close(fds[0]);
return;
err2: (void)close(fds[2]);
err1: (void)close(fds[1]);
err0: (void)close(fds[0]);
err: (void)close(fd);
}
/*
* stress_daemon()
* stress by multiple daemonizing forks
*/
static int stress_daemon(const stress_args_t *args)
{
int fds[2];
pid_t pid;
if (stress_sig_stop_stressing(args->name, SIGALRM) < 0)
return EXIT_FAILURE;
if (pipe(fds) < 0) {
pr_fail("%s: pipe failed, errno=%d (%s)\n",
args->name, errno, strerror(errno));
return EXIT_FAILURE;
}
stress_set_proc_state(args->name, STRESS_STATE_RUN);
again:
pid = fork();
if (pid < 0) {
if (stress_redo_fork(errno))
goto again;
if (!keep_stressing(args))
goto finish;
pr_fail("%s: fork failed, errno=%d (%s)\n",
args->name, errno, strerror(errno));
(void)close(fds[0]);
(void)close(fds[1]);
return EXIT_FAILURE;
} else if (pid == 0) {
/* Children */
(void)close(fds[0]);
daemons(args, fds[1]);
(void)close(fds[1]);
shim_exit_group(0);
} else {
/* Parent */
(void)close(fds[1]);
do {
ssize_t n;
char buf[1];
n = read(fds[0], buf, sizeof(buf));
if (n < 0) {
(void)close(fds[0]);
if (errno != EINTR) {
pr_dbg("%s: read failed: "
"errno=%d (%s)\n",
args->name,
errno, strerror(errno));
}
break;
}
inc_counter(args);
} while (keep_stressing(args));
}
finish:
stress_set_proc_state(args->name, STRESS_STATE_DEINIT);
return EXIT_SUCCESS;
}
stressor_info_t stress_daemon_info = {
.stressor = stress_daemon,
.class = CLASS_SCHEDULER | CLASS_OS,
.help = help
};
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。