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