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