3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 static char sccsid[] = "@(#)alias.c 8.3 (Berkeley) 5/4/95";
41 static const char rcsid[] =
53 #include "options.h" /* XXX for argptr (should remove?) */
57 struct alias *atab[ATABSIZE];
59 STATIC void setalias __P((char *, char *));
60 STATIC int unalias __P((char *));
61 STATIC struct alias **hashalias __P((char *));
68 struct alias *ap, **app;
70 app = hashalias(name);
71 for (ap = *app; ap; ap = ap->next) {
72 if (equal(name, ap->name)) {
75 ap->val = savestr(val);
82 ap = ckmalloc(sizeof (struct alias));
83 ap->name = savestr(name);
85 * XXX - HACK: in order that the parser will not finish reading the
86 * alias value off the input before processing the next alias, we
87 * dummy up an extra space at the end of the alias. This is a crock
88 * and should be re-thought. The idea (if you feel inclined to help)
89 * is to avoid alias recursions. The mechanism used is: when
90 * expanding an alias, the value of the alias is pushed back on the
91 * input as a string and a pointer to the alias is stored with the
92 * string. The alias is marked as being in use. When the input
93 * routine finishes reading the string, it marks the alias not
94 * in use. The problem is synchronization with the parser. Since
95 * it reads ahead, the alias is marked not in use before the
96 * resulting token(s) is next checked for further alias sub. The
97 * H A C K is that we add a little fluff after the alias value
98 * so that the string will not be exhausted. This is a good
99 * idea ------- ***NOT***
102 ap->val = savestr(val);
105 int len = strlen(val);
106 ap->val = ckmalloc(len + 2);
107 memcpy(ap->val, val, len);
108 ap->val[len] = ' '; /* fluff */
109 ap->val[len+1] = '\0';
121 struct alias *ap, **app;
123 app = hashalias(name);
125 for (ap = *app; ap; app = &(ap->next), ap = ap->next) {
126 if (equal(name, ap->name)) {
128 * if the alias is currently in use (i.e. its
129 * buffer is being used by the input routine) we
130 * just null out the name instead of freeing it.
131 * We could clear it out later, but this situation
132 * is so rare that it hardly seems worth it.
134 if (ap->flag & ALIASINUSE)
152 MKINIT void rmaliases();
161 struct alias *ap, *tmp;
165 for (i = 0; i < ATABSIZE; i++) {
180 lookupalias(name, check)
184 struct alias *ap = *hashalias(name);
186 for (; ap; ap = ap->next) {
187 if (equal(name, ap->name)) {
188 if (check && (ap->flag & ALIASINUSE))
212 for (i = 0; i < ATABSIZE; i++)
213 for (ap = atab[i]; ap; ap = ap->next) {
214 if (*ap->name != '\0')
215 out1fmt("alias %s=%s\n", ap->name, ap->val);
219 while ((n = *++argv) != NULL) {
220 if ((v = strchr(n+1, '=')) == NULL) /* n+1: funny ksh stuff */
221 if ((ap = lookupalias(n, 0)) == NULL) {
222 outfmt(out2, "alias: %s not found\n", n);
225 out1fmt("alias %s=%s\n", n, ap->val);
236 unaliascmd(argc, argv)
238 char **argv __unused;
242 while ((i = nextopt("a")) != '\0') {
248 for (i = 0; *argptr; argptr++)
249 i = unalias(*argptr);
254 STATIC struct alias **
258 unsigned int hashval;
263 return &atab[hashval % ATABSIZE];