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