2
* Copyright (c) 2009 Michihiro NAKAJIMA
5
* Redistribution and use in source and binary forms, with or without
6
* modification, are permitted provided that the following conditions
8
* 1. Redistributions of source code must retain the above copyright
9
* notice, this list of conditions and the following disclaimer.
10
* 2. Redistributions in binary form must reproduce the above copyright
11
* notice, this list of conditions and the following disclaimer in the
12
* documentation and/or other materials provided with the distribution.
14
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
15
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
16
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
17
* IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
18
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
19
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
21
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26
#include "archive_platform.h"
36
#include "archive_endian.h"
37
#include "archive_private.h"
38
#include "archive_read_private.h"
44
unsigned char header[16];
46
ST_LEAD, /* Skipping 'Lead' section. */
47
ST_HEADER, /* Reading 'Header' section;
49
ST_HEADER_DATA, /* Skipping 'Header' section. */
50
ST_PADDING, /* Skipping padding data after the
51
* 'Header' section. */
52
ST_ARCHIVE /* Reading 'Archive' section. */
56
#define RPM_LEAD_SIZE 96 /* Size of 'Lead' section. */
58
static int rpm_bidder_bid(struct archive_read_filter_bidder *,
59
struct archive_read_filter *);
60
static int rpm_bidder_init(struct archive_read_filter *);
62
static ssize_t rpm_filter_read(struct archive_read_filter *,
64
static int rpm_filter_close(struct archive_read_filter *);
67
archive_read_support_compression_rpm(struct archive *_a)
69
struct archive_read *a = (struct archive_read *)_a;
70
struct archive_read_filter_bidder *bidder;
72
bidder = __archive_read_get_bidder(a);
73
archive_clear_error(_a);
75
return (ARCHIVE_FATAL);
78
bidder->bid = rpm_bidder_bid;
79
bidder->init = rpm_bidder_init;
80
bidder->options = NULL;
86
rpm_bidder_bid(struct archive_read_filter_bidder *self,
87
struct archive_read_filter *filter)
89
const unsigned char *b;
93
(void)self; /* UNUSED */
95
b = __archive_read_filter_ahead(filter, 8, &avail);
101
* Verify Header Magic Bytes : 0xed 0xab 0xee 0xdb
116
* Check major version.
118
if (b[4] != 3 && b[4] != 4)
122
* Check package type; binary or source.
127
if (b[7] != 0 && b[7] != 1)
131
return (bits_checked);
135
rpm_bidder_init(struct archive_read_filter *self)
139
self->code = ARCHIVE_COMPRESSION_RPM;
141
self->read = rpm_filter_read;
142
self->skip = NULL; /* not supported */
143
self->close = rpm_filter_close;
145
rpm = (struct rpm *)calloc(sizeof(*rpm), 1);
147
archive_set_error(&self->archive->archive, ENOMEM,
148
"Can't allocate data for rpm");
149
return (ARCHIVE_FATAL);
153
rpm->state = ST_LEAD;
159
rpm_filter_read(struct archive_read_filter *self, const void **buff)
162
const unsigned char *b;
163
ssize_t avail_in, total;
168
rpm = (struct rpm *)self->data;
170
total = avail_in = 0;
175
b = __archive_read_filter_ahead(self->upstream, 1,
179
return (ARCHIVE_FATAL);
185
switch (rpm->state) {
187
if (rpm->total_in + avail_in < RPM_LEAD_SIZE)
190
n = RPM_LEAD_SIZE - rpm->total_in;
193
rpm->state = ST_HEADER;
196
rpm->first_header = 1;
201
if (n > avail_in - used)
203
memcpy(rpm->header+rpm->hpos, b, n);
208
if (rpm->hpos == 16) {
209
if (rpm->header[0] != 0x8e ||
210
rpm->header[1] != 0xad ||
211
rpm->header[2] != 0xe8 ||
212
rpm->header[3] != 0x01) {
213
if (rpm->first_header) {
215
&self->archive->archive,
216
ARCHIVE_ERRNO_FILE_FORMAT,
217
"Unrecoginized rpm header");
218
return (ARCHIVE_FATAL);
220
rpm->state = ST_ARCHIVE;
225
/* Calculate 'Header' length. */
226
section = archive_be32dec(rpm->header+8);
227
bytes = archive_be32dec(rpm->header+12);
228
rpm->hlen = 16 + section * 16 + bytes;
229
rpm->state = ST_HEADER_DATA;
230
rpm->first_header = 0;
234
n = rpm->hlen - rpm->hpos;
235
if (n > avail_in - used)
240
if (rpm->hpos == rpm->hlen)
241
rpm->state = ST_PADDING;
244
while (used < (size_t)avail_in) {
246
/* Read next header. */
247
rpm->state = ST_HEADER;
262
if (used == (size_t)avail_in) {
263
rpm->total_in += used;
264
__archive_read_filter_consume(self->upstream, used);
268
} while (total == 0 && avail_in > 0);
270
if (used > 0 && b != NULL) {
271
rpm->total_in += used;
272
__archive_read_filter_consume(self->upstream, used);
278
rpm_filter_close(struct archive_read_filter *self)
282
rpm = (struct rpm *)self->data;