More code cleanups
[wimlib] / 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.
6  */
7
8 /*
9  * Copyright (C) 2012 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 #include "wimlib_internal.h"
28 #include "lookup_table.h"
29 #include "buffer_io.h"
30 #include <errno.h>
31
32 #ifdef WITH_FUSE
33 #include <unistd.h>
34 #endif
35
36 struct wim_lookup_table *new_lookup_table(size_t capacity)
37 {
38         struct wim_lookup_table *table;
39         struct hlist_head *array;
40
41         table = MALLOC(sizeof(struct wim_lookup_table));
42         if (table) {
43                 array = CALLOC(capacity, sizeof(array[0]));
44                 if (array) {
45                         table->num_entries = 0;
46                         table->capacity = capacity;
47                         table->array = array;
48                 } else {
49                         FREE(table);
50                         table = NULL;
51                         ERROR("Failed to allocate memory for lookup table with capacity %zu",
52                               capacity);
53                 }
54         }
55         return table;
56 }
57
58 struct wim_lookup_table_entry *
59 new_lookup_table_entry()
60 {
61         struct wim_lookup_table_entry *lte;
62
63         lte = CALLOC(1, sizeof(struct wim_lookup_table_entry));
64         if (lte) {
65                 lte->part_number  = 1;
66                 lte->refcnt       = 1;
67         } else {
68                 ERROR("Out of memory (tried to allocate %zu bytes for "
69                       "lookup table entry)",
70                       sizeof(struct wim_lookup_table_entry));
71         }
72         return lte;
73 }
74
75 struct wim_lookup_table_entry *
76 clone_lookup_table_entry(const struct wim_lookup_table_entry *old)
77 {
78         struct wim_lookup_table_entry *new;
79
80         new = MALLOC(sizeof(*new));
81         if (!new)
82                 return NULL;
83
84         memcpy(new, old, sizeof(*old));
85         new->extracted_file = NULL;
86         switch (new->resource_location) {
87         case RESOURCE_IN_STAGING_FILE:
88         case RESOURCE_IN_FILE_ON_DISK:
89                 BUILD_BUG_ON((void*)&old->file_on_disk !=
90                              (void*)&old->staging_file_name);
91                 new->staging_file_name = STRDUP(old->staging_file_name);
92                 if (!new->staging_file_name)
93                         goto out_free;
94                 break;
95         case RESOURCE_IN_ATTACHED_BUFFER:
96                 new->attached_buffer = MALLOC(wim_resource_size(old));
97                 if (!new->attached_buffer)
98                         goto out_free;
99                 memcpy(new->attached_buffer, old->attached_buffer,
100                        wim_resource_size(old));
101                 break;
102 #ifdef WITH_NTFS_3G
103         case RESOURCE_IN_NTFS_VOLUME:
104                 if (old->ntfs_loc) {
105                         struct ntfs_location *loc;
106                         loc = MALLOC(sizeof(*loc));
107                         if (!loc)
108                                 goto out_free;
109                         memcpy(loc, old->ntfs_loc, sizeof(*loc));
110                         loc->path_utf8 = NULL;
111                         loc->stream_name_utf16 = NULL;
112                         new->ntfs_loc = loc;
113                         loc->path_utf8 = STRDUP(old->ntfs_loc->path_utf8);
114                         if (!loc->path_utf8)
115                                 goto out_free;
116                         loc->stream_name_utf16 = MALLOC(loc->stream_name_utf16_num_chars * 2);
117                         if (!loc->stream_name_utf16)
118                                 goto out_free;
119                         memcpy(loc->stream_name_utf16,
120                                old->ntfs_loc->stream_name_utf16,
121                                loc->stream_name_utf16_num_chars * 2);
122                 }
123                 break;
124 #endif
125         default:
126                 break;
127         }
128         return new;
129 out_free:
130         free_lookup_table_entry(new);
131         return NULL;
132 }
133
134 void free_lookup_table_entry(struct wim_lookup_table_entry *lte)
135 {
136         if (lte) {
137                 switch (lte->resource_location) {
138                 case RESOURCE_IN_STAGING_FILE:
139                 case RESOURCE_IN_ATTACHED_BUFFER:
140                 case RESOURCE_IN_FILE_ON_DISK:
141                         BUILD_BUG_ON((void*)&lte->file_on_disk !=
142                                      (void*)&lte->staging_file_name);
143                         BUILD_BUG_ON((void*)&lte->file_on_disk !=
144                                      (void*)&lte->attached_buffer);
145                         FREE(lte->file_on_disk);
146                         break;
147 #ifdef WITH_NTFS_3G
148                 case RESOURCE_IN_NTFS_VOLUME:
149                         if (lte->ntfs_loc) {
150                                 FREE(lte->ntfs_loc->path_utf8);
151                                 FREE(lte->ntfs_loc->stream_name_utf16);
152                                 FREE(lte->ntfs_loc);
153                         }
154                         break;
155 #endif
156                 default:
157                         break;
158                 }
159                 FREE(lte);
160         }
161 }
162
163 static int do_free_lookup_table_entry(struct wim_lookup_table_entry *entry,
164                                       void *ignore)
165 {
166         free_lookup_table_entry(entry);
167         return 0;
168 }
169
170
171 void free_lookup_table(struct wim_lookup_table *table)
172 {
173         DEBUG2("Freeing lookup table");
174         if (table) {
175                 if (table->array) {
176                         for_lookup_table_entry(table,
177                                                do_free_lookup_table_entry,
178                                                NULL);
179                         FREE(table->array);
180                 }
181                 FREE(table);
182         }
183 }
184
185 /*
186  * Inserts an entry into the lookup table.
187  *
188  * @table:      A pointer to the lookup table.
189  * @entry:      A pointer to the entry to insert.
190  */
191 void lookup_table_insert(struct wim_lookup_table *table,
192                          struct wim_lookup_table_entry *lte)
193 {
194         size_t i = lte->hash_short % table->capacity;
195         hlist_add_head(&lte->hash_list, &table->array[i]);
196
197         /* XXX Make the table grow when too many entries have been inserted. */
198         table->num_entries++;
199 }
200
201 static void finalize_lte(struct wim_lookup_table_entry *lte)
202 {
203         #ifdef WITH_FUSE
204         if (lte->resource_location == RESOURCE_IN_STAGING_FILE) {
205                 unlink(lte->staging_file_name);
206                 list_del(&lte->staging_list);
207         }
208         #endif
209         free_lookup_table_entry(lte);
210 }
211
212 /* Decrements the reference count for the lookup table entry @lte.  If its
213  * reference count reaches 0, it is unlinked from the lookup table.  If,
214  * furthermore, the entry has no opened file descriptors associated with it, the
215  * entry is freed.  */
216 void lte_decrement_refcnt(struct wim_lookup_table_entry *lte,
217                           struct wim_lookup_table *table)
218 {
219         wimlib_assert(lte != NULL);
220         wimlib_assert(lte->refcnt != 0);
221         if (--lte->refcnt == 0) {
222                 lookup_table_unlink(table, lte);
223         #ifdef WITH_FUSE
224                 if (lte->num_opened_fds == 0)
225         #endif
226                         finalize_lte(lte);
227         }
228 }
229
230 #ifdef WITH_FUSE
231 void lte_decrement_num_opened_fds(struct wim_lookup_table_entry *lte)
232 {
233         if (lte->num_opened_fds != 0)
234                 if (--lte->num_opened_fds == 0 && lte->refcnt == 0)
235                         finalize_lte(lte);
236 }
237 #endif
238
239 /* Calls a function on all the entries in the WIM lookup table.  Stop early and
240  * return nonzero if any call to the function returns nonzero. */
241 int for_lookup_table_entry(struct wim_lookup_table *table,
242                            int (*visitor)(struct wim_lookup_table_entry *, void *),
243                            void *arg)
244 {
245         struct wim_lookup_table_entry *lte;
246         struct hlist_node *pos, *tmp;
247         int ret;
248
249         for (size_t i = 0; i < table->capacity; i++) {
250                 hlist_for_each_entry_safe(lte, pos, tmp, &table->array[i],
251                                           hash_list)
252                 {
253                         ret = visitor(lte, arg);
254                         if (ret != 0)
255                                 return ret;
256                 }
257         }
258         return 0;
259 }
260
261
262 /*
263  * Reads the lookup table from a WIM file.
264  */
265 int read_lookup_table(WIMStruct *w)
266 {
267         u64 num_entries;
268         u8 buf[WIM_LOOKUP_TABLE_ENTRY_DISK_SIZE];
269         int ret;
270         struct wim_lookup_table *table;
271         struct wim_lookup_table_entry *cur_entry = NULL, *duplicate_entry;
272
273         if (resource_is_compressed(&w->hdr.lookup_table_res_entry)) {
274                 ERROR("Didn't expect a compressed lookup table!");
275                 ERROR("Ask the author to implement support for this.");
276                 return WIMLIB_ERR_COMPRESSED_LOOKUP_TABLE;
277         }
278
279         DEBUG("Reading lookup table: offset %"PRIu64", size %"PRIu64"",
280               w->hdr.lookup_table_res_entry.offset,
281               w->hdr.lookup_table_res_entry.original_size);
282
283         if (fseeko(w->fp, w->hdr.lookup_table_res_entry.offset, SEEK_SET) != 0)
284         {
285                 ERROR_WITH_ERRNO("Failed to seek to byte %"PRIu64" to read "
286                                  "lookup table",
287                                  w->hdr.lookup_table_res_entry.offset);
288                 return WIMLIB_ERR_READ;
289         }
290
291         num_entries = w->hdr.lookup_table_res_entry.original_size /
292                       WIM_LOOKUP_TABLE_ENTRY_DISK_SIZE;
293         table = new_lookup_table(num_entries * 2 + 1);
294         if (!table)
295                 return WIMLIB_ERR_NOMEM;
296
297         while (num_entries--) {
298                 const u8 *p;
299
300                 if (fread(buf, 1, sizeof(buf), w->fp) != sizeof(buf)) {
301                         if (feof(w->fp)) {
302                                 ERROR("Unexpected EOF in WIM lookup table!");
303                         } else {
304                                 ERROR_WITH_ERRNO("Error reading WIM lookup "
305                                                  "table");
306                         }
307                         ret = WIMLIB_ERR_READ;
308                         goto out;
309                 }
310                 cur_entry = new_lookup_table_entry();
311                 if (!cur_entry) {
312                         ret = WIMLIB_ERR_NOMEM;
313                         goto out;
314                 }
315                 cur_entry->wim = w;
316                 cur_entry->resource_location = RESOURCE_IN_WIM;
317
318                 p = get_resource_entry(buf, &cur_entry->resource_entry);
319                 p = get_u16(p, &cur_entry->part_number);
320                 p = get_u32(p, &cur_entry->refcnt);
321                 p = get_bytes(p, SHA1_HASH_SIZE, cur_entry->hash);
322
323                 if (cur_entry->part_number != w->hdr.part_number) {
324                         ERROR("A lookup table entry in part %hu of the WIM "
325                               "points to part %hu",
326                               w->hdr.part_number, cur_entry->part_number);
327                         ret = WIMLIB_ERR_INVALID_LOOKUP_TABLE_ENTRY;
328                         goto out_free_cur_entry;
329                 }
330
331                 if (is_zero_hash(cur_entry->hash)) {
332                         ERROR("The WIM lookup table contains an entry with a "
333                               "SHA1 message digest of all 0's");
334                         ret = WIMLIB_ERR_INVALID_LOOKUP_TABLE_ENTRY;
335                         goto out_free_cur_entry;
336                 }
337
338                 /* Ordinarily, no two streams should share the same SHA1 message
339                  * digest.  However, this constraint can be broken for metadata
340                  * resources--- two identical images will have the same metadata
341                  * resource, but their lookup table entries are not shared. */
342                 duplicate_entry = __lookup_resource(table, cur_entry->hash);
343                 if (duplicate_entry
344                     && !((duplicate_entry->resource_entry.flags & WIM_RESHDR_FLAG_METADATA)
345                           && cur_entry->resource_entry.flags & WIM_RESHDR_FLAG_METADATA))
346                 {
347                         ERROR("The WIM lookup table contains two entries with the "
348                               "same SHA1 message digest!");
349                         ERROR("The first entry is:");
350                         print_lookup_table_entry(duplicate_entry);
351                         ERROR("The second entry is:");
352                         print_lookup_table_entry(cur_entry);
353                         ret = WIMLIB_ERR_INVALID_LOOKUP_TABLE_ENTRY;
354                         goto out_free_cur_entry;
355                 }
356
357                 if (!(cur_entry->resource_entry.flags & WIM_RESHDR_FLAG_COMPRESSED)
358                     && (cur_entry->resource_entry.size !=
359                         cur_entry->resource_entry.original_size))
360                 {
361                         ERROR("Found uncompressed resource with original size "
362                               "not the same as compressed size");
363                         ERROR("The lookup table entry for the resource is as follows:");
364                         print_lookup_table_entry(cur_entry);
365                         ret = WIMLIB_ERR_INVALID_LOOKUP_TABLE_ENTRY;
366                         goto out_free_cur_entry;
367                 }
368                 if ((cur_entry->resource_entry.flags & WIM_RESHDR_FLAG_METADATA)
369                     && cur_entry->refcnt != 1)
370                 {
371                         ERROR("Found metadata resource with refcnt != 1:");
372                         print_lookup_table_entry(cur_entry);
373                         ret = WIMLIB_ERR_INVALID_LOOKUP_TABLE_ENTRY;
374                         goto out_free_cur_entry;
375                 }
376                 lookup_table_insert(table, cur_entry);
377
378         }
379         DEBUG("Done reading lookup table.");
380         w->lookup_table = table;
381         return 0;
382 out_free_cur_entry:
383         FREE(cur_entry);
384 out:
385         free_lookup_table(table);
386         return ret;
387 }
388
389
390 /*
391  * Writes a lookup table entry to the output file.
392  */
393 int write_lookup_table_entry(struct wim_lookup_table_entry *lte, void *__out)
394 {
395         FILE *out;
396         u8 buf[WIM_LOOKUP_TABLE_ENTRY_DISK_SIZE];
397         u8 *p;
398
399         out = __out;
400
401         /* Don't write entries that have not had file resources or metadata
402          * resources written for them. */
403         if (lte->out_refcnt == 0)
404                 return 0;
405
406         if (lte->output_resource_entry.flags & WIM_RESHDR_FLAG_METADATA)
407                 DEBUG("Writing metadata entry at %lu (orig size = %zu)",
408                       ftello(out), lte->output_resource_entry.original_size);
409
410         p = put_resource_entry(buf, &lte->output_resource_entry);
411         p = put_u16(p, lte->part_number);
412         p = put_u32(p, lte->out_refcnt);
413         p = put_bytes(p, SHA1_HASH_SIZE, lte->hash);
414         if (fwrite(buf, 1, sizeof(buf), out) != sizeof(buf)) {
415                 ERROR_WITH_ERRNO("Failed to write lookup table entry");
416                 return WIMLIB_ERR_WRITE;
417         }
418         return 0;
419 }
420
421 /* Writes the lookup table to the output file. */
422 int write_lookup_table(struct wim_lookup_table *table, FILE *out,
423                        struct resource_entry *out_res_entry)
424 {
425         off_t start_offset, end_offset;
426         int ret;
427
428         start_offset = ftello(out);
429         if (start_offset == -1)
430                 return WIMLIB_ERR_WRITE;
431
432         ret = for_lookup_table_entry(table, write_lookup_table_entry, out);
433         if (ret != 0)
434                 return ret;
435
436         end_offset = ftello(out);
437         if (end_offset == -1)
438                 return WIMLIB_ERR_WRITE;
439
440         out_res_entry->offset        = start_offset;
441         out_res_entry->size          = end_offset - start_offset;
442         out_res_entry->original_size = end_offset - start_offset;
443         out_res_entry->flags         = WIM_RESHDR_FLAG_METADATA;
444
445         return 0;
446 }
447
448
449 int lte_zero_real_refcnt(struct wim_lookup_table_entry *lte, void *ignore)
450 {
451         lte->real_refcnt = 0;
452         return 0;
453 }
454
455 int lte_zero_out_refcnt(struct wim_lookup_table_entry *lte, void *ignore)
456 {
457         lte->out_refcnt = 0;
458         return 0;
459 }
460
461 int lte_free_extracted_file(struct wim_lookup_table_entry *lte, void *ignore)
462 {
463         if (lte->extracted_file != NULL) {
464                 FREE(lte->extracted_file);
465                 lte->extracted_file = NULL;
466         }
467         return 0;
468 }
469
470 void print_lookup_table_entry(const struct wim_lookup_table_entry *lte)
471 {
472         if (!lte) {
473                 putchar('\n');
474                 return;
475         }
476         printf("Offset            = %"PRIu64" bytes\n",
477                lte->resource_entry.offset);
478         printf("Size              = %"PRIu64" bytes\n",
479                (u64)lte->resource_entry.size);
480         printf("Original size     = %"PRIu64" bytes\n",
481                lte->resource_entry.original_size);
482         printf("Part Number       = %hu\n", lte->part_number);
483         printf("Reference Count   = %u\n", lte->refcnt);
484         printf("Hash              = 0x");
485         print_hash(lte->hash);
486         putchar('\n');
487         printf("Flags             = ");
488         u8 flags = lte->resource_entry.flags;
489         if (flags & WIM_RESHDR_FLAG_COMPRESSED)
490                 fputs("WIM_RESHDR_FLAG_COMPRESSED, ", stdout);
491         if (flags & WIM_RESHDR_FLAG_FREE)
492                 fputs("WIM_RESHDR_FLAG_FREE, ", stdout);
493         if (flags & WIM_RESHDR_FLAG_METADATA)
494                 fputs("WIM_RESHDR_FLAG_METADATA, ", stdout);
495         if (flags & WIM_RESHDR_FLAG_SPANNED)
496                 fputs("WIM_RESHDR_FLAG_SPANNED, ", stdout);
497         putchar('\n');
498         switch (lte->resource_location) {
499         case RESOURCE_IN_WIM:
500                 if (lte->wim->filename) {
501                         printf("WIM file          = `%s'\n",
502                                lte->wim->filename);
503                 }
504                 break;
505         case RESOURCE_IN_FILE_ON_DISK:
506                 printf("File on Disk      = `%s'\n", lte->file_on_disk);
507                 break;
508         case RESOURCE_IN_STAGING_FILE:
509                 printf("Staging File      = `%s'\n", lte->staging_file_name);
510                 break;
511         default:
512                 break;
513         }
514         putchar('\n');
515 }
516
517 static int do_print_lookup_table_entry(struct wim_lookup_table_entry *lte,
518                                        void *ignore)
519 {
520         print_lookup_table_entry(lte);
521         return 0;
522 }
523
524 /*
525  * Prints the lookup table of a WIM file.
526  */
527 WIMLIBAPI void wimlib_print_lookup_table(WIMStruct *w)
528 {
529         for_lookup_table_entry(w->lookup_table,
530                                do_print_lookup_table_entry,
531                                NULL);
532 }
533
534 /* Given a SHA1 message digest, return the corresponding entry in the WIM's
535  * lookup table, or NULL if there is none.  */
536 struct wim_lookup_table_entry *
537 __lookup_resource(const struct wim_lookup_table *table, const u8 hash[])
538 {
539         size_t i;
540         struct wim_lookup_table_entry *lte;
541         struct hlist_node *pos;
542
543         wimlib_assert(table != NULL);
544         wimlib_assert(hash != NULL);
545
546         i = *(size_t*)hash % table->capacity;
547         hlist_for_each_entry(lte, pos, &table->array[i], hash_list)
548                 if (hashes_equal(hash, lte->hash))
549                         return lte;
550         return NULL;
551 }
552
553 #ifdef WITH_FUSE
554 /*
555  * Finds the dentry, lookup table entry, and stream index for a WIM file stream,
556  * given a path name.
557  *
558  * This is only for pre-resolved inodes.
559  */
560 int lookup_resource(WIMStruct *w, const char *path,
561                     int lookup_flags,
562                     struct wim_dentry **dentry_ret,
563                     struct wim_lookup_table_entry **lte_ret,
564                     u16 *stream_idx_ret)
565 {
566         struct wim_dentry *dentry;
567         struct wim_lookup_table_entry *lte;
568         u16 stream_idx;
569         const char *stream_name = NULL;
570         struct wim_inode *inode;
571         char *p = NULL;
572
573         if (lookup_flags & LOOKUP_FLAG_ADS_OK) {
574                 stream_name = path_stream_name(path);
575                 if (stream_name) {
576                         p = (char*)stream_name - 1;
577                         *p = '\0';
578                 }
579         }
580
581         dentry = get_dentry(w, path);
582         if (p)
583                 *p = ':';
584         if (!dentry)
585                 return -ENOENT;
586
587         inode = dentry->d_inode;
588
589         wimlib_assert(inode->i_resolved);
590
591         if (!(lookup_flags & LOOKUP_FLAG_DIRECTORY_OK)
592               && inode_is_directory(inode))
593                 return -EISDIR;
594
595         if (stream_name) {
596                 struct wim_ads_entry *ads_entry;
597                 u16 ads_idx;
598                 ads_entry = inode_get_ads_entry(inode, stream_name,
599                                                 &ads_idx);
600                 if (ads_entry) {
601                         stream_idx = ads_idx + 1;
602                         lte = ads_entry->lte;
603                         goto out;
604                 } else {
605                         return -ENOENT;
606                 }
607         } else {
608                 lte = inode->i_lte;
609                 stream_idx = 0;
610         }
611 out:
612         if (dentry_ret)
613                 *dentry_ret = dentry;
614         if (lte_ret)
615                 *lte_ret = lte;
616         if (stream_idx_ret)
617                 *stream_idx_ret = stream_idx;
618         return 0;
619 }
620 #endif
621
622 /* Resolve an inode's lookup table entries
623  *
624  * This replaces the SHA1 hash fields (which are used to lookup an entry in the
625  * lookup table) with pointers directly to the lookup table entries.  A circular
626  * linked list of streams sharing the same lookup table entry is created.
627  *
628  * This function always succeeds; unresolved lookup table entries are given a
629  * NULL pointer.
630  */
631 void inode_resolve_ltes(struct wim_inode *inode, struct wim_lookup_table *table)
632 {
633
634         if (!inode->i_resolved) {
635                 struct wim_lookup_table_entry *lte;
636                 /* Resolve the default file stream */
637                 lte = __lookup_resource(table, inode->i_hash);
638                 inode->i_lte = lte;
639                 inode->i_resolved = 1;
640
641                 /* Resolve the alternate data streams */
642                 for (u16 i = 0; i < inode->i_num_ads; i++) {
643                         struct wim_ads_entry *cur_entry = &inode->i_ads_entries[i];
644                         lte = __lookup_resource(table, cur_entry->hash);
645                         cur_entry->lte = lte;
646                 }
647         }
648 }
649
650 void inode_unresolve_ltes(struct wim_inode *inode)
651 {
652         if (inode->i_resolved) {
653                 if (inode->i_lte)
654                         copy_hash(inode->i_hash, inode->i_lte->hash);
655                 else
656                         zero_out_hash(inode->i_hash);
657
658                 for (u16 i = 0; i < inode->i_num_ads; i++) {
659                         if (inode->i_ads_entries[i].lte)
660                                 copy_hash(inode->i_ads_entries[i].hash,
661                                           inode->i_ads_entries[i].lte->hash);
662                         else
663                                 zero_out_hash(inode->i_ads_entries[i].hash);
664                 }
665                 inode->i_resolved = 0;
666         }
667 }
668
669 /*
670  * Returns the lookup table entry for stream @stream_idx of the inode, where
671  * stream_idx = 0 means the default un-named file stream, and stream_idx >= 1
672  * corresponds to an alternate data stream.
673  *
674  * This works for both resolved and un-resolved dentries.
675  */
676 struct wim_lookup_table_entry *
677 inode_stream_lte(const struct wim_inode *inode, unsigned stream_idx,
678                  const struct wim_lookup_table *table)
679 {
680         if (inode->i_resolved)
681                 return inode_stream_lte_resolved(inode, stream_idx);
682         else
683                 return inode_stream_lte_unresolved(inode, stream_idx, table);
684 }
685
686
687 /* Return the lookup table entry for the unnamed data stream of an inode, or
688  * NULL if there is none.
689  *
690  * You'd think this would be easier than it actually is, since the unnamed data
691  * stream should be the one referenced from the inode itself.  Alas, if there
692  * are named data streams, Microsoft's "imagex.exe" program will put the unnamed
693  * data stream in one of the alternate data streams instead of inside the WIM
694  * dentry itself.  So we need to check the alternate data streams too.
695  *
696  * Also, note that a dentry may appear to have more than one unnamed stream, but
697  * if the SHA1 message digest is all 0's then the corresponding stream does not
698  * really "count" (this is the case for the inode's own file stream when the
699  * file stream that should be there is actually in one of the alternate stream
700  * entries.).  This is despite the fact that we may need to extract such a
701  * missing entry as an empty file or empty named data stream.
702  */
703 struct wim_lookup_table_entry *
704 inode_unnamed_lte(const struct wim_inode *inode,
705                   const struct wim_lookup_table *table)
706 {
707         if (inode->i_resolved)
708                 return inode_unnamed_lte_resolved(inode);
709         else
710                 return inode_unnamed_lte_unresolved(inode, table);
711 }
712
713 static int lte_add_stream_size(struct wim_lookup_table_entry *lte,
714                                void *total_bytes_p)
715 {
716         *(u64*)total_bytes_p += lte->resource_entry.size;
717         return 0;
718 }
719
720 u64 lookup_table_total_stream_size(struct wim_lookup_table *table)
721 {
722         u64 total_size = 0;
723         for_lookup_table_entry(table, lte_add_stream_size, &total_size);
724         return total_size;
725 }