cppfiles.c 33.9 KB
Newer Older
Zack Weinberg committed
1
/* Part of CPP library.  (include file handling)
2 3
   Copyright (C) 1986, 1987, 1989, 1992, 1993, 1994, 1995, 1998,
   1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
Zack Weinberg committed
4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
   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

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
Free Software Foundation; either version 2, or (at your option) any
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
along with this program; if not, write to the Free Software
21
Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */
Zack Weinberg committed
22 23 24

#include "config.h"
#include "system.h"
25
#include <dirent.h>
Zack Weinberg committed
26
#include "cpplib.h"
27
#include "cpphash.h"
28
#include "intl.h"
29
#include "mkdeps.h"
30
#include "splay-tree.h"
31

Zack Weinberg committed
32 33 34 35
#ifndef O_BINARY
# define O_BINARY 0
#endif

36 37 38 39 40 41 42 43 44
/* If errno is inspected immediately after a system call fails, it will be
   nonzero, and no error number will ever be zero.  */
#ifndef ENOENT
# define ENOENT 0
#endif
#ifndef ENOTDIR
# define ENOTDIR 0
#endif

45
/* This structure is used for the table of all includes.  */
46
struct include_file {
47
  const char *name;		/* actual path name of file */
48
  const char *header_name;	/* the original header found */
49
  const cpp_hashnode *cmacro;	/* macro, if any, preventing reinclusion.  */
50
  const struct cpp_path *foundhere;
51 52 53 54 55
				/* location in search path where file was
				   found, for #include_next and sysp.  */
  const unsigned char *buffer;	/* pointer to cached file contents */
  struct stat st;		/* copy of stat(2) data for file */
  int fd;			/* fd open on file (short term storage only) */
56
  int err_no;			/* errno obtained if opening a file failed */
57
  unsigned short include_count;	/* number of times file has been read */
58 59 60 61 62 63 64
  unsigned char pch;		/* 0: file not known to be a PCH.
				   1: file is a PCH 
				      (on return from find_include_file).
				   2: file is not and never will be a valid
				      precompiled header.
				   3: file is always a valid precompiled
				      header.  */
65 66
};

67
/* Variable length record files on VMS will have a stat size that includes
68
   record control characters that won't be included in the read size.  */
69 70 71 72 73 74 75
#ifdef VMS
# define FAB_C_VAR 2 /* variable length records (see Starlet fabdef.h) */
# define STAT_SIZE_TOO_BIG(ST) ((ST).st_fab_rfm == FAB_C_VAR)
#else
# define STAT_SIZE_TOO_BIG(ST) 0
#endif

76 77 78
/* The cmacro works like this: If it's NULL, the file is to be
   included again.  If it's NEVER_REREAD, the file is never to be
   included again.  Otherwise it is a macro hashnode, and the file is
79
   to be included again if the macro is defined.  */
80
#define NEVER_REREAD ((const cpp_hashnode *) -1)
81 82
#define DO_NOT_REREAD(inc) \
((inc)->cmacro && ((inc)->cmacro == NEVER_REREAD \
83
		   || (inc)->cmacro->type == NT_MACRO))
84
#define NO_INCLUDE_PATH ((struct include_file *) -1)
85
#define INCLUDE_PCH_P(F) (((F)->pch & 1) != 0)
86

87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104
static struct file_name_map *read_name_map (cpp_reader *, const char *);
static char *read_filename_string (int, FILE *);
static char *remap_filename (cpp_reader *, char *, struct cpp_path *);
static struct cpp_path *search_from (cpp_reader *, enum include_type);
static struct include_file *find_include_file (cpp_reader *, const char *,
					       int, enum include_type);
static struct include_file *open_file (cpp_reader *, const char *);
static struct include_file *validate_pch (cpp_reader *, const char *,
					  const char *);
static struct include_file *open_file_pch (cpp_reader *, const char *);
static int read_include_file (cpp_reader *, struct include_file *);
static bool stack_include_file (cpp_reader *, struct include_file *);
static void purge_cache (struct include_file *);
static void destroy_node (splay_tree_value);
static int report_missing_guard (splay_tree_node, void *);
static splay_tree_node find_or_create_entry (cpp_reader *, const char *);
static void handle_missing_header (cpp_reader *, const char *, int);
static int remove_component_p (const char *);
105 106 107 108 109 110 111

/* Set up the splay tree we use to store information about all the
   file names seen in this compilation.  We also have entries for each
   file we tried to open but failed; this saves system calls since we
   don't try to open it again in future.

   The key of each node is the file name, after processing by
112
   cpp_simplify_path.  The path name may or may not be absolute.
113 114 115 116 117
   The path string has been malloced, as is automatically freed by
   registering free () as the splay tree key deletion function.

   A node's value is a pointer to a struct include_file, and is never
   NULL.  */
118
void
119
_cpp_init_includes (cpp_reader *pfile)
120 121
{
  pfile->all_include_files
122 123
    = splay_tree_new ((splay_tree_compare_fn) strcmp,
		      (splay_tree_delete_key_fn) free,
124
		      destroy_node);
125
}
Zack Weinberg committed
126

