| /*- | |
| * Copyright (c) 1993 | |
| * The Regents of the University of California. All rights reserved. | |
| * Copyright (c) 1997-2005 | |
| * Herbert Xu <herbert@gondor.apana.org.au>. All rights reserved. | |
| * | |
| * This code is derived from software contributed to Berkeley by | |
| * Kenneth Almquist. | |
| * | |
| * Redistribution and use in source and binary forms, with or without | |
| * modification, are permitted provided that the following conditions | |
| * are met: | |
| * 1. Redistributions of source code must retain the above copyright | |
| * notice, this list of conditions and the following disclaimer. | |
| * 2. Redistributions in binary form must reproduce the above copyright | |
| * notice, this list of conditions and the following disclaimer in the | |
| * documentation and/or other materials provided with the distribution. | |
| * 3. Neither the name of the University nor the names of its contributors | |
| * may be used to endorse or promote products derived from this software | |
| * without specific prior written permission. | |
| * | |
| * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
| * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
| * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
| * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
| * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
| * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
| * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
| * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
| * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
| * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
| * SUCH DAMAGE. | |
| */ | |
| #include <stdlib.h> | |
| #include "shell.h" | |
| #include "input.h" | |
| #include "output.h" | |
| #include "error.h" | |
| #include "memalloc.h" | |
| #include "mystring.h" | |
| #include "alias.h" | |
| #include "options.h" /* XXX for argptr (should remove?) */ | |
| #define ATABSIZE 39 | |
| struct alias *atab[ATABSIZE]; | |
| STATIC void setalias(const char *, const char *); | |
| STATIC struct alias *freealias(struct alias *); | |
| STATIC struct alias **__lookupalias(const char *); | |
| STATIC | |
| void | |
| setalias(const char *name, const char *val) | |
| { | |
| struct alias *ap, **app; | |
| app = __lookupalias(name); | |
| ap = *app; | |
| INTOFF; | |
| if (ap) { | |
| if (!(ap->flag & ALIASINUSE)) { | |
| ckfree(ap->val); | |
| } | |
| ap->val = savestr(val); | |
| ap->flag &= ~ALIASDEAD; | |
| } else { | |
| /* not found */ | |
| ap = ckmalloc(sizeof (struct alias)); | |
| ap->name = savestr(name); | |
| ap->val = savestr(val); | |
| ap->flag = 0; | |
| ap->next = 0; | |
| *app = ap; | |
| } | |
| INTON; | |
| } | |
| int | |
| unalias(const char *name) | |
| { | |
| struct alias **app; | |
| app = __lookupalias(name); | |
| if (*app) { | |
| INTOFF; | |
| *app = freealias(*app); | |
| INTON; | |
| return (0); | |
| } | |
| return (1); | |
| } | |
| void | |
| rmaliases(void) | |
| { | |
| struct alias *ap, **app; | |
| int i; | |
| INTOFF; | |
| for (i = 0; i < ATABSIZE; i++) { | |
| app = &atab[i]; | |
| for (ap = *app; ap; ap = *app) { | |
| *app = freealias(*app); | |
| if (ap == *app) { | |
| app = &ap->next; | |
| } | |
| } | |
| } | |
| INTON; | |
| } | |
| struct alias * | |
| lookupalias(const char *name, int check) | |
| { | |
| struct alias *ap = *__lookupalias(name); | |
| if (check && ap && (ap->flag & ALIASINUSE)) | |
| return (NULL); | |
| return (ap); | |
| } | |
| /* | |
| * TODO - sort output | |
| */ | |
| int | |
| aliascmd(int argc, char **argv) | |
| { | |
| char *n, *v; | |
| int ret = 0; | |
| struct alias *ap; | |
| if (argc == 1) { | |
| int i; | |
| for (i = 0; i < ATABSIZE; i++) | |
| for (ap = atab[i]; ap; ap = ap->next) { | |
| printalias(ap); | |
| } | |
| return (0); | |
| } | |
| while ((n = *++argv) != NULL) { | |
| if ((v = strchr(n+1, '=')) == NULL) { /* n+1: funny ksh stuff */ | |
| if ((ap = *__lookupalias(n)) == NULL) { | |
| outfmt(out2, "%s: %s not found\n", "alias", n); | |
| ret = 1; | |
| } else | |
| printalias(ap); | |
| } else { | |
| *v++ = '\0'; | |
| setalias(n, v); | |
| } | |
| } | |
| return (ret); | |
| } | |
| int | |
| unaliascmd(int argc, char **argv) | |
| { | |
| int i; | |
| while ((i = nextopt("a")) != '\0') { | |
| if (i == 'a') { | |
| rmaliases(); | |
| return (0); | |
| } | |
| } | |
| for (i = 0; *argptr; argptr++) { | |
| if (unalias(*argptr)) { | |
| outfmt(out2, "%s: %s not found\n", "unalias", *argptr); | |
| i = 1; | |
| } | |
| } | |
| return (i); | |
| } | |
| STATIC struct alias * | |
| freealias(struct alias *ap) { | |
| struct alias *next; | |
| if (ap->flag & ALIASINUSE) { | |
| ap->flag |= ALIASDEAD; | |
| return ap; | |
| } | |
| next = ap->next; | |
| ckfree(ap->name); | |
| ckfree(ap->val); | |
| ckfree(ap); | |
| return next; | |
| } | |
| void | |
| printalias(const struct alias *ap) { | |
| out1fmt("%s=%s\n", ap->name, single_quote(ap->val)); | |
| } | |
| STATIC struct alias ** | |
| __lookupalias(const char *name) { | |
| unsigned int hashval; | |
| struct alias **app; | |
| const char *p; | |
| unsigned int ch; | |
| p = name; | |
| ch = (unsigned char)*p; | |
| hashval = ch << 4; | |
| while (ch) { | |
| hashval += ch; | |
| ch = (unsigned char)*++p; | |
| } | |
| app = &atab[hashval % ATABSIZE]; | |
| for (; *app; app = &(*app)->next) { | |
| if (equal(name, (*app)->name)) { | |
| break; | |
| } | |
| } | |
| return app; | |
| } |