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