]> wimlib.net Git - wimlib/blob - src/join.c
Update char encoding docs
[wimlib] / src / join.c
1 /*
2  * join.c
3  *
4  * Join split WIMs (sometimes named as .swm files) together into one WIM.
5  */
6
7 /*
8  * Copyright (C) 2012, 2013 Eric Biggers
9  *
10  * This file is part of wimlib, a library for working with WIM files.
11  *
12  * wimlib is free software; you can redistribute it and/or modify it under the
13  * terms of the GNU General Public License as published by the Free
14  * Software Foundation; either version 3 of the License, or (at your option)
15  * any later version.
16  *
17  * wimlib is distributed in the hope that it will be useful, but WITHOUT ANY
18  * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
19  * A PARTICULAR PURPOSE. See the GNU General Public License for more
20  * details.
21  *
22  * You should have received a copy of the GNU General Public License
23  * along with wimlib; if not, see http://www.gnu.org/licenses/.
24  */
25
26 #include "wimlib_internal.h"
27 #include "lookup_table.h"
28 #include "xml.h"
29 #include <stdlib.h>
30
31 static int
32 move_lte_to_table(struct wim_lookup_table_entry *lte, void *other_tab)
33 {
34         hlist_del(&lte->hash_list);
35         lookup_table_insert((struct wim_lookup_table*)other_tab, lte);
36         return 0;
37 }
38
39 static int
40 lookup_table_join(struct wim_lookup_table *table,
41                   struct wim_lookup_table *new)
42 {
43         return for_lookup_table_entry(new, move_lte_to_table, table);
44 }
45
46 /*
47  * new_joined_lookup_table: - Join lookup tables from the parts of a split WIM.
48  *
49  * @w specifies the first part, while @additional_swms and @num_additional_swms
50  * specify an array of pointers to the WIMStruct's for additional split WIM parts.
51  *
52  * The lookup table entries are *moved* to the new table.
53  *
54  * On success, 0 is returned on a pointer to the joined lookup table is returned
55  * in @table_ret.
56  *
57  * The reason we join the lookup tables is so we only have to search one lookup
58  * table to find the location of a resource in the entire WIM.
59  */
60 int
61 new_joined_lookup_table(WIMStruct *w,
62                         WIMStruct **additional_swms,
63                         unsigned num_additional_swms,
64                         struct wim_lookup_table **table_ret)
65 {
66         struct wim_lookup_table *table;
67         int ret;
68         unsigned i;
69
70         table = new_lookup_table(9001);
71         if (!table)
72                 return WIMLIB_ERR_NOMEM;
73
74         if (w)
75                 lookup_table_join(table, w->lookup_table);
76
77         for (i = 0; i < num_additional_swms; i++) {
78                 ret = lookup_table_join(table, additional_swms[i]->lookup_table);
79                 if (ret != 0)
80                         goto out_free_table;
81         }
82         *table_ret = table;
83         return 0;
84 out_free_table:
85         free_lookup_table(table);
86         return ret;
87 }
88
89
90 static int
91 join_wims(WIMStruct **swms, unsigned num_swms,
92           WIMStruct *joined_wim, int write_flags,
93           wimlib_progress_func_t progress_func)
94 {
95         int ret;
96         unsigned i;
97         union wimlib_progress_info progress;
98         u64 total_bytes = 0;
99         u64 part_bytes;
100         u64 swm_part_sizes[num_swms];
101
102         /* Calculate total size of the streams in the split WIM parts. */
103         for (i = 0; i < num_swms; i++) {
104                 part_bytes = lookup_table_total_stream_size(swms[i]->lookup_table);
105                 swm_part_sizes[i] = part_bytes;
106                 total_bytes += part_bytes;
107         }
108
109         if (progress_func) {
110                 progress.join.total_bytes        = total_bytes;
111                 progress.join.total_parts        = swms[0]->hdr.total_parts;
112                 progress.join.completed_bytes    = 0;
113                 progress.join.completed_parts    = 0;
114                 progress_func(WIMLIB_PROGRESS_MSG_JOIN_STREAMS, &progress);
115         }
116
117         /* Write the resources (streams and metadata resources) from each SWM
118          * part */
119         swms[0]->write_metadata = true;
120         for (i = 0; i < num_swms; i++) {
121                 swms[i]->fp = tfopen(swms[i]->filename, T("rb"));
122                 if (!swms[i]->fp) {
123                         ERROR_WITH_ERRNO("Failed to reopen `%"TS"'",
124                                          swms[i]->filename);
125                         return WIMLIB_ERR_OPEN;
126                 }
127                 swms[i]->out_fp = joined_wim->out_fp;
128                 swms[i]->hdr.part_number = 1;
129                 ret = for_lookup_table_entry(swms[i]->lookup_table,
130                                              copy_resource, swms[i]);
131                 swms[i]->out_fp = NULL;
132                 fclose(swms[i]->fp);
133                 swms[i]->fp = NULL;
134
135                 if (ret != 0)
136                         return ret;
137
138                 if (progress_func) {
139                         progress.join.completed_bytes += swm_part_sizes[i];
140                         progress.join.completed_parts++;
141                         progress_func(WIMLIB_PROGRESS_MSG_JOIN_STREAMS, &progress);
142                 }
143         }
144
145         joined_wim->hdr.image_count = swms[0]->hdr.image_count;
146         for (i = 0; i < num_swms; i++)
147                 lookup_table_join(joined_wim->lookup_table, swms[i]->lookup_table);
148
149         free_wim_info(joined_wim->wim_info);
150         joined_wim->wim_info = swms[0]->wim_info;
151         ret = finish_write(joined_wim, WIMLIB_ALL_IMAGES, write_flags, progress_func);
152         joined_wim->wim_info = NULL;
153         return ret;
154 }
155
156 static int
157 cmp_swms_by_part_number(const void *swm1, const void *swm2)
158 {
159         u16 partno_1 = (*(const WIMStruct**)swm1)->hdr.part_number;
160         u16 partno_2 = (*(const WIMStruct**)swm2)->hdr.part_number;
161         return (int)partno_1 - (int)partno_2;
162 }
163
164 /*
165  * Join a set of split WIMs into a stand-alone WIM.
166  */
167 WIMLIBAPI int
168 wimlib_join(const tchar * const *swm_names,
169             unsigned num_swms,
170             const tchar *output_path,
171             int swm_open_flags,
172             int wim_write_flags,
173             wimlib_progress_func_t progress_func)
174 {
175         int ret;
176         WIMStruct *joined_wim = NULL;
177         unsigned i;
178
179         swm_open_flags |= WIMLIB_OPEN_FLAG_SPLIT_OK;
180         wim_write_flags &= WIMLIB_WRITE_MASK_PUBLIC;
181
182         if (num_swms < 1 || num_swms > 0xffff)
183                 return WIMLIB_ERR_INVALID_PARAM;
184
185         WIMStruct *swms[num_swms];
186         ZERO_ARRAY(swms);
187
188         for (i = 0; i < num_swms; i++) {
189                 ret = wimlib_open_wim(swm_names[i], swm_open_flags, &swms[i],
190                                       progress_func);
191                 if (ret != 0)
192                         goto out;
193
194                 /* Don't open all the parts at the same time, in case there are
195                  * a lot of them */
196                 fclose(swms[i]->fp);
197                 swms[i]->fp = NULL;
198         }
199
200         qsort(swms, num_swms, sizeof(swms[0]), cmp_swms_by_part_number);
201
202         ret = verify_swm_set(swms[0], &swms[1], num_swms - 1);
203         if (ret != 0)
204                 goto out;
205
206         ret = wimlib_create_new_wim(wimlib_get_compression_type(swms[0]),
207                                     &joined_wim);
208         if (ret != 0)
209                 goto out;
210
211         ret = begin_write(joined_wim, output_path, wim_write_flags);
212         if (ret != 0)
213                 goto out;
214         ret = join_wims(swms, num_swms, joined_wim, wim_write_flags,
215                         progress_func);
216 out:
217         for (i = 0; i < num_swms; i++)
218                 wimlib_free(swms[i]);
219         wimlib_free(joined_wim);
220         return ret;
221 }