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
|
/* Store wire decoding
Copyright (C) 1996 Free Software Foundation, Inc.
Written by Miles Bader <miles@gnu.ai.mit.edu>
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., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include <string.h>
#include <malloc.h>
#include "store.h"
/* Decodes the standard leaf encoding that's common to various builtin
formats, and calls CREATE to actually create the store. */
error_t
store_default_leaf_decode (struct store_enc *enc,
error_t (*create)(mach_port_t port,
size_t block_size,
const off_t *runs,
size_t runs_len,
struct store **store),
struct store **store)
{
char *misc;
error_t err;
int type, flags;
mach_port_t port;
size_t block_size, num_runs, name_len, misc_len;
/* Make sure there are enough encoded ints and ports. */
if (enc->cur_int + 6 > enc->ints_len || enc->cur_port + 1 > enc->ports_len)
return EINVAL;
/* Read encoded ints. */
type = enc->ints[enc->cur_int++];
flags = enc->ints[enc->cur_int++];
block_size = enc->ints[enc->cur_int++];
num_runs = enc->ints[enc->cur_int++];
name_len = enc->ints[enc->cur_int++];
misc_len = enc->ints[enc->cur_int++];
/* Make sure there are enough encoded offsets and data. */
if (enc->cur_offset + num_runs * 2 > enc->offsets_len
|| enc->cur_data + name_len + misc_len > enc->data_len)
return EINVAL;
if (enc->data[enc->cur_data + name_len - 1] != '\0')
return EINVAL; /* Name not terminated. */
misc = malloc (misc_len);
if (! misc)
return ENOMEM;
/* Read encoded ports (be careful to deallocate this if we barf). */
port = enc->ports[enc->cur_port++];
err =
(*create)(port, block_size, enc->offsets + enc->cur_offset, num_runs,
store);
if (err)
{
mach_port_deallocate (mach_task_self (), port);
free (misc);
}
else
{
(*store)->flags = flags;
(*store)->misc = misc;
(*store)->misc_len = misc_len;
}
return err;
}
/* Decode ENC, either returning a new store in STORE, or an error. If
nothing else is to be done with ENC, its contents may then be freed using
store_enc_dealloc. */
error_t
store_decode (struct store_enc *enc, struct store **store)
{
if (enc->cur_int >= enc->ints_len)
/* The first int should always be the type. */
return EINVAL;
switch (enc->ints[enc->cur_int])
{
case STORAGE_HURD_FILE:
return store_default_leaf_decode (enc, _store_file_create, store);
case STORAGE_DEVICE:
return store_default_leaf_decode (enc, _store_device_create, store);
#if 0
case STORAGE_TASK:
case STORAGE_MEMORY:
case STORAGE_ILEAVE:
return store_ileave_decode (enc, store);
case STORAGE_CONCAT:
return store_concat_decode (enc, store);
case STORAGE_LAYER:
return store_layer_decode (enc, store);
case STORAGE_NULL:
return store_null_decode (enc, store);
#endif
default:
return EINVAL;
}
}
|
