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