fsplit.c revision 1.10 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.5 lukem __COPYRIGHT("@(#) Copyright (c) 1983, 1993\n\
36 1.5 lukem The Regents of the University of California. All rights reserved.\n");
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.10 agc __RCSID("$NetBSD: fsplit.c,v 1.10 2003/08/07 11:13:50 agc 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.1 cgd #include <stdio.h>
52 1.8 matt #include <stdlib.h>
53 1.3 cgd #include <string.h>
54 1.5 lukem #include <unistd.h>
55 1.1 cgd
56 1.1 cgd /*
57 1.1 cgd * usage: fsplit [-e efile] ... [file]
58 1.1 cgd *
59 1.1 cgd * split single file containing source for several fortran programs
60 1.1 cgd * and/or subprograms into files each containing one
61 1.1 cgd * subprogram unit.
62 1.1 cgd * each separate file will be named using the corresponding subroutine,
63 1.1 cgd * function, block data or program name if one is found; otherwise
64 1.1 cgd * the name will be of the form mainNNN.f or blkdtaNNN.f .
65 1.1 cgd * If a file of that name exists, it is saved in a name of the
66 1.1 cgd * form zzz000.f .
67 1.1 cgd * If -e option is used, then only those subprograms named in the -e
68 1.1 cgd * option are split off; e.g.:
69 1.1 cgd * fsplit -esub1 -e sub2 prog.f
70 1.1 cgd * isolates sub1 and sub2 in sub1.f and sub2.f. The space
71 1.1 cgd * after -e is optional.
72 1.1 cgd *
73 1.1 cgd * Modified Feb., 1983 by Jerry Berkman, Computing Services, U.C. Berkeley.
74 1.1 cgd * - added comments
75 1.1 cgd * - more function types: double complex, character*(*), etc.
76 1.1 cgd * - fixed minor bugs
77 1.1 cgd * - instead of all unnamed going into zNNN.f, put mains in
78 1.1 cgd * mainNNN.f, block datas in blkdtaNNN.f, dups in zzzNNN.f .
79 1.1 cgd */
80 1.1 cgd
81 1.1 cgd #define BSZ 512
82 1.1 cgd char buf[BSZ];
83 1.1 cgd FILE *ifp;
84 1.1 cgd char x[]="zzz000.f",
85 1.1 cgd mainp[]="main000.f",
86 1.1 cgd blkp[]="blkdta000.f";
87 1.5 lukem
88 1.5 lukem void badparms __P((void));
89 1.5 lukem char *functs __P((char *));
90 1.5 lukem int getline __P((void));
91 1.5 lukem void get_name __P((char *, int));
92 1.5 lukem int main __P((int, char **));
93 1.5 lukem int lend __P((void));
94 1.9 itojun int lname __P((char *, size_t));
95 1.5 lukem char *look __P((char *, char *));
96 1.5 lukem int saveit __P((char *));
97 1.5 lukem int scan_name __P((char *, char *));
98 1.5 lukem char *skiplab __P((char *));
99 1.1 cgd
100 1.1 cgd #define TRUE 1
101 1.1 cgd #define FALSE 0
102 1.1 cgd int extr = FALSE,
103 1.1 cgd extrknt = -1,
104 1.1 cgd extrfnd[100];
105 1.1 cgd char extrbuf[1000],
106 1.1 cgd *extrnames[100];
107 1.1 cgd struct stat sbuf;
108 1.1 cgd
109 1.1 cgd #define trim(p) while (*p == ' ' || *p == '\t') p++
110 1.1 cgd
111 1.5 lukem int
112 1.1 cgd main(argc, argv)
113 1.5 lukem int argc;
114 1.5 lukem char **argv;
115 1.1 cgd {
116 1.5 lukem FILE *ofp; /* output file */
117 1.5 lukem int rv; /* 1 if got card in output file, 0 otherwise */
118 1.5 lukem char *ptr;
119 1.5 lukem int nflag; /* 1 if got name of subprog., 0 otherwise */
120 1.5 lukem int retval, i;
121 1.5 lukem char name[20], *extrptr = extrbuf;
122 1.1 cgd
123 1.1 cgd /* scan -e options */
124 1.1 cgd while ( argc > 1 && argv[1][0] == '-' && argv[1][1] == 'e') {
125 1.1 cgd extr = TRUE;
126 1.1 cgd ptr = argv[1] + 2;
127 1.1 cgd if(!*ptr) {
128 1.1 cgd argc--;
129 1.1 cgd argv++;
130 1.1 cgd if(argc <= 1) badparms();
131 1.1 cgd ptr = argv[1];
132 1.1 cgd }
133 1.1 cgd extrknt = extrknt + 1;
134 1.1 cgd extrnames[extrknt] = extrptr;
135 1.1 cgd extrfnd[extrknt] = FALSE;
136 1.1 cgd while(*ptr) *extrptr++ = *ptr++;
137 1.1 cgd *extrptr++ = 0;
138 1.1 cgd argc--;
139 1.1 cgd argv++;
140 1.1 cgd }
141 1.1 cgd
142 1.1 cgd if (argc > 2)
143 1.1 cgd badparms();
144 1.1 cgd else if (argc == 2) {
145 1.1 cgd if ((ifp = fopen(argv[1], "r")) == NULL) {
146 1.1 cgd fprintf(stderr, "fsplit: cannot open %s\n", argv[1]);
147 1.1 cgd exit(1);
148 1.1 cgd }
149 1.1 cgd }
150 1.1 cgd else
151 1.1 cgd ifp = stdin;
152 1.1 cgd for(;;) {
153 1.1 cgd /* look for a temp file that doesn't correspond to an existing file */
154 1.1 cgd get_name(x, 3);
155 1.1 cgd ofp = fopen(x, "w");
156 1.1 cgd nflag = 0;
157 1.1 cgd rv = 0;
158 1.1 cgd while (getline() > 0) {
159 1.1 cgd rv = 1;
160 1.1 cgd fprintf(ofp, "%s", buf);
161 1.1 cgd if (lend()) /* look for an 'end' statement */
162 1.1 cgd break;
163 1.1 cgd if (nflag == 0) /* if no name yet, try and find one */
164 1.9 itojun nflag = lname(name, sizeof(name));
165 1.1 cgd }
166 1.1 cgd fclose(ofp);
167 1.1 cgd if (rv == 0) { /* no lines in file, forget the file */
168 1.1 cgd unlink(x);
169 1.1 cgd retval = 0;
170 1.1 cgd for ( i = 0; i <= extrknt; i++ )
171 1.1 cgd if(!extrfnd[i]) {
172 1.1 cgd retval = 1;
173 1.1 cgd fprintf( stderr, "fsplit: %s not found\n",
174 1.1 cgd extrnames[i]);
175 1.1 cgd }
176 1.1 cgd exit( retval );
177 1.1 cgd }
178 1.1 cgd if (nflag) { /* rename the file */
179 1.1 cgd if(saveit(name)) {
180 1.1 cgd if (stat(name, &sbuf) < 0 ) {
181 1.1 cgd link(x, name);
182 1.1 cgd unlink(x);
183 1.1 cgd printf("%s\n", name);
184 1.1 cgd continue;
185 1.1 cgd } else if (strcmp(name, x) == 0) {
186 1.1 cgd printf("%s\n", x);
187 1.1 cgd continue;
188 1.1 cgd }
189 1.1 cgd printf("%s already exists, put in %s\n", name, x);
190 1.1 cgd continue;
191 1.1 cgd } else
192 1.1 cgd unlink(x);
193 1.1 cgd continue;
194 1.1 cgd }
195 1.1 cgd if(!extr)
196 1.1 cgd printf("%s\n", x);
197 1.1 cgd else
198 1.1 cgd unlink(x);
199 1.1 cgd }
200 1.1 cgd }
201 1.1 cgd
202 1.5 lukem void
203 1.1 cgd badparms()
204 1.1 cgd {
205 1.1 cgd fprintf(stderr, "fsplit: usage: fsplit [-e efile] ... [file] \n");
206 1.1 cgd exit(1);
207 1.1 cgd }
208 1.1 cgd
209 1.5 lukem int
210 1.1 cgd saveit(name)
211 1.5 lukem char *name;
212 1.1 cgd {
213 1.1 cgd int i;
214 1.1 cgd char fname[50],
215 1.1 cgd *fptr = fname;
216 1.1 cgd
217 1.1 cgd if(!extr) return(1);
218 1.1 cgd while(*name) *fptr++ = *name++;
219 1.1 cgd *--fptr = 0;
220 1.1 cgd *--fptr = 0;
221 1.1 cgd for ( i=0 ; i<=extrknt; i++ )
222 1.1 cgd if( strcmp(fname, extrnames[i]) == 0 ) {
223 1.1 cgd extrfnd[i] = TRUE;
224 1.1 cgd return(1);
225 1.1 cgd }
226 1.1 cgd return(0);
227 1.1 cgd }
228 1.1 cgd
229 1.5 lukem void
230 1.1 cgd get_name(name, letters)
231 1.5 lukem char *name;
232 1.5 lukem int letters;
233 1.1 cgd {
234 1.5 lukem char *ptr;
235 1.1 cgd
236 1.1 cgd while (stat(name, &sbuf) >= 0) {
237 1.1 cgd for (ptr = name + letters + 2; ptr >= name + letters; ptr--) {
238 1.1 cgd (*ptr)++;
239 1.1 cgd if (*ptr <= '9')
240 1.1 cgd break;
241 1.1 cgd *ptr = '0';
242 1.1 cgd }
243 1.1 cgd if(ptr < name + letters) {
244 1.1 cgd fprintf( stderr, "fsplit: ran out of file names\n");
245 1.1 cgd exit(1);
246 1.1 cgd }
247 1.1 cgd }
248 1.1 cgd }
249 1.1 cgd
250 1.5 lukem int
251 1.1 cgd getline()
252 1.1 cgd {
253 1.5 lukem char *ptr;
254 1.1 cgd
255 1.1 cgd for (ptr = buf; ptr < &buf[BSZ]; ) {
256 1.1 cgd *ptr = getc(ifp);
257 1.1 cgd if (feof(ifp))
258 1.1 cgd return (-1);
259 1.1 cgd if (*ptr++ == '\n') {
260 1.1 cgd *ptr = 0;
261 1.1 cgd return (1);
262 1.1 cgd }
263 1.1 cgd }
264 1.1 cgd while (getc(ifp) != '\n' && feof(ifp) == 0) ;
265 1.1 cgd fprintf(stderr, "line truncated to %d characters\n", BSZ);
266 1.1 cgd return (1);
267 1.1 cgd }
268 1.1 cgd
269 1.1 cgd /* return 1 for 'end' alone on card (up to col. 72), 0 otherwise */
270 1.5 lukem int
271 1.1 cgd lend()
272 1.1 cgd {
273 1.5 lukem char *p;
274 1.1 cgd
275 1.1 cgd if ((p = skiplab(buf)) == 0)
276 1.1 cgd return (0);
277 1.1 cgd trim(p);
278 1.1 cgd if (*p != 'e' && *p != 'E') return(0);
279 1.1 cgd p++;
280 1.1 cgd trim(p);
281 1.1 cgd if (*p != 'n' && *p != 'N') return(0);
282 1.1 cgd p++;
283 1.1 cgd trim(p);
284 1.1 cgd if (*p != 'd' && *p != 'D') return(0);
285 1.1 cgd p++;
286 1.1 cgd trim(p);
287 1.1 cgd if (p - buf >= 72 || *p == '\n')
288 1.1 cgd return (1);
289 1.1 cgd return (0);
290 1.1 cgd }
291 1.1 cgd
292 1.1 cgd /* check for keywords for subprograms
293 1.1 cgd return 0 if comment card, 1 if found
294 1.1 cgd name and put in arg string. invent name for unnamed
295 1.1 cgd block datas and main programs. */
296 1.5 lukem
297 1.5 lukem int
298 1.9 itojun lname(s, l)
299 1.5 lukem char *s;
300 1.9 itojun size_t l;
301 1.1 cgd {
302 1.1 cgd # define LINESIZE 80
303 1.5 lukem char *ptr, *p;
304 1.1 cgd char line[LINESIZE], *iptr = line;
305 1.1 cgd
306 1.1 cgd /* first check for comment cards */
307 1.1 cgd if(buf[0] == 'c' || buf[0] == 'C' || buf[0] == '*') return(0);
308 1.1 cgd ptr = buf;
309 1.1 cgd while (*ptr == ' ' || *ptr == '\t') ptr++;
310 1.1 cgd if(*ptr == '\n') return(0);
311 1.1 cgd
312 1.1 cgd
313 1.1 cgd ptr = skiplab(buf);
314 1.1 cgd if (ptr == 0)
315 1.1 cgd return (0);
316 1.1 cgd
317 1.1 cgd
318 1.1 cgd /* copy to buffer and converting to lower case */
319 1.1 cgd p = ptr;
320 1.1 cgd while (*p && p <= &buf[71] ) {
321 1.7 christos *iptr = isupper((unsigned char)*p) ? tolower(*p) : *p;
322 1.1 cgd iptr++;
323 1.1 cgd p++;
324 1.1 cgd }
325 1.1 cgd *iptr = '\n';
326 1.1 cgd
327 1.1 cgd if ((ptr = look(line, "subroutine")) != 0 ||
328 1.1 cgd (ptr = look(line, "function")) != 0 ||
329 1.1 cgd (ptr = functs(line)) != 0) {
330 1.1 cgd if(scan_name(s, ptr)) return(1);
331 1.9 itojun strlcpy(s, x, l);
332 1.1 cgd } else if((ptr = look(line, "program")) != 0) {
333 1.1 cgd if(scan_name(s, ptr)) return(1);
334 1.9 itojun get_name(mainp, 4);
335 1.9 itojun strlcpy(s, mainp, l);
336 1.1 cgd } else if((ptr = look(line, "blockdata")) != 0) {
337 1.1 cgd if(scan_name(s, ptr)) return(1);
338 1.1 cgd get_name( blkp, 6);
339 1.9 itojun strlcpy(s, blkp, l);
340 1.1 cgd } else if((ptr = functs(line)) != 0) {
341 1.1 cgd if(scan_name(s, ptr)) return(1);
342 1.9 itojun strlcpy(s, x, l);
343 1.1 cgd } else {
344 1.9 itojun get_name(mainp, 4);
345 1.9 itojun strlcpy(s, mainp, l);
346 1.1 cgd }
347 1.1 cgd return(1);
348 1.1 cgd }
349 1.1 cgd
350 1.5 lukem int
351 1.1 cgd scan_name(s, ptr)
352 1.5 lukem char *s, *ptr;
353 1.1 cgd {
354 1.1 cgd char *sptr;
355 1.1 cgd
356 1.1 cgd /* scan off the name */
357 1.1 cgd trim(ptr);
358 1.1 cgd sptr = s;
359 1.1 cgd while (*ptr != '(' && *ptr != '\n') {
360 1.1 cgd if (*ptr != ' ' && *ptr != '\t')
361 1.1 cgd *sptr++ = *ptr;
362 1.1 cgd ptr++;
363 1.1 cgd }
364 1.1 cgd
365 1.1 cgd if (sptr == s) return(0);
366 1.1 cgd
367 1.1 cgd *sptr++ = '.';
368 1.1 cgd *sptr++ = 'f';
369 1.1 cgd *sptr++ = 0;
370 1.1 cgd return(1);
371 1.1 cgd }
372 1.1 cgd
373 1.5 lukem char *
374 1.5 lukem functs(p)
375 1.5 lukem char *p;
376 1.1 cgd {
377 1.5 lukem char *ptr;
378 1.1 cgd
379 1.1 cgd /* look for typed functions such as: real*8 function,
380 1.1 cgd character*16 function, character*(*) function */
381 1.1 cgd
382 1.1 cgd if((ptr = look(p,"character")) != 0 ||
383 1.1 cgd (ptr = look(p,"logical")) != 0 ||
384 1.1 cgd (ptr = look(p,"real")) != 0 ||
385 1.1 cgd (ptr = look(p,"integer")) != 0 ||
386 1.1 cgd (ptr = look(p,"doubleprecision")) != 0 ||
387 1.1 cgd (ptr = look(p,"complex")) != 0 ||
388 1.1 cgd (ptr = look(p,"doublecomplex")) != 0 ) {
389 1.1 cgd while ( *ptr == ' ' || *ptr == '\t' || *ptr == '*'
390 1.1 cgd || (*ptr >= '0' && *ptr <= '9')
391 1.1 cgd || *ptr == '(' || *ptr == ')') ptr++;
392 1.1 cgd ptr = look(ptr,"function");
393 1.1 cgd return(ptr);
394 1.1 cgd }
395 1.1 cgd else
396 1.1 cgd return(0);
397 1.1 cgd }
398 1.1 cgd
399 1.1 cgd /* if first 6 col. blank, return ptr to col. 7,
400 1.1 cgd if blanks and then tab, return ptr after tab,
401 1.1 cgd else return 0 (labelled statement, comment or continuation */
402 1.5 lukem
403 1.5 lukem char *
404 1.5 lukem skiplab(p)
405 1.5 lukem char *p;
406 1.1 cgd {
407 1.5 lukem char *ptr;
408 1.1 cgd
409 1.1 cgd for (ptr = p; ptr < &p[6]; ptr++) {
410 1.1 cgd if (*ptr == ' ')
411 1.1 cgd continue;
412 1.1 cgd if (*ptr == '\t') {
413 1.1 cgd ptr++;
414 1.1 cgd break;
415 1.1 cgd }
416 1.1 cgd return (0);
417 1.1 cgd }
418 1.1 cgd return (ptr);
419 1.1 cgd }
420 1.1 cgd
421 1.1 cgd /* return 0 if m doesn't match initial part of s;
422 1.1 cgd otherwise return ptr to next char after m in s */
423 1.5 lukem
424 1.5 lukem char *
425 1.5 lukem look(s, m)
426 1.5 lukem char *s, *m;
427 1.1 cgd {
428 1.5 lukem char *sp, *mp;
429 1.1 cgd
430 1.1 cgd sp = s; mp = m;
431 1.1 cgd while (*mp) {
432 1.1 cgd trim(sp);
433 1.1 cgd if (*sp++ != *mp++)
434 1.1 cgd return (0);
435 1.1 cgd }
436 1.1 cgd return (sp);
437 1.1 cgd }
438