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