127
/* Tear down the splay tree.  */
128
void
129
_cpp_cleanup_includes (cpp_reader *pfile)
130 131 132 133
{
  splay_tree_delete (pfile->all_include_files);
}

134 135
/* Free a node.  The path string is automatically freed.  */
static void
136
destroy_node (splay_tree_value v)
137
{
138
  struct include_file *f = (struct include_file *) v;
139 140 141 142 143 144 145 146

  if (f)
    {
      purge_cache (f);
      free (f);
    }
}

147 148
/* Mark a file to not be reread (e.g. #import, read failure).  */
void
149
_cpp_never_reread (struct include_file *file)
150 151 152 153
{
  file->cmacro = NEVER_REREAD;
}

154
/* Lookup a filename, which is simplified after making a copy, and
155
   create an entry if none exists.  */
156
static splay_tree_node
157
find_or_create_entry (cpp_reader *pfile, const char *fname)
158
{
159 160
  splay_tree_node node;
  struct include_file *file;
161
  char *name = xstrdup (fname);
162
  int saved_errno;
163

164
  cpp_simplify_path (name);
165
  saved_errno = errno;
166 167 168 169
  node = splay_tree_lookup (pfile->all_include_files, (splay_tree_key) name);
  if (node)
    free (name);
  else
170
    {
171
      file = xcnew (struct include_file);
172
      file->name = name;
173
      file->header_name = name;
174
      file->err_no = saved_errno;
175 176 177
      node = splay_tree_insert (pfile->all_include_files,
				(splay_tree_key) file->name,
				(splay_tree_value) file);
178
    }
179 180 181 182

  return node;
}

183
/* Enter a file name in the splay tree, for the sake of cpp_included.  */
184
void
185
_cpp_fake_include (cpp_reader *pfile, const char *fname)
186 187
{
  find_or_create_entry (pfile, fname);
188 189
}

190
/* Given a file name, look it up in the cache; if there is no entry,
191 192 193
   create one with a non-NULL value (regardless of success in opening
   the file).  If the file doesn't exist or is inaccessible, this
   entry is flagged so we don't attempt to open it again in the
194 195
   future.  If the file isn't open, open it.  The empty string is
   interpreted as stdin.
196 197 198

   Returns an include_file structure with an open file descriptor on
   success, or NULL on failure.  */
199
static struct include_file *
200
open_file (cpp_reader *pfile, const char *filename)
201
{
202 203
  splay_tree_node nd = find_or_create_entry (pfile, filename);
  struct include_file *file = (struct include_file *) nd->value;
Zack Weinberg committed
204

205 206 207 208 209 210
  if (file->err_no)
    {
      /* Ugh.  handle_missing_header () needs errno to be set.  */
      errno = file->err_no;
      return 0;
    }
211

212
  /* Don't reopen an idempotent file.  */
213 214
  if (DO_NOT_REREAD (file))
    return file;
215

216
  /* Don't reopen one which is already loaded.  */
217
  if (0 && file->buffer != NULL)
218
    return file;
Zack Weinberg committed
219

220 221 222 223
  /* 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).
Zack Weinberg committed
224

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

228 229 230
     O_BINARY tells some runtime libraries (notably DJGPP) not to do
     newline translation; we can handle DOS line breaks just fine
     ourselves.
231

232
     Special case: the empty string is translated to stdin.  */
233

234
  if (filename[0] == '\0')
235 236 237 238 239 240
    {
      file->fd = 0;
#ifdef __DJGPP__
      /* For DJGPP redirected input is opened in text mode. Change it
         to binary mode.  */
      if (! isatty (file->fd))
241
	setmode (file->fd, O_BINARY);
242 243
#endif
    }
244
  else
245
    file->fd = open (file->name, O_RDONLY | O_NOCTTY | O_BINARY, 0666);
246

247 248
  if (file->fd != -1 && fstat (file->fd, &file->st) == 0)
    {
249 250
      if (!S_ISDIR (file->st.st_mode))
	return file;
251

252 253 254
      /* If it's a directory, we return null and continue the search
	 as the file we're looking for may appear elsewhere in the
	 search path.  */
255
      errno = ENOENT;
256 257
      close (file->fd);
      file->fd = -1;
258
    }
259

260
  file->err_no = errno;
261 262 263
  return 0;
}

264
static struct include_file *
265
validate_pch (cpp_reader *pfile, const char *filename, const char *pchname)
266 267 268 269 270 271 272 273
{
  struct include_file * file;
  
  file = open_file (pfile, pchname);
  if (file == NULL)
    return NULL;
  if ((file->pch & 2) == 0)
    file->pch = pfile->cb.valid_pch (pfile, pchname, file->fd);
274 275 276 277 278 279 280
  if (CPP_OPTION (pfile, print_include_names))
    {
      unsigned int i;
      for (i = 1; i < pfile->line_maps.depth; i++)
	putc ('.', stderr);
      fprintf (stderr, "%c %s\n", INCLUDE_PCH_P (file) ? '!' : 'x', pchname);
    }
281 282
  if (INCLUDE_PCH_P (file))
    {
283
      char *f = xstrdup (filename);
284
      cpp_simplify_path (f);
285
      file->header_name = f;
286 287 288 289 290 291 292 293 294 295 296
      return file;
    }
  close (file->fd);
  file->fd = -1;
  return NULL;
}


