]> git.ipfire.org Git - thirdparty/gcc.git/blame - libcpp/files.c
* config/microblaze/microblaze.c (microblaze_expand_block_move): Treat
[thirdparty/gcc.git] / libcpp / files.c
CommitLineData
1824e2bd 1/* Part of CPP library. File handling.
fbd26352 2 Copyright (C) 1986-2019 Free Software Foundation, Inc.
2e398cc7 3 Written by Per Bothner, 1994.
4 Based on CCCP program by Paul Rubin, June 1986
5 Adapted to ANSI C, Richard Stallman, Jan 1987
6 Split out of cpplib.c, Zack Weinberg, Oct 1998
1824e2bd 7 Reimplemented, Neil Booth, Jul 2003
2e398cc7 8
9This program is free software; you can redistribute it and/or modify it
10under the terms of the GNU General Public License as published by the
6bc9506f 11Free Software Foundation; either version 3, or (at your option) any
2e398cc7 12later version.
13
14This program is distributed in the hope that it will be useful,
15but WITHOUT ANY WARRANTY; without even the implied warranty of
16MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17GNU General Public License for more details.
18
19You should have received a copy of the GNU General Public License
6bc9506f 20along with this program; see the file COPYING3. If not see
21<http://www.gnu.org/licenses/>. */
2e398cc7 22
23#include "config.h"
24#include "system.h"
2e398cc7 25#include "cpplib.h"
d856c8a6 26#include "internal.h"
4bf559f2 27#include "mkdeps.h"
248dfc42 28#include "obstack.h"
aab5b9fa 29#include "hashtab.h"
9f787687 30#include "md5.h"
1824e2bd 31#include <dirent.h>
c4abf88d 32
1824e2bd 33/* Variable length record files on VMS will have a stat size that includes
34 record control characters that won't be included in the read size. */
35#ifdef VMS
36# define FAB_C_VAR 2 /* variable length records (see Starlet fabdef.h) */
37# define STAT_SIZE_RELIABLE(ST) ((ST).st_fab_rfm != FAB_C_VAR)
38#else
39# define STAT_SIZE_RELIABLE(ST) true
5b1b3ffb 40#endif
41
1824e2bd 42#ifdef __DJGPP__
2dc04f36 43#include <io.h>
1824e2bd 44 /* For DJGPP redirected input is opened in text mode. */
45# define set_stdin_to_binary_mode() \
46 if (! isatty (0)) setmode (0, O_BINARY)
47#else
48# define set_stdin_to_binary_mode() /* Nothing */
49#endif
50
1824e2bd 51/* This structure represents a file searched for by CPP, whether it
52 exists or not. An instance may be pointed to by more than one
47d6df07 53 cpp_file_hash_entry; at present no reference count is kept. */
1824e2bd 54struct _cpp_file
55{
56 /* Filename as given to #include or command line switch. */
57 const char *name;
2fd3b10b 58
1824e2bd 59 /* The full path used to find the file. */
60 const char *path;
23f9d23f 61
1824e2bd 62 /* The full path of the pch file. */
63 const char *pchname;
2e398cc7 64
aab5b9fa 65 /* The file's path with the basename stripped. NULL if it hasn't
66 been calculated yet. */
1824e2bd 67 const char *dir_name;
f51c2148 68
68faebf4 69 /* Chain through all files. */
70 struct _cpp_file *next_file;
d6cf07b1 71
1824e2bd 72 /* The contents of NAME after calling read_file(). */
73 const uchar *buffer;
d6cf07b1 74
d656d07a 75 /* Pointer to the real start of BUFFER. read_file() might increment
76 BUFFER; when freeing, this this pointer must be used instead. */
77 const uchar *buffer_start;
78
1824e2bd 79 /* The macro, if any, preventing re-inclusion. */
80 const cpp_hashnode *cmacro;
2fd3b10b 81
1824e2bd 82 /* The directory in the search path where FILE was found. Used for
83 #include_next and determining whether a header is a system
aab5b9fa 84 header. */
1824e2bd 85 cpp_dir *dir;
d6cf07b1 86
1824e2bd 87 /* As filled in by stat(2) for the file. */
88 struct stat st;
d6cf07b1 89
1824e2bd 90 /* File descriptor. Invalid if -1, otherwise open. */
91 int fd;
d1d8b270 92
1824e2bd 93 /* Zero if this file was successfully opened and stat()-ed,
94 otherwise errno obtained from failure. */
95 int err_no;
2e398cc7 96
1824e2bd 97 /* Number of times the file has been stacked for preprocessing. */
98 unsigned short stack_count;
f8be14ef 99
68faebf4 100 /* If opened with #import or contains #pragma once. */
101 bool once_only;
2e398cc7 102
1824e2bd 103 /* If read() failed before. */
104 bool dont_read;
2e398cc7 105
1824e2bd 106 /* If this file is the main file. */
107 bool main_file;
2e398cc7 108
1824e2bd 109 /* If BUFFER above contains the true contents of the file. */
110 bool buffer_valid;
6adc88f8 111
112 /* If this file is implicitly preincluded. */
113 bool implicit_preinclude;
1824e2bd 114};
34627970 115
1824e2bd 116/* A singly-linked list for all searches for a given file name, with
117 its head pointed to by a slot in FILE_HASH. The file name is what
118 appeared between the quotes in a #include directive; it can be
91c82c20 119 determined implicitly from the hash table location or explicitly
aab5b9fa 120 from FILE->name.
1824e2bd 121
122 FILE is a structure containing details about the file that was
123 found with that search, or details of how the search failed.
124
125 START_DIR is the starting location of the search in the include
126 chain. The current directories for "" includes are also hashed in
aab5b9fa 127 the hash table and therefore unique. Files that are looked up
128 without using a search path, such as absolute filenames and file
129 names from the command line share a special starting directory so
130 they don't cause cache hits with normal include-chain lookups.
1824e2bd 131
132 If START_DIR is NULL then the entry is for a directory, not a file,
133 and the directory is in DIR. Since the starting point in a file
134 lookup chain is never NULL, this means that simple pointer
135 comparisons against START_DIR can be made to determine cache hits
136 in file lookups.
aab5b9fa 137
138 If a cache lookup fails because of e.g. an extra "./" in the path,
139 then nothing will break. It is just less efficient as CPP will
140 have to do more work re-preprocessing the file, and/or comparing
141 its contents against earlier once-only files.
1824e2bd 142*/
47d6df07 143struct cpp_file_hash_entry
1824e2bd 144{
47d6df07 145 struct cpp_file_hash_entry *next;
1824e2bd 146 cpp_dir *start_dir;
be1e7283 147 location_t location;
1824e2bd 148 union
149 {
150 _cpp_file *file;
151 cpp_dir *dir;
152 } u;
153};
154
47d6df07 155/* Number of entries to put in a cpp_file_hash_entry pool. */
64cb8c90 156#define FILE_HASH_POOL_SIZE 127
157
47d6df07 158/* A file hash entry pool. We allocate cpp_file_hash_entry object from
64cb8c90 159 one of these. */
160struct file_hash_entry_pool
161{
162 /* Number of entries used from this pool. */
163 unsigned int file_hash_entries_used;
164 /* Next pool in the chain; used when freeing. */
165 struct file_hash_entry_pool *next;
166 /* The memory pool. */
47d6df07 167 struct cpp_file_hash_entry pool[FILE_HASH_POOL_SIZE];
64cb8c90 168};
169
1824e2bd 170static bool open_file (_cpp_file *file);
efc0d52b 171static bool pch_open_file (cpp_reader *pfile, _cpp_file *file,
172 bool *invalid_pch);
173static bool find_file_in_dir (cpp_reader *pfile, _cpp_file *file,
be1e7283 174 bool *invalid_pch, location_t loc);
e557fc7f 175static bool read_file_guts (cpp_reader *pfile, _cpp_file *file,
be1e7283 176 location_t loc);
e557fc7f 177static bool read_file (cpp_reader *pfile, _cpp_file *file,
be1e7283 178 location_t loc);
e557fc7f 179static bool should_stack_file (cpp_reader *, _cpp_file *file, bool import,
be1e7283 180 location_t loc);
1824e2bd 181static struct cpp_dir *search_path_head (cpp_reader *, const char *fname,
182 int angle_brackets, enum include_type);
183static const char *dir_name_of_file (_cpp_file *file);
e557fc7f 184static void open_file_failed (cpp_reader *pfile, _cpp_file *file, int,
be1e7283 185 location_t);
47d6df07 186static struct cpp_file_hash_entry *search_cache (struct cpp_file_hash_entry *head,
1824e2bd 187 const cpp_dir *start_dir);
188static _cpp_file *make_cpp_file (cpp_reader *, cpp_dir *, const char *fname);
461ea98d 189static void destroy_cpp_file (_cpp_file *);
1824e2bd 190static cpp_dir *make_cpp_dir (cpp_reader *, const char *dir_name, int sysp);
191static void allocate_file_hash_entries (cpp_reader *pfile);
47d6df07 192static struct cpp_file_hash_entry *new_file_hash_entry (cpp_reader *pfile);
1824e2bd 193static int report_missing_guard (void **slot, void *b);
aaf491c2 194static hashval_t file_hash_hash (const void *p);
195static int file_hash_eq (const void *p, const void *q);
1824e2bd 196static char *read_filename_string (int ch, FILE *f);
197static void read_name_map (cpp_dir *dir);
198static char *remap_filename (cpp_reader *pfile, _cpp_file *file);
199static char *append_file_to_dir (const char *fname, cpp_dir *dir);
200static bool validate_pch (cpp_reader *, _cpp_file *file, const char *pchname);
9f787687 201static int pchf_save_compare (const void *e1, const void *e2);
202static int pchf_compare (const void *d_p, const void *e_p);
203static bool check_file_against_entries (cpp_reader *, _cpp_file *, bool);
1824e2bd 204
205/* Given a filename in FILE->PATH, with the empty string interpreted
206 as <stdin>, open it.
207
208 On success FILE contains an open file descriptor and stat
209 information for the file. On failure the file descriptor is -1 and
210 the appropriate errno is also stored in FILE. Returns TRUE iff
211 successful.
212
213 We used to open files in nonblocking mode, but that caused more
214 problems than it solved. Do take care not to acquire a controlling
215 terminal by mistake (this can't happen on sane systems, but
216 paranoia is a virtue).
217
218 Use the three-argument form of open even though we aren't
219 specifying O_CREAT, to defend against broken system headers.
220
221 O_BINARY tells some runtime libraries (notably DJGPP) not to do
222 newline translation; we can handle DOS line breaks just fine
223 ourselves. */
224static bool
225open_file (_cpp_file *file)
226{
227 if (file->path[0] == '\0')
9b2d6e29 228 {
229 file->fd = 0;
1824e2bd 230 set_stdin_to_binary_mode ();
9b2d6e29 231 }
e2f9a79f 232 else
1824e2bd 233 file->fd = open (file->path, O_RDONLY | O_NOCTTY | O_BINARY, 0666);
76e5465a 234
1824e2bd 235 if (file->fd != -1)
f8be14ef 236 {
1824e2bd 237 if (fstat (file->fd, &file->st) == 0)
238 {
239 if (!S_ISDIR (file->st.st_mode))
240 {
241 file->err_no = 0;
242 return true;
243 }
244
245 /* Ignore a directory and continue the search. The file we're
246 looking for may be elsewhere in the search path. */
247 errno = ENOENT;
248 }
774cb7b5 249
774cb7b5 250 close (file->fd);
251 file->fd = -1;
f8be14ef 252 }
be21d64c 253#if defined(_WIN32) && !defined(__CYGWIN__)
254 else if (errno == EACCES)
255 {
256 /* On most UNIX systems, open succeeds on a directory. Above,
257 we check if we have opened a directory and if so, set errno
258 to ENOENT. However, on Windows, opening a directory
909dc303 259 fails with EACCES. We want to return ENOENT in that
be21d64c 260 case too. */
261 if (stat (file->path, &file->st) == 0
262 && S_ISDIR (file->st.st_mode))
263 errno = ENOENT;
7d6f49d6 264 else
265 /* The call to stat may have reset errno. */
909dc303 266 errno = EACCES;
be21d64c 267 }
268#endif
b4aa7d78 269 else if (errno == ENOTDIR)
270 errno = ENOENT;
76e5465a 271
9b0ccbbb 272 file->err_no = errno;
1824e2bd 273
274 return false;
76e5465a 275}
276
efc0d52b 277/* Temporary PCH intercept of opening a file. Try to find a PCH file
278 based on FILE->name and FILE->dir, and test those found for
279 validity using PFILE->cb.valid_pch. Return true iff a valid file is
280 found. Set *INVALID_PCH if a PCH file is found but wasn't valid. */
281
1824e2bd 282static bool
efc0d52b 283pch_open_file (cpp_reader *pfile, _cpp_file *file, bool *invalid_pch)
573aba85 284{
1824e2bd 285 static const char extension[] = ".gch";
286 const char *path = file->path;
287 size_t len, flen;
288 char *pchname;
289 struct stat st;
290 bool valid = false;
291
292 /* No PCH on <stdin> or if not requested. */
293 if (file->name[0] == '\0' || !pfile->cb.valid_pch)
294 return false;
573aba85 295
fa12a6a5 296 /* If the file is not included as first include from either the toplevel
297 file or the command-line it is not a valid use of PCH. */
2c8df1f3 298 for (_cpp_file *f = pfile->all_files; f; f = f->next_file)
299 if (f->implicit_preinclude)
300 continue;
301 else if (f->main_file)
302 break;
303 else
304 return false;
fa12a6a5 305
1824e2bd 306 flen = strlen (path);
307 len = flen + sizeof (extension);
720aca92 308 pchname = XNEWVEC (char, len);
1824e2bd 309 memcpy (pchname, path, flen);
310 memcpy (pchname + flen, extension, sizeof (extension));
573aba85 311
1824e2bd 312 if (stat (pchname, &st) == 0)
573aba85 313 {
1824e2bd 314 DIR *pchdir;
315 struct dirent *d;
316 size_t dlen, plen = len;
317
318 if (!S_ISDIR (st.st_mode))
319 valid = validate_pch (pfile, file, pchname);
320 else if ((pchdir = opendir (pchname)) != NULL)
573aba85 321 {
1824e2bd 322 pchname[plen - 1] = '/';
323 while ((d = readdir (pchdir)) != NULL)
c434890f 324 {
1824e2bd 325 dlen = strlen (d->d_name) + 1;
25a6091d 326 if ((strcmp (d->d_name, ".") == 0)
327 || (strcmp (d->d_name, "..") == 0))
328 continue;
1824e2bd 329 if (dlen + plen > len)
573aba85 330 {
1824e2bd 331 len += dlen + 64;
720aca92 332 pchname = XRESIZEVEC (char, pchname, len);
573aba85 333 }
1824e2bd 334 memcpy (pchname + plen, d->d_name, dlen);
335 valid = validate_pch (pfile, file, pchname);
336 if (valid)
c434890f 337 break;
573aba85 338 }
1824e2bd 339 closedir (pchdir);
573aba85 340 }
f2225b1a 341 if (!valid)
c24dc164 342 *invalid_pch = true;
573aba85 343 }
c434890f 344
1824e2bd 345 if (valid)
346 file->pchname = pchname;
347 else
348 free (pchname);
349
350 return valid;
573aba85 351}
352
47b6a3fe 353/* Canonicalize the path to FILE. Return the canonical form if it is
354 shorter, otherwise return NULL. This function does NOT free the
355 memory pointed by FILE. */
356
357static char *
358maybe_shorter_path (const char * file)
359{
360 char * file2 = lrealpath (file);
361 if (file2 && strlen (file2) < strlen (file))
362 {
363 return file2;
364 }
365 else
366 {
367 free (file2);
368 return NULL;
369 }
370}
371
1824e2bd 372/* Try to open the path FILE->name appended to FILE->dir. This is
0d0bca5f 373 where remap and PCH intercept the file lookup process. Return true
57ba96e9 374 if the file was found, whether or not the open was successful.
e557fc7f 375 Set *INVALID_PCH to true if a PCH file is found but wasn't valid.
376 Use LOC when emitting any diagnostics. */
efc0d52b 377
eff7e27f 378static bool
e557fc7f 379find_file_in_dir (cpp_reader *pfile, _cpp_file *file, bool *invalid_pch,
be1e7283 380 location_t loc)
76e5465a 381{
1824e2bd 382 char *path;
6a162321 383
1824e2bd 384 if (CPP_OPTION (pfile, remap) && (path = remap_filename (pfile, file)))
385 ;
386 else
065e625b 387 if (file->dir->construct)
388 path = file->dir->construct (file->name, file->dir);
389 else
390 path = append_file_to_dir (file->name, file->dir);
eff7e27f 391
065e625b 392 if (path)
393 {
47b6a3fe 394 hashval_t hv;
248dfc42 395 char *copy;
396 void **pp;
397
1c9b820a 398 /* We try to canonicalize system headers. For DOS based file
399 * system, we always try to shorten non-system headers, as DOS
400 * has a tighter constraint on max path length. */
0ac81b0e 401 if ((CPP_OPTION (pfile, canonical_system_headers) && file->dir->sysp)
1c9b820a 402#ifdef HAVE_DOS_BASED_FILE_SYSTEM
403 || !file->dir->sysp
404#endif
405 )
47b6a3fe 406 {
407 char * canonical_path = maybe_shorter_path (path);
408 if (canonical_path)
409 {
410 /* The canonical path was newly allocated. Let's free the
411 non-canonical one. */
412 free (path);
413 path = canonical_path;
414 }
415 }
416
417 hv = htab_hash_string (path);
248dfc42 418 if (htab_find_with_hash (pfile->nonexistent_file_hash, path, hv) != NULL)
419 {
420 file->err_no = ENOENT;
421 return false;
422 }
423
065e625b 424 file->path = path;
425 if (pch_open_file (pfile, file, invalid_pch))
426 return true;
6a162321 427
065e625b 428 if (open_file (file))
429 return true;
430
431 if (file->err_no != ENOENT)
432 {
e557fc7f 433 open_file_failed (pfile, file, 0, loc);
065e625b 434 return true;
435 }
436
248dfc42 437 /* We copy the path name onto an obstack partly so that we don't
438 leak the memory, but mostly so that we don't fragment the
439 heap. */
723ebaea 440 copy = (char *) obstack_copy0 (&pfile->nonexistent_file_ob, path,
441 strlen (path));
065e625b 442 free (path);
248dfc42 443 pp = htab_find_slot_with_hash (pfile->nonexistent_file_hash,
444 copy, hv, INSERT);
445 *pp = copy;
446
065e625b 447 file->path = file->name;
448 }
449 else
450 {
451 file->err_no = ENOENT;
452 file->path = NULL;
453 }
454
455 return false;
456}
6a162321 457
5adb4def 458/* Return true iff the missing_header callback found the given HEADER. */
065e625b 459static bool
460search_path_exhausted (cpp_reader *pfile, const char *header, _cpp_file *file)
461{
462 missing_header_cb func = pfile->cb.missing_header;
463
464 /* When the regular search path doesn't work, try context dependent
465 headers search paths. */
466 if (func
467 && file->dir == NULL)
0d0bca5f 468 {
d6c39c7a 469 if ((file->path = func (pfile, header, &file->dir)) != NULL)
065e625b 470 {
471 if (open_file (file))
472 return true;
473 free ((void *)file->path);
474 }
475 file->path = file->name;
0d0bca5f 476 }
477
1824e2bd 478 return false;
479}
480
64386834 481bool
482_cpp_find_failed (_cpp_file *file)
483{
484 return file->err_no != 0;
485}
486
1824e2bd 487/* Given a filename FNAME search for such a file in the include path
488 starting from START_DIR. If FNAME is the empty string it is
7bd28bba 489 interpreted as STDIN if START_DIR is PFILE->no_search_path.
1824e2bd 490
491 If the file is not found in the file cache fall back to the O/S and
492 add the result to our cache.
493
494 If the file was not found in the filesystem, or there was an error
abeb157a 495 opening it, then ERR_NO is nonzero and FD is -1. If the file was
1824e2bd 496 found, then ERR_NO is zero and FD could be -1 or an open file
497 descriptor. FD can be -1 if the file was found in the cache and
498 had previously been closed. To open it again pass the return value
499 to open_file().
6adc88f8 500
501 If IMPLICIT_PREINCLUDE then it is OK for the file to be missing.
502 If present, it is OK for a precompiled header to be included after
503 it.
e557fc7f 504
505 Use LOC as the location for any errors. */
506
64386834 507_cpp_file *
6adc88f8 508_cpp_find_file (cpp_reader *pfile, const char *fname, cpp_dir *start_dir,
e557fc7f 509 bool fake, int angle_brackets, bool implicit_preinclude,
be1e7283 510 location_t loc)
1824e2bd 511{
47d6df07 512 struct cpp_file_hash_entry *entry;
cde9343a 513 void **hash_slot;
1824e2bd 514 _cpp_file *file;
efc0d52b 515 bool invalid_pch = false;
248dfc42 516 bool saw_bracket_include = false;
517 bool saw_quote_include = false;
518 struct cpp_dir *found_in_cache = NULL;
1824e2bd 519
520 /* Ensure we get no confusion between cached files and directories. */
521 if (start_dir == NULL)
e557fc7f 522 cpp_error_at (pfile, CPP_DL_ICE, loc, "NULL directory in find_file");
1824e2bd 523
cde9343a 524 hash_slot
525 = htab_find_slot_with_hash (pfile->file_hash, fname,
526 htab_hash_string (fname), INSERT);
573aba85 527
1824e2bd 528 /* First check the cache before we resort to memory allocation. */
47d6df07 529 entry = search_cache ((struct cpp_file_hash_entry *) *hash_slot, start_dir);
1824e2bd 530 if (entry)
531 return entry->u.file;
532
533 file = make_cpp_file (pfile, start_dir, fname);
9cd9799e 534 file->implicit_preinclude
535 = (implicit_preinclude
536 || (pfile->buffer
537 && pfile->buffer->file->implicit_preinclude));
1824e2bd 538
539 /* Try each path in the include chain. */
540 for (; !fake ;)
927c39db 541 {
e557fc7f 542 if (find_file_in_dir (pfile, file, &invalid_pch, loc))
1824e2bd 543 break;
544
0d0bca5f 545 file->dir = file->dir->next;
546 if (file->dir == NULL)
eff7e27f 547 {
065e625b 548 if (search_path_exhausted (pfile, fname, file))
ba841ef8 549 {
550 /* Although this file must not go in the cache, because
551 the file found might depend on things (like the current file)
552 that aren't represented in the cache, it still has to go in
553 the list of all files so that #import works. */
554 file->next_file = pfile->all_files;
555 pfile->all_files = file;
cde9343a 556 if (*hash_slot == NULL)
557 {
558 /* If *hash_slot is NULL, the above htab_find_slot_with_hash
559 call just created the slot, but we aren't going to store
560 there anything, so need to remove the newly created entry.
561 htab_clear_slot requires that it is non-NULL, so store
562 there some non-NULL pointer, htab_clear_slot will
563 overwrite it immediately. */
564 *hash_slot = file;
565 htab_clear_slot (pfile->file_hash, hash_slot);
566 }
ba841ef8 567 return file;
568 }
065e625b 569
efc0d52b 570 if (invalid_pch)
571 {
57ba96e9 572 cpp_error (pfile, CPP_DL_ERROR,
a1497e24 573 "one or more PCH files were found, but they were invalid");
574 if (!cpp_get_options (pfile)->warn_invalid_pch)
57ba96e9 575 cpp_error (pfile, CPP_DL_ERROR,
a1497e24 576 "use -Winvalid-pch for more information");
efc0d52b 577 }
6adc88f8 578 if (implicit_preinclude)
579 {
580 free ((char *) file->name);
581 free (file);
cde9343a 582 if (*hash_slot == NULL)
583 {
584 /* See comment on the above htab_clear_slot call. */
585 *hash_slot = file;
586 htab_clear_slot (pfile->file_hash, hash_slot);
587 }
6adc88f8 588 return NULL;
589 }
590 else
e557fc7f 591 open_file_failed (pfile, file, angle_brackets, loc);
1824e2bd 592 break;
eff7e27f 593 }
68faebf4 594
56845aa6 595 /* Only check the cache for the starting location (done above)
596 and the quote and bracket chain heads because there are no
597 other possible starting points for searches. */
248dfc42 598 if (file->dir == pfile->bracket_include)
599 saw_bracket_include = true;
600 else if (file->dir == pfile->quote_include)
601 saw_quote_include = true;
602 else
56845aa6 603 continue;
4087613d 604
47d6df07 605 entry = search_cache ((struct cpp_file_hash_entry *) *hash_slot, file->dir);
56845aa6 606 if (entry)
248dfc42 607 {
608 found_in_cache = file->dir;
609 break;
610 }
56845aa6 611 }
3eb3f293 612
56845aa6 613 if (entry)
614 {
615 /* Cache for START_DIR too, sharing the _cpp_file structure. */
616 free ((char *) file->name);
617 free (file);
618 file = entry->u.file;
619 }
620 else
621 {
622 /* This is a new file; put it in the list. */
623 file->next_file = pfile->all_files;
624 pfile->all_files = file;
3eb3f293 625 }
626
1824e2bd 627 /* Store this new result in the hash table. */
628 entry = new_file_hash_entry (pfile);
47d6df07 629 entry->next = (struct cpp_file_hash_entry *) *hash_slot;
1824e2bd 630 entry->start_dir = start_dir;
67015c73 631 entry->location = pfile->line_table->highest_location;
1824e2bd 632 entry->u.file = file;
cde9343a 633 *hash_slot = (void *) entry;
eff7e27f 634
248dfc42 635 /* If we passed the quote or bracket chain heads, cache them also.
636 This speeds up processing if there are lots of -I options. */
637 if (saw_bracket_include
638 && pfile->bracket_include != start_dir
639 && found_in_cache != pfile->bracket_include)
640 {
641 entry = new_file_hash_entry (pfile);
47d6df07 642 entry->next = (struct cpp_file_hash_entry *) *hash_slot;
248dfc42 643 entry->start_dir = pfile->bracket_include;
67015c73 644 entry->location = pfile->line_table->highest_location;
248dfc42 645 entry->u.file = file;
cde9343a 646 *hash_slot = (void *) entry;
248dfc42 647 }
648 if (saw_quote_include
649 && pfile->quote_include != start_dir
650 && found_in_cache != pfile->quote_include)
651 {
652 entry = new_file_hash_entry (pfile);
47d6df07 653 entry->next = (struct cpp_file_hash_entry *) *hash_slot;
248dfc42 654 entry->start_dir = pfile->quote_include;
67015c73 655 entry->location = pfile->line_table->highest_location;
248dfc42 656 entry->u.file = file;
cde9343a 657 *hash_slot = (void *) entry;
248dfc42 658 }
659
1824e2bd 660 return file;
76e5465a 661}
662
1824e2bd 663/* Read a file into FILE->buffer, returning true on success.
76e5465a 664
1824e2bd 665 If FILE->fd is something weird, like a block device, we don't want
666 to read it at all. Don't even try to figure out what something is,
667 except for plain files and block devices, since there is no
668 reliable portable way of doing this.
76e5465a 669
e557fc7f 670 Use LOC for any diagnostics.
671
76e5465a 672 FIXME: Flush file cache and try again if we run out of memory. */
1824e2bd 673static bool
be1e7283 674read_file_guts (cpp_reader *pfile, _cpp_file *file, location_t loc)
76e5465a 675{
1824e2bd 676 ssize_t size, total, count;
b6d18b0a 677 uchar *buf;
1824e2bd 678 bool regular;
57ba96e9 679
1824e2bd 680 if (S_ISBLK (file->st.st_mode))
681 {
e557fc7f 682 cpp_error_at (pfile, CPP_DL_ERROR, loc,
683 "%s is a block device", file->path);
1824e2bd 684 return false;
685 }
76e5465a 686
9793dd8e 687 regular = S_ISREG (file->st.st_mode) != 0;
1824e2bd 688 if (regular)
e2f9a79f 689 {
76e5465a 690 /* off_t might have a wider range than ssize_t - in other words,
691 the max size of a file might be bigger than the address
692 space. We can't handle a file that large. (Anyone with
693 a single source file bigger than 2GB needs to rethink
694 their coding style.) Some systems (e.g. AIX 4.1) define
695 SSIZE_MAX to be much smaller than the actual range of the
696 type. Use INTTYPE_MAXIMUM unconditionally to ensure this
697 does not bite us. */
1824e2bd 698 if (file->st.st_size > INTTYPE_MAXIMUM (ssize_t))
e2f9a79f 699 {
e557fc7f 700 cpp_error_at (pfile, CPP_DL_ERROR, loc,
701 "%s is too large", file->path);
1824e2bd 702 return false;
e2f9a79f 703 }
76e5465a 704
1824e2bd 705 size = file->st.st_size;
706 }
707 else
708 /* 8 kilobytes is a sensible starting size. It ought to be bigger
709 than the kernel pipe buffer, and it's definitely bigger than
710 the majority of C source files. */
711 size = 8 * 1024;
712
8e1d1b0c 713 /* The + 16 here is space for the final '\n' and 15 bytes of padding,
714 used to quiet warnings from valgrind or Address Sanitizer, when the
715 optimized lexer accesses aligned 16-byte memory chunks, including
716 the bytes after the malloced, area, and stops lexing on '\n'. */
717 buf = XNEWVEC (uchar, size + 16);
1824e2bd 718 total = 0;
719 while ((count = read (file->fd, buf + total, size - total)) > 0)
720 {
721 total += count;
722
723 if (total == size)
34627970 724 {
1824e2bd 725 if (regular)
726 break;
727 size *= 2;
8e1d1b0c 728 buf = XRESIZEVEC (uchar, buf, size + 16);
34627970 729 }
76e5465a 730 }
1824e2bd 731
732 if (count < 0)
76e5465a 733 {
e557fc7f 734 cpp_errno_filename (pfile, CPP_DL_ERROR, file->path, loc);
15fc692a 735 free (buf);
1824e2bd 736 return false;
76e5465a 737 }
1824e2bd 738
739 if (regular && total != size && STAT_SIZE_RELIABLE (file->st))
e557fc7f 740 cpp_error_at (pfile, CPP_DL_WARNING, loc,
d80d2074 741 "%s is shorter than expected", file->path);
1824e2bd 742
d656d07a 743 file->buffer = _cpp_convert_input (pfile,
744 CPP_OPTION (pfile, input_charset),
8e1d1b0c 745 buf, size + 16, total,
d656d07a 746 &file->buffer_start,
747 &file->st.st_size);
1824e2bd 748 file->buffer_valid = true;
749
750 return true;
751}
752
753/* Convenience wrapper around read_file_guts that opens the file if
91c82c20 754 necessary and closes the file descriptor after reading. FILE must
e557fc7f 755 have been passed through find_file() at some stage. Use LOC for
756 any diagnostics. */
1824e2bd 757static bool
be1e7283 758read_file (cpp_reader *pfile, _cpp_file *file, location_t loc)
1824e2bd 759{
1824e2bd 760 /* If we already have its contents in memory, succeed immediately. */
761 if (file->buffer_valid)
762 return true;
76e5465a 763
1824e2bd 764 /* If an earlier read failed for some reason don't try again. */
765 if (file->dont_read || file->err_no)
766 return false;
435fb09b 767
1824e2bd 768 if (file->fd == -1 && !open_file (file))
769 {
e557fc7f 770 open_file_failed (pfile, file, 0, loc);
1824e2bd 771 return false;
e2f9a79f 772 }
5b1b3ffb 773
e557fc7f 774 file->dont_read = !read_file_guts (pfile, file, loc);
1824e2bd 775 close (file->fd);
776 file->fd = -1;
76e5465a 777
1824e2bd 778 return !file->dont_read;
76e5465a 779}
780
0d0bca5f 781/* Returns TRUE if FILE's contents have been successfully placed in
e557fc7f 782 FILE->buffer and the file should be stacked, otherwise false.
783 Use LOC for any diagnostics. */
1824e2bd 784static bool
e557fc7f 785should_stack_file (cpp_reader *pfile, _cpp_file *file, bool import,
be1e7283 786 location_t loc)
76e5465a 787{
0d0bca5f 788 _cpp_file *f;
1824e2bd 789
68faebf4 790 /* Skip once-only files. */
791 if (file->once_only)
792 return false;
793
57ba96e9 794 /* We must mark the file once-only if #import now, before header
68faebf4 795 guard checks. Otherwise, undefining the header guard might
796 cause the file to be re-stacked. */
797 if (import)
798 {
799 _cpp_mark_file_once_only (pfile, file);
800
801 /* Don't stack files that have been stacked before. */
802 if (file->stack_count)
803 return false;
804 }
805
0d0bca5f 806 /* Skip if the file had a header guard and the macro is defined.
807 PCH relies on this appearing before the PCH handler below. */
793b38da 808 if (file->cmacro && cpp_macro_p (file->cmacro))
aab5b9fa 809 return false;
810
0d0bca5f 811 /* Handle PCH files immediately; don't stack them. */
f2225b1a 812 if (file->pchname)
c95d8aaa 813 {
d718b525 814 pfile->cb.read_pch (pfile, file->pchname, file->fd, file->path);
0d0bca5f 815 file->fd = -1;
f2225b1a 816 free ((void *) file->pchname);
817 file->pchname = NULL;
0d0bca5f 818 return false;
c95d8aaa 819 }
1824e2bd 820
e557fc7f 821 if (!read_file (pfile, file, loc))
1824e2bd 822 return false;
c95d8aaa 823
9f787687 824 /* Check the file against the PCH file. This is done before
825 checking against files we've already seen, since it may save on
826 I/O. */
827 if (check_file_against_entries (pfile, file, import))
828 {
829 /* If this isn't a #import, but yet we can't include the file,
830 that means that it was #import-ed in the PCH file,
831 so we can never include it again. */
832 if (! import)
833 _cpp_mark_file_once_only (pfile, file);
834 return false;
835 }
836
68faebf4 837 /* Now we've read the file's contents, we can stack it if there
838 are no once-only files. */
839 if (!pfile->seen_once_only)
0d0bca5f 840 return true;
841
68faebf4 842 /* We may have read the file under a different name. Look
1824e2bd 843 for likely candidates and compare file contents to be sure. */
68faebf4 844 for (f = pfile->all_files; f; f = f->next_file)
1824e2bd 845 {
846 if (f == file)
847 continue;
848
68faebf4 849 if ((import || f->once_only)
850 && f->err_no == 0
1824e2bd 851 && f->st.st_mtime == file->st.st_mtime
461ea98d 852 && f->st.st_size == file->st.st_size)
853 {
854 _cpp_file *ref_file;
855 bool same_file_p = false;
856
857 if (f->buffer && !f->buffer_valid)
858 {
859 /* We already have a buffer but it is not valid, because
860 the file is still stacked. Make a new one. */
861 ref_file = make_cpp_file (pfile, f->dir, f->name);
862 ref_file->path = f->path;
863 }
864 else
865 /* The file is not stacked anymore. We can reuse it. */
866 ref_file = f;
867
e557fc7f 868 same_file_p = read_file (pfile, ref_file, loc)
461ea98d 869 /* Size might have changed in read_file(). */
870 && ref_file->st.st_size == file->st.st_size
871 && !memcmp (ref_file->buffer,
872 file->buffer,
873 file->st.st_size);
874
875 if (f->buffer && !f->buffer_valid)
876 {
877 ref_file->path = 0;
878 destroy_cpp_file (ref_file);
879 }
880
881 if (same_file_p)
882 break;
883 }
7dd5e644 884 }
1824e2bd 885
0d0bca5f 886 return f == NULL;
887}
888
889/* Place the file referenced by FILE into a new buffer on the buffer
890 stack if possible. IMPORT is true if this stacking attempt is
891 because of a #import directive. Returns true if a buffer is
e557fc7f 892 stacked. Use LOC for any diagnostics. */
64386834 893bool
e557fc7f 894_cpp_stack_file (cpp_reader *pfile, _cpp_file *file, bool import,
be1e7283 895 location_t loc)
0d0bca5f 896{
897 cpp_buffer *buffer;
898 int sysp;
899
e557fc7f 900 if (!should_stack_file (pfile, file, import, loc))
bd4387c4 901 return false;
0d0bca5f 902
610625e3 903 if (pfile->buffer == NULL || file->dir == NULL)
904 sysp = 0;
905 else
906 sysp = MAX (pfile->buffer->sysp, file->dir->sysp);
0d0bca5f 907
908 /* Add the file to the dependencies on its first inclusion. */
909 if (CPP_OPTION (pfile, deps.style) > !!sysp && !file->stack_count)
910 {
911 if (!file->main_file || !CPP_OPTION (pfile, deps.ignore_main_file))
912 deps_add_dep (pfile->deps, file->path);
913 }
914
915 /* Clear buffer_valid since _cpp_clean_line messes it up. */
916 file->buffer_valid = false;
917 file->stack_count++;
918
919 /* Stack the buffer. */
920 buffer = cpp_push_buffer (pfile, file->buffer, file->st.st_size,
fcde64dc 921 CPP_OPTION (pfile, preprocessed)
922 && !CPP_OPTION (pfile, directives_only));
0d0bca5f 923 buffer->file = file;
610625e3 924 buffer->sysp = sysp;
914db4b7 925 buffer->to_free = file->buffer_start;
0d0bca5f 926
927 /* Initialize controlling macro state. */
928 pfile->mi_valid = true;
929 pfile->mi_cmacro = 0;
930
931 /* Generate the call back. */
dff96659 932 _cpp_do_file_change (pfile, LC_ENTER, file->path, 1, sysp);
0d0bca5f 933
934 return true;
2e398cc7 935}
936
68faebf4 937/* Mark FILE to be included once only. */
1824e2bd 938void
68faebf4 939_cpp_mark_file_once_only (cpp_reader *pfile, _cpp_file *file)
e2f9a79f 940{
68faebf4 941 pfile->seen_once_only = true;
942 file->once_only = true;
1824e2bd 943}
944
945/* Return the directory from which searching for FNAME should start,
f024691d 946 considering the directive TYPE and ANGLE_BRACKETS. If there is
1824e2bd 947 nothing left in the path, returns NULL. */
948static struct cpp_dir *
949search_path_head (cpp_reader *pfile, const char *fname, int angle_brackets,
950 enum include_type type)
951{
952 cpp_dir *dir;
953 _cpp_file *file;
58efbd5a 954
a5c088d4 955 if (IS_ABSOLUTE_PATH (fname))
1824e2bd 956 return &pfile->no_search_path;
957
64386834 958 /* pfile->buffer is NULL when processing an -include command-line flag. */
959 file = pfile->buffer == NULL ? pfile->main_file : pfile->buffer->file;
a00bb681 960
961 /* For #include_next, skip in the search path past the dir in which
a910aa9d 962 the current file was found, but if it was found via an absolute
963 path use the normal search logic. */
bce619a6 964 if (type == IT_INCLUDE_NEXT && file->dir
965 && file->dir != &pfile->no_search_path)
1824e2bd 966 dir = file->dir->next;
58efbd5a 967 else if (angle_brackets)
1824e2bd 968 dir = pfile->bracket_include;
969 else if (type == IT_CMDLINE)
970 /* -include and -imacros use the #include "" chain with the
971 preprocessor's cwd prepended. */
972 return make_cpp_dir (pfile, "./", false);
973 else if (pfile->quote_ignores_source_dir)
974 dir = pfile->quote_include;
a00bb681 975 else
610625e3 976 return make_cpp_dir (pfile, dir_name_of_file (file),
977 pfile->buffer ? pfile->buffer->sysp : 0);
1824e2bd 978
979 if (dir == NULL)
d80d2074 980 cpp_error (pfile, CPP_DL_ERROR,
1824e2bd 981 "no include path in which to search for %s", fname);
982
983 return dir;
984}
a00bb681 985
1824e2bd 986/* Strip the basename from the file's path. It ends with a slash if
abeb157a 987 of nonzero length. Note that this procedure also works for
1824e2bd 988 <stdin>, which is represented by the empty string. */
989static const char *
990dir_name_of_file (_cpp_file *file)
991{
992 if (!file->dir_name)
a00bb681 993 {
1824e2bd 994 size_t len = lbasename (file->path) - file->path;
720aca92 995 char *dir_name = XNEWVEC (char, len + 1);
1824e2bd 996
997 memcpy (dir_name, file->path, len);
998 dir_name[len] = '\0';
999 file->dir_name = dir_name;
a00bb681 1000 }
1001
1824e2bd 1002 return file->dir_name;
1003}
1004
1824e2bd 1005/* Handles #include-family directives (distinguished by TYPE),
1006 including HEADER, and the command line -imacros and -include.
1007 Returns true if a buffer was stacked. */
1008bool
1009_cpp_stack_include (cpp_reader *pfile, const char *fname, int angle_brackets,
be1e7283 1010 enum include_type type, location_t loc)
1824e2bd 1011{
1012 struct cpp_dir *dir;
6e04daf1 1013 _cpp_file *file;
5bd48b2e 1014 bool stacked;
c94fccdf 1015 bool decremented = false;
1824e2bd 1016
2cb897aa 1017 /* For -include command-line flags we have type == IT_CMDLINE.
1018 When the first -include file is processed we have the case, where
1019 pfile->cur_token == pfile->cur_run->base, we are directly called up
1020 by the front end. However in the case of the second -include file,
1021 we are called from _cpp_lex_token -> _cpp_get_fresh_line ->
1022 cpp_push_include, with pfile->cur_token != pfile->cur_run->base,
1023 and pfile->cur_token[-1].src_loc not (yet) initialized.
1024 However, when the include file cannot be found, we need src_loc to
1025 be initialized to some safe value: 0 means UNKNOWN_LOCATION. */
1026 if (type == IT_CMDLINE && pfile->cur_token != pfile->cur_run->base)
1027 pfile->cur_token[-1].src_loc = 0;
1028
1824e2bd 1029 dir = search_path_head (pfile, fname, angle_brackets, type);
1030 if (!dir)
1031 return false;
1032
6adc88f8 1033 file = _cpp_find_file (pfile, fname, dir, false, angle_brackets,
e557fc7f 1034 type == IT_DEFAULT, loc);
6adc88f8 1035 if (type == IT_DEFAULT && file == NULL)
1036 return false;
6e04daf1 1037
5bd48b2e 1038 /* Compensate for the increment in linemap_add that occurs if
c94fccdf 1039 _cpp_stack_file actually stacks the file. In the case of a normal
1040 #include, we're currently at the start of the line *following* the
1041 #include. A separate location_t for this location makes no
1042 sense (until we do the LC_LEAVE), and complicates
1043 LAST_SOURCE_LINE_LOCATION. This does not apply if we found a PCH
1044 file (in which case linemap_add is not called) or we were included
1045 from the command-line. In the case that the #include is the last
1046 line in the file, highest_location still points to the current
1047 line, not the start of the next line, so we do not decrement in
1048 this case. See plugin/location-overflow-test-pr83173.h for an
1049 example. */
6adc88f8 1050 if (file->pchname == NULL && file->err_no == 0
1051 && type != IT_CMDLINE && type != IT_DEFAULT)
c94fccdf 1052 {
1053 int highest_line = linemap_get_expansion_line (pfile->line_table,
1054 pfile->line_table->highest_location);
1055 int source_line = linemap_get_expansion_line (pfile->line_table, loc);
1056 if (highest_line > source_line)
1057 {
1058 pfile->line_table->highest_location--;
1059 decremented = true;
1060 }
1061 }
6e04daf1 1062
e557fc7f 1063 stacked = _cpp_stack_file (pfile, file, type == IT_IMPORT, loc);
5bd48b2e 1064
c94fccdf 1065 if (decremented && !stacked)
5bd48b2e 1066 /* _cpp_stack_file didn't stack the file, so let's rollback the
1067 compensation dance we performed above. */
1068 pfile->line_table->highest_location++;
1069
1070 return stacked;
1824e2bd 1071}
1072
1073/* Could not open FILE. The complication is dependency output. */
1074static void
e557fc7f 1075open_file_failed (cpp_reader *pfile, _cpp_file *file, int angle_brackets,
be1e7283 1076 location_t loc)
1824e2bd 1077{
dbddc569 1078 int sysp = pfile->line_table->highest_line > 1 && pfile->buffer ? pfile->buffer->sysp : 0;
04c0bfd0 1079 bool print_dep = CPP_OPTION (pfile, deps.style) > (angle_brackets || !!sysp);
1824e2bd 1080
f6751ff2 1081 if (pfile->state.in__has_include__)
1082 return;
1083
1824e2bd 1084 errno = file->err_no;
1085 if (print_dep && CPP_OPTION (pfile, deps.missing_files) && errno == ENOENT)
c25f2689 1086 {
1087 deps_add_dep (pfile->deps, file->name);
1088 /* If the preprocessor output (other than dependency information) is
1089 being used, we must also flag an error. */
1090 if (CPP_OPTION (pfile, deps.need_preprocessor_output))
55d11fae 1091 cpp_errno_filename (pfile, CPP_DL_FATAL,
e557fc7f 1092 file->path ? file->path : file->name,
1093 loc);
c25f2689 1094 }
1824e2bd 1095 else
2e398cc7 1096 {
c25f2689 1097 /* If we are not outputting dependencies, or if we are and dependencies
1098 were requested for this file, or if preprocessor output is needed
1099 in addition to dependency information, this is an error.
1100
1101 Otherwise (outputting dependencies but not for this file, and not
1102 using the preprocessor output), we can still produce correct output
1103 so it's only a warning. */
1104 if (CPP_OPTION (pfile, deps.style) == DEPS_NONE
1105 || print_dep
1106 || CPP_OPTION (pfile, deps.need_preprocessor_output))
55d11fae 1107 cpp_errno_filename (pfile, CPP_DL_FATAL,
e557fc7f 1108 file->path ? file->path : file->name,
1109 loc);
c25f2689 1110 else
55d11fae 1111 cpp_errno_filename (pfile, CPP_DL_WARNING,
e557fc7f 1112 file->path ? file->path : file->name,
1113 loc);
2e398cc7 1114 }
1824e2bd 1115}
3ec84a0b 1116
1824e2bd 1117/* Search in the chain beginning at HEAD for a file whose search path
1118 started at START_DIR != NULL. */
47d6df07 1119static struct cpp_file_hash_entry *
1120search_cache (struct cpp_file_hash_entry *head, const cpp_dir *start_dir)
1824e2bd 1121{
56845aa6 1122 while (head && head->start_dir != start_dir)
1123 head = head->next;
1124
1125 return head;
1824e2bd 1126}
1127
1128/* Allocate a new _cpp_file structure. */
1129static _cpp_file *
1130make_cpp_file (cpp_reader *pfile, cpp_dir *dir, const char *fname)
1131{
1132 _cpp_file *file;
1133
720aca92 1134 file = XCNEW (_cpp_file);
1824e2bd 1135 file->main_file = !pfile->buffer;
1136 file->fd = -1;
1137 file->dir = dir;
1138 file->name = xstrdup (fname);
1139
1140 return file;
1141}
1142
461ea98d 1143/* Release a _cpp_file structure. */
1144static void
1145destroy_cpp_file (_cpp_file *file)
1146{
dd045aee 1147 free ((void *) file->buffer_start);
461ea98d 1148 free ((void *) file->name);
c6a7d9e9 1149 free ((void *) file->path);
461ea98d 1150 free (file);
1151}
1152
64cb8c90 1153/* Release all the files allocated by this reader. */
1154static void
1155destroy_all_cpp_files (cpp_reader *pfile)
1156{
1157 _cpp_file *iter = pfile->all_files;
1158 while (iter)
1159 {
1160 _cpp_file *next = iter->next_file;
1161 destroy_cpp_file (iter);
1162 iter = next;
1163 }
1164}
1165
1824e2bd 1166/* A hash of directory names. The directory names are the path names
1167 of files which contain a #include "", the included file name is
1168 appended to this directories.
1169
1170 To avoid duplicate entries we follow the convention that all
1171 non-empty directory names should end in a '/'. DIR_NAME must be
1172 stored in permanently allocated memory. */
1173static cpp_dir *
1174make_cpp_dir (cpp_reader *pfile, const char *dir_name, int sysp)
1175{
47d6df07 1176 struct cpp_file_hash_entry *entry, **hash_slot;
1824e2bd 1177 cpp_dir *dir;
1178
47d6df07 1179 hash_slot = (struct cpp_file_hash_entry **)
821fa045 1180 htab_find_slot_with_hash (pfile->dir_hash, dir_name,
aaf491c2 1181 htab_hash_string (dir_name),
1182 INSERT);
1824e2bd 1183
1184 /* Have we already hashed this directory? */
1185 for (entry = *hash_slot; entry; entry = entry->next)
1186 if (entry->start_dir == NULL)
1187 return entry->u.dir;
1188
720aca92 1189 dir = XCNEW (cpp_dir);
1824e2bd 1190 dir->next = pfile->quote_include;
1191 dir->name = (char *) dir_name;
1192 dir->len = strlen (dir_name);
1193 dir->sysp = sysp;
065e625b 1194 dir->construct = 0;
1824e2bd 1195
1196 /* Store this new result in the hash table. */
1197 entry = new_file_hash_entry (pfile);
1198 entry->next = *hash_slot;
1199 entry->start_dir = NULL;
67015c73 1200 entry->location = pfile->line_table->highest_location;
1824e2bd 1201 entry->u.dir = dir;
1202 *hash_slot = entry;
1203
1204 return dir;
1205}
1206
1207/* Create a new block of memory for file hash entries. */
1208static void
1209allocate_file_hash_entries (cpp_reader *pfile)
1210{
64cb8c90 1211 struct file_hash_entry_pool *pool = XNEW (struct file_hash_entry_pool);
1212 pool->file_hash_entries_used = 0;
1213 pool->next = pfile->file_hash_entries;
1214 pfile->file_hash_entries = pool;
1824e2bd 1215}
1216
1217/* Return a new file hash entry. */
47d6df07 1218static struct cpp_file_hash_entry *
1824e2bd 1219new_file_hash_entry (cpp_reader *pfile)
1220{
64cb8c90 1221 unsigned int idx;
1222 if (pfile->file_hash_entries->file_hash_entries_used == FILE_HASH_POOL_SIZE)
1824e2bd 1223 allocate_file_hash_entries (pfile);
1224
64cb8c90 1225 idx = pfile->file_hash_entries->file_hash_entries_used++;
1226 return &pfile->file_hash_entries->pool[idx];
1227}
1228
1229/* Free the file hash entry pools. */
1230static void
1231free_file_hash_entries (cpp_reader *pfile)
1232{
1233 struct file_hash_entry_pool *iter = pfile->file_hash_entries;
1234 while (iter)
1235 {
1236 struct file_hash_entry_pool *next = iter->next;
1237 free (iter);
1238 iter = next;
1239 }
1824e2bd 1240}
1241
1242/* Returns TRUE if a file FNAME has ever been successfully opened.
1243 This routine is not intended to correctly handle filenames aliased
1244 by links or redundant . or .. traversals etc. */
1245bool
1246cpp_included (cpp_reader *pfile, const char *fname)
1247{
47d6df07 1248 struct cpp_file_hash_entry *entry;
1824e2bd 1249
47d6df07 1250 entry = (struct cpp_file_hash_entry *)
720aca92 1251 htab_find_with_hash (pfile->file_hash, fname, htab_hash_string (fname));
1824e2bd 1252
1253 while (entry && (entry->start_dir == NULL || entry->u.file->err_no))
1254 entry = entry->next;
1255
1256 return entry != NULL;
1257}
1258
67015c73 1259/* Returns TRUE if a file FNAME has ever been successfully opened
1260 before LOCATION. This routine is not intended to correctly handle
1261 filenames aliased by links or redundant . or .. traversals etc. */
1262bool
1263cpp_included_before (cpp_reader *pfile, const char *fname,
be1e7283 1264 location_t location)
67015c73 1265{
5d034e37 1266 struct cpp_file_hash_entry *entry
1267 = (struct cpp_file_hash_entry *)
1268 htab_find_with_hash (pfile->file_hash, fname, htab_hash_string (fname));
67015c73 1269
5d034e37 1270 if (IS_ADHOC_LOC (location))
1271 location = get_location_from_adhoc_loc (pfile->line_table, location);
67015c73 1272
1273 while (entry && (entry->start_dir == NULL || entry->u.file->err_no
1274 || entry->location > location))
1275 entry = entry->next;
1276
1277 return entry != NULL;
1278}
1279
8b332087 1280/* Calculate the hash value of a file hash entry P. */
aaf491c2 1281
1282static hashval_t
1283file_hash_hash (const void *p)
1284{
47d6df07 1285 struct cpp_file_hash_entry *entry = (struct cpp_file_hash_entry *) p;
aaf491c2 1286 const char *hname;
1287 if (entry->start_dir)
1288 hname = entry->u.file->name;
1289 else
1290 hname = entry->u.dir->name;
1291
1292 return htab_hash_string (hname);
1293}
1294
1824e2bd 1295/* Compare a string Q against a file hash entry P. */
1296static int
aaf491c2 1297file_hash_eq (const void *p, const void *q)
1824e2bd 1298{
47d6df07 1299 struct cpp_file_hash_entry *entry = (struct cpp_file_hash_entry *) p;
1824e2bd 1300 const char *fname = (const char *) q;
1301 const char *hname;
1302
1303 if (entry->start_dir)
1304 hname = entry->u.file->name;
1305 else
1306 hname = entry->u.dir->name;
1307
bb7824b5 1308 return filename_cmp (hname, fname) == 0;
1824e2bd 1309}
1310
248dfc42 1311/* Compare entries in the nonexistent file hash table. These are just
1312 strings. */
1313static int
1314nonexistent_file_hash_eq (const void *p, const void *q)
1315{
bb7824b5 1316 return filename_cmp ((const char *) p, (const char *) q) == 0;
248dfc42 1317}
1318
1824e2bd 1319/* Initialize everything in this source file. */
1320void
1321_cpp_init_files (cpp_reader *pfile)
1322{
aaf491c2 1323 pfile->file_hash = htab_create_alloc (127, file_hash_hash, file_hash_eq,
1824e2bd 1324 NULL, xcalloc, free);
821fa045 1325 pfile->dir_hash = htab_create_alloc (127, file_hash_hash, file_hash_eq,
1326 NULL, xcalloc, free);
1824e2bd 1327 allocate_file_hash_entries (pfile);
248dfc42 1328 pfile->nonexistent_file_hash = htab_create_alloc (127, htab_hash_string,
1329 nonexistent_file_hash_eq,
1330 NULL, xcalloc, free);
cc0a8c77 1331 obstack_specify_allocation (&pfile->nonexistent_file_ob, 0, 0,
1332 xmalloc, free);
1824e2bd 1333}
1334
1335/* Finalize everything in this source file. */
1336void
1337_cpp_cleanup_files (cpp_reader *pfile)
1338{
1339 htab_delete (pfile->file_hash);
821fa045 1340 htab_delete (pfile->dir_hash);
248dfc42 1341 htab_delete (pfile->nonexistent_file_hash);
1342 obstack_free (&pfile->nonexistent_file_ob, 0);
64cb8c90 1343 free_file_hash_entries (pfile);
1344 destroy_all_cpp_files (pfile);
1345}
1346
1347/* Make the parser forget about files it has seen. This can be useful
1348 for resetting the parser to start another run. */
1349void
1350cpp_clear_file_cache (cpp_reader *pfile)
1351{
1352 _cpp_cleanup_files (pfile);
1353 pfile->file_hash_entries = NULL;
1354 pfile->all_files = NULL;
1355 _cpp_init_files (pfile);
1824e2bd 1356}
1357
1358/* Enter a file name in the hash for the sake of cpp_included. */
1359void
1360_cpp_fake_include (cpp_reader *pfile, const char *fname)
1361{
e557fc7f 1362 _cpp_find_file (pfile, fname, pfile->buffer->file->dir, true, 0, false, 0);
2e398cc7 1363}
1364
6af24d0a 1365/* Not everyone who wants to set system-header-ness on a buffer can
2fd3b10b 1366 see the details of a buffer. This is an exported interface because
1367 fix-header needs it. */
6af24d0a 1368void
f7fdd7a1 1369cpp_make_system_header (cpp_reader *pfile, int syshdr, int externc)
6af24d0a 1370{
fd944c82 1371 int flags = 0;
dbddc569 1372 const struct line_maps *line_table = pfile->line_table;
551e34da 1373 const line_map_ordinary *map = LINEMAPS_LAST_ORDINARY_MAP (line_table);
fd944c82 1374 /* 1 = system header, 2 = system header to be treated as C. */
1375 if (syshdr)
1376 flags = 1 + (externc != 0);
610625e3 1377 pfile->buffer->sysp = flags;
97bfb9ef 1378 _cpp_do_file_change (pfile, LC_RENAME, ORDINARY_MAP_FILE_NAME (map),
dbddc569 1379 SOURCE_LINE (map, pfile->line_table->highest_line), flags);
6af24d0a 1380}
1381
568139e4 1382/* Allow the client to change the current file. Used by the front end
1383 to achieve pseudo-file names like <built-in>.
1384 If REASON is LC_LEAVE, then NEW_NAME must be NULL. */
9e36e267 1385void
f7fdd7a1 1386cpp_change_file (cpp_reader *pfile, enum lc_reason reason,
1387 const char *new_name)
9e36e267 1388{
568139e4 1389 _cpp_do_file_change (pfile, reason, new_name, 1, 0);
9e36e267 1390}
1391
408c2285 1392struct report_missing_guard_data
1393{
1394 const char **paths;
1395 size_t count;
1396};
1397
1824e2bd 1398/* Callback function for htab_traverse. */
f51c2148 1399static int
408c2285 1400report_missing_guard (void **slot, void *d)
f51c2148 1401{
47d6df07 1402 struct cpp_file_hash_entry *entry = (struct cpp_file_hash_entry *) *slot;
408c2285 1403 struct report_missing_guard_data *data
1404 = (struct report_missing_guard_data *) d;
f51c2148 1405
1824e2bd 1406 /* Skip directories. */
1407 if (entry->start_dir != NULL)
f51c2148 1408 {
1824e2bd 1409 _cpp_file *file = entry->u.file;
1410
1411 /* We don't want MI guard advice for the main file. */
721e9705 1412 if (!file->once_only && file->cmacro == NULL
1413 && file->stack_count == 1 && !file->main_file)
f51c2148 1414 {
408c2285 1415 if (data->paths == NULL)
1824e2bd 1416 {
408c2285 1417 data->paths = XCNEWVEC (const char *, data->count);
1418 data->count = 0;
1824e2bd 1419 }
1420
408c2285 1421 data->paths[data->count++] = file->path;
f51c2148 1422 }
f51c2148 1423 }
f51c2148 1424
408c2285 1425 /* Keep traversing the hash table. */
1426 return 1;
1427}
1428
1429/* Comparison function for qsort. */
1430static int
1431report_missing_guard_cmp (const void *p1, const void *p2)
1432{
1433 return strcmp (*(const char *const *) p1, *(const char *const *) p2);
d6cf07b1 1434}
1435
1824e2bd 1436/* Report on all files that might benefit from a multiple include guard.
1437 Triggered by -H. */
1438void
1439_cpp_report_missing_guards (cpp_reader *pfile)
4bf559f2 1440{
408c2285 1441 struct report_missing_guard_data data;
1442
1443 data.paths = NULL;
1444 data.count = htab_elements (pfile->file_hash);
1445 htab_traverse (pfile->file_hash, report_missing_guard, &data);
0d6d8dc0 1446
408c2285 1447 if (data.paths != NULL)
1448 {
1449 size_t i;
1450
1451 /* Sort the paths to avoid outputting them in hash table
1452 order. */
1453 qsort (data.paths, data.count, sizeof (const char *),
1454 report_missing_guard_cmp);
1455 fputs (_("Multiple include guards may be useful for:\n"),
1456 stderr);
1457 for (i = 0; i < data.count; i++)
1458 {
1459 fputs (data.paths[i], stderr);
1460 putc ('\n', stderr);
1461 }
1462 free (data.paths);
1463 }
4bf559f2 1464}
1465
a00bb681 1466/* Locate HEADER, and determine whether it is newer than the current
5c120a72 1467 file. If it cannot be located or dated, return -1, if it is
a00bb681 1468 newer, return 1, otherwise 0. */
e485814b 1469int
f7fdd7a1 1470_cpp_compare_file_date (cpp_reader *pfile, const char *fname,
1471 int angle_brackets)
e485814b 1472{
1824e2bd 1473 _cpp_file *file;
1474 struct cpp_dir *dir;
b1a9ff83 1475
1824e2bd 1476 dir = search_path_head (pfile, fname, angle_brackets, IT_INCLUDE);
1477 if (!dir)
e485814b 1478 return -1;
a00bb681 1479
e557fc7f 1480 file = _cpp_find_file (pfile, fname, dir, false, angle_brackets, false, 0);
1824e2bd 1481 if (file->err_no)
1482 return -1;
d2e850c1 1483
1824e2bd 1484 if (file->fd != -1)
76147072 1485 {
1824e2bd 1486 close (file->fd);
1487 file->fd = -1;
76147072 1488 }
f80e83a9 1489
1824e2bd 1490 return file->st.st_mtime > pfile->buffer->file->st.st_mtime;
c4abf88d 1491}
1492
9e36e267 1493/* Pushes the given file onto the buffer stack. Returns nonzero if
1494 successful. */
1495bool
1824e2bd 1496cpp_push_include (cpp_reader *pfile, const char *fname)
9e36e267 1497{
e557fc7f 1498 return _cpp_stack_include (pfile, fname, false, IT_CMDLINE, 0);
9e36e267 1499}
1500
6adc88f8 1501/* Pushes the given file, implicitly included at the start of a
1502 compilation, onto the buffer stack but without any errors if the
1503 file is not found. Returns nonzero if successful. */
1504bool
1505cpp_push_default_include (cpp_reader *pfile, const char *fname)
1506{
e557fc7f 1507 return _cpp_stack_include (pfile, fname, true, IT_DEFAULT, 0);
6adc88f8 1508}
1509
e484a1cc 1510/* Do appropriate cleanup when a file INC's buffer is popped off the
02516fb9 1511 input stack. */
1512void
914db4b7 1513_cpp_pop_file_buffer (cpp_reader *pfile, _cpp_file *file,
1514 const unsigned char *to_free)
241e762e 1515{
0d6d8dc0 1516 /* Record the inclusion-preventing macro, which could be NULL
fa233610 1517 meaning no controlling macro. */
1824e2bd 1518 if (pfile->mi_valid && file->cmacro == NULL)
1519 file->cmacro = pfile->mi_cmacro;
79bd622b 1520
1521 /* Invalidate control macros in the #including file. */
fa233610 1522 pfile->mi_valid = false;
241e762e 1523
914db4b7 1524 if (to_free)
1824e2bd 1525 {
914db4b7 1526 if (to_free == file->buffer_start)
1527 {
1528 file->buffer_start = NULL;
1529 file->buffer = NULL;
1530 file->buffer_valid = false;
1531 }
1532 free ((void *) to_free);
1824e2bd 1533 }
241e762e 1534}
1535
5e791406 1536/* Return the file name associated with FILE. */
1537const char *
1538_cpp_get_file_name (_cpp_file *file)
1539{
1540 return file->name;
1541}
1542
cca5dddc 1543/* Inteface to file statistics record in _cpp_file structure. */
1544struct stat *
1545_cpp_get_file_stat (_cpp_file *file)
1546{
1547 return &file->st;
1548}
1549
1824e2bd 1550/* Set the include chain for "" to QUOTE, for <> to BRACKET. If
1551 QUOTE_IGNORES_SOURCE_DIR, then "" includes do not look in the
1552 directory of the including file.
0d6d8dc0 1553
1824e2bd 1554 If BRACKET does not lie in the QUOTE chain, it is set to QUOTE. */
1555void
1556cpp_set_include_chains (cpp_reader *pfile, cpp_dir *quote, cpp_dir *bracket,
1557 int quote_ignores_source_dir)
3ec84a0b 1558{
1824e2bd 1559 pfile->quote_include = quote;
1560 pfile->bracket_include = quote;
1561 pfile->quote_ignores_source_dir = quote_ignores_source_dir;
3ec84a0b 1562
1824e2bd 1563 for (; quote; quote = quote->next)
3ec84a0b 1564 {
1824e2bd 1565 quote->name_map = NULL;
1566 quote->len = strlen (quote->name);
1567 if (quote == bracket)
1568 pfile->bracket_include = bracket;
0d6d8dc0 1569 }
3ec84a0b 1570}
1571
1824e2bd 1572/* Append the file name to the directory to create the path, but don't
1573 turn / into // or // into ///; // may be a namespace escape. */
1574static char *
1575append_file_to_dir (const char *fname, cpp_dir *dir)
1576{
1577 size_t dlen, flen;
1578 char *path;
1579
1580 dlen = dir->len;
1581 flen = strlen (fname);
720aca92 1582 path = XNEWVEC (char, dlen + 1 + flen + 1);
1824e2bd 1583 memcpy (path, dir->name, dlen);
bb7824b5 1584 if (dlen && !IS_DIR_SEPARATOR (path[dlen - 1]))
1824e2bd 1585 path[dlen++] = '/';
1586 memcpy (&path[dlen], fname, flen + 1);
1587
1588 return path;
1589}
c95d8aaa 1590
1591/* Read a space delimited string of unlimited length from a stdio
e484a1cc 1592 file F. */
c95d8aaa 1593static char *
f7fdd7a1 1594read_filename_string (int ch, FILE *f)
c95d8aaa 1595{
1596 char *alloc, *set;
1597 int len;
1598
1599 len = 20;
720aca92 1600 set = alloc = XNEWVEC (char, len + 1);
d69d1eca 1601 if (! is_space (ch))
c95d8aaa 1602 {
1603 *set++ = ch;
d69d1eca 1604 while ((ch = getc (f)) != EOF && ! is_space (ch))
c95d8aaa 1605 {
1606 if (set - alloc == len)
1607 {
1608 len *= 2;
720aca92 1609 alloc = XRESIZEVEC (char, alloc, len + 1);
c95d8aaa 1610 set = alloc + len / 2;
1611 }
1612 *set++ = ch;
1613 }
1614 }
1615 *set = '\0';
1616 ungetc (ch, f);
1617 return alloc;
1618}
1619
1824e2bd 1620/* Read the file name map file for DIR. */
1621static void
1622read_name_map (cpp_dir *dir)
c95d8aaa 1623{
1824e2bd 1624 static const char FILE_NAME_MAP_FILE[] = "header.gcc";
c95d8aaa 1625 char *name;
1626 FILE *f;
1824e2bd 1627 size_t len, count = 0, room = 9;
1628
1629 len = dir->len;
720aca92 1630 name = (char *) alloca (len + sizeof (FILE_NAME_MAP_FILE) + 1);
1824e2bd 1631 memcpy (name, dir->name, len);
bb7824b5 1632 if (len && !IS_DIR_SEPARATOR (name[len - 1]))
1824e2bd 1633 name[len++] = '/';
1634 strcpy (name + len, FILE_NAME_MAP_FILE);
c95d8aaa 1635 f = fopen (name, "r");
8296733b 1636
720aca92 1637 dir->name_map = XNEWVEC (const char *, room);
1824e2bd 1638
8296733b 1639 /* Silently return NULL if we cannot open. */
1640 if (f)
c95d8aaa 1641 {
1642 int ch;
c95d8aaa 1643
1644 while ((ch = getc (f)) != EOF)
1645 {
1824e2bd 1646 char *to;
c95d8aaa 1647
d69d1eca 1648 if (is_space (ch))
c95d8aaa 1649 continue;
1824e2bd 1650
1651 if (count + 2 > room)
1652 {
1653 room += 8;
720aca92 1654 dir->name_map = XRESIZEVEC (const char *, dir->name_map, room);
1824e2bd 1655 }
1656
1657 dir->name_map[count] = read_filename_string (ch, f);
d69d1eca 1658 while ((ch = getc (f)) != EOF && is_hspace (ch))
c95d8aaa 1659 ;
c95d8aaa 1660
1824e2bd 1661 to = read_filename_string (ch, f);
a5c088d4 1662 if (IS_ABSOLUTE_PATH (to))
1824e2bd 1663 dir->name_map[count + 1] = to;
c95d8aaa 1664 else
1665 {
1824e2bd 1666 dir->name_map[count + 1] = append_file_to_dir (to, dir);
c95d8aaa 1667 free (to);
b1a9ff83 1668 }
c95d8aaa 1669
1824e2bd 1670 count += 2;
c95d8aaa 1671 while ((ch = getc (f)) != '\n')
1672 if (ch == EOF)
1673 break;
1674 }
1824e2bd 1675
c95d8aaa 1676 fclose (f);
1677 }
b1a9ff83 1678
1824e2bd 1679 /* Terminate the list of maps. */
1680 dir->name_map[count] = NULL;
b1a9ff83 1681}
c95d8aaa 1682
1824e2bd 1683/* Remap a FILE's name based on the file_name_map, if any, for
1684 FILE->dir. If the file name has any directory separators,
1685 recursively check those directories too. */
c95d8aaa 1686static char *
1824e2bd 1687remap_filename (cpp_reader *pfile, _cpp_file *file)
c95d8aaa 1688{
1824e2bd 1689 const char *fname, *p;
d8e3fcc2 1690 char *new_dir, *p3;
1824e2bd 1691 cpp_dir *dir;
1692 size_t index, len;
8296733b 1693
1824e2bd 1694 dir = file->dir;
1695 fname = file->name;
b1a9ff83 1696
1824e2bd 1697 for (;;)
1698 {
1699 if (!dir->name_map)
1700 read_name_map (dir);
c95d8aaa 1701
1824e2bd 1702 for (index = 0; dir->name_map[index]; index += 2)
bb7824b5 1703 if (!filename_cmp (dir->name_map[index], fname))
1824e2bd 1704 return xstrdup (dir->name_map[index + 1]);
bb7824b5 1705 if (IS_ABSOLUTE_PATH (fname))
1706 return NULL;
1824e2bd 1707 p = strchr (fname, '/');
bb7824b5 1708#ifdef HAVE_DOS_BASED_FILE_SYSTEM
1709 {
1710 char *p2 = strchr (fname, '\\');
1711 if (!p || (p > p2))
1712 p = p2;
1713 }
1714#endif
1824e2bd 1715 if (!p || p == fname)
1716 return NULL;
7eda354a 1717
1824e2bd 1718 len = dir->len + (p - fname + 1);
d8e3fcc2 1719 new_dir = XNEWVEC (char, len + 2);
1720 p3 = new_dir + dir->len;
1824e2bd 1721 memcpy (new_dir, dir->name, dir->len);
d8e3fcc2 1722 if (dir->len && !IS_DIR_SEPARATOR (dir->name[dir->len - 1]))
1723 {
1724 *p3++ = '/';
1725 len++;
1726 }
1727 memcpy (p3, fname, p - fname + 1);
1824e2bd 1728 new_dir[len] = '\0';
b1a9ff83 1729
1824e2bd 1730 dir = make_cpp_dir (pfile, new_dir, dir->sysp);
1731 fname = p + 1;
7dd5e644 1732 }
7dd5e644 1733}
03e3f0fd 1734
1824e2bd 1735/* Returns true if PCHNAME is a valid PCH file for FILE. */
1736static bool
1737validate_pch (cpp_reader *pfile, _cpp_file *file, const char *pchname)
03e3f0fd 1738{
1824e2bd 1739 const char *saved_path = file->path;
25a6091d 1740 bool valid = false;
03e3f0fd 1741
1824e2bd 1742 file->path = pchname;
1743 if (open_file (file))
03e3f0fd 1744 {
25a6091d 1745 valid = 1 & pfile->cb.valid_pch (pfile, pchname, file->fd);
1824e2bd 1746
25a6091d 1747 if (!valid)
03e3f0fd 1748 {
1824e2bd 1749 close (file->fd);
1750 file->fd = -1;
03e3f0fd 1751 }
03e3f0fd 1752
1824e2bd 1753 if (CPP_OPTION (pfile, print_include_names))
03e3f0fd 1754 {
1824e2bd 1755 unsigned int i;
86c1a687 1756 for (i = 1; i < pfile->line_table->depth; i++)
1824e2bd 1757 putc ('.', stderr);
1758 fprintf (stderr, "%c %s\n",
25a6091d 1759 valid ? '!' : 'x', pchname);
03e3f0fd 1760 }
03e3f0fd 1761 }
1762
1824e2bd 1763 file->path = saved_path;
25a6091d 1764 return valid;
03e3f0fd 1765}
065e625b 1766
1767/* Get the path associated with the _cpp_file F. The path includes
1768 the base name from the include directive and the directory it was
1769 found in via the search path. */
1770
1771const char *
1772cpp_get_path (struct _cpp_file *f)
1773{
1774 return f->path;
1775}
1776
d6c39c7a 1777/* Get the directory associated with the _cpp_file F. */
1778
1779cpp_dir *
1780cpp_get_dir (struct _cpp_file *f)
1781{
1782 return f->dir;
1783}
1784
065e625b 1785/* Get the cpp_buffer currently associated with the cpp_reader
1786 PFILE. */
1787
1788cpp_buffer *
1789cpp_get_buffer (cpp_reader *pfile)
1790{
1791 return pfile->buffer;
1792}
1793
1794/* Get the _cpp_file associated with the cpp_buffer B. */
1795
1796_cpp_file *
1797cpp_get_file (cpp_buffer *b)
1798{
1799 return b->file;
1800}
1801
1802/* Get the previous cpp_buffer given a cpp_buffer B. The previous
1803 buffer is the buffer that included the given buffer. */
1804
1805cpp_buffer *
1806cpp_get_prev (cpp_buffer *b)
1807{
1808 return b->prev;
1809}
9f787687 1810\f
7bd28bba 1811/* This data structure holds the list of header files that were seen
9f787687 1812 while the PCH was being built. The 'entries' field is kept sorted
1813 in memcmp() order; yes, this means that on little-endian systems,
1814 it's sorted initially by the least-significant byte of 'size', but
1815 that's OK. The code does rely on having entries with the same size
1816 next to each other. */
1817
720aca92 1818struct pchf_entry {
1819 /* The size of this file. This is used to save running a MD5 checksum
1820 if the sizes don't match. */
1821 off_t size;
1822 /* The MD5 checksum of this file. */
1823 unsigned char sum[16];
1824 /* Is this file to be included only once? */
1825 bool once_only;
1826};
1827
9f787687 1828struct pchf_data {
1829 /* Number of pchf_entry structures. */
1830 size_t count;
1831
1832 /* Are there any values with once_only set?
1833 This is used as an optimisation, it means we don't have to search
1834 the structure if we're processing a regular #include. */
1835 bool have_once_only;
57ba96e9 1836
720aca92 1837 struct pchf_entry entries[1];
9f787687 1838};
1839
1840static struct pchf_data *pchf;
1841
26ec4f15 1842/* A qsort ordering function for pchf_entry structures. */
1843
1844static int
1845pchf_save_compare (const void *e1, const void *e2)
9f787687 1846{
26ec4f15 1847 return memcmp (e1, e2, sizeof (struct pchf_entry));
1848}
9f787687 1849
26ec4f15 1850/* Create and write to F a pchf_data structure. */
9f787687 1851
26ec4f15 1852bool
1853_cpp_save_file_entries (cpp_reader *pfile, FILE *fp)
9f787687 1854{
26ec4f15 1855 size_t count = 0;
1856 struct pchf_data *result;
1857 size_t result_size;
1858 _cpp_file *f;
39bcf299 1859 bool ret;
9f787687 1860
26ec4f15 1861 for (f = pfile->all_files; f; f = f->next_file)
1862 ++count;
1863
1864 result_size = (sizeof (struct pchf_data)
1865 + sizeof (struct pchf_entry) * (count - 1));
720aca92 1866 result = XCNEWVAR (struct pchf_data, result_size);
26ec4f15 1867
1868 result->count = 0;
1869 result->have_once_only = false;
1870
1871 for (f = pfile->all_files; f; f = f->next_file)
9f787687 1872 {
26ec4f15 1873 size_t count;
9f787687 1874
1875 /* This should probably never happen, since if a read error occurred
1876 the PCH file shouldn't be written... */
1877 if (f->dont_read || f->err_no)
26ec4f15 1878 continue;
1879
1880 if (f->stack_count == 0)
1881 continue;
57ba96e9 1882
26ec4f15 1883 count = result->count++;
1884
1885 result->entries[count].once_only = f->once_only;
016dde50 1886 /* |= is avoided in the next line because of an HP C compiler bug */
26ec4f15 1887 result->have_once_only = result->have_once_only | f->once_only;
9f787687 1888 if (f->buffer_valid)
26ec4f15 1889 md5_buffer ((const char *)f->buffer,
1890 f->st.st_size, result->entries[count].sum);
9f787687 1891 else
1892 {
1893 FILE *ff;
1894 int oldfd = f->fd;
1895
1896 if (!open_file (f))
1897 {
e557fc7f 1898 open_file_failed (pfile, f, 0, 0);
15fc692a 1899 free (result);
26ec4f15 1900 return false;
9f787687 1901 }
1902 ff = fdopen (f->fd, "rb");
26ec4f15 1903 md5_stream (ff, result->entries[count].sum);
9f787687 1904 fclose (ff);
1905 f->fd = oldfd;
1906 }
26ec4f15 1907 result->entries[count].size = f->st.st_size;
9f787687 1908 }
9f787687 1909
1910 result_size = (sizeof (struct pchf_data)
1911 + sizeof (struct pchf_entry) * (result->count - 1));
57ba96e9 1912
9f787687 1913 qsort (result->entries, result->count, sizeof (struct pchf_entry),
1914 pchf_save_compare);
1915
39bcf299 1916 ret = fwrite (result, result_size, 1, fp) == 1;
1917 free (result);
1918 return ret;
9f787687 1919}
1920
1921/* Read the pchf_data structure from F. */
1922
1923bool
1924_cpp_read_file_entries (cpp_reader *pfile ATTRIBUTE_UNUSED, FILE *f)
1925{
1926 struct pchf_data d;
57ba96e9 1927
9f787687 1928 if (fread (&d, sizeof (struct pchf_data) - sizeof (struct pchf_entry), 1, f)
1929 != 1)
1930 return false;
57ba96e9 1931
720aca92 1932 pchf = XNEWVAR (struct pchf_data, sizeof (struct pchf_data)
9f787687 1933 + sizeof (struct pchf_entry) * (d.count - 1));
1934 memcpy (pchf, &d, sizeof (struct pchf_data) - sizeof (struct pchf_entry));
1935 if (fread (pchf->entries, sizeof (struct pchf_entry), d.count, f)
1936 != d.count)
1937 return false;
1938 return true;
1939}
1940
1941/* The parameters for pchf_compare. */
1942
1943struct pchf_compare_data
1944{
1945 /* The size of the file we're looking for. */
1946 off_t size;
1947
1948 /* The MD5 checksum of the file, if it's been computed. */
1949 unsigned char sum[16];
1950
1951 /* Is SUM valid? */
1952 bool sum_computed;
1953
1954 /* Do we need to worry about entries that don't have ONCE_ONLY set? */
1955 bool check_included;
57ba96e9 1956
9f787687 1957 /* The file that we're searching for. */
1958 _cpp_file *f;
1959};
1960
1961/* bsearch comparison function; look for D_P in E_P. */
1962
1963static int
1964pchf_compare (const void *d_p, const void *e_p)
1965{
1966 const struct pchf_entry *e = (const struct pchf_entry *)e_p;
1967 struct pchf_compare_data *d = (struct pchf_compare_data *)d_p;
1968 int result;
57ba96e9 1969
9f787687 1970 result = memcmp (&d->size, &e->size, sizeof (off_t));
1971 if (result != 0)
1972 return result;
57ba96e9 1973
9f787687 1974 if (! d->sum_computed)
1975 {
1976 _cpp_file *const f = d->f;
57ba96e9 1977
9f787687 1978 md5_buffer ((const char *)f->buffer, f->st.st_size, d->sum);
1979 d->sum_computed = true;
1980 }
1981
1982 result = memcmp (d->sum, e->sum, 16);
1983 if (result != 0)
1984 return result;
1985
1986 if (d->check_included || e->once_only)
1987 return 0;
1988 else
1989 return 1;
1990}
1991
57ba96e9 1992/* Check that F is not in a list read from a PCH file (if any).
9f787687 1993 Assumes that f->buffer_valid is true. Return TRUE if the file
1994 should not be read. */
1995
1996static bool
1997check_file_against_entries (cpp_reader *pfile ATTRIBUTE_UNUSED,
1998 _cpp_file *f,
1999 bool check_included)
2000{
2001 struct pchf_compare_data d;
57ba96e9 2002
9f787687 2003 if (pchf == NULL
2004 || (! check_included && ! pchf->have_once_only))
2005 return false;
2006
2007 d.size = f->st.st_size;
2008 d.sum_computed = false;
2009 d.f = f;
2010 d.check_included = check_included;
2011 return bsearch (&d, pchf->entries, pchf->count, sizeof (struct pchf_entry),
2012 pchf_compare) != NULL;
2013}
f6751ff2 2014
2015/* Return true if the file FNAME is found in the appropriate include file path
2016 as indicated by ANGLE_BRACKETS. */
2017
2018bool
2019_cpp_has_header (cpp_reader *pfile, const char *fname, int angle_brackets,
2020 enum include_type type)
2021{
2022 cpp_dir *start_dir = search_path_head (pfile, fname, angle_brackets, type);
2023 _cpp_file *file = _cpp_find_file (pfile, fname, start_dir,
2024 /*fake=*/false, angle_brackets,
e557fc7f 2025 /*implicit_preinclude=*/false, 0);
f6751ff2 2026 return file->err_no != ENOENT;
2027}
2028