]> gcc.gnu.org Git - gcc.git/blob - gcc/protoize.c
(sys_errlist): Conditionalize declaration for BSD 4.4.
[gcc.git] / gcc / protoize.c
1 /* Protoize program - Original version by Ron Guilmette at MCC.
2
3 Copyright (C) 1989, 1992 Free Software Foundation, Inc.
4
5 This file is part of GNU CC.
6
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
10 any later version.
11
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
20
21 /* Any reasonable C++ compiler should have all of the same features
22 as __STDC__ plus more, so make sure that __STDC__ is defined if
23 __cplusplus is defined. */
24
25 #if defined(__cplusplus) && !defined(__STDC__)
26 #define __STDC__ 1
27 #endif /* defined(__cplusplus) && !defined(__STDC__) */
28
29 #if defined(__GNUC__) || defined (__GNUG__)
30 #define VOLATILE volatile
31 #else
32 #define VOLATILE
33 #endif
34
35 #ifndef __STDC__
36 #define const
37 #define volatile
38 #endif
39
40 #include "config.h"
41
42 #if 0
43 /* Users are not supposed to use _POSIX_SOURCE to say the
44 system is a POSIX system. That is not what _POSIX_SOURCE means! -- rms */
45 /* If the user asked for POSIX via _POSIX_SOURCE, turn on POSIX code. */
46 #if defined(_POSIX_SOURCE) && !defined(POSIX)
47 #define POSIX
48 #endif
49 #endif /* 0 */
50
51 #ifdef POSIX /* We should be able to define _POSIX_SOURCE unconditionally,
52 but some systems respond in buggy ways to it,
53 including SunOS 4.1.1. Which we don't classify as POSIX. */
54 /* In case this is a POSIX system with an ANSI C compiler,
55 ask for definition of all POSIX facilities. */
56 #undef _POSIX_SOURCE
57 #define _POSIX_SOURCE
58 #endif
59
60 #include "gvarargs.h"
61 /* On some systems stdio.h includes stdarg.h;
62 we must bring in gvarargs.h first. */
63 #include <stdio.h>
64 #include <ctype.h>
65 #include <errno.h>
66 #include <sys/types.h>
67 #include <sys/stat.h>
68 #ifdef POSIX
69 #include <dirent.h>
70 #else
71 #include <sys/dir.h>
72 #endif
73 #include <setjmp.h>
74
75 /* Include getopt.h for the sake of getopt_long.
76 We don't need the declaration of getopt, and it could conflict
77 with something from a system header file, so effectively nullify that. */
78 #define getopt getopt_loser
79 #include "getopt.h"
80 #undef getopt
81
82 extern int errno;
83 #if defined(bsd4_4)
84 extern const char *const sys_errlist[];
85 #else
86 extern char *sys_errlist[];
87 #endif
88 extern char *version_string;
89
90 /* Systems which are compatible only with POSIX 1003.1-1988 (but *not*
91 with POSIX 1003.1-1990), e.g. Ultrix 4.2, might not have
92 const qualifiers in the prototypes in the system include files.
93 Unfortunately, this can lead to GCC issuing lots of warnings for
94 calls to the following functions. To eliminate these warnings we
95 provide the following #defines. */
96
97 #define my_access(file,flag) access((char *)file, flag)
98 #define my_stat(file,pkt) stat((char *)file, pkt)
99 #define my_execvp(prog,argv) execvp((char *)prog, (char **)argv)
100 #define my_link(file1, file2) link((char *)file1, (char *)file2)
101 #define my_unlink(file) unlink((char *)file)
102 #define my_open(file, mode, flag) open((char *)file, mode, flag)
103 #define my_chmod(file, mode) chmod((char *)file, mode)
104
105 extern char *getpwd ();
106
107 /* Aliases for pointers to void.
108 These were made to facilitate compilation with old brain-dead DEC C
109 compilers which didn't properly grok `void*' types. */
110
111 #ifdef __STDC__
112 typedef void * pointer_type;
113 typedef const void * const_pointer_type;
114 #else
115 typedef char * pointer_type;
116 typedef char * const_pointer_type;
117 #endif
118
119 #if defined(POSIX)
120
121 #include <stdlib.h>
122 #include <unistd.h>
123 #include <signal.h>
124 #include <fcntl.h>
125
126 #else /* !defined(POSIX) */
127
128 #define R_OK 4 /* Test for Read permission */
129 #define W_OK 2 /* Test for Write permission */
130 #define X_OK 1 /* Test for eXecute permission */
131 #define F_OK 0 /* Test for existence of File */
132
133 #define O_RDONLY 0
134 #define O_WRONLY 1
135
136 /* Declaring stat or __flsbuf with a prototype
137 causes conflicts with system headers on some systems. */
138
139 #ifndef abort
140 typedef void voidfn ();
141 extern VOLATILE voidfn abort;
142 #endif
143 extern int kill ();
144 extern int creat ();
145 #if 0 /* These conflict with stdio.h on some systems. */
146 extern int fprintf (FILE *, const char *, ...);
147 extern int printf (const char *, ...);
148 extern int open (const char *, int, ...);
149 #endif /* 0 */
150 extern void exit ();
151 extern pointer_type malloc ();
152 extern pointer_type realloc ();
153 extern void free ();
154 extern int read ();
155 extern int write ();
156 extern int close ();
157 extern int fflush ();
158 extern int atoi ();
159 extern int puts ();
160 extern int fputs ();
161 extern int fputc ();
162 extern int link ();
163 extern int unlink ();
164 extern int access ();
165 extern int execvp ();
166 #ifndef setjmp
167 extern int setjmp ();
168 #endif
169 #ifndef longjmp
170 extern void longjmp ();
171 #endif
172
173 #if 0 /* size_t from sys/types.h may fail to match GCC.
174 If so, we would get a warning from this. */
175 extern size_t strlen ()
176 #endif
177
178 /* Fork is not declared because the declaration caused a conflict
179 on the HPPA. */
180 #if !(defined (USG) || defined (VMS))
181 #define fork vfork
182 #endif /* (defined (USG) || defined (VMS)) */
183
184 #endif /* !defined (POSIX) */
185
186 extern char *rindex ();
187
188 /* Look for these where the `const' qualifier is intentionally cast aside. */
189
190 #define NONCONST
191
192 /* Define a STRINGIFY macro that's right for ANSI or traditional C. */
193
194 #ifdef __STDC__
195 #define STRINGIFY(STRING) #STRING
196 #else
197 #define STRINGIFY(STRING) "STRING"
198 #endif
199
200 /* Define a default place to find the SYSCALLS.X file. */
201
202 #ifndef STD_PROTO_DIR
203 #define STD_PROTO_DIR "/usr/local/lib"
204 #endif /* !defined (STD_PROTO_DIR) */
205
206 /* Suffix of aux_info files. */
207
208 static const char * const aux_info_suffix = ".X";
209
210 /* String to attach to filenames for saved versions of original files. */
211
212 static const char * const save_suffix = ".save";
213
214 #ifndef UNPROTOIZE
215
216 /* File name of the file which contains descriptions of standard system
217 routines. Note that we never actually do anything with this file per se,
218 but we do read in its corresponding aux_info file. */
219
220 static const char syscalls_filename[] = "SYSCALLS.c";
221
222 /* Default place to find the above file. */
223
224 static const char * const default_syscalls_dir = STD_PROTO_DIR;
225
226 /* Variable to hold the complete absolutized filename of the SYSCALLS.c.X
227 file. */
228
229 static char * syscalls_absolute_filename;
230
231 #endif /* !defined (UNPROTOIZE) */
232
233 /* Type of the structure that holds information about macro unexpansions. */
234
235 struct unexpansion_struct {
236 const char *expanded;
237 const char *contracted;
238 };
239 typedef struct unexpansion_struct unexpansion;
240
241 /* A table of conversions that may need to be made for some (stupid) older
242 operating systems where these types are preprocessor macros rather than
243 typedefs (as they really ought to be).
244
245 WARNING: The contracted forms must be as small (or smaller) as the
246 expanded forms, or else havoc will ensue. */
247
248 static const unexpansion unexpansions[] = {
249 { "struct _iobuf", "FILE" },
250 { 0, 0 }
251 };
252
253 /* The number of "primary" slots in the hash tables for filenames and for
254 function names. This can be as big or as small as you like, except that
255 it must be a power of two. */
256
257 #define HASH_TABLE_SIZE (1 << 9)
258
259 /* Bit mask to use when computing hash values. */
260
261 static const int hash_mask = (HASH_TABLE_SIZE - 1);
262
263 /* Make a table of default system include directories
264 just as it is done in cccp.c. */
265
266 #ifndef STANDARD_INCLUDE_DIR
267 #define STANDARD_INCLUDE_DIR "/usr/include"
268 #endif
269
270 #ifndef LOCAL_INCLUDE_DIR
271 #define LOCAL_INCLUDE_DIR "/usr/local/include"
272 #endif
273
274 struct default_include { const char *fname; int cplusplus; } include_defaults[]
275 #ifdef INCLUDE_DEFAULTS
276 = INCLUDE_DEFAULTS;
277 #else
278 = {
279 /* Pick up GNU C++ specific include files. */
280 { GPLUSPLUS_INCLUDE_DIR, 1},
281 #ifdef CROSS_COMPILE
282 /* This is the dir for fixincludes. Put it just before
283 the files that we fix. */
284 { GCC_INCLUDE_DIR, 0},
285 /* For cross-compilation, this dir name is generated
286 automatically in Makefile.in. */
287 { CROSS_INCLUDE_DIR, 0 },
288 /* This is another place that the target system's headers might be. */
289 { TOOL_INCLUDE_DIR, 0},
290 #else /* not CROSS_COMPILE */
291 /* This should be /use/local/include and should come before
292 the fixincludes-fixed header files. */
293 { LOCAL_INCLUDE_DIR, 0},
294 /* This is here ahead of GCC_INCLUDE_DIR because assert.h goes here.
295 Likewise, behind LOCAL_INCLUDE_DIR, where glibc puts its assert.h. */
296 { TOOL_INCLUDE_DIR, 0},
297 /* This is the dir for fixincludes. Put it just before
298 the files that we fix. */
299 { GCC_INCLUDE_DIR, 0},
300 /* Some systems have an extra dir of include files. */
301 #ifdef SYSTEM_INCLUDE_DIR
302 { SYSTEM_INCLUDE_DIR, 0},
303 #endif
304 { STANDARD_INCLUDE_DIR, 0},
305 #endif /* not CROSS_COMPILE */
306 { 0, 0}
307 };
308 #endif /* no INCLUDE_DEFAULTS */
309
310 /* Datatype for lists of directories or filenames. */
311 struct string_list
312 {
313 char *name;
314 struct string_list *next;
315 };
316
317 /* List of directories in which files should be converted. */
318
319 struct string_list *directory_list;
320
321 /* List of file names which should not be converted.
322 A file is excluded if the end of its name, following a /,
323 matches one of the names in this list. */
324
325 struct string_list *exclude_list;
326
327 /* The name of the other style of variable-number-of-parameters functions
328 (i.e. the style that we want to leave unconverted because we don't yet
329 know how to convert them to this style. This string is used in warning
330 messages. */
331
332 /* Also define here the string that we can search for in the parameter lists
333 taken from the .X files which will unambiguously indicate that we have
334 found a varargs style function. */
335
336 #ifdef UNPROTOIZE
337 static const char * const other_var_style = "stdarg";
338 #else /* !defined (UNPROTOIZE) */
339 static const char * const other_var_style = "varargs";
340 /* Note that this is a string containing the expansion of va_alist.
341 But in `main' we discard all but the first token. */
342 static const char *varargs_style_indicator = STRINGIFY (va_alist);
343 #endif /* !defined (UNPROTOIZE) */
344
345 /* The following two types are used to create hash tables. In this program,
346 there are two hash tables which are used to store and quickly lookup two
347 different classes of strings. The first type of strings stored in the
348 first hash table are absolute filenames of files which protoize needs to
349 know about. The second type of strings (stored in the second hash table)
350 are function names. It is this second class of strings which really
351 inspired the use of the hash tables, because there may be a lot of them. */
352
353 typedef struct hash_table_entry_struct hash_table_entry;
354
355 /* Do some typedefs so that we don't have to write "struct" so often. */
356
357 typedef struct def_dec_info_struct def_dec_info;
358 typedef struct file_info_struct file_info;
359 typedef struct f_list_chain_item_struct f_list_chain_item;
360
361 /* In the struct below, note that the "_info" field has two different uses
362 depending on the type of hash table we are in (i.e. either the filenames
363 hash table or the function names hash table). In the filenames hash table
364 the info fields of the entries point to the file_info struct which is
365 associated with each filename (1 per filename). In the function names
366 hash table, the info field points to the head of a singly linked list of
367 def_dec_info entries which are all defs or decs of the function whose
368 name is pointed to by the "symbol" field. Keeping all of the defs/decs
369 for a given function name on a special list specifically for that function
370 name makes it quick and easy to find out all of the important information
371 about a given (named) function. */
372
373 struct hash_table_entry_struct {
374 hash_table_entry * hash_next; /* -> to secondary entries */
375 const char * symbol; /* -> to the hashed string */
376 union {
377 const def_dec_info * _ddip;
378 file_info * _fip;
379 } _info;
380 };
381 #define ddip _info._ddip
382 #define fip _info._fip
383
384 /* Define a type specifically for our two hash tables. */
385
386 typedef hash_table_entry hash_table[HASH_TABLE_SIZE];
387
388 /* The following struct holds all of the important information about any
389 single filename (e.g. file) which we need to know about. */
390
391 struct file_info_struct {
392 const hash_table_entry * hash_entry; /* -> to associated hash entry */
393 const def_dec_info * defs_decs; /* -> to chain of defs/decs */
394 time_t mtime; /* Time of last modification. */
395 };
396
397 /* Due to the possibility that functions may return pointers to functions,
398 (which may themselves have their own parameter lists) and due to the
399 fact that returned pointers-to-functions may be of type "pointer-to-
400 function-returning-pointer-to-function" (ad nauseum) we have to keep
401 an entire chain of ANSI style formal parameter lists for each function.
402
403 Normally, for any given function, there will only be one formals list
404 on the chain, but you never know.
405
406 Note that the head of each chain of formals lists is pointed to by the
407 `f_list_chain' field of the corresponding def_dec_info record.
408
409 For any given chain, the item at the head of the chain is the *leftmost*
410 parameter list seen in the actual C language function declaration. If
411 there are other members of the chain, then these are linked in left-to-right
412 order from the head of the chain. */
413
414 struct f_list_chain_item_struct {
415 const f_list_chain_item * chain_next; /* -> to next item on chain */
416 const char * formals_list; /* -> to formals list string */
417 };
418
419 /* The following struct holds all of the important information about any
420 single function definition or declaration which we need to know about.
421 Note that for unprotoize we don't need to know very much because we
422 never even create records for stuff that we don't intend to convert
423 (like for instance defs and decs which are already in old K&R format
424 and "implicit" function declarations). */
425
426 struct def_dec_info_struct {
427 const def_dec_info * next_in_file; /* -> to rest of chain for file */
428 file_info * file; /* -> file_info for containing file */
429 int line; /* source line number of def/dec */
430 const char * ansi_decl; /* -> left end of ansi decl */
431 hash_table_entry * hash_entry; /* -> hash entry for function name */
432 unsigned int is_func_def; /* = 0 means this is a declaration */
433 const def_dec_info * next_for_func; /* -> to rest of chain for func name */
434 unsigned int f_list_count; /* count of formals lists we expect */
435 char prototyped; /* = 0 means already prototyped */
436 #ifndef UNPROTOIZE
437 const f_list_chain_item * f_list_chain; /* -> chain of formals lists */
438 const def_dec_info * definition; /* -> def/dec containing related def */
439 char is_static; /* = 0 means visibility is "extern" */
440 char is_implicit; /* != 0 for implicit func decl's */
441 char written; /* != 0 means written for implicit */
442 #else /* !defined (UNPROTOIZE) */
443 const char * formal_names; /* -> to list of names of formals */
444 const char * formal_decls; /* -> to string of formal declarations */
445 #endif /* !defined (UNPROTOIZE) */
446 };
447
448 /* Pointer to the tail component of the filename by which this program was
449 invoked. Used everywhere in error and warning messages. */
450
451 static const char *pname;
452
453 /* Error counter. Will be non-zero if we should give up at the next convenient
454 stopping point. */
455
456 static int errors = 0;
457
458 /* Option flags. */
459 /* ??? These comments should say what the flag mean as well as the options
460 that set them. */
461
462 /* File name to use for running gcc. Allows GCC 2 to be named
463 something other than gcc. */
464 static const char *compiler_file_name = "gcc";
465
466 static int version_flag = 0; /* Print our version number. */
467 static int quiet_flag = 0; /* Don't print messages normally. */
468 static int nochange_flag = 0; /* Don't convert, just say what files
469 we would have converted. */
470 static int nosave_flag = 0; /* Don't save the old version. */
471 static int keep_flag = 0; /* Don't delete the .X files. */
472 static const char ** compile_params = 0; /* Option string for gcc. */
473 #ifdef UNPROTOIZE
474 static const char *indent_string = " "; /* Indentation for newly
475 inserted parm decls. */
476 #else /* !defined (UNPROTOIZE) */
477 static int local_flag = 0; /* Insert new local decls (when?). */
478 static int global_flag = 0; /* set by -g option */
479 static int cplusplus_flag = 0; /* Rename converted files to *.C. */
480 static const char* nondefault_syscalls_dir = 0; /* Dir to look for
481 SYSCALLS.c.X in. */
482 #endif /* !defined (UNPROTOIZE) */
483
484 /* An index into the compile_params array where we should insert the source
485 file name when we are ready to exec the C compiler. A zero value indicates
486 that we have not yet called munge_compile_params. */
487
488 static int input_file_name_index = 0;
489
490 /* An index into the compile_params array where we should insert the filename
491 for the aux info file, when we run the C compiler. */
492 static int aux_info_file_name_index = 0;
493
494 /* Count of command line arguments which were "filename" arguments. */
495
496 static int n_base_source_files = 0;
497
498 /* Points to a malloc'ed list of pointers to all of the filenames of base
499 source files which were specified on the command line. */
500
501 static const char **base_source_filenames;
502
503 /* Line number of the line within the current aux_info file that we
504 are currently processing. Used for error messages in case the prototypes
505 info file is corrupted somehow. */
506
507 static int current_aux_info_lineno;
508
509 /* Pointer to the name of the source file currently being converted. */
510
511 static const char *convert_filename;
512
513 /* Pointer to relative root string (taken from aux_info file) which indicates
514 where directory the user was in when he did the compilation step that
515 produced the containing aux_info file. */
516
517 static const char *invocation_filename;
518
519 /* Pointer to the base of the input buffer that holds the original text for the
520 source file currently being converted. */
521
522 static const char *orig_text_base;
523
524 /* Pointer to the byte just beyond the end of the input buffer that holds the
525 original text for the source file currently being converted. */
526
527 static const char *orig_text_limit;
528
529 /* Pointer to the base of the input buffer that holds the cleaned text for the
530 source file currently being converted. */
531
532 static const char *clean_text_base;
533
534 /* Pointer to the byte just beyond the end of the input buffer that holds the
535 cleaned text for the source file currently being converted. */
536
537 static const char *clean_text_limit;
538
539 /* Pointer to the last byte in the cleaned text buffer that we have already
540 (virtually) copied to the output buffer (or decided to ignore). */
541
542 static const char * clean_read_ptr;
543
544 /* Pointer to the base of the output buffer that holds the replacement text
545 for the source file currently being converted. */
546
547 static char *repl_text_base;
548
549 /* Pointer to the byte just beyond the end of the output buffer that holds the
550 replacement text for the source file currently being converted. */
551
552 static char *repl_text_limit;
553
554 /* Pointer to the last byte which has been stored into the output buffer.
555 The next byte to be stored should be stored just past where this points
556 to. */
557
558 static char * repl_write_ptr;
559
560 /* Pointer into the cleaned text buffer for the source file we are currently
561 converting. This points to the first character of the line that we last
562 did a "seek_to_line" to (see below). */
563
564 static const char *last_known_line_start;
565
566 /* Number of the line (in the cleaned text buffer) that we last did a
567 "seek_to_line" to. Will be one if we just read a new source file
568 into the cleaned text buffer. */
569
570 static int last_known_line_number;
571
572 /* The filenames hash table. */
573
574 static hash_table filename_primary;
575
576 /* The function names hash table. */
577
578 static hash_table function_name_primary;
579
580 /* The place to keep the recovery address which is used only in cases where
581 we get hopelessly confused by something in the cleaned original text. */
582
583 static jmp_buf source_confusion_recovery;
584
585 /* A pointer to the current directory filename (used by abspath). */
586
587 static char *cwd_buffer;
588
589 /* A place to save the read pointer until we are sure that an individual
590 attempt at editing will succeed. */
591
592 static const char * saved_clean_read_ptr;
593
594 /* A place to save the write pointer until we are sure that an individual
595 attempt at editing will succeed. */
596
597 static char * saved_repl_write_ptr;
598
599 /* Forward declaration. */
600
601 static const char *shortpath ();
602 \f
603 /* Allocate some space, but check that the allocation was successful. */
604 /* alloca.c uses this, so don't make it static. */
605
606 pointer_type
607 xmalloc (byte_count)
608 size_t byte_count;
609 {
610 pointer_type rv;
611
612 rv = malloc (byte_count);
613 if (rv == NULL)
614 {
615 fprintf (stderr, "\n%s: virtual memory exceeded\n", pname);
616 exit (1);
617 return 0; /* avoid warnings */
618 }
619 else
620 return rv;
621 }
622
623 /* Reallocate some space, but check that the reallocation was successful. */
624
625 pointer_type
626 xrealloc (old_space, byte_count)
627 pointer_type old_space;
628 size_t byte_count;
629 {
630 pointer_type rv;
631
632 rv = realloc (old_space, byte_count);
633 if (rv == NULL)
634 {
635 fprintf (stderr, "\n%s: virtual memory exceeded\n", pname);
636 exit (1);
637 return 0; /* avoid warnings */
638 }
639 else
640 return rv;
641 }
642
643 /* Deallocate the area pointed to by an arbitrary pointer, but first, strip
644 the `const' qualifier from it and also make sure that the pointer value
645 is non-null. */
646
647 void
648 xfree (p)
649 const_pointer_type p;
650 {
651 if (p)
652 free ((NONCONST pointer_type) p);
653 }
654
655 /* Make a copy of a string INPUT with size SIZE. */
656
657 static char *
658 savestring (input, size)
659 const char *input;
660 unsigned int size;
661 {
662 char *output = (char *) xmalloc (size + 1);
663 strcpy (output, input);
664 return output;
665 }
666
667 /* Make a copy of the concatenation of INPUT1 and INPUT2. */
668
669 static char *
670 savestring2 (input1, size1, input2, size2)
671 const char *input1;
672 unsigned int size1;
673 const char *input2;
674 unsigned int size2;
675 {
676 char *output = (char *) xmalloc (size1 + size2 + 1);
677 strcpy (output, input1);
678 strcpy (&output[size1], input2);
679 return output;
680 }
681
682 /* More 'friendly' abort that prints the line and file.
683 config.h can #define abort fancy_abort if you like that sort of thing. */
684
685 void
686 fancy_abort ()
687 {
688 fprintf (stderr, "%s: internal abort\n", pname);
689 exit (1);
690 }
691 \f
692 /* Make a duplicate of the first N bytes of a given string in a newly
693 allocated area. */
694
695 static char *
696 dupnstr (s, n)
697 const char *s;
698 size_t n;
699 {
700 char *ret_val = (char *) xmalloc (n + 1);
701
702 strncpy (ret_val, s, n);
703 ret_val[n] = '\0';
704 return ret_val;
705 }
706
707 /* Return a pointer to the first occurrence of s2 within s1 or NULL if s2
708 does not occur within s1. Assume neither s1 nor s2 are null pointers. */
709
710 static const char *
711 substr (s1, s2)
712 const char *s1;
713 const char *const s2;
714 {
715 for (; *s1 ; s1++)
716 {
717 const char *p1;
718 const char *p2;
719 int c;
720
721 for (p1 = s1, p2 = s2; c = *p2; p1++, p2++)
722 if (*p1 != c)
723 goto outer;
724 return s1;
725 outer:
726 ;
727 }
728 return 0;
729 }
730 \f
731 /* Get setup to recover in case the edit we are about to do goes awry. */
732
733 void
734 save_pointers ()
735 {
736 saved_clean_read_ptr = clean_read_ptr;
737 saved_repl_write_ptr = repl_write_ptr;
738 }
739
740 /* Call this routine to recover our previous state whenever something looks
741 too confusing in the source code we are trying to edit. */
742
743 void
744 restore_pointers ()
745 {
746 clean_read_ptr = saved_clean_read_ptr;
747 repl_write_ptr = saved_repl_write_ptr;
748 }
749
750 /* Return true if the given character is a legal identifier character. */
751
752 static int
753 is_id_char (ch)
754 char ch;
755 {
756 return (isalnum (ch) || (ch == '_') || (ch == '$'));
757 }
758
759 /* Give a message indicating the proper way to invoke this program and then
760 exit with non-zero status. */
761
762 static void
763 usage ()
764 {
765 #ifdef UNPROTOIZE
766 fprintf (stderr, "%s: usage '%s [ -VqfnkN ] [ -i <istring> ] [ filename ... ]'\n",
767 pname, pname);
768 #else /* !defined (UNPROTOIZE) */
769 fprintf (stderr, "%s: usage '%s [ -VqfnkNlgC ] [ -B <diname> ] [ filename ... ]'\n",
770 pname, pname);
771 #endif /* !defined (UNPROTOIZE) */
772 exit (1);
773 }
774
775 /* Return true if the given filename (assumed to be an absolute filename)
776 designates a file residing anywhere beneath any one of the "system"
777 include directories. */
778
779 static int
780 in_system_include_dir (path)
781 const char *path;
782 {
783 struct default_include *p;
784
785 if (path[0] != '/')
786 abort (); /* Must be an absolutized filename. */
787
788 for (p = include_defaults; p->fname; p++)
789 if (!strncmp (path, p->fname, strlen (p->fname))
790 && path[strlen (p->fname)] == '/')
791 return 1;
792 return 0;
793 }
794 \f
795 #if 0
796 /* Return true if the given filename designates a file that the user has
797 read access to and for which the user has write access to the containing
798 directory. */
799
800 static int
801 file_could_be_converted (const char *path)
802 {
803 char *const dir_name = (char *) alloca (strlen (path) + 1);
804
805 if (my_access (path, R_OK))
806 return 0;
807
808 {
809 char *dir_last_slash;
810
811 strcpy (dir_name, path);
812 dir_last_slash = rindex (dir_name, '/');
813 if (dir_last_slash)
814 *dir_last_slash = '\0';
815 else
816 abort (); /* Should have been an absolutized filename. */
817 }
818
819 if (my_access (path, W_OK))
820 return 0;
821
822 return 1;
823 }
824
825 /* Return true if the given filename designates a file that we are allowed
826 to modify. Files which we should not attempt to modify are (a) "system"
827 include files, and (b) files which the user doesn't have write access to,
828 and (c) files which reside in directories which the user doesn't have
829 write access to. Unless requested to be quiet, give warnings about
830 files that we will not try to convert for one reason or another. An
831 exception is made for "system" include files, which we never try to
832 convert and for which we don't issue the usual warnings. */
833
834 static int
835 file_normally_convertible (const char *path)
836 {
837 char *const dir_name = alloca (strlen (path) + 1);
838
839 if (in_system_include_dir (path))
840 return 0;
841
842 {
843 char *dir_last_slash;
844
845 strcpy (dir_name, path);
846 dir_last_slash = rindex (dir_name, '/');
847 if (dir_last_slash)
848 *dir_last_slash = '\0';
849 else
850 abort (); /* Should have been an absolutized filename. */
851 }
852
853 if (my_access (path, R_OK))
854 {
855 if (!quiet_flag)
856 fprintf (stderr, "%s: warning: no read access for file `%s'\n",
857 pname, shortpath (NULL, path));
858 return 0;
859 }
860
861 if (my_access (path, W_OK))
862 {
863 if (!quiet_flag)
864 fprintf (stderr, "%s: warning: no write access for file `%s'\n",
865 pname, shortpath (NULL, path));
866 return 0;
867 }
868
869 if (my_access (dir_name, W_OK))
870 {
871 if (!quiet_flag)
872 fprintf (stderr, "%s: warning: no write access for dir containing `%s'\n",
873 pname, shortpath (NULL, path));
874 return 0;
875 }
876
877 return 1;
878 }
879 #endif /* 0 */
880 \f
881 #ifndef UNPROTOIZE
882
883 /* Return true if the given file_info struct refers to the special SYSCALLS.c.X
884 file. Return false otherwise. */
885
886 static int
887 is_syscalls_file (fi_p)
888 const file_info *fi_p;
889 {
890 char const *f = fi_p->hash_entry->symbol;
891 size_t fl = strlen (f), sysl = sizeof (syscalls_filename) - 1;
892 return sysl <= fl && strcmp (f + fl - sysl, syscalls_filename) == 0;
893 }
894
895 #endif /* !defined (UNPROTOIZE) */
896
897 /* Check to see if this file will need to have anything done to it on this
898 run. If there is nothing in the given file which both needs conversion
899 and for which we have the necessary stuff to do the conversion, return
900 false. Otherwise, return true.
901
902 Note that (for protoize) it is only valid to call this function *after*
903 the connections between declarations and definitions have all been made
904 by connect_defs_and_decs. */
905
906 static int
907 needs_to_be_converted (file_p)
908 const file_info *file_p;
909 {
910 const def_dec_info *ddp;
911
912 #ifndef UNPROTOIZE
913
914 if (is_syscalls_file (file_p))
915 return 0;
916
917 #endif /* !defined (UNPROTOIZE) */
918
919 for (ddp = file_p->defs_decs; ddp; ddp = ddp->next_in_file)
920
921 if (
922
923 #ifndef UNPROTOIZE
924
925 /* ... and if we a protoizing and this function is in old style ... */
926 !ddp->prototyped
927 /* ... and if this a definition or is a decl with an associated def ... */
928 && (ddp->is_func_def || (!ddp->is_func_def && ddp->definition))
929
930 #else /* defined (UNPROTOIZE) */
931
932 /* ... and if we are unprotoizing and this function is in new style ... */
933 ddp->prototyped
934
935 #endif /* defined (UNPROTOIZE) */
936 )
937 /* ... then the containing file needs converting. */
938 return -1;
939 return 0;
940 }
941
942 /* Return 1 if the file name NAME is in a directory
943 that should be converted. */
944
945 static int
946 directory_specified_p (name)
947 const char *name;
948 {
949 struct string_list *p;
950
951 for (p = directory_list; p; p = p->next)
952 if (!strncmp (name, p->name, strlen (p->name))
953 && name[strlen (p->name)] == '/')
954 {
955 const char *q = name + strlen (p->name) + 1;
956
957 /* If there are more slashes, it's in a subdir, so
958 this match doesn't count. */
959 while (*q)
960 if (*q++ == '/')
961 goto lose;
962 return 1;
963
964 lose: ;
965 }
966
967 return 0;
968 }
969
970 /* Return 1 if the file named NAME should be excluded from conversion. */
971
972 static int
973 file_excluded_p (name)
974 const char *name;
975 {
976 struct string_list *p;
977 int len = strlen (name);
978
979 for (p = exclude_list; p; p = p->next)
980 if (!strcmp (name + len - strlen (p->name), p->name)
981 && name[len - strlen (p->name) - 1] == '/')
982 return 1;
983
984 return 0;
985 }
986
987 /* Construct a new element of a string_list.
988 STRING is the new element value, and REST holds the remaining elements. */
989
990 static struct string_list *
991 string_list_cons (string, rest)
992 char *string;
993 struct string_list *rest;
994 {
995 struct string_list *temp
996 = (struct string_list *) xmalloc (sizeof (struct string_list));
997
998 temp->next = rest;
999 temp->name = string;
1000 return temp;
1001 }
1002 \f
1003 /* ??? The GNU convention for mentioning function args in its comments
1004 is to capitalize them. So change "hash_tab_p" to HASH_TAB_P below.
1005 Likewise for all the other functions. */
1006
1007 /* Given a hash table, apply some function to each node in the table. The
1008 table to traverse is given as the "hash_tab_p" argument, and the
1009 function to be applied to each node in the table is given as "func"
1010 argument. */
1011
1012 static void
1013 visit_each_hash_node (hash_tab_p, func)
1014 const hash_table_entry *hash_tab_p;
1015 void (*func)();
1016 {
1017 const hash_table_entry *primary;
1018
1019 for (primary = hash_tab_p; primary < &hash_tab_p[HASH_TABLE_SIZE]; primary++)
1020 if (primary->symbol)
1021 {
1022 hash_table_entry *second;
1023
1024 (*func)(primary);
1025 for (second = primary->hash_next; second; second = second->hash_next)
1026 (*func) (second);
1027 }
1028 }
1029
1030 /* Initialize all of the fields of a new hash table entry, pointed
1031 to by the "p" parameter. Note that the space to hold the entry
1032 is assumed to have already been allocated before this routine is
1033 called. */
1034
1035 static hash_table_entry *
1036 add_symbol (p, s)
1037 hash_table_entry *p;
1038 const char *s;
1039 {
1040 p->hash_next = NULL;
1041 p->symbol = savestring (s, strlen (s));
1042 p->ddip = NULL;
1043 p->fip = NULL;
1044 return p;
1045 }
1046
1047 /* Look for a particular function name or filename in the particular
1048 hash table indicated by "hash_tab_p". If the name is not in the
1049 given hash table, add it. Either way, return a pointer to the
1050 hash table entry for the given name. */
1051
1052 static hash_table_entry *
1053 lookup (hash_tab_p, search_symbol)
1054 hash_table_entry *hash_tab_p;
1055 const char *search_symbol;
1056 {
1057 int hash_value = 0;
1058 const char *search_symbol_char_p = search_symbol;
1059 hash_table_entry *p;
1060
1061 while (*search_symbol_char_p)
1062 hash_value += *search_symbol_char_p++;
1063 hash_value &= hash_mask;
1064 p = &hash_tab_p[hash_value];
1065 if (! p->symbol)
1066 return add_symbol (p, search_symbol);
1067 if (!strcmp (p->symbol, search_symbol))
1068 return p;
1069 while (p->hash_next)
1070 {
1071 p = p->hash_next;
1072 if (!strcmp (p->symbol, search_symbol))
1073 return p;
1074 }
1075 p->hash_next = (hash_table_entry *) xmalloc (sizeof (hash_table_entry));
1076 p = p->hash_next;
1077 return add_symbol (p, search_symbol);
1078 }
1079 \f
1080 /* Throw a def/dec record on the junk heap.
1081
1082 Also, since we are not using this record anymore, free up all of the
1083 stuff it pointed to. */
1084
1085 static void
1086 free_def_dec (p)
1087 def_dec_info *p;
1088 {
1089 xfree (p->ansi_decl);
1090
1091 #ifndef UNPROTOIZE
1092 {
1093 const f_list_chain_item * curr;
1094 const f_list_chain_item * next;
1095
1096 for (curr = p->f_list_chain; curr; curr = next)
1097 {
1098 next = curr->chain_next;
1099 xfree (curr);
1100 }
1101 }
1102 #endif /* !defined (UNPROTOIZE) */
1103
1104 xfree (p);
1105 }
1106
1107 /* Unexpand as many macro symbol as we can find.
1108
1109 If the given line must be unexpanded, make a copy of it in the heap and
1110 return a pointer to the unexpanded copy. Otherwise return NULL. */
1111
1112 static char *
1113 unexpand_if_needed (aux_info_line)
1114 const char *aux_info_line;
1115 {
1116 static char *line_buf = 0;
1117 static int line_buf_size = 0;
1118 const unexpansion* unexp_p;
1119 int got_unexpanded = 0;
1120 const char *s;
1121 char *copy_p = line_buf;
1122
1123 if (line_buf == 0)
1124 {
1125 line_buf_size = 1024;
1126 line_buf = (char *) xmalloc (line_buf_size);
1127 }
1128
1129 copy_p = line_buf;
1130
1131 /* Make a copy of the input string in line_buf, expanding as necessary. */
1132
1133 for (s = aux_info_line; *s != '\n'; )
1134 {
1135 for (unexp_p = unexpansions; unexp_p->expanded; unexp_p++)
1136 {
1137 const char *in_p = unexp_p->expanded;
1138 size_t len = strlen (in_p);
1139
1140 if (*s == *in_p && !strncmp (s, in_p, len) && !is_id_char (s[len]))
1141 {
1142 int size = strlen (unexp_p->contracted);
1143 got_unexpanded = 1;
1144 if (copy_p + size - line_buf >= line_buf_size)
1145 {
1146 int offset = copy_p - line_buf;
1147 line_buf_size *= 2;
1148 line_buf_size += size;
1149 line_buf = (char *) xrealloc (line_buf, line_buf_size);
1150 copy_p = line_buf + offset;
1151 }
1152 strcpy (copy_p, unexp_p->contracted);
1153 copy_p += size;
1154
1155 /* Assume the there will not be another replacement required
1156 within the text just replaced. */
1157
1158 s += len;
1159 goto continue_outer;
1160 }
1161 }
1162 if (copy_p - line_buf == line_buf_size)
1163 {
1164 int offset = copy_p - line_buf;
1165 line_buf_size *= 2;
1166 line_buf = (char *) xrealloc (line_buf, line_buf_size);
1167 copy_p = line_buf + offset;
1168 }
1169 *copy_p++ = *s++;
1170 continue_outer: ;
1171 }
1172 if (copy_p + 2 - line_buf >= line_buf_size)
1173 {
1174 int offset = copy_p - line_buf;
1175 line_buf_size *= 2;
1176 line_buf = (char *) xrealloc (line_buf, line_buf_size);
1177 copy_p = line_buf + offset;
1178 }
1179 *copy_p++ = '\n';
1180 *copy_p = '\0';
1181
1182 return (got_unexpanded ? savestring (line_buf, copy_p - line_buf) : 0);
1183 }
1184 \f
1185 /* Return the absolutized filename for the given relative
1186 filename. Note that if that filename is already absolute, it may
1187 still be returned in a modified form because this routine also
1188 eliminates redundant slashes and single dots and eliminates double
1189 dots to get a shortest possible filename from the given input
1190 filename. The absolutization of relative filenames is made by
1191 assuming that the given filename is to be taken as relative to
1192 the first argument (cwd) or to the current directory if cwd is
1193 NULL. */
1194
1195 static char *
1196 abspath (cwd, rel_filename)
1197 const char *cwd;
1198 const char *rel_filename;
1199 {
1200 /* Setup the current working directory as needed. */
1201 const char *cwd2 = (cwd) ? cwd : cwd_buffer;
1202 char *const abs_buffer
1203 = (char *) alloca (strlen (cwd2) + strlen (rel_filename) + 2);
1204 char *endp = abs_buffer;
1205 char *outp, *inp;
1206
1207 /* Copy the filename (possibly preceded by the current working
1208 directory name) into the absolutization buffer. */
1209
1210 {
1211 const char *src_p;
1212
1213 if (rel_filename[0] != '/')
1214 {
1215 src_p = cwd2;
1216 while (*endp++ = *src_p++)
1217 continue;
1218 *(endp-1) = '/'; /* overwrite null */
1219 }
1220 src_p = rel_filename;
1221 while (*endp++ = *src_p++)
1222 continue;
1223 }
1224
1225 /* Now make a copy of abs_buffer into abs_buffer, shortening the
1226 filename (by taking out slashes and dots) as we go. */
1227
1228 outp = inp = abs_buffer;
1229 *outp++ = *inp++; /* copy first slash */
1230 #ifdef apollo
1231 if (inp[0] == '/')
1232 *outp++ = *inp++; /* copy second slash */
1233 #endif
1234 for (;;)
1235 {
1236 if (!inp[0])
1237 break;
1238 else if (inp[0] == '/' && outp[-1] == '/')
1239 {
1240 inp++;
1241 continue;
1242 }
1243 else if (inp[0] == '.' && outp[-1] == '/')
1244 {
1245 if (!inp[1])
1246 break;
1247 else if (inp[1] == '/')
1248 {
1249 inp += 2;
1250 continue;
1251 }
1252 else if ((inp[1] == '.') && (inp[2] == 0 || inp[2] == '/'))
1253 {
1254 inp += (inp[2] == '/') ? 3 : 2;
1255 outp -= 2;
1256 while (outp >= abs_buffer && *outp != '/')
1257 outp--;
1258 if (outp < abs_buffer)
1259 {
1260 /* Catch cases like /.. where we try to backup to a
1261 point above the absolute root of the logical file
1262 system. */
1263
1264 fprintf (stderr, "%s: invalid file name: %s\n",
1265 pname, rel_filename);
1266 exit (1);
1267 }
1268 *++outp = '\0';
1269 continue;
1270 }
1271 }
1272 *outp++ = *inp++;
1273 }
1274
1275 /* On exit, make sure that there is a trailing null, and make sure that
1276 the last character of the returned string is *not* a slash. */
1277
1278 *outp = '\0';
1279 if (outp[-1] == '/')
1280 *--outp = '\0';
1281
1282 /* Make a copy (in the heap) of the stuff left in the absolutization
1283 buffer and return a pointer to the copy. */
1284
1285 return savestring (abs_buffer, outp - abs_buffer);
1286 }
1287 \f
1288 /* Given a filename (and possibly a directory name from which the filename
1289 is relative) return a string which is the shortest possible
1290 equivalent for the corresponding full (absolutized) filename. The
1291 shortest possible equivalent may be constructed by converting the
1292 absolutized filename to be a relative filename (i.e. relative to
1293 the actual current working directory). However if a relative filename
1294 is longer, then the full absolute filename is returned.
1295
1296 KNOWN BUG:
1297
1298 Note that "simple-minded" conversion of any given type of filename (either
1299 relative or absolute) may not result in a valid equivalent filename if any
1300 subpart of the original filename is actually a symbolic link. */
1301
1302 static const char *
1303 shortpath (cwd, filename)
1304 const char *cwd;
1305 const char *filename;
1306 {
1307 char *rel_buffer;
1308 char *rel_buf_p;
1309 char *cwd_p = cwd_buffer;
1310 char *path_p;
1311 int unmatched_slash_count = 0;
1312 size_t filename_len = strlen (filename);
1313
1314 path_p = abspath (cwd, filename);
1315 rel_buf_p = rel_buffer = (char *) xmalloc (filename_len);
1316
1317 while (*cwd_p && (*cwd_p == *path_p))
1318 {
1319 cwd_p++;
1320 path_p++;
1321 }
1322 if (!*cwd_p && (!*path_p || *path_p == '/')) /* whole pwd matched */
1323 {
1324 if (!*path_p) /* input *is* the current path! */
1325 return ".";
1326 else
1327 return ++path_p;
1328 }
1329 else
1330 {
1331 if (*path_p)
1332 {
1333 --cwd_p;
1334 --path_p;
1335 while (*cwd_p != '/') /* backup to last slash */
1336 {
1337 --cwd_p;
1338 --path_p;
1339 }
1340 cwd_p++;
1341 path_p++;
1342 unmatched_slash_count++;
1343 }
1344
1345 /* Find out how many directory levels in cwd were *not* matched. */
1346 while (*cwd_p)
1347 if (*cwd_p++ == '/')
1348 unmatched_slash_count++;
1349
1350 /* Now we know how long the "short name" will be.
1351 Reject it if longer than the input. */
1352 if (unmatched_slash_count * 3 + strlen (path_p) >= filename_len)
1353 return filename;
1354
1355 /* For each of them, put a `../' at the beginning of the short name. */
1356 while (unmatched_slash_count--)
1357 {
1358 /* Give up if the result gets to be longer
1359 than the absolute path name. */
1360 if (rel_buffer + filename_len <= rel_buf_p + 3)
1361 return filename;
1362 *rel_buf_p++ = '.';
1363 *rel_buf_p++ = '.';
1364 *rel_buf_p++ = '/';
1365 }
1366
1367 /* Then tack on the unmatched part of the desired file's name. */
1368 do
1369 {
1370 if (rel_buffer + filename_len <= rel_buf_p)
1371 return filename;
1372 }
1373 while (*rel_buf_p++ = *path_p++);
1374
1375 --rel_buf_p;
1376 if (*(rel_buf_p-1) == '/')
1377 *--rel_buf_p = '\0';
1378 return rel_buffer;
1379 }
1380 }
1381 \f
1382 /* Lookup the given filename in the hash table for filenames. If it is a
1383 new one, then the hash table info pointer will be null. In this case,
1384 we create a new file_info record to go with the filename, and we initialize
1385 that record with some reasonable values. */
1386
1387 /* FILENAME was const, but that causes a warning on AIX when calling stat.
1388 That is probably a bug in AIX, but might as well avoid the warning. */
1389
1390 static file_info *
1391 find_file (filename, do_not_stat)
1392 char *filename;
1393 int do_not_stat;
1394 {
1395 hash_table_entry *hash_entry_p;
1396
1397 hash_entry_p = lookup (filename_primary, filename);
1398 if (hash_entry_p->fip)
1399 return hash_entry_p->fip;
1400 else
1401 {
1402 struct stat stat_buf;
1403 file_info *file_p = (file_info *) xmalloc (sizeof (file_info));
1404
1405 /* If we cannot get status on any given source file, give a warning
1406 and then just set its time of last modification to infinity. */
1407
1408 if (do_not_stat)
1409 stat_buf.st_mtime = (time_t) 0;
1410 else
1411 {
1412 if (my_stat (filename, &stat_buf) == -1)
1413 {
1414 fprintf (stderr, "%s: %s: can't get status: %s\n",
1415 pname, shortpath (NULL, filename), sys_errlist[errno]);
1416 stat_buf.st_mtime = (time_t) -1;
1417 }
1418 }
1419
1420 hash_entry_p->fip = file_p;
1421 file_p->hash_entry = hash_entry_p;
1422 file_p->defs_decs = NULL;
1423 file_p->mtime = stat_buf.st_mtime;
1424 return file_p;
1425 }
1426 }
1427
1428 /* Generate a fatal error because some part of the aux_info file is
1429 messed up. */
1430
1431 static void
1432 aux_info_corrupted ()
1433 {
1434 fprintf (stderr, "\n%s: fatal error: aux info file corrupted at line %d\n",
1435 pname, current_aux_info_lineno);
1436 exit (1);
1437 }
1438
1439 /* ??? This comment is vague. Say what the condition is for. */
1440 /* Check to see that a condition is true. This is kind of like an assert. */
1441
1442 static void
1443 check_aux_info (cond)
1444 int cond;
1445 {
1446 if (! cond)
1447 aux_info_corrupted ();
1448 }
1449
1450 /* Given a pointer to the closing right parenthesis for a particular formals
1451 list (in an aux_info file) find the corresponding left parenthesis and
1452 return a pointer to it. */
1453
1454 static const char *
1455 find_corresponding_lparen (p)
1456 const char *p;
1457 {
1458 const char *q;
1459 int paren_depth;
1460
1461 for (paren_depth = 1, q = p-1; paren_depth; q--)
1462 {
1463 switch (*q)
1464 {
1465 case ')':
1466 paren_depth++;
1467 break;
1468 case '(':
1469 paren_depth--;
1470 break;
1471 }
1472 }
1473 return ++q;
1474 }
1475 \f
1476 /* Given a line from an aux info file, and a time at which the aux info
1477 file it came from was created, check to see if the item described in
1478 the line comes from a file which has been modified since the aux info
1479 file was created. If so, return non-zero, else return zero. */
1480
1481 static int
1482 referenced_file_is_newer (l, aux_info_mtime)
1483 const char *l;
1484 time_t aux_info_mtime;
1485 {
1486 const char *p;
1487 file_info *fi_p;
1488 char *filename;
1489
1490 check_aux_info (l[0] == '/');
1491 check_aux_info (l[1] == '*');
1492 check_aux_info (l[2] == ' ');
1493
1494 {
1495 const char *filename_start = p = l + 3;
1496
1497 while (*p != ':')
1498 p++;
1499 filename = (char *) alloca ((size_t) (p - filename_start) + 1);
1500 strncpy (filename, filename_start, (size_t) (p - filename_start));
1501 filename[p-filename_start] = '\0';
1502 }
1503
1504 /* Call find_file to find the file_info record associated with the file
1505 which contained this particular def or dec item. Note that this call
1506 may cause a new file_info record to be created if this is the first time
1507 that we have ever known about this particular file. */
1508
1509 fi_p = find_file (abspath (invocation_filename, filename), 0);
1510
1511 return (fi_p->mtime > aux_info_mtime);
1512 }
1513 \f
1514 /* Given a line of info from the aux_info file, create a new
1515 def_dec_info record to remember all of the important information about
1516 a function definition or declaration.
1517
1518 Link this record onto the list of such records for the particular file in
1519 which it occurred in proper (descending) line number order (for now).
1520
1521 If there is an identical record already on the list for the file, throw
1522 this one away. Doing so takes care of the (useless and troublesome)
1523 duplicates which are bound to crop up due to multiple inclusions of any
1524 given individual header file.
1525
1526 Finally, link the new def_dec record onto the list of such records
1527 pertaining to this particular function name. */
1528
1529 static void
1530 save_def_or_dec (l, is_syscalls)
1531 const char *l;
1532 int is_syscalls;
1533 {
1534 const char *p;
1535 const char *semicolon_p;
1536 def_dec_info *def_dec_p = (def_dec_info *) xmalloc (sizeof (def_dec_info));
1537
1538 #ifndef UNPROTOIZE
1539 def_dec_p->written = 0;
1540 #endif /* !defined (UNPROTOIZE) */
1541
1542 /* Start processing the line by picking off 5 pieces of information from
1543 the left hand end of the line. These are filename, line number,
1544 new/old/implicit flag (new = ANSI prototype format), definition or
1545 declaration flag, and extern/static flag). */
1546
1547 check_aux_info (l[0] == '/');
1548 check_aux_info (l[1] == '*');
1549 check_aux_info (l[2] == ' ');
1550
1551 {
1552 const char *filename_start = p = l + 3;
1553 char *filename;
1554
1555 while (*p != ':')
1556 p++;
1557 filename = (char *) alloca ((size_t) (p - filename_start) + 1);
1558 strncpy (filename, filename_start, (size_t) (p - filename_start));
1559 filename[p-filename_start] = '\0';
1560
1561 /* Call find_file to find the file_info record associated with the file
1562 which contained this particular def or dec item. Note that this call
1563 may cause a new file_info record to be created if this is the first time
1564 that we have ever known about this particular file.
1565
1566 Note that we started out by forcing all of the base source file names
1567 (i.e. the names of the aux_info files with the .X stripped off) into the
1568 filenames hash table, and we simultaneously setup file_info records for
1569 all of these base file names (even if they may be useless later).
1570 The file_info records for all of these "base" file names (properly)
1571 act as file_info records for the "original" (i.e. un-included) files
1572 which were submitted to gcc for compilation (when the -aux-info
1573 option was used). */
1574
1575 def_dec_p->file = find_file (abspath (invocation_filename, filename), is_syscalls);
1576 }
1577
1578 {
1579 const char *line_number_start = ++p;
1580 char line_number[10];
1581
1582 while (*p != ':')
1583 p++;
1584 strncpy (line_number, line_number_start, (size_t) (p - line_number_start));
1585 line_number[p-line_number_start] = '\0';
1586 def_dec_p->line = atoi (line_number);
1587 }
1588
1589 /* Check that this record describes a new-style, old-style, or implicit
1590 definition or declaration. */
1591
1592 p++; /* Skip over the `:'. */
1593 check_aux_info ((*p == 'N') || (*p == 'O') || (*p == 'I'));
1594
1595 /* Is this a new style (ANSI prototyped) definition or declaration? */
1596
1597 def_dec_p->prototyped = (*p == 'N');
1598
1599 #ifndef UNPROTOIZE
1600
1601 /* Is this an implicit declaration? */
1602
1603 def_dec_p->is_implicit = (*p == 'I');
1604
1605 #endif /* !defined (UNPROTOIZE) */
1606
1607 p++;
1608
1609 check_aux_info ((*p == 'C') || (*p == 'F'));
1610
1611 /* Is this item a function definition (F) or a declaration (C). Note that
1612 we treat item taken from the syscalls file as though they were function
1613 definitions regardless of what the stuff in the file says. */
1614
1615 def_dec_p->is_func_def = ((*p++ == 'F') || is_syscalls);
1616
1617 #ifndef UNPROTOIZE
1618 def_dec_p->definition = 0; /* Fill this in later if protoizing. */
1619 #endif /* !defined (UNPROTOIZE) */
1620
1621 check_aux_info (*p++ == ' ');
1622 check_aux_info (*p++ == '*');
1623 check_aux_info (*p++ == '/');
1624 check_aux_info (*p++ == ' ');
1625
1626 #ifdef UNPROTOIZE
1627 check_aux_info ((!strncmp (p, "static", 6)) || (!strncmp (p, "extern", 6)));
1628 #else /* !defined (UNPROTOIZE) */
1629 if (!strncmp (p, "static", 6))
1630 def_dec_p->is_static = -1;
1631 else if (!strncmp (p, "extern", 6))
1632 def_dec_p->is_static = 0;
1633 else
1634 check_aux_info (0); /* Didn't find either `extern' or `static'. */
1635 #endif /* !defined (UNPROTOIZE) */
1636
1637 {
1638 const char *ansi_start = p;
1639
1640 p += 6; /* Pass over the "static" or "extern". */
1641
1642 /* We are now past the initial stuff. Search forward from here to find
1643 the terminating semicolon that should immediately follow the entire
1644 ANSI format function declaration. */
1645
1646 while (*++p != ';')
1647 continue;
1648
1649 semicolon_p = p;
1650
1651 /* Make a copy of the ansi declaration part of the line from the aux_info
1652 file. */
1653
1654 def_dec_p->ansi_decl
1655 = dupnstr (ansi_start, (size_t) ((semicolon_p+1) - ansi_start));
1656 }
1657
1658 /* Backup and point at the final right paren of the final argument list. */
1659
1660 p--;
1661
1662 /* Now isolate a whole set of formal argument lists, one-by-one. Normally,
1663 there will only be one list to isolate, but there could be more. */
1664
1665 def_dec_p->f_list_count = 0;
1666
1667 #ifndef UNPROTOIZE
1668 def_dec_p->f_list_chain = NULL;
1669 #endif /* !defined (UNPROTOIZE) */
1670
1671 for (;;)
1672 {
1673 const char *left_paren_p = find_corresponding_lparen (p);
1674 #ifndef UNPROTOIZE
1675 {
1676 f_list_chain_item *cip =
1677 (f_list_chain_item *) xmalloc (sizeof (f_list_chain_item));
1678
1679 cip->formals_list
1680 = dupnstr (left_paren_p + 1, (size_t) (p - (left_paren_p+1)));
1681
1682 /* Add the new chain item at the head of the current list. */
1683
1684 cip->chain_next = def_dec_p->f_list_chain;
1685 def_dec_p->f_list_chain = cip;
1686 }
1687 #endif /* !defined (UNPROTOIZE) */
1688 def_dec_p->f_list_count++;
1689
1690 p = left_paren_p - 2;
1691
1692 /* p must now point either to another right paren, or to the last
1693 character of the name of the function that was declared/defined.
1694 If p points to another right paren, then this indicates that we
1695 are dealing with multiple formals lists. In that case, there
1696 really should be another right paren preceding this right paren. */
1697
1698 if (*p != ')')
1699 break;
1700 else
1701 check_aux_info (*--p == ')');
1702 }
1703
1704
1705 {
1706 const char *past_fn = p + 1;
1707
1708 check_aux_info (*past_fn == ' ');
1709
1710 /* Scan leftwards over the identifier that names the function. */
1711
1712 while (is_id_char (*p))
1713 p--;
1714 p++;
1715
1716 /* p now points to the leftmost character of the function name. */
1717
1718 {
1719 char *fn_string = (char *) alloca (past_fn - p + 1);
1720
1721 strncpy (fn_string, p, (size_t) (past_fn - p));
1722 fn_string[past_fn-p] = '\0';
1723 def_dec_p->hash_entry = lookup (function_name_primary, fn_string);
1724 }
1725 }
1726
1727 /* Look at all of the defs and decs for this function name that we have
1728 collected so far. If there is already one which is at the same
1729 line number in the same file, then we can discard this new def_dec_info
1730 record.
1731
1732 As an extra assurance that any such pair of (nominally) identical
1733 function declarations are in fact identical, we also compare the
1734 ansi_decl parts of the lines from the aux_info files just to be on
1735 the safe side.
1736
1737 This comparison will fail if (for instance) the user was playing
1738 messy games with the preprocessor which ultimately causes one
1739 function declaration in one header file to look differently when
1740 that file is included by two (or more) other files. */
1741
1742 {
1743 const def_dec_info *other;
1744
1745 for (other = def_dec_p->hash_entry->ddip; other; other = other->next_for_func)
1746 {
1747 if (def_dec_p->line == other->line && def_dec_p->file == other->file)
1748 {
1749 if (strcmp (def_dec_p->ansi_decl, other->ansi_decl))
1750 {
1751 fprintf (stderr, "%s:%d: declaration of function `%s' takes different forms\n",
1752 def_dec_p->file->hash_entry->symbol,
1753 def_dec_p->line,
1754 def_dec_p->hash_entry->symbol);
1755 exit (1);
1756 }
1757 free_def_dec (def_dec_p);
1758 return;
1759 }
1760 }
1761 }
1762
1763 #ifdef UNPROTOIZE
1764
1765 /* If we are doing unprotoizing, we must now setup the pointers that will
1766 point to the K&R name list and to the K&R argument declarations list.
1767
1768 Note that if this is only a function declaration, then we should not
1769 expect to find any K&R style formals list following the ANSI-style
1770 formals list. This is because GCC knows that such information is
1771 useless in the case of function declarations (function definitions
1772 are a different story however).
1773
1774 Since we are unprotoizing, we don't need any such lists anyway.
1775 All we plan to do is to delete all characters between ()'s in any
1776 case. */
1777
1778 def_dec_p->formal_names = NULL;
1779 def_dec_p->formal_decls = NULL;
1780
1781 if (def_dec_p->is_func_def)
1782 {
1783 p = semicolon_p;
1784 check_aux_info (*++p == ' ');
1785 check_aux_info (*++p == '/');
1786 check_aux_info (*++p == '*');
1787 check_aux_info (*++p == ' ');
1788 check_aux_info (*++p == '(');
1789
1790 {
1791 const char *kr_names_start = ++p; /* Point just inside '('. */
1792
1793 while (*p++ != ')')
1794 continue;
1795 p--; /* point to closing right paren */
1796
1797 /* Make a copy of the K&R parameter names list. */
1798
1799 def_dec_p->formal_names
1800 = dupnstr (kr_names_start, (size_t) (p - kr_names_start));
1801 }
1802
1803 check_aux_info (*++p == ' ');
1804 p++;
1805
1806 /* p now points to the first character of the K&R style declarations
1807 list (if there is one) or to the star-slash combination that ends
1808 the comment in which such lists get embedded. */
1809
1810 /* Make a copy of the K&R formal decls list and set the def_dec record
1811 to point to it. */
1812
1813 if (*p == '*') /* Are there no K&R declarations? */
1814 {
1815 check_aux_info (*++p == '/');
1816 def_dec_p->formal_decls = "";
1817 }
1818 else
1819 {
1820 const char *kr_decls_start = p;
1821
1822 while (p[0] != '*' || p[1] != '/')
1823 p++;
1824 p--;
1825
1826 check_aux_info (*p == ' ');
1827
1828 def_dec_p->formal_decls
1829 = dupnstr (kr_decls_start, (size_t) (p - kr_decls_start));
1830 }
1831
1832 /* Handle a special case. If we have a function definition marked as
1833 being in "old" style, and if it's formal names list is empty, then
1834 it may actually have the string "void" in its real formals list
1835 in the original source code. Just to make sure, we will get setup
1836 to convert such things anyway.
1837
1838 This kludge only needs to be here because of an insurmountable
1839 problem with generating .X files. */
1840
1841 if (!def_dec_p->prototyped && !*def_dec_p->formal_names)
1842 def_dec_p->prototyped = 1;
1843 }
1844
1845 /* Since we are unprotoizing, if this item is already in old (K&R) style,
1846 we can just ignore it. If that is true, throw away the itme now. */
1847
1848 if (!def_dec_p->prototyped)
1849 {
1850 free_def_dec (def_dec_p);
1851 return;
1852 }
1853
1854 #endif /* defined (UNPROTOIZE) */
1855
1856 /* Add this record to the head of the list of records pertaining to this
1857 particular function name. */
1858
1859 def_dec_p->next_for_func = def_dec_p->hash_entry->ddip;
1860 def_dec_p->hash_entry->ddip = def_dec_p;
1861
1862 /* Add this new def_dec_info record to the sorted list of def_dec_info
1863 records for this file. Note that we don't have to worry about duplicates
1864 (caused by multiple inclusions of header files) here because we have
1865 already eliminated duplicates above. */
1866
1867 if (!def_dec_p->file->defs_decs)
1868 {
1869 def_dec_p->file->defs_decs = def_dec_p;
1870 def_dec_p->next_in_file = NULL;
1871 }
1872 else
1873 {
1874 int line = def_dec_p->line;
1875 const def_dec_info *prev = NULL;
1876 const def_dec_info *curr = def_dec_p->file->defs_decs;
1877 const def_dec_info *next = curr->next_in_file;
1878
1879 while (next && (line < curr->line))
1880 {
1881 prev = curr;
1882 curr = next;
1883 next = next->next_in_file;
1884 }
1885 if (line >= curr->line)
1886 {
1887 def_dec_p->next_in_file = curr;
1888 if (prev)
1889 ((NONCONST def_dec_info *) prev)->next_in_file = def_dec_p;
1890 else
1891 def_dec_p->file->defs_decs = def_dec_p;
1892 }
1893 else /* assert (next == NULL); */
1894 {
1895 ((NONCONST def_dec_info *) curr)->next_in_file = def_dec_p;
1896 /* assert (next == NULL); */
1897 def_dec_p->next_in_file = next;
1898 }
1899 }
1900 }
1901 \f
1902 /* Set up the vector COMPILE_PARAMS which is the argument list for running GCC.
1903 Also set input_file_name_index and aux_info_file_name_index
1904 to the indices of the slots where the file names should go. */
1905
1906 /* We initialize the vector by removing -g, -O, -S, -c, and -o options,
1907 and adding '-aux-info AUXFILE -S -o /dev/null INFILE' at the end. */
1908
1909 static void
1910 munge_compile_params (params_list)
1911 const char *params_list;
1912 {
1913 /* Build up the contents in a temporary vector
1914 that is so big that to has to be big enough. */
1915 const char **temp_params
1916 = (const char **) alloca ((strlen (params_list) + 8) * sizeof (char *));
1917 int param_count = 0;
1918 const char *param;
1919
1920 temp_params[param_count++] = compiler_file_name;
1921 for (;;)
1922 {
1923 while (isspace (*params_list))
1924 params_list++;
1925 if (!*params_list)
1926 break;
1927 param = params_list;
1928 while (*params_list && !isspace (*params_list))
1929 params_list++;
1930 if (param[0] != '-')
1931 temp_params[param_count++]
1932 = dupnstr (param, (size_t) (params_list - param));
1933 else
1934 {
1935 switch (param[1])
1936 {
1937 case 'g':
1938 case 'O':
1939 case 'S':
1940 case 'c':
1941 break; /* Don't copy these. */
1942 case 'o':
1943 while (isspace (*params_list))
1944 params_list++;
1945 while (*params_list && !isspace (*params_list))
1946 params_list++;
1947 break;
1948 default:
1949 temp_params[param_count++]
1950 = dupnstr (param, (size_t) (params_list - param));
1951 }
1952 }
1953 if (!*params_list)
1954 break;
1955 }
1956 temp_params[param_count++] = "-aux-info";
1957
1958 /* Leave room for the aux-info file name argument. */
1959 aux_info_file_name_index = param_count;
1960 temp_params[param_count++] = NULL;
1961
1962 temp_params[param_count++] = "-S";
1963 temp_params[param_count++] = "-o";
1964 temp_params[param_count++] = "/dev/null";
1965
1966 /* Leave room for the input file name argument. */
1967 input_file_name_index = param_count;
1968 temp_params[param_count++] = NULL;
1969 /* Terminate the list. */
1970 temp_params[param_count++] = NULL;
1971
1972 /* Make a copy of the compile_params in heap space. */
1973
1974 compile_params
1975 = (const char **) xmalloc (sizeof (char *) * (param_count+1));
1976 memcpy (compile_params, temp_params, sizeof (char *) * param_count);
1977 }
1978
1979 /* Do a recompilation for the express purpose of generating a new aux_info
1980 file to go with a specific base source file. */
1981
1982 static int
1983 gen_aux_info_file (base_filename)
1984 const char *base_filename;
1985 {
1986 int child_pid;
1987
1988 if (!input_file_name_index)
1989 munge_compile_params ("");
1990
1991 /* Store the full source file name in the argument vector. */
1992 compile_params[input_file_name_index] = shortpath (NULL, base_filename);
1993 /* Add .X to source file name to get aux-info file name. */
1994 compile_params[aux_info_file_name_index]
1995 = savestring2 (compile_params[input_file_name_index],
1996 strlen (compile_params[input_file_name_index]),
1997 ".X",
1998 2);
1999
2000 if (!quiet_flag)
2001 fprintf (stderr, "%s: compiling `%s'\n",
2002 pname, compile_params[input_file_name_index]);
2003
2004 if (child_pid = fork ())
2005 {
2006 if (child_pid == -1)
2007 {
2008 fprintf (stderr, "%s: could not fork process: %s\n",
2009 pname, sys_errlist[errno]);
2010 return 0;
2011 }
2012
2013 #if 0
2014 /* Print out the command line that the other process is now executing. */
2015
2016 if (!quiet_flag)
2017 {
2018 const char **arg;
2019
2020 fputs ("\t", stderr);
2021 for (arg = compile_params; *arg; arg++)
2022 {
2023 fputs (*arg, stderr);
2024 fputc (' ', stderr);
2025 }
2026 fputc ('\n', stderr);
2027 fflush (stderr);
2028 }
2029 #endif /* 0 */
2030
2031 {
2032 int wait_status;
2033
2034 if (wait (&wait_status) == -1)
2035 {
2036 fprintf (stderr, "%s: wait failed: %s\n",
2037 pname, sys_errlist[errno]);
2038 return 0;
2039 }
2040 if ((wait_status & 0x7F) != 0)
2041 {
2042 fprintf (stderr, "%s: subprocess got fatal signal %d",
2043 pname, (wait_status & 0x7F));
2044 return 0;
2045 }
2046 if (((wait_status & 0xFF00) >> 8) != 0)
2047 {
2048 fprintf (stderr, "%s: %s exited with status %d\n",
2049 pname, base_filename, ((wait_status & 0xFF00) >> 8));
2050 return 0;
2051 }
2052 return 1;
2053 }
2054 }
2055 else
2056 {
2057 if (my_execvp (compile_params[0], (char *const *) compile_params))
2058 {
2059 int e = errno, f = fileno (stderr);
2060 write (f, pname, strlen (pname));
2061 write (f, ": ", 2);
2062 write (f, compile_params[0], strlen (compile_params[0]));
2063 write (f, ": ", 2);
2064 write (f, sys_errlist[e], strlen (sys_errlist[e]));
2065 write (f, "\n", 1);
2066 _exit (1);
2067 }
2068 return 1; /* Never executed. */
2069 }
2070 }
2071 \f
2072 /* Read in all of the information contained in a single aux_info file.
2073 Save all of the important stuff for later. */
2074
2075 static void
2076 process_aux_info_file (base_source_filename, keep_it, is_syscalls)
2077 const char *base_source_filename;
2078 int keep_it;
2079 int is_syscalls;
2080 {
2081 size_t base_len = strlen (base_source_filename);
2082 char * aux_info_filename
2083 = (char *) alloca (base_len + strlen (aux_info_suffix) + 1);
2084 char *aux_info_base;
2085 char *aux_info_limit;
2086 char *aux_info_relocated_name;
2087 const char *aux_info_second_line;
2088 time_t aux_info_mtime;
2089 size_t aux_info_size;
2090 int must_create;
2091
2092 /* Construct the aux_info filename from the base source filename. */
2093
2094 strcpy (aux_info_filename, base_source_filename);
2095 strcat (aux_info_filename, aux_info_suffix);
2096
2097 /* Check that the aux_info file exists and is readable. If it does not
2098 exist, try to create it (once only). */
2099
2100 /* If file doesn't exist, set must_create.
2101 Likewise if it exists and we can read it but it is obsolete.
2102 Otherwise, report an error. */
2103 must_create = 0;
2104
2105 /* Come here with must_create set to 1 if file is out of date. */
2106 start_over: ;
2107
2108 if (my_access (aux_info_filename, R_OK) == -1)
2109 {
2110 if (errno == ENOENT)
2111 {
2112 if (is_syscalls)
2113 {
2114 fprintf (stderr, "%s: warning: missing SYSCALLS file `%s'\n",
2115 pname, aux_info_filename);
2116 return;
2117 }
2118 must_create = 1;
2119 }
2120 else
2121 {
2122 fprintf (stderr, "%s: can't read aux info file `%s': %s\n",
2123 pname, shortpath (NULL, aux_info_filename),
2124 sys_errlist[errno]);
2125 errors++;
2126 return;
2127 }
2128 }
2129 #if 0 /* There is code farther down to take care of this. */
2130 else
2131 {
2132 struct stat s1, s2;
2133 stat (aux_info_file_name, &s1);
2134 stat (base_source_file_name, &s2);
2135 if (s2.st_mtime > s1.st_mtime)
2136 must_create = 1;
2137 }
2138 #endif /* 0 */
2139
2140 /* If we need a .X file, create it, and verify we can read it. */
2141 if (must_create)
2142 {
2143 if (!gen_aux_info_file (base_source_filename))
2144 {
2145 errors++;
2146 return;
2147 }
2148 if (my_access (aux_info_filename, R_OK) == -1)
2149 {
2150 fprintf (stderr, "%s: can't read aux info file `%s': %s\n",
2151 pname, shortpath (NULL, aux_info_filename),
2152 sys_errlist[errno]);
2153 errors++;
2154 return;
2155 }
2156 }
2157
2158 {
2159 struct stat stat_buf;
2160
2161 /* Get some status information about this aux_info file. */
2162
2163 if (my_stat (aux_info_filename, &stat_buf) == -1)
2164 {
2165 fprintf (stderr, "%s: can't get status of aux info file `%s': %s\n",
2166 pname, shortpath (NULL, aux_info_filename),
2167 sys_errlist[errno]);
2168 errors++;
2169 return;
2170 }
2171
2172 /* Check on whether or not this aux_info file is zero length. If it is,
2173 then just ignore it and return. */
2174
2175 if ((aux_info_size = stat_buf.st_size) == 0)
2176 return;
2177
2178 /* Get the date/time of last modification for this aux_info file and
2179 remember it. We will have to check that any source files that it
2180 contains information about are at least this old or older. */
2181
2182 aux_info_mtime = stat_buf.st_mtime;
2183
2184 if (!is_syscalls)
2185 {
2186 /* Compare mod time with the .c file; update .X file if obsolete.
2187 The code later on can fail to check the .c file
2188 if it did not directly define any functions. */
2189
2190 if (my_stat (base_source_filename, &stat_buf) == -1)
2191 {
2192 fprintf (stderr, "%s: can't get status of aux info file `%s': %s\n",
2193 pname, shortpath (NULL, base_source_filename),
2194 sys_errlist[errno]);
2195 errors++;
2196 return;
2197 }
2198 if (stat_buf.st_mtime > aux_info_mtime)
2199 {
2200 must_create = 1;
2201 goto start_over;
2202 }
2203 }
2204 }
2205
2206 {
2207 int aux_info_file;
2208
2209 /* Open the aux_info file. */
2210
2211 if ((aux_info_file = my_open (aux_info_filename, O_RDONLY, 0444 )) == -1)
2212 {
2213 fprintf (stderr, "%s: can't open aux info file `%s' for reading: %s\n",
2214 pname, shortpath (NULL, aux_info_filename),
2215 sys_errlist[errno]);
2216 return;
2217 }
2218
2219 /* Allocate space to hold the aux_info file in memory. */
2220
2221 aux_info_base = xmalloc (aux_info_size + 1);
2222 aux_info_limit = aux_info_base + aux_info_size;
2223 *aux_info_limit = '\0';
2224
2225 /* Read the aux_info file into memory. */
2226
2227 if (read (aux_info_file, aux_info_base, aux_info_size) != aux_info_size)
2228 {
2229 fprintf (stderr, "%s: error reading aux info file `%s': %s\n",
2230 pname, shortpath (NULL, aux_info_filename),
2231 sys_errlist[errno]);
2232 free (aux_info_base);
2233 close (aux_info_file);
2234 return;
2235 }
2236
2237 /* Close the aux info file. */
2238
2239 if (close (aux_info_file))
2240 {
2241 fprintf (stderr, "%s: error closing aux info file `%s': %s\n",
2242 pname, shortpath (NULL, aux_info_filename),
2243 sys_errlist[errno]);
2244 free (aux_info_base);
2245 close (aux_info_file);
2246 return;
2247 }
2248 }
2249
2250 /* Delete the aux_info file (unless requested not to). If the deletion
2251 fails for some reason, don't even worry about it. */
2252
2253 if (must_create && !keep_it)
2254 if (my_unlink (aux_info_filename) == -1)
2255 fprintf (stderr, "%s: can't delete aux info file `%s': %s\n",
2256 pname, shortpath (NULL, aux_info_filename),
2257 sys_errlist[errno]);
2258
2259 /* Save a pointer into the first line of the aux_info file which
2260 contains the filename of the directory from which the compiler
2261 was invoked when the associated source file was compiled.
2262 This information is used later to help create complete
2263 filenames out of the (potentially) relative filenames in
2264 the aux_info file. */
2265
2266 {
2267 char *p = aux_info_base;
2268
2269 while (*p != ':')
2270 p++;
2271 p++;
2272 while (*p == ' ')
2273 p++;
2274 invocation_filename = p; /* Save a pointer to first byte of path. */
2275 while (*p != ' ')
2276 p++;
2277 *p++ = '/';
2278 *p++ = '\0';
2279 while (*p++ != '\n')
2280 continue;
2281 aux_info_second_line = p;
2282 aux_info_relocated_name = 0;
2283 if (invocation_filename[0] != '/')
2284 {
2285 /* INVOCATION_FILENAME is relative;
2286 append it to BASE_SOURCE_FILENAME's dir. */
2287 char *dir_end;
2288 aux_info_relocated_name = xmalloc (base_len + (p-invocation_filename));
2289 strcpy (aux_info_relocated_name, base_source_filename);
2290 dir_end = rindex (aux_info_relocated_name, '/');
2291 if (dir_end)
2292 dir_end++;
2293 else
2294 dir_end = aux_info_relocated_name;
2295 strcpy (dir_end, invocation_filename);
2296 invocation_filename = aux_info_relocated_name;
2297 }
2298 }
2299
2300
2301 {
2302 const char *aux_info_p;
2303
2304 /* Do a pre-pass on the lines in the aux_info file, making sure that all
2305 of the source files referenced in there are at least as old as this
2306 aux_info file itself. If not, go back and regenerate the aux_info
2307 file anew. Don't do any of this for the syscalls file. */
2308
2309 if (!is_syscalls)
2310 {
2311 current_aux_info_lineno = 2;
2312
2313 for (aux_info_p = aux_info_second_line; *aux_info_p; )
2314 {
2315 if (referenced_file_is_newer (aux_info_p, aux_info_mtime))
2316 {
2317 free (aux_info_base);
2318 xfree (aux_info_relocated_name);
2319 if (keep_it && my_unlink (aux_info_filename) == -1)
2320 {
2321 fprintf (stderr, "%s: can't delete file `%s': %s\n",
2322 pname, shortpath (NULL, aux_info_filename),
2323 sys_errlist[errno]);
2324 return;
2325 }
2326 goto start_over;
2327 }
2328
2329 /* Skip over the rest of this line to start of next line. */
2330
2331 while (*aux_info_p != '\n')
2332 aux_info_p++;
2333 aux_info_p++;
2334 current_aux_info_lineno++;
2335 }
2336 }
2337
2338 /* Now do the real pass on the aux_info lines. Save their information in
2339 the in-core data base. */
2340
2341 current_aux_info_lineno = 2;
2342
2343 for (aux_info_p = aux_info_second_line; *aux_info_p;)
2344 {
2345 char *unexpanded_line = unexpand_if_needed (aux_info_p);
2346
2347 if (unexpanded_line)
2348 {
2349 save_def_or_dec (unexpanded_line, is_syscalls);
2350 free (unexpanded_line);
2351 }
2352 else
2353 save_def_or_dec (aux_info_p, is_syscalls);
2354
2355 /* Skip over the rest of this line and get to start of next line. */
2356
2357 while (*aux_info_p != '\n')
2358 aux_info_p++;
2359 aux_info_p++;
2360 current_aux_info_lineno++;
2361 }
2362 }
2363
2364 free (aux_info_base);
2365 xfree (aux_info_relocated_name);
2366 }
2367 \f
2368 #ifndef UNPROTOIZE
2369
2370 /* Check an individual filename for a .c suffix. If the filename has this
2371 suffix, rename the file such that its suffix is changed to .C. This
2372 function implements the -C option. */
2373
2374 static void
2375 rename_c_file (hp)
2376 const hash_table_entry *hp;
2377 {
2378 const char *filename = hp->symbol;
2379 int last_char_index = strlen (filename) - 1;
2380 char *const new_filename = (char *) alloca (strlen (filename) + 1);
2381
2382 /* Note that we don't care here if the given file was converted or not. It
2383 is possible that the given file was *not* converted, simply because there
2384 was nothing in it which actually required conversion. Even in this case,
2385 we want to do the renaming. Note that we only rename files with the .c
2386 suffix. */
2387
2388 if (filename[last_char_index] != 'c' || filename[last_char_index-1] != '.')
2389 return;
2390
2391 strcpy (new_filename, filename);
2392 new_filename[last_char_index] = 'C';
2393
2394 if (my_link (filename, new_filename) == -1)
2395 {
2396 fprintf (stderr, "%s: warning: can't link file `%s' to `%s': %s\n",
2397 pname, shortpath (NULL, filename),
2398 shortpath (NULL, new_filename), sys_errlist[errno]);
2399 errors++;
2400 return;
2401 }
2402
2403 if (my_unlink (filename) == -1)
2404 {
2405 fprintf (stderr, "%s: warning: can't delete file `%s': %s\n",
2406 pname, shortpath (NULL, filename), sys_errlist[errno]);
2407 errors++;
2408 return;
2409 }
2410 }
2411
2412 #endif /* !defined (UNPROTOIZE) */
2413 \f
2414 /* Take the list of definitions and declarations attached to a particular
2415 file_info node and reverse the order of the list. This should get the
2416 list into an order such that the item with the lowest associated line
2417 number is nearest the head of the list. When these lists are originally
2418 built, they are in the opposite order. We want to traverse them in
2419 normal line number order later (i.e. lowest to highest) so reverse the
2420 order here. */
2421
2422 static void
2423 reverse_def_dec_list (hp)
2424 const hash_table_entry *hp;
2425 {
2426 file_info *file_p = hp->fip;
2427 const def_dec_info *prev = NULL;
2428 const def_dec_info *current = file_p->defs_decs;
2429
2430 if (!( current = file_p->defs_decs))
2431 return; /* no list to reverse */
2432
2433 prev = current;
2434 if (! (current = current->next_in_file))
2435 return; /* can't reverse a single list element */
2436
2437 ((NONCONST def_dec_info *) prev)->next_in_file = NULL;
2438
2439 while (current)
2440 {
2441 const def_dec_info *next = current->next_in_file;
2442
2443 ((NONCONST def_dec_info *) current)->next_in_file = prev;
2444 prev = current;
2445 current = next;
2446 }
2447
2448 file_p->defs_decs = prev;
2449 }
2450
2451 #ifndef UNPROTOIZE
2452
2453 /* Find the (only?) extern definition for a particular function name, starting
2454 from the head of the linked list of entries for the given name. If we
2455 cannot find an extern definition for the given function name, issue a
2456 warning and scrounge around for the next best thing, i.e. an extern
2457 function declaration with a prototype attached to it. Note that we only
2458 allow such substitutions for extern declarations and never for static
2459 declarations. That's because the only reason we allow them at all is
2460 to let un-prototyped function declarations for system-supplied library
2461 functions get their prototypes from our own extra SYSCALLS.c.X file which
2462 contains all of the correct prototypes for system functions. */
2463
2464 static const def_dec_info *
2465 find_extern_def (head, user)
2466 const def_dec_info *head;
2467 const def_dec_info *user;
2468 {
2469 const def_dec_info *dd_p;
2470 const def_dec_info *extern_def_p = NULL;
2471 int conflict_noted = 0;
2472
2473 /* Don't act too stupid here. Somebody may try to convert an entire system
2474 in one swell fwoop (rather than one program at a time, as should be done)
2475 and in that case, we may find that there are multiple extern definitions
2476 of a given function name in the entire set of source files that we are
2477 converting. If however one of these definitions resides in exactly the
2478 same source file as the reference we are trying to satisfy then in that
2479 case it would be stupid for us to fail to realize that this one definition
2480 *must* be the precise one we are looking for.
2481
2482 To make sure that we don't miss an opportunity to make this "same file"
2483 leap of faith, we do a prescan of the list of records relating to the
2484 given function name, and we look (on this first scan) *only* for a
2485 definition of the function which is in the same file as the reference
2486 we are currently trying to satisfy. */
2487
2488 for (dd_p = head; dd_p; dd_p = dd_p->next_for_func)
2489 if (dd_p->is_func_def && !dd_p->is_static && dd_p->file == user->file)
2490 return dd_p;
2491
2492 /* Now, since we have not found a definition in the same file as the
2493 reference, we scan the list again and consider all possibilities from
2494 all files. Here we may get conflicts with the things listed in the
2495 SYSCALLS.c.X file, but if that happens it only means that the source
2496 code being converted contains its own definition of a function which
2497 could have been supplied by libc.a. In such cases, we should avoid
2498 issuing the normal warning, and defer to the definition given in the
2499 user's own code. */
2500
2501 for (dd_p = head; dd_p; dd_p = dd_p->next_for_func)
2502 if (dd_p->is_func_def && !dd_p->is_static)
2503 {
2504 if (!extern_def_p) /* Previous definition? */
2505 extern_def_p = dd_p; /* Remember the first definition found. */
2506 else
2507 {
2508 /* Ignore definition just found if it came from SYSCALLS.c.X. */
2509
2510 if (is_syscalls_file (dd_p->file))
2511 continue;
2512
2513 /* Quietly replace the definition previously found with the one
2514 just found if the previous one was from SYSCALLS.c.X. */
2515
2516 if (is_syscalls_file (extern_def_p->file))
2517 {
2518 extern_def_p = dd_p;
2519 continue;
2520 }
2521
2522 /* If we get here, then there is a conflict between two function
2523 declarations for the same function, both of which came from the
2524 user's own code. */
2525
2526 if (!conflict_noted) /* first time we noticed? */
2527 {
2528 conflict_noted = 1;
2529 fprintf (stderr, "%s: conflicting extern definitions of '%s'\n",
2530 pname, head->hash_entry->symbol);
2531 if (!quiet_flag)
2532 {
2533 fprintf (stderr, "%s: declarations of '%s' will not be converted\n",
2534 pname, head->hash_entry->symbol);
2535 fprintf (stderr, "%s: conflict list for '%s' follows:\n",
2536 pname, head->hash_entry->symbol);
2537 fprintf (stderr, "%s: %s(%d): %s\n",
2538 pname,
2539 shortpath (NULL, extern_def_p->file->hash_entry->symbol),
2540 extern_def_p->line, extern_def_p->ansi_decl);
2541 }
2542 }
2543 if (!quiet_flag)
2544 fprintf (stderr, "%s: %s(%d): %s\n",
2545 pname,
2546 shortpath (NULL, dd_p->file->hash_entry->symbol),
2547 dd_p->line, dd_p->ansi_decl);
2548 }
2549 }
2550
2551 /* We want to err on the side of caution, so if we found multiple conflicting
2552 definitions for the same function, treat this as being that same as if we
2553 had found no definitions (i.e. return NULL). */
2554
2555 if (conflict_noted)
2556 return NULL;
2557
2558 if (!extern_def_p)
2559 {
2560 /* We have no definitions for this function so do the next best thing.
2561 Search for an extern declaration already in prototype form. */
2562
2563 for (dd_p = head; dd_p; dd_p = dd_p->next_for_func)
2564 if (!dd_p->is_func_def && !dd_p->is_static && dd_p->prototyped)
2565 {
2566 extern_def_p = dd_p; /* save a pointer to the definition */
2567 if (!quiet_flag)
2568 fprintf (stderr, "%s: warning: using formals list from %s(%d) for function `%s'\n",
2569 pname,
2570 shortpath (NULL, dd_p->file->hash_entry->symbol),
2571 dd_p->line, dd_p->hash_entry->symbol);
2572 break;
2573 }
2574
2575 /* Gripe about unprototyped function declarations that we found no
2576 corresponding definition (or other source of prototype information)
2577 for.
2578
2579 Gripe even if the unprototyped declaration we are worried about
2580 exists in a file in one of the "system" include directories. We
2581 can gripe about these because we should have at least found a
2582 corresponding (pseudo) definition in the SYSCALLS.c.X file. If we
2583 didn't, then that means that the SYSCALLS.c.X file is missing some
2584 needed prototypes for this particular system. That is worth telling
2585 the user about! */
2586
2587 if (!extern_def_p)
2588 {
2589 const char *file = user->file->hash_entry->symbol;
2590
2591 if (!quiet_flag)
2592 if (in_system_include_dir (file))
2593 {
2594 /* Why copy this string into `needed' at all?
2595 Why not just use user->ansi_decl without copying? */
2596 char *needed = (char *) alloca (strlen (user->ansi_decl) + 1);
2597 char *p;
2598
2599 strcpy (needed, user->ansi_decl);
2600 p = (NONCONST char *) substr (needed, user->hash_entry->symbol)
2601 + strlen (user->hash_entry->symbol) + 2;
2602 /* Avoid having ??? in the string. */
2603 *p++ = '?';
2604 *p++ = '?';
2605 *p++ = '?';
2606 strcpy (p, ");");
2607
2608 fprintf (stderr, "%s: %d: `%s' used but missing from SYSCALLS\n",
2609 shortpath (NULL, file), user->line,
2610 needed+7); /* Don't print "extern " */
2611 }
2612 #if 0
2613 else
2614 fprintf (stderr, "%s: %d: warning: no extern definition for `%s'\n",
2615 shortpath (NULL, file), user->line,
2616 user->hash_entry->symbol);
2617 #endif
2618 }
2619 }
2620 return extern_def_p;
2621 }
2622 \f
2623 /* Find the (only?) static definition for a particular function name in a
2624 given file. Here we get the function-name and the file info indirectly
2625 from the def_dec_info record pointer which is passed in. */
2626
2627 static const def_dec_info *
2628 find_static_definition (user)
2629 const def_dec_info *user;
2630 {
2631 const def_dec_info *head = user->hash_entry->ddip;
2632 const def_dec_info *dd_p;
2633 int num_static_defs = 0;
2634 const def_dec_info *static_def_p = NULL;
2635
2636 for (dd_p = head; dd_p; dd_p = dd_p->next_for_func)
2637 if (dd_p->is_func_def && dd_p->is_static && (dd_p->file == user->file))
2638 {
2639 static_def_p = dd_p; /* save a pointer to the definition */
2640 num_static_defs++;
2641 }
2642 if (num_static_defs == 0)
2643 {
2644 if (!quiet_flag)
2645 fprintf (stderr, "%s: warning: no static definition for `%s' in file `%s'\n",
2646 pname, head->hash_entry->symbol,
2647 shortpath (NULL, user->file->hash_entry->symbol));
2648 }
2649 else if (num_static_defs > 1)
2650 {
2651 fprintf (stderr, "%s: multiple static defs of `%s' in file `%s'\n",
2652 pname, head->hash_entry->symbol,
2653 shortpath (NULL, user->file->hash_entry->symbol));
2654 return NULL;
2655 }
2656 return static_def_p;
2657 }
2658
2659 /* Find good prototype style formal argument lists for all of the function
2660 declarations which didn't have them before now.
2661
2662 To do this we consider each function name one at a time. For each function
2663 name, we look at the items on the linked list of def_dec_info records for
2664 that particular name.
2665
2666 Somewhere on this list we should find one (and only one) def_dec_info
2667 record which represents the actual function definition, and this record
2668 should have a nice formal argument list already associated with it.
2669
2670 Thus, all we have to do is to connect up all of the other def_dec_info
2671 records for this particular function name to the special one which has
2672 the full-blown formals list.
2673
2674 Of course it is a little more complicated than just that. See below for
2675 more details. */
2676
2677 static void
2678 connect_defs_and_decs (hp)
2679 const hash_table_entry *hp;
2680 {
2681 const def_dec_info *dd_p;
2682 const def_dec_info *extern_def_p = NULL;
2683 int first_extern_reference = 1;
2684
2685 /* Traverse the list of definitions and declarations for this particular
2686 function name. For each item on the list, if it is a function
2687 definition (either old style or new style) then GCC has already been
2688 kind enough to produce a prototype for us, and it is associated with
2689 the item already, so declare the item as its own associated "definition".
2690
2691 Also, for each item which is only a function declaration, but which
2692 nonetheless has its own prototype already (obviously supplied by the user)
2693 declare the item as it's own definition.
2694
2695 Note that when/if there are multiple user-supplied prototypes already
2696 present for multiple declarations of any given function, these multiple
2697 prototypes *should* all match exactly with one another and with the
2698 prototype for the actual function definition. We don't check for this
2699 here however, since we assume that the compiler must have already done
2700 this consistency checking when it was creating the .X files. */
2701
2702 for (dd_p = hp->ddip; dd_p; dd_p = dd_p->next_for_func)
2703 if (dd_p->prototyped)
2704 ((NONCONST def_dec_info *) dd_p)->definition = dd_p;
2705
2706 /* Traverse the list of definitions and declarations for this particular
2707 function name. For each item on the list, if it is an extern function
2708 declaration and if it has no associated definition yet, go try to find
2709 the matching extern definition for the declaration.
2710
2711 When looking for the matching function definition, warn the user if we
2712 fail to find one.
2713
2714 If we find more that one function definition also issue a warning.
2715
2716 Do the search for the matching definition only once per unique function
2717 name (and only when absolutely needed) so that we can avoid putting out
2718 redundant warning messages, and so that we will only put out warning
2719 messages when there is actually a reference (i.e. a declaration) for
2720 which we need to find a matching definition. */
2721
2722 for (dd_p = hp->ddip; dd_p; dd_p = dd_p->next_for_func)
2723 if (!dd_p->is_func_def && !dd_p->is_static && !dd_p->definition)
2724 {
2725 if (first_extern_reference)
2726 {
2727 extern_def_p = find_extern_def (hp->ddip, dd_p);
2728 first_extern_reference = 0;
2729 }
2730 ((NONCONST def_dec_info *) dd_p)->definition = extern_def_p;
2731 }
2732
2733 /* Traverse the list of definitions and declarations for this particular
2734 function name. For each item on the list, if it is a static function
2735 declaration and if it has no associated definition yet, go try to find
2736 the matching static definition for the declaration within the same file.
2737
2738 When looking for the matching function definition, warn the user if we
2739 fail to find one in the same file with the declaration, and refuse to
2740 convert this kind of cross-file static function declaration. After all,
2741 this is stupid practice and should be discouraged.
2742
2743 We don't have to worry about the possibility that there is more than one
2744 matching function definition in the given file because that would have
2745 been flagged as an error by the compiler.
2746
2747 Do the search for the matching definition only once per unique
2748 function-name/source-file pair (and only when absolutely needed) so that
2749 we can avoid putting out redundant warning messages, and so that we will
2750 only put out warning messages when there is actually a reference (i.e. a
2751 declaration) for which we actually need to find a matching definition. */
2752
2753 for (dd_p = hp->ddip; dd_p; dd_p = dd_p->next_for_func)
2754 if (!dd_p->is_func_def && dd_p->is_static && !dd_p->definition)
2755 {
2756 const def_dec_info *dd_p2;
2757 const def_dec_info *static_def;
2758
2759 /* We have now found a single static declaration for which we need to
2760 find a matching definition. We want to minimize the work (and the
2761 number of warnings), so we will find an appropriate (matching)
2762 static definition for this declaration, and then distribute it
2763 (as the definition for) any and all other static declarations
2764 for this function name which occur within the same file, and which
2765 do not already have definitions.
2766
2767 Note that a trick is used here to prevent subsequent attempts to
2768 call find_static_definition for a given function-name & file
2769 if the first such call returns NULL. Essentially, we convert
2770 these NULL return values to -1, and put the -1 into the definition
2771 field for each other static declaration from the same file which
2772 does not already have an associated definition.
2773 This makes these other static declarations look like they are
2774 actually defined already when the outer loop here revisits them
2775 later on. Thus, the outer loop will skip over them. Later, we
2776 turn the -1's back to NULL's. */
2777
2778 ((NONCONST def_dec_info *) dd_p)->definition =
2779 (static_def = find_static_definition (dd_p))
2780 ? static_def
2781 : (const def_dec_info *) -1;
2782
2783 for (dd_p2 = dd_p->next_for_func; dd_p2; dd_p2 = dd_p2->next_for_func)
2784 if (!dd_p2->is_func_def && dd_p2->is_static
2785 && !dd_p2->definition && (dd_p2->file == dd_p->file))
2786 ((NONCONST def_dec_info *)dd_p2)->definition = dd_p->definition;
2787 }
2788
2789 /* Convert any dummy (-1) definitions we created in the step above back to
2790 NULL's (as they should be). */
2791
2792 for (dd_p = hp->ddip; dd_p; dd_p = dd_p->next_for_func)
2793 if (dd_p->definition == (def_dec_info *) -1)
2794 ((NONCONST def_dec_info *) dd_p)->definition = NULL;
2795 }
2796
2797 #endif /* !defined (UNPROTOIZE) */
2798
2799 /* Give a pointer into the clean text buffer, return a number which is the
2800 original source line number that the given pointer points into. */
2801
2802 static int
2803 identify_lineno (clean_p)
2804 const char *clean_p;
2805 {
2806 int line_num = 1;
2807 const char *scan_p;
2808
2809 for (scan_p = clean_text_base; scan_p <= clean_p; scan_p++)
2810 if (*scan_p == '\n')
2811 line_num++;
2812 return line_num;
2813 }
2814
2815 /* Issue an error message and give up on doing this particular edit. */
2816
2817 static void
2818 declare_source_confusing (clean_p)
2819 const char *clean_p;
2820 {
2821 if (!quiet_flag)
2822 {
2823 if (clean_p == 0)
2824 fprintf (stderr, "%s: %d: warning: source too confusing\n",
2825 shortpath (NULL, convert_filename), last_known_line_number);
2826 else
2827 fprintf (stderr, "%s: %d: warning: source too confusing\n",
2828 shortpath (NULL, convert_filename),
2829 identify_lineno (clean_p));
2830 }
2831 longjmp (source_confusion_recovery, 1);
2832 }
2833
2834 /* Check that a condition which is expected to be true in the original source
2835 code is in fact true. If not, issue an error message and give up on
2836 converting this particular source file. */
2837
2838 static void
2839 check_source (cond, clean_p)
2840 int cond;
2841 const char *clean_p;
2842 {
2843 if (!cond)
2844 declare_source_confusing (clean_p);
2845 }
2846
2847 /* If we think of the in-core cleaned text buffer as a memory mapped
2848 file (with the variable last_known_line_start acting as sort of a
2849 file pointer) then we can imagine doing "seeks" on the buffer. The
2850 following routine implements a kind of "seek" operation for the in-core
2851 (cleaned) copy of the source file. When finished, it returns a pointer to
2852 the start of a given (numbered) line in the cleaned text buffer.
2853
2854 Note that protoize only has to "seek" in the forward direction on the
2855 in-core cleaned text file buffers, and it never needs to back up.
2856
2857 This routine is made a little bit faster by remembering the line number
2858 (and pointer value) supplied (and returned) from the previous "seek".
2859 This prevents us from always having to start all over back at the top
2860 of the in-core cleaned buffer again. */
2861
2862 static const char *
2863 seek_to_line (n)
2864 int n;
2865 {
2866 if (n < last_known_line_number)
2867 abort ();
2868
2869 while (n > last_known_line_number)
2870 {
2871 while (*last_known_line_start != '\n')
2872 check_source (++last_known_line_start < clean_text_limit, 0);
2873 last_known_line_start++;
2874 last_known_line_number++;
2875 }
2876 return last_known_line_start;
2877 }
2878
2879 /* Given a pointer to a character in the cleaned text buffer, return a pointer
2880 to the next non-whitepace character which follows it. */
2881
2882 static const char *
2883 forward_to_next_token_char (ptr)
2884 const char *ptr;
2885 {
2886 for (++ptr; isspace (*ptr); check_source (++ptr < clean_text_limit, 0))
2887 continue;
2888 return ptr;
2889 }
2890
2891 /* Copy a chunk of text of length `len' and starting at `str' to the current
2892 output buffer. Note that all attempts to add stuff to the current output
2893 buffer ultimately go through here. */
2894
2895 static void
2896 output_bytes (str, len)
2897 const char *str;
2898 size_t len;
2899 {
2900 if ((repl_write_ptr + 1) + len >= repl_text_limit)
2901 {
2902 size_t new_size = (repl_text_limit - repl_text_base) << 1;
2903 char *new_buf = (char *) xrealloc (repl_text_base, new_size);
2904
2905 repl_write_ptr = new_buf + (repl_write_ptr - repl_text_base);
2906 repl_text_base = new_buf;
2907 repl_text_limit = new_buf + new_size;
2908 }
2909 memcpy (repl_write_ptr + 1, str, len);
2910 repl_write_ptr += len;
2911 }
2912
2913 /* Copy all bytes (except the trailing null) of a null terminated string to
2914 the current output buffer. */
2915
2916 static void
2917 output_string (str)
2918 const char *str;
2919 {
2920 output_bytes (str, strlen (str));
2921 }
2922
2923 /* Copy some characters from the original text buffer to the current output
2924 buffer.
2925
2926 This routine takes a pointer argument `p' which is assumed to be a pointer
2927 into the cleaned text buffer. The bytes which are copied are the `original'
2928 equivalents for the set of bytes between the last value of `clean_read_ptr'
2929 and the argument value `p'.
2930
2931 The set of bytes copied however, comes *not* from the cleaned text buffer,
2932 but rather from the direct counterparts of these bytes within the original
2933 text buffer.
2934
2935 Thus, when this function is called, some bytes from the original text
2936 buffer (which may include original comments and preprocessing directives)
2937 will be copied into the output buffer.
2938
2939 Note that the request implide when this routine is called includes the
2940 byte pointed to by the argument pointer `p'. */
2941
2942 static void
2943 output_up_to (p)
2944 const char *p;
2945 {
2946 size_t copy_length = (size_t) (p - clean_read_ptr);
2947 const char *copy_start = orig_text_base+(clean_read_ptr-clean_text_base)+1;
2948
2949 if (copy_length == 0)
2950 return;
2951
2952 output_bytes (copy_start, copy_length);
2953 clean_read_ptr = p;
2954 }
2955
2956 /* Given a pointer to a def_dec_info record which represents some form of
2957 definition of a function (perhaps a real definition, or in lieu of that
2958 perhaps just a declaration with a full prototype) return true if this
2959 function is one which we should avoid converting. Return false
2960 otherwise. */
2961
2962 static int
2963 other_variable_style_function (ansi_header)
2964 const char *ansi_header;
2965 {
2966 #ifdef UNPROTOIZE
2967
2968 /* See if we have a stdarg function, or a function which has stdarg style
2969 parameters or a stdarg style return type. */
2970
2971 return substr (ansi_header, "...") != 0;
2972
2973 #else /* !defined (UNPROTOIZE) */
2974
2975 /* See if we have a varargs function, or a function which has varargs style
2976 parameters or a varargs style return type. */
2977
2978 const char *p;
2979 int len = strlen (varargs_style_indicator);
2980
2981 for (p = ansi_header; p; )
2982 {
2983 const char *candidate;
2984
2985 if ((candidate = substr (p, varargs_style_indicator)) == 0)
2986 return 0;
2987 else
2988 if (!is_id_char (candidate[-1]) && !is_id_char (candidate[len]))
2989 return 1;
2990 else
2991 p = candidate + 1;
2992 }
2993 return 0;
2994 #endif /* !defined (UNPROTOIZE) */
2995 }
2996
2997 /* Do the editing operation specifically for a function "declaration". Note
2998 that editing for function "definitions" are handled in a separate routine
2999 below. */
3000
3001 static void
3002 edit_fn_declaration (def_dec_p, clean_text_p)
3003 const def_dec_info *def_dec_p;
3004 const char *volatile clean_text_p;
3005 {
3006 const char *start_formals;
3007 const char *end_formals;
3008 const char *function_to_edit = def_dec_p->hash_entry->symbol;
3009 size_t func_name_len = strlen (function_to_edit);
3010 const char *end_of_fn_name;
3011
3012 #ifndef UNPROTOIZE
3013
3014 const f_list_chain_item *this_f_list_chain_item;
3015 const def_dec_info *definition = def_dec_p->definition;
3016
3017 /* If we are protoizing, and if we found no corresponding definition for
3018 this particular function declaration, then just leave this declaration
3019 exactly as it is. */
3020
3021 if (!definition)
3022 return;
3023
3024 /* If we are protoizing, and if the corresponding definition that we found
3025 for this particular function declaration defined an old style varargs
3026 function, then we want to issue a warning and just leave this function
3027 declaration unconverted. */
3028
3029 if (other_variable_style_function (definition->ansi_decl))
3030 {
3031 if (!quiet_flag)
3032 fprintf (stderr, "%s: %d: warning: varargs function declaration not converted\n",
3033 shortpath (NULL, def_dec_p->file->hash_entry->symbol),
3034 def_dec_p->line);
3035 return;
3036 }
3037
3038 #endif /* !defined (UNPROTOIZE) */
3039
3040 /* Setup here to recover from confusing source code detected during this
3041 particular "edit". */
3042
3043 save_pointers ();
3044 if (setjmp (source_confusion_recovery))
3045 {
3046 restore_pointers ();
3047 fprintf (stderr, "%s: declaration of function `%s' not converted\n",
3048 pname, function_to_edit);
3049 return;
3050 }
3051
3052 /* We are editing a function declaration. The line number we did a seek to
3053 contains the comma or semicolon which follows the declaration. Our job
3054 now is to scan backwards looking for the function name. This name *must*
3055 be followed by open paren (ignoring whitespace, of course). We need to
3056 replace everything between that open paren and the corresponding closing
3057 paren. If we are protoizing, we need to insert the prototype-style
3058 formals lists. If we are unprotoizing, we need to just delete everything
3059 between the pairs of opening and closing parens. */
3060
3061 /* First move up to the end of the line. */
3062
3063 while (*clean_text_p != '\n')
3064 check_source (++clean_text_p < clean_text_limit, 0);
3065 clean_text_p--; /* Point to just before the newline character. */
3066
3067 /* Now we can scan backwards for the function name. */
3068
3069 do
3070 {
3071 for (;;)
3072 {
3073 /* Scan leftwards until we find some character which can be
3074 part of an identifier. */
3075
3076 while (!is_id_char (*clean_text_p))
3077 check_source (--clean_text_p > clean_read_ptr, 0);
3078
3079 /* Scan backwards until we find a char that cannot be part of an
3080 identifier. */
3081
3082 while (is_id_char (*clean_text_p))
3083 check_source (--clean_text_p > clean_read_ptr, 0);
3084
3085 /* Having found an "id break", see if the following id is the one
3086 that we are looking for. If so, then exit from this loop. */
3087
3088 if (!strncmp (clean_text_p+1, function_to_edit, func_name_len))
3089 {
3090 char ch = *(clean_text_p + 1 + func_name_len);
3091
3092 /* Must also check to see that the name in the source text
3093 ends where it should (in order to prevent bogus matches
3094 on similar but longer identifiers. */
3095
3096 if (! is_id_char (ch))
3097 break; /* exit from loop */
3098 }
3099 }
3100
3101 /* We have now found the first perfect match for the function name in
3102 our backward search. This may or may not be the actual function
3103 name at the start of the actual function declaration (i.e. we could
3104 have easily been mislead). We will try to avoid getting fooled too
3105 often by looking forward for the open paren which should follow the
3106 identifier we just found. We ignore whitespace while hunting. If
3107 the next non-whitespace byte we see is *not* an open left paren,
3108 then we must assume that we have been fooled and we start over
3109 again accordingly. Note that there is no guarantee, that even if
3110 we do see the open paren, that we are in the right place.
3111 Programmers do the strangest things sometimes! */
3112
3113 end_of_fn_name = clean_text_p + strlen (def_dec_p->hash_entry->symbol);
3114 start_formals = forward_to_next_token_char (end_of_fn_name);
3115 }
3116 while (*start_formals != '(');
3117
3118 /* start_of_formals now points to the opening left paren which immediately
3119 follows the name of the function. */
3120
3121 /* Note that there may be several formals lists which need to be modified
3122 due to the possibility that the return type of this function is a
3123 pointer-to-function type. If there are several formals lists, we
3124 convert them in left-to-right order here. */
3125
3126 #ifndef UNPROTOIZE
3127 this_f_list_chain_item = definition->f_list_chain;
3128 #endif /* !defined (UNPROTOIZE) */
3129
3130 for (;;)
3131 {
3132 {
3133 int depth;
3134
3135 end_formals = start_formals + 1;
3136 depth = 1;
3137 for (; depth; check_source (++end_formals < clean_text_limit, 0))
3138 {
3139 switch (*end_formals)
3140 {
3141 case '(':
3142 depth++;
3143 break;
3144 case ')':
3145 depth--;
3146 break;
3147 }
3148 }
3149 end_formals--;
3150 }
3151
3152 /* end_formals now points to the closing right paren of the formals
3153 list whose left paren is pointed to by start_formals. */
3154
3155 /* Now, if we are protoizing, we insert the new ANSI-style formals list
3156 attached to the associated definition of this function. If however
3157 we are unprotoizing, then we simply delete any formals list which
3158 may be present. */
3159
3160 output_up_to (start_formals);
3161 #ifndef UNPROTOIZE
3162 if (this_f_list_chain_item)
3163 {
3164 output_string (this_f_list_chain_item->formals_list);
3165 this_f_list_chain_item = this_f_list_chain_item->chain_next;
3166 }
3167 else
3168 {
3169 if (!quiet_flag)
3170 fprintf (stderr, "%s: warning: too many parameter lists in declaration of `%s'\n",
3171 pname, def_dec_p->hash_entry->symbol);
3172 check_source (0, end_formals); /* leave the declaration intact */
3173 }
3174 #endif /* !defined (UNPROTOIZE) */
3175 clean_read_ptr = end_formals - 1;
3176
3177 /* Now see if it looks like there may be another formals list associated
3178 with the function declaration that we are converting (following the
3179 formals list that we just converted. */
3180
3181 {
3182 const char *another_r_paren = forward_to_next_token_char (end_formals);
3183
3184 if ((*another_r_paren != ')')
3185 || (*(start_formals = forward_to_next_token_char (another_r_paren)) != '('))
3186 {
3187 #ifndef UNPROTOIZE
3188 if (this_f_list_chain_item)
3189 {
3190 if (!quiet_flag)
3191 fprintf (stderr, "\n%s: warning: too few parameter lists in declaration of `%s'\n",
3192 pname, def_dec_p->hash_entry->symbol);
3193 check_source (0, start_formals); /* leave the decl intact */
3194 }
3195 #endif /* !defined (UNPROTOIZE) */
3196 break;
3197
3198 }
3199 }
3200
3201 /* There does appear to be yet another formals list, so loop around
3202 again, and convert it also. */
3203 }
3204 }
3205
3206 /* Edit a whole group of formals lists, starting with the rightmost one
3207 from some set of formals lists. This routine is called once (from the
3208 outside) for each function declaration which is converted. It is
3209 recursive however, and it calls itself once for each remaining formal
3210 list that lies to the left of the one it was originally called to work
3211 on. Thus, a whole set gets done in right-to-left order.
3212
3213 This routine returns non-zero if it thinks that it should not be trying
3214 to convert this particular function definition (because the name of the
3215 function doesn't match the one expected). */
3216
3217 static int
3218 edit_formals_lists (end_formals, f_list_count, def_dec_p)
3219 const char *end_formals;
3220 unsigned int f_list_count;
3221 const def_dec_info *def_dec_p;
3222 {
3223 const char *start_formals;
3224 int depth;
3225
3226 start_formals = end_formals - 1;
3227 depth = 1;
3228 for (; depth; check_source (--start_formals > clean_read_ptr, 0))
3229 {
3230 switch (*start_formals)
3231 {
3232 case '(':
3233 depth--;
3234 break;
3235 case ')':
3236 depth++;
3237 break;
3238 }
3239 }
3240 start_formals++;
3241
3242 /* start_formals now points to the opening left paren of the formals list. */
3243
3244 f_list_count--;
3245
3246 if (f_list_count)
3247 {
3248 const char *next_end;
3249
3250 /* There should be more formal lists to the left of here. */
3251
3252 next_end = start_formals - 1;
3253 check_source (next_end > clean_read_ptr, 0);
3254 while (isspace (*next_end))
3255 check_source (--next_end > clean_read_ptr, 0);
3256 check_source (*next_end == ')', next_end);
3257 check_source (--next_end > clean_read_ptr, 0);
3258 check_source (*next_end == ')', next_end);
3259 if (edit_formals_lists (next_end, f_list_count, def_dec_p))
3260 return 1;
3261 }
3262
3263 /* Check that the function name in the header we are working on is the same
3264 as the one we would expect to find. If not, issue a warning and return
3265 non-zero. */
3266
3267 if (f_list_count == 0)
3268 {
3269 const char *expected = def_dec_p->hash_entry->symbol;
3270 const char *func_name_start;
3271 const char *func_name_limit;
3272 size_t func_name_len;
3273
3274 for (func_name_limit = start_formals-1; isspace (*func_name_limit); )
3275 check_source (--func_name_limit > clean_read_ptr, 0);
3276
3277 for (func_name_start = func_name_limit++;
3278 is_id_char (*func_name_start);
3279 func_name_start--)
3280 check_source (func_name_start > clean_read_ptr, 0);
3281 func_name_start++;
3282 func_name_len = func_name_limit - func_name_start;
3283 if (func_name_len == 0)
3284 check_source (0, func_name_start);
3285 if (func_name_len != strlen (expected)
3286 || strncmp (func_name_start, expected, func_name_len))
3287 {
3288 fprintf (stderr, "%s: %d: warning: found `%s' but expected `%s'\n",
3289 shortpath (NULL, def_dec_p->file->hash_entry->symbol),
3290 identify_lineno (func_name_start),
3291 dupnstr (func_name_start, func_name_len),
3292 expected);
3293 return 1;
3294 }
3295 }
3296
3297 output_up_to (start_formals);
3298
3299 #ifdef UNPROTOIZE
3300 if (f_list_count == 0)
3301 output_string (def_dec_p->formal_names);
3302 #else /* !defined (UNPROTOIZE) */
3303 {
3304 unsigned f_list_depth;
3305 const f_list_chain_item *flci_p = def_dec_p->f_list_chain;
3306
3307 /* At this point, the current value of f_list count says how many
3308 links we have to follow through the f_list_chain to get to the
3309 particular formals list that we need to output next. */
3310
3311 for (f_list_depth = 0; f_list_depth < f_list_count; f_list_depth++)
3312 flci_p = flci_p->chain_next;
3313 output_string (flci_p->formals_list);
3314 }
3315 #endif /* !defined (UNPROTOIZE) */
3316
3317 clean_read_ptr = end_formals - 1;
3318 return 0;
3319 }
3320
3321 /* Given a pointer to a byte in the clean text buffer which points to the
3322 beginning of a line that contains a "follower" token for a function
3323 definition header, do whatever is necessary to find the right closing
3324 paren for the rightmost formals list of the function definition header.
3325 */
3326
3327 static const char *
3328 find_rightmost_formals_list (clean_text_p)
3329 const char *clean_text_p;
3330 {
3331 const char *end_formals;
3332
3333 /* We are editing a function definition. The line number we did a seek
3334 to contains the first token which immediately follows the entire set of
3335 formals lists which are part of this particular function definition
3336 header.
3337
3338 Our job now is to scan leftwards in the clean text looking for the
3339 right-paren which is at the end of the function header's rightmost
3340 formals list.
3341
3342 If we ignore whitespace, this right paren should be the first one we
3343 see which is (ignoring whitespace) immediately followed either by the
3344 open curly-brace beginning the function body or by an alphabetic
3345 character (in the case where the function definition is in old (K&R)
3346 style and there are some declarations of formal parameters). */
3347
3348 /* It is possible that the right paren we are looking for is on the
3349 current line (together with its following token). Just in case that
3350 might be true, we start out here by skipping down to the right end of
3351 the current line before starting our scan. */
3352
3353 for (end_formals = clean_text_p; *end_formals != '\n'; end_formals++)
3354 continue;
3355 end_formals--;
3356
3357 #ifdef UNPROTOIZE
3358
3359 /* Now scan backwards while looking for the right end of the rightmost
3360 formals list associated with this function definition. */
3361
3362 {
3363 char ch;
3364 const char *l_brace_p;
3365
3366 /* Look leftward and try to find a right-paren. */
3367
3368 while (*end_formals != ')')
3369 {
3370 if (isspace (*end_formals))
3371 while (isspace (*end_formals))
3372 check_source (--end_formals > clean_read_ptr, 0);
3373 else
3374 check_source (--end_formals > clean_read_ptr, 0);
3375 }
3376
3377 ch = *(l_brace_p = forward_to_next_token_char (end_formals));
3378 /* Since we are unprotoizing an ANSI-style (prototyped) function
3379 definition, there had better not be anything (except whitespace)
3380 between the end of the ANSI formals list and the beginning of the
3381 function body (i.e. the '{'). */
3382
3383 check_source (ch == '{', l_brace_p);
3384 }
3385
3386 #else /* !defined (UNPROTOIZE) */
3387
3388 /* Now scan backwards while looking for the right end of the rightmost
3389 formals list associated with this function definition. */
3390
3391 while (1)
3392 {
3393 char ch;
3394 const char *l_brace_p;
3395
3396 /* Look leftward and try to find a right-paren. */
3397
3398 while (*end_formals != ')')
3399 {
3400 if (isspace (*end_formals))
3401 while (isspace (*end_formals))
3402 check_source (--end_formals > clean_read_ptr, 0);
3403 else
3404 check_source (--end_formals > clean_read_ptr, 0);
3405 }
3406
3407 ch = *(l_brace_p = forward_to_next_token_char (end_formals));
3408
3409 /* Since it is possible that we found a right paren before the starting
3410 '{' of the body which IS NOT the one at the end of the real K&R
3411 formals list (say for instance, we found one embedded inside one of
3412 the old K&R formal parameter declarations) we have to check to be
3413 sure that this is in fact the right paren that we were looking for.
3414
3415 The one we were looking for *must* be followed by either a '{' or
3416 by an alphabetic character, while others *cannot* legally be followed
3417 by such characters. */
3418
3419 if ((ch == '{') || isalpha (ch))
3420 break;
3421
3422 /* At this point, we have found a right paren, but we know that it is
3423 not the one we were looking for, so backup one character and keep
3424 looking. */
3425
3426 check_source (--end_formals > clean_read_ptr, 0);
3427 }
3428
3429 #endif /* !defined (UNPROTOIZE) */
3430
3431 return end_formals;
3432 }
3433
3434 #ifndef UNPROTOIZE
3435
3436 /* Insert into the output file a totally new declaration for a function
3437 which (up until now) was being called from within the current block
3438 without having been declared at any point such that the declaration
3439 was visible (i.e. in scope) at the point of the call.
3440
3441 We need to add in explicit declarations for all such function calls
3442 in order to get the full benefit of prototype-based function call
3443 parameter type checking. */
3444
3445 static void
3446 add_local_decl (def_dec_p, clean_text_p)
3447 const def_dec_info *def_dec_p;
3448 const char *clean_text_p;
3449 {
3450 const char *start_of_block;
3451 const char *function_to_edit = def_dec_p->hash_entry->symbol;
3452
3453 /* Don't insert new local explicit declarations unless explicitly requested
3454 to do so. */
3455
3456 if (!local_flag)
3457 return;
3458
3459 /* Setup here to recover from confusing source code detected during this
3460 particular "edit". */
3461
3462 save_pointers ();
3463 if (setjmp (source_confusion_recovery))
3464 {
3465 restore_pointers ();
3466 fprintf (stderr, "%s: local declaration for function `%s' not inserted\n",
3467 pname, function_to_edit);
3468 return;
3469 }
3470
3471 /* We have already done a seek to the start of the line which should
3472 contain *the* open curly brace which begins the block in which we need
3473 to insert an explicit function declaration (to replace the implicit one).
3474
3475 Now we scan that line, starting from the left, until we find the
3476 open curly brace we are looking for. Note that there may actually be
3477 multiple open curly braces on the given line, but we will be happy
3478 with the leftmost one no matter what. */
3479
3480 start_of_block = clean_text_p;
3481 while (*start_of_block != '{' && *start_of_block != '\n')
3482 check_source (++start_of_block < clean_text_limit, 0);
3483
3484 /* Note that the line from the original source could possibly
3485 contain *no* open curly braces! This happens if the line contains
3486 a macro call which expands into a chunk of text which includes a
3487 block (and that block's associated open and close curly braces).
3488 In cases like this, we give up, issue a warning, and do nothing. */
3489
3490 if (*start_of_block != '{')
3491 {
3492 if (!quiet_flag)
3493 fprintf (stderr,
3494 "\n%s: %d: warning: can't add declaration of `%s' into macro call\n",
3495 def_dec_p->file->hash_entry->symbol, def_dec_p->line,
3496 def_dec_p->hash_entry->symbol);
3497 return;
3498 }
3499
3500 /* Figure out what a nice (pretty) indentation would be for the new
3501 declaration we are adding. In order to do this, we must scan forward
3502 from the '{' until we find the first line which starts with some
3503 non-whitespace characters (i.e. real "token" material). */
3504
3505 {
3506 const char *ep = forward_to_next_token_char (start_of_block) - 1;
3507 const char *sp;
3508
3509 /* Now we have ep pointing at the rightmost byte of some existing indent
3510 stuff. At least that is the hope.
3511
3512 We can now just scan backwards and find the left end of the existing
3513 indentation string, and then copy it to the output buffer. */
3514
3515 for (sp = ep; isspace (*sp) && *sp != '\n'; sp--)
3516 continue;
3517
3518 /* Now write out the open { which began this block, and any following
3519 trash up to and including the last byte of the existing indent that
3520 we just found. */
3521
3522 output_up_to (ep);
3523
3524 /* Now we go ahead and insert the new declaration at this point.
3525
3526 If the definition of the given function is in the same file that we
3527 are currently editing, and if its full ANSI declaration normally
3528 would start with the keyword `extern', suppress the `extern'. */
3529
3530 {
3531 const char *decl = def_dec_p->definition->ansi_decl;
3532
3533 if ((*decl == 'e') && (def_dec_p->file == def_dec_p->definition->file))
3534 decl += 7;
3535 output_string (decl);
3536 }
3537
3538 /* Finally, write out a new indent string, just like the preceding one
3539 that we found. This will typically include a newline as the first
3540 character of the indent string. */
3541
3542 output_bytes (sp, (size_t) (ep - sp) + 1);
3543 }
3544 }
3545
3546 /* Given a pointer to a file_info record, and a pointer to the beginning
3547 of a line (in the clean text buffer) which is assumed to contain the
3548 first "follower" token for the first function definition header in the
3549 given file, find a good place to insert some new global function
3550 declarations (which will replace scattered and imprecise implicit ones)
3551 and then insert the new explicit declaration at that point in the file. */
3552
3553 static void
3554 add_global_decls (file_p, clean_text_p)
3555 const file_info *file_p;
3556 const char *clean_text_p;
3557 {
3558 const def_dec_info *dd_p;
3559 const char *scan_p;
3560
3561 /* Setup here to recover from confusing source code detected during this
3562 particular "edit". */
3563
3564 save_pointers ();
3565 if (setjmp (source_confusion_recovery))
3566 {
3567 restore_pointers ();
3568 fprintf (stderr, "%s: global declarations for file `%s' not inserted\n",
3569 pname, shortpath (NULL, file_p->hash_entry->symbol));
3570 return;
3571 }
3572
3573 /* Start by finding a good location for adding the new explicit function
3574 declarations. To do this, we scan backwards, ignoring whitespace
3575 and comments and other junk until we find either a semicolon, or until
3576 we hit the beginning of the file. */
3577
3578 scan_p = find_rightmost_formals_list (clean_text_p);
3579 for (;; --scan_p)
3580 {
3581 if (scan_p < clean_text_base)
3582 break;
3583 check_source (scan_p > clean_read_ptr, 0);
3584 if (*scan_p == ';')
3585 break;
3586 }
3587
3588 /* scan_p now points either to a semicolon, or to just before the start
3589 of the whole file. */
3590
3591 /* Now scan forward for the first non-whitespace character. In theory,
3592 this should be the first character of the following function definition
3593 header. We will put in the added declarations just prior to that. */
3594
3595 scan_p++;
3596 while (isspace (*scan_p))
3597 scan_p++;
3598 scan_p--;
3599
3600 output_up_to (scan_p);
3601
3602 /* Now write out full prototypes for all of the things that had been
3603 implicitly declared in this file (but only those for which we were
3604 actually able to find unique matching definitions). Avoid duplicates
3605 by marking things that we write out as we go. */
3606
3607 {
3608 int some_decls_added = 0;
3609
3610 for (dd_p = file_p->defs_decs; dd_p; dd_p = dd_p->next_in_file)
3611 if (dd_p->is_implicit && dd_p->definition && !dd_p->definition->written)
3612 {
3613 const char *decl = dd_p->definition->ansi_decl;
3614
3615 /* If the function for which we are inserting a declaration is
3616 actually defined later in the same file, then suppress the
3617 leading `extern' keyword (if there is one). */
3618
3619 if (*decl == 'e' && (dd_p->file == dd_p->definition->file))
3620 decl += 7;
3621
3622 output_string ("\n");
3623 output_string (decl);
3624 some_decls_added = 1;
3625 ((NONCONST def_dec_info *) dd_p->definition)->written = 1;
3626 }
3627 if (some_decls_added)
3628 output_string ("\n\n");
3629 }
3630
3631 /* Unmark all of the definitions that we just marked. */
3632
3633 for (dd_p = file_p->defs_decs; dd_p; dd_p = dd_p->next_in_file)
3634 if (dd_p->definition)
3635 ((NONCONST def_dec_info *) dd_p->definition)->written = 0;
3636 }
3637
3638 #endif /* !defined (UNPROTOIZE) */
3639
3640 /* Do the editing operation specifically for a function "definition". Note
3641 that editing operations for function "declarations" are handled by a
3642 separate routine above. */
3643
3644 static void
3645 edit_fn_definition (def_dec_p, clean_text_p)
3646 const def_dec_info *def_dec_p;
3647 const char *clean_text_p;
3648 {
3649 const char *end_formals;
3650 const char *function_to_edit = def_dec_p->hash_entry->symbol;
3651
3652 /* Setup here to recover from confusing source code detected during this
3653 particular "edit". */
3654
3655 save_pointers ();
3656 if (setjmp (source_confusion_recovery))
3657 {
3658 restore_pointers ();
3659 fprintf (stderr, "%s: definition of function `%s' not converted\n",
3660 pname, function_to_edit);
3661 return;
3662 }
3663
3664 end_formals = find_rightmost_formals_list (clean_text_p);
3665
3666 /* end_of_formals now points to the closing right paren of the rightmost
3667 formals list which is actually part of the `header' of the function
3668 definition that we are converting. */
3669
3670 /* If the header of this function definition looks like it declares a
3671 function with a variable number of arguments, and if the way it does
3672 that is different from that way we would like it (i.e. varargs vs.
3673 stdarg) then issue a warning and leave the header unconverted. */
3674
3675 if (other_variable_style_function (def_dec_p->ansi_decl))
3676 {
3677 if (!quiet_flag)
3678 fprintf (stderr, "%s: %d: warning: definition of %s not converted\n",
3679 shortpath (NULL, def_dec_p->file->hash_entry->symbol),
3680 identify_lineno (end_formals),
3681 other_var_style);
3682 output_up_to (end_formals);
3683 return;
3684 }
3685
3686 if (edit_formals_lists (end_formals, def_dec_p->f_list_count, def_dec_p))
3687 {
3688 restore_pointers ();
3689 fprintf (stderr, "%s: definition of function `%s' not converted\n",
3690 pname, function_to_edit);
3691 return;
3692 }
3693
3694 /* Have to output the last right paren because this never gets flushed by
3695 edit_formals_list. */
3696
3697 output_up_to (end_formals);
3698
3699 #ifdef UNPROTOIZE
3700 {
3701 const char *decl_p;
3702 const char *semicolon_p;
3703 const char *limit_p;
3704 const char *scan_p;
3705 int had_newlines = 0;
3706
3707 /* Now write out the K&R style formal declarations, one per line. */
3708
3709 decl_p = def_dec_p->formal_decls;
3710 limit_p = decl_p + strlen (decl_p);
3711 for (;decl_p < limit_p; decl_p = semicolon_p + 2)
3712 {
3713 for (semicolon_p = decl_p; *semicolon_p != ';'; semicolon_p++)
3714 continue;
3715 output_string ("\n");
3716 output_string (indent_string);
3717 output_bytes (decl_p, (size_t) ((semicolon_p + 1) - decl_p));
3718 }
3719
3720 /* If there are no newlines between the end of the formals list and the
3721 start of the body, we should insert one now. */
3722
3723 for (scan_p = end_formals+1; *scan_p != '{'; )
3724 {
3725 if (*scan_p == '\n')
3726 {
3727 had_newlines = 1;
3728 break;
3729 }
3730 check_source (++scan_p < clean_text_limit, 0);
3731 }
3732 if (!had_newlines)
3733 output_string ("\n");
3734 }
3735 #else /* !defined (UNPROTOIZE) */
3736 /* If we are protoizing, there may be some flotsum & jetsum (like comments
3737 and preprocessing directives) after the old formals list but before
3738 the following { and we would like to preserve that stuff while effectively
3739 deleting the existing K&R formal parameter declarations. We do so here
3740 in a rather tricky way. Basically, we white out any stuff *except*
3741 the comments/pp-directives in the original text buffer, then, if there
3742 is anything in this area *other* than whitespace, we output it. */
3743 {
3744 const char *end_formals_orig;
3745 const char *start_body;
3746 const char *start_body_orig;
3747 const char *scan;
3748 const char *scan_orig;
3749 int have_flotsum = 0;
3750 int have_newlines = 0;
3751
3752 for (start_body = end_formals + 1; *start_body != '{';)
3753 check_source (++start_body < clean_text_limit, 0);
3754
3755 end_formals_orig = orig_text_base + (end_formals - clean_text_base);
3756 start_body_orig = orig_text_base + (start_body - clean_text_base);
3757 scan = end_formals + 1;
3758 scan_orig = end_formals_orig + 1;
3759 for (; scan < start_body; scan++, scan_orig++)
3760 {
3761 if (*scan == *scan_orig)
3762 {
3763 have_newlines |= (*scan_orig == '\n');
3764 /* Leave identical whitespace alone. */
3765 if (!isspace (*scan_orig))
3766 *((NONCONST char *)scan_orig) = ' '; /* identical - so whiteout */
3767 }
3768 else
3769 have_flotsum = 1;
3770 }
3771 if (have_flotsum)
3772 output_bytes (end_formals_orig + 1,
3773 (size_t) (start_body_orig - end_formals_orig) - 1);
3774 else
3775 if (have_newlines)
3776 output_string ("\n");
3777 else
3778 output_string (" ");
3779 clean_read_ptr = start_body - 1;
3780 }
3781 #endif /* !defined (UNPROTOIZE) */
3782 }
3783
3784 /* Clean up the clean text buffer. Do this by converting comments and
3785 preprocessor directives into spaces. Also convert line continuations
3786 into whitespace. Also, whiteout string and character literals. */
3787
3788 static void
3789 do_cleaning (new_clean_text_base, new_clean_text_limit)
3790 char *new_clean_text_base;
3791 char *new_clean_text_limit;
3792 {
3793 char *scan_p;
3794 int non_whitespace_since_newline = 0;
3795
3796 for (scan_p = new_clean_text_base; scan_p < new_clean_text_limit; scan_p++)
3797 {
3798 switch (*scan_p)
3799 {
3800 case '/': /* Handle comments. */
3801 if (scan_p[1] != '*')
3802 goto regular;
3803 non_whitespace_since_newline = 1;
3804 scan_p[0] = ' ';
3805 scan_p[1] = ' ';
3806 scan_p += 2;
3807 while (scan_p[1] != '/' || scan_p[0] != '*')
3808 {
3809 if (!isspace (*scan_p))
3810 *scan_p = ' ';
3811 if (++scan_p >= new_clean_text_limit)
3812 abort ();
3813 }
3814 *scan_p++ = ' ';
3815 *scan_p = ' ';
3816 break;
3817
3818 case '#': /* Handle pp directives. */
3819 if (non_whitespace_since_newline)
3820 goto regular;
3821 *scan_p = ' ';
3822 while (scan_p[1] != '\n' || scan_p[0] == '\\')
3823 {
3824 if (!isspace (*scan_p))
3825 *scan_p = ' ';
3826 if (++scan_p >= new_clean_text_limit)
3827 abort ();
3828 }
3829 *scan_p++ = ' ';
3830 break;
3831
3832 case '\'': /* Handle character literals. */
3833 non_whitespace_since_newline = 1;
3834 while (scan_p[1] != '\'' || scan_p[0] == '\\')
3835 {
3836 if (scan_p[0] == '\\' && !isspace (scan_p[1]))
3837 scan_p[1] = ' ';
3838 if (!isspace (*scan_p))
3839 *scan_p = ' ';
3840 if (++scan_p >= new_clean_text_limit)
3841 abort ();
3842 }
3843 *scan_p++ = ' ';
3844 break;
3845
3846 case '"': /* Handle string literals. */
3847 non_whitespace_since_newline = 1;
3848 while (scan_p[1] != '"' || scan_p[0] == '\\')
3849 {
3850 if (scan_p[0] == '\\' && !isspace (scan_p[1]))
3851 scan_p[1] = ' ';
3852 if (!isspace (*scan_p))
3853 *scan_p = ' ';
3854 if (++scan_p >= new_clean_text_limit)
3855 abort ();
3856 }
3857 *scan_p++ = ' ';
3858 break;
3859
3860 case '\\': /* Handle line continuations. */
3861 if (scan_p[1] != '\n')
3862 goto regular;
3863 *scan_p = ' ';
3864 break;
3865
3866 case '\n':
3867 non_whitespace_since_newline = 0; /* Reset. */
3868 break;
3869
3870 case ' ':
3871 case '\v':
3872 case '\t':
3873 case '\r':
3874 case '\f':
3875 case '\b':
3876 break; /* Whitespace characters. */
3877
3878 default:
3879 regular:
3880 non_whitespace_since_newline = 1;
3881 break;
3882 }
3883 }
3884 }
3885
3886 /* Given a pointer to the closing right parenthesis for a particular formals
3887 list (in the clean text buffer) find the corresponding left parenthesis
3888 and return a pointer to it. */
3889
3890 static const char *
3891 careful_find_l_paren (p)
3892 const char *p;
3893 {
3894 const char *q;
3895 int paren_depth;
3896
3897 for (paren_depth = 1, q = p-1; paren_depth; check_source (--q >= clean_text_base, 0))
3898 {
3899 switch (*q)
3900 {
3901 case ')':
3902 paren_depth++;
3903 break;
3904 case '(':
3905 paren_depth--;
3906 break;
3907 }
3908 }
3909 return ++q;
3910 }
3911
3912 /* Scan the clean text buffer for cases of function definitions that we
3913 don't really know about because they were preprocessed out when the
3914 aux info files were created.
3915
3916 In this version of protoize/unprotoize we just give a warning for each
3917 one found. A later version may be able to at least unprotoize such
3918 missed items.
3919
3920 Note that we may easily find all function definitions simply by
3921 looking for places where there is a left paren which is (ignoring
3922 whitespace) immediately followed by either a left-brace or by an
3923 upper or lower case letter. Whenever we find this combination, we
3924 have also found a function definition header.
3925
3926 Finding function *declarations* using syntactic clues is much harder.
3927 I will probably try to do this in a later version though. */
3928
3929 static void
3930 scan_for_missed_items (file_p)
3931 const file_info *file_p;
3932 {
3933 static const char *scan_p;
3934 const char *limit = clean_text_limit - 3;
3935 static const char *backup_limit;
3936
3937 backup_limit = clean_text_base - 1;
3938
3939 for (scan_p = clean_text_base; scan_p < limit; scan_p++)
3940 {
3941 if (*scan_p == ')')
3942 {
3943 static const char *last_r_paren;
3944 const char *ahead_p;
3945
3946 last_r_paren = scan_p;
3947
3948 for (ahead_p = scan_p + 1; isspace (*ahead_p); )
3949 check_source (++ahead_p < limit, limit);
3950
3951 scan_p = ahead_p - 1;
3952
3953 if (isalpha (*ahead_p) || *ahead_p == '{')
3954 {
3955 const char *last_l_paren;
3956 const int lineno = identify_lineno (ahead_p);
3957
3958 if (setjmp (source_confusion_recovery))
3959 continue;
3960
3961 /* We know we have a function definition header. Now skip
3962 leftwards over all of its associated formals lists. */
3963
3964 do
3965 {
3966 last_l_paren = careful_find_l_paren (last_r_paren);
3967 for (last_r_paren = last_l_paren-1; isspace (*last_r_paren); )
3968 check_source (--last_r_paren >= backup_limit, backup_limit);
3969 }
3970 while (*last_r_paren == ')');
3971
3972 if (is_id_char (*last_r_paren))
3973 {
3974 const char *id_limit = last_r_paren + 1;
3975 const char *id_start;
3976 size_t id_length;
3977 const def_dec_info *dd_p;
3978
3979 for (id_start = id_limit-1; is_id_char (*id_start); )
3980 check_source (--id_start >= backup_limit, backup_limit);
3981 id_start++;
3982 backup_limit = id_start;
3983 if ((id_length = (size_t) (id_limit - id_start)) == 0)
3984 goto not_missed;
3985
3986 {
3987 char *func_name = (char *) alloca (id_length + 1);
3988 static const char * const stmt_keywords[]
3989 = { "if", "else", "do", "while", "for", "switch", "case", "return", 0 };
3990 const char * const *stmt_keyword;
3991
3992 strncpy (func_name, id_start, id_length);
3993 func_name[id_length] = '\0';
3994
3995 /* We must check here to see if we are actually looking at
3996 a statement rather than an actual function call. */
3997
3998 for (stmt_keyword = stmt_keywords; *stmt_keyword; stmt_keyword++)
3999 if (!strcmp (func_name, *stmt_keyword))
4000 goto not_missed;
4001
4002 #if 0
4003 fprintf (stderr, "%s: found definition of `%s' at %s(%d)\n",
4004 pname,
4005 func_name,
4006 shortpath (NULL, file_p->hash_entry->symbol),
4007 identify_lineno (id_start));
4008 #endif /* 0 */
4009 /* We really should check for a match of the function name
4010 here also, but why bother. */
4011
4012 for (dd_p = file_p->defs_decs; dd_p; dd_p = dd_p->next_in_file)
4013 if (dd_p->is_func_def && dd_p->line == lineno)
4014 goto not_missed;
4015
4016 /* If we make it here, then we did not know about this
4017 function definition. */
4018
4019 fprintf (stderr, "%s: %d: warning: `%s' excluded by preprocessing\n",
4020 shortpath (NULL, file_p->hash_entry->symbol),
4021 identify_lineno (id_start), func_name);
4022 fprintf (stderr, "%s: function definition not converted\n",
4023 pname);
4024 }
4025 not_missed: ;
4026 }
4027 }
4028 }
4029 }
4030 }
4031
4032 /* Do all editing operations for a single source file (either a "base" file
4033 or an "include" file). To do this we read the file into memory, keep a
4034 virgin copy there, make another cleaned in-core copy of the original file
4035 (i.e. one in which all of the comments and preprocessor directives have
4036 been replaced with whitespace), then use these two in-core copies of the
4037 file to make a new edited in-core copy of the file. Finally, rename the
4038 original file (as a way of saving it), and then write the edited version
4039 of the file from core to a disk file of the same name as the original.
4040
4041 Note that the trick of making a copy of the original sans comments &
4042 preprocessor directives make the editing a whole lot easier. */
4043
4044 static void
4045 edit_file (hp)
4046 const hash_table_entry *hp;
4047 {
4048 struct stat stat_buf;
4049 const file_info *file_p = hp->fip;
4050 char *new_orig_text_base;
4051 char *new_orig_text_limit;
4052 char *new_clean_text_base;
4053 char *new_clean_text_limit;
4054 size_t orig_size;
4055 size_t repl_size;
4056 int first_definition_in_file;
4057
4058 /* If we are not supposed to be converting this file, or if there is
4059 nothing in there which needs converting, just skip this file. */
4060
4061 if (!needs_to_be_converted (file_p))
4062 return;
4063
4064 convert_filename = file_p->hash_entry->symbol;
4065
4066 /* Convert a file if it is in a directory where we want conversion
4067 and the file is not excluded. */
4068
4069 if (!directory_specified_p (convert_filename)
4070 || file_excluded_p (convert_filename))
4071 {
4072 if (!quiet_flag
4073 #ifdef UNPROTOIZE
4074 /* Don't even mention "system" include files unless we are
4075 protoizing. If we are protoizing, we mention these as a
4076 gentle way of prodding the user to convert his "system"
4077 include files to prototype format. */
4078 && !in_system_include_dir (convert_filename)
4079 #endif /* defined (UNPROTOIZE) */
4080 )
4081 fprintf (stderr, "%s: `%s' not converted\n",
4082 pname, shortpath (NULL, convert_filename));
4083 return;
4084 }
4085
4086 /* Let the user know what we are up to. */
4087
4088 if (nochange_flag)
4089 fprintf (stderr, "%s: would convert file `%s'\n",
4090 pname, shortpath (NULL, convert_filename));
4091 else
4092 fprintf (stderr, "%s: converting file `%s'\n",
4093 pname, shortpath (NULL, convert_filename));
4094 fflush (stderr);
4095
4096 /* Find out the size (in bytes) of the original file. */
4097
4098 /* The cast avoids an erroneous warning on AIX. */
4099 if (my_stat ((char *)convert_filename, &stat_buf) == -1)
4100 {
4101 fprintf (stderr, "%s: can't get status for file `%s': %s\n",
4102 pname, shortpath (NULL, convert_filename), sys_errlist[errno]);
4103 return;
4104 }
4105 orig_size = stat_buf.st_size;
4106
4107 /* Allocate a buffer to hold the original text. */
4108
4109 orig_text_base = new_orig_text_base = (char *) xmalloc (orig_size + 2);
4110 orig_text_limit = new_orig_text_limit = new_orig_text_base + orig_size;
4111
4112 /* Allocate a buffer to hold the cleaned-up version of the original text. */
4113
4114 clean_text_base = new_clean_text_base = (char *) xmalloc (orig_size + 2);
4115 clean_text_limit = new_clean_text_limit = new_clean_text_base + orig_size;
4116 clean_read_ptr = clean_text_base - 1;
4117
4118 /* Allocate a buffer that will hopefully be large enough to hold the entire
4119 converted output text. As an initial guess for the maximum size of the
4120 output buffer, use 125% of the size of the original + some extra. This
4121 buffer can be expanded later as needed. */
4122
4123 repl_size = orig_size + (orig_size >> 2) + 4096;
4124 repl_text_base = (char *) xmalloc (repl_size + 2);
4125 repl_text_limit = repl_text_base + repl_size - 1;
4126 repl_write_ptr = repl_text_base - 1;
4127
4128 {
4129 int input_file;
4130
4131 /* Open the file to be converted in READ ONLY mode. */
4132
4133 if ((input_file = my_open (convert_filename, O_RDONLY, 0444)) == -1)
4134 {
4135 fprintf (stderr, "%s: can't open file `%s' for reading: %s\n",
4136 pname, shortpath (NULL, convert_filename),
4137 sys_errlist[errno]);
4138 return;
4139 }
4140
4141 /* Read the entire original source text file into the original text buffer
4142 in one swell fwoop. Then figure out where the end of the text is and
4143 make sure that it ends with a newline followed by a null. */
4144
4145 if (read (input_file, new_orig_text_base, orig_size) != orig_size)
4146 {
4147 close (input_file);
4148 fprintf (stderr, "\n%s: error reading input file `%s': %s\n",
4149 pname, shortpath (NULL, convert_filename),
4150 sys_errlist[errno]);
4151 return;
4152 }
4153
4154 close (input_file);
4155 }
4156
4157 if (orig_size == 0 || orig_text_limit[-1] != '\n')
4158 {
4159 *new_orig_text_limit++ = '\n';
4160 orig_text_limit++;
4161 }
4162
4163 /* Create the cleaned up copy of the original text. */
4164
4165 memcpy (new_clean_text_base, orig_text_base,
4166 (size_t) (orig_text_limit - orig_text_base));
4167 do_cleaning (new_clean_text_base, new_clean_text_limit);
4168
4169 #if 0
4170 {
4171 int clean_file;
4172 size_t clean_size = orig_text_limit - orig_text_base;
4173 char *const clean_filename = (char *) alloca (strlen (convert_filename) + 6 + 1);
4174
4175 /* Open (and create) the clean file. */
4176
4177 strcpy (clean_filename, convert_filename);
4178 strcat (clean_filename, ".clean");
4179 if ((clean_file = creat (clean_filename, 0666)) == -1)
4180 {
4181 fprintf (stderr, "%s: can't create/open clean file `%s': %s\n",
4182 pname, shortpath (NULL, clean_filename),
4183 sys_errlist[errno]);
4184 return;
4185 }
4186
4187 /* Write the clean file. */
4188
4189 if (write (clean_file, new_clean_text_base, clean_size) != clean_size)
4190 fprintf (stderr, "%s: error writing file `%s': %s\n",
4191 pname, shortpath (NULL, clean_filename), sys_errlist[errno]);
4192
4193 close (clean_file);
4194 }
4195 #endif /* 0 */
4196
4197 /* Do a simplified scan of the input looking for things that were not
4198 mentioned in the aux info files because of the fact that they were
4199 in a region of the source which was preprocessed-out (via #if or
4200 via #ifdef). */
4201
4202 scan_for_missed_items (file_p);
4203
4204 /* Setup to do line-oriented forward seeking in the clean text buffer. */
4205
4206 last_known_line_number = 1;
4207 last_known_line_start = clean_text_base;
4208
4209 /* Now get down to business and make all of the necessary edits. */
4210
4211 {
4212 const def_dec_info *def_dec_p;
4213
4214 first_definition_in_file = 1;
4215 def_dec_p = file_p->defs_decs;
4216 for (; def_dec_p; def_dec_p = def_dec_p->next_in_file)
4217 {
4218 const char *clean_text_p = seek_to_line (def_dec_p->line);
4219
4220 /* clean_text_p now points to the first character of the line which
4221 contains the `terminator' for the declaration or definition that
4222 we are about to process. */
4223
4224 #ifndef UNPROTOIZE
4225
4226 if (global_flag && def_dec_p->is_func_def && first_definition_in_file)
4227 {
4228 add_global_decls (def_dec_p->file, clean_text_p);
4229 first_definition_in_file = 0;
4230 }
4231
4232 /* Don't edit this item if it is already in prototype format or if it
4233 is a function declaration and we have found no corresponding
4234 definition. */
4235
4236 if (def_dec_p->prototyped
4237 || (!def_dec_p->is_func_def && !def_dec_p->definition))
4238 continue;
4239
4240 #endif /* !defined (UNPROTOIZE) */
4241
4242 if (def_dec_p->is_func_def)
4243 edit_fn_definition (def_dec_p, clean_text_p);
4244 else
4245 #ifndef UNPROTOIZE
4246 if (def_dec_p->is_implicit)
4247 add_local_decl (def_dec_p, clean_text_p);
4248 else
4249 #endif /* !defined (UNPROTOIZE) */
4250 edit_fn_declaration (def_dec_p, clean_text_p);
4251 }
4252 }
4253
4254 /* Finalize things. Output the last trailing part of the original text. */
4255
4256 output_up_to (clean_text_limit - 1);
4257
4258 /* If this is just a test run, stop now and just deallocate the buffers. */
4259
4260 if (nochange_flag)
4261 {
4262 free (new_orig_text_base);
4263 free (new_clean_text_base);
4264 free (repl_text_base);
4265 return;
4266 }
4267
4268 /* Change the name of the original input file. This is just a quick way of
4269 saving the original file. */
4270
4271 if (!nosave_flag)
4272 {
4273 char *new_filename =
4274 (char *) xmalloc (strlen (convert_filename) + strlen (save_suffix) + 2);
4275
4276 strcpy (new_filename, convert_filename);
4277 strcat (new_filename, save_suffix);
4278 if (my_link (convert_filename, new_filename) == -1)
4279 {
4280 if (errno == EEXIST)
4281 {
4282 if (!quiet_flag)
4283 fprintf (stderr, "%s: warning: file `%s' already saved in `%s'\n",
4284 pname,
4285 shortpath (NULL, convert_filename),
4286 shortpath (NULL, new_filename));
4287 }
4288 else
4289 {
4290 fprintf (stderr, "%s: can't link file `%s' to `%s': %s\n",
4291 pname,
4292 shortpath (NULL, convert_filename),
4293 shortpath (NULL, new_filename),
4294 sys_errlist[errno]);
4295 return;
4296 }
4297 }
4298 }
4299
4300 if (my_unlink (convert_filename) == -1)
4301 {
4302 fprintf (stderr, "%s: can't delete file `%s': %s\n",
4303 pname, shortpath (NULL, convert_filename), sys_errlist[errno]);
4304 return;
4305 }
4306
4307 {
4308 int output_file;
4309
4310 /* Open (and create) the output file. */
4311
4312 if ((output_file = creat (convert_filename, 0666)) == -1)
4313 {
4314 fprintf (stderr, "%s: can't create/open output file `%s': %s\n",
4315 pname, shortpath (NULL, convert_filename),
4316 sys_errlist[errno]);
4317 return;
4318 }
4319
4320 /* Write the output file. */
4321
4322 {
4323 unsigned int out_size = (repl_write_ptr + 1) - repl_text_base;
4324
4325 if (write (output_file, repl_text_base, out_size) != out_size)
4326 fprintf (stderr, "%s: error writing file `%s': %s\n",
4327 pname, shortpath (NULL, convert_filename),
4328 sys_errlist[errno]);
4329 }
4330
4331 close (output_file);
4332 }
4333
4334 /* Deallocate the conversion buffers. */
4335
4336 free (new_orig_text_base);
4337 free (new_clean_text_base);
4338 free (repl_text_base);
4339
4340 /* Change the mode of the output file to match the original file. */
4341
4342 /* The cast avoids an erroneous warning on AIX. */
4343 if (my_chmod ((char *)convert_filename, stat_buf.st_mode) == -1)
4344 fprintf (stderr, "%s: can't change mode of file `%s': %s\n",
4345 pname, shortpath (NULL, convert_filename), sys_errlist[errno]);
4346
4347 /* Note: We would try to change the owner and group of the output file
4348 to match those of the input file here, except that may not be a good
4349 thing to do because it might be misleading. Also, it might not even
4350 be possible to do that (on BSD systems with quotas for instance). */
4351 }
4352
4353 /* Do all of the individual steps needed to do the protoization (or
4354 unprotoization) of the files referenced in the aux_info files given
4355 in the command line. */
4356
4357 static void
4358 do_processing ()
4359 {
4360 const char * const *base_pp;
4361 const char * const * const end_pps
4362 = &base_source_filenames[n_base_source_files];
4363
4364 #ifndef UNPROTOIZE
4365 int syscalls_len;
4366 #endif /* !defined (UNPROTOIZE) */
4367
4368 /* One-by-one, check (and create if necessary), open, and read all of the
4369 stuff in each aux_info file. After reading each aux_info file, the
4370 aux_info_file just read will be automatically deleted unless the
4371 keep_flag is set. */
4372
4373 for (base_pp = base_source_filenames; base_pp < end_pps; base_pp++)
4374 process_aux_info_file (*base_pp, keep_flag, 0);
4375
4376 #ifndef UNPROTOIZE
4377
4378 /* Also open and read the special SYSCALLS.c aux_info file which gives us
4379 the prototypes for all of the standard system-supplied functions. */
4380
4381 if (nondefault_syscalls_dir)
4382 {
4383 syscalls_absolute_filename
4384 = (char *) xmalloc (strlen (nondefault_syscalls_dir)
4385 + sizeof (syscalls_filename) + 1);
4386 strcpy (syscalls_absolute_filename, nondefault_syscalls_dir);
4387 }
4388 else
4389 {
4390 syscalls_absolute_filename
4391 = (char *) xmalloc (strlen (default_syscalls_dir)
4392 + sizeof (syscalls_filename) + 1);
4393 strcpy (syscalls_absolute_filename, default_syscalls_dir);
4394 }
4395
4396 syscalls_len = strlen (syscalls_absolute_filename);
4397 if (*(syscalls_absolute_filename + syscalls_len - 1) != '/')
4398 {
4399 *(syscalls_absolute_filename + syscalls_len++) = '/';
4400 *(syscalls_absolute_filename + syscalls_len) = '\0';
4401 }
4402 strcat (syscalls_absolute_filename, syscalls_filename);
4403
4404 /* Call process_aux_info_file in such a way that it does not try to
4405 delete the SYSCALLS aux_info file. */
4406
4407 process_aux_info_file (syscalls_absolute_filename, 1, 1);
4408
4409 #endif /* !defined (UNPROTOIZE) */
4410
4411 /* When we first read in all of the information from the aux_info files
4412 we saved in it descending line number order, because that was likely to
4413 be faster. Now however, we want the chains of def & dec records to
4414 appear in ascending line number order as we get further away from the
4415 file_info record that they hang from. The following line causes all of
4416 these lists to be rearranged into ascending line number order. */
4417
4418 visit_each_hash_node (filename_primary, reverse_def_dec_list);
4419
4420 #ifndef UNPROTOIZE
4421
4422 /* Now do the "real" work. The following line causes each declaration record
4423 to be "visited". For each of these nodes, an attempt is made to match
4424 up the function declaration with a corresponding function definition,
4425 which should have a full prototype-format formals list with it. Once
4426 these match-ups are made, the conversion of the function declarations
4427 to prototype format can be made. */
4428
4429 visit_each_hash_node (function_name_primary, connect_defs_and_decs);
4430
4431 #endif /* !defined (UNPROTOIZE) */
4432
4433 /* Now convert each file that can be converted (and needs to be). */
4434
4435 visit_each_hash_node (filename_primary, edit_file);
4436
4437 #ifndef UNPROTOIZE
4438
4439 /* If we are working in cplusplus mode, try to rename all .c files to .C
4440 files. Don't panic if some of the renames don't work. */
4441
4442 if (cplusplus_flag && !nochange_flag)
4443 visit_each_hash_node (filename_primary, rename_c_file);
4444
4445 #endif /* !defined (UNPROTOIZE) */
4446 }
4447 \f
4448 static struct option longopts[] =
4449 {
4450 {"version", 0, 0, 'V'},
4451 {"file_name", 0, 0, 'p'},
4452 {"quiet", 0, 0, 'q'},
4453 {"silent", 0, 0, 'q'},
4454 {"force", 0, 0, 'f'},
4455 {"keep", 0, 0, 'k'},
4456 {"nosave", 0, 0, 'N'},
4457 {"nochange", 0, 0, 'n'},
4458 {"compiler-options", 1, 0, 'c'},
4459 {"exclude", 1, 0, 'x'},
4460 {"directory", 1, 0, 'd'},
4461 #ifdef UNPROTOIZE
4462 {"indent", 1, 0, 'i'},
4463 #else
4464 {"local", 0, 0, 'l'},
4465 {"global", 0, 0, 'g'},
4466 {"c++", 0, 0, 'C'},
4467 {"syscalls-dir", 1, 0, 'B'},
4468 #endif
4469 {0, 0, 0, 0}
4470 };
4471
4472 int
4473 main (argc, argv)
4474 int argc;
4475 char **const argv;
4476 {
4477 int longind;
4478 int c;
4479 const char *params = "";
4480
4481 pname = rindex (argv[0], '/');
4482 pname = pname ? pname+1 : argv[0];
4483
4484 cwd_buffer = getpwd ();
4485 if (!cwd_buffer)
4486 {
4487 fprintf (stderr, "%s: cannot get working directory: %s\n",
4488 pname, sys_errlist[errno]);
4489 exit (1);
4490 }
4491
4492 /* By default, convert the files in the current directory. */
4493 directory_list = string_list_cons (cwd_buffer, NULL);
4494
4495 while ((c = getopt_long (argc, argv,
4496 #ifdef UNPROTOIZE
4497 "c:d:i:knNp:qvVx:",
4498 #else
4499 "B:c:Cd:gklnNp:qvVx:",
4500 #endif
4501 longopts, &longind)) != EOF)
4502 {
4503 if (c == 0) /* Long option. */
4504 c = longopts[longind].val;
4505 switch (c)
4506 {
4507 case 'p':
4508 compiler_file_name = optarg;
4509 break;
4510 case 'd':
4511 directory_list
4512 = string_list_cons (abspath (NULL, optarg), directory_list);
4513 break;
4514 case 'x':
4515 exclude_list = string_list_cons (optarg, exclude_list);
4516 break;
4517
4518 case 'v':
4519 case 'V':
4520 version_flag = 1;
4521 break;
4522 case 'q':
4523 quiet_flag = 1;
4524 break;
4525 #if 0
4526 case 'f':
4527 force_flag = 1;
4528 break;
4529 #endif
4530 case 'n':
4531 nochange_flag = 1;
4532 keep_flag = 1;
4533 break;
4534 case 'N':
4535 nosave_flag = 1;
4536 break;
4537 case 'k':
4538 keep_flag = 1;
4539 break;
4540 case 'c':
4541 params = optarg;
4542 break;
4543 #ifdef UNPROTOIZE
4544 case 'i':
4545 indent_string = optarg;
4546 break;
4547 #else /* !defined (UNPROTOIZE) */
4548 case 'l':
4549 local_flag = 1;
4550 break;
4551 case 'g':
4552 global_flag = 1;
4553 break;
4554 case 'C':
4555 cplusplus_flag = 1;
4556 break;
4557 case 'B':
4558 nondefault_syscalls_dir = optarg;
4559 break;
4560 #endif /* !defined (UNPROTOIZE) */
4561 default:
4562 usage ();
4563 }
4564 }
4565
4566 /* Set up compile_params based on -p and -c options. */
4567 munge_compile_params (params);
4568
4569 n_base_source_files = argc - optind;
4570
4571 /* Now actually make a list of the base source filenames. */
4572
4573 base_source_filenames =
4574 (const char **) xmalloc ((n_base_source_files + 1) * sizeof (char *));
4575 n_base_source_files = 0;
4576 for (; optind < argc; optind++)
4577 {
4578 const char *path = abspath (NULL, argv[optind]);
4579 int len = strlen (path);
4580
4581 if (path[len-1] == 'c' && path[len-2] == '.')
4582 base_source_filenames[n_base_source_files++] = path;
4583 else
4584 {
4585 fprintf (stderr, "%s: input file names must have .c suffixes: %s\n",
4586 pname, shortpath (NULL, path));
4587 errors++;
4588 }
4589 }
4590
4591 #ifndef UNPROTOIZE
4592 /* We are only interested in the very first identifier token in the
4593 definition of `va_list', so if there is more junk after that first
4594 identifier token, delete it from the `varargs_style_indicator'. */
4595 {
4596 const char *cp;
4597
4598 for (cp = varargs_style_indicator; isalnum (*cp) || *cp == '_'; cp++)
4599 continue;
4600 if (*cp != 0)
4601 varargs_style_indicator = savestring (varargs_style_indicator,
4602 cp - varargs_style_indicator);
4603 }
4604 #endif /* !defined (UNPROTOIZE) */
4605
4606 if (errors)
4607 usage ();
4608 else
4609 {
4610 if (version_flag)
4611 fprintf (stderr, "%s: %s\n", pname, version_string);
4612 do_processing ();
4613 }
4614 if (errors)
4615 exit (1);
4616 else
4617 exit (0);
4618 return 1;
4619 }
This page took 0.243447 seconds and 5 git commands to generate.