/* Like open_file, but also look for a precompiled header if (a) one exists
   and (b) it is valid.  */
static struct include_file *
297
open_file_pch (cpp_reader *pfile, const char *filename)
298 299 300 301 302 303 304 305 306 307
{
  if (filename[0] != '\0'
      && pfile->cb.valid_pch != NULL)
    {
      size_t namelen = strlen (filename);
      char *pchname = alloca (namelen + 5);
      struct include_file * file;
      splay_tree_node nd;
      
      memcpy (pchname, filename, namelen);
308
      memcpy (pchname + namelen, ".gch", 5);
309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350

      nd = find_or_create_entry (pfile, pchname);
      file = (struct include_file *) nd->value;

      if (file != NULL)
	{
	  if (stat (file->name, &file->st) == 0 && S_ISDIR (file->st.st_mode))
	    {
	      DIR * thedir;
	      struct dirent *d;
	      size_t subname_len = namelen + 64;
	      char *subname = xmalloc (subname_len);
	      
	      thedir = opendir (pchname);
	      if (thedir == NULL)
		return NULL;
	      memcpy (subname, pchname, namelen + 4);
	      subname[namelen+4] = '/';
	      while ((d = readdir (thedir)) != NULL)
		{
		  if (strlen (d->d_name) + namelen + 7 > subname_len)
		    {
		      subname_len = strlen (d->d_name) + namelen + 64;
		      subname = xrealloc (subname, subname_len);
		    }
		  strcpy (subname + namelen + 5, d->d_name);
		  file = validate_pch (pfile, filename, subname);
		  if (file)
		    break;
		}
	      closedir (thedir);
	      free (subname);
	    }
	  else
	    file = validate_pch (pfile, filename, pchname);
	  if (file)
	    return file;
	}
    }
  return open_file (pfile, filename);
}

351 352 353 354 355
/* Place the file referenced by INC into a new buffer on the buffer
   stack, unless there are errors, or the file is not re-included
   because of e.g. multiple-include guards.  Returns true if a buffer
   is stacked.  */
static bool
356
stack_include_file (cpp_reader *pfile, struct include_file *inc)
357 358
{
  cpp_buffer *fp;
359
  int sysp;
360
  const char *filename;
361

362 363 364
  if (DO_NOT_REREAD (inc))
    return false;

Neil Booth committed
365
  sysp = MAX ((pfile->map ? pfile->map->sysp : 0),
366
	      (inc->foundhere ? inc->foundhere->sysp : 0));
367

368
  /* Add the file to the dependencies on its first inclusion.  */
369
  if (CPP_OPTION (pfile, deps.style) > !!sysp && !inc->include_count)
370 371 372 373
    {
      if (pfile->buffer || CPP_OPTION (pfile, deps.ignore_main_file) == 0)
	deps_add_dep (pfile->deps, inc->name);
    }
374

375 376 377 378 379 380 381 382 383
  /* PCH files get dealt with immediately.  */
  if (INCLUDE_PCH_P (inc))
    {
      pfile->cb.read_pch (pfile, inc->name, inc->fd, inc->header_name);
      close (inc->fd);
      inc->fd = -1;
      return false;
    }

384
  /* Not in cache?  */
385
  if (1 || ! inc->buffer)
386
    {
387
      if (read_include_file (pfile, inc))
388
	{
389
	  /* If an error occurs, do not try to read this file again.  */
390 391 392
	  _cpp_never_reread (inc);
	  return false;
	}
393 394 395 396 397
      /* Mark a regular, zero-length file never-reread.  We read it,
	 NUL-terminate it, and stack it once, so preprocessing a main
	 file of zero length does not raise an error.  */
      if (S_ISREG (inc->st.st_mode) && inc->st.st_size == 0)
	_cpp_never_reread (inc);
398 399 400 401
      close (inc->fd);
      inc->fd = -1;
    }

402
  if (pfile->buffer)
403 404
    /* We don't want MI guard advice for the main file.  */
    inc->include_count++;
405 406

  /* Push a buffer.  */
407 408
  fp = cpp_push_buffer (pfile, inc->buffer, inc->st.st_size,
			/* from_stage3 */ CPP_OPTION (pfile, preprocessed), 0);
409
  fp->inc = inc;
410

411
  /* Initialize controlling macro state.  */
412
  pfile->mi_valid = true;
413
  pfile->mi_cmacro = 0;
414 415

  /* Generate the call back.  */
416 417
  filename = inc->name;
  if (*filename == '\0')
418
    filename = "<stdin>";
419
  _cpp_do_file_change (pfile, LC_ENTER, filename, 1, sysp);
420 421

  return true;
422 423 424 425 426 427 428
}

/* Read the file referenced by INC into the file cache.

   If fd points to a plain file, we might be able to mmap it; we can
   definitely allocate the buffer all at once.  If fd is a pipe or
   terminal, we can't do either.  If fd is something weird, like a
429
   block device, we don't want to read it at all.
430 431 432 433

   Unfortunately, different systems use different st.st_mode values
   for pipes: some have S_ISFIFO, some S_ISSOCK, some are buggy and
   zero the entire struct stat except a couple fields.  Hence we don't
434 435
   even try to figure out what something is, except for plain files
   and block devices.
436 437

   FIXME: Flush file cache and try again if we run out of memory.  */
