2
* Copyright (c) 2003-2007 Tim Kientzle
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"
27
__FBSDID("$FreeBSD: src/lib/libarchive/archive_write_open_memory.c,v 1.3 2007/01/09 08:05:56 kientzle Exp $");
36
* This is a little tricky. I used to allow the
37
* compression handling layer to fork the compressor,
38
* which means this write function gets invoked in
39
* a separate process. That would, of course, make it impossible
40
* to actually use the data stored into memory here.
41
* Fortunately, none of the compressors fork today and
42
* I'm reluctant to use that route in the future but, if
43
* forking compressors ever do reappear, this will have
44
* to get a lot more complicated.
47
struct write_memory_data {
54
static int memory_write_close(struct archive *, void *);
55
static int memory_write_open(struct archive *, void *);
56
static ssize_t memory_write(struct archive *, void *, const void *buff, size_t);
59
* Client provides a pointer to a block of memory to receive
60
* the data. The 'size' param both tells us the size of the
61
* client buffer and lets us tell the client the final size.
64
archive_write_open_memory(struct archive *a, void *buff, size_t buffSize, size_t *used)
66
struct write_memory_data *mine;
68
mine = (struct write_memory_data *)malloc(sizeof(*mine));
70
archive_set_error(a, ENOMEM, "No memory");
71
return (ARCHIVE_FATAL);
73
memset(mine, 0, sizeof(*mine));
75
mine->size = buffSize;
76
mine->client_size = used;
77
return (archive_write_open(a, mine,
78
memory_write_open, memory_write, memory_write_close));
82
memory_write_open(struct archive *a, void *client_data)
84
struct write_memory_data *mine;
87
if (mine->client_size != NULL)
88
*mine->client_size = mine->used;
89
/* Disable padding if it hasn't been set explicitly. */
90
if (-1 == archive_write_get_bytes_in_last_block(a))
91
archive_write_set_bytes_in_last_block(a, 1);
96
* Copy the data into the client buffer.
97
* Note that we update mine->client_size on every write.
98
* In particular, this means the client can follow exactly
99
* how much has been written into their buffer at any time.
102
memory_write(struct archive *a, void *client_data, const void *buff, size_t length)
104
struct write_memory_data *mine;
107
if (mine->used + length > mine->size) {
108
archive_set_error(a, ENOMEM, "Buffer exhausted");
109
return (ARCHIVE_FATAL);
111
memcpy(mine->buff + mine->used, buff, length);
112
mine->used += length;
113
if (mine->client_size != NULL)
114
*mine->client_size = mine->used;
119
memory_write_close(struct archive *a, void *client_data)
121
struct write_memory_data *mine;
122
(void)a; /* UNUSED */