1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
/*
* dpkg-split - splitting and joining of multipart *.deb archives
* join.c - joining
*
* Copyright © 1995 Ian Jackson <ian@chiark.greenend.org.uk>
*
* This is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2,
* or (at your option) any later version.
*
* This is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public
* License along with dpkg; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <config.h>
#include <compat.h>
#include <assert.h>
#include <limits.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <dpkg/i18n.h>
#include <dpkg/dpkg.h>
#include <dpkg/dpkg-db.h>
#include <dpkg/myopt.h>
#include "dpkg-split.h"
void reassemble(struct partinfo **partlist, const char *outputfile) {
FILE *output, *input;
void *buffer;
struct partinfo *pi;
unsigned int i;
size_t nr,buffersize;
printf(_("Putting package %s together from %d parts: "),
partlist[0]->package,partlist[0]->maxpartn);
buffersize= partlist[0]->maxpartlen;
for (i=0; i<partlist[0]->maxpartn; i++)
if (partlist[0]->headerlen > buffersize) buffersize= partlist[0]->headerlen;
buffer= m_malloc(partlist[0]->maxpartlen);
output= fopen(outputfile,"w");
if (!output) ohshite(_("unable to open output file `%.250s'"),outputfile);
for (i=0; i<partlist[0]->maxpartn; i++) {
pi= partlist[i];
input= fopen(pi->filename,"r");
if (!input) ohshite(_("unable to (re)open input part file `%.250s'"),pi->filename);
assert(pi->headerlen <= buffersize);
nr= fread(buffer,1,pi->headerlen,input);
if (nr != pi->headerlen) rerreof(input,pi->filename);
assert(pi->thispartlen <= buffersize);
printf("%d ",i+1);
nr= fread(buffer,1,pi->thispartlen,input);
if (nr != pi->thispartlen) rerreof(input,pi->filename);
if (pi->thispartlen & 1)
if (getc(input) == EOF) rerreof(input,pi->filename);
if (ferror(input)) rerr(pi->filename);
fclose(input);
nr= fwrite(buffer,1,pi->thispartlen,output);
if (nr != pi->thispartlen) werr(outputfile);
}
if (fclose(output)) werr(outputfile);
printf(_("done\n"));
}
void addtopartlist(struct partinfo **partlist,
struct partinfo *pi, struct partinfo *refi) {
int i;
if (strcmp(pi->package,refi->package) ||
strcmp(pi->version,refi->version) ||
strcmp(pi->md5sum,refi->md5sum) ||
pi->orglength != refi->orglength ||
pi->maxpartn != refi->maxpartn ||
pi->maxpartlen != refi->maxpartlen) {
print_info(pi);
print_info(refi);
ohshit(_("files `%.250s' and `%.250s' are not parts of the same file"),
pi->filename,refi->filename);
}
i= pi->thispartn-1;
if (partlist[i])
ohshit(_("there are several versions of part %d - at least `%.250s' and `%.250s'"),
pi->thispartn, pi->filename, partlist[i]->filename);
partlist[i]= pi;
}
void do_join(const char *const *argv) {
char *p;
const char *thisarg;
struct partqueue *pq;
struct partinfo *refi, *pi, **partlist;
unsigned int i;
assert(!queue);
if (!*argv)
badusage(_("--%s requires one or more part file arguments"),
cipaction->olong);
while ((thisarg= *argv++)) {
pq= nfmalloc(sizeof(struct partqueue));
mustgetpartinfo(thisarg,&pq->info);
pq->nextinqueue= queue;
queue= pq;
}
refi= NULL;
for (pq= queue; pq; pq= pq->nextinqueue)
if (!refi || pq->info.thispartn < refi->thispartn) refi= &pq->info;
assert(refi);
partlist= nfmalloc(sizeof(struct partinfo*)*refi->maxpartn);
for (i = 0; i < refi->maxpartn; i++)
partlist[i] = NULL;
for (pq= queue; pq; pq= pq->nextinqueue) {
pi= &pq->info;
addtopartlist(partlist,pi,refi);
}
for (i=0; i<refi->maxpartn; i++) {
if (!partlist[i]) ohshit(_("part %d is missing"),i+1);
}
if (!outputfile) {
p= nfmalloc(strlen(refi->package)+1+strlen(refi->version)+sizeof(DEBEXT));
strcpy(p,refi->package);
strcat(p,"-");
strcat(p,refi->version);
strcat(p,DEBEXT);
outputfile= p;
}
reassemble(partlist,outputfile);
}
|