438
static int
439
read_include_file (cpp_reader *pfile, struct include_file *inc)
440 441
{
  ssize_t size, offset, count;
442
  uchar *buf;
443 444

  if (S_ISREG (inc->st.st_mode))
445
    {
446 447 448 449 450 451 452 453 454
      /* 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.  */
      if (inc->st.st_size > INTTYPE_MAXIMUM (ssize_t))
455
	{
456
	  cpp_error (pfile, DL_ERROR, "%s is too large", inc->name);
457
	  goto fail;
458
	}
459 460
      size = inc->st.st_size;

461
	{
462
	  buf = (uchar *) xmalloc (size + 1);
463 464 465 466 467 468 469 470
	  offset = 0;
	  while (offset < size)
	    {
	      count = read (inc->fd, buf + offset, size - offset);
	      if (count < 0)
		goto perror_fail;
	      if (count == 0)
		{
471
		  if (!STAT_SIZE_TOO_BIG (inc->st))
472 473
		    cpp_error (pfile, DL_WARNING,
			       "%s is shorter than expected", inc->name);
474 475 476
		  size = offset;
		  buf = xrealloc (buf, size + 1);
		  inc->st.st_size = size;
477 478 479 480
		  break;
		}
	      offset += count;
	    }
481 482
	  /* The lexer requires that the buffer be \n-terminated.  */
	  buf[size] = '\n';
483
	}
484 485 486
    }
  else if (S_ISBLK (inc->st.st_mode))
    {
487
      cpp_error (pfile, DL_ERROR, "%s is a block device", inc->name);
488 489 490 491 492 493 494 495
      goto fail;
    }
  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;
496

497
      buf = (uchar *) xmalloc (size + 1);
498 499
      offset = 0;
      while ((count = read (inc->fd, buf + offset, size - offset)) > 0)
500
	{
501 502
	  offset += count;
	  if (offset == size)
503 504 505 506
	    {
	      size *= 2;
	      buf = xrealloc (buf, size + 1);
	    }
507
	}
508 509 510
      if (count < 0)
	goto perror_fail;

511 512 513
      if (offset + 1 < size)
	buf = xrealloc (buf, offset + 1);

514 515
      /* The lexer requires that the buffer be \n-terminated.  */
      buf[offset] = '\n';
516
      inc->st.st_size = offset;
517
    }
Zack Weinberg committed
518

519
  inc->buffer = buf;
520
  return 0;
521 522

 perror_fail:
523
  cpp_errno (pfile, DL_ERROR, inc->name);
524
 fail:
525
  return 1;
526 527
}

528
/* Drop INC's buffer from memory.  */
529
static void
530
purge_cache (struct include_file *inc)
531 532
{
  if (inc->buffer)
533
    {
534
      free ((void *) inc->buffer);
535
      inc->buffer = NULL;
536
    }
537 538
}

539 540 541
/* Return 1 if the file named by FNAME has been included before in
   any context, 0 otherwise.  */
int
542
cpp_included (cpp_reader *pfile, const char *fname)
Zack Weinberg committed
543
{
544
  struct cpp_path *path;
545
  char *name, *n;
546
  splay_tree_node nd;
547

548
  if (IS_ABSOLUTE_PATH (fname))
549
    {
550 551 552
      /* Just look it up.  */
      nd = splay_tree_lookup (pfile->all_include_files, (splay_tree_key) fname);
      return (nd && nd->value);
553
    }
554

555
  /* Search directory path for the file.  */
556
  name = (char *) alloca (strlen (fname) + pfile->max_include_len + 2);
557
  for (path = pfile->quote_include; path; path = path->next)
558
    {
559 560 561
      memcpy (name, path->name, path->len);
      name[path->len] = '/';
      strcpy (&name[path->len + 1], fname);
562
      if (CPP_OPTION (pfile, remap))
563 564
	n = remap_filename (pfile, name, path);
      else
565
	n = name;
566

567
      nd = splay_tree_lookup (pfile->all_include_files, (splay_tree_key) n);
568 569
      if (nd && nd->value)
	return 1;
570
    }
571
  return 0;
Zack Weinberg committed
572 573
}

574
/* Search for FNAME.  Return 0 if there is no such file (or it's
575 576 577
   un-openable), in which case an error code will be in errno.  If
   there is no include path to use it returns NO_INCLUDE_PATH,
   otherwise an include_file structure.  If this request originates
578
   from a directive of TYPE #include_next, set INCLUDE_NEXT to true.  */
579
static struct include_file *
580 581
find_include_file (cpp_reader *pfile, const char *fname, int angle_brackets,
		   enum include_type type)
