2 * Copyright (c) 2004-2005, 2007-2011
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 */
35 #endif /* HAVE_STRING_H */
38 #endif /* HAVE_STRING_H */
41 #endif /* HAVE_UNISTD_H */
51 struct rbtree *aliases;
52 unsigned int alias_seqno;
55 * Comparison function for the red-black tree.
56 * Aliases are sorted by name with the type used as a tie-breaker.
59 alias_compare(const void *v1, const void *v2)
61 const struct alias *a1 = (const struct alias *)v1;
62 const struct alias *a2 = (const struct alias *)v2;
69 else if ((res = strcmp(a1->name, a2->name)) == 0)
70 res = a1->type - a2->type;
75 * Search the tree for an alias with the specified name and type.
76 * Returns a pointer to the alias structure or NULL if not found.
79 alias_find(char *name, int type)
83 struct alias *a = NULL;
87 if ((node = rbfind(aliases, &key)) != NULL) {
89 * Compare the global sequence number with the one stored
90 * in the alias. If they match then we've seen this alias
91 * before and found a loop.
94 if (a->seqno == alias_seqno)
96 a->seqno = alias_seqno;
102 * Add an alias to the aliases redblack tree.
103 * Returns NULL on success and an error string on failure.
106 alias_add(char *name, int type, struct member *members)
108 static char errbuf[512];
111 a = emalloc(sizeof(*a));
115 list2tq(&a->members, members);
116 if (rbinsert(aliases, a)) {
117 snprintf(errbuf, sizeof(errbuf), "Alias `%s' already defined", name);
125 * Apply a function to each alias entry and pass in a cookie.
128 alias_apply(int (*func)(void *, void *), void *cookie)
130 rbapply(aliases, func, cookie, inorder);
134 * Returns TRUE if there are no aliases, else FALSE.
139 return rbisempty(aliases);
143 * Free memory used by an alias struct and its members.
148 struct alias *a = (struct alias *)v;
150 struct sudo_command *c;
154 for (m = a->members.first; m != NULL; m = next) {
156 if (m->type == COMMAND) {
157 c = (struct sudo_command *) m->name;
168 * Find the named alias, remove it from the tree and return it.
171 alias_remove(char *name, int type)
178 if ((node = rbfind(aliases, &key)) == NULL)
180 return rbdelete(aliases, node);
187 rbdestroy(aliases, alias_free);
188 aliases = rbcreate(alias_compare);