files.c 53.9 KB
Newer Older
1
/* Part of CPP library.  File handling.
2
   Copyright (C) 1986-2014 Free Software Foundation, Inc.
Zack Weinberg committed
3 4 5 6
   Written by Per Bothner, 1994.
   Based on CCCP program by Paul Rubin, June 1986
   Adapted to ANSI C, Richard Stallman, Jan 1987
   Split out of cpplib.c, Zack Weinberg, Oct 1998
7
   Reimplemented, Neil Booth, Jul 2003
Zack Weinberg committed
8 9 10

This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
11
Free Software Foundation; either version 3, or (at your option) any
Zack Weinberg committed
12 13 14 15 16 17 18 19
later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
20 21
along with this program; see the file COPYING3.  If not see
<http://www.gnu.org/licenses/>.  */
Zack Weinberg committed
22 23 24 25

#include "config.h"
#include "system.h"
#include "cpplib.h"
26
#include "internal.h"
27
#include "mkdeps.h"
28
#include "obstack.h"
29
#include "hashtab.h"
Geoffrey Keating committed
30
#include "md5.h"
31
#include <dirent.h>
32

33 34 35 36 37 38 39
/* Variable length record files on VMS will have a stat size that includes
   record control characters that won't be included in the read size.  */
#ifdef VMS
# define FAB_C_VAR 2 /* variable length records (see Starlet fabdef.h) */
# define STAT_SIZE_RELIABLE(ST) ((ST).st_fab_rfm != FAB_C_VAR)
#else
# define STAT_SIZE_RELIABLE(ST) true
Zack Weinberg committed
40 41
#endif

42
#ifdef __DJGPP__
43
#include <io.h>
44 45 46 47 48 49 50 51 52 53 54 55 56 57
  /* For DJGPP redirected input is opened in text mode.  */
#  define set_stdin_to_binary_mode() \
     if (! isatty (0)) setmode (0, O_BINARY)
#else
#  define set_stdin_to_binary_mode() /* Nothing */
#endif

/* This structure represents a file searched for by CPP, whether it
   exists or not.  An instance may be pointed to by more than one
   file_hash_entry; at present no reference count is kept.  */
struct _cpp_file
{
  /* Filename as given to #include or command line switch.  */
  const char *name;
58

59 60
  /* The full path used to find the file.  */
  const char *path;
61

62 63
  /* The full path of the pch file.  */
  const char *pchname;
Zack Weinberg committed
64

65 66
  /* The file's path with the basename stripped.  NULL if it hasn't
     been calculated yet.  */
67
  const char *dir_name;
68

69 70
  /* Chain through all files.  */
  struct _cpp_file *next_file;
71

72 73
  /* The contents of NAME after calling read_file().  */
  const uchar *buffer;
74

75 76 77 78
  /* Pointer to the real start of BUFFER.  read_file() might increment
     BUFFER; when freeing, this this pointer must be used instead.  */
  const uchar *buffer_start;

79 80
  /* The macro, if any, preventing re-inclusion.  */
  const cpp_hashnode *cmacro;
81

82 83
  /* The directory in the search path where FILE was found.  Used for
     #include_next and determining whether a header is a system
84
     header.  */
85
  cpp_dir *dir;
86

87 88
  /* As filled in by stat(2) for the file.  */
  struct stat st;
89

90 91
  /* File descriptor.  Invalid if -1, otherwise open.  */
  int fd;
92

93 94 95
  /* Zero if this file was successfully opened and stat()-ed,
     otherwise errno obtained from failure.  */
  int err_no;
Zack Weinberg committed
96

97 98
  /* Number of times the file has been stacked for preprocessing.  */
  unsigned short stack_count;
99

100 101
  /* If opened with #import or contains #pragma once.  */
  bool once_only;
Zack Weinberg committed
102

103 104
  /* If read() failed before.  */
  bool dont_read;
Zack Weinberg committed
105

106 107
  /* If this file is the main file.  */
  bool main_file;
Zack Weinberg committed
108

109 110
  /* If BUFFER above contains the true contents of the file.  */
  bool buffer_valid;
Joseph Myers committed
111 112 113

  /* If this file is implicitly preincluded.  */
  bool implicit_preinclude;
114
};
115

116 117 118
/* A singly-linked list for all searches for a given file name, with
   its head pointed to by a slot in FILE_HASH.  The file name is what
   appeared between the quotes in a #include directive; it can be
119
   determined implicitly from the hash table location or explicitly
120
   from FILE->name.
121 122 123 124 125 126

   FILE is a structure containing details about the file that was
   found with that search, or details of how the search failed.

   START_DIR is the starting location of the search in the include
   chain.  The current directories for "" includes are also hashed in
127 128 129 130
   the hash table and therefore unique.  Files that are looked up
   without using a search path, such as absolute filenames and file
   names from the command line share a special starting directory so
   they don't cause cache hits with normal include-chain lookups.
131 132 133 134 135 136

   If START_DIR is NULL then the entry is for a directory, not a file,
   and the directory is in DIR.  Since the starting point in a file
   lookup chain is never NULL, this means that simple pointer
   comparisons against START_DIR can be made to determine cache hits
   in file lookups.
137 138 139 140 141

   If a cache lookup fails because of e.g. an extra "./" in the path,
   then nothing will break.  It is just less efficient as CPP will
   have to do more work re-preprocessing the file, and/or comparing
   its contents against earlier once-only files.
142 143 144 145 146
*/
struct file_hash_entry
{
  struct file_hash_entry *next;
  cpp_dir *start_dir;
147
  source_location location;
148 149 150 151 152 153 154
  union
  {
    _cpp_file *file;
    cpp_dir *dir;
  } u;
};

155 156 157 158 159 160 161 162 163 164 165 166 167 168 169
/* Number of entries to put in a file_hash_entry pool.  */
#define FILE_HASH_POOL_SIZE 127

/* A file hash entry pool.  We allocate file_hash_entry object from
   one of these.  */
struct file_hash_entry_pool
{
  /* Number of entries used from this pool.  */
  unsigned int file_hash_entries_used;
  /* Next pool in the chain; used when freeing.  */
  struct file_hash_entry_pool *next;
  /* The memory pool.  */
  struct file_hash_entry pool[FILE_HASH_POOL_SIZE];
};

170
static bool open_file (_cpp_file *file);
171 172 173 174
static bool pch_open_file (cpp_reader *pfile, _cpp_file *file,
			   bool *invalid_pch);
static bool find_file_in_dir (cpp_reader *pfile, _cpp_file *file,
			      bool *invalid_pch);
175 176
static bool read_file_guts (cpp_reader *pfile, _cpp_file *file);
static bool read_file (cpp_reader *pfile, _cpp_file *file);
177
static bool should_stack_file (cpp_reader *, _cpp_file *file, bool import);
178 179 180
static struct cpp_dir *search_path_head (cpp_reader *, const char *fname,
				 int angle_brackets, enum include_type);
static const char *dir_name_of_file (_cpp_file *file);
James E Wilson committed
181
static void open_file_failed (cpp_reader *pfile, _cpp_file *file, int);
182
static struct file_hash_entry *search_cache (struct file_hash_entry *head,
183 184
					     const cpp_dir *start_dir);
static _cpp_file *make_cpp_file (cpp_reader *, cpp_dir *, const char *fname);
185
static void destroy_cpp_file (_cpp_file *);
186 187 188 189
static cpp_dir *make_cpp_dir (cpp_reader *, const char *dir_name, int sysp);
static void allocate_file_hash_entries (cpp_reader *pfile);
static struct file_hash_entry *new_file_hash_entry (cpp_reader *pfile);
static int report_missing_guard (void **slot, void *b);
190 191
static hashval_t file_hash_hash (const void *p);
static int file_hash_eq (const void *p, const void *q);
192 193 194 195 196
static char *read_filename_string (int ch, FILE *f);
static void read_name_map (cpp_dir *dir);
static char *remap_filename (cpp_reader *pfile, _cpp_file *file);
static char *append_file_to_dir (const char *fname, cpp_dir *dir);
static bool validate_pch (cpp_reader *, _cpp_file *file, const char *pchname);
Geoffrey Keating committed
197 198 199
static int pchf_save_compare (const void *e1, const void *e2);
static int pchf_compare (const void *d_p, const void *e_p);
static bool check_file_against_entries (cpp_reader *, _cpp_file *, bool);
200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223

/* Given a filename in FILE->PATH, with the empty string interpreted
   as <stdin>, open it.

   On success FILE contains an open file descriptor and stat
   information for the file.  On failure the file descriptor is -1 and
   the appropriate errno is also stored in FILE.  Returns TRUE iff
   successful.

   We used to open files in nonblocking mode, but that caused more
   problems than it solved.  Do take care not to acquire a controlling
   terminal by mistake (this can't happen on sane systems, but
   paranoia is a virtue).

   Use the three-argument form of open even though we aren't
   specifying O_CREAT, to defend against broken system headers.

   O_BINARY tells some runtime libraries (notably DJGPP) not to do
   newline translation; we can handle DOS line breaks just fine
   ourselves.  */