582
{
583
  struct cpp_path *path;
584
  struct include_file *file;
585
  char *name, *n;
Zack Weinberg committed
586

587 588 589 590 591 592
  if (*fname == '\0')
    {
      cpp_error (pfile, DL_ERROR, "empty file name");
      return NO_INCLUDE_PATH;
    }

593
  if (IS_ABSOLUTE_PATH (fname))
594
    return open_file_pch (pfile, fname);
595 596

  /* For #include_next, skip in the search path past the dir in which
597 598
     the current file was found, but if it was found via an absolute
     path use the normal search logic.  */
599
  if (type == IT_INCLUDE_NEXT && pfile->buffer->inc->foundhere)
600
    path = pfile->buffer->inc->foundhere->next;
601
  else if (angle_brackets)
602
    path = pfile->bracket_include;
603
  else
604
    path = search_from (pfile, type);
605 606 607

  if (path == NULL)
    {
608 609
      cpp_error (pfile, DL_ERROR, "no include path in which to find %s",
		 fname);
610 611 612
      return NO_INCLUDE_PATH;
    }

613
  /* Search directory path for the file.  */
614
  name = (char *) alloca (strlen (fname) + pfile->max_include_len + 2);
615
  for (; path; path = path->next)
Zack Weinberg committed
616
    {
617 618 619 620 621 622 623 624
      int len = path->len;
      memcpy (name, path->name, len);
      /* Don't turn / into // or // into ///; // may be a namespace
	 escape.  */
      if (name[len-1] == '/')
	len--;
      name[len] = '/';
      strcpy (&name[len + 1], fname);
625
      if (CPP_OPTION (pfile, remap))
626 627
	n = remap_filename (pfile, name, path);
      else
628
	n = name;
629

630
      file = open_file_pch (pfile, n);
631
      if (file)
Zack Weinberg committed
632
	{
633 634
	  file->foundhere = path;
	  return file;
Zack Weinberg committed
635 636
	}
    }
637

638
  return 0;
Zack Weinberg committed
639 640
}

641
/* Not everyone who wants to set system-header-ness on a buffer can
642 643
   see the details of a buffer.  This is an exported interface because
   fix-header needs it.  */
644
void
645
cpp_make_system_header (cpp_reader *pfile, int syshdr, int externc)
646
{
647 648 649 650 651
  int flags = 0;

  /* 1 = system header, 2 = system header to be treated as C.  */
  if (syshdr)
    flags = 1 + (externc != 0);
Neil Booth committed
652 653
  _cpp_do_file_change (pfile, LC_RENAME, pfile->map->to_file,
		       SOURCE_LINE (pfile->map, pfile->line), flags);
654 655
}

656 657 658
/* 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.  */
659
void
660 661
cpp_change_file (cpp_reader *pfile, enum lc_reason reason,
		 const char *new_name)
662
{
663
  _cpp_do_file_change (pfile, reason, new_name, 1, 0);
664 665
}

666 667 668
/* Report on all files that might benefit from a multiple include guard.
   Triggered by -H.  */
void
669
_cpp_report_missing_guards (cpp_reader *pfile)
670 671
{
  int banner = 0;
672
  splay_tree_foreach (pfile->all_include_files, report_missing_guard, &banner);
673 674
}

675
/* Callback function for splay_tree_foreach().  */
676
static int
677
report_missing_guard (splay_tree_node n, void *b)
678 679
{
  struct include_file *f = (struct include_file *) n->value;
680
  int *bannerp = (int *) b;
681 682 683 684 685 686 687 688 689 690 691 692 693 694

  if (f && f->cmacro == 0 && f->include_count == 1)
    {
      if (*bannerp == 0)
	{
	  fputs (_("Multiple include guards may be useful for:\n"), stderr);
	  *bannerp = 1;
	}
      fputs (f->name, stderr);
      putc ('\n', stderr);
    }
  return 0;
}

695
/* Create a dependency for file FNAME, or issue an error message as
696
   appropriate.  ANGLE_BRACKETS is nonzero if the file was bracketed
697
   like <..>.  */
698
static void
699 700
handle_missing_header (cpp_reader *pfile, const char *fname,
		       int angle_brackets)
701
{
702 703
  bool print_dep
    = CPP_OPTION (pfile, deps.style) > (angle_brackets || pfile->map->sysp);
704

705
  if (CPP_OPTION (pfile, deps.missing_files) && print_dep)
706
    deps_add_dep (pfile->deps, fname);
707 708 709 710
  /* If -M was specified, then don't count this as an error, because
     we can still produce correct output.  Otherwise, we can't produce
     correct output, because there may be dependencies we need inside
     the missing file, and we don't know what directory this missing
711
     file exists in.  */
712
  else
713
    cpp_errno (pfile, CPP_OPTION (pfile, deps.style) && ! print_dep
714
	       ? DL_WARNING: DL_ERROR, fname);
715 716
}

717 718 719
/* Handles #include-family directives (distinguished by TYPE),
   including HEADER, and the command line -imacros and -include.
   Returns true if a buffer was stacked.  */
720
bool
721 722
_cpp_execute_include (cpp_reader *pfile, const char *fname, int angle_brackets,
		      enum include_type type)
