2 * Copyright (c) 2004-2005m, 2007-2009
3 * Todd C. Miller <Todd.Miller@courtesan.com>
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.
16 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
17 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
22 #include <sys/types.h>
23 #include <sys/param.h>
32 #endif /* STDC_HEADERS */
36 # ifdef HAVE_STRINGS_H
39 #endif /* HAVE_STRING_H */
42 #endif /* HAVE_UNISTD_H */
52 struct rbtree *aliases;
53 unsigned int alias_seqno;
56 * Comparison function for the red-black tree.
57 * Aliases are sorted by name with the type used as a tie-breaker.
63 const struct alias *a1 = (const struct alias *)v1;
64 const struct alias *a2 = (const struct alias *)v2;
71 else if ((res = strcmp(a1->name, a2->name)) == 0)
72 res = a1->type - a2->type;
77 * Search the tree for an alias with the specified name and type.
78 * Returns a pointer to the alias structure or NULL if not found.
81 alias_find(name, type)
87 struct alias *a = NULL;
91 if ((node = rbfind(aliases, &key)) != NULL) {
93 * Compare the global sequence number with the one stored
94 * in the alias. If they match then we've seen this alias
95 * before and found a loop.
98 if (a->seqno == alias_seqno)
100 a->seqno = alias_seqno;
106 * Add an alias to the aliases redblack tree.
107 * Returns NULL on success and an error string on failure.
110 alias_add(name, type, members)
113 struct member *members;
115 static char errbuf[512];
118 a = emalloc(sizeof(*a));
122 list2tq(&a->members, members);
123 if (rbinsert(aliases, a)) {
125 snprintf(errbuf, sizeof(errbuf), "Alias `%s' already defined", name);
132 * Apply a function to each alias entry and pass in a cookie.
135 alias_apply(func, cookie)
136 int (*func) __P((void *, void *));
139 rbapply(aliases, func, cookie, inorder);
143 * Returns TRUE if there are no aliases, else FALSE.
148 return(rbisempty(aliases));
152 * Free memory used by an alias struct and its members.
158 struct alias *a = (struct alias *)v;
160 struct sudo_command *c;
164 for (m = a->members.first; m != NULL; m = next) {
166 if (m->type == COMMAND) {
167 c = (struct sudo_command *) m->name;
178 * Find the named alias, remove it from the tree and return it.
181 alias_remove(name, type)
186 struct alias key, *a;
190 if ((node = rbfind(aliases, &key)) == NULL)
192 a = rbdelete(aliases, node);
200 rbdestroy(aliases, alias_free);
201 aliases = rbcreate(alias_compare);