static bool
open_file (_cpp_file *file)
{
  if (file->path[0] == '\0')
224 225
    {
      file->fd = 0;
226
      set_stdin_to_binary_mode ();
227
    }
228
  else
229
    file->fd = open (file->path, O_RDONLY | O_NOCTTY | O_BINARY, 0666);
230

231
  if (file->fd != -1)
232
    {
233 234 235 236 237 238 239 240 241 242 243 244
      if (fstat (file->fd, &file->st) == 0)
	{
	  if (!S_ISDIR (file->st.st_mode))
	    {
	      file->err_no = 0;
	      return true;
	    }

	  /* Ignore a directory and continue the search.  The file we're
	     looking for may be elsewhere in the search path.  */
	  errno = ENOENT;
	}
245 246 247

      close (file->fd);
      file->fd = -1;
248
    }
249 250 251 252 253 254
#if defined(_WIN32) && !defined(__CYGWIN__)
  else if (errno == EACCES)
    {
      /* On most UNIX systems, open succeeds on a directory.  Above,
         we check if we have opened a directory and if so, set errno
         to ENOENT.  However, on Windows, opening a directory
255
         fails with EACCES.  We want to return ENOENT in that
256 257 258 259
         case too.  */
      if (stat (file->path, &file->st) == 0
          && S_ISDIR (file->st.st_mode))
        errno = ENOENT;
260 261
      else
	/* The call to stat may have reset errno.  */
262
	errno = EACCES;
263 264
    }
#endif    
265 266
  else if (errno == ENOTDIR)
    errno = ENOENT;
267

268
  file->err_no = errno;
269 270

  return false;
271 272
}

273 274 275 276 277
/* Temporary PCH intercept of opening a file.  Try to find a PCH file
   based on FILE->name and FILE->dir, and test those found for
   validity using PFILE->cb.valid_pch.  Return true iff a valid file is
   found.  Set *INVALID_PCH if a PCH file is found but wasn't valid.  */

278
static bool
279
pch_open_file (cpp_reader *pfile, _cpp_file *file, bool *invalid_pch)
280
{
281 282 283 284 285 286 287 288 289 290
  static const char extension[] = ".gch";
  const char *path = file->path;
  size_t len, flen;
  char *pchname;
  struct stat st;
  bool valid = false;

  /* No PCH on <stdin> or if not requested.  */
  if (file->name[0] == '\0' || !pfile->cb.valid_pch)
    return false;
291

292 293 294
  /* If the file is not included as first include from either the toplevel
     file or the command-line it is not a valid use of PCH.  */
  if (pfile->all_files
Joseph Myers committed
295
      && pfile->all_files->next_file
296 297
      && !(pfile->all_files->implicit_preinclude
	   || pfile->all_files->next_file->implicit_preinclude))
298 299
    return false;

300 301
  flen = strlen (path);
  len = flen + sizeof (extension);
302
  pchname = XNEWVEC (char, len);
303 304
  memcpy (pchname, path, flen);
  memcpy (pchname + flen, extension, sizeof (extension));
305

306
  if (stat (pchname, &st) == 0)
307
    {
308 309 310 311 312 313 314
      DIR *pchdir;
      struct dirent *d;
      size_t dlen, plen = len;

      if (!S_ISDIR (st.st_mode))
	valid = validate_pch (pfile, file, pchname);
      else if ((pchdir = opendir (pchname)) != NULL)
315
	{
316 317
	  pchname[plen - 1] = '/';
	  while ((d = readdir (pchdir)) != NULL)
318
	    {
319
	      dlen = strlen (d->d_name) + 1;
320 321 322
	      if ((strcmp (d->d_name, ".") == 0)
		  || (strcmp (d->d_name, "..") == 0))
		continue;
323
	      if (dlen + plen > len)
324
		{
325
		  len += dlen + 64;
326
		  pchname = XRESIZEVEC (char, pchname, len);
327
		}
328 329 330
	      memcpy (pchname + plen, d->d_name, dlen);
	      valid = validate_pch (pfile, file, pchname);
	      if (valid)
331
		break;
332
	    }
333
	  closedir (pchdir);
334
	}
335
      if (!valid)
336
	*invalid_pch = true;
337
    }
338

339 340 341 342 343 344
  if (valid)
    file->pchname = pchname;
  else
    free (pchname);

  return valid;
345 346
}

347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365
/* Canonicalize the path to FILE.  Return the canonical form if it is
   shorter, otherwise return NULL.  This function does NOT free the
   memory pointed by FILE.  */

static char *
maybe_shorter_path (const char * file)
{
  char * file2 = lrealpath (file);
  if (file2 && strlen (file2) < strlen (file))
    {
      return file2;
    }
  else 
    {
      free (file2);
      return NULL;
    }
}

366
/* Try to open the path FILE->name appended to FILE->dir.  This is
367
   where remap and PCH intercept the file lookup process.  Return true
Eric Christopher committed
368
   if the file was found, whether or not the open was successful.
369 370
   Set *INVALID_PCH to true if a PCH file is found but wasn't valid.  */

371
static bool
372
find_file_in_dir (cpp_reader *pfile, _cpp_file *file, bool *invalid_pch)
373
{
374
  char *path;
375

376 377 378
  if (CPP_OPTION (pfile, remap) && (path = remap_filename (pfile, file)))
    ;
  else
379 380 381 382
    if (file->dir->construct)
      path = file->dir->construct (file->name, file->dir);
    else
      path = append_file_to_dir (file->name, file->dir);
383

384 385
  if (path)
    {
386
      hashval_t hv;
387 388 389
      char *copy;
      void **pp;

390
      /* We try to canonicalize system headers.  */
391
      if (CPP_OPTION (pfile, canonical_system_headers) && file->dir->sysp)
392 393 394 395 396 397 398 399 400 401 402 403
	{
	  char * canonical_path = maybe_shorter_path (path);
	  if (canonical_path)
	    {
	      /* The canonical path was newly allocated.  Let's free the
		 non-canonical one.  */
	      free (path);
	      path = canonical_path;
	    }
	}

      hv = htab_hash_string (path);
404 405 406 407 408 409
      if (htab_find_with_hash (pfile->nonexistent_file_hash, path, hv) != NULL)
	{
	  file->err_no = ENOENT;
	  return false;
	}

410 411 412
      file->path = path;
      if (pch_open_file (pfile, file, invalid_pch))
	return true;
413

414 415 416 417 418
      if (open_file (file))
	return true;

      if (file->err_no != ENOENT)
	{
James E Wilson committed
419
	  open_file_failed (pfile, file, 0);
420 421 422
	  return true;
	}

423 424 425
      /* We copy the path name onto an obstack partly so that we don't
	 leak the memory, but mostly so that we don't fragment the
	 heap.  */
426 427
      copy = (char *) obstack_copy0 (&pfile->nonexistent_file_ob, path,
				     strlen (path));
428
      free (path);
429 430 431 432
      pp = htab_find_slot_with_hash (pfile->nonexistent_file_hash,
				     copy, hv, INSERT);
      *pp = copy;

433 434 435 436 437 438 439 440 441 442
      file->path = file->name;
    }
  else
    {
      file->err_no = ENOENT; 
      file->path = NULL;
    }

  return false;
}
443

444 445 446 447 448 449 450 451 452 453
/* Return tue iff the missing_header callback found the given HEADER.  */
static bool
search_path_exhausted (cpp_reader *pfile, const char *header, _cpp_file *file)
{
  missing_header_cb func = pfile->cb.missing_header;

  /* When the regular search path doesn't work, try context dependent
     headers search paths.  */
  if (func
      && file->dir == NULL)
454
    {
455
      if ((file->path = func (pfile, header, &file->dir)) != NULL)
456 457 458 459 460 461
	{
	  if (open_file (file))
	    return true;
	  free ((void *)file->path);
	}
      file->path = file->name;
462 463
    }

464 465 466
  return false;
}

467 468 469 470 471 472
bool
_cpp_find_failed (_cpp_file *file)
{
  return file->err_no != 0;
}

473 474
/* Given a filename FNAME search for such a file in the include path
   starting from START_DIR.  If FNAME is the empty string it is
475
   interpreted as STDIN if START_DIR is PFILE->no_search_path.
476 477 478 479 480

   If the file is not found in the file cache fall back to the O/S and
   add the result to our cache.

   If the file was not found in the filesystem, or there was an error
481
   opening it, then ERR_NO is nonzero and FD is -1.  If the file was
482 483 484 485
   found, then ERR_NO is zero and FD could be -1 or an open file
   descriptor.  FD can be -1 if the file was found in the cache and
   had previously been closed.  To open it again pass the return value
   to open_file().
Joseph Myers committed
486 487 488 489

   If IMPLICIT_PREINCLUDE then it is OK for the file to be missing.
   If present, it is OK for a precompiled header to be included after
   it.
490
*/
491
_cpp_file *
Joseph Myers committed
492 493
_cpp_find_file (cpp_reader *pfile, const char *fname, cpp_dir *start_dir,
		bool fake, int angle_brackets, bool implicit_preinclude)
