summaryrefslogtreecommitdiff
path: root/libstore/bunzip2.c
blob: 835553c720f8e4058b2f9eb4e25d95a836d4c230 (plain)
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
/* Decompressing store backend

   Copyright (C) 1998, 1999 Free Software Foundation, Inc.
   Written by okuji@kuicr.kyoto-u.ac.jp <okuji@kuicr.kyoto-u.ac.jp>
   This file is part of the GNU Hurd.

   The GNU Hurd 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.

   The GNU Hurd 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 this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA. */

#include <stdio.h>
#include <string.h>
#include <setjmp.h>
#include <cthreads.h>
#include <sys/mman.h>

#include "store.h"

extern void do_bunzip2 (void);	/* Entry point to bunzip2 engine.  */


#define IN_BUFFERING  (256*1024)
#define OUT_BUFFERING (512*1024)

static struct mutex bunzip2_lock = MUTEX_INITIALIZER;

/* Uncompress the contents of FROM, which should contain a valid bzip2 file,
   into memory, returning the result buffer in BUF & BUF_LEN.  */
static error_t
bunzip2 (struct store *from, void **buf, size_t *buf_len)
{
  /* Callbacks from bunzip2 for I/O and error interface.  */
  extern int (*unzip_read) (char *buf, size_t maxread);
  extern void (*unzip_write) (const char *buf, size_t nwrite);
  extern void (*unzip_read_error) (void);
  extern void (*unzip_error) (const char *msg);

  /* How we return errors from our hook functions.  */
  jmp_buf zerr_jmp_buf;
  error_t zerr;

  /* vm_alloced buffer for the input store.  */
  void *in_buf = 0;
  size_t in_buf_len = 0;
  size_t in_buf_offs = 0;	/* Offset of read point in IN_BUF.  */
  off_t in_buf_addr = 0;	/* Address in FROM of *next* IN_BUF.  */

  /* Buffer input in units that are least IN_BUFFERING bytes, but are also a
     multiple of FROM's block size.  */
  size_t in_addr_mask = ((1 << from->log2_block_size) - 1);
  size_t in_buffering = ((IN_BUFFERING + in_addr_mask) & ~in_addr_mask);

  /* Read at most MAXREAD (or 0 if eof) bytes into BUF from our current
     position in FROM.  */
  int zread (char *buf, size_t maxread)
    {
      size_t did_read = 0;

      while (maxread > 0)
	{
	  size_t left = in_buf_len - in_buf_offs;

	  if (left > 0)
	    /* Fill BUF with what we can from IN_BUF.  */
	    {
	      if (left > maxread)
		left = maxread;
	      bcopy (in_buf + in_buf_offs, buf, left);
	      in_buf_offs += left;
	      buf += left;
	      maxread -= left;
	      did_read += left;
	    }

	  /* Limit MAXREAD to the number of bytes left in the input.  */
	  if (maxread > (from->size - (in_buf_addr << from->log2_block_size)))
	    maxread = from->size - (in_buf_addr << from->log2_block_size);

	  if (maxread > 0)
	    /* Have to fill IN_BUF again.  */
	    {
	      void *new_in_buf = in_buf;
	      size_t new_in_buf_len = in_buf_len;

	      zerr = store_read (from, in_buf_addr, in_buffering,
				 &new_in_buf, &new_in_buf_len);
	      if (zerr)
		longjmp (zerr_jmp_buf, 1);

	      in_buf_addr += (new_in_buf_len >> from->log2_block_size);

	      if (new_in_buf != in_buf)
		{
		  if (in_buf_len > 0)
		    munmap (in_buf, in_buf_len);
		  in_buf = new_in_buf;
		  in_buf_len = new_in_buf_len;
		}

	      in_buf_offs = 0;
	    }
	}
      return did_read;
    }

  size_t out_buf_offs = 0;	/* Position in the output buffer.  */

  /* Write compress data to our output buffer.  */
  void zwrite (const char *wbuf, size_t nwrite)
    {
      size_t old_buf_len = *buf_len;

      if (out_buf_offs + nwrite > old_buf_len)
	/* Have to grow the output buffer.  */
	{
	  void *old_buf = *buf;
	  void *new_buf = old_buf + old_buf_len; /* First try.  */
	  size_t new_buf_len = round_page (old_buf_len + old_buf_len + nwrite);

	  /* Try to grow the buffer.  */
	  zerr =
	    vm_allocate (mach_task_self (),
			 (vm_address_t *)&new_buf, new_buf_len - old_buf_len,
			 0);
	  if (zerr)
	    /* Can't do that, try to make a bigger buffer elsewhere.  */
	    {
	      new_buf = mmap (0, new_buf_len, PROT_READ|PROT_WRITE, 
			      MAP_ANON, 0, 0);
	      zerr = (new_buf == (void *) -1) ? errno : 0;
	      if (zerr)
		longjmp (zerr_jmp_buf, 1);

	      if (out_buf_offs > 0)
		/* Copy the old buffer into the start of the new & free it. */
		bcopy (old_buf, new_buf, out_buf_offs);

	      munmap (old_buf, old_buf_len);

	      *buf = new_buf;
	    }

	  *buf_len = new_buf_len;
	}

      bcopy (wbuf, *buf + out_buf_offs, nwrite);
      out_buf_offs += nwrite;
    }

  void zreaderr (void)
    {
      zerr = EIO;
      longjmp (zerr_jmp_buf, 1);
    }
  void zerror (const char *msg)
    {
      zerr = EINVAL;
      longjmp (zerr_jmp_buf, 2);
    }

  /* Try to guess a reasonable output buffer size.  */
  *buf_len = round_page (from->size * 2);
  *buf = mmap (0, *buf_len, PROT_READ|PROT_WRITE, MAP_ANON, 0, 0);
  zerr = (*buf == (void *) -1) ? errno : 0;
  if (zerr)
    return zerr;

  mutex_lock (&bunzip2_lock);

  unzip_read = zread;
  unzip_write = zwrite;
  unzip_read_error = zreaderr;
  unzip_error = zerror;

  if (! setjmp (zerr_jmp_buf))
    {
      /* Call the bunzip2 engine.  */
      do_bunzip2 ();
      zerr = 0;
    }

  mutex_unlock (&bunzip2_lock);

  if (in_buf_len > 0)
    munmap (in_buf, in_buf_len);

  if (zerr)
    {
      if (*buf_len > 0)
	munmap (*buf, *buf_len);
    }
  else if (out_buf_offs < *buf_len)
    /* Trim the output buffer to be the right length.  */
    {
      size_t end = round_page (out_buf_offs);
      if (end < *buf_len)
	munmap (*buf + end, *buf_len - end);
      *buf_len = out_buf_offs;
    }

  return zerr;
}

/* Return a new store in STORE which contains a snapshot of the uncompressed
   contents of the store FROM; FROM is consumed.  */
error_t
store_bunzip2_create (struct store *from, int flags, struct store **store)
{
  void *buf;
  size_t buf_len;
  error_t err = bunzip2 (from, &buf, &buf_len);

  if (! err)
    {
      err = store_buffer_create (buf, buf_len, flags, store);
      if (err)
	munmap (buf, buf_len);
      else
	store_free (from);
    }

  return err;
}

/* Open the bunzip2 NAME -- which consists of another store-class name, a ':',
   and a name for that store class to open -- and return the corresponding
   store in STORE.  CLASSES is used to select classes specified by the type
   name; if it is 0, STORE_STD_CLASSES is used.  */
error_t
store_bunzip2_open (const char *name, int flags,
		    const struct store_class *const *classes,
		    struct store **store)
{
  struct store *from;
  error_t err =
    store_typed_open (name, flags | STORE_HARD_READONLY, classes, &from);

  if (! err)
    {
      err = store_bunzip2_create (from, flags, store);
      if (err)
	store_free (from);
    }

  return err;
}

const struct store_class
store_bunzip2_class = { -1, "bunzip2", open: store_bunzip2_open };