fsplit.c revision 1.21 1 1.1 cgd /*
2 1.4 perry * Copyright (c) 1983, 1993
3 1.4 perry * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * Asa Romberger and Jerry Berkman.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.10 agc * 3. Neither the name of the University nor the names of its contributors
17 1.1 cgd * may be used to endorse or promote products derived from this software
18 1.1 cgd * without specific prior written permission.
19 1.1 cgd *
20 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 1.1 cgd * SUCH DAMAGE.
31 1.1 cgd */
32 1.1 cgd
33 1.5 lukem #include <sys/cdefs.h>
34 1.1 cgd #ifndef lint
35 1.13 lukem __COPYRIGHT("@(#) Copyright (c) 1983, 1993\
36 1.13 lukem The Regents of the University of California. All rights reserved.");
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.1 cgd #ifndef lint
40 1.5 lukem #if 0
41 1.5 lukem static char sccsid[] = "from: @(#)fsplit.c 8.1 (Berkeley) 6/6/93";
42 1.6 wsanchez #else
43 1.21 dholland __RCSID("$NetBSD: fsplit.c,v 1.21 2008/11/16 04:51:27 dholland Exp $");
44 1.5 lukem #endif
45 1.1 cgd #endif /* not lint */
46 1.1 cgd
47 1.5 lukem #include <sys/types.h>
48 1.5 lukem #include <sys/stat.h>
49 1.5 lukem
50 1.1 cgd #include <ctype.h>
51 1.15 dholland #include <err.h>
52 1.15 dholland #include <stdbool.h>
53 1.1 cgd #include <stdio.h>
54 1.8 matt #include <stdlib.h>
55 1.3 cgd #include <string.h>
56 1.5 lukem #include <unistd.h>
57 1.1 cgd
58 1.1 cgd /*
59 1.1 cgd * usage: fsplit [-e efile] ... [file]
60 1.1 cgd *
61 1.1 cgd * split single file containing source for several fortran programs
62 1.1 cgd * and/or subprograms into files each containing one
63 1.1 cgd * subprogram unit.
64 1.1 cgd * each separate file will be named using the corresponding subroutine,
65 1.1 cgd * function, block data or program name if one is found; otherwise
66 1.1 cgd * the name will be of the form mainNNN.f or blkdtaNNN.f .
67 1.1 cgd * If a file of that name exists, it is saved in a name of the
68 1.1 cgd * form zzz000.f .
69 1.1 cgd * If -e option is used, then only those subprograms named in the -e
70 1.1 cgd * option are split off; e.g.:
71 1.1 cgd * fsplit -esub1 -e sub2 prog.f
72 1.17 dholland * isolates sub1 and sub2 in sub1.f and sub2.f. The space
73 1.1 cgd * after -e is optional.
74 1.1 cgd *
75 1.1 cgd * Modified Feb., 1983 by Jerry Berkman, Computing Services, U.C. Berkeley.
76 1.1 cgd * - added comments
77 1.1 cgd * - more function types: double complex, character*(*), etc.
78 1.1 cgd * - fixed minor bugs
79 1.1 cgd * - instead of all unnamed going into zNNN.f, put mains in
80 1.1 cgd * mainNNN.f, block datas in blkdtaNNN.f, dups in zzzNNN.f .
81 1.1 cgd */
82 1.1 cgd
83 1.1 cgd #define BSZ 512
84 1.16 dholland static char buf[BSZ];
85 1.16 dholland static FILE *ifp;
86 1.16 dholland
87 1.17 dholland static char x[] = "zzz000.f";
88 1.17 dholland static char mainp[] = "main000.f";
89 1.17 dholland static char blkp[] = "blkdta000.f";
90 1.16 dholland
91 1.16 dholland static void badparms(void);
92 1.16 dholland static const char *functs(const char *);
93 1.16 dholland static int getline(void);
94 1.16 dholland static void get_name(char *, int);
95 1.16 dholland static int lend(void);
96 1.16 dholland static int lname(char *, size_t);
97 1.16 dholland static const char *look(const char *, const char *);
98 1.16 dholland static int saveit(const char *);
99 1.16 dholland static int scan_name(char *, const char *);
100 1.16 dholland static const char *skiplab(const char *);
101 1.19 dholland static const char *skipws(const char *);
102 1.16 dholland
103 1.21 dholland struct extract {
104 1.21 dholland bool found;
105 1.21 dholland char *name;
106 1.21 dholland };
107 1.21 dholland
108 1.20 dholland static int numextonly = 0;
109 1.21 dholland static struct extract extonly[100];
110 1.16 dholland static char extrbuf[1000];
111 1.1 cgd
112 1.5 lukem int
113 1.14 dholland main(int argc, char **argv)
114 1.1 cgd {
115 1.5 lukem FILE *ofp; /* output file */
116 1.5 lukem int rv; /* 1 if got card in output file, 0 otherwise */
117 1.5 lukem char *ptr;
118 1.5 lukem int nflag; /* 1 if got name of subprog., 0 otherwise */
119 1.5 lukem int retval, i;
120 1.5 lukem char name[20], *extrptr = extrbuf;
121 1.1 cgd
122 1.1 cgd /* scan -e options */
123 1.17 dholland while (argc > 1 && argv[1][0] == '-' && argv[1][1] == 'e') {
124 1.1 cgd ptr = argv[1] + 2;
125 1.17 dholland if (!*ptr) {
126 1.1 cgd argc--;
127 1.1 cgd argv++;
128 1.17 dholland if (argc <= 1) {
129 1.17 dholland badparms();
130 1.17 dholland }
131 1.1 cgd ptr = argv[1];
132 1.1 cgd }
133 1.21 dholland extonly[numextonly].name = extrptr;
134 1.21 dholland extonly[numextonly].found = false;
135 1.20 dholland numextonly++;
136 1.17 dholland while (*ptr) {
137 1.17 dholland *extrptr++ = *ptr++;
138 1.17 dholland }
139 1.16 dholland *extrptr++ = '\0';
140 1.1 cgd argc--;
141 1.1 cgd argv++;
142 1.1 cgd }
143 1.1 cgd
144 1.17 dholland if (argc > 2) {
145 1.1 cgd badparms();
146 1.17 dholland } else if (argc == 2) {
147 1.1 cgd if ((ifp = fopen(argv[1], "r")) == NULL) {
148 1.15 dholland err(1, "%s", argv[1]);
149 1.1 cgd }
150 1.17 dholland } else {
151 1.1 cgd ifp = stdin;
152 1.1 cgd }
153 1.17 dholland
154 1.17 dholland for (;;) {
155 1.17 dholland /*
156 1.17 dholland * Look for a temp file that doesn't correspond to an
157 1.17 dholland * existing file.
158 1.17 dholland */
159 1.17 dholland
160 1.17 dholland get_name(x, 3);
161 1.17 dholland ofp = fopen(x, "w");
162 1.17 dholland if (ofp == NULL) {
163 1.17 dholland err(1, "%s", x);
164 1.17 dholland }
165 1.17 dholland nflag = 0;
166 1.17 dholland rv = 0;
167 1.17 dholland while (getline() > 0) {
168 1.17 dholland rv = 1;
169 1.17 dholland fprintf(ofp, "%s", buf);
170 1.17 dholland /* look for an 'end' statement */
171 1.17 dholland if (lend()) {
172 1.17 dholland break;
173 1.1 cgd }
174 1.17 dholland /* if no name yet, try and find one */
175 1.17 dholland if (nflag == 0) {
176 1.17 dholland nflag = lname(name, sizeof(name));
177 1.17 dholland }
178 1.17 dholland }
179 1.17 dholland fclose(ofp);
180 1.17 dholland if (rv == 0) {
181 1.17 dholland /* no lines in file, forget the file */
182 1.17 dholland unlink(x);
183 1.17 dholland retval = 0;
184 1.20 dholland for (i = 0; i < numextonly; i++) {
185 1.21 dholland if (!extonly[i].found) {
186 1.17 dholland retval = 1;
187 1.21 dholland warnx("%s not found", extonly[i].name);
188 1.17 dholland }
189 1.17 dholland }
190 1.17 dholland exit(retval);
191 1.17 dholland }
192 1.17 dholland if (nflag) {
193 1.17 dholland /* rename the file */
194 1.17 dholland if (saveit(name)) {
195 1.18 dholland struct stat sbuf;
196 1.18 dholland
197 1.17 dholland if (stat(name, &sbuf) < 0) {
198 1.17 dholland link(x, name);
199 1.17 dholland unlink(x);
200 1.17 dholland printf("%s\n", name);
201 1.17 dholland continue;
202 1.17 dholland } else if (strcmp(name, x) == 0) {
203 1.17 dholland printf("%s\n", x);
204 1.17 dholland continue;
205 1.17 dholland }
206 1.17 dholland printf("%s already exists, put in %s\n",
207 1.17 dholland name, x);
208 1.17 dholland continue;
209 1.17 dholland } else {
210 1.1 cgd unlink(x);
211 1.1 cgd continue;
212 1.1 cgd }
213 1.17 dholland }
214 1.20 dholland if (numextonly == 0) {
215 1.17 dholland printf("%s\n", x);
216 1.17 dholland } else {
217 1.1 cgd unlink(x);
218 1.17 dholland }
219 1.1 cgd }
220 1.1 cgd }
221 1.1 cgd
222 1.16 dholland static void
223 1.14 dholland badparms(void)
224 1.1 cgd {
225 1.15 dholland err(1, "Usage: fsplit [-e efile] ... [file]");
226 1.1 cgd }
227 1.1 cgd
228 1.16 dholland static int
229 1.16 dholland saveit(const char *name)
230 1.1 cgd {
231 1.1 cgd int i;
232 1.17 dholland char fname[50];
233 1.17 dholland char *fptr = fname;
234 1.1 cgd
235 1.20 dholland if (numextonly == 0) {
236 1.17 dholland return 1;
237 1.17 dholland }
238 1.17 dholland while (*name) {
239 1.17 dholland *fptr++ = *name++;
240 1.17 dholland }
241 1.16 dholland *--fptr = '\0';
242 1.16 dholland *--fptr = '\0';
243 1.20 dholland for (i = 0; i < numextonly; i++) {
244 1.21 dholland if (strcmp(fname, extonly[i].name) == 0) {
245 1.21 dholland extonly[i].found = true;
246 1.17 dholland return 1;
247 1.1 cgd }
248 1.17 dholland }
249 1.17 dholland return 0;
250 1.1 cgd }
251 1.1 cgd
252 1.16 dholland static void
253 1.14 dholland get_name(char *name, int letters)
254 1.1 cgd {
255 1.18 dholland struct stat sbuf;
256 1.5 lukem char *ptr;
257 1.1 cgd
258 1.1 cgd while (stat(name, &sbuf) >= 0) {
259 1.1 cgd for (ptr = name + letters + 2; ptr >= name + letters; ptr--) {
260 1.1 cgd (*ptr)++;
261 1.1 cgd if (*ptr <= '9')
262 1.1 cgd break;
263 1.1 cgd *ptr = '0';
264 1.1 cgd }
265 1.17 dholland if (ptr < name + letters) {
266 1.15 dholland errx(1, "Ran out of file names.\n");
267 1.1 cgd }
268 1.1 cgd }
269 1.1 cgd }
270 1.1 cgd
271 1.16 dholland static int
272 1.14 dholland getline(void)
273 1.1 cgd {
274 1.5 lukem char *ptr;
275 1.1 cgd
276 1.1 cgd for (ptr = buf; ptr < &buf[BSZ]; ) {
277 1.1 cgd *ptr = getc(ifp);
278 1.1 cgd if (feof(ifp))
279 1.17 dholland return -1;
280 1.1 cgd if (*ptr++ == '\n') {
281 1.16 dholland *ptr = '\0';
282 1.17 dholland return 1;
283 1.1 cgd }
284 1.1 cgd }
285 1.17 dholland while (getc(ifp) != '\n' && feof(ifp) == 0) {
286 1.17 dholland /* nothing */
287 1.17 dholland }
288 1.15 dholland warnx("Line truncated to %d characters.", BSZ);
289 1.17 dholland return 1;
290 1.1 cgd }
291 1.1 cgd
292 1.17 dholland /*
293 1.17 dholland * Return 1 for 'end' alone on card (up to col. 72), 0 otherwise.
294 1.17 dholland */
295 1.16 dholland static int
296 1.14 dholland lend(void)
297 1.1 cgd {
298 1.16 dholland const char *p;
299 1.1 cgd
300 1.17 dholland if ((p = skiplab(buf)) == 0) {
301 1.17 dholland return 0;
302 1.17 dholland }
303 1.19 dholland p = skipws(p);
304 1.17 dholland if (*p != 'e' && *p != 'E') {
305 1.17 dholland return 0;
306 1.17 dholland }
307 1.1 cgd p++;
308 1.19 dholland p = skipws(p);
309 1.17 dholland if (*p != 'n' && *p != 'N') {
310 1.17 dholland return 0;
311 1.17 dholland }
312 1.1 cgd p++;
313 1.19 dholland p = skipws(p);
314 1.17 dholland if (*p != 'd' && *p != 'D') {
315 1.17 dholland return 0;
316 1.17 dholland }
317 1.1 cgd p++;
318 1.19 dholland p = skipws(p);
319 1.17 dholland if (p - buf >= 72 || *p == '\n') {
320 1.17 dholland return 1;
321 1.17 dholland }
322 1.17 dholland return 0;
323 1.1 cgd }
324 1.1 cgd
325 1.17 dholland /*
326 1.17 dholland * check for keywords for subprograms
327 1.17 dholland * return 0 if comment card, 1 if found
328 1.17 dholland * name and put in arg string. invent name for unnamed
329 1.17 dholland * block datas and main programs.
330 1.17 dholland */
331 1.16 dholland static int
332 1.14 dholland lname(char *s, size_t l)
333 1.1 cgd {
334 1.17 dholland #define LINESIZE 80
335 1.16 dholland const char *ptr, *p;
336 1.17 dholland char line[LINESIZE], *iptr = line;
337 1.1 cgd
338 1.1 cgd /* first check for comment cards */
339 1.17 dholland if (buf[0] == 'c' || buf[0] == 'C' || buf[0] == '*') {
340 1.17 dholland return 0;
341 1.17 dholland }
342 1.1 cgd ptr = buf;
343 1.17 dholland while (*ptr == ' ' || *ptr == '\t') {
344 1.17 dholland ptr++;
345 1.17 dholland }
346 1.17 dholland if (*ptr == '\n') {
347 1.17 dholland return 0;
348 1.17 dholland }
349 1.1 cgd
350 1.1 cgd ptr = skiplab(buf);
351 1.17 dholland if (ptr == NULL) {
352 1.17 dholland return 0;
353 1.17 dholland }
354 1.1 cgd
355 1.1 cgd /* copy to buffer and converting to lower case */
356 1.1 cgd p = ptr;
357 1.1 cgd while (*p && p <= &buf[71] ) {
358 1.11 dsl *iptr = tolower((unsigned char)*p);
359 1.1 cgd iptr++;
360 1.1 cgd p++;
361 1.1 cgd }
362 1.1 cgd *iptr = '\n';
363 1.1 cgd
364 1.16 dholland if ((ptr = look(line, "subroutine")) != NULL ||
365 1.16 dholland (ptr = look(line, "function")) != NULL ||
366 1.16 dholland (ptr = functs(line)) != NULL) {
367 1.17 dholland if (scan_name(s, ptr)) {
368 1.17 dholland return 1;
369 1.17 dholland }
370 1.9 itojun strlcpy(s, x, l);
371 1.17 dholland } else if ((ptr = look(line, "program")) != NULL) {
372 1.17 dholland if (scan_name(s, ptr)) {
373 1.17 dholland return 1;
374 1.17 dholland }
375 1.9 itojun get_name(mainp, 4);
376 1.9 itojun strlcpy(s, mainp, l);
377 1.17 dholland } else if ((ptr = look(line, "blockdata")) != NULL) {
378 1.17 dholland if (scan_name(s, ptr)) {
379 1.17 dholland return 1;
380 1.17 dholland }
381 1.17 dholland get_name(blkp, 6);
382 1.9 itojun strlcpy(s, blkp, l);
383 1.17 dholland } else if ((ptr = functs(line)) != NULL) {
384 1.17 dholland if (scan_name(s, ptr)) {
385 1.17 dholland return 1;
386 1.17 dholland }
387 1.9 itojun strlcpy(s, x, l);
388 1.1 cgd } else {
389 1.9 itojun get_name(mainp, 4);
390 1.9 itojun strlcpy(s, mainp, l);
391 1.1 cgd }
392 1.17 dholland return 1;
393 1.1 cgd }
394 1.1 cgd
395 1.16 dholland static int
396 1.16 dholland scan_name(char *s, const char *ptr)
397 1.1 cgd {
398 1.1 cgd char *sptr;
399 1.1 cgd
400 1.1 cgd /* scan off the name */
401 1.19 dholland ptr = skipws(ptr);
402 1.1 cgd sptr = s;
403 1.1 cgd while (*ptr != '(' && *ptr != '\n') {
404 1.1 cgd if (*ptr != ' ' && *ptr != '\t')
405 1.1 cgd *sptr++ = *ptr;
406 1.1 cgd ptr++;
407 1.1 cgd }
408 1.1 cgd
409 1.17 dholland if (sptr == s) {
410 1.17 dholland return 0;
411 1.17 dholland }
412 1.1 cgd
413 1.1 cgd *sptr++ = '.';
414 1.1 cgd *sptr++ = 'f';
415 1.16 dholland *sptr++ = '\0';
416 1.17 dholland return 1;
417 1.1 cgd }
418 1.1 cgd
419 1.17 dholland /*
420 1.17 dholland * look for typed functions such as: real*8 function,
421 1.17 dholland * character*16 function, character*(*) function
422 1.17 dholland */
423 1.16 dholland static const char *
424 1.16 dholland functs(const char *p)
425 1.1 cgd {
426 1.16 dholland const char *ptr;
427 1.1 cgd
428 1.17 dholland if ((ptr = look(p, "character")) != NULL ||
429 1.17 dholland (ptr = look(p, "logical")) != NULL ||
430 1.17 dholland (ptr = look(p, "real")) != NULL ||
431 1.17 dholland (ptr = look(p, "integer")) != NULL ||
432 1.17 dholland (ptr = look(p, "doubleprecision")) != NULL ||
433 1.17 dholland (ptr = look(p, "complex")) != NULL ||
434 1.17 dholland (ptr = look(p, "doublecomplex")) != NULL) {
435 1.17 dholland while (*ptr == ' ' || *ptr == '\t' || *ptr == '*'
436 1.17 dholland || (*ptr >= '0' && *ptr <= '9')
437 1.17 dholland || *ptr == '(' || *ptr == ')') {
438 1.17 dholland ptr++;
439 1.17 dholland }
440 1.17 dholland ptr = look(ptr, "function");
441 1.17 dholland return ptr;
442 1.1 cgd }
443 1.17 dholland else {
444 1.16 dholland return NULL;
445 1.17 dholland }
446 1.1 cgd }
447 1.1 cgd
448 1.17 dholland /*
449 1.17 dholland * if first 6 col. blank, return ptr to col. 7,
450 1.17 dholland * if blanks and then tab, return ptr after tab,
451 1.17 dholland * else return NULL (labelled statement, comment or continuation)
452 1.17 dholland */
453 1.16 dholland static const char *
454 1.16 dholland skiplab(const char *p)
455 1.1 cgd {
456 1.16 dholland const char *ptr;
457 1.1 cgd
458 1.1 cgd for (ptr = p; ptr < &p[6]; ptr++) {
459 1.1 cgd if (*ptr == ' ')
460 1.1 cgd continue;
461 1.1 cgd if (*ptr == '\t') {
462 1.1 cgd ptr++;
463 1.1 cgd break;
464 1.1 cgd }
465 1.16 dholland return NULL;
466 1.1 cgd }
467 1.17 dholland return ptr;
468 1.1 cgd }
469 1.1 cgd
470 1.17 dholland /*
471 1.17 dholland * return NULL if m doesn't match initial part of s;
472 1.17 dholland * otherwise return ptr to next char after m in s
473 1.17 dholland */
474 1.16 dholland static const char *
475 1.16 dholland look(const char *s, const char *m)
476 1.1 cgd {
477 1.16 dholland const char *sp, *mp;
478 1.1 cgd
479 1.1 cgd sp = s; mp = m;
480 1.1 cgd while (*mp) {
481 1.19 dholland sp = skipws(sp);
482 1.1 cgd if (*sp++ != *mp++)
483 1.16 dholland return NULL;
484 1.1 cgd }
485 1.17 dholland return sp;
486 1.1 cgd }
487 1.19 dholland
488 1.19 dholland static const char *
489 1.19 dholland skipws(const char *p)
490 1.19 dholland {
491 1.19 dholland while (*p == ' ' || *p == '\t') {
492 1.19 dholland p++;
493 1.19 dholland }
494 1.19 dholland return p;
495 1.19 dholland }
496