494
{
495 496
  struct file_hash_entry *entry;
  void **hash_slot;
497
  _cpp_file *file;
498
  bool invalid_pch = false;
499 500 501
  bool saw_bracket_include = false;
  bool saw_quote_include = false;
  struct cpp_dir *found_in_cache = NULL;
502 503 504

  /* Ensure we get no confusion between cached files and directories.  */
  if (start_dir == NULL)
505
    cpp_error (pfile, CPP_DL_ICE, "NULL directory in find_file");
506

507 508 509
  hash_slot
    = htab_find_slot_with_hash (pfile->file_hash, fname,
				htab_hash_string (fname), INSERT);
510

511
  /* First check the cache before we resort to memory allocation.  */
512
  entry = search_cache ((struct file_hash_entry *) *hash_slot, start_dir);
513 514 515 516
  if (entry)
    return entry->u.file;

  file = make_cpp_file (pfile, start_dir, fname);
Joseph Myers committed
517
  file->implicit_preinclude = implicit_preinclude;
518 519 520

  /* Try each path in the include chain.  */
  for (; !fake ;)
521
    {
522
      if (find_file_in_dir (pfile, file, &invalid_pch))
523 524
	break;

525 526
      file->dir = file->dir->next;
      if (file->dir == NULL)
527
	{
528
	  if (search_path_exhausted (pfile, fname, file))
529 530 531 532 533 534 535
	    {
	      /* Although this file must not go in the cache, because
		 the file found might depend on things (like the current file)
		 that aren't represented in the cache, it still has to go in
		 the list of all files so that #import works.  */
	      file->next_file = pfile->all_files;
	      pfile->all_files = file;
536 537 538 539 540 541 542 543 544 545 546
	      if (*hash_slot == NULL)
		{
		  /* If *hash_slot is NULL, the above htab_find_slot_with_hash
		     call just created the slot, but we aren't going to store
		     there anything, so need to remove the newly created entry.
		     htab_clear_slot requires that it is non-NULL, so store
		     there some non-NULL pointer, htab_clear_slot will
		     overwrite it immediately.  */
		  *hash_slot = file;
		  htab_clear_slot (pfile->file_hash, hash_slot);
		}
547 548
	      return file;
	    }
549

550 551
	  if (invalid_pch)
	    {
Eric Christopher committed
552
	      cpp_error (pfile, CPP_DL_ERROR,
553 554
	       "one or more PCH files were found, but they were invalid");
	      if (!cpp_get_options (pfile)->warn_invalid_pch)
Eric Christopher committed
555
		cpp_error (pfile, CPP_DL_ERROR,
556
			   "use -Winvalid-pch for more information");
557
	    }
Joseph Myers committed
558 559 560 561
	  if (implicit_preinclude)
	    {
	      free ((char *) file->name);
	      free (file);
562 563 564 565 566 567
	      if (*hash_slot == NULL)
		{
		  /* See comment on the above htab_clear_slot call.  */
		  *hash_slot = file;
		  htab_clear_slot (pfile->file_hash, hash_slot);
		}
Joseph Myers committed
568 569 570 571
	      return NULL;
	    }
	  else
	    open_file_failed (pfile, file, angle_brackets);
572
	  break;
573
	}
574

575 576 577
      /* Only check the cache for the starting location (done above)
	 and the quote and bracket chain heads because there are no
	 other possible starting points for searches.  */
578 579 580 581 582
      if (file->dir == pfile->bracket_include)
	saw_bracket_include = true;
      else if (file->dir == pfile->quote_include)
	saw_quote_include = true;
      else
583
	continue;
584

585
      entry = search_cache ((struct file_hash_entry *) *hash_slot, file->dir);
586
      if (entry)
587 588 589 590
	{
	  found_in_cache = file->dir;
	  break;
	}
591
    }
592

593 594 595 596 597 598 599 600 601 602 603 604
  if (entry)
    {
      /* Cache for START_DIR too, sharing the _cpp_file structure.  */
      free ((char *) file->name);
      free (file);
      file = entry->u.file;
    }
  else
    {
      /* This is a new file; put it in the list.  */
      file->next_file = pfile->all_files;
      pfile->all_files = file;
605 606
    }

607 608
  /* Store this new result in the hash table.  */
  entry = new_file_hash_entry (pfile);
609
  entry->next = (struct file_hash_entry *) *hash_slot;
610
  entry->start_dir = start_dir;
611
  entry->location = pfile->line_table->highest_location;
612
  entry->u.file = file;
613
  *hash_slot = (void *) entry;
614

615 616 617 618 619 620 621
  /* If we passed the quote or bracket chain heads, cache them also.
     This speeds up processing if there are lots of -I options.  */
  if (saw_bracket_include
      && pfile->bracket_include != start_dir
      && found_in_cache != pfile->bracket_include)
    {
      entry = new_file_hash_entry (pfile);
622
      entry->next = (struct file_hash_entry *) *hash_slot;
623
      entry->start_dir = pfile->bracket_include;
624
      entry->location = pfile->line_table->highest_location;
625
      entry->u.file = file;
626
      *hash_slot = (void *) entry;
627 628 629 630 631 632
    }
  if (saw_quote_include
      && pfile->quote_include != start_dir
      && found_in_cache != pfile->quote_include)
    {
      entry = new_file_hash_entry (pfile);
633
      entry->next = (struct file_hash_entry *) *hash_slot;
634
      entry->start_dir = pfile->quote_include;
635
      entry->location = pfile->line_table->highest_location;
636
      entry->u.file = file;
637
      *hash_slot = (void *) entry;
638 639
    }

640
  return file;
641 642
}

643
/* Read a file into FILE->buffer, returning true on success.
644

645 646 647 648
   If FILE->fd is something weird, like a block device, we don't want
   to read it at all.  Don't even try to figure out what something is,
   except for plain files and block devices, since there is no
   reliable portable way of doing this.
649 650

   FIXME: Flush file cache and try again if we run out of memory.  */
651 652
static bool
read_file_guts (cpp_reader *pfile, _cpp_file *file)
653
{
654
  ssize_t size, total, count;
655
  uchar *buf;
656
  bool regular;
Eric Christopher committed
657

658 659
  if (S_ISBLK (file->st.st_mode))
    {
660
      cpp_error (pfile, CPP_DL_ERROR, "%s is a block device", file->path);
661 662
      return false;
    }
663

664
  regular = S_ISREG (file->st.st_mode) != 0;
665
  if (regular)
666
    {
667 668 669 670 671 672 673 674
      /* off_t might have a wider range than ssize_t - in other words,
	 the max size of a file might be bigger than the address
	 space.  We can't handle a file that large.  (Anyone with
	 a single source file bigger than 2GB needs to rethink
	 their coding style.)  Some systems (e.g. AIX 4.1) define
	 SSIZE_MAX to be much smaller than the actual range of the
	 type.  Use INTTYPE_MAXIMUM unconditionally to ensure this
	 does not bite us.  */
675
      if (file->st.st_size > INTTYPE_MAXIMUM (ssize_t))
676
	{
677
	  cpp_error (pfile, CPP_DL_ERROR, "%s is too large", file->path);
678
	  return false;
679
	}
680

681 682 683 684 685 686 687 688
      size = file->st.st_size;
    }
  else
    /* 8 kilobytes is a sensible starting size.  It ought to be bigger
       than the kernel pipe buffer, and it's definitely bigger than
       the majority of C source files.  */
    size = 8 * 1024;

689 690 691 692 693
  /* The + 16 here is space for the final '\n' and 15 bytes of padding,
     used to quiet warnings from valgrind or Address Sanitizer, when the
     optimized lexer accesses aligned 16-byte memory chunks, including
     the bytes after the malloced, area, and stops lexing on '\n'.  */
  buf = XNEWVEC (uchar, size + 16);
694 695 696 697 698 699
  total = 0;
  while ((count = read (file->fd, buf + total, size - total)) > 0)
    {
      total += count;

      if (total == size)
700
	{
701 702 703
	  if (regular)
	    break;
	  size *= 2;
704
	  buf = XRESIZEVEC (uchar, buf, size + 16);
705
	}
706
    }
707 708

  if (count < 0)
709
    {
710
      cpp_errno (pfile, CPP_DL_ERROR, file->path);
711
      free (buf);
712
      return false;
713
    }
714 715

  if (regular && total != size && STAT_SIZE_RELIABLE (file->st))
716 717
    cpp_error (pfile, CPP_DL_WARNING,
	       "%s is shorter than expected", file->path);
718

719 720
  file->buffer = _cpp_convert_input (pfile,
				     CPP_OPTION (pfile, input_charset),
721
				     buf, size + 16, total,
722 723
				     &file->buffer_start,
				     &file->st.st_size);
724 725 726 727 728 729
  file->buffer_valid = true;

  return true;
}

