wimlib.net Git - wimlib/blob - src/lookup_table.c

   1 /*
   2  * lookup_table.c
   3  *
   4  * Lookup table, implemented as a hash table, that maps SHA1 message digests to
   5  * data streams; plus code to read and write the corresponding on-disk data.
   6  */
   7
   8 /*
   9  * Copyright (C) 2012, 2013 Eric Biggers
  10  *
  11  * This file is part of wimlib, a library for working with WIM files.
  12  *
  13  * wimlib is free software; you can redistribute it and/or modify it under the
  14  * terms of the GNU General Public License as published by the Free
  15  * Software Foundation; either version 3 of the License, or (at your option)
  16  * any later version.
  17  *
  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 General Public License for more
  21  * details.
  22  *
  23  * You should have received a copy of the GNU General Public License
  24  * along with wimlib; if not, see http://www.gnu.org/licenses/.
  25  */
  26
  27 #ifdef HAVE_CONFIG_H
  28 #  include "config.h"
  29 #endif
  30
  31 #include "wimlib/endianness.h"
  32 #include "wimlib/error.h"
  33 #include "wimlib/file_io.h"
  34 #include "wimlib/glob.h"
  35 #include "wimlib/lookup_table.h"
  36 #include "wimlib/metadata.h"
  37 #include "wimlib/paths.h"
  38 #include "wimlib/resource.h"
  39 #include "wimlib/util.h"
  40 #include "wimlib/write.h"
  41
  42 #include <errno.h>
  43 #include <stdlib.h>
  44 #ifdef WITH_FUSE
  45 #  include <unistd.h> /* for unlink() */
  46 #endif
  47
  48 struct wim_lookup_table *
  49 new_lookup_table(size_t capacity)
  50 {
  51         struct wim_lookup_table *table;
  52         struct hlist_head *array;
  53
  54         table = CALLOC(1, sizeof(struct wim_lookup_table));
  55         if (table) {
  56                 array = CALLOC(capacity, sizeof(array[0]));
  57                 if (array) {
  58                         table->num_entries = 0;
  59                         table->capacity = capacity;
  60                         table->array = array;
  61                 } else {
  62                         FREE(table);
  63                         table = NULL;
  64                         ERROR("Failed to allocate memory for lookup table "
  65                               "with capacity %zu", capacity);
  66                 }
  67         }
  68         return table;
  69 }
  70
  71 struct wim_lookup_table_entry *
  72 new_lookup_table_entry(void)
  73 {
  74         struct wim_lookup_table_entry *lte;
  75
  76         lte = CALLOC(1, sizeof(struct wim_lookup_table_entry));
  77         if (lte) {
  78                 lte->part_number  = 1;
  79                 lte->refcnt       = 1;
  80         } else {
  81                 ERROR("Out of memory (tried to allocate %zu bytes for "
  82                       "lookup table entry)",
  83                       sizeof(struct wim_lookup_table_entry));
  84         }
  85         return lte;
  86 }
  87
  88 struct wim_lookup_table_entry *
  89 clone_lookup_table_entry(const struct wim_lookup_table_entry *old)
  90 {
  91         struct wim_lookup_table_entry *new;
  92
  93         new = memdup(old, sizeof(struct wim_lookup_table_entry));
  94         if (!new)
  95                 return NULL;
  96
  97         new->extracted_file = NULL;
  98         switch (new->resource_location) {
  99         case RESOURCE_IN_FILE_ON_DISK:
 100 #ifdef __WIN32__
 101         case RESOURCE_WIN32_ENCRYPTED:
 102 #endif
 103 #ifdef WITH_FUSE
 104         case RESOURCE_IN_STAGING_FILE:
 105                 BUILD_BUG_ON((void*)&old->file_on_disk !=
 106                              (void*)&old->staging_file_name);
 107 #endif
 108                 new->file_on_disk = TSTRDUP(old->file_on_disk);
 109                 if (!new->file_on_disk)
 110                         goto out_free;
 111                 break;
 112         case RESOURCE_IN_ATTACHED_BUFFER:
 113                 new->attached_buffer = memdup(old->attached_buffer,
 114                                               wim_resource_size(old));
 115                 if (!new->attached_buffer)
 116                         goto out_free;
 117                 break;
 118 #ifdef WITH_NTFS_3G
 119         case RESOURCE_IN_NTFS_VOLUME:
 120                 if (old->ntfs_loc) {
 121                         struct ntfs_location *loc;
 122                         loc = memdup(old->ntfs_loc, sizeof(struct ntfs_location));
 123                         if (!loc)
 124                                 goto out_free;
 125                         loc->path = NULL;
 126                         loc->stream_name = NULL;
 127                         new->ntfs_loc = loc;
 128                         loc->path = STRDUP(old->ntfs_loc->path);
 129                         if (!loc->path)
 130                                 goto out_free;
 131                         if (loc->stream_name_nchars) {
 132                                 loc->stream_name = memdup(old->ntfs_loc->stream_name,
 133                                                           loc->stream_name_nchars * 2);
 134                                 if (!loc->stream_name)
 135                                         goto out_free;
 136                         }
 137                 }
 138                 break;
 139 #endif
 140         default:
 141                 break;
 142         }
 143         return new;
 144 out_free:
 145         free_lookup_table_entry(new);
 146         return NULL;
 147 }
 148
 149 void
 150 free_lookup_table_entry(struct wim_lookup_table_entry *lte)
 151 {
 152         if (lte) {
 153                 switch (lte->resource_location) {
 154                 case RESOURCE_IN_FILE_ON_DISK:
 155         #ifdef __WIN32__
 156                 case RESOURCE_WIN32_ENCRYPTED:
 157         #endif
 158         #ifdef WITH_FUSE
 159                 case RESOURCE_IN_STAGING_FILE:
 160                         BUILD_BUG_ON((void*)&lte->file_on_disk !=
 161                                      (void*)&lte->staging_file_name);
 162         #endif
 163                 case RESOURCE_IN_ATTACHED_BUFFER:
 164                         BUILD_BUG_ON((void*)&lte->file_on_disk !=
 165                                      (void*)&lte->attached_buffer);
 166                         FREE(lte->file_on_disk);
 167                         break;
 168 #ifdef WITH_NTFS_3G
 169                 case RESOURCE_IN_NTFS_VOLUME:
 170                         if (lte->ntfs_loc) {
 171                                 FREE(lte->ntfs_loc->path);
 172                                 FREE(lte->ntfs_loc->stream_name);
 173                                 FREE(lte->ntfs_loc);
 174                         }
 175                         break;
 176 #endif
 177                 default:
 178                         break;
 179                 }
 180                 FREE(lte);
 181         }
 182 }
 183
 184 static int
 185 do_free_lookup_table_entry(struct wim_lookup_table_entry *entry, void *ignore)
 186 {
 187         free_lookup_table_entry(entry);
 188         return 0;
 189 }
 190
 191
 192 void
 193 free_lookup_table(struct wim_lookup_table *table)
 194 {
 195         DEBUG2("Freeing lookup table");
 196         if (table) {
 197                 if (table->array) {
 198                         for_lookup_table_entry(table,
 199                                                do_free_lookup_table_entry,
 200                                                NULL);
 201                         FREE(table->array);
 202                 }
 203                 FREE(table);
 204         }
 205 }
 206
 207 /*
 208  * Inserts an entry into the lookup table.
 209  *
 210  * @table:      A pointer to the lookup table.
 211  * @lte:        A pointer to the entry to insert.
 212  */
 213 void
 214 lookup_table_insert(struct wim_lookup_table *table,
 215                     struct wim_lookup_table_entry *lte)
 216 {
 217         size_t i = lte->hash_short % table->capacity;
 218         hlist_add_head(&lte->hash_list, &table->array[i]);
 219
 220         /* XXX Make the table grow when too many entries have been inserted. */
 221         table->num_entries++;
 222 }
 223
 224 static void
 225 finalize_lte(struct wim_lookup_table_entry *lte)
 226 {
 227         #ifdef WITH_FUSE
 228         if (lte->resource_location == RESOURCE_IN_STAGING_FILE) {
 229                 unlink(lte->staging_file_name);
 230                 list_del(&lte->unhashed_list);
 231         }
 232         #endif
 233         free_lookup_table_entry(lte);
 234 }
 235
 236 /* Decrements the reference count for the lookup table entry @lte.  If its
 237  * reference count reaches 0, it is unlinked from the lookup table.  If,
 238  * furthermore, the entry has no opened file descriptors associated with it, the
 239  * entry is freed.  */
 240 void
 241 lte_decrement_refcnt(struct wim_lookup_table_entry *lte,
 242                      struct wim_lookup_table *table)
 243 {
 244         wimlib_assert(lte != NULL);
 245         wimlib_assert(lte->refcnt != 0);
 246         if (--lte->refcnt == 0) {
 247                 if (lte->unhashed)
 248                         list_del(&lte->unhashed_list);
 249                 else
 250                         lookup_table_unlink(table, lte);
 251         #ifdef WITH_FUSE
 252                 if (lte->num_opened_fds == 0)
 253         #endif
 254                         finalize_lte(lte);
 255         }
 256 }
 257
 258 #ifdef WITH_FUSE
 259 void
 260 lte_decrement_num_opened_fds(struct wim_lookup_table_entry *lte)
 261 {
 262         if (lte->num_opened_fds != 0)
 263                 if (--lte->num_opened_fds == 0 && lte->refcnt == 0)
 264                         finalize_lte(lte);
 265 }
 266 #endif
 267
 268 /* Calls a function on all the entries in the WIM lookup table.  Stop early and
 269  * return nonzero if any call to the function returns nonzero. */
 270 int
 271 for_lookup_table_entry(struct wim_lookup_table *table,
 272                        int (*visitor)(struct wim_lookup_table_entry *, void *),
 273                        void *arg)
 274 {
 275         struct wim_lookup_table_entry *lte;
 276         struct hlist_node *pos, *tmp;
 277         int ret;
 278
 279         for (size_t i = 0; i < table->capacity; i++) {
 280                 hlist_for_each_entry_safe(lte, pos, tmp, &table->array[i],
 281                                           hash_list)
 282                 {
 283                         wimlib_assert2(!(lte->resource_entry.flags & WIM_RESHDR_FLAG_METADATA));
 284                         ret = visitor(lte, arg);
 285                         if (ret)
 286                                 return ret;
 287                 }
 288         }
 289         return 0;
 290 }
 291
 292 /* qsort() callback that sorts streams (represented by `struct
 293  * wim_lookup_table_entry's) into an order optimized for reading and writing.
 294  *
 295  * Sorting is done primarily by resource location, then secondarily by a
 296  * per-resource location order.  For example, resources in WIM files are sorted
 297  * primarily by part number, then secondarily by offset, as to implement optimal
 298  * reading of either a standalone or split WIM.  */
 299 static int
 300 cmp_streams_by_sequential_order(const void *p1, const void *p2)
 301 {
 302         const struct wim_lookup_table_entry *lte1, *lte2;
 303         int v;
 304
 305         lte1 = *(const struct wim_lookup_table_entry**)p1;
 306         lte2 = *(const struct wim_lookup_table_entry**)p2;
 307
 308         v = (int)lte1->resource_location - (int)lte2->resource_location;
 309
 310         /* Different resource locations?  */
 311         if (v)
 312                 return v;
 313
 314         switch (lte1->resource_location) {
 315         case RESOURCE_IN_WIM:
 316
 317                 /* Different (possibly split) WIMs?  */
 318                 if (lte1->wim != lte2->wim) {
 319                         v = memcmp(lte1->wim->hdr.guid, lte2->wim->hdr.guid,
 320                                    WIM_GID_LEN);
 321                         if (v)
 322                                 return v;
 323                 }
 324
 325                 /* Different part numbers in the same WIM?  */
 326                 v = (int)lte1->wim->hdr.part_number - (int)lte2->wim->hdr.part_number;
 327                 if (v)
 328                         return v;
 329
 330                 /* Compare by offset.  */
 331                 if (lte1->resource_entry.offset < lte2->resource_entry.offset)
 332                         return -1;
 333                 else if (lte1->resource_entry.offset > lte2->resource_entry.offset)
 334                         return 1;
 335                 return 0;
 336         case RESOURCE_IN_FILE_ON_DISK:
 337 #ifdef __WIN32__
 338         case RESOURCE_WIN32_ENCRYPTED:
 339 #endif
 340                 /* Compare files by path: just a heuristic that will place files
 341                  * in the same directory next to each other.  */
 342                 return tstrcmp(lte1->file_on_disk, lte2->file_on_disk);
 343 #ifdef WITH_NTFS_3G
 344         case RESOURCE_IN_NTFS_VOLUME:
 345                 return tstrcmp(lte1->ntfs_loc->path, lte2->ntfs_loc->path);
 346 #endif
 347         default:
 348                 /* No additional sorting order defined for this resource
 349                  * location (e.g. RESOURCE_IN_ATTACHED_BUFFER); simply compare
 350                  * everything equal to each other.  */
 351                 return 0;
 352         }
 353 }
 354
 355 int
 356 sort_stream_list_by_sequential_order(struct list_head *stream_list,
 357                                      size_t list_head_offset)
 358 {
 359         struct list_head *cur;
 360         struct wim_lookup_table_entry **array;
 361         size_t i;
 362         size_t array_size;
 363         size_t num_streams = 0;
 364
 365         list_for_each(cur, stream_list)
 366                 num_streams++;
 367
 368         array_size = num_streams * sizeof(array[0]);
 369         array = MALLOC(array_size);
 370         if (!array)
 371                 return WIMLIB_ERR_NOMEM;
 372         cur = stream_list->next;
 373         for (i = 0; i < num_streams; i++) {
 374                 array[i] = (struct wim_lookup_table_entry*)((u8*)cur -
 375                                                             list_head_offset);
 376                 cur = cur->next;
 377         }
 378
 379         qsort(array, num_streams, sizeof(array[0]),
 380               cmp_streams_by_sequential_order);
 381
 382         INIT_LIST_HEAD(stream_list);
 383         for (i = 0; i < num_streams; i++) {
 384                 list_add_tail((struct list_head*)
 385                                ((u8*)array[i] + list_head_offset),
 386                               stream_list);
 387         }
 388         FREE(array);
 389         return 0;
 390 }
 391
 392
 393 static int
 394 add_lte_to_array(struct wim_lookup_table_entry *lte,
 395                  void *_pp)
 396 {
 397         struct wim_lookup_table_entry ***pp = _pp;
 398         *(*pp)++ = lte;
 399         return 0;
 400 }
 401
 402 /* Iterate through the lookup table entries, but first sort them by stream
 403  * offset in the WIM.  Caution: this is intended to be used when the stream
 404  * offset field has actually been set. */
 405 int
 406 for_lookup_table_entry_pos_sorted(struct wim_lookup_table *table,
 407                                   int (*visitor)(struct wim_lookup_table_entry *,
 408                                                  void *),
 409                                   void *arg)
 410 {
 411         struct wim_lookup_table_entry **lte_array, **p;
 412         size_t num_streams = table->num_entries;
 413         int ret;
 414
 415         lte_array = MALLOC(num_streams * sizeof(lte_array[0]));
 416         if (!lte_array)
 417                 return WIMLIB_ERR_NOMEM;
 418         p = lte_array;
 419         for_lookup_table_entry(table, add_lte_to_array, &p);
 420
 421         wimlib_assert(p == lte_array + num_streams);
 422
 423         qsort(lte_array, num_streams, sizeof(lte_array[0]),
 424               cmp_streams_by_sequential_order);
 425         ret = 0;
 426         for (size_t i = 0; i < num_streams; i++) {
 427                 ret = visitor(lte_array[i], arg);
 428                 if (ret)
 429                         break;
 430         }
 431         FREE(lte_array);
 432         return ret;
 433 }
 434
 435 /* On-disk format of a WIM lookup table entry (stream entry). */
 436 struct wim_lookup_table_entry_disk {
 437         /* Location, offset, compression status, and metadata status of the
 438          * stream. */
 439         struct resource_entry_disk resource_entry;
 440
 441         /* Which part of the split WIM this stream is in; indexed from 1. */
 442         le16 part_number;
 443
 444         /* Reference count of this stream over all WIM images. */
 445         le32 refcnt;
 446
 447         /* SHA1 message digest of the uncompressed data of this stream, or
 448          * optionally all zeroes if this stream is of zero length. */
 449         u8 hash[SHA1_HASH_SIZE];
 450 } _packed_attribute;
 451
 452 #define WIM_LOOKUP_TABLE_ENTRY_DISK_SIZE 50
 453
 454 void
 455 lte_init_wim(struct wim_lookup_table_entry *lte, WIMStruct *wim)
 456 {
 457         lte->resource_location = RESOURCE_IN_WIM;
 458         lte->wim = wim;
 459         if (lte->resource_entry.flags & WIM_RESHDR_FLAG_COMPRESSED)
 460                 lte->compression_type = wim->compression_type;
 461         else
 462                 lte->compression_type = WIMLIB_COMPRESSION_TYPE_NONE;
 463
 464         if (wim_is_pipable(wim))
 465                 lte->is_pipable = 1;
 466 }
 467
 468 /*
 469  * Reads the lookup table from a WIM file.
 470  *
 471  * Saves lookup table entries for non-metadata streams in a hash table, and
 472  * saves the metadata entry for each image in a special per-image location (the
 473  * image_metadata array).
 474  *
 475  * Return values:
 476  *      WIMLIB_ERR_SUCCESS (0)
 477  *      WIMLIB_ERR_INVALID_LOOKUP_TABLE_ENTRY
 478  *      WIMLIB_ERR_RESOURCE_NOT_FOUND
 479  */
 480 int
 481 read_wim_lookup_table(WIMStruct *wim)
 482 {
 483         int ret;
 484         size_t i;
 485         size_t num_entries;
 486         struct wim_lookup_table *table;
 487         struct wim_lookup_table_entry *cur_entry, *duplicate_entry;
 488         void *buf;
 489
 490         BUILD_BUG_ON(sizeof(struct wim_lookup_table_entry_disk) !=
 491                      WIM_LOOKUP_TABLE_ENTRY_DISK_SIZE);
 492
 493         DEBUG("Reading lookup table: offset %"PRIu64", size %"PRIu64"",
 494               wim->hdr.lookup_table_res_entry.offset,
 495               wim->hdr.lookup_table_res_entry.size);
 496
 497         /* Calculate number of entries in the lookup table.  */
 498         num_entries = wim->hdr.lookup_table_res_entry.size /
 499                       sizeof(struct wim_lookup_table_entry_disk);
 500
 501
 502         /* Read the lookup table into a buffer.  */
 503         ret = res_entry_to_data(&wim->hdr.lookup_table_res_entry, wim, &buf);
 504         if (ret)
 505                 goto out;
 506
 507         /* Allocate hash table.  */
 508         table = new_lookup_table(num_entries * 2 + 1);
 509         if (!table) {
 510                 ERROR("Not enough memory to read lookup table.");
 511                 ret = WIMLIB_ERR_NOMEM;
 512                 goto out_free_buf;
 513         }
 514
 515         /* Allocate and initalize `struct wim_lookup_table_entry's from the
 516          * on-disk lookup table.  */
 517         wim->current_image = 0;
 518         for (i = 0; i < num_entries; i++) {
 519                 const struct wim_lookup_table_entry_disk *disk_entry =
 520                         &((const struct wim_lookup_table_entry_disk*)buf)[i];
 521
 522                 cur_entry = new_lookup_table_entry();
 523                 if (!cur_entry) {
 524                         ERROR("Not enough memory to read lookup table.");
 525                         ret = WIMLIB_ERR_NOMEM;
 526                         goto out_free_lookup_table;
 527                 }
 528
 529                 cur_entry->wim = wim;
 530                 cur_entry->resource_location = RESOURCE_IN_WIM;
 531                 get_resource_entry(&disk_entry->resource_entry, &cur_entry->resource_entry);
 532                 cur_entry->part_number = le16_to_cpu(disk_entry->part_number);
 533                 cur_entry->refcnt = le32_to_cpu(disk_entry->refcnt);
 534                 copy_hash(cur_entry->hash, disk_entry->hash);
 535                 lte_init_wim(cur_entry, wim);
 536
 537                 if (cur_entry->part_number != wim->hdr.part_number) {
 538                         WARNING("A lookup table entry in part %hu of the WIM "
 539                                 "points to part %hu (ignoring it)",
 540                                 wim->hdr.part_number, cur_entry->part_number);
 541                         free_lookup_table_entry(cur_entry);
 542                         continue;
 543                 }
 544
 545                 if (is_zero_hash(cur_entry->hash)) {
 546                         WARNING("The WIM lookup table contains an entry with a "
 547                                 "SHA1 message digest of all 0's (ignoring it)");
 548                         free_lookup_table_entry(cur_entry);
 549                         continue;
 550                 }
 551
 552                 if (!(cur_entry->resource_entry.flags & WIM_RESHDR_FLAG_COMPRESSED)
 553                     && (cur_entry->resource_entry.size !=
 554                         cur_entry->resource_entry.original_size))
 555                 {
 556                         if (wimlib_print_errors) {
 557                                 WARNING("Found uncompressed resource with "
 558                                         "original size (%"PRIu64") not the same "
 559                                         "as compressed size (%"PRIu64")",
 560                                         cur_entry->resource_entry.original_size,
 561                                         cur_entry->resource_entry.size);
 562                                 if (cur_entry->resource_entry.original_size) {
 563                                         WARNING("Overriding compressed size with original size.");
 564                                         cur_entry->resource_entry.size =
 565                                                 cur_entry->resource_entry.original_size;
 566                                 } else {
 567                                         WARNING("Overriding original size with compressed size");
 568                                         cur_entry->resource_entry.original_size =
 569                                                 cur_entry->resource_entry.size;
 570                                 }
 571                         }
 572                 }
 573
 574                 if (cur_entry->resource_entry.flags & WIM_RESHDR_FLAG_METADATA) {
 575                         /* Lookup table entry for a metadata resource */
 576                         if (cur_entry->refcnt != 1) {
 577                                 if (wimlib_print_errors) {
 578                                         ERROR("Found metadata resource with refcnt != 1:");
 579                                         print_lookup_table_entry(cur_entry, stderr);
 580                                 }
 581                                 ret = WIMLIB_ERR_INVALID_LOOKUP_TABLE_ENTRY;
 582                                 goto out_free_cur_entry;
 583                         }
 584
 585                         if (wim->hdr.part_number != 1) {
 586                                 WARNING("Ignoring metadata resource found in a "
 587                                         "non-first part of the split WIM");
 588                                 free_lookup_table_entry(cur_entry);
 589                                 continue;
 590                         }
 591                         if (wim->current_image == wim->hdr.image_count) {
 592                                 WARNING("The WIM header says there are %u images "
 593                                         "in the WIM, but we found more metadata "
 594                                         "resources than this (ignoring the extra)",
 595                                         wim->hdr.image_count);
 596                                 free_lookup_table_entry(cur_entry);
 597                                 continue;
 598                         }
 599
 600                         /* Notice very carefully:  We are assigning the metadata
 601                          * resources in the exact order mirrored by their lookup
 602                          * table entries on disk, which is the behavior of
 603                          * Microsoft's software.  In particular, this overrides
 604                          * the actual locations of the metadata resources
 605                          * themselves in the WIM file as well as any information
 606                          * written in the XML data. */
 607                         DEBUG("Found metadata resource for image %u at "
 608                               "offset %"PRIu64".",
 609                               wim->current_image + 1,
 610                               cur_entry->resource_entry.offset);
 611                         wim->image_metadata[
 612                                 wim->current_image++]->metadata_lte = cur_entry;
 613                 } else {
 614                         /* Lookup table entry for a stream that is not a
 615                          * metadata resource */
 616                         duplicate_entry = __lookup_resource(table, cur_entry->hash);
 617                         if (duplicate_entry) {
 618                                 if (wimlib_print_errors) {
 619                                         WARNING("The WIM lookup table contains two entries with the "
 620                                               "same SHA1 message digest!");
 621                                         WARNING("The first entry is:");
 622                                         print_lookup_table_entry(duplicate_entry, stderr);
 623                                         WARNING("The second entry is:");
 624                                         print_lookup_table_entry(cur_entry, stderr);
 625                                 }
 626                                 free_lookup_table_entry(cur_entry);
 627                                 continue;
 628                         } else {
 629                                 lookup_table_insert(table, cur_entry);
 630                         }
 631                 }
 632         }
 633
 634         if (wim->hdr.part_number == 1 && wim->current_image != wim->hdr.image_count) {
 635                 WARNING("The header of \"%"TS"\" says there are %u images in\n"
 636                         "          the WIM, but we only found %d metadata resources!  Acting as if\n"
 637                         "          the header specified only %d images instead.",
 638                         wim->filename, wim->hdr.image_count,
 639                         wim->current_image, wim->current_image);
 640                 for (int i = wim->current_image; i < wim->hdr.image_count; i++)
 641                         put_image_metadata(wim->image_metadata[i], NULL);
 642                 wim->hdr.image_count = wim->current_image;
 643         }
 644         DEBUG("Done reading lookup table.");
 645         wim->lookup_table = table;
 646         ret = 0;
 647         goto out_free_buf;
 648 out_free_cur_entry:
 649         FREE(cur_entry);
 650 out_free_lookup_table:
 651         free_lookup_table(table);
 652 out_free_buf:
 653         FREE(buf);
 654 out:
 655         wim->current_image = 0;
 656         return ret;
 657 }
 658
 659
 660 static void
 661 write_wim_lookup_table_entry(const struct wim_lookup_table_entry *lte,
 662                              struct wim_lookup_table_entry_disk *disk_entry)
 663 {
 664         put_resource_entry(&lte->output_resource_entry, &disk_entry->resource_entry);
 665         disk_entry->part_number = cpu_to_le16(lte->part_number);
 666         disk_entry->refcnt = cpu_to_le32(lte->out_refcnt);
 667         copy_hash(disk_entry->hash, lte->hash);
 668 }
 669
 670 static int
 671 write_wim_lookup_table_from_stream_list(struct list_head *stream_list,
 672                                         struct filedes *out_fd,
 673                                         struct resource_entry *out_res_entry,
 674                                         int write_resource_flags)
 675 {
 676         size_t table_size;
 677         struct wim_lookup_table_entry *lte;
 678         struct wim_lookup_table_entry_disk *table_buf;
 679         struct wim_lookup_table_entry_disk *table_buf_ptr;
 680         int ret;
 681
 682         table_size = 0;
 683         list_for_each_entry(lte, stream_list, lookup_table_list)
 684                 table_size += sizeof(struct wim_lookup_table_entry_disk);
 685
 686         DEBUG("Writing WIM lookup table (size=%zu, offset=%"PRIu64")",
 687               table_size, out_fd->offset);
 688
 689         table_buf = MALLOC(table_size);
 690         if (!table_buf) {
 691                 ERROR("Failed to allocate %zu bytes for temporary lookup table",
 692                       table_size);
 693                 return WIMLIB_ERR_NOMEM;
 694         }
 695         table_buf_ptr = table_buf;
 696         list_for_each_entry(lte, stream_list, lookup_table_list)
 697                 write_wim_lookup_table_entry(lte, table_buf_ptr++);
 698
 699         /* Write the lookup table uncompressed.  Although wimlib can handle a
 700          * compressed lookup table, MS software cannot.  */
 701         ret = write_wim_resource_from_buffer(table_buf,
 702                                              table_size,
 703                                              WIM_RESHDR_FLAG_METADATA,
 704                                              out_fd,
 705                                              WIMLIB_COMPRESSION_TYPE_NONE,
 706                                              out_res_entry,
 707                                              NULL,
 708                                              write_resource_flags);
 709         FREE(table_buf);
 710         return ret;
 711 }
 712
 713 static int
 714 append_lookup_table_entry(struct wim_lookup_table_entry *lte, void *_list)
 715 {
 716         if (lte->out_refcnt != 0)
 717                 list_add_tail(&lte->lookup_table_list, (struct list_head*)_list);
 718         return 0;
 719 }
 720
 721 int
 722 write_wim_lookup_table(WIMStruct *wim, int image, int write_flags,
 723                        struct resource_entry *out_res_entry,
 724                        struct list_head *stream_list_override)
 725 {
 726         int write_resource_flags;
 727         struct list_head _stream_list;
 728         struct list_head *stream_list;
 729
 730         if (stream_list_override) {
 731                 stream_list = stream_list_override;
 732         } else {
 733                 stream_list = &_stream_list;
 734                 INIT_LIST_HEAD(stream_list);
 735         }
 736
 737         if (!(write_flags & WIMLIB_WRITE_FLAG_NO_METADATA)) {
 738                 int start_image;
 739                 int end_image;
 740
 741                 if (image == WIMLIB_ALL_IMAGES) {
 742                         start_image = 1;
 743                         end_image = wim->hdr.image_count;
 744                 } else {
 745                         start_image = image;
 746                         end_image = image;
 747                 }
 748
 749                 /* Push metadata resource lookup table entries onto the front of
 750                  * the list in reverse order, so that they're written in order.
 751                  */
 752                 for (int i = end_image; i >= start_image; i--) {
 753                         struct wim_lookup_table_entry *metadata_lte;
 754
 755                         metadata_lte = wim->image_metadata[i - 1]->metadata_lte;
 756                         metadata_lte->out_refcnt = 1;
 757                         metadata_lte->part_number = wim->hdr.part_number;
 758                         metadata_lte->output_resource_entry.flags |= WIM_RESHDR_FLAG_METADATA;
 759
 760                         list_add(&metadata_lte->lookup_table_list, stream_list);
 761                 }
 762         }
 763
 764         /* Append additional lookup table entries that have out_refcnt != 0.  */
 765         if (!stream_list_override) {
 766                 for_lookup_table_entry(wim->lookup_table,
 767                                        append_lookup_table_entry, stream_list);
 768         }
 769
 770         write_resource_flags = 0;
 771         if (write_flags & WIMLIB_WRITE_FLAG_PIPABLE)
 772                 write_resource_flags |= WIMLIB_WRITE_RESOURCE_FLAG_PIPABLE;
 773         return write_wim_lookup_table_from_stream_list(stream_list,
 774                                                        &wim->out_fd,
 775                                                        out_res_entry,
 776                                                        write_resource_flags);
 777 }
 778
 779
 780 int
 781 lte_zero_real_refcnt(struct wim_lookup_table_entry *lte, void *_ignore)
 782 {
 783         lte->real_refcnt = 0;
 784         return 0;
 785 }
 786
 787 int
 788 lte_zero_out_refcnt(struct wim_lookup_table_entry *lte, void *_ignore)
 789 {
 790         lte->out_refcnt = 0;
 791         return 0;
 792 }
 793
 794 int
 795 lte_free_extracted_file(struct wim_lookup_table_entry *lte, void *_ignore)
 796 {
 797         if (lte->extracted_file != NULL) {
 798                 FREE(lte->extracted_file);
 799                 lte->extracted_file = NULL;
 800         }
 801         return 0;
 802 }
 803
 804 void
 805 print_lookup_table_entry(const struct wim_lookup_table_entry *lte, FILE *out)
 806 {
 807         if (!lte) {
 808                 tputc(T('\n'), out);
 809                 return;
 810         }
 811         tfprintf(out, T("Offset            = %"PRIu64" bytes\n"),
 812                  lte->resource_entry.offset);
 813
 814         tfprintf(out, T("Size              = %"PRIu64" bytes\n"),
 815                  (u64)lte->resource_entry.size);
 816
 817         tfprintf(out, T("Original size     = %"PRIu64" bytes\n"),
 818                  lte->resource_entry.original_size);
 819
 820         tfprintf(out, T("Part Number       = %hu\n"), lte->part_number);
 821         tfprintf(out, T("Reference Count   = %u\n"), lte->refcnt);
 822
 823         if (lte->unhashed) {
 824                 tfprintf(out, T("(Unhashed: inode %p, stream_id = %u)\n"),
 825                          lte->back_inode, lte->back_stream_id);
 826         } else {
 827                 tfprintf(out, T("Hash              = 0x"));
 828                 print_hash(lte->hash, out);
 829                 tputc(T('\n'), out);
 830         }
 831
 832         tfprintf(out, T("Flags             = "));
 833         u8 flags = lte->resource_entry.flags;
 834         if (flags & WIM_RESHDR_FLAG_COMPRESSED)
 835                 tfputs(T("WIM_RESHDR_FLAG_COMPRESSED, "), out);
 836         if (flags & WIM_RESHDR_FLAG_FREE)
 837                 tfputs(T("WIM_RESHDR_FLAG_FREE, "), out);
 838         if (flags & WIM_RESHDR_FLAG_METADATA)
 839                 tfputs(T("WIM_RESHDR_FLAG_METADATA, "), out);
 840         if (flags & WIM_RESHDR_FLAG_SPANNED)
 841                 tfputs(T("WIM_RESHDR_FLAG_SPANNED, "), out);
 842         tputc(T('\n'), out);
 843         switch (lte->resource_location) {
 844         case RESOURCE_IN_WIM:
 845                 if (lte->wim->filename) {
 846                         tfprintf(out, T("WIM file          = `%"TS"'\n"),
 847                                  lte->wim->filename);
 848                 }
 849                 break;
 850 #ifdef __WIN32__
 851         case RESOURCE_WIN32_ENCRYPTED:
 852 #endif
 853         case RESOURCE_IN_FILE_ON_DISK:
 854                 tfprintf(out, T("File on Disk      = `%"TS"'\n"),
 855                          lte->file_on_disk);
 856                 break;
 857 #ifdef WITH_FUSE
 858         case RESOURCE_IN_STAGING_FILE:
 859                 tfprintf(out, T("Staging File      = `%"TS"'\n"),
 860                                 lte->staging_file_name);
 861                 break;
 862 #endif
 863         default:
 864                 break;
 865         }
 866         tputc(T('\n'), out);
 867 }
 868
 869 void
 870 lte_to_wimlib_resource_entry(const struct wim_lookup_table_entry *lte,
 871                              struct wimlib_resource_entry *wentry)
 872 {
 873         wentry->uncompressed_size = lte->resource_entry.original_size;
 874         wentry->compressed_size = lte->resource_entry.size;
 875         wentry->offset = lte->resource_entry.offset;
 876         copy_hash(wentry->sha1_hash, lte->hash);
 877         wentry->part_number = lte->part_number;
 878         wentry->reference_count = lte->refcnt;
 879         wentry->is_compressed = (lte->resource_entry.flags & WIM_RESHDR_FLAG_COMPRESSED) != 0;
 880         wentry->is_metadata = (lte->resource_entry.flags & WIM_RESHDR_FLAG_METADATA) != 0;
 881         wentry->is_free = (lte->resource_entry.flags & WIM_RESHDR_FLAG_FREE) != 0;
 882         wentry->is_spanned = (lte->resource_entry.flags & WIM_RESHDR_FLAG_SPANNED) != 0;
 883 }
 884
 885 struct iterate_lte_context {
 886         wimlib_iterate_lookup_table_callback_t cb;
 887         void *user_ctx;
 888 };
 889
 890 static int
 891 do_iterate_lte(struct wim_lookup_table_entry *lte, void *_ctx)
 892 {
 893         struct iterate_lte_context *ctx = _ctx;
 894         struct wimlib_resource_entry entry;
 895
 896         lte_to_wimlib_resource_entry(lte, &entry);
 897         return (*ctx->cb)(&entry, ctx->user_ctx);
 898 }
 899
 900 /* API function documented in wimlib.h  */
 901 WIMLIBAPI int
 902 wimlib_iterate_lookup_table(WIMStruct *wim, int flags,
 903                             wimlib_iterate_lookup_table_callback_t cb,
 904                             void *user_ctx)
 905 {
 906         struct iterate_lte_context ctx = {
 907                 .cb = cb,
 908                 .user_ctx = user_ctx,
 909         };
 910         if (wim->hdr.part_number == 1) {
 911                 int ret;
 912                 for (int i = 0; i < wim->hdr.image_count; i++) {
 913                         ret = do_iterate_lte(wim->image_metadata[i]->metadata_lte,
 914                                              &ctx);
 915                         if (ret)
 916                                 return ret;
 917                 }
 918         }
 919         return for_lookup_table_entry(wim->lookup_table, do_iterate_lte, &ctx);
 920 }
 921
 922 /* Given a SHA1 message digest, return the corresponding entry in the WIM's
 923  * lookup table, or NULL if there is none.  */
 924 struct wim_lookup_table_entry *
 925 __lookup_resource(const struct wim_lookup_table *table, const u8 hash[])
 926 {
 927         size_t i;
 928         struct wim_lookup_table_entry *lte;
 929         struct hlist_node *pos;
 930
 931         wimlib_assert(table != NULL);
 932         wimlib_assert(hash != NULL);
 933
 934         i = *(size_t*)hash % table->capacity;
 935         hlist_for_each_entry(lte, pos, &table->array[i], hash_list)
 936                 if (hashes_equal(hash, lte->hash))
 937                         return lte;
 938         return NULL;
 939 }
 940
 941 #ifdef WITH_FUSE
 942 /*
 943  * Finds the dentry, lookup table entry, and stream index for a WIM file stream,
 944  * given a path name.
 945  *
 946  * This is only for pre-resolved inodes.
 947  */
 948 int
 949 lookup_resource(WIMStruct *wim,
 950                 const tchar *path,
 951                 int lookup_flags,
 952                 struct wim_dentry **dentry_ret,
 953                 struct wim_lookup_table_entry **lte_ret,
 954                 u16 *stream_idx_ret)
 955 {
 956         struct wim_dentry *dentry;
 957         struct wim_lookup_table_entry *lte;
 958         u16 stream_idx;
 959         const tchar *stream_name = NULL;
 960         struct wim_inode *inode;
 961         tchar *p = NULL;
 962
 963         if (lookup_flags & LOOKUP_FLAG_ADS_OK) {
 964                 stream_name = path_stream_name(path);
 965                 if (stream_name) {
 966                         p = (tchar*)stream_name - 1;
 967                         *p = T('\0');
 968                 }
 969         }
 970
 971         dentry = get_dentry(wim, path);
 972         if (p)
 973                 *p = T(':');
 974         if (!dentry)
 975                 return -errno;
 976
 977         inode = dentry->d_inode;
 978
 979         if (!inode->i_resolved)
 980                 if (inode_resolve_ltes(inode, wim->lookup_table, false))
 981                         return -EIO;
 982
 983         if (!(lookup_flags & LOOKUP_FLAG_DIRECTORY_OK)
 984               && inode_is_directory(inode))
 985                 return -EISDIR;
 986
 987         if (stream_name) {
 988                 struct wim_ads_entry *ads_entry;
 989                 u16 ads_idx;
 990                 ads_entry = inode_get_ads_entry(inode, stream_name,
 991                                                 &ads_idx);
 992                 if (ads_entry) {
 993                         stream_idx = ads_idx + 1;
 994                         lte = ads_entry->lte;
 995                         goto out;
 996                 } else {
 997                         return -ENOENT;
 998                 }
 999         } else {
1000                 lte = inode->i_lte;
1001                 stream_idx = 0;
1002         }
1003 out:
1004         if (dentry_ret)
1005                 *dentry_ret = dentry;
1006         if (lte_ret)
1007                 *lte_ret = lte;
1008         if (stream_idx_ret)
1009                 *stream_idx_ret = stream_idx;
1010         return 0;
1011 }
1012 #endif
1013
1014 int
1015 resource_not_found_error(struct wim_inode *inode, const u8 *hash)
1016 {
1017         if (wimlib_print_errors) {
1018                 ERROR("\"%"TS"\": resource not found", inode_first_full_path(inode));
1019                 tfprintf(stderr, T("        SHA-1 message digest of missing resource:\n        "));
1020                 print_hash(hash, stderr);
1021                 tputc(T('\n'), stderr);
1022         }
1023         return WIMLIB_ERR_RESOURCE_NOT_FOUND;
1024 }
1025
1026 /*
1027  * Resolve an inode's lookup table entries.
1028  *
1029  * This replaces the SHA1 hash fields (which are used to lookup an entry in the
1030  * lookup table) with pointers directly to the lookup table entries.
1031  *
1032  * If @force is %false:
1033  *      If any needed SHA1 message digests are not found in the lookup table,
1034  *      WIMLIB_ERR_RESOURCE_NOT_FOUND is returned and the inode is left
1035  *      unmodified.
1036  * If @force is %true:
1037  *      If any needed SHA1 message digests are not found in the lookup table,
1038  *      new entries are allocated and inserted into the lookup table.
1039  */
1040 int
1041 inode_resolve_ltes(struct wim_inode *inode, struct wim_lookup_table *table,
1042                    bool force)
1043 {
1044         const u8 *hash;
1045
1046         if (!inode->i_resolved) {
1047                 struct wim_lookup_table_entry *lte, *ads_lte;
1048
1049                 /* Resolve the default file stream */
1050                 lte = NULL;
1051                 hash = inode->i_hash;
1052                 if (!is_zero_hash(hash)) {
1053                         lte = __lookup_resource(table, hash);
1054                         if (!lte) {
1055                                 if (force) {
1056                                         lte = new_lookup_table_entry();
1057                                         if (!lte)
1058                                                 return WIMLIB_ERR_NOMEM;
1059                                         copy_hash(lte->hash, hash);
1060                                         lookup_table_insert(table, lte);
1061                                 } else {
1062                                         goto resource_not_found;
1063                                 }
1064                         }
1065                 }
1066
1067                 /* Resolve the alternate data streams */
1068                 struct wim_lookup_table_entry *ads_ltes[inode->i_num_ads];
1069                 for (u16 i = 0; i < inode->i_num_ads; i++) {
1070                         struct wim_ads_entry *cur_entry;
1071
1072                         ads_lte = NULL;
1073                         cur_entry = &inode->i_ads_entries[i];
1074                         hash = cur_entry->hash;
1075                         if (!is_zero_hash(hash)) {
1076                                 ads_lte = __lookup_resource(table, hash);
1077                                 if (!ads_lte) {
1078                                         if (force) {
1079                                                 ads_lte = new_lookup_table_entry();
1080                                                 if (!ads_lte)
1081                                                         return WIMLIB_ERR_NOMEM;
1082                                                 copy_hash(ads_lte->hash, hash);
1083                                                 lookup_table_insert(table, ads_lte);
1084                                         } else {
1085                                                 goto resource_not_found;
1086                                         }
1087                                 }
1088                         }
1089                         ads_ltes[i] = ads_lte;
1090                 }
1091                 inode->i_lte = lte;
1092                 for (u16 i = 0; i < inode->i_num_ads; i++)
1093                         inode->i_ads_entries[i].lte = ads_ltes[i];
1094                 inode->i_resolved = 1;
1095         }
1096         return 0;
1097
1098 resource_not_found:
1099         return resource_not_found_error(inode, hash);
1100 }
1101
1102 void
1103 inode_unresolve_ltes(struct wim_inode *inode)
1104 {
1105         if (inode->i_resolved) {
1106                 if (inode->i_lte)
1107                         copy_hash(inode->i_hash, inode->i_lte->hash);
1108                 else
1109                         zero_out_hash(inode->i_hash);
1110
1111                 for (u16 i = 0; i < inode->i_num_ads; i++) {
1112                         if (inode->i_ads_entries[i].lte)
1113                                 copy_hash(inode->i_ads_entries[i].hash,
1114                                           inode->i_ads_entries[i].lte->hash);
1115                         else
1116                                 zero_out_hash(inode->i_ads_entries[i].hash);
1117                 }
1118                 inode->i_resolved = 0;
1119         }
1120 }
1121
1122 /*
1123  * Returns the lookup table entry for stream @stream_idx of the inode, where
1124  * stream_idx = 0 means the default un-named file stream, and stream_idx >= 1
1125  * corresponds to an alternate data stream.
1126  *
1127  * This works for both resolved and un-resolved inodes.
1128  */
1129 struct wim_lookup_table_entry *
1130 inode_stream_lte(const struct wim_inode *inode, unsigned stream_idx,
1131                  const struct wim_lookup_table *table)
1132 {
1133         if (inode->i_resolved)
1134                 return inode_stream_lte_resolved(inode, stream_idx);
1135         else
1136                 return inode_stream_lte_unresolved(inode, stream_idx, table);
1137 }
1138
1139 struct wim_lookup_table_entry *
1140 inode_unnamed_lte_resolved(const struct wim_inode *inode)
1141 {
1142         wimlib_assert(inode->i_resolved);
1143         for (unsigned i = 0; i <= inode->i_num_ads; i++) {
1144                 if (inode_stream_name_nbytes(inode, i) == 0 &&
1145                     !is_zero_hash(inode_stream_hash_resolved(inode, i)))
1146                 {
1147                         return inode_stream_lte_resolved(inode, i);
1148                 }
1149         }
1150         return NULL;
1151 }
1152
1153 struct wim_lookup_table_entry *
1154 inode_unnamed_lte_unresolved(const struct wim_inode *inode,
1155                              const struct wim_lookup_table *table)
1156 {
1157         wimlib_assert(!inode->i_resolved);
1158         for (unsigned i = 0; i <= inode->i_num_ads; i++) {
1159                 if (inode_stream_name_nbytes(inode, i) == 0 &&
1160                     !is_zero_hash(inode_stream_hash_unresolved(inode, i)))
1161                 {
1162                         return inode_stream_lte_unresolved(inode, i, table);
1163                 }
1164         }
1165         return NULL;
1166 }
1167
1168 /* Return the lookup table entry for the unnamed data stream of an inode, or
1169  * NULL if there is none.
1170  *
1171  * You'd think this would be easier than it actually is, since the unnamed data
1172  * stream should be the one referenced from the inode itself.  Alas, if there
1173  * are named data streams, Microsoft's "imagex.exe" program will put the unnamed
1174  * data stream in one of the alternate data streams instead of inside the WIM
1175  * dentry itself.  So we need to check the alternate data streams too.
1176  *
1177  * Also, note that a dentry may appear to have more than one unnamed stream, but
1178  * if the SHA1 message digest is all 0's then the corresponding stream does not
1179  * really "count" (this is the case for the inode's own file stream when the
1180  * file stream that should be there is actually in one of the alternate stream
1181  * entries.).  This is despite the fact that we may need to extract such a
1182  * missing entry as an empty file or empty named data stream.
1183  */
1184 struct wim_lookup_table_entry *
1185 inode_unnamed_lte(const struct wim_inode *inode,
1186                   const struct wim_lookup_table *table)
1187 {
1188         if (inode->i_resolved)
1189                 return inode_unnamed_lte_resolved(inode);
1190         else
1191                 return inode_unnamed_lte_unresolved(inode, table);
1192 }
1193
1194 static int
1195 lte_add_stream_size(struct wim_lookup_table_entry *lte, void *total_bytes_p)
1196 {
1197         *(u64*)total_bytes_p += lte->resource_entry.size;
1198         return 0;
1199 }
1200
1201 u64
1202 lookup_table_total_stream_size(struct wim_lookup_table *table)
1203 {
1204         u64 total_size = 0;
1205         for_lookup_table_entry(table, lte_add_stream_size, &total_size);
1206         return total_size;
1207 }
1208
1209 struct wim_lookup_table_entry **
1210 retrieve_lte_pointer(struct wim_lookup_table_entry *lte)
1211 {
1212         wimlib_assert(lte->unhashed);
1213         struct wim_inode *inode = lte->back_inode;
1214         u32 stream_id = lte->back_stream_id;
1215         if (stream_id == 0)
1216                 return &inode->i_lte;
1217         else
1218                 for (u16 i = 0; i < inode->i_num_ads; i++)
1219                         if (inode->i_ads_entries[i].stream_id == stream_id)
1220                                 return &inode->i_ads_entries[i].lte;
1221         wimlib_assert(0);
1222         return NULL;
1223 }
1224
1225 /* Calculate the SHA1 message digest of a stream and move it from the list of
1226  * unhashed streams to the stream lookup table, possibly joining it with an
1227  * existing lookup table entry for an identical stream.
1228  *
1229  * @lte:  An unhashed lookup table entry.
1230  * @lookup_table:  Lookup table for the WIM.
1231  * @lte_ret:  On success, write a pointer to the resulting lookup table
1232  *            entry to this location.  This will be the same as @lte
1233  *            if it was inserted into the lookup table, or different if
1234  *            a duplicate stream was found.
1235  *
1236  * Returns 0 on success; nonzero if there is an error reading the stream.
1237  */
1238 int
1239 hash_unhashed_stream(struct wim_lookup_table_entry *lte,
1240                      struct wim_lookup_table *lookup_table,
1241                      struct wim_lookup_table_entry **lte_ret)
1242 {
1243         int ret;
1244         struct wim_lookup_table_entry *duplicate_lte;
1245         struct wim_lookup_table_entry **back_ptr;
1246
1247         wimlib_assert(lte->unhashed);
1248
1249         /* back_ptr must be saved because @back_inode and @back_stream_id are in
1250          * union with the SHA1 message digest and will no longer be valid once
1251          * the SHA1 has been calculated. */
1252         back_ptr = retrieve_lte_pointer(lte);
1253
1254         ret = sha1_resource(lte);
1255         if (ret)
1256                 return ret;
1257
1258         /* Look for a duplicate stream */
1259         duplicate_lte = __lookup_resource(lookup_table, lte->hash);
1260         list_del(&lte->unhashed_list);
1261         if (duplicate_lte) {
1262                 /* We have a duplicate stream.  Transfer the reference counts
1263                  * from this stream to the duplicate, update the reference to
1264                  * this stream (in an inode or ads_entry) to point to the
1265                  * duplicate, then free this stream. */
1266                 wimlib_assert(!(duplicate_lte->unhashed));
1267                 duplicate_lte->refcnt += lte->refcnt;
1268                 duplicate_lte->out_refcnt += lte->refcnt;
1269                 *back_ptr = duplicate_lte;
1270                 free_lookup_table_entry(lte);
1271                 lte = duplicate_lte;
1272         } else {
1273                 /* No duplicate stream, so we need to insert
1274                  * this stream into the lookup table and treat
1275                  * it as a hashed stream. */
1276                 lookup_table_insert(lookup_table, lte);
1277                 lte->unhashed = 0;
1278         }
1279         if (lte_ret)
1280                 *lte_ret = lte;
1281         return 0;
1282 }
1283
1284 static int
1285 move_lte_to_table(struct wim_lookup_table_entry *lte, void *_combined_table)
1286 {
1287         struct wim_lookup_table *combined_table = _combined_table;
1288
1289         hlist_del(&lte->hash_list);
1290         lookup_table_insert(combined_table, lte);
1291         return 0;
1292 }
1293
1294 static void
1295 lookup_table_join(struct wim_lookup_table *combined_table,
1296                   struct wim_lookup_table *part_table)
1297 {
1298         for_lookup_table_entry(part_table, move_lte_to_table, combined_table);
1299         part_table->num_entries = 0;
1300 }
1301
1302 static void
1303 merge_lookup_tables(WIMStruct *wim, WIMStruct **resource_wims,
1304                     unsigned num_resource_wims)
1305 {
1306         for (unsigned i = 0; i < num_resource_wims; i++) {
1307                 lookup_table_join(wim->lookup_table, resource_wims[i]->lookup_table);
1308                 list_add(&resource_wims[i]->resource_wim_node, &wim->resource_wims);
1309                 resource_wims[i]->master_wim = wim;
1310         }
1311 }
1312
1313 static int
1314 move_lte_to_orig_table(struct wim_lookup_table_entry *lte, void *_wim)
1315 {
1316         WIMStruct *wim = _wim;
1317
1318         if (lte->resource_location == RESOURCE_IN_WIM &&
1319             lte->wim->being_unmerged)
1320         {
1321                 move_lte_to_table(lte, lte->wim->lookup_table);
1322                 wim->lookup_table->num_entries--;
1323         }
1324         return 0;
1325 }
1326
1327 static int
1328 check_reference_params(WIMStruct *wim,
1329                        WIMStruct **resource_wims, unsigned num_resource_wims,
1330                        WIMStruct *expected_master)
1331 {
1332         if (wim == NULL)
1333                 return WIMLIB_ERR_INVALID_PARAM;
1334
1335         if (wim->hdr.part_number != 1)
1336                 return WIMLIB_ERR_INVALID_PARAM;
1337
1338         if (num_resource_wims != 0 && resource_wims == NULL)
1339                 return WIMLIB_ERR_INVALID_PARAM;
1340
1341         for (unsigned i = 0; i < num_resource_wims; i++) {
1342                 if (resource_wims[i] == NULL)
1343                         return WIMLIB_ERR_INVALID_PARAM;
1344                 if (resource_wims[i]->master_wim != expected_master)
1345                         return WIMLIB_ERR_INVALID_PARAM;
1346         }
1347         return 0;
1348 }
1349
1350 /* API function documented in wimlib.h  */
1351 WIMLIBAPI int
1352 wimlib_reference_resources(WIMStruct *wim,
1353                            WIMStruct **resource_wims, unsigned num_resource_wims,
1354                            int ref_flags)
1355 {
1356         int ret;
1357
1358         ret = check_reference_params(wim, resource_wims,
1359                                      num_resource_wims, NULL);
1360         if (ret)
1361                 return ret;
1362
1363         merge_lookup_tables(wim, resource_wims, num_resource_wims);
1364         return 0;
1365 }
1366
1367 static int
1368 reference_resource_paths(WIMStruct *wim,
1369                          const tchar * const *resource_wimfiles,
1370                          unsigned num_resource_wimfiles,
1371                          int ref_flags,
1372                          int open_flags,
1373                          wimlib_progress_func_t progress_func)
1374 {
1375         WIMStruct **resource_wims;
1376         unsigned i;
1377         int ret;
1378
1379         open_flags |= WIMLIB_OPEN_FLAG_SPLIT_OK;
1380
1381         resource_wims = CALLOC(num_resource_wimfiles, sizeof(resource_wims[0]));
1382         if (!resource_wims)
1383                 return WIMLIB_ERR_NOMEM;
1384
1385         for (i = 0; i < num_resource_wimfiles; i++) {
1386                 ret = wimlib_open_wim(resource_wimfiles[i], open_flags,
1387                                       &resource_wims[i], progress_func);
1388                 if (ret)
1389                         goto out_free_resource_wims;
1390         }
1391
1392         ret = wimlib_reference_resources(wim, resource_wims,
1393                                          num_resource_wimfiles, ref_flags);
1394         if (ret)
1395                 goto out_free_resource_wims;
1396
1397         for (i = 0; i < num_resource_wimfiles; i++)
1398                 resource_wims[i]->is_owned_by_master = 1;
1399
1400         ret = 0;
1401         goto out_free_array;
1402
1403 out_free_resource_wims:
1404         for (i = 0; i < num_resource_wimfiles; i++)
1405                 wimlib_free(resource_wims[i]);
1406 out_free_array:
1407         FREE(resource_wims);
1408         return ret;
1409 }
1410
1411 static int
1412 reference_resource_glob(WIMStruct *wim, const tchar *refglob,
1413                         int ref_flags, int open_flags,
1414                         wimlib_progress_func_t progress_func)
1415 {
1416         glob_t globbuf;
1417         int ret;
1418
1419         /* Note: glob() is replaced in Windows native builds.  */
1420         ret = tglob(refglob, GLOB_ERR | GLOB_NOSORT, NULL, &globbuf);
1421         if (ret) {
1422                 if (ret == GLOB_NOMATCH) {
1423                         if (ref_flags & WIMLIB_REF_FLAG_GLOB_ERR_ON_NOMATCH) {
1424                                 ERROR("Found no files for glob \"%"TS"\"", refglob);
1425                                 return WIMLIB_ERR_GLOB_HAD_NO_MATCHES;
1426                         } else {
1427                                 return reference_resource_paths(wim,
1428                                                                 &refglob,
1429                                                                 1,
1430                                                                 ref_flags,
1431                                                                 open_flags,
1432                                                                 progress_func);
1433                         }
1434                 } else {
1435                         ERROR_WITH_ERRNO("Failed to process glob \"%"TS"\"", refglob);
1436                         if (ret == GLOB_NOSPACE)
1437                                 return WIMLIB_ERR_NOMEM;
1438                         else
1439                                 return WIMLIB_ERR_READ;
1440                 }
1441         }
1442
1443         ret = reference_resource_paths(wim,
1444                                        (const tchar * const *)globbuf.gl_pathv,
1445                                        globbuf.gl_pathc,
1446                                        ref_flags,
1447                                        open_flags,
1448                                        progress_func);
1449         globfree(&globbuf);
1450         return ret;
1451 }
1452
1453 /* API function documented in wimlib.h  */
1454 WIMLIBAPI int
1455 wimlib_reference_resource_files(WIMStruct *wim,
1456                                 const tchar * const * resource_wimfiles_or_globs,
1457                                 unsigned count,
1458                                 int ref_flags,
1459                                 int open_flags,
1460                                 wimlib_progress_func_t progress_func)
1461 {
1462         unsigned i;
1463         int ret;
1464
1465         if (ref_flags & WIMLIB_REF_FLAG_GLOB_ENABLE) {
1466                 for (i = 0; i < count; i++) {
1467                         ret = reference_resource_glob(wim,
1468                                                       resource_wimfiles_or_globs[i],
1469                                                       ref_flags,
1470                                                       open_flags,
1471                                                       progress_func);
1472                         if (ret)
1473                                 return ret;
1474                 }
1475                 return 0;
1476         } else {
1477                 return reference_resource_paths(wim, resource_wimfiles_or_globs,
1478                                                 count, ref_flags,
1479                                                 open_flags, progress_func);
1480         }
1481 }
1482
1483 /* API function documented in wimlib.h  */
1484 WIMLIBAPI int
1485 wimlib_unreference_resources(WIMStruct *wim,
1486                              WIMStruct **resource_wims, unsigned num_resource_wims)
1487 {
1488         int ret;
1489         unsigned i;
1490
1491         ret = check_reference_params(wim, resource_wims, num_resource_wims, wim);
1492         if (ret)
1493                 return ret;
1494
1495         for (i = 0; i < num_resource_wims; i++)
1496                 resource_wims[i]->being_unmerged = 1;
1497
1498         for_lookup_table_entry(wim->lookup_table, move_lte_to_orig_table, wim);
1499
1500         for (i = 0; i < num_resource_wims; i++) {
1501                 resource_wims[i]->being_unmerged = 0;
1502                 list_del(&resource_wims[i]->resource_wim_node);
1503                 resource_wims[i]->master_wim = NULL;
1504         }
1505         return 0;
1506 }