[dragonfly.git] / bin / sh / alias.c

/*-
 * Copyright (c) 1993
 *	The Regents of the University of California.  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. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. 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.
 *
 * @(#)alias.c	8.3 (Berkeley) 5/4/95
 * $FreeBSD: src/bin/sh/alias.c,v 1.32 2011/06/13 21:03:27 jilles Exp $
 */

#include <stdlib.h>
#include "shell.h"
#include "output.h"
#include "error.h"
#include "memalloc.h"
#include "mystring.h"
#include "alias.h"
#include "options.h"	/* XXX for argptr (should remove?) */
#include "builtins.h"

#define ATABSIZE 39

static struct alias *atab[ATABSIZE];
static int aliases;

static void setalias(const char *, const char *);
static int unalias(const char *);
static struct alias **hashalias(const char *);

static
void
setalias(const char *name, const char *val)
{
	struct alias *ap, **app;

	app = hashalias(name);
	for (ap = *app; ap; ap = ap->next) {
		if (equal(name, ap->name)) {
			INTOFF;
			ckfree(ap->val);
			ap->val	= savestr(val);
			INTON;
			return;
		}
	}
	/* not found */
	INTOFF;
	ap = ckmalloc(sizeof (struct alias));
	ap->name = savestr(name);
	/*
	 * XXX - HACK: in order that the parser will not finish reading the
	 * alias value off the input before processing the next alias, we
	 * dummy up an extra space at the end of the alias.  This is a crock
	 * and should be re-thought.  The idea (if you feel inclined to help)
	 * is to avoid alias recursions.  The mechanism used is: when
	 * expanding an alias, the value of the alias is pushed back on the
	 * input as a string and a pointer to the alias is stored with the
	 * string.  The alias is marked as being in use.  When the input
	 * routine finishes reading the string, it marks the alias not
	 * in use.  The problem is synchronization with the parser.  Since
	 * it reads ahead, the alias is marked not in use before the
	 * resulting token(s) is next checked for further alias sub.  The
	 * H A C K is that we add a little fluff after the alias value
	 * so that the string will not be exhausted.  This is a good
	 * idea ------- ***NOT***
	 */
#ifdef notyet
	ap->val = savestr(val);
#else /* hack */
	{
	size_t len = strlen(val);
	ap->val = ckmalloc(len + 2);
	memcpy(ap->val, val, len);
	ap->val[len] = ' ';	/* fluff */
	ap->val[len+1] = '\0';
	}
#endif
	ap->flag = 0;
	ap->next = *app;
	*app = ap;
	aliases++;
	INTON;
}

static int
unalias(const char *name)
{
	struct alias *ap, **app;

	app = hashalias(name);

	for (ap = *app; ap; app = &(ap->next), ap = ap->next) {
		if (equal(name, ap->name)) {
			/*
			 * if the alias is currently in use (i.e. its
			 * buffer is being used by the input routine) we
			 * just null out the name instead of freeing it.
			 * We could clear it out later, but this situation
			 * is so rare that it hardly seems worth it.
			 */
			if (ap->flag & ALIASINUSE)
				*ap->name = '\0';
			else {
				INTOFF;
				*app = ap->next;
				ckfree(ap->name);
				ckfree(ap->val);
				ckfree(ap);
				INTON;
			}
			aliases--;
			return (0);
		}
	}

	return (1);
}

static void
rmaliases(void)
{
	struct alias *ap, *tmp;
	int i;

	INTOFF;
	for (i = 0; i < ATABSIZE; i++) {
		ap = atab[i];
		atab[i] = NULL;
		while (ap) {
			ckfree(ap->name);
			ckfree(ap->val);
			tmp = ap;
			ap = ap->next;
			ckfree(tmp);
		}
	}
	aliases = 0;
	INTON;
}

struct alias *
lookupalias(const char *name, int check)
{
	struct alias *ap = *hashalias(name);

	for (; ap; ap = ap->next) {
		if (equal(name, ap->name)) {
			if (check && (ap->flag & ALIASINUSE))
				return (NULL);
			return (ap);
		}
	}

	return (NULL);
}

static int
comparealiases(const void *p1, const void *p2)
{
	const struct alias *const *a1 = p1;
	const struct alias *const *a2 = p2;

	return strcmp((*a1)->name, (*a2)->name);
}

static void
printalias(const struct alias *a)
{
	char *p;

	out1fmt("%s=", a->name);
	/* Don't print the space added above. */
	p = a->val + strlen(a->val) - 1;
	*p = '\0';
	out1qstr(a->val);
	*p = ' ';
	out1c('\n');
}

static void
printaliases(void)
{
	int i, j;
	struct alias **sorted, *ap;

	sorted = ckmalloc(aliases * sizeof(*sorted));
	j = 0;
	for (i = 0; i < ATABSIZE; i++)
		for (ap = atab[i]; ap; ap = ap->next)
			if (*ap->name != '\0')
				sorted[j++] = ap;
	qsort(sorted, aliases, sizeof(*sorted), comparealiases);
	for (i = 0; i < aliases; i++)
		printalias(sorted[i]);
	ckfree(sorted);
}

