3 * Copyright (c) 2016 Ted Unangst <tedu@openbsd.org>
5 * Permission to use, copy, modify, and distribute this software for any
6 * purpose with or without fee is hereby granted, provided that the above
7 * copyright notice and this permission notice appear in all copies.
9 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
18 #include <sys/types.h>
32 RB_ENTRY(envnode) node;
38 RB_HEAD(envtree, envnode) root;
43 envcmp(struct envnode *a, struct envnode *b)
45 return strcmp(a->key, b->key);
47 RB_GENERATE_STATIC(envtree, envnode, node, envcmp)
49 struct env *createenv(char **);
50 struct env *filterenv(struct env *, struct rule *);
51 char **flattenenv(struct env *);
54 createenv(char **envp)
59 env = malloc(sizeof(*env));
65 for (i = 0; envp[i] != NULL; i++) {
71 if ((eq = strchr(e, '=')) == NULL || eq == e)
73 node = malloc(sizeof(*node));
76 node->key = strndup(envp[i], eq - e);
77 node->value = strdup(eq + 1);
78 if (!node->key || !node->value)
80 if (RB_FIND(envtree, &env->root, node)) {
81 free((char *)node->key);
82 free((char *)node->value);
85 RB_INSERT(envtree, &env->root, node);
93 flattenenv(struct env *env)
99 envp = reallocarray(NULL, env->count + 1, sizeof(char *));
103 RB_FOREACH(node, envtree, &env->root) {
104 if (asprintf(&envp[i], "%s=%s", node->key, node->value) == -1)
113 copyenv(struct env *orig, struct env *copy, const char **envlist)
115 struct envnode *node, key;
118 for (i = 0; envlist[i]; i++) {
119 key.key = envlist[i];
120 if ((node = RB_FIND(envtree, &orig->root, &key))) {
121 RB_REMOVE(envtree, &orig->root, node);
123 RB_INSERT(envtree, ©->root, node);
130 filterenv(struct env *orig, struct rule *rule)
132 const char *safeset[] = {
133 "DISPLAY", "HOME", "LOGNAME", "MAIL",
134 "PATH", "TERM", "USER", "USERNAME",
137 const char *badset[] = {
142 struct envnode *node, key;
145 if ((rule->options & KEEPENV) && !rule->envlist) {
146 for (i = 0; badset[i]; i++) {
148 if ((node = RB_FIND(envtree, &orig->root, &key))) {
149 RB_REMOVE(envtree, &orig->root, node);
150 free((char *)node->key);
151 free((char *)node->value);
159 copy = malloc(sizeof(*copy));
162 RB_INIT(©->root);
166 copyenv(orig, copy, rule->envlist);
167 copyenv(orig, copy, safeset);
173 prepenv(struct rule *rule)
175 extern char **environ;
178 env = createenv(environ);
179 env = filterenv(env, rule);
180 return flattenenv(env);