2014-01-22 01:30:03 +04:00
|
|
|
/*
|
2020-10-09 06:10:13 +03:00
|
|
|
* This file is part of the ZFS Event Daemon (ZED).
|
|
|
|
*
|
2014-01-22 01:30:03 +04:00
|
|
|
* Developed at Lawrence Livermore National Laboratory (LLNL-CODE-403049).
|
|
|
|
* Copyright (C) 2013-2014 Lawrence Livermore National Security, LLC.
|
2021-05-03 22:21:21 +03:00
|
|
|
* Refer to the OpenZFS git commit log for authoritative copyright attribution.
|
2015-05-07 01:56:03 +03:00
|
|
|
*
|
|
|
|
* The contents of this file are subject to the terms of the
|
|
|
|
* Common Development and Distribution License Version 1.0 (CDDL-1.0).
|
|
|
|
* You can obtain a copy of the license from the top-level file
|
|
|
|
* "OPENSOLARIS.LICENSE" or at <http://opensource.org/licenses/CDDL-1.0>.
|
|
|
|
* You may not use this file except in compliance with the license.
|
2014-01-22 01:30:03 +04:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <assert.h>
|
|
|
|
#include <ctype.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2021-03-26 16:41:38 +03:00
|
|
|
#include <stddef.h>
|
|
|
|
#include <sys/avl.h>
|
2021-04-02 15:10:31 +03:00
|
|
|
#include <sys/resource.h>
|
2014-01-22 01:30:03 +04:00
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/wait.h>
|
2016-11-08 02:01:38 +03:00
|
|
|
#include <time.h>
|
2014-01-22 01:30:03 +04:00
|
|
|
#include <unistd.h>
|
2021-03-26 16:41:38 +03:00
|
|
|
#include <pthread.h>
|
2021-09-09 20:44:21 +03:00
|
|
|
#include <signal.h>
|
|
|
|
|
2020-06-11 23:25:39 +03:00
|
|
|
#include "zed_exec.h"
|
2014-01-22 01:30:03 +04:00
|
|
|
#include "zed_log.h"
|
|
|
|
#include "zed_strings.h"
|
|
|
|
|
|
|
|
#define ZEVENT_FILENO 3
|
|
|
|
|
2021-03-26 16:41:38 +03:00
|
|
|
struct launched_process_node {
|
|
|
|
avl_node_t node;
|
|
|
|
pid_t pid;
|
|
|
|
uint64_t eid;
|
|
|
|
char *name;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int
|
|
|
|
_launched_process_node_compare(const void *x1, const void *x2)
|
|
|
|
{
|
|
|
|
pid_t p1;
|
|
|
|
pid_t p2;
|
|
|
|
|
|
|
|
assert(x1 != NULL);
|
|
|
|
assert(x2 != NULL);
|
|
|
|
|
|
|
|
p1 = ((const struct launched_process_node *) x1)->pid;
|
|
|
|
p2 = ((const struct launched_process_node *) x2)->pid;
|
|
|
|
|
|
|
|
if (p1 < p2)
|
|
|
|
return (-1);
|
|
|
|
else if (p1 == p2)
|
|
|
|
return (0);
|
|
|
|
else
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
static pthread_t _reap_children_tid = (pthread_t)-1;
|
|
|
|
static volatile boolean_t _reap_children_stop;
|
|
|
|
static avl_tree_t _launched_processes;
|
|
|
|
static pthread_mutex_t _launched_processes_lock = PTHREAD_MUTEX_INITIALIZER;
|
2021-03-29 16:21:54 +03:00
|
|
|
static int16_t _launched_processes_limit;
|
2021-03-26 16:41:38 +03:00
|
|
|
|
2014-01-22 01:30:03 +04:00
|
|
|
/*
|
|
|
|
* Create an environment string array for passing to execve() using the
|
2014-09-11 01:22:39 +04:00
|
|
|
* NAME=VALUE strings in container [zsp].
|
2014-01-22 01:30:03 +04:00
|
|
|
* Return a newly-allocated environment, or NULL on error.
|
|
|
|
*/
|
|
|
|
static char **
|
|
|
|
_zed_exec_create_env(zed_strings_t *zsp)
|
|
|
|
{
|
|
|
|
int num_ptrs;
|
|
|
|
int buflen;
|
|
|
|
char *buf;
|
|
|
|
char **pp;
|
|
|
|
char *p;
|
|
|
|
const char *q;
|
|
|
|
int i;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
num_ptrs = zed_strings_count(zsp) + 1;
|
|
|
|
buflen = num_ptrs * sizeof (char *);
|
|
|
|
for (q = zed_strings_first(zsp); q; q = zed_strings_next(zsp))
|
|
|
|
buflen += strlen(q) + 1;
|
|
|
|
|
2014-09-23 00:22:48 +04:00
|
|
|
buf = calloc(1, buflen);
|
2014-01-22 01:30:03 +04:00
|
|
|
if (!buf)
|
|
|
|
return (NULL);
|
|
|
|
|
2016-12-12 21:46:26 +03:00
|
|
|
pp = (char **)buf;
|
2014-01-22 01:30:03 +04:00
|
|
|
p = buf + (num_ptrs * sizeof (char *));
|
|
|
|
i = 0;
|
|
|
|
for (q = zed_strings_first(zsp); q; q = zed_strings_next(zsp)) {
|
|
|
|
pp[i] = p;
|
|
|
|
len = strlen(q) + 1;
|
|
|
|
memcpy(p, q, len);
|
|
|
|
p += len;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
pp[i] = NULL;
|
|
|
|
assert(buf + buflen == p);
|
2016-12-12 21:46:26 +03:00
|
|
|
return ((char **)buf);
|
2014-01-22 01:30:03 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Fork a child process to handle event [eid]. The program [prog]
|
2017-01-03 20:31:18 +03:00
|
|
|
* in directory [dir] is executed with the environment [env].
|
2014-09-11 01:22:39 +04:00
|
|
|
*
|
2014-01-22 01:30:03 +04:00
|
|
|
* The file descriptor [zfd] is the zevent_fd used to track the
|
2014-09-11 01:22:39 +04:00
|
|
|
* current cursor location within the zevent nvlist.
|
2014-01-22 01:30:03 +04:00
|
|
|
*/
|
|
|
|
static void
|
|
|
|
_zed_exec_fork_child(uint64_t eid, const char *dir, const char *prog,
|
2021-04-12 15:07:14 +03:00
|
|
|
char *env[], int zfd, boolean_t in_foreground)
|
2014-01-22 01:30:03 +04:00
|
|
|
{
|
|
|
|
char path[PATH_MAX];
|
|
|
|
int n;
|
|
|
|
pid_t pid;
|
|
|
|
int fd;
|
2021-03-26 16:41:38 +03:00
|
|
|
struct launched_process_node *node;
|
|
|
|
sigset_t mask;
|
2021-03-29 16:21:54 +03:00
|
|
|
struct timespec launch_timeout =
|
|
|
|
{ .tv_sec = 0, .tv_nsec = 200 * 1000 * 1000, };
|
2014-01-22 01:30:03 +04:00
|
|
|
|
|
|
|
assert(dir != NULL);
|
|
|
|
assert(prog != NULL);
|
|
|
|
assert(env != NULL);
|
|
|
|
assert(zfd >= 0);
|
|
|
|
|
2021-03-29 16:21:54 +03:00
|
|
|
while (__atomic_load_n(&_launched_processes_limit,
|
|
|
|
__ATOMIC_SEQ_CST) <= 0)
|
|
|
|
(void) nanosleep(&launch_timeout, NULL);
|
|
|
|
|
2014-01-22 01:30:03 +04:00
|
|
|
n = snprintf(path, sizeof (path), "%s/%s", dir, prog);
|
|
|
|
if ((n < 0) || (n >= sizeof (path))) {
|
|
|
|
zed_log_msg(LOG_WARNING,
|
|
|
|
"Failed to fork \"%s\" for eid=%llu: %s",
|
|
|
|
prog, eid, strerror(ENAMETOOLONG));
|
|
|
|
return;
|
|
|
|
}
|
2021-05-08 01:10:16 +03:00
|
|
|
(void) pthread_mutex_lock(&_launched_processes_lock);
|
2014-01-22 01:30:03 +04:00
|
|
|
pid = fork();
|
|
|
|
if (pid < 0) {
|
2021-05-08 01:10:16 +03:00
|
|
|
(void) pthread_mutex_unlock(&_launched_processes_lock);
|
2014-01-22 01:30:03 +04:00
|
|
|
zed_log_msg(LOG_WARNING,
|
|
|
|
"Failed to fork \"%s\" for eid=%llu: %s",
|
|
|
|
prog, eid, strerror(errno));
|
|
|
|
return;
|
|
|
|
} else if (pid == 0) {
|
2021-03-26 16:41:38 +03:00
|
|
|
(void) sigemptyset(&mask);
|
|
|
|
(void) sigprocmask(SIG_SETMASK, &mask, NULL);
|
|
|
|
|
2014-01-22 01:30:03 +04:00
|
|
|
(void) umask(022);
|
2021-04-12 15:07:14 +03:00
|
|
|
if (in_foreground && /* we're already devnulled if daemonised */
|
|
|
|
(fd = open("/dev/null", O_RDWR | O_CLOEXEC)) != -1) {
|
2016-10-01 01:40:07 +03:00
|
|
|
(void) dup2(fd, STDIN_FILENO);
|
|
|
|
(void) dup2(fd, STDOUT_FILENO);
|
|
|
|
(void) dup2(fd, STDERR_FILENO);
|
|
|
|
}
|
2014-01-22 01:30:03 +04:00
|
|
|
(void) dup2(zfd, ZEVENT_FILENO);
|
|
|
|
execle(path, prog, NULL, env);
|
|
|
|
_exit(127);
|
2016-11-08 02:01:38 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/* parent process */
|
|
|
|
|
2021-03-26 16:41:38 +03:00
|
|
|
node = calloc(1, sizeof (*node));
|
|
|
|
if (node) {
|
|
|
|
node->pid = pid;
|
|
|
|
node->eid = eid;
|
|
|
|
node->name = strdup(prog);
|
Handle possible null pointers from malloc/strdup/strndup()
GCC 12.1.1_p20220625's static analyzer caught these.
Of the two in the btree test, one had previously been caught by Coverity
and Smatch, but GCC flagged it as a false positive. Upon examining how
other test cases handle this, the solution was changed from
`ASSERT3P(node, !=, NULL);` to using `perror()` to be consistent with
the fixes to the other fixes done to the ZTS code.
That approach was also used in ZED since I did not see a better way of
handling this there. Also, upon inspection, additional unchecked
pointers from malloc()/calloc()/strdup() were found in ZED, so those
were handled too.
In other parts of the code, the existing methods to avoid issues from
memory allocators returning NULL were used, such as using
`umem_alloc(size, UMEM_NOFAIL)` or returning `ENOMEM`.
Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Tony Hutter <hutter2@llnl.gov>
Signed-off-by: Richard Yao <richard.yao@alumni.stonybrook.edu>
Closes #13979
2022-10-07 03:18:40 +03:00
|
|
|
if (node->name == NULL) {
|
|
|
|
perror("strdup");
|
|
|
|
exit(EXIT_FAILURE);
|
|
|
|
}
|
2021-04-02 15:10:31 +03:00
|
|
|
|
2021-03-26 16:41:38 +03:00
|
|
|
avl_add(&_launched_processes, node);
|
|
|
|
}
|
2021-05-08 01:10:16 +03:00
|
|
|
(void) pthread_mutex_unlock(&_launched_processes_lock);
|
|
|
|
|
|
|
|
__atomic_sub_fetch(&_launched_processes_limit, 1, __ATOMIC_SEQ_CST);
|
|
|
|
zed_log_msg(LOG_INFO, "Invoking \"%s\" eid=%llu pid=%d",
|
|
|
|
prog, eid, pid);
|
2021-03-26 16:41:38 +03:00
|
|
|
}
|
2016-11-08 02:01:38 +03:00
|
|
|
|
2021-03-26 16:41:38 +03:00
|
|
|
static void
|
|
|
|
_nop(int sig)
|
2021-12-11 03:07:57 +03:00
|
|
|
{
|
|
|
|
(void) sig;
|
|
|
|
}
|
2021-03-26 16:41:38 +03:00
|
|
|
|
|
|
|
static void *
|
|
|
|
_reap_children(void *arg)
|
|
|
|
{
|
2021-12-11 03:07:57 +03:00
|
|
|
(void) arg;
|
2021-03-26 16:41:38 +03:00
|
|
|
struct launched_process_node node, *pnode;
|
|
|
|
pid_t pid;
|
|
|
|
int status;
|
2021-04-02 15:10:31 +03:00
|
|
|
struct rusage usage;
|
2021-03-26 16:41:38 +03:00
|
|
|
struct sigaction sa = {};
|
|
|
|
|
|
|
|
(void) sigfillset(&sa.sa_mask);
|
|
|
|
(void) sigdelset(&sa.sa_mask, SIGCHLD);
|
|
|
|
(void) pthread_sigmask(SIG_SETMASK, &sa.sa_mask, NULL);
|
|
|
|
|
|
|
|
(void) sigemptyset(&sa.sa_mask);
|
|
|
|
sa.sa_handler = _nop;
|
|
|
|
sa.sa_flags = SA_NOCLDSTOP;
|
|
|
|
(void) sigaction(SIGCHLD, &sa, NULL);
|
|
|
|
|
|
|
|
for (_reap_children_stop = B_FALSE; !_reap_children_stop; ) {
|
zed: protect against wait4()/fork() races to the launched process tree
As soon as wait4() returns, fork() can immediately return with the same
PID, and race to lock _launched_processes_lock, then try to add the new
(duplicate) PID to _launched_processes, which asserts
By locking before wait4(), we ensure, that, given that same
unfortunate scheduling, _launched_processes_lock cannot be locked by the
spawner before we pop the process in the reaper, and only afterward will
it be added
This moves where the reaper idles when there are children from the
wait4() to the pause(), locking for the duration of that single syscall
in both the no-children and running-children cases; the impact of this
is one to two syscalls (depending on _launched_processes_lock state)
per loop
Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Don Brady <don.brady@delphix.com>
Signed-off-by: Ahelenia Ziemiańska <nabijaczleweli@nabijaczleweli.xyz>
Closes #11924
Closes #11928
2021-04-23 03:49:21 +03:00
|
|
|
(void) pthread_mutex_lock(&_launched_processes_lock);
|
|
|
|
pid = wait4(0, &status, WNOHANG, &usage);
|
2021-03-26 16:41:38 +03:00
|
|
|
|
zed: protect against wait4()/fork() races to the launched process tree
As soon as wait4() returns, fork() can immediately return with the same
PID, and race to lock _launched_processes_lock, then try to add the new
(duplicate) PID to _launched_processes, which asserts
By locking before wait4(), we ensure, that, given that same
unfortunate scheduling, _launched_processes_lock cannot be locked by the
spawner before we pop the process in the reaper, and only afterward will
it be added
This moves where the reaper idles when there are children from the
wait4() to the pause(), locking for the duration of that single syscall
in both the no-children and running-children cases; the impact of this
is one to two syscalls (depending on _launched_processes_lock state)
per loop
Reviewed-by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Don Brady <don.brady@delphix.com>
Signed-off-by: Ahelenia Ziemiańska <nabijaczleweli@nabijaczleweli.xyz>
Closes #11924
Closes #11928
2021-04-23 03:49:21 +03:00
|
|
|
if (pid == 0 || pid == (pid_t)-1) {
|
|
|
|
(void) pthread_mutex_unlock(&_launched_processes_lock);
|
|
|
|
if (pid == 0 || errno == ECHILD)
|
2021-03-26 16:41:38 +03:00
|
|
|
pause();
|
|
|
|
else if (errno != EINTR)
|
|
|
|
zed_log_msg(LOG_WARNING,
|
|
|
|
"Failed to wait for children: %s",
|
|
|
|
strerror(errno));
|
2014-01-22 01:30:03 +04:00
|
|
|
} else {
|
2021-03-26 16:41:38 +03:00
|
|
|
memset(&node, 0, sizeof (node));
|
|
|
|
node.pid = pid;
|
|
|
|
pnode = avl_find(&_launched_processes, &node, NULL);
|
|
|
|
if (pnode) {
|
|
|
|
memcpy(&node, pnode, sizeof (node));
|
|
|
|
|
|
|
|
avl_remove(&_launched_processes, pnode);
|
|
|
|
free(pnode);
|
|
|
|
}
|
|
|
|
(void) pthread_mutex_unlock(&_launched_processes_lock);
|
2021-03-29 16:21:54 +03:00
|
|
|
__atomic_add_fetch(&_launched_processes_limit, 1,
|
|
|
|
__ATOMIC_SEQ_CST);
|
2021-03-26 16:41:38 +03:00
|
|
|
|
2021-04-02 15:10:31 +03:00
|
|
|
usage.ru_utime.tv_sec += usage.ru_stime.tv_sec;
|
|
|
|
usage.ru_utime.tv_usec += usage.ru_stime.tv_usec;
|
|
|
|
usage.ru_utime.tv_sec +=
|
|
|
|
usage.ru_utime.tv_usec / (1000 * 1000);
|
|
|
|
usage.ru_utime.tv_usec %= 1000 * 1000;
|
|
|
|
|
2021-03-26 16:41:38 +03:00
|
|
|
if (WIFEXITED(status)) {
|
|
|
|
zed_log_msg(LOG_INFO,
|
2021-04-02 15:10:31 +03:00
|
|
|
"Finished \"%s\" eid=%llu pid=%d "
|
|
|
|
"time=%llu.%06us exit=%d",
|
2021-03-26 16:41:38 +03:00
|
|
|
node.name, node.eid, pid,
|
2021-04-02 15:10:31 +03:00
|
|
|
(unsigned long long) usage.ru_utime.tv_sec,
|
|
|
|
(unsigned int) usage.ru_utime.tv_usec,
|
2021-03-26 16:41:38 +03:00
|
|
|
WEXITSTATUS(status));
|
|
|
|
} else if (WIFSIGNALED(status)) {
|
|
|
|
zed_log_msg(LOG_INFO,
|
2021-04-02 15:10:31 +03:00
|
|
|
"Finished \"%s\" eid=%llu pid=%d "
|
|
|
|
"time=%llu.%06us sig=%d/%s",
|
|
|
|
node.name, node.eid, pid,
|
|
|
|
(unsigned long long) usage.ru_utime.tv_sec,
|
|
|
|
(unsigned int) usage.ru_utime.tv_usec,
|
|
|
|
WTERMSIG(status),
|
2021-03-26 16:41:38 +03:00
|
|
|
strsignal(WTERMSIG(status)));
|
|
|
|
} else {
|
|
|
|
zed_log_msg(LOG_INFO,
|
|
|
|
"Finished \"%s\" eid=%llu pid=%d "
|
2021-04-02 15:10:31 +03:00
|
|
|
"time=%llu.%06us status=0x%X",
|
2022-09-20 03:32:18 +03:00
|
|
|
node.name, node.eid, pid,
|
2021-04-02 15:10:31 +03:00
|
|
|
(unsigned long long) usage.ru_utime.tv_sec,
|
|
|
|
(unsigned int) usage.ru_utime.tv_usec,
|
|
|
|
(unsigned int) status);
|
2021-03-26 16:41:38 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
free(node.name);
|
2014-01-22 01:30:03 +04:00
|
|
|
}
|
2016-11-08 02:01:38 +03:00
|
|
|
}
|
|
|
|
|
2021-03-26 16:41:38 +03:00
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
zed_exec_fini(void)
|
|
|
|
{
|
|
|
|
struct launched_process_node *node;
|
|
|
|
void *ck = NULL;
|
|
|
|
|
|
|
|
if (_reap_children_tid == (pthread_t)-1)
|
|
|
|
return;
|
|
|
|
|
|
|
|
_reap_children_stop = B_TRUE;
|
|
|
|
(void) pthread_kill(_reap_children_tid, SIGCHLD);
|
|
|
|
(void) pthread_join(_reap_children_tid, NULL);
|
|
|
|
|
|
|
|
while ((node = avl_destroy_nodes(&_launched_processes, &ck)) != NULL) {
|
|
|
|
free(node->name);
|
|
|
|
free(node);
|
2014-01-22 01:30:03 +04:00
|
|
|
}
|
2021-03-26 16:41:38 +03:00
|
|
|
avl_destroy(&_launched_processes);
|
|
|
|
|
|
|
|
(void) pthread_mutex_destroy(&_launched_processes_lock);
|
|
|
|
(void) pthread_mutex_init(&_launched_processes_lock, NULL);
|
|
|
|
|
|
|
|
_reap_children_tid = (pthread_t)-1;
|
2014-01-22 01:30:03 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2014-09-19 22:10:28 +04:00
|
|
|
* Process the event [eid] by synchronously invoking all zedlets with a
|
2014-09-11 01:22:39 +04:00
|
|
|
* matching class prefix.
|
|
|
|
*
|
2021-03-29 16:21:54 +03:00
|
|
|
* Each executable in [zcp->zedlets] from the directory [zcp->zedlet_dir]
|
|
|
|
* is matched against the event's [class], [subclass], and the "all" class
|
|
|
|
* (which matches all events).
|
|
|
|
* Every zedlet with a matching class prefix is invoked.
|
2014-09-19 22:10:28 +04:00
|
|
|
* The NAME=VALUE strings in [envs] will be passed to the zedlet as
|
2014-09-11 01:22:39 +04:00
|
|
|
* environment variables.
|
|
|
|
*
|
2021-03-29 16:21:54 +03:00
|
|
|
* The file descriptor [zcp->zevent_fd] is the zevent_fd used to track the
|
2014-09-11 01:22:39 +04:00
|
|
|
* current cursor location within the zevent nvlist.
|
|
|
|
*
|
2014-01-22 01:30:03 +04:00
|
|
|
* Return 0 on success, -1 on error.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
zed_exec_process(uint64_t eid, const char *class, const char *subclass,
|
2021-03-29 16:21:54 +03:00
|
|
|
struct zed_conf *zcp, zed_strings_t *envs)
|
2014-01-22 01:30:03 +04:00
|
|
|
{
|
|
|
|
const char *class_strings[4];
|
|
|
|
const char *allclass = "all";
|
|
|
|
const char **csp;
|
2014-09-19 22:10:28 +04:00
|
|
|
const char *z;
|
2014-01-22 01:30:03 +04:00
|
|
|
char **e;
|
|
|
|
int n;
|
|
|
|
|
2021-03-29 16:21:54 +03:00
|
|
|
if (!zcp->zedlet_dir || !zcp->zedlets || !envs || zcp->zevent_fd < 0)
|
2014-01-22 01:30:03 +04:00
|
|
|
return (-1);
|
|
|
|
|
2021-03-26 16:41:38 +03:00
|
|
|
if (_reap_children_tid == (pthread_t)-1) {
|
2021-03-29 16:21:54 +03:00
|
|
|
_launched_processes_limit = zcp->max_jobs;
|
|
|
|
|
2021-03-26 16:41:38 +03:00
|
|
|
if (pthread_create(&_reap_children_tid, NULL,
|
|
|
|
_reap_children, NULL) != 0)
|
|
|
|
return (-1);
|
|
|
|
pthread_setname_np(_reap_children_tid, "reap ZEDLETs");
|
|
|
|
|
|
|
|
avl_create(&_launched_processes, _launched_process_node_compare,
|
|
|
|
sizeof (struct launched_process_node),
|
|
|
|
offsetof(struct launched_process_node, node));
|
|
|
|
}
|
|
|
|
|
2014-01-22 01:30:03 +04:00
|
|
|
csp = class_strings;
|
|
|
|
|
|
|
|
if (class)
|
|
|
|
*csp++ = class;
|
|
|
|
|
|
|
|
if (subclass)
|
|
|
|
*csp++ = subclass;
|
|
|
|
|
|
|
|
if (allclass)
|
|
|
|
*csp++ = allclass;
|
|
|
|
|
|
|
|
*csp = NULL;
|
|
|
|
|
|
|
|
e = _zed_exec_create_env(envs);
|
|
|
|
|
2021-03-29 16:21:54 +03:00
|
|
|
for (z = zed_strings_first(zcp->zedlets); z;
|
|
|
|
z = zed_strings_next(zcp->zedlets)) {
|
2014-01-22 01:30:03 +04:00
|
|
|
for (csp = class_strings; *csp; csp++) {
|
|
|
|
n = strlen(*csp);
|
2014-09-19 22:10:28 +04:00
|
|
|
if ((strncmp(z, *csp, n) == 0) && !isalpha(z[n]))
|
2021-03-29 16:21:54 +03:00
|
|
|
_zed_exec_fork_child(eid, zcp->zedlet_dir,
|
2021-04-12 15:07:14 +03:00
|
|
|
z, e, zcp->zevent_fd, zcp->do_foreground);
|
2014-01-22 01:30:03 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
free(e);
|
|
|
|
return (0);
|
|
|
|
}
|