int
aliascmd(int argc, char **argv)
{
	char *n, *v;
	int ret = 0;
	struct alias *ap;

	if (argc == 1) {
		printaliases();
		return (0);
	}
	while ((n = *++argv) != NULL) {
		if ((v = strchr(n+1, '=')) == NULL) /* n+1: funny ksh stuff */
			if ((ap = lookupalias(n, 0)) == NULL) {
				warning("%s: not found", n);
				ret = 1;
			} else
				printalias(ap);
		else {
			*v++ = '\0';
			setalias(n, v);
		}
	}

	return (ret);
}

int
unaliascmd(int argc __unused, char **argv __unused)
{
	int i;

	while ((i = nextopt("a")) != '\0') {
		if (i == 'a') {
			rmaliases();
			return (0);
		}
	}
	for (i = 0; *argptr; argptr++)
		i |= unalias(*argptr);

	return (i);
}

static struct alias **
hashalias(const char *p)
{
	unsigned int hashval;

	hashval = *p << 4;
	while (*p)
		hashval+= *p++;
	return &atab[hashval % ATABSIZE];
}
Commit	Line	Data
984263bc MD	1	/*-
	2	* Copyright (c) 1993
	3	* The Regents of the University of California. All rights reserved.
	4	*
	5	* This code is derived from software contributed to Berkeley by
	6	* Kenneth Almquist.
	7	*
	8	* Redistribution and use in source and binary forms, with or without
	9	* modification, are permitted provided that the following conditions
	10	* are met:
	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.
	23	*
	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
	34	* SUCH DAMAGE.
1de703da MD	35	*
1de703da MD	36	* @(#)alias.c 8.3 (Berkeley) 5/4/95
c3e3bc7a	37	* $FreeBSD: src/bin/sh/alias.c,v 1.32 2011/06/13 21:03:27 jilles Exp $
984263bc MD	38	*/
984263bc MD	39
984263bc MD	40	#include <stdlib.h>
984263bc MD	41	#include "shell.h"
984263bc MD	42	#include "output.h"
	43	#include "error.h"
	44	#include "memalloc.h"
	45	#include "mystring.h"
	46	#include "alias.h"
	47	#include "options.h" /* XXX for argptr (should remove?) */
c3e3bc7a	48	#include "builtins.h"
984263bc MD	49
	50	#define ATABSIZE 39
	51
99512ac4 PA	52	static struct alias *atab[ATABSIZE];
99512ac4 PA	53	static int aliases;
984263bc	54
99512ac4 PA	55	static void setalias(const char , const char );
	56	static int unalias(const char *);
	57	static struct alias *hashalias(const char );
984263bc	58
99512ac4	59	static
984263bc	60	void
99512ac4	61	setalias(const char name, const char val)
984263bc MD	62	{
	63	struct alias ap, *app;
	64
	65	app = hashalias(name);
	66	for (ap = *app; ap; ap = ap->next) {
	67	if (equal(name, ap->name)) {
	68	INTOFF;
	69	ckfree(ap->val);
	70	ap->val = savestr(val);
	71	INTON;
	72	return;
	73	}
	74	}
	75	/* not found */
	76	INTOFF;
	77	ap = ckmalloc(sizeof (struct alias));
	78	ap->name = savestr(name);
	79	/*
	80	* XXX - HACK: in order that the parser will not finish reading the
	81	* alias value off the input before processing the next alias, we
	82	* dummy up an extra space at the end of the alias. This is a crock
	83	* and should be re-thought. The idea (if you feel inclined to help)
	84	* is to avoid alias recursions. The mechanism used is: when
	85	* expanding an alias, the value of the alias is pushed back on the
	86	* input as a string and a pointer to the alias is stored with the
	87	* string. The alias is marked as being in use. When the input
	88	* routine finishes reading the string, it marks the alias not
	89	* in use. The problem is synchronization with the parser. Since
	90	* it reads ahead, the alias is marked not in use before the
	91	* resulting token(s) is next checked for further alias sub. The
	92	* H A C K is that we add a little fluff after the alias value
	93	* so that the string will not be exhausted. This is a good
	94	* idea ------- *NOT*
	95	*/
	96	#ifdef notyet
	97	ap->val = savestr(val);
	98	#else /* hack */
	99	{
99512ac4	100	size_t len = strlen(val);
984263bc MD	101	ap->val = ckmalloc(len + 2);
	102	memcpy(ap->val, val, len);
	103	ap->val[len] = ' '; /* fluff */
	104	ap->val[len+1] = '\0';
	105	}
	106	#endif
	107	ap->flag = 0;
	108	ap->next = *app;
	109	*app = ap;
99512ac4	110	aliases++;
984263bc MD	111	INTON;
	112	}
	113