/* Convenience wrapper around read_file_guts that opens the file if
730
   necessary and closes the file descriptor after reading.  FILE must
731 732 733 734 735 736 737
   have been passed through find_file() at some stage.  */
static bool
read_file (cpp_reader *pfile, _cpp_file *file)
{
  /* If we already have its contents in memory, succeed immediately.  */
  if (file->buffer_valid)
    return true;
738

739 740 741
  /* If an earlier read failed for some reason don't try again.  */
  if (file->dont_read || file->err_no)
    return false;
742

743 744
  if (file->fd == -1 && !open_file (file))
    {
James E Wilson committed
745
      open_file_failed (pfile, file, 0);
746
      return false;
747
    }
Zack Weinberg committed
748

749 750 751
  file->dont_read = !read_file_guts (pfile, file);
  close (file->fd);
  file->fd = -1;
752

753
  return !file->dont_read;
754 755
}

756 757
/* Returns TRUE if FILE's contents have been successfully placed in
   FILE->buffer and the file should be stacked, otherwise false.  */
758
static bool
759
should_stack_file (cpp_reader *pfile, _cpp_file *file, bool import)
760
{
761
  _cpp_file *f;
762

763 764 765 766
  /* Skip once-only files.  */
  if (file->once_only)
    return false;

Eric Christopher committed
767
  /* We must mark the file once-only if #import now, before header
768 769 770 771 772 773 774 775 776 777 778
     guard checks.  Otherwise, undefining the header guard might
     cause the file to be re-stacked.  */
  if (import)
    {
      _cpp_mark_file_once_only (pfile, file);

      /* Don't stack files that have been stacked before.  */
      if (file->stack_count)
	return false;
    }

779 780 781
  /* Skip if the file had a header guard and the macro is defined.
     PCH relies on this appearing before the PCH handler below.  */
  if (file->cmacro && file->cmacro->type == NT_MACRO)
782 783
    return false;

784
  /* Handle PCH files immediately; don't stack them.  */
785
  if (file->pchname)
786
    {
787
      pfile->cb.read_pch (pfile, file->pchname, file->fd, file->path);
788
      file->fd = -1;
789 790
      free ((void *) file->pchname);
      file->pchname = NULL;
791
      return false;
792
    }
793 794 795

  if (!read_file (pfile, file))
    return false;
796

Geoffrey Keating committed
797 798 799 800 801 802 803 804 805 806 807 808 809
  /* Check the file against the PCH file.  This is done before
     checking against files we've already seen, since it may save on
     I/O.  */
  if (check_file_against_entries (pfile, file, import))
    {
      /* If this isn't a #import, but yet we can't include the file,
	 that means that it was #import-ed in the PCH file,
	 so we can never include it again.  */
      if (! import)
	_cpp_mark_file_once_only (pfile, file);
      return false;
    }

810 811 812
  /* Now we've read the file's contents, we can stack it if there
     are no once-only files.  */
  if (!pfile->seen_once_only)
813 814
    return true;

815
  /* We may have read the file under a different name.  Look
816
     for likely candidates and compare file contents to be sure.  */
817
  for (f = pfile->all_files; f; f = f->next_file)
818 819 820 821
    {
      if (f == file)
	continue;

822 823
      if ((import || f->once_only)
	  && f->err_no == 0
824
	  && f->st.st_mtime == file->st.st_mtime
825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856
	  && f->st.st_size == file->st.st_size)
	{
	  _cpp_file *ref_file;
	  bool same_file_p = false;

	  if (f->buffer && !f->buffer_valid)
	    {
	      /* We already have a buffer but it is not valid, because
		 the file is still stacked.  Make a new one.  */
	      ref_file = make_cpp_file (pfile, f->dir, f->name);
	      ref_file->path = f->path;
	    }
	  else
	    /* The file is not stacked anymore.  We can reuse it.  */
	    ref_file = f;

	  same_file_p = read_file (pfile, ref_file)
			/* Size might have changed in read_file().  */
			&& ref_file->st.st_size == file->st.st_size
			&& !memcmp (ref_file->buffer,
				    file->buffer,
				    file->st.st_size);

	  if (f->buffer && !f->buffer_valid)
	    {
	      ref_file->path = 0;
	      destroy_cpp_file (ref_file);
	    }

	  if (same_file_p)
	    break;
	}
857
    }
858

859 860 861 862 863 864 865
  return f == NULL;
}

/* Place the file referenced by FILE into a new buffer on the buffer
   stack if possible.  IMPORT is true if this stacking attempt is
   because of a #import directive.  Returns true if a buffer is
   stacked.  */
866 867
bool
_cpp_stack_file (cpp_reader *pfile, _cpp_file *file, bool import)
868 869 870 871 872 873 874
{
  cpp_buffer *buffer;
  int sysp;

  if (!should_stack_file (pfile, file, import))
      return false;

875 876 877 878
  if (pfile->buffer == NULL || file->dir == NULL)
    sysp = 0;
  else
    sysp = MAX (pfile->buffer->sysp,  file->dir->sysp);
879 880 881 882 883 884 885 886 887 888 889 890 891 892

  /* Add the file to the dependencies on its first inclusion.  */
  if (CPP_OPTION (pfile, deps.style) > !!sysp && !file->stack_count)
    {
      if (!file->main_file || !CPP_OPTION (pfile, deps.ignore_main_file))
	deps_add_dep (pfile->deps, file->path);
    }

  /* Clear buffer_valid since _cpp_clean_line messes it up.  */
  file->buffer_valid = false;
  file->stack_count++;

  /* Stack the buffer.  */
  buffer = cpp_push_buffer (pfile, file->buffer, file->st.st_size,
893 894
			    CPP_OPTION (pfile, preprocessed)
			    && !CPP_OPTION (pfile, directives_only));
895
  buffer->file = file;
896
  buffer->sysp = sysp;
897
  buffer->to_free = file->buffer_start;
898 899 900 901 902 903

  /* Initialize controlling macro state.  */
  pfile->mi_valid = true;
  pfile->mi_cmacro = 0;

  /* Generate the call back.  */
904
  _cpp_do_file_change (pfile, LC_ENTER, file->path, 1, sysp);
905 906

  return true;
Zack Weinberg committed
907 908
}

909
/* Mark FILE to be included once only.  */
910
void
911
_cpp_mark_file_once_only (cpp_reader *pfile, _cpp_file *file)
912
{
913 914
  pfile->seen_once_only = true;
  file->once_only = true;
915 916 917
}

/* Return the directory from which searching for FNAME should start,
918
   considering the directive TYPE and ANGLE_BRACKETS.  If there is
919 920 921 922 923 924 925
   nothing left in the path, returns NULL.  */
static struct cpp_dir *
search_path_head (cpp_reader *pfile, const char *fname, int angle_brackets,
		  enum include_type type)
{
  cpp_dir *dir;
  _cpp_file *file;
926

927
  if (IS_ABSOLUTE_PATH (fname))
928 929
    return &pfile->no_search_path;

930 931
  /* pfile->buffer is NULL when processing an -include command-line flag.  */
  file = pfile->buffer == NULL ? pfile->main_file : pfile->buffer->file;
932 933

  /* For #include_next, skip in the search path past the dir in which
934 935
     the current file was found, but if it was found via an absolute
     path use the normal search logic.  */
936 937
  if (type == IT_INCLUDE_NEXT && file->dir
      && file->dir != &pfile->no_search_path)
938
    dir = file->dir->next;
939
  else if (angle_brackets)
940 941 942 943 944 945 946
    dir = pfile->bracket_include;
  else if (type == IT_CMDLINE)
    /* -include and -imacros use the #include "" chain with the
       preprocessor's cwd prepended.  */
    return make_cpp_dir (pfile, "./", false);
  else if (pfile->quote_ignores_source_dir)
    dir = pfile->quote_include;
947
  else
948 949
    return make_cpp_dir (pfile, dir_name_of_file (file),
			 pfile->buffer ? pfile->buffer->sysp : 0);
950 951

  if (dir == NULL)
952
    cpp_error (pfile, CPP_DL_ERROR,
953 954 955 956
	       "no include path in which to search for %s", fname);

  return dir;
}
957

958
/* Strip the basename from the file's path.  It ends with a slash if
959
   of nonzero length.  Note that this procedure also works for
960 961 962 963 964
   <stdin>, which is represented by the empty string.  */
static const char *
dir_name_of_file (_cpp_file *file)
{
  if (!file->dir_name)
965
    {
966
      size_t len = lbasename (file->path) - file->path;
967
      char *dir_name = XNEWVEC (char, len + 1);
968 969 970 971

      memcpy (dir_name, file->path, len);
      dir_name[len] = '\0';
      file->dir_name = dir_name;
972 973
    }

974 975 976 977 978 979 980 981 982 983 984
  return file->dir_name;
}

