4 * Lookup table, implemented as a hash table, that maps dentries to file
9 * Copyright (C) 2012 Eric Biggers
11 * This file is part of wimlib, a library for working with WIM files.
13 * wimlib is free software; you can redistribute it and/or modify it under the
14 * terms of the GNU Lesser General Public License as published by the Free
15 * Software Foundation; either version 2.1 of the License, or (at your option)
18 * wimlib is distributed in the hope that it will be useful, but WITHOUT ANY
19 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
20 * A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
23 * You should have received a copy of the GNU Lesser General Public License
24 * along with wimlib; if not, see http://www.gnu.org/licenses/.
27 #include "wimlib_internal.h"
28 #include "lookup_table.h"
31 struct lookup_table *new_lookup_table(size_t capacity)
33 struct lookup_table *table;
34 struct lookup_table_entry **array;
36 table = MALLOC(sizeof(struct lookup_table));
39 array = CALLOC(capacity, sizeof(array[0]));
44 table->num_entries = 0;
45 table->capacity = capacity;
49 ERROR("Failed to allocate memory for lookup table with capacity %zu",
54 struct lookup_table_entry *new_lookup_table_entry()
56 struct lookup_table_entry *lte;
58 lte = CALLOC(1, sizeof(struct lookup_table_entry));
60 ERROR("Out of memory (tried to allocate %zu bytes for "
61 "lookup table entry)",
62 sizeof(struct lookup_table_entry));
74 * Inserts an entry into the lookup table.
76 * @lookup_table: A pointer to the lookup table.
77 * @entry: A pointer to the entry to insert.
79 void lookup_table_insert(struct lookup_table *table,
80 struct lookup_table_entry *lte)
83 pos = lte->hash_short % table->capacity;
84 lte->next = table->array[pos];
85 table->array[pos] = lte;
86 /* XXX Make the table grow when too many entries have been inserted. */
91 /* Unlinks a lookup table entry from the table; does not free it. */
92 void lookup_table_unlink(struct lookup_table *table,
93 struct lookup_table_entry *lte)
96 struct lookup_table_entry *prev, *cur_entry, *next;
98 pos = lte->hash_short % table->capacity;
100 cur_entry = table->array[pos];
103 next = cur_entry->next;
104 if (cur_entry == lte) {
108 table->array[pos] = next;
109 table->num_entries--;
118 /* Decrement the reference count for the dentry having hash value @hash in the
119 * lookup table. The lookup table entry is unlinked and freed if there are no
120 * references to in remaining. */
121 struct lookup_table_entry *
122 lookup_table_decrement_refcnt(struct lookup_table* table, const u8 hash[])
124 size_t pos = *(size_t*)hash % table->capacity;
125 struct lookup_table_entry *prev = NULL;
126 struct lookup_table_entry *entry = table->array[pos];
127 struct lookup_table_entry *next;
130 if (memcmp(hash, entry->hash, WIM_HASH_SIZE) == 0) {
131 wimlib_assert(entry->refcnt != 0);
132 if (--entry->refcnt == 0) {
133 if (entry->num_opened_fds == 0) {
134 free_lookup_table_entry(entry);
140 table->array[pos] = next;
152 * Calls a function on all the entries in the lookup table. Stop early and
153 * return nonzero if any call to the function returns nonzero.
155 int for_lookup_table_entry(struct lookup_table *table,
156 int (*visitor)(struct lookup_table_entry *, void *),
159 struct lookup_table_entry *entry, *next;
163 for (i = 0; i < table->capacity; i++) {
164 entry = table->array[i];
167 ret = visitor(entry, arg);
178 * Reads the lookup table from a WIM file.
180 * @fp: The FILE* for the WIM file.
181 * @offset: The offset of the lookup table resource.
182 * @size: The size of the lookup table resource.
183 * @lookup_table_ret: A pointer to a struct lookup_table structure into which the
184 * lookup table will be returned.
185 * @return: True on success, false on failure.
187 int read_lookup_table(FILE *fp, u64 offset, u64 size,
188 struct lookup_table **table_ret)
191 u8 buf[WIM_LOOKUP_TABLE_ENTRY_DISK_SIZE];
193 struct lookup_table *table;
195 struct lookup_table_entry *cur_entry;
197 DEBUG("Reading lookup table: offset %"PRIu64", size %"PRIu64"",
200 if (fseeko(fp, offset, SEEK_SET) != 0) {
201 ERROR_WITH_ERRNO("Failed to seek to byte %"PRIu64" to read "
202 "lookup table", offset);
203 return WIMLIB_ERR_READ;
206 num_entries = size / WIM_LOOKUP_TABLE_ENTRY_DISK_SIZE;
207 table = new_lookup_table(num_entries * 2 + 1);
209 return WIMLIB_ERR_NOMEM;
211 while (num_entries--) {
212 if (fread(buf, 1, sizeof(buf), fp) != sizeof(buf)) {
214 ERROR("Unexpected EOF in WIM lookup table!");
216 ERROR_WITH_ERRNO("Error reading WIM lookup "
219 ret = WIMLIB_ERR_READ;
222 cur_entry = new_lookup_table_entry();
224 ret = WIMLIB_ERR_NOMEM;
228 p = get_resource_entry(buf, &cur_entry->resource_entry);
229 p = get_u16(p, &cur_entry->part_number);
230 p = get_u32(p, &cur_entry->refcnt);
231 p = get_bytes(p, WIM_HASH_SIZE, cur_entry->hash);
232 lookup_table_insert(table, cur_entry);
234 DEBUG("Done reading lookup table.");
238 free_lookup_table(table);
244 * Writes a lookup table entry to the output file.
246 int write_lookup_table_entry(struct lookup_table_entry *lte, void *__out)
249 u8 buf[WIM_LOOKUP_TABLE_ENTRY_DISK_SIZE];
254 /* do not write lookup table entries for empty files */
255 if (lte->output_resource_entry.original_size == 0)
258 /* Don't write entries that have not had file resources or metadata
259 * resources written for them. */
260 if (lte->out_refcnt == 0)
263 if (lte->output_resource_entry.flags & WIM_RESHDR_FLAG_METADATA)
264 DEBUG("Writing metadata entry at %lu (orig size = %zu)",
265 ftello(out), lte->output_resource_entry.original_size);
267 p = put_resource_entry(buf, <e->output_resource_entry);
268 p = put_u16(p, lte->part_number);
269 p = put_u32(p, lte->out_refcnt);
270 p = put_bytes(p, WIM_HASH_SIZE, lte->hash);
271 if (fwrite(buf, 1, sizeof(buf), out) != sizeof(buf)) {
272 ERROR_WITH_ERRNO("Failed to write lookup table entry");
273 return WIMLIB_ERR_WRITE;
278 static int do_free_lookup_table_entry(struct lookup_table_entry *entry,
281 free_lookup_table_entry(entry);
285 void free_lookup_table(struct lookup_table *table)
290 for_lookup_table_entry(table, do_free_lookup_table_entry, NULL);
296 int zero_out_refcnts(struct lookup_table_entry *entry, void *ignore)
298 entry->out_refcnt = 0;
302 int print_lookup_table_entry(struct lookup_table_entry *entry, void *ignore)
304 printf("Offset = %"PRIu64" bytes\n",
305 entry->resource_entry.offset);
306 printf("Size = %"PRIu64" bytes\n",
307 (u64)entry->resource_entry.size);
308 printf("Original size = %"PRIu64" bytes\n",
309 entry->resource_entry.original_size);
310 printf("Part Number = %hu\n", entry->part_number);
311 printf("Reference Count = %u\n", entry->refcnt);
313 print_hash(entry->hash);
316 u8 flags = entry->resource_entry.flags;
317 if (flags & WIM_RESHDR_FLAG_COMPRESSED)
318 fputs("WIM_RESHDR_FLAG_COMPRESSED, ", stdout);
319 if (flags & WIM_RESHDR_FLAG_FREE)
320 fputs("WIM_RESHDR_FLAG_FREE, ", stdout);
321 if (flags & WIM_RESHDR_FLAG_METADATA)
322 fputs("WIM_RESHDR_FLAG_METADATA, ", stdout);
323 if (flags & WIM_RESHDR_FLAG_SPANNED)
324 fputs("WIM_RESHDR_FLAG_SPANNED, ", stdout);
326 if (entry->file_on_disk)
327 printf("File on Disk = `%s'\n", entry->file_on_disk);
333 * Prints the lookup table of a WIM file.
335 WIMLIBAPI void wimlib_print_lookup_table(WIMStruct *w)
337 for_lookup_table_entry(w->lookup_table,
338 print_lookup_table_entry, NULL);
342 * Looks up an entry in the lookup table.
344 struct lookup_table_entry *
345 __lookup_resource(const struct lookup_table *lookup_table, const u8 hash[])
348 struct lookup_table_entry *lte;
350 pos = *(size_t*)hash % lookup_table->capacity;
351 lte = lookup_table->array[pos];
353 if (memcmp(hash, lte->hash, WIM_HASH_SIZE) == 0)
360 int lookup_resource(WIMStruct *w, const char *path,
362 struct dentry **dentry_ret,
363 struct lookup_table_entry **lte_ret,
366 struct dentry *dentry = get_dentry(w, path);
367 struct lookup_table_entry *lte;
371 if (!(lookup_flags & LOOKUP_FLAG_DIRECTORY_OK)
372 && dentry_is_directory(dentry))
374 if (lookup_flags & LOOKUP_FLAG_ADS_OK) {
375 const char *stream_name = path_stream_name(path);
377 size_t stream_name_len = strlen(stream_name);
378 for (u16 i = 0; i < dentry->num_ads; i++) {
379 if (ads_entry_has_name(&dentry->ads_entries[i],
383 hash = dentry->ads_entries[i].hash;
392 lte = __lookup_resource(w->lookup_table, hash);
394 *dentry_ret = dentry;