723
{
724
  bool stacked = false;
725
  struct include_file *inc;
726

727
  inc = find_include_file (pfile, fname, angle_brackets, type);
728
  if (inc == 0)
729
    handle_missing_header (pfile, fname, angle_brackets);
730
  else if (inc != NO_INCLUDE_PATH)
731
    {
732
      stacked = stack_include_file (pfile, inc);
733

734
      if (type == IT_IMPORT)
735
	_cpp_never_reread (inc);
736
    }
737

738
  return stacked;
739 740
}

741
/* Locate HEADER, and determine whether it is newer than the current
742
   file.  If it cannot be located or dated, return -1, if it is
743
   newer, return 1, otherwise 0.  */
744
int
745 746
_cpp_compare_file_date (cpp_reader *pfile, const char *fname,
			int angle_brackets)
747
{
748
  struct include_file *inc;
749

750
  inc = find_include_file (pfile, fname, angle_brackets, IT_INCLUDE);
751
  if (inc == NULL || inc == NO_INCLUDE_PATH)
752
    return -1;
753

754
  if (inc->fd > 0)
755 756 757 758
    {
      close (inc->fd);
      inc->fd = -1;
    }
759

760
  return inc->st.st_mtime > pfile->buffer->inc->st.st_mtime;
761 762 763
}


764 765 766 767
/* Push an input buffer and load it up with the contents of FNAME.  If
   FNAME is "", read standard input.  Return true if a buffer was
   stacked.  */
bool
768
_cpp_read_file (cpp_reader *pfile, const char *fname)
769
{
770 771 772
  /* This uses open_file, because we don't allow a PCH to be used as
     the toplevel compilation (that would prevent re-compiling an
     existing PCH without deleting it first).  */
773
  struct include_file *f = open_file (pfile, fname);
774

Zack Weinberg committed
775
  if (f == NULL)
776
    {
777
      cpp_errno (pfile, DL_ERROR, fname);
778 779
      return false;
    }
Zack Weinberg committed
780

781
  return stack_include_file (pfile, f);
782 783
}

784 785 786
/* Pushes the given file onto the buffer stack.  Returns nonzero if
   successful.  */
bool
787
cpp_push_include (cpp_reader *pfile, const char *filename)
788 789 790
{
  /* Make the command line directive take up a line.  */
  pfile->line++;
791
  return _cpp_execute_include (pfile, filename, false, IT_CMDLINE);
792 793
}

794
/* Do appropriate cleanup when a file INC's buffer is popped off the
795 796
   input stack.  */
void
797
_cpp_pop_file_buffer (cpp_reader *pfile, struct include_file *inc)
798
{
799
  /* Record the inclusion-preventing macro, which could be NULL
800 801
     meaning no controlling macro.  */
  if (pfile->mi_valid && inc->cmacro == NULL)
802
    inc->cmacro = pfile->mi_cmacro;
Neil Booth committed
803 804

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

807
  purge_cache (inc);
808 809
}

810 811
/* Returns the first place in the include chain to start searching for
   "" includes.  This involves stripping away the basename of the
812 813 814 815
   current file, unless -I- was specified.

   If we're handling -include or -imacros, use the "" chain, but with
   the preprocessor's cwd prepended.  */
816
static struct cpp_path *
817
search_from (cpp_reader *pfile, enum include_type type)
818 819 820 821
{
  cpp_buffer *buffer = pfile->buffer;
  unsigned int dlen;

822 823 824 825
  /* Command line uses the cwd, and does not cache the result.  */
  if (type == IT_CMDLINE)
    goto use_cwd;

826 827 828
  /* Ignore the current file's directory?  */
  if (pfile->quote_ignores_source_dir)
    return pfile->quote_include;
829

830
  if (! buffer->search_cached)
831
    {
832
      buffer->search_cached = 1;
833

834
      dlen = lbasename (buffer->inc->name) - buffer->inc->name;
835

836 837 838
      if (dlen)
	{
	  /* We don't guarantee NAME is null-terminated.  This saves
839
	     allocating and freeing memory.  Drop a trailing '/'.  */
840
	  buffer->dir.name = (char *) buffer->inc->name;
841 842 843 844 845 846
	  if (dlen > 1)
	    dlen--;
	}
      else
	{
	use_cwd:
847
	  buffer->dir.name = (char *) ".";
848 849 850 851 852 853 854
	  dlen = 1;
	}

      if (dlen > pfile->max_include_len)
	pfile->max_include_len = dlen;

      buffer->dir.len = dlen;
855
      buffer->dir.next = pfile->quote_include;
Neil Booth committed
856
      buffer->dir.sysp = pfile->map->sysp;
857
    }
858 859 860 861

  return &buffer->dir;
}

862 863 864 865 866 867 868
/* The file_name_map structure holds a mapping of file names for a
   particular directory.  This mapping is read from the file named
   FILE_NAME_MAP_FILE in that directory.  Such a file can be used to
   map filenames on a file system with severe filename restrictions,
   such as DOS.  The format of the file name map file is just a series
   of lines with two tokens on each line.  The first token is the name
   to map, and the second token is the actual name to use.  */
869
struct file_name_map {
870 871 872 873 874 875 876 877
  struct file_name_map *map_next;
  char *map_from;
  char *map_to;
};

#define FILE_NAME_MAP_FILE "header.gcc"

/* Read a space delimited string of unlimited length from a stdio
878
   file F.  */
