Lines Matching defs:files
36 per-file, so we can invoke it after the eval... or remembering which files
38 only work on files which have not yet been snapped. */
41 /* Hash table of files the makefile knows how to make. */
65 static struct hash_table files;
126 f = (struct file *) hash_find_item (&files, &file_key);
168 file_slot = (struct file **) hash_find_slot (&files, &file_key);
187 hash_insert_at (&files, new, file_slot);
240 deleted_file = hash_delete (&files, from_file);
242 /* from_file isn't the one stored in files */
246 file_slot = (struct file **) hash_find_slot (&files, &file_key);
254 hash_insert_at (&files, from_file, file_slot);
287 /* Merge the dependencies of the two files. */
335 /* Remove all nonprecious intermediate files.
354 file_slot = (struct file **) files.ht_vec;
355 file_end = file_slot + files.ht_size;
387 DB (DB_BASIC, (_("Removing intermediate files...\n")));
424 /* Files that follow '|' are "order-only" prerequisites that satisfy the
579 /* Enter them as files. */
628 Also mark the files depended on by .PRECIOUS, .PHONY, .SILENT,
650 we might add new files to the table, possibly causing
652 file_slot_0 = (struct file **) hash_dump (&files, 0, 0);
653 file_end = file_slot_0 + files.ht_fill;
686 marks those deps as intermediate files. */
691 Marking all files as intermediates is useless
698 marks those deps as intermediate files
700 but unlike real intermediate files,
706 /* .SECONDARY with no deps listed marks *all* files that way. */
710 hash_map (&files, set_intermediate);
877 /* Print the data base of files. */
996 puts (_("\n# Files"));
998 hash_map (&files, print_file);
1000 fputs (_("\n# files hash-table stats:\n# "), stdout);
1001 hash_print_stats (&files, stdout);
1011 if (files.ht_fill != last_targ_count)
1016 struct file **fp = (struct file **) files.ht_vec;
1017 struct file **end = &fp[files.ht_size];
1046 last_targ_count = files.ht_fill;
1055 hash_init (&files, 1000, file_hash_1, file_hash_2, file_hash_cmp);