99512ac4 PA	114	static int
99512ac4 PA	115	unalias(const char *name)
984263bc MD	116	{
	117	struct alias ap, *app;
	118
	119	app = hashalias(name);
	120
	121	for (ap = *app; ap; app = &(ap->next), ap = ap->next) {
	122	if (equal(name, ap->name)) {
	123	/*
	124	* if the alias is currently in use (i.e. its
	125	* buffer is being used by the input routine) we
	126	* just null out the name instead of freeing it.
	127	* We could clear it out later, but this situation
	128	* is so rare that it hardly seems worth it.
	129	*/
	130	if (ap->flag & ALIASINUSE)
	131	*ap->name = '\0';
	132	else {
	133	INTOFF;
	134	*app = ap->next;
	135	ckfree(ap->name);
	136	ckfree(ap->val);
	137	ckfree(ap);
	138	INTON;
	139	}
99512ac4	140	aliases--;
984263bc MD	141	return (0);
	142	}
	143	}
	144
	145	return (1);
	146	}
	147
99512ac4	148	static void
984263bc MD	149	rmaliases(void)
	150	{
	151	struct alias ap, tmp;
	152	int i;
	153
	154	INTOFF;
	155	for (i = 0; i < ATABSIZE; i++) {
	156	ap = atab[i];
	157	atab[i] = NULL;
	158	while (ap) {
	159	ckfree(ap->name);
	160	ckfree(ap->val);
	161	tmp = ap;
	162	ap = ap->next;
	163	ckfree(tmp);
	164	}
	165	}
99512ac4	166	aliases = 0;
984263bc MD	167	INTON;
	168	}
	169
	170	struct alias *
99512ac4	171	lookupalias(const char *name, int check)
984263bc MD	172	{
	173	struct alias ap = hashalias(name);
	174
	175	for (; ap; ap = ap->next) {
	176	if (equal(name, ap->name)) {
	177	if (check && (ap->flag & ALIASINUSE))
	178	return (NULL);
	179	return (ap);
	180	}
	181	}
	182
	183	return (NULL);
	184	}
	185
99512ac4 PA	186	static int
	187	comparealiases(const void p1, const void p2)
	188	{
	189	const struct alias const a1 = p1;
	190	const struct alias const a2 = p2;
	191
	192	return strcmp((a1)->name, (a2)->name);
	193	}
	194
	195	static void
	196	printalias(const struct alias *a)
	197	{
	198	char *p;
	199
	200	out1fmt("%s=", a->name);
	201	/* Don't print the space added above. */
	202	p = a->val + strlen(a->val) - 1;
	203	*p = '\0';
	204	out1qstr(a->val);
	205	*p = ' ';
	206	out1c('\n');
	207	}
	208
	209	static void
	210	printaliases(void)
	211	{
	212	int i, j;
	213	struct alias *sorted, ap;
	214
	215	sorted = ckmalloc(aliases * sizeof(*sorted));
	216	j = 0;
	217	for (i = 0; i < ATABSIZE; i++)
	218	for (ap = atab[i]; ap; ap = ap->next)
	219	if (*ap->name != '\0')
	220	sorted[j++] = ap;
	221	qsort(sorted, aliases, sizeof(*sorted), comparealiases);
	222	for (i = 0; i < aliases; i++)
	223	printalias(sorted[i]);
	224	ckfree(sorted);
	225	}
	226
984263bc MD	227	int
	228	aliascmd(int argc, char **argv)
	229	{
	230	char n, v;
	231	int ret = 0;
	232	struct alias *ap;
	233
	234	if (argc == 1) {
99512ac4	235	printaliases();
984263bc MD	236	return (0);
	237	}
	238	while ((n = *++argv) != NULL) {
	239	if ((v = strchr(n+1, '=')) == NULL) /* n+1: funny ksh stuff */
	240	if ((ap = lookupalias(n, 0)) == NULL) {
f893ef22	241	warning("%s: not found", n);
984263bc	242	ret = 1;
99512ac4 PA	243	} else
99512ac4 PA	244	printalias(ap);
984263bc MD	245	else {
	246	*v++ = '\0';
	247	setalias(n, v);
	248	}
	249	}
	250
	251	return (ret);
	252	}
	253
	254	int
	255	unaliascmd(int argc __unused, char **argv __unused)
	256	{
	257	int i;
	258
	259	while ((i = nextopt("a")) != '\0') {
	260	if (i == 'a') {
	261	rmaliases();
	262	return (0);
	263	}
	264	}
	265	for (i = 0; *argptr; argptr++)
7085f7b3	266	i \|= unalias(*argptr);
984263bc MD	267
	268	return (i);
	269	}
	270
99512ac4 PA	271	static struct alias **
99512ac4 PA	272	hashalias(const char *p)
984263bc MD	273	{
	274	unsigned int hashval;
	275
	276	hashval = *p << 4;
	277	while (*p)
	278	hashval+= *p++;
	279	return &atab[hashval % ATABSIZE];
	280	}