vars.c revision 1.8 1 1.8 wiz /* $NetBSD: vars.c,v 1.8 2002/03/02 15:27:52 wiz Exp $ */
2 1.4 christos
3 1.1 cgd /*
4 1.3 deraadt * Copyright (c) 1980, 1993
5 1.3 deraadt * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.5 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.4 christos #if 0
39 1.4 christos static char sccsid[] = "@(#)vars.c 8.1 (Berkeley) 6/6/93";
40 1.4 christos #else
41 1.8 wiz __RCSID("$NetBSD: vars.c,v 1.8 2002/03/02 15:27:52 wiz Exp $");
42 1.4 christos #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd #include "rcv.h"
46 1.3 deraadt #include "extern.h"
47 1.1 cgd
48 1.1 cgd /*
49 1.1 cgd * Mail -- a mail program
50 1.1 cgd *
51 1.1 cgd * Variable handling stuff.
52 1.1 cgd */
53 1.1 cgd
54 1.1 cgd /*
55 1.1 cgd * Assign a value to a variable.
56 1.1 cgd */
57 1.3 deraadt void
58 1.8 wiz assign(char name[], char values[])
59 1.1 cgd {
60 1.5 lukem struct var *vp;
61 1.5 lukem int h;
62 1.1 cgd
63 1.1 cgd h = hash(name);
64 1.1 cgd vp = lookup(name);
65 1.1 cgd if (vp == NOVAR) {
66 1.1 cgd vp = (struct var *) calloc(sizeof *vp, 1);
67 1.1 cgd vp->v_name = vcopy(name);
68 1.1 cgd vp->v_link = variables[h];
69 1.1 cgd variables[h] = vp;
70 1.1 cgd }
71 1.1 cgd else
72 1.6 wsanchez v_free(vp->v_value);
73 1.8 wiz vp->v_value = vcopy(values);
74 1.1 cgd }
75 1.1 cgd
76 1.1 cgd /*
77 1.1 cgd * Free up a variable string. We do not bother to allocate
78 1.1 cgd * strings whose value is "" since they are expected to be frequent.
79 1.1 cgd * Thus, we cannot free same!
80 1.1 cgd */
81 1.3 deraadt void
82 1.7 wiz v_free(char *cp)
83 1.1 cgd {
84 1.1 cgd if (*cp)
85 1.1 cgd free(cp);
86 1.1 cgd }
87 1.1 cgd
88 1.1 cgd /*
89 1.1 cgd * Copy a variable value into permanent (ie, not collected after each
90 1.1 cgd * command) space. Do not bother to alloc space for ""
91 1.1 cgd */
92 1.1 cgd
93 1.1 cgd char *
94 1.7 wiz vcopy(char str[])
95 1.1 cgd {
96 1.1 cgd char *new;
97 1.1 cgd unsigned len;
98 1.1 cgd
99 1.1 cgd if (*str == '\0')
100 1.1 cgd return "";
101 1.1 cgd len = strlen(str) + 1;
102 1.1 cgd if ((new = malloc(len)) == NULL)
103 1.5 lukem errx(1, "Out of memory");
104 1.5 lukem memmove(new, str, (int) len);
105 1.1 cgd return new;
106 1.1 cgd }
107 1.1 cgd
108 1.1 cgd /*
109 1.1 cgd * Get the value of a variable and return it.
110 1.1 cgd * Look in the environment if its not available locally.
111 1.1 cgd */
112 1.1 cgd
113 1.1 cgd char *
114 1.7 wiz value(char name[])
115 1.1 cgd {
116 1.5 lukem struct var *vp;
117 1.1 cgd
118 1.1 cgd if ((vp = lookup(name)) == NOVAR)
119 1.1 cgd return(getenv(name));
120 1.1 cgd return(vp->v_value);
121 1.1 cgd }
122 1.1 cgd
123 1.1 cgd /*
124 1.1 cgd * Locate a variable and return its variable
125 1.1 cgd * node.
126 1.1 cgd */
127 1.1 cgd
128 1.1 cgd struct var *
129 1.7 wiz lookup(char name[])
130 1.1 cgd {
131 1.5 lukem struct var *vp;
132 1.1 cgd
133 1.1 cgd for (vp = variables[hash(name)]; vp != NOVAR; vp = vp->v_link)
134 1.1 cgd if (*vp->v_name == *name && equal(vp->v_name, name))
135 1.1 cgd return(vp);
136 1.1 cgd return(NOVAR);
137 1.1 cgd }
138 1.1 cgd
139 1.1 cgd /*
140 1.1 cgd * Locate a group name and return it.
141 1.1 cgd */
142 1.1 cgd
143 1.1 cgd struct grouphead *
144 1.7 wiz findgroup(char name[])
145 1.1 cgd {
146 1.5 lukem struct grouphead *gh;
147 1.1 cgd
148 1.1 cgd for (gh = groups[hash(name)]; gh != NOGRP; gh = gh->g_link)
149 1.1 cgd if (*gh->g_name == *name && equal(gh->g_name, name))
150 1.1 cgd return(gh);
151 1.1 cgd return(NOGRP);
152 1.1 cgd }
153 1.1 cgd
154 1.1 cgd /*
155 1.1 cgd * Print a group out on stdout
156 1.1 cgd */
157 1.3 deraadt void
158 1.7 wiz printgroup(char name[])
159 1.1 cgd {
160 1.5 lukem struct grouphead *gh;
161 1.5 lukem struct group *gp;
162 1.1 cgd
163 1.1 cgd if ((gh = findgroup(name)) == NOGRP) {
164 1.1 cgd printf("\"%s\": not a group\n", name);
165 1.1 cgd return;
166 1.1 cgd }
167 1.1 cgd printf("%s\t", gh->g_name);
168 1.1 cgd for (gp = gh->g_list; gp != NOGE; gp = gp->ge_link)
169 1.1 cgd printf(" %s", gp->ge_name);
170 1.1 cgd putchar('\n');
171 1.1 cgd }
172 1.1 cgd
173 1.1 cgd /*
174 1.1 cgd * Hash the passed string and return an index into
175 1.1 cgd * the variable or group hash table.
176 1.1 cgd */
177 1.3 deraadt int
178 1.7 wiz hash(char *name)
179 1.1 cgd {
180 1.5 lukem int h = 0;
181 1.1 cgd
182 1.1 cgd while (*name) {
183 1.1 cgd h <<= 2;
184 1.1 cgd h += *name++;
185 1.1 cgd }
186 1.1 cgd if (h < 0 && (h = -h) < 0)
187 1.1 cgd h = 0;
188 1.1 cgd return (h % HSHSIZE);
189 1.1 cgd }
190