-
Notifications
You must be signed in to change notification settings - Fork 1
/
packout.c
375 lines (280 loc) · 9.34 KB
/
packout.c
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
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
/*
Copyright (C) 2001-2009, Parrot Foundation.
This program is free software. It is subject to the same license as
Parrot itself.
$Id$
=head1 NAME
src/packout.c - Functions for writing out packfiles
=head1 DESCRIPTION
This file implements various functions for creating and writing packfiles.
=head2 Functions
=over 4
=cut
*/
#include "parrot/parrot.h"
#include "parrot/packfile.h"
#include "pmc/pmc_key.h"
/* HEADERIZER HFILE: include/parrot/packfile.h */
/*
=item C<opcode_t PackFile_pack_size(PARROT_INTERP, PackFile *self)>
Determine the size of the buffer needed in order to pack the PackFile
into a contiguous region of memory.
Must be run before C<PackFile_pack()>, so it will allocate an adequate
buffer.
=cut
*/
PARROT_EXPORT
opcode_t
PackFile_pack_size(PARROT_INTERP, ARGMOD(PackFile *self))
{
ASSERT_ARGS(PackFile_pack_size)
size_t size;
size_t header_size = 0;
PackFile_Directory * const dir = &self->directory;
header_size = PACKFILE_HEADER_BYTES;
header_size += self->header->uuid_size;
header_size +=
header_size % 16
? 16 - header_size % 16
: 0;
size = header_size / sizeof (opcode_t);
size += 4; /* directory type + 3 padding zeros */
dir->base.file_offset = size;
size += PackFile_Segment_packed_size(interp, (PackFile_Segment *) dir);
return size;
}
/*
=item C<void PackFile_pack(PARROT_INTERP, PackFile *self, opcode_t *cursor)>
Pack the PackFile into a contiguous region of memory.
Note that the memory block had better have at least the amount of memory
indicated by C<PackFile_pack_size()>.
This means that you MUST call C<PackFile_pack_size()> before
C<PackFile_pack()>
Other pack routines are in F<src/packfile.c>.
=cut
*/
PARROT_EXPORT
void
PackFile_pack(PARROT_INTERP, ARGMOD(PackFile *self), ARGOUT(opcode_t *cursor))
{
ASSERT_ARGS(PackFile_pack)
opcode_t *ret;
size_t size;
PackFile_Directory * const dir = &self->directory;
PackFile_Segment *seg;
int padding_size;
char *byte_cursor = (char*)cursor;
self->src = cursor;
/* Pack the fixed part of the header */
mem_sys_memcopy(cursor, self->header, PACKFILE_HEADER_BYTES);
byte_cursor += PACKFILE_HEADER_BYTES;
/* Pack the UUID. */
if (self->header->uuid_size > 0)
mem_sys_memcopy(byte_cursor, self->header->uuid_data,
self->header->uuid_size);
/* Padding. */
padding_size = 16 - (PACKFILE_HEADER_BYTES + self->header->uuid_size) % 16;
if (padding_size < 16) {
int i;
for (i = 0; i < padding_size; i++)
*byte_cursor++ = 0;
}
else {
padding_size = 0;
}
/* Set cursor. */
cursor += (PACKFILE_HEADER_BYTES + self->header->uuid_size + padding_size)
/ sizeof (opcode_t);
/* Directory format and padding. */
*cursor++ = PF_DIR_FORMAT;
*cursor++ = 0;
*cursor++ = 0;
*cursor++ = 0;
/* pack the directory */
seg = (PackFile_Segment *) dir;
/* dir size */
size = seg->op_count;
ret = PackFile_Segment_pack(interp, seg, cursor);
if ((size_t)(ret - cursor) != size) {
Parrot_io_eprintf(interp, "PackFile_pack segment '%Ss' used size %d "
"but reported %d\n", seg->name, (int)(ret-cursor), (int)size);
}
}
/*
=item C<size_t PackFile_ConstTable_pack_size(PARROT_INTERP, PackFile_Segment
*seg)>
Determine the size of the buffer needed in order to pack the PackFile
constant table into a contiguous region of memory.
=cut
*/
PARROT_EXPORT
size_t
PackFile_ConstTable_pack_size(PARROT_INTERP, ARGIN(PackFile_Segment *seg))
{
ASSERT_ARGS(PackFile_ConstTable_pack_size)
opcode_t i;
const PackFile_ConstTable* const self = (const PackFile_ConstTable *) seg;
size_t size = 1; /* const_count */
for (i = 0; i < self->const_count; i++)
size += PackFile_Constant_pack_size(interp, self->constants[i]);
return size;
}
/*
=item C<opcode_t * PackFile_ConstTable_pack(PARROT_INTERP, PackFile_Segment
*seg, opcode_t *cursor)>
Pack the PackFile ConstTable into a contiguous region of memory.
Note that the memory block had better have at least the amount of memory
indicated by C<PackFile_pack_size()>.
This means that you MUST call C<PackFile_pack_size()> before
C<PackFile_ConstTable_pack()>
=cut
*/
PARROT_EXPORT
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
opcode_t *
PackFile_ConstTable_pack(PARROT_INTERP,
ARGIN(PackFile_Segment *seg), ARGMOD(opcode_t *cursor))
{
ASSERT_ARGS(PackFile_ConstTable_pack)
const PackFile_ConstTable * const self = (const PackFile_ConstTable *)seg;
opcode_t i;
*cursor++ = self->const_count;
for (i = 0; i < self->const_count; i++)
cursor = PackFile_Constant_pack(interp, self, self->constants[i], cursor);
return cursor;
}
/*
=item C<int PackFile_find_in_const(PARROT_INTERP, const PackFile_ConstTable *ct,
PMC *key, int type)>
This is really ugly, we don't know where our C<PARROT_ARG_SC> key
constant is in constant table, so we have to search for it.
=cut
*/
PARROT_EXPORT
int
PackFile_find_in_const(PARROT_INTERP,
ARGIN(const PackFile_ConstTable *ct), ARGIN(PMC *key), int type)
{
ASSERT_ARGS(PackFile_find_in_const)
int i;
FLOATVAL key_num;
STRING *key_str;
GETATTR_Key_str_key(interp, key, key_str);
GETATTR_Key_num_key(interp, key, key_num);
for (i = 0; i < ct->const_count; i++) {
if (type == PFC_STRING && ct->constants[i]->u.string == key_str)
return i;
if (type == PFC_NUMBER && ct->constants[i]->u.number == key_num)
return i;
}
Parrot_io_eprintf(NULL, "find_in_const: couldn't find const for key\n");
Parrot_exit(interp, 1);
}
/*
=item C<opcode_t * PackFile_Constant_pack(PARROT_INTERP, const
PackFile_ConstTable *const_table, const PackFile_Constant *self, opcode_t
*cursor)>
Pack a PackFile Constant into a contiguous region of memory.
Note that the memory block had better have at least the amount of memory
indicated by C<PackFile_pack_size()>.
This means that you MUST call C<PackFile_pack_size()> before
C<PackFile_Constant_pack()>
The data is zero-padded to an opcode_t-boundary, so pad bytes may be added.
(Note this padding is not yet implemented for FLOATVALs.)
=cut
*/
PARROT_EXPORT
PARROT_CANNOT_RETURN_NULL
PARROT_WARN_UNUSED_RESULT
opcode_t *
PackFile_Constant_pack(PARROT_INTERP,
ARGIN(const PackFile_ConstTable *const_table),
ARGIN(const PackFile_Constant *self), ARGOUT(opcode_t *cursor))
{
ASSERT_ARGS(PackFile_Constant_pack)
PMC *key;
size_t i;
STRING *image;
*cursor++ = self->type;
switch (self->type) {
case PFC_NUMBER:
cursor = PF_store_number(cursor, &self->u.number);
break;
case PFC_STRING:
cursor = PF_store_string(cursor, self->u.string);
break;
case PFC_PMC:
key = self->u.key; /* the (Sub) PMC */
image = Parrot_freeze(interp, key);
cursor = PF_store_string(cursor, image);
break;
case PFC_KEY:
for (i = 0, key = self->u.key; key; i++){
GETATTR_Key_next_key(interp, key, key);
}
/* number of key components */
*cursor++ = i;
/* and now type / value per component */
for (key = self->u.key; key;) {
const opcode_t type = PObj_get_FLAGS(key);
switch (type & KEY_type_FLAGS) {
case KEY_integer_FLAG:
*cursor++ = PARROT_ARG_IC;
GETATTR_Key_int_key(interp, key, *cursor++);
break;
case KEY_number_FLAG:
*cursor++ = PARROT_ARG_NC;
/* Argh */
*cursor++ = PackFile_find_in_const(interp, const_table, key, PFC_NUMBER);
break;
case KEY_string_FLAG:
*cursor++ = PARROT_ARG_SC;
/* Argh */
*cursor++ = PackFile_find_in_const(interp, const_table, key, PFC_STRING);
break;
case KEY_integer_FLAG | KEY_register_FLAG:
*cursor++ = PARROT_ARG_I;
GETATTR_Key_int_key(interp, key, *cursor++);
break;
case KEY_number_FLAG | KEY_register_FLAG:
*cursor++ = PARROT_ARG_N;
GETATTR_Key_int_key(interp, key, *cursor++);
break;
case KEY_string_FLAG | KEY_register_FLAG:
*cursor++ = PARROT_ARG_S;
GETATTR_Key_int_key(interp, key, *cursor++);
break;
case KEY_pmc_FLAG | KEY_register_FLAG:
*cursor++ = PARROT_ARG_P;
GETATTR_Key_int_key(interp, key, *cursor++);
break;
default:
Parrot_io_eprintf(NULL, "PackFile_Constant_pack: "
"unsupported constant type\n");
Parrot_exit(interp, 1);
}
GETATTR_Key_next_key(interp, key, key);
}
break;
default:
Parrot_io_eprintf(NULL, "PackFile_Constant_pack: unsupported constant\n");
Parrot_exit(interp, 1);
break;
}
return cursor;
}
/*
=back
=head1 HISTORY
Rework by Melvin; new bytecode format, make bytecode portable. (Do
endian conversion and wordsize transforms on the fly.)
leo: rewrite to use new directory-based format.
=cut
*/
/*
* Local variables:
* c-file-style: "parrot"
* End:
* vim: expandtab shiftwidth=4:
*/