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