subr.c revision 1.14 1 1.14 agc /* $NetBSD: subr.c,v 1.14 2003/08/07 11:13:38 agc Exp $ */
2 1.3 jtc
3 1.1 cgd /*
4 1.3 jtc * Copyright (c) 1980, 1993
5 1.3 jtc * 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.14 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.5 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.3 jtc #if 0
35 1.3 jtc static char sccsid[] = "@(#)subr.c 8.1 (Berkeley) 6/6/93";
36 1.3 jtc #endif
37 1.14 agc __RCSID("$NetBSD: subr.c,v 1.14 2003/08/07 11:13:38 agc Exp $");
38 1.1 cgd #endif /* not lint */
39 1.1 cgd
40 1.5 lukem #include <ctype.h>
41 1.5 lukem #include <err.h>
42 1.1 cgd #include <stdio.h>
43 1.1 cgd #include <stdlib.h>
44 1.1 cgd #include <string.h>
45 1.1 cgd #include "error.h"
46 1.1 cgd /*
47 1.1 cgd * Arrayify a list of rules
48 1.1 cgd */
49 1.5 lukem void
50 1.11 wiz arrayify(int *e_length, Eptr **e_array, Eptr header)
51 1.1 cgd {
52 1.5 lukem Eptr errorp;
53 1.5 lukem Eptr *array;
54 1.5 lukem int listlength;
55 1.5 lukem int listindex;
56 1.1 cgd
57 1.1 cgd for (errorp = header, listlength = 0;
58 1.1 cgd errorp; errorp = errorp->error_next, listlength++)
59 1.1 cgd continue;
60 1.1 cgd array = (Eptr*)Calloc(listlength+1, sizeof (Eptr));
61 1.1 cgd for(listindex = 0, errorp = header;
62 1.1 cgd listindex < listlength;
63 1.1 cgd listindex++, errorp = errorp->error_next){
64 1.1 cgd array[listindex] = errorp;
65 1.1 cgd errorp->error_position = listindex;
66 1.1 cgd }
67 1.8 christos array[listindex] = NULL;
68 1.1 cgd *e_length = listlength;
69 1.1 cgd *e_array = array;
70 1.1 cgd }
71 1.1 cgd
72 1.5 lukem char *
73 1.11 wiz Calloc(int nelements, int size)
74 1.1 cgd {
75 1.1 cgd char *back;
76 1.9 mjl if ( (back = (char *)calloc(nelements, size)) == NULL)
77 1.5 lukem errx(1, "Ran out of memory.");
78 1.1 cgd return(back);
79 1.1 cgd }
80 1.1 cgd
81 1.1 cgd /*
82 1.1 cgd * find the position of a given character in a string
83 1.1 cgd * (one based)
84 1.1 cgd */
85 1.5 lukem int
86 1.11 wiz position(char *string, char ch)
87 1.1 cgd {
88 1.5 lukem int i;
89 1.1 cgd if (string)
90 1.1 cgd for (i=1; *string; string++, i++){
91 1.1 cgd if (*string == ch)
92 1.1 cgd return(i);
93 1.1 cgd }
94 1.1 cgd return(-1);
95 1.1 cgd }
96 1.5 lukem
97 1.1 cgd /*
98 1.1 cgd * clobber the first occurance of ch in string by the new character
99 1.1 cgd */
100 1.5 lukem char *
101 1.11 wiz substitute(char *string, char chold, char chnew)
102 1.1 cgd {
103 1.5 lukem char *cp = string;
104 1.1 cgd
105 1.1 cgd if (cp)
106 1.1 cgd while (*cp){
107 1.1 cgd if (*cp == chold){
108 1.1 cgd *cp = chnew;
109 1.1 cgd break;
110 1.1 cgd }
111 1.1 cgd cp++;
112 1.1 cgd }
113 1.1 cgd return(string);
114 1.1 cgd }
115 1.1 cgd
116 1.5 lukem char
117 1.11 wiz lastchar(char *string)
118 1.1 cgd {
119 1.1 cgd int length;
120 1.8 christos if (string == NULL) return('\0');
121 1.1 cgd length = strlen(string);
122 1.1 cgd if (length >= 1)
123 1.1 cgd return(string[length-1]);
124 1.1 cgd else
125 1.1 cgd return('\0');
126 1.1 cgd }
127 1.1 cgd
128 1.5 lukem char
129 1.11 wiz firstchar(char *string)
130 1.1 cgd {
131 1.1 cgd if (string)
132 1.1 cgd return(string[0]);
133 1.1 cgd else
134 1.1 cgd return('\0');
135 1.1 cgd }
136 1.1 cgd
137 1.5 lukem char
138 1.11 wiz next_lastchar(char *string)
139 1.1 cgd {
140 1.1 cgd int length;
141 1.8 christos if (string == NULL) return('\0');
142 1.1 cgd length = strlen(string);
143 1.1 cgd if (length >= 2)
144 1.1 cgd return(string[length - 2]);
145 1.1 cgd else
146 1.1 cgd return('\0');
147 1.1 cgd }
148 1.1 cgd
149 1.5 lukem void
150 1.11 wiz clob_last(char *string, char newstuff)
151 1.1 cgd {
152 1.1 cgd int length = 0;
153 1.1 cgd if (string)
154 1.1 cgd length = strlen(string);
155 1.1 cgd if (length >= 1)
156 1.1 cgd string[length - 1] = newstuff;
157 1.1 cgd }
158 1.1 cgd
159 1.1 cgd /*
160 1.1 cgd * parse a string that is the result of a format %s(%d)
161 1.1 cgd * return TRUE if this is of the proper format
162 1.1 cgd */
163 1.5 lukem boolean
164 1.11 wiz persperdexplode(char *string, char **r_perd, char **r_pers)
165 1.1 cgd {
166 1.5 lukem char *cp;
167 1.5 lukem int length = 0;
168 1.1 cgd
169 1.1 cgd if (string)
170 1.1 cgd length = strlen(string);
171 1.1 cgd if ( (length >= 4)
172 1.1 cgd && (string[length - 1] == ')' ) ){
173 1.1 cgd for (cp = &string[length - 2];
174 1.6 christos (isdigit((unsigned char)*cp)) && (*cp != '(');
175 1.1 cgd --cp)
176 1.1 cgd continue;
177 1.1 cgd if (*cp == '('){
178 1.1 cgd string[length - 1] = '\0'; /* clobber the ) */
179 1.13 itojun *r_perd = strdup(cp+1);
180 1.1 cgd string[length - 1] = ')';
181 1.1 cgd *cp = '\0'; /* clobber the ( */
182 1.13 itojun *r_pers = strdup(string);
183 1.1 cgd *cp = '(';
184 1.1 cgd return(TRUE);
185 1.1 cgd }
186 1.1 cgd }
187 1.1 cgd return(FALSE);
188 1.1 cgd }
189 1.5 lukem
190 1.1 cgd /*
191 1.1 cgd * parse a quoted string that is the result of a format \"%s\"(%d)
192 1.1 cgd * return TRUE if this is of the proper format
193 1.1 cgd */
194 1.5 lukem boolean
195 1.11 wiz qpersperdexplode(char *string, char **r_perd, char **r_pers)
196 1.1 cgd {
197 1.5 lukem char *cp;
198 1.5 lukem int length = 0;
199 1.1 cgd
200 1.1 cgd if (string)
201 1.1 cgd length = strlen(string);
202 1.1 cgd if ( (length >= 4)
203 1.1 cgd && (string[length - 1] == ')' ) ){
204 1.1 cgd for (cp = &string[length - 2];
205 1.6 christos (isdigit((unsigned char)*cp)) && (*cp != '(');
206 1.1 cgd --cp)
207 1.1 cgd continue;
208 1.1 cgd if (*cp == '(' && *(cp - 1) == '"'){
209 1.1 cgd string[length - 1] = '\0';
210 1.13 itojun *r_perd = strdup(cp+1);
211 1.1 cgd string[length - 1] = ')';
212 1.1 cgd *(cp - 1) = '\0'; /* clobber the " */
213 1.13 itojun *r_pers = strdup(string + 1);
214 1.1 cgd *(cp - 1) = '"';
215 1.1 cgd return(TRUE);
216 1.1 cgd }
217 1.1 cgd }
218 1.1 cgd return(FALSE);
219 1.1 cgd }
220 1.1 cgd
221 1.1 cgd static char cincomment[] = CINCOMMENT;
222 1.1 cgd static char coutcomment[] = COUTCOMMENT;
223 1.1 cgd static char fincomment[] = FINCOMMENT;
224 1.1 cgd static char foutcomment[] = FOUTCOMMENT;
225 1.1 cgd static char newline[] = NEWLINE;
226 1.1 cgd static char piincomment[] = PIINCOMMENT;
227 1.1 cgd static char pioutcomment[] = PIOUTCOMMENT;
228 1.1 cgd static char lispincomment[] = LISPINCOMMENT;
229 1.1 cgd static char riincomment[] = RIINCOMMENT;
230 1.1 cgd static char rioutcomment[] = RIOUTCOMMENT;
231 1.1 cgd static char troffincomment[] = TROFFINCOMMENT;
232 1.1 cgd static char troffoutcomment[] = TROFFOUTCOMMENT;
233 1.1 cgd static char mod2incomment[] = MOD2INCOMMENT;
234 1.1 cgd static char mod2outcomment[] = MOD2OUTCOMMENT;
235 1.1 cgd
236 1.1 cgd struct lang_desc lang_table[] = {
237 1.5 lukem { /*INUNKNOWN 0*/ "unknown", cincomment, coutcomment },
238 1.5 lukem { /*INCPP 1*/ "cpp", cincomment, coutcomment },
239 1.5 lukem { /*INCC 2*/ "cc", cincomment, coutcomment },
240 1.5 lukem { /*INAS 3*/ "as", ASINCOMMENT, newline },
241 1.5 lukem { /*INLD 4*/ "ld", cincomment, coutcomment },
242 1.5 lukem { /*INLINT 5*/ "lint", cincomment, coutcomment },
243 1.5 lukem { /*INF77 6*/ "f77", fincomment, foutcomment },
244 1.5 lukem { /*INPI 7*/ "pi", piincomment, pioutcomment },
245 1.5 lukem { /*INPC 8*/ "pc", piincomment, pioutcomment },
246 1.5 lukem { /*INFRANZ 9*/ "franz",lispincomment, newline },
247 1.5 lukem { /*INLISP 10*/ "lisp", lispincomment, newline },
248 1.5 lukem { /*INVAXIMA 11*/ "vaxima",lispincomment,newline },
249 1.5 lukem { /*INRATFOR 12*/ "ratfor",fincomment, foutcomment },
250 1.5 lukem { /*INLEX 13*/ "lex", cincomment, coutcomment },
251 1.5 lukem { /*INYACC 14*/ "yacc", cincomment, coutcomment },
252 1.5 lukem { /*INAPL 15*/ "apl", ".lm", newline },
253 1.5 lukem { /*INMAKE 16*/ "make", ASINCOMMENT, newline },
254 1.5 lukem { /*INRI 17*/ "ri", riincomment, rioutcomment },
255 1.5 lukem { /*INTROFF 18*/ "troff",troffincomment,troffoutcomment },
256 1.5 lukem { /*INMOD2 19*/ "mod2", mod2incomment, mod2outcomment },
257 1.5 lukem { 0, 0, 0 }
258 1.1 cgd };
259 1.1 cgd
260 1.5 lukem void
261 1.11 wiz printerrors(boolean look_at_subclass, int errorc, Eptr errorv[])
262 1.1 cgd {
263 1.5 lukem int i;
264 1.5 lukem Eptr errorp;
265 1.1 cgd
266 1.1 cgd for (errorp = errorv[i = 0]; i < errorc; errorp = errorv[++i]){
267 1.1 cgd if (errorp->error_e_class == C_IGNORE)
268 1.1 cgd continue;
269 1.1 cgd if (look_at_subclass && errorp->error_s_class == C_DUPL)
270 1.1 cgd continue;
271 1.1 cgd printf("Error %d, (%s error) [%s], text = \"",
272 1.1 cgd i,
273 1.1 cgd class_table[errorp->error_e_class],
274 1.1 cgd lang_table[errorp->error_language].lang_name);
275 1.1 cgd wordvprint(stdout,errorp->error_lgtext,errorp->error_text);
276 1.1 cgd printf("\"\n");
277 1.1 cgd }
278 1.1 cgd }
279 1.1 cgd
280 1.5 lukem void
281 1.11 wiz wordvprint(FILE *fyle, int wordc, char **wordv)
282 1.1 cgd {
283 1.1 cgd int i;
284 1.1 cgd char *sep = "";
285 1.1 cgd
286 1.1 cgd for(i = 0; i < wordc; i++)
287 1.1 cgd if (wordv[i]) {
288 1.1 cgd fprintf(fyle, "%s%s",sep,wordv[i]);
289 1.1 cgd sep = " ";
290 1.1 cgd }
291 1.1 cgd }
292 1.1 cgd
293 1.1 cgd /*
294 1.1 cgd * Given a string, parse it into a number of words, and build
295 1.1 cgd * a wordc wordv combination pointing into it.
296 1.1 cgd */
297 1.5 lukem void
298 1.11 wiz wordvbuild(char *string, int *r_wordc, char ***r_wordv)
299 1.1 cgd {
300 1.5 lukem char *cp;
301 1.5 lukem char **wordv;
302 1.5 lukem int wordcount;
303 1.5 lukem int wordindex;
304 1.1 cgd
305 1.4 christos for (wordcount = 0, cp = string; *cp; wordcount++){
306 1.6 christos while (*cp && isspace((unsigned char)*cp))
307 1.1 cgd cp++;
308 1.8 christos if (*cp == '\0')
309 1.1 cgd break;
310 1.7 sommerfe while (*cp && !isspace((unsigned char)*cp))
311 1.1 cgd cp++;
312 1.1 cgd }
313 1.1 cgd wordv = (char **)Calloc(wordcount + 1, sizeof (char *));
314 1.4 christos for (cp=string,wordindex=0; wordcount; wordindex++,--wordcount){
315 1.6 christos while (*cp && isspace((unsigned char)*cp))
316 1.1 cgd cp++;
317 1.8 christos if (*cp == '\0')
318 1.1 cgd break;
319 1.1 cgd wordv[wordindex] = cp;
320 1.7 sommerfe while(*cp && !isspace((unsigned char)*cp))
321 1.1 cgd cp++;
322 1.1 cgd *cp++ = '\0';
323 1.1 cgd }
324 1.1 cgd if (wordcount != 0)
325 1.5 lukem errx(6, "Initial miscount of the number of words in a line");
326 1.8 christos wordv[wordindex] = NULL;
327 1.1 cgd #ifdef FULLDEBUG
328 1.1 cgd for (wordcount = 0; wordcount < wordindex; wordcount++)
329 1.1 cgd printf("Word %d = \"%s\"\n", wordcount, wordv[wordcount]);
330 1.1 cgd printf("\n");
331 1.1 cgd #endif
332 1.1 cgd *r_wordc = wordindex;
333 1.1 cgd *r_wordv = wordv;
334 1.1 cgd }
335 1.5 lukem
336 1.1 cgd /*
337 1.1 cgd * Compare two 0 based wordvectors
338 1.1 cgd */
339 1.5 lukem int
340 1.11 wiz wordvcmp(char **wordv1, int wordc, char **wordv2)
341 1.1 cgd {
342 1.5 lukem int i;
343 1.5 lukem int back;
344 1.5 lukem
345 1.1 cgd for (i = 0; i < wordc; i++){
346 1.8 christos if (wordv1[i] == NULL || wordv2[i] == NULL)
347 1.5 lukem return(-1);
348 1.10 christos if ((back = strcmp(wordv1[i], wordv2[i])) != 0)
349 1.1 cgd return(back);
350 1.1 cgd }
351 1.1 cgd return(0); /* they are equal */
352 1.1 cgd }
353 1.1 cgd
354 1.1 cgd /*
355 1.1 cgd * splice a 0 basedword vector onto the tail of a
356 1.1 cgd * new wordv, allowing the first emptyhead slots to be empty
357 1.1 cgd */
358 1.5 lukem char **
359 1.11 wiz wordvsplice(int emptyhead, int wordc, char **wordv)
360 1.1 cgd {
361 1.5 lukem char **nwordv;
362 1.5 lukem int nwordc = emptyhead + wordc;
363 1.5 lukem int i;
364 1.1 cgd
365 1.1 cgd nwordv = (char **)Calloc(nwordc, sizeof (char *));
366 1.1 cgd for (i = 0; i < emptyhead; i++)
367 1.8 christos nwordv[i] = NULL;
368 1.1 cgd for(i = emptyhead; i < nwordc; i++){
369 1.1 cgd nwordv[i] = wordv[i-emptyhead];
370 1.1 cgd }
371 1.1 cgd return(nwordv);
372 1.1 cgd }
373 1.5 lukem
374 1.1 cgd /*
375 1.1 cgd * plural'ize and verb forms
376 1.1 cgd */
377 1.1 cgd static char *S = "s";
378 1.1 cgd static char *N = "";
379 1.5 lukem
380 1.5 lukem char *
381 1.11 wiz plural(int n)
382 1.1 cgd {
383 1.1 cgd return( n > 1 ? S : N);
384 1.1 cgd }
385 1.5 lukem
386 1.5 lukem char *
387 1.11 wiz verbform(int n)
388 1.1 cgd {
389 1.1 cgd return( n > 1 ? N : S);
390 1.1 cgd }
391