879
static char *
880
read_filename_string (int ch, FILE *f)
881 882 883 884 885 886
{
  char *alloc, *set;
  int len;

  len = 20;
  set = alloc = xmalloc (len + 1);
887
  if (! is_space (ch))
888 889
    {
      *set++ = ch;
890
      while ((ch = getc (f)) != EOF && ! is_space (ch))
891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906
	{
	  if (set - alloc == len)
	    {
	      len *= 2;
	      alloc = xrealloc (alloc, len + 1);
	      set = alloc + len / 2;
	    }
	  *set++ = ch;
	}
    }
  *set = '\0';
  ungetc (ch, f);
  return alloc;
}

/* This structure holds a linked list of file name maps, one per directory.  */
907
struct file_name_map_list {
908 909 910 911 912 913 914
  struct file_name_map_list *map_list_next;
  char *map_list_name;
  struct file_name_map *map_list_map;
};

/* Read the file name map file for DIRNAME.  */
static struct file_name_map *
915
read_name_map (cpp_reader *pfile, const char *dirname)
916
{
917
  struct file_name_map_list *map_list_ptr;
918 919 920
  char *name;
  FILE *f;

921
  /* Check the cache of directories, and mappings in their remap file.  */
922 923 924 925 926 927 928 929
  for (map_list_ptr = CPP_OPTION (pfile, map_list); map_list_ptr;
       map_list_ptr = map_list_ptr->map_list_next)
    if (! strcmp (map_list_ptr->map_list_name, dirname))
      return map_list_ptr->map_list_map;

  map_list_ptr = ((struct file_name_map_list *)
		  xmalloc (sizeof (struct file_name_map_list)));
  map_list_ptr->map_list_name = xstrdup (dirname);
930 931

  /* The end of the list ends in NULL.  */
932
  map_list_ptr->map_list_map = NULL;
933 934 935 936 937 938 939

  name = (char *) alloca (strlen (dirname) + strlen (FILE_NAME_MAP_FILE) + 2);
  strcpy (name, dirname);
  if (*dirname)
    strcat (name, "/");
  strcat (name, FILE_NAME_MAP_FILE);
  f = fopen (name, "r");
940 941 942

  /* Silently return NULL if we cannot open.  */
  if (f)
943 944 945 946 947 948 949 950
    {
      int ch;

      while ((ch = getc (f)) != EOF)
	{
	  char *from, *to;
	  struct file_name_map *ptr;

951
	  if (is_space (ch))
952 953
	    continue;
	  from = read_filename_string (ch, f);
954
	  while ((ch = getc (f)) != EOF && is_hspace (ch))
955 956 957 958 959 960 961 962
	    ;
	  to = read_filename_string (ch, f);

	  ptr = ((struct file_name_map *)
		 xmalloc (sizeof (struct file_name_map)));
	  ptr->map_from = from;

	  /* Make the real filename absolute.  */
963
	  if (IS_ABSOLUTE_PATH (to))
964 965 966
	    ptr->map_to = to;
	  else
	    {
967
	      ptr->map_to = concat (dirname, "/", to, NULL);
968
	      free (to);
969
	    }
970 971 972 973 974 975 976 977 978 979

	  ptr->map_next = map_list_ptr->map_list_map;
	  map_list_ptr->map_list_map = ptr;

	  while ((ch = getc (f)) != '\n')
	    if (ch == EOF)
	      break;
	}
      fclose (f);
    }
980

981
  /* Add this information to the cache.  */
982 983 984 985
  map_list_ptr->map_list_next = CPP_OPTION (pfile, map_list);
  CPP_OPTION (pfile, map_list) = map_list_ptr;

  return map_list_ptr->map_list_map;
986
}
987

988 989
/* Remap an unsimplified path NAME based on the file_name_map (if any)
   for LOC.  */
990
static char *
991
remap_filename (cpp_reader *pfile, char *name, struct cpp_path *loc)
992 993
{
  struct file_name_map *map;
994
  const char *from, *p;
995
  char *dir;
996 997

  if (! loc->name_map)
998
    {
999 1000 1001 1002 1003
      /* Get a null-terminated path.  */
      char *dname = alloca (loc->len + 1);
      memcpy (dname, loc->name, loc->len);
      dname[loc->len] = '\0';

1004
      loc->name_map = read_name_map (pfile, dname);
1005 1006 1007
      if (! loc->name_map)
	return name;
    }
1008

1009
  /* This works since NAME has not been simplified yet.  */
1010
  from = name + loc->len + 1;
1011

1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023
  for (map = loc->name_map; map; map = map->map_next)
    if (!strcmp (map->map_from, from))
      return map->map_to;

  /* Try to find a mapping file for the particular directory we are
     looking in.  Thus #include <sys/types.h> will look up sys/types.h
     in /usr/include/header.gcc and look up types.h in
     /usr/include/sys/header.gcc.  */
  p = strrchr (name, '/');
  if (!p)
    return name;

1024
  /* We know p != name as absolute paths don't call remap_filename.  */
1025
  if (p == name)
1026
    cpp_error (pfile, DL_ICE, "absolute file name in remap_filename");
1027 1028 1029 1030 1031

  dir = (char *) alloca (p - name + 1);
  memcpy (dir, name, p - name);
  dir[p - name] = '\0';
  from = p + 1;
1032

1033
  for (map = read_name_map (pfile, dir); map; map = map->map_next)
1034
    if (! strcmp (map->map_from, from))
1035 1036 1037 1038 1039
      return map->map_to;

  return name;
}

