summaryrefslogtreecommitdiff
path: root/bin/sh/alias.c
blob: 2848b52cd50a85d6e6eafc9a2c81bb65b4a1808e (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
/*	$NetBSD: alias.c,v 1.20 2018/12/03 06:40:26 kre Exp $	*/

/*-
 * 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. 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 <sys/cdefs.h>
#ifndef lint
#if 0
static char sccsid[] = "@(#)alias.c	8.3 (Berkeley) 5/4/95";
#else
__RCSID("$NetBSD: alias.c,v 1.20 2018/12/03 06:40:26 kre Exp $");
#endif
#endif /* not lint */

#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?) */
#include "builtins.h"
#include "var.h"

#define ATABSIZE 39

struct alias *atab[ATABSIZE];

STATIC void setalias(char *, char *);
STATIC int by_name(const void *, const void *);
STATIC void list_aliases(void);
STATIC int unalias(char *);
STATIC struct alias **freealias(struct alias **, int);
STATIC struct alias **hashalias(const char *);
STATIC size_t countaliases(void);

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

	(void) unalias(name);	/* old one (if any) is now gone */
	app = hashalias(name);

	INTOFF;
	ap = ckmalloc(sizeof (struct alias));
	ap->name = savestr(name);
	ap->flag = 0;
	ap->val = savestr(val);
	ap->next = *app;
	*app = ap;
	INTON;
}

STATIC struct alias **
freealias(struct alias **app, int force)
{
	struct alias *ap = *app;

	if (ap == NULL)
		return app;

	/*
	 * 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 discarding it.
	 * If we encounter it later, when it is idle,
	 * we will finish freeing it then.
	 *
	 * Unless we want to simply free everything (INIT)
	 */
	if (ap->flag & ALIASINUSE && !force) {
		*ap->name = '\0';
		return &ap->next;
	}

	INTOFF;
	*app = ap->next;
	ckfree(ap->name);
	ckfree(ap->val);
	ckfree(ap);
	INTON;

	return app;
}

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

	app = hashalias(name);
	while ((ap = *app) != NULL) {
		if (equal(name, ap->name)) {
			(void) freealias(app, 0);
			return 0;
		}
		app = &ap->next;
	}

	return 1;
}

#ifdef mkinit
MKINIT void rmaliases(int);

SHELLPROC {
	rmaliases(1);
}
#endif

void
rmaliases(int force)
{
	struct alias **app;
	int i;

	INTOFF;
	for (i = 0; i < ATABSIZE; i++) {
		app = &atab[i];
		while (*app)
			app = freealias(app, force);
	}
	INTON;
}

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

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

	return NULL;
}

const char *
alias_text(void *dummy __unused, const char *name)
{
	struct alias *ap;

	ap = lookupalias(name, 0);
	if (ap == NULL)
		return NULL;
	return ap->val;
}

STATIC int
by_name(const void *a, const void *b)
{

	return strcmp(
		(*(const struct alias * const *)a)->name,
		(*(const struct alias * const *)b)->name);
}

STATIC void
list_aliases(void)
{
	size_t i, j, n;
	const struct alias **aliases;
	const struct alias *ap;

	INTOFF;
	n = countaliases();
	aliases = ckmalloc(n * sizeof aliases[0]);

	j = 0;
	for (i = 0; i < ATABSIZE; i++)
		for (ap = atab[i]; ap != NULL; ap = ap->next)
			if (ap->name[0] != '\0')
				aliases[j++] = ap;
	if (j != n)
		error("Alias count botch");
	INTON;

	qsort(aliases, n, sizeof aliases[0], by_name);

	for (i = 0; i < n; i++) {
		out1fmt("alias %s=", aliases[i]->name);
		print_quoted(aliases[i]->val);
		out1c('\n');
	}

	ckfree(aliases);
}

/*
 * Count how many aliases are defined (skipping any
 * that have been deleted, but don't know it yet).
 * Use this opportunity to clean up any of those
 * zombies that are no longer needed.
 */
STATIC size_t
countaliases(void)
{
	struct alias *ap, **app;
	size_t n;
	int i;

	n = 0;
	for (i = 0; i < ATABSIZE; i++)
		for (app = &atab[i]; (ap = *app) != NULL;) {
			if (ap->name[0] != '\0')
				n++;
			else {
				app = freealias(app, 0);
				continue;
			}
			app = &ap->next;
		}

	return n;
}

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

	if (argc == 1) {
		list_aliases();
		return 0;
	}

	while ((n = *++argv) != NULL) {
		if ((v = strchr(n+1, '=')) == NULL) { /* n+1: funny ksh stuff */
			if ((ap = lookupalias(n, 0)) == NULL) {
				outfmt(out2, "alias: %s not found\n", n);
				ret = 1;
			} else {
				out1fmt("alias %s=", n);
				print_quoted(ap->val);
				out1c('\n');
			}
		} 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(0);
			return 0;
		}
	}

	(void)countaliases();	/* delete any dead ones */
	for (i = 0; *argptr; argptr++)
		i |= unalias(*argptr);

	return i;
}

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

	hashval = *(const unsigned char *)p << 4;
	while (*p)
		hashval += *p++;
	return &atab[hashval % ATABSIZE];
}