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