]>
Commit | Line | Data |
---|---|---|
b2e465d6 AL |
1 | // -*- mode: cpp; mode: fold -*- |
2 | // Description /*{{{*/ | |
dc738e7a | 3 | // $Id: multicompress.cc,v 1.4 2003/02/10 07:34:41 doogie Exp $ |
b2e465d6 AL |
4 | /* ###################################################################### |
5 | ||
6 | MultiCompressor | |
7 | ||
8 | This class is very complicated in order to optimize for the common | |
9 | case of its use, writing a large set of compressed files that are | |
10 | different from the old set. It spawns off compressors in parallel | |
11 | to maximize compression throughput and has a separate task managing | |
12 | the data going into the compressors. | |
13 | ||
14 | ##################################################################### */ | |
15 | /*}}}*/ | |
16 | // Include Files /*{{{*/ | |
ea542140 DK |
17 | #include <config.h> |
18 | ||
699b209e | 19 | #include <apt-pkg/fileutl.h> |
b2e465d6 AL |
20 | #include <apt-pkg/strutl.h> |
21 | #include <apt-pkg/error.h> | |
22 | #include <apt-pkg/md5.h> | |
ea542140 | 23 | |
b2e465d6 AL |
24 | #include <sys/types.h> |
25 | #include <sys/stat.h> | |
26 | #include <utime.h> | |
27 | #include <unistd.h> | |
ea542140 DK |
28 | #include <iostream> |
29 | ||
30 | #include "multicompress.h" | |
31 | #include <apti18n.h> | |
b2e465d6 AL |
32 | /*}}}*/ |
33 | ||
812f4169 AL |
34 | using namespace std; |
35 | ||
b2e465d6 AL |
36 | |
37 | // MultiCompress::MultiCompress - Constructor /*{{{*/ | |
38 | // --------------------------------------------------------------------- | |
39 | /* Setup the file outputs, compression modes and fork the writer child */ | |
9209ec47 DK |
40 | MultiCompress::MultiCompress(string const &Output,string const &Compress, |
41 | mode_t const &Permissions,bool const &Write) : | |
42 | Permissions(Permissions) | |
b2e465d6 AL |
43 | { |
44 | Outputs = 0; | |
45 | Outputter = -1; | |
46 | Input = 0; | |
47 | UpdateMTime = 0; | |
03bef784 | 48 | |
b2e465d6 AL |
49 | /* Parse the compression string, a space separated lists of compresison |
50 | types */ | |
51 | string::const_iterator I = Compress.begin(); | |
52 | for (; I != Compress.end();) | |
53 | { | |
f7f0d6c7 | 54 | for (; I != Compress.end() && isspace(*I); ++I); |
b2e465d6 AL |
55 | |
56 | // Grab a word | |
57 | string::const_iterator Start = I; | |
f7f0d6c7 | 58 | for (; I != Compress.end() && !isspace(*I); ++I); |
b2e465d6 AL |
59 | |
60 | // Find the matching compressor | |
03bef784 DK |
61 | std::vector<APT::Configuration::Compressor> Compressors = APT::Configuration::getCompressors(); |
62 | std::vector<APT::Configuration::Compressor>::const_iterator Comp = Compressors.begin(); | |
63 | for (; Comp != Compressors.end(); ++Comp) | |
64 | if (stringcmp(Start,I,Comp->Name.c_str()) == 0) | |
b2e465d6 AL |
65 | break; |
66 | ||
67 | // Hmm.. unknown. | |
03bef784 | 68 | if (Comp == Compressors.end()) |
b2e465d6 | 69 | { |
db0db9fe | 70 | _error->Warning(_("Unknown compression algorithm '%s'"),string(Start,I).c_str()); |
b2e465d6 AL |
71 | continue; |
72 | } | |
73 | ||
74 | // Create and link in a new output | |
75 | Files *NewOut = new Files; | |
76 | NewOut->Next = Outputs; | |
77 | Outputs = NewOut; | |
03bef784 | 78 | NewOut->CompressProg = *Comp; |
b2e465d6 AL |
79 | NewOut->Output = Output+Comp->Extension; |
80 | ||
81 | struct stat St; | |
82 | if (stat(NewOut->Output.c_str(),&St) == 0) | |
83 | NewOut->OldMTime = St.st_mtime; | |
84 | else | |
85 | NewOut->OldMTime = 0; | |
86 | } | |
87 | ||
88 | if (Write == false) | |
89 | return; | |
90 | ||
91 | /* Open all the temp files now so we can report any errors. File is | |
92 | made unreable to prevent people from touching it during creating. */ | |
93 | for (Files *I = Outputs; I != 0; I = I->Next) | |
52b47296 | 94 | I->TmpFile.Open(I->Output + ".new", FileFd::WriteOnly | FileFd::Create | FileFd::Empty, FileFd::Extension, 0600); |
b2e465d6 AL |
95 | if (_error->PendingError() == true) |
96 | return; | |
97 | ||
98 | if (Outputs == 0) | |
99 | { | |
dc738e7a | 100 | _error->Error(_("Compressed output %s needs a compression set"),Output.c_str()); |
b2e465d6 AL |
101 | return; |
102 | } | |
103 | ||
104 | Start(); | |
105 | } | |
106 | /*}}}*/ | |
107 | // MultiCompress::~MultiCompress - Destructor /*{{{*/ | |
108 | // --------------------------------------------------------------------- | |
109 | /* Just erase the file linked list. */ | |
110 | MultiCompress::~MultiCompress() | |
111 | { | |
112 | Die(); | |
113 | ||
114 | for (; Outputs != 0;) | |
115 | { | |
116 | Files *Tmp = Outputs->Next; | |
117 | delete Outputs; | |
118 | Outputs = Tmp; | |
119 | } | |
120 | } | |
121 | /*}}}*/ | |
122 | // MultiCompress::GetStat - Get stat information for compressed files /*{{{*/ | |
123 | // --------------------------------------------------------------------- | |
124 | /* This checks each compressed file to make sure it exists and returns | |
125 | stat information for a random file from the collection. False means | |
126 | one or more of the files is missing. */ | |
9209ec47 | 127 | bool MultiCompress::GetStat(string const &Output,string const &Compress,struct stat &St) |
b2e465d6 AL |
128 | { |
129 | /* Parse the compression string, a space separated lists of compresison | |
130 | types */ | |
131 | string::const_iterator I = Compress.begin(); | |
132 | bool DidStat = false; | |
133 | for (; I != Compress.end();) | |
134 | { | |
f7f0d6c7 | 135 | for (; I != Compress.end() && isspace(*I); ++I); |
b2e465d6 AL |
136 | |
137 | // Grab a word | |
138 | string::const_iterator Start = I; | |
f7f0d6c7 | 139 | for (; I != Compress.end() && !isspace(*I); ++I); |
b2e465d6 AL |
140 | |
141 | // Find the matching compressor | |
03bef784 DK |
142 | std::vector<APT::Configuration::Compressor> Compressors = APT::Configuration::getCompressors(); |
143 | std::vector<APT::Configuration::Compressor>::const_iterator Comp = Compressors.begin(); | |
144 | for (; Comp != Compressors.end(); ++Comp) | |
145 | if (stringcmp(Start,I,Comp->Name.c_str()) == 0) | |
b2e465d6 AL |
146 | break; |
147 | ||
148 | // Hmm.. unknown. | |
03bef784 | 149 | if (Comp == Compressors.end()) |
b2e465d6 AL |
150 | continue; |
151 | ||
152 | string Name = Output+Comp->Extension; | |
153 | if (stat(Name.c_str(),&St) != 0) | |
154 | return false; | |
155 | DidStat = true; | |
156 | } | |
157 | return DidStat; | |
158 | } | |
159 | /*}}}*/ | |
160 | // MultiCompress::Start - Start up the writer child /*{{{*/ | |
161 | // --------------------------------------------------------------------- | |
162 | /* Fork a child and setup the communication pipe. */ | |
163 | bool MultiCompress::Start() | |
164 | { | |
165 | // Create a data pipe | |
166 | int Pipe[2] = {-1,-1}; | |
167 | if (pipe(Pipe) != 0) | |
dc738e7a | 168 | return _error->Errno("pipe",_("Failed to create IPC pipe to subprocess")); |
b2e465d6 AL |
169 | for (int I = 0; I != 2; I++) |
170 | SetCloseExec(Pipe[I],true); | |
171 | ||
172 | // The child.. | |
173 | Outputter = fork(); | |
174 | if (Outputter == 0) | |
175 | { | |
176 | close(Pipe[1]); | |
177 | Child(Pipe[0]); | |
178 | if (_error->PendingError() == true) | |
179 | { | |
180 | _error->DumpErrors(); | |
181 | _exit(100); | |
182 | } | |
183 | _exit(0); | |
184 | }; | |
185 | ||
b2e465d6 AL |
186 | close(Pipe[0]); |
187 | Input = fdopen(Pipe[1],"w"); | |
188 | if (Input == 0) | |
dc738e7a | 189 | return _error->Errno("fdopen",_("Failed to create FILE*")); |
b2e465d6 AL |
190 | |
191 | if (Outputter == -1) | |
dc738e7a | 192 | return _error->Errno("fork",_("Failed to fork")); |
b2e465d6 AL |
193 | return true; |
194 | } | |
195 | /*}}}*/ | |
196 | // MultiCompress::Die - Clean up the writer /*{{{*/ | |
197 | // --------------------------------------------------------------------- | |
198 | /* */ | |
199 | bool MultiCompress::Die() | |
200 | { | |
201 | if (Input == 0) | |
202 | return true; | |
203 | ||
204 | fclose(Input); | |
205 | Input = 0; | |
db0db9fe | 206 | bool Res = ExecWait(Outputter,_("Compress child"),false); |
b2e465d6 AL |
207 | Outputter = -1; |
208 | return Res; | |
209 | } | |
210 | /*}}}*/ | |
211 | // MultiCompress::Finalize - Finish up writing /*{{{*/ | |
212 | // --------------------------------------------------------------------- | |
213 | /* This is only necessary for statistics reporting. */ | |
650faab0 | 214 | bool MultiCompress::Finalize(unsigned long long &OutSize) |
b2e465d6 AL |
215 | { |
216 | OutSize = 0; | |
217 | if (Input == 0 || Die() == false) | |
218 | return false; | |
219 | ||
220 | time_t Now; | |
221 | time(&Now); | |
222 | ||
223 | // Check the mtimes to see if the files were replaced. | |
224 | bool Changed = false; | |
225 | for (Files *I = Outputs; I != 0; I = I->Next) | |
226 | { | |
227 | struct stat St; | |
228 | if (stat(I->Output.c_str(),&St) != 0) | |
db0db9fe | 229 | return _error->Error(_("Internal error, failed to create %s"), |
b2e465d6 AL |
230 | I->Output.c_str()); |
231 | ||
232 | if (I->OldMTime != St.st_mtime) | |
233 | Changed = true; | |
234 | else | |
235 | { | |
236 | // Update the mtime if necessary | |
237 | if (UpdateMTime > 0 && | |
238 | (Now - St.st_mtime > (signed)UpdateMTime || St.st_mtime > Now)) | |
239 | { | |
240 | struct utimbuf Buf; | |
241 | Buf.actime = Buf.modtime = Now; | |
242 | utime(I->Output.c_str(),&Buf); | |
243 | Changed = true; | |
244 | } | |
245 | } | |
246 | ||
247 | // Force the file permissions | |
248 | if (St.st_mode != Permissions) | |
249 | chmod(I->Output.c_str(),Permissions); | |
250 | ||
251 | OutSize += St.st_size; | |
252 | } | |
253 | ||
254 | if (Changed == false) | |
255 | OutSize = 0; | |
256 | ||
257 | return true; | |
258 | } | |
259 | /*}}}*/ | |
b2e465d6 AL |
260 | // MultiCompress::OpenOld - Open an old file /*{{{*/ |
261 | // --------------------------------------------------------------------- | |
262 | /* This opens one of the original output files, possibly decompressing it. */ | |
12d1f5b3 | 263 | bool MultiCompress::OpenOld(FileFd &Fd) |
b2e465d6 AL |
264 | { |
265 | Files *Best = Outputs; | |
266 | for (Files *I = Outputs; I != 0; I = I->Next) | |
03bef784 | 267 | if (Best->CompressProg.Cost > I->CompressProg.Cost) |
b2e465d6 AL |
268 | Best = I; |
269 | ||
270 | // Open the file | |
12d1f5b3 | 271 | return Fd.Open(Best->Output, FileFd::ReadOnly, FileFd::Extension); |
b2e465d6 AL |
272 | } |
273 | /*}}}*/ | |
b2e465d6 AL |
274 | // MultiCompress::Child - The writer child /*{{{*/ |
275 | // --------------------------------------------------------------------- | |
276 | /* The child process forks a bunch of compression children and takes | |
c6474fb6 | 277 | input on FD and passes it to all the compressor child. On the way it |
b2e465d6 AL |
278 | computes the MD5 of the raw data. After this the raw data in the |
279 | original files is compared to see if this data is new. If the data | |
280 | is new then the temp files are renamed, otherwise they are erased. */ | |
9209ec47 | 281 | bool MultiCompress::Child(int const &FD) |
b2e465d6 | 282 | { |
b2e465d6 AL |
283 | /* Okay, now we just feed data from FD to all the other FDs. Also |
284 | stash a hash of the data to use later. */ | |
285 | SetNonBlock(FD,false); | |
286 | unsigned char Buffer[32*1024]; | |
650faab0 | 287 | unsigned long long FileSize = 0; |
b2e465d6 AL |
288 | MD5Summation MD5; |
289 | while (1) | |
290 | { | |
291 | WaitFd(FD,false); | |
292 | int Res = read(FD,Buffer,sizeof(Buffer)); | |
293 | if (Res == 0) | |
294 | break; | |
295 | if (Res < 0) | |
296 | continue; | |
297 | ||
298 | MD5.Add(Buffer,Res); | |
299 | FileSize += Res; | |
300 | for (Files *I = Outputs; I != 0; I = I->Next) | |
301 | { | |
52b47296 | 302 | if (I->TmpFile.Write(Buffer, Res) == false) |
b2e465d6 | 303 | { |
dc738e7a | 304 | _error->Errno("write",_("IO to subprocess/file failed")); |
b2e465d6 AL |
305 | break; |
306 | } | |
307 | } | |
308 | } | |
52b47296 | 309 | |
b2e465d6 AL |
310 | if (_error->PendingError() == true) |
311 | return false; | |
312 | ||
313 | /* Now we have to copy the files over, or erase them if they | |
314 | have not changed. First find the cheapest decompressor */ | |
315 | bool Missing = false; | |
316 | for (Files *I = Outputs; I != 0; I = I->Next) | |
317 | { | |
318 | if (I->OldMTime == 0) | |
319 | { | |
320 | Missing = true; | |
321 | break; | |
322 | } | |
323 | } | |
324 | ||
325 | // Check the MD5 of the lowest cost entity. | |
326 | while (Missing == false) | |
327 | { | |
12d1f5b3 DK |
328 | FileFd CompFd; |
329 | if (OpenOld(CompFd) == false) | |
b2e465d6 AL |
330 | { |
331 | _error->Discard(); | |
332 | break; | |
333 | } | |
12d1f5b3 | 334 | |
b2e465d6 AL |
335 | // Compute the hash |
336 | MD5Summation OldMD5; | |
650faab0 | 337 | unsigned long long NewFileSize = 0; |
b2e465d6 AL |
338 | while (1) |
339 | { | |
12d1f5b3 DK |
340 | unsigned long long Res = 0; |
341 | if (CompFd.Read(Buffer,sizeof(Buffer), &Res) == false) | |
342 | return _error->Errno("read",_("Failed to read while computing MD5")); | |
b2e465d6 AL |
343 | if (Res == 0) |
344 | break; | |
b2e465d6 AL |
345 | NewFileSize += Res; |
346 | OldMD5.Add(Buffer,Res); | |
347 | } | |
12d1f5b3 | 348 | CompFd.Close(); |
b2e465d6 AL |
349 | |
350 | // Check the hash | |
351 | if (OldMD5.Result() == MD5.Result() && | |
352 | FileSize == NewFileSize) | |
353 | { | |
354 | for (Files *I = Outputs; I != 0; I = I->Next) | |
355 | { | |
356 | I->TmpFile.Close(); | |
357 | if (unlink(I->TmpFile.Name().c_str()) != 0) | |
dc738e7a | 358 | _error->Errno("unlink",_("Problem unlinking %s"), |
b2e465d6 AL |
359 | I->TmpFile.Name().c_str()); |
360 | } | |
361 | return !_error->PendingError(); | |
362 | } | |
363 | break; | |
364 | } | |
365 | ||
366 | // Finalize | |
367 | for (Files *I = Outputs; I != 0; I = I->Next) | |
368 | { | |
369 | // Set the correct file modes | |
370 | fchmod(I->TmpFile.Fd(),Permissions); | |
371 | ||
372 | if (rename(I->TmpFile.Name().c_str(),I->Output.c_str()) != 0) | |
dc738e7a | 373 | _error->Errno("rename",_("Failed to rename %s to %s"), |
b2e465d6 AL |
374 | I->TmpFile.Name().c_str(),I->Output.c_str()); |
375 | I->TmpFile.Close(); | |
376 | } | |
377 | ||
378 | return !_error->PendingError(); | |
379 | } | |
380 | /*}}}*/ | |
381 |