/* Handles #include-family directives (distinguished by TYPE),
   including HEADER, and the command line -imacros and -include.
   Returns true if a buffer was stacked.  */
bool
_cpp_stack_include (cpp_reader *pfile, const char *fname, int angle_brackets,
		    enum include_type type)
{
  struct cpp_dir *dir;
985
  _cpp_file *file;
986
  bool stacked;
987 988 989 990 991

  dir = search_path_head (pfile, fname, angle_brackets, type);
  if (!dir)
    return false;

Joseph Myers committed
992 993 994 995
  file = _cpp_find_file (pfile, fname, dir, false, angle_brackets,
			 type == IT_DEFAULT);
  if (type == IT_DEFAULT && file == NULL)
    return false;
996

997 998 999 1000 1001 1002 1003 1004
  /* Compensate for the increment in linemap_add that occurs if
      _cpp_stack_file actually stacks the file.  In the case of a
     normal #include, we're currently at the start of the line
     *following* the #include.  A separate source_location for this
     location makes no sense (until we do the LC_LEAVE), and
     complicates LAST_SOURCE_LINE_LOCATION.  This does not apply if we
     found a PCH file (in which case linemap_add is not called) or we
     were included from the command-line.  */
Joseph Myers committed
1005 1006
  if (file->pchname == NULL && file->err_no == 0
      && type != IT_CMDLINE && type != IT_DEFAULT)
1007 1008
    pfile->line_table->highest_location--;

1009 1010 1011 1012 1013 1014 1015 1016
  stacked = _cpp_stack_file (pfile, file, type == IT_IMPORT);

  if (!stacked)
    /* _cpp_stack_file didn't stack the file, so let's rollback the
       compensation dance we performed above.  */
    pfile->line_table->highest_location++;

  return stacked;
1017 1018 1019 1020
}

/* Could not open FILE.  The complication is dependency output.  */
static void
James E Wilson committed
1021
open_file_failed (cpp_reader *pfile, _cpp_file *file, int angle_brackets)
1022
{
1023
  int sysp = pfile->line_table->highest_line > 1 && pfile->buffer ? pfile->buffer->sysp : 0;
James E Wilson committed
1024
  bool print_dep = CPP_OPTION (pfile, deps.style) > (angle_brackets || !!sysp);
1025 1026 1027

  errno = file->err_no;
  if (print_dep && CPP_OPTION (pfile, deps.missing_files) && errno == ENOENT)
1028 1029 1030 1031 1032 1033 1034
    {
      deps_add_dep (pfile->deps, file->name);
      /* If the preprocessor output (other than dependency information) is
         being used, we must also flag an error.  */
      if (CPP_OPTION (pfile, deps.need_preprocessor_output))
	cpp_errno (pfile, CPP_DL_FATAL, file->path);
    }
1035
  else
Zack Weinberg committed
1036
    {
1037 1038 1039 1040 1041 1042 1043 1044 1045 1046
      /* If we are not outputting dependencies, or if we are and dependencies
         were requested for this file, or if preprocessor output is needed
         in addition to dependency information, this is an error.

         Otherwise (outputting dependencies but not for this file, and not
         using the preprocessor output), we can still produce correct output
         so it's only a warning.  */
      if (CPP_OPTION (pfile, deps.style) == DEPS_NONE
          || print_dep
          || CPP_OPTION (pfile, deps.need_preprocessor_output))
1047
	cpp_errno (pfile, CPP_DL_FATAL, file->path);
1048 1049
      else
	cpp_errno (pfile, CPP_DL_WARNING, file->path);
Zack Weinberg committed
1050
    }
1051
}
1052

1053 1054 1055
/* Search in the chain beginning at HEAD for a file whose search path
   started at START_DIR != NULL.  */
static struct file_hash_entry *
1056
search_cache (struct file_hash_entry *head, const cpp_dir *start_dir)
1057
{
1058 1059 1060 1061
  while (head && head->start_dir != start_dir)
    head = head->next;

  return head;
1062 1063 1064 1065 1066 1067 1068 1069
}

/* Allocate a new _cpp_file structure.  */
static _cpp_file *
make_cpp_file (cpp_reader *pfile, cpp_dir *dir, const char *fname)
{
  _cpp_file *file;

1070
  file = XCNEW (_cpp_file);
1071 1072 1073 1074 1075 1076 1077 1078
  file->main_file = !pfile->buffer;
  file->fd = -1;
  file->dir = dir;
  file->name = xstrdup (fname);

  return file;
}

1079 1080 1081 1082
/* Release a _cpp_file structure.  */
static void
destroy_cpp_file (_cpp_file *file)
{
1083
  free ((void *) file->buffer_start);
1084 1085 1086 1087
  free ((void *) file->name);
  free (file);
}

1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100
/* Release all the files allocated by this reader.  */
static void
destroy_all_cpp_files (cpp_reader *pfile)
{
  _cpp_file *iter = pfile->all_files;
  while (iter)
    {
      _cpp_file *next = iter->next_file;
      destroy_cpp_file (iter);
      iter = next;
    }
}

1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114
/* A hash of directory names.  The directory names are the path names
   of files which contain a #include "", the included file name is
   appended to this directories.

   To avoid duplicate entries we follow the convention that all
   non-empty directory names should end in a '/'.  DIR_NAME must be
   stored in permanently allocated memory.  */
static cpp_dir *
make_cpp_dir (cpp_reader *pfile, const char *dir_name, int sysp)
{
  struct file_hash_entry *entry, **hash_slot;
  cpp_dir *dir;

  hash_slot = (struct file_hash_entry **)
1115
    htab_find_slot_with_hash (pfile->dir_hash, dir_name,
1116 1117
			      htab_hash_string (dir_name),
			      INSERT);
1118 1119 1120 1121 1122 1123

  /* Have we already hashed this directory?  */
  for (entry = *hash_slot; entry; entry = entry->next)
    if (entry->start_dir == NULL)
      return entry->u.dir;

1124
  dir = XCNEW (cpp_dir);
1125 1126 1127 1128
  dir->next = pfile->quote_include;
  dir->name = (char *) dir_name;
  dir->len = strlen (dir_name);
  dir->sysp = sysp;
1129
  dir->construct = 0;
1130 1131 1132 1133 1134

  /* Store this new result in the hash table.  */
  entry = new_file_hash_entry (pfile);
  entry->next = *hash_slot;
  entry->start_dir = NULL;
1135
  entry->location = pfile->line_table->highest_location;
1136 1137 1138 1139 1140 1141 1142 1143 1144 1145
  entry->u.dir = dir;
  *hash_slot = entry;

  return dir;
}

/* Create a new block of memory for file hash entries.  */
static void
allocate_file_hash_entries (cpp_reader *pfile)
{
1146 1147 1148 1149
  struct file_hash_entry_pool *pool = XNEW (struct file_hash_entry_pool);
  pool->file_hash_entries_used = 0;
  pool->next = pfile->file_hash_entries;
  pfile->file_hash_entries = pool;
1150 1151 1152 1153 1154 1155
}

/* Return a new file hash entry.  */
static struct file_hash_entry *
new_file_hash_entry (cpp_reader *pfile)
{
1156 1157
  unsigned int idx;
  if (pfile->file_hash_entries->file_hash_entries_used == FILE_HASH_POOL_SIZE)
1158 1159
    allocate_file_hash_entries (pfile);

1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174
  idx = pfile->file_hash_entries->file_hash_entries_used++;
  return &pfile->file_hash_entries->pool[idx];
}

/* Free the file hash entry pools.  */
static void
free_file_hash_entries (cpp_reader *pfile)
{
  struct file_hash_entry_pool *iter = pfile->file_hash_entries;
  while (iter)
    {
      struct file_hash_entry_pool *next = iter->next;
      free (iter);
      iter = next;
    }
1175 1176 1177 1178 1179 1180 1181 1182 1183 1184
}

/* Returns TRUE if a file FNAME has ever been successfully opened.
   This routine is not intended to correctly handle filenames aliased
   by links or redundant . or .. traversals etc.  */
bool
cpp_included (cpp_reader *pfile, const char *fname)
{
  struct file_hash_entry *entry;

1185 1186
  entry = (struct file_hash_entry *)
     htab_find_with_hash (pfile->file_hash, fname, htab_hash_string (fname));
1187 1188 1189 1190 1191 1192 1193

  while (entry && (entry->start_dir == NULL || entry->u.file->err_no))
    entry = entry->next;

  return entry != NULL;
}

1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212
/* Returns TRUE if a file FNAME has ever been successfully opened
   before LOCATION.  This routine is not intended to correctly handle
   filenames aliased by links or redundant . or .. traversals etc.  */