1040 1041 1042
/* 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.
1043

1044 1045
   If BRACKET does not lie in the QUOTE chain, it is set to QUOTE.  */
void
1046 1047
cpp_set_include_chains (cpp_reader *pfile, cpp_path *quote, cpp_path *bracket,
			int quote_ignores_source_dir)
1048
{
1049 1050 1051 1052
  pfile->quote_include = quote;
  pfile->bracket_include = quote;
  pfile->quote_ignores_source_dir = quote_ignores_source_dir;
  pfile->max_include_len = 0;
1053

1054
  for (; quote; quote = quote->next)
1055
    {
1056 1057 1058 1059 1060 1061
      quote->name_map = NULL;
      quote->len = strlen (quote->name);
      if (quote->len > pfile->max_include_len)
	pfile->max_include_len = quote->len;
      if (quote == bracket)
	pfile->bracket_include = bracket;
1062 1063
    }
}
1064 1065 1066 1067 1068 1069

/* Returns true if it is safe to remove the final component of path,
   when it is followed by a ".." component.  We use lstat to avoid
   symlinks if we have it.  If not, we can still catch errors with
   stat ().  */
static int
1070
remove_component_p (const char *path)
1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104
{
  struct stat s;
  int result;

#ifdef HAVE_LSTAT
  result = lstat (path, &s);
#else
  result = stat (path, &s);
#endif

  /* There's no guarantee that errno will be unchanged, even on
     success.  Cygwin's lstat(), for example, will often set errno to
     ENOSYS.  In case of success, reset errno to zero.  */
  if (result == 0)
    errno = 0;

  return result == 0 && S_ISDIR (s.st_mode);
}

/* Simplify a path name in place, deleting redundant components.  This
   reduces OS overhead and guarantees that equivalent paths compare
   the same (modulo symlinks).

   Transforms made:
   foo/bar/../quux	foo/quux
   foo/./bar		foo/bar
   foo//bar		foo/bar
   /../quux		/quux
   //quux		//quux  (POSIX allows leading // as a namespace escape)

   Guarantees no trailing slashes.  All transforms reduce the length
   of the string.  Returns PATH.  errno is 0 if no error occurred;
   nonzero if an error occurred when using stat () or lstat ().  */
void
1105
cpp_simplify_path (char *path ATTRIBUTE_UNUSED)
1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214
{
#ifndef VMS
  char *from, *to;
  char *base, *orig_base;
  int absolute = 0;

  errno = 0;
  /* Don't overflow the empty path by putting a '.' in it below.  */
  if (*path == '\0')
    return;

#if defined (HAVE_DOS_BASED_FILE_SYSTEM)
  /* Convert all backslashes to slashes.  */
  for (from = path; *from; from++)
    if (*from == '\\') *from = '/';

  /* Skip over leading drive letter if present.  */
  if (ISALPHA (path[0]) && path[1] == ':')
    from = to = &path[2];
  else
    from = to = path;
#else
  from = to = path;
#endif

  /* Remove redundant leading /s.  */
  if (*from == '/')
    {
      absolute = 1;
      to++;
      from++;
      if (*from == '/')
	{
	  if (*++from == '/')
	    /* 3 or more initial /s are equivalent to 1 /.  */
	    while (*++from == '/');
	  else
	    /* On some hosts // differs from /; Posix allows this.  */
	    to++;
	}
    }

  base = orig_base = to;
  for (;;)
    {
      int move_base = 0;

      while (*from == '/')
	from++;

      if (*from == '\0')
	break;

      if (*from == '.')
	{
	  if (from[1] == '\0')
	    break;
	  if (from[1] == '/')
	    {
	      from += 2;
	      continue;
	    }
	  else if (from[1] == '.' && (from[2] == '/' || from[2] == '\0'))
	    {
	      /* Don't simplify if there was no previous component.  */
	      if (absolute && orig_base == to)
		{
		  from += 2;
		  continue;
		}
	      /* Don't simplify if the previous component was "../",
		 or if an error has already occurred with (l)stat.  */
	      if (base != to && errno == 0)
		{
		  /* We don't back up if it's a symlink.  */
		  *to = '\0';
		  if (remove_component_p (path))
		    {
		      while (to > base && *to != '/')
			to--;
		      from += 2;
		      continue;
		    }
		}
	      move_base = 1;
	    }
	}

      /* Add the component separator.  */
      if (to > orig_base)
	*to++ = '/';

      /* Copy this component until the trailing null or '/'.  */
      while (*from != '\0' && *from != '/')
	*to++ = *from++;

      if (move_base)
	base = to;
    }

  /* Change the empty string to "." so that it is not treated as stdin.
     Null terminate.  */
  if (to == path)
    *to++ = '.';
  *to = '\0';
#else  /* VMS */
  errno = 0;
#endif /* !VMS  */
}