bool
cpp_included_before (cpp_reader *pfile, const char *fname,
		     source_location location)
{
  struct file_hash_entry *entry;

  entry = (struct file_hash_entry *)
     htab_find_with_hash (pfile->file_hash, fname, htab_hash_string (fname));

  while (entry && (entry->start_dir == NULL || entry->u.file->err_no
		   || entry->location > location))
    entry = entry->next;

  return entry != NULL;
}

1213
/* Calculate the hash value of a file hash entry P.  */
1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227

static hashval_t
file_hash_hash (const void *p)
{
  struct file_hash_entry *entry = (struct file_hash_entry *) p;
  const char *hname;
  if (entry->start_dir)
    hname = entry->u.file->name;
  else
    hname = entry->u.dir->name;

  return htab_hash_string (hname);
}

1228 1229
/* Compare a string Q against a file hash entry P.  */
static int
1230
file_hash_eq (const void *p, const void *q)
1231 1232 1233 1234 1235 1236 1237 1238 1239 1240
{
  struct file_hash_entry *entry = (struct file_hash_entry *) p;
  const char *fname = (const char *) q;
  const char *hname;

  if (entry->start_dir)
    hname = entry->u.file->name;
  else
    hname = entry->u.dir->name;

1241
  return filename_cmp (hname, fname) == 0;
1242 1243
}

1244 1245 1246 1247 1248
/* Compare entries in the nonexistent file hash table.  These are just
   strings.  */
static int
nonexistent_file_hash_eq (const void *p, const void *q)
{
1249
  return filename_cmp ((const char *) p, (const char *) q) == 0;
1250 1251
}

1252 1253 1254 1255
/* Initialize everything in this source file.  */
void
_cpp_init_files (cpp_reader *pfile)
{
1256
  pfile->file_hash = htab_create_alloc (127, file_hash_hash, file_hash_eq,
1257
					NULL, xcalloc, free);
1258 1259
  pfile->dir_hash = htab_create_alloc (127, file_hash_hash, file_hash_eq,
					NULL, xcalloc, free);
1260
  allocate_file_hash_entries (pfile);
1261 1262 1263 1264 1265 1266
  pfile->nonexistent_file_hash = htab_create_alloc (127, htab_hash_string,
						    nonexistent_file_hash_eq,
						    NULL, xcalloc, free);
  _obstack_begin (&pfile->nonexistent_file_ob, 0, 0,
		  (void *(*) (long)) xmalloc,
		  (void (*) (void *)) free);
1267 1268 1269 1270 1271 1272 1273
}

/* Finalize everything in this source file.  */
void
_cpp_cleanup_files (cpp_reader *pfile)
{
  htab_delete (pfile->file_hash);
1274
  htab_delete (pfile->dir_hash);
1275 1276
  htab_delete (pfile->nonexistent_file_hash);
  obstack_free (&pfile->nonexistent_file_ob, 0);
1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289
  free_file_hash_entries (pfile);
  destroy_all_cpp_files (pfile);
}

/* Make the parser forget about files it has seen.  This can be useful
   for resetting the parser to start another run.  */
void
cpp_clear_file_cache (cpp_reader *pfile)
{
  _cpp_cleanup_files (pfile);
  pfile->file_hash_entries = NULL;
  pfile->all_files = NULL;
  _cpp_init_files (pfile);
1290 1291 1292 1293 1294 1295
}

/* Enter a file name in the hash for the sake of cpp_included.  */
void
_cpp_fake_include (cpp_reader *pfile, const char *fname)
{
Joseph Myers committed
1296
  _cpp_find_file (pfile, fname, pfile->buffer->file->dir, true, 0, false);
Zack Weinberg committed
1297 1298
}

1299
/* Not everyone who wants to set system-header-ness on a buffer can
1300 1301
   see the details of a buffer.  This is an exported interface because
   fix-header needs it.  */
1302
void
1303
cpp_make_system_header (cpp_reader *pfile, int syshdr, int externc)
1304
{
1305
  int flags = 0;
1306
  const struct line_maps *line_table = pfile->line_table;
1307
  const struct line_map *map = LINEMAPS_LAST_ORDINARY_MAP (line_table);
1308 1309 1310
  /* 1 = system header, 2 = system header to be treated as C.  */
  if (syshdr)
    flags = 1 + (externc != 0);
1311
  pfile->buffer->sysp = flags;
1312
  _cpp_do_file_change (pfile, LC_RENAME, ORDINARY_MAP_FILE_NAME (map),
1313
		       SOURCE_LINE (map, pfile->line_table->highest_line), flags);
1314 1315
}

1316 1317 1318
/* Allow the client to change the current file.  Used by the front end
   to achieve pseudo-file names like <built-in>.
   If REASON is LC_LEAVE, then NEW_NAME must be NULL.  */
1319
void
1320 1321
cpp_change_file (cpp_reader *pfile, enum lc_reason reason,
		 const char *new_name)
1322
{
1323
  _cpp_do_file_change (pfile, reason, new_name, 1, 0);
1324 1325
}

1326 1327 1328 1329 1330 1331
struct report_missing_guard_data
{
  const char **paths;
  size_t count;
};

1332
/* Callback function for htab_traverse.  */
1333
static int
1334
report_missing_guard (void **slot, void *d)
1335
{
1336
  struct file_hash_entry *entry = (struct file_hash_entry *) *slot;
1337 1338
  struct report_missing_guard_data *data
    = (struct report_missing_guard_data *) d;
1339

1340 1341
  /* Skip directories.  */
  if (entry->start_dir != NULL)
1342
    {
1343 1344 1345
      _cpp_file *file = entry->u.file;

      /* We don't want MI guard advice for the main file.  */
1346 1347
      if (!file->once_only && file->cmacro == NULL
	  && file->stack_count == 1 && !file->main_file)
1348
	{
1349
	  if (data->paths == NULL)
1350
	    {
1351 1352
	      data->paths = XCNEWVEC (const char *, data->count);
	      data->count = 0;
1353 1354
	    }

1355
	  data->paths[data->count++] = file->path;
1356 1357 1358
	}
    }

1359 1360 1361 1362 1363 1364 1365 1366 1367
  /* Keep traversing the hash table.  */
  return 1;
}

/* Comparison function for qsort.  */
static int
report_missing_guard_cmp (const void *p1, const void *p2)
{
  return strcmp (*(const char *const *) p1, *(const char *const *) p2);
1368 1369
}

1370 1371 1372 1373
/* Report on all files that might benefit from a multiple include guard.
   Triggered by -H.  */
void
_cpp_report_missing_guards (cpp_reader *pfile)
1374
{
1375 1376 1377 1378 1379
  struct report_missing_guard_data data;

  data.paths = NULL;
  data.count = htab_elements (pfile->file_hash);
  htab_traverse (pfile->file_hash, report_missing_guard, &data);
1380

1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397
  if (data.paths != NULL)
    {
      size_t i;

      /* Sort the paths to avoid outputting them in hash table
	 order.  */
      qsort (data.paths, data.count, sizeof (const char *),
	     report_missing_guard_cmp);
      fputs (_("Multiple include guards may be useful for:\n"),
	     stderr);
      for (i = 0; i < data.count; i++)
	{
	  fputs (data.paths[i], stderr);
	  putc ('\n', stderr);
	}
      free (data.paths);
    }
1398 1399
}

1400
/* Locate HEADER, and determine whether it is newer than the current
1401
   file.  If it cannot be located or dated, return -1, if it is
1402
   newer, return 1, otherwise 0.  */
1403
int
1404 1405
_cpp_compare_file_date (cpp_reader *pfile, const char *fname,
			int angle_brackets)
1406
{
1407 1408
  _cpp_file *file;
  struct cpp_dir *dir;
1409

1410 1411
  dir = search_path_head (pfile, fname, angle_brackets, IT_INCLUDE);
  if (!dir)
1412
    return -1;
1413

Joseph Myers committed
1414
  file = _cpp_find_file (pfile, fname, dir, false, angle_brackets, false);
1415 1416
  if (file->err_no)
    return -1;
1417

1418
  if (file->fd != -1)
1419
    {
1420 1421
      close (file->fd);
      file->fd = -1;
1422
    }
Zack Weinberg committed
1423

1424
  return file->st.st_mtime > pfile->buffer->file->st.st_mtime;
1425 1426
}

1427 1428 1429
/* Pushes the given file onto the buffer stack.  Returns nonzero if
   successful.  */
bool
1430
cpp_push_include (cpp_reader *pfile, const char *fname)
1431
{
1432
  return _cpp_stack_include (pfile, fname, false, IT_CMDLINE);
1433 1434
}

Joseph Myers committed
1435 1436 1437 1438 1439 1440 1441 1442 1443
/* Pushes the given file, implicitly included at the start of a
   compilation, onto the buffer stack but without any errors if the
   file is not found.  Returns nonzero if successful.  */
bool
cpp_push_default_include (cpp_reader *pfile, const char *fname)
{
  return _cpp_stack_include (pfile, fname, true, IT_DEFAULT);
}

1444
/* Do appropriate cleanup when a file INC's buffer is popped off the
1445 1446
   input stack.  */
void
1447 1448
_cpp_pop_file_buffer (cpp_reader *pfile, _cpp_file *file,
		      const unsigned char *to_free)
1449
{
1450
  /* Record the inclusion-preventing macro, which could be NULL
1451
     meaning no controlling macro.  */
1452 1453
  if (pfile->mi_valid && file->cmacro == NULL)
    file->cmacro = pfile->mi_cmacro;
Neil Booth committed
1454 1455

  /* Invalidate control macros in the #including file.  */
1456
  pfile->mi_valid = false;
1457

1458
  if (to_free)
1459
    {
1460 1461 1462 1463 1464 1465 1466
      if (to_free == file->buffer_start)
	{
	  file->buffer_start = NULL;
	  file->buffer = NULL;
	  file->buffer_valid = false;
	}
      free ((void *) to_free);
1467
    }
1468 1469
}

1470 1471 1472 1473 1474 1475 1476
/* Return the file name associated with FILE.  */
const char *
_cpp_get_file_name (_cpp_file *file)
{
  return file->name;
}

1477 1478 1479 1480 1481 1482 1483
/* Inteface to file statistics record in _cpp_file structure. */
struct stat *
_cpp_get_file_stat (_cpp_file *file)
{
    return &file->st;
}

1484 1485 1486
/* Set the include chain for "" to QUOTE, for <> to BRACKET.  If
   QUOTE_IGNORES_SOURCE_DIR, then "" includes do not look in the
   directory of the including file.
1487

1488 1489 1490 1491
   If BRACKET does not lie in the QUOTE chain, it is set to QUOTE.  */
void
cpp_set_include_chains (cpp_reader *pfile, cpp_dir *quote, cpp_dir *bracket,
			int quote_ignores_source_dir)
1492
{
1493 1494 1495
  pfile->quote_include = quote;
  pfile->bracket_include = quote;
  pfile->quote_ignores_source_dir = quote_ignores_source_dir;
1496

1497
  for (; quote; quote = quote->next)
1498
    {
1499 1500 1501 1502
      quote->name_map = NULL;
      quote->len = strlen (quote->name);
      if (quote == bracket)
	pfile->bracket_include = bracket;
1503
    }
1504 1505
}

1506 1507 1508 1509 1510 1511 1512 1513 1514 1515
/* Append the file name to the directory to create the path, but don't
   turn / into // or // into ///; // may be a namespace escape.  */
static char *
append_file_to_dir (const char *fname, cpp_dir *dir)
{
  size_t dlen, flen;
  char *path;

  dlen = dir->len;
  flen = strlen (fname);
1516
  path = XNEWVEC (char, dlen + 1 + flen + 1);
1517
  memcpy (path, dir->name, dlen);
1518
  if (dlen && !IS_DIR_SEPARATOR (path[dlen - 1]))
1519 1520 1521 1522 1523
    path[dlen++] = '/';
  memcpy (&path[dlen], fname, flen + 1);

  return path;
}
1524 1525

/* Read a space delimited string of unlimited length from a stdio
1526
   file F.  */
1527
static char *
1528
read_filename_string (int ch, FILE *f)
1529 1530 1531 1532 1533
{
  char *alloc, *set;
  int len;

  len = 20;
1534
  set = alloc = XNEWVEC (char, len + 1);
1535
  if (! is_space (ch))
1536 1537
    {
      *set++ = ch;
1538
      while ((ch = getc (f)) != EOF && ! is_space (ch))
1539 1540 1541 1542
	{
	  if (set - alloc == len)
	    {
	      len *= 2;
1543
	      alloc = XRESIZEVEC (char, alloc, len + 1);
1544 1545 1546 1547 1548 1549 1550 1551 1552 1553
	      set = alloc + len / 2;
	    }
	  *set++ = ch;
	}
    }
  *set = '\0';
  ungetc (ch, f);
  return alloc;
}

1554 1555 1556
/* Read the file name map file for DIR.  */
static void
read_name_map (cpp_dir *dir)
1557
{
1558
  static const char FILE_NAME_MAP_FILE[] = "header.gcc";
1559 1560
  char *name;
  FILE *f;
1561 1562 1563
  size_t len, count = 0, room = 9;

  len = dir->len;
1564
  name = (char *) alloca (len + sizeof (FILE_NAME_MAP_FILE) + 1);
1565
  memcpy (name, dir->name, len);
1566
  if (len && !IS_DIR_SEPARATOR (name[len - 1]))
1567 1568
    name[len++] = '/';
  strcpy (name + len, FILE_NAME_MAP_FILE);
1569
  f = fopen (name, "r");
1570

1571
  dir->name_map = XNEWVEC (const char *, room);
1572

1573 1574
  /* Silently return NULL if we cannot open.  */
  if (f)
1575 1576 1577 1578 1579
    {
      int ch;

      while ((ch = getc (f)) != EOF)
	{
1580
	  char *to;
1581

1582
	  if (is_space (ch))
1583
	    continue;
1584 1585 1586 1587

	  if (count + 2 > room)
	    {
	      room += 8;
1588
	      dir->name_map = XRESIZEVEC (const char *, dir->name_map, room);
1589 1590 1591
	    }

	  dir->name_map[count] = read_filename_string (ch, f);
1592
	  while ((ch = getc (f)) != EOF && is_hspace (ch))
1593 1594
	    ;

1595
	  to = read_filename_string (ch, f);
1596
	  if (IS_ABSOLUTE_PATH (to))
1597
	    dir->name_map[count + 1] = to;
1598 1599
	  else
	    {
1600
	      dir->name_map[count + 1] = append_file_to_dir (to, dir);
1601
	      free (to);
1602
	    }
1603

1604
	  count += 2;
1605 1606 1607 1608
	  while ((ch = getc (f)) != '\n')
	    if (ch == EOF)
	      break;
	}
1609

1610 1611
      fclose (f);
    }
1612

1613 1614
  /* Terminate the list of maps.  */
  dir->name_map[count] = NULL;
1615
}
1616

1617 1618 1619
/* Remap a FILE's name based on the file_name_map, if any, for
   FILE->dir.  If the file name has any directory separators,
   recursively check those directories too.  */
1620
static char *
1621
remap_filename (cpp_reader *pfile, _cpp_file *file)
1622
{
1623 1624 1625 1626
  const char *fname, *p;
  char *new_dir;
  cpp_dir *dir;
  size_t index, len;
1627

1628 1629
  dir = file->dir;
  fname = file->name;
1630

1631 1632 1633 1634
  for (;;)
    {
      if (!dir->name_map)
	read_name_map (dir);
1635

1636
      for (index = 0; dir->name_map[index]; index += 2)
1637
	if (!filename_cmp (dir->name_map[index], fname))
1638
	    return xstrdup (dir->name_map[index + 1]);
1639 1640
      if (IS_ABSOLUTE_PATH (fname))
	return NULL;
1641
      p = strchr (fname, '/');
1642 1643 1644 1645 1646 1647 1648
#ifdef HAVE_DOS_BASED_FILE_SYSTEM
      {
	char *p2 = strchr (fname, '\\');
	if (!p || (p > p2))
	  p = p2;
      }
#endif
1649 1650
      if (!p || p == fname)
	return NULL;
1651

1652
      len = dir->len + (p - fname + 1);
1653
      new_dir = XNEWVEC (char, len + 1);
1654 1655 1656
      memcpy (new_dir, dir->name, dir->len);
      memcpy (new_dir + dir->len, fname, p - fname + 1);
      new_dir[len] = '\0';
1657

1658 1659
      dir = make_cpp_dir (pfile, new_dir, dir->sysp);
      fname = p + 1;
1660 1661
    }
}
1662

1663 1664 1665
/* Returns true if PCHNAME is a valid PCH file for FILE.  */
static bool
validate_pch (cpp_reader *pfile, _cpp_file *file, const char *pchname)
1666
{
1667
  const char *saved_path = file->path;
1668
  bool valid = false;
1669

1670 1671
  file->path = pchname;
  if (open_file (file))
1672
    {
1673
      valid = 1 & pfile->cb.valid_pch (pfile, pchname, file->fd);
1674

1675
      if (!valid)
1676
	{
1677 1678
	  close (file->fd);
	  file->fd = -1;
1679 1680
	}

1681
      if (CPP_OPTION (pfile, print_include_names))
1682
	{
1683
	  unsigned int i;
Per Bothner committed
1684
	  for (i = 1; i < pfile->line_table->depth; i++)
1685 1686
	    putc ('.', stderr);
	  fprintf (stderr, "%c %s\n",
1687
		   valid ? '!' : 'x', pchname);
1688 1689 1690
	}
    }

1691
  file->path = saved_path;
1692
  return valid;
1693
}
1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704

/* Get the path associated with the _cpp_file F.  The path includes
   the base name from the include directive and the directory it was
   found in via the search path.  */

const char *
cpp_get_path (struct _cpp_file *f)
{
  return f->path;
}

1705 1706 1707 1708 1709 1710 1711 1712
/* Get the directory associated with the _cpp_file F.  */

cpp_dir *
cpp_get_dir (struct _cpp_file *f)
{
  return f->dir;
}

1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737
/* Get the cpp_buffer currently associated with the cpp_reader
   PFILE.  */

cpp_buffer *
cpp_get_buffer (cpp_reader *pfile)
{
  return pfile->buffer;
}

/* Get the _cpp_file associated with the cpp_buffer B.  */

_cpp_file *
cpp_get_file (cpp_buffer *b)
{
  return b->file;
}

/* Get the previous cpp_buffer given a cpp_buffer B.  The previous
   buffer is the buffer that included the given buffer.  */

cpp_buffer *
cpp_get_prev (cpp_buffer *b)
{
  return b->prev;
}
Geoffrey Keating committed
1738

1739
/* This data structure holds the list of header files that were seen
Geoffrey Keating committed
1740 1741 1742 1743 1744 1745
   while the PCH was being built.  The 'entries' field is kept sorted
   in memcmp() order; yes, this means that on little-endian systems,
   it's sorted initially by the least-significant byte of 'size', but
   that's OK.  The code does rely on having entries with the same size
   next to each other.  */

1746 1747 1748 1749 1750 1751 1752 1753 1754 1755
struct pchf_entry {
  /* The size of this file.  This is used to save running a MD5 checksum
     if the sizes don't match.  */
  off_t size;
  /* The MD5 checksum of this file.  */
  unsigned char sum[16];
  /* Is this file to be included only once?  */
  bool once_only;
};

Geoffrey Keating committed
1756 1757 1758 1759 1760 1761 1762 1763
struct pchf_data {
  /* Number of pchf_entry structures.  */
  size_t count;

  /* Are there any values with once_only set?
     This is used as an optimisation, it means we don't have to search
     the structure if we're processing a regular #include.  */
  bool have_once_only;
Eric Christopher committed
1764

1765
  struct pchf_entry entries[1];
Geoffrey Keating committed
1766 1767 1768 1769
};

static struct pchf_data *pchf;

1770 1771 1772 1773
/* A qsort ordering function for pchf_entry structures.  */

static int
pchf_save_compare (const void *e1, const void *e2)
Geoffrey Keating committed
1774
{
1775 1776
  return memcmp (e1, e2, sizeof (struct pchf_entry));
}
Geoffrey Keating committed
1777

1778
/* Create and write to F a pchf_data structure.  */
Geoffrey Keating committed
1779

1780 1781
bool
_cpp_save_file_entries (cpp_reader *pfile, FILE *fp)
Geoffrey Keating committed
1782
{
1783 1784 1785 1786
  size_t count = 0;
  struct pchf_data *result;
  size_t result_size;
  _cpp_file *f;
1787
  bool ret;
Geoffrey Keating committed
1788

1789 1790 1791 1792 1793
  for (f = pfile->all_files; f; f = f->next_file)
    ++count;

  result_size = (sizeof (struct pchf_data)
		 + sizeof (struct pchf_entry) * (count - 1));
1794
  result = XCNEWVAR (struct pchf_data, result_size);
1795 1796 1797 1798 1799

  result->count = 0;
  result->have_once_only = false;

  for (f = pfile->all_files; f; f = f->next_file)
Geoffrey Keating committed
1800
    {
1801
      size_t count;
Geoffrey Keating committed
1802 1803 1804 1805

      /* This should probably never happen, since if a read error occurred
	 the PCH file shouldn't be written...  */
      if (f->dont_read || f->err_no)
1806 1807 1808 1809
	continue;

      if (f->stack_count == 0)
	continue;
Eric Christopher committed
1810

1811 1812 1813
      count = result->count++;

      result->entries[count].once_only = f->once_only;
1814
      /* |= is avoided in the next line because of an HP C compiler bug */
1815
      result->have_once_only = result->have_once_only | f->once_only;
Geoffrey Keating committed
1816
      if (f->buffer_valid)
1817 1818
	md5_buffer ((const char *)f->buffer,
		    f->st.st_size, result->entries[count].sum);
Geoffrey Keating committed
1819 1820 1821 1822 1823 1824 1825
      else
	{
	  FILE *ff;
	  int oldfd = f->fd;

	  if (!open_file (f))
	    {
James E Wilson committed
1826
	      open_file_failed (pfile, f, 0);
1827
	      free (result);
1828
	      return false;
Geoffrey Keating committed
1829 1830
	    }
	  ff = fdopen (f->fd, "rb");
1831
	  md5_stream (ff, result->entries[count].sum);
Geoffrey Keating committed
1832 1833 1834
	  fclose (ff);
	  f->fd = oldfd;
	}
1835
      result->entries[count].size = f->st.st_size;
Geoffrey Keating committed
1836 1837 1838 1839
    }

  result_size = (sizeof (struct pchf_data)
                 + sizeof (struct pchf_entry) * (result->count - 1));
Eric Christopher committed
1840

Geoffrey Keating committed
1841 1842 1843
  qsort (result->entries, result->count, sizeof (struct pchf_entry),
	 pchf_save_compare);

1844 1845 1846
  ret = fwrite (result, result_size, 1, fp) == 1;
  free (result);
  return ret;
Geoffrey Keating committed
1847 1848 1849 1850 1851 1852 1853 1854
}

/* Read the pchf_data structure from F.  */

bool
_cpp_read_file_entries (cpp_reader *pfile ATTRIBUTE_UNUSED, FILE *f)
{
  struct pchf_data d;
Eric Christopher committed
1855

Geoffrey Keating committed
1856 1857 1858
  if (fread (&d, sizeof (struct pchf_data) - sizeof (struct pchf_entry), 1, f)
       != 1)
    return false;
Eric Christopher committed
1859

1860
  pchf = XNEWVAR (struct pchf_data, sizeof (struct pchf_data)
Geoffrey Keating committed
1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883
		  + sizeof (struct pchf_entry) * (d.count - 1));
  memcpy (pchf, &d, sizeof (struct pchf_data) - sizeof (struct pchf_entry));
  if (fread (pchf->entries, sizeof (struct pchf_entry), d.count, f)
      != d.count)
    return false;
  return true;
}

/* The parameters for pchf_compare.  */

struct pchf_compare_data
{
  /* The size of the file we're looking for.  */
  off_t size;

  /* The MD5 checksum of the file, if it's been computed.  */
  unsigned char sum[16];

  /* Is SUM valid?  */
  bool sum_computed;

  /* Do we need to worry about entries that don't have ONCE_ONLY set?  */
  bool check_included;
Eric Christopher committed
1884

Geoffrey Keating committed
1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896
  /* The file that we're searching for.  */
  _cpp_file *f;
};

/* bsearch comparison function; look for D_P in E_P.  */

static int
pchf_compare (const void *d_p, const void *e_p)
{
  const struct pchf_entry *e = (const struct pchf_entry *)e_p;
  struct pchf_compare_data *d = (struct pchf_compare_data *)d_p;
  int result;
Eric Christopher committed
1897

Geoffrey Keating committed
1898 1899 1900
  result = memcmp (&d->size, &e->size, sizeof (off_t));
  if (result != 0)
    return result;
Eric Christopher committed
1901

Geoffrey Keating committed
1902 1903 1904
  if (! d->sum_computed)
    {
      _cpp_file *const f = d->f;
Eric Christopher committed
1905

Geoffrey Keating committed
1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919
      md5_buffer ((const char *)f->buffer, f->st.st_size, d->sum);
      d->sum_computed = true;
    }

  result = memcmp (d->sum, e->sum, 16);
  if (result != 0)
    return result;

  if (d->check_included || e->once_only)
    return 0;
  else
    return 1;
}

Eric Christopher committed
1920
/* Check that F is not in a list read from a PCH file (if any).
Geoffrey Keating committed
1921 1922 1923 1924 1925 1926 1927 1928 1929
   Assumes that f->buffer_valid is true.  Return TRUE if the file
   should not be read.  */

static bool
check_file_against_entries (cpp_reader *pfile ATTRIBUTE_UNUSED,
			    _cpp_file *f,
			    bool check_included)
{
  struct pchf_compare_data d;
Eric Christopher committed
1930

Geoffrey Keating committed
1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941
  if (pchf == NULL
      || (! check_included && ! pchf->have_once_only))
    return false;

  d.size = f->st.st_size;
  d.sum_computed = false;
  d.f = f;
  d.check_included = check_included;
  return bsearch (&d, pchf->entries, pchf->count, sizeof (struct pchf_entry),
		  pchf_compare) != NULL;
}