-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathbeam_loader.cpp
More file actions
621 lines (527 loc) · 19.2 KB
/
beam_loader.cpp
File metadata and controls
621 lines (527 loc) · 19.2 KB
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
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
#include "binary.h"
#include "code_server.h"
#include "ext_term.h"
#include "functional.h"
#include "heap.h"
#include "platf/gsys_mem.h"
#include "predef_atoms.h"
#include "reader.h"
#include "term_helpers.h"
#include "beam.h"
#define MINIZ_HEADER_FILE_ONLY
#include "miniz/miniz.cpp"
namespace gluon {
Module* code::Server::load_module_internal(proc::Heap* heap,
Term expected_name,
ArrayView<const Uint8> data) {
G_ASSERT(expected_name.is_atom() || expected_name.is_nil());
tool::Reader r(data);
BeamLoader lstate(vm_, heap);
r.assert_remaining_at_least(4 + 4 + 4);
Str for1_header = r.read_string(4);
if (for1_header != "FOR1") {
throw err::BeamLoad("not iff container");
}
Word file_length = r.read_big_u32();
r.assert_remaining_at_least(file_length);
Str beam_header = r.read_string(4);
if (beam_header != "BEAM") {
throw err::BeamLoad("not BEAM file");
}
while (1) {
if (r.get_remaining_count() < 5)
break;
Str chunk = r.read_string(4);
if (!is_uppcase_latin(chunk[0]) || !is_latin(chunk[1]) ||
!is_lowcase_latin(chunk[2])) {
G_LOG("beam offset " FMT_0xHEX "\n", r.get_ptr() - data.data());
throw err::BeamLoad("bad beam format");
}
if (chunk == "Atom") {
lstate.load_atom_table(r, expected_name);
} else if (chunk == "Code") {
lstate.load_code(r);
} else if (chunk == "CatT") {
lstate.load_catch_table(r);
} else if (chunk == "FunT") {
lstate.load_lambda_table(r);
} else if (chunk == "ExpT") {
lstate.load_export_table(r);
} else if (chunk == "LitT") {
lstate.load_literal_table(r);
}
// else if (chunk == "LABL") { lstate.load_labels(r); }
else if (chunk == "StrT") {
lstate.load_str_table(r);
} else if (chunk == "ImpT") {
lstate.load_import_table(r);
}
// CInf block
// Attr block
// Abst block
else if (chunk == "Line") {
lstate.load_line_table(r);
} else {
auto chunk_sz = r.read_big_u32();
r.advance_align<4>(chunk_sz);
}
}
// All good, deploy the module!
Term modname = vm_.to_atom(lstate.mod_name());
return lstate.finalize(modname);
}
Module* BeamLoader::finalize(Term modname) {
Module* newmod = heap_->alloc_object<Module>(modname, imports_);
beam_prepare_code(newmod, code_);
return newmod;
}
void BeamLoader::load_atom_table(tool::Reader& r0, Term expected_name) {
auto chunk_size = r0.read_big_u32();
tool::Reader r = r0.clone(chunk_size);
auto tab_sz = r.read_big_u32();
atoms_.reserve(tab_sz);
for (Word i = 0; i < tab_sz; ++i) {
auto atom_sz = r.read_byte();
atoms_.push_back(r.read_string(atom_sz));
// G_LOG("atom: %s index " FMT_UWORD "\n", m_atoms.back().c_str(),
// m_atoms.size()-1);
}
// Check first atom in table which is module name
G_ASSERT(atoms_.size() > 0);
mod_name_ = vm_.to_atom(atoms_[0]);
if (false == expected_name.is_nil() && mod_name_ != expected_name) {
throw err::BeamLoad("module name mismatch");
}
r0.advance_align<4>(chunk_size);
}
void BeamLoader::load_str_table(tool::Reader& r0) {
auto chunk_size = r0.read_big_u32();
r0.advance_align<4>(chunk_size);
}
void BeamLoader::load_catch_table(tool::Reader& r0) {
auto chunk_size = r0.read_big_u32();
/*
tool::Reader r = r0.clone(chunk_size);
r.assert_remaining_at_least(4);
Word count = r.read_big_u32();
Vector<Word> catches;
catches.reserve(count);
for (Word i = 0; i < count; ++i) {
Word offset = r.read_big_u32();
catches.push_back(offset);
}
*/
r0.advance_align<4>(chunk_size);
}
void BeamLoader::load_lambda_table(tool::Reader& r0) {
auto chunk_size = r0.read_big_u32();
tool::Reader r = r0.clone(chunk_size);
G_ASSERT(atoms_.size() > 0);
Word count = r.read_big_u32();
Term mod = vm_.to_atom(atoms_[0]);
for (Word i = 0; i < count; ++i)
// while (r.get_remaining_count() > 6 * sizeof(u32_t))
{
auto fun_atom_i = r.read_big_u32();
auto arity = r.read_big_u32();
auto offset = r.read_big_u32();
auto index = r.read_big_u32();
auto nfree = r.read_big_u32();
auto ouniq = r.read_big_u32();
if (fun_atom_i > atoms_.size()) {
throw err::BeamLoad("funt: atom index too big");
}
const Str& f_str = atom_tab_index_to_str(fun_atom_i);
FunEntry fe;
fe.mfa = MFArity(mod, vm_.to_atom(f_str), arity);
fe.uniq[0] = (Uint32)offset; // use as temp storage, cast down to u32
fe.uniq[1] = fe.uniq[2] = fe.uniq[3] = 0;
fe.old_uniq = ouniq;
fe.old_index = fe.index = index;
fe.num_free = nfree;
fe.code = CodePointer(); // resolve later from uniq0
libc::fmt("read fun table: %s:%s/" FMT_UWORD " offset=" FMT_UWORD "\n",
fe.mfa.mod.atom_str(vm_).c_str(),
fe.mfa.fun.atom_str(vm_).c_str(), arity, offset);
lambdas_.push_back(fe);
}
r0.advance_align<4>(chunk_size);
}
void BeamLoader::load_export_table(tool::Reader& r0) {
auto chunk_size = r0.read_big_u32();
tool::Reader r = r0.clone(chunk_size);
auto count = r.read_big_u32();
for (Word i = 0; i < count; ++i) {
auto f_i = r.read_big_u32();
if (f_i > atoms_.size()) {
throw err::BeamLoad("expt: atom index too big");
}
auto f = vm_.to_atom(atom_tab_index_to_str(f_i));
auto arity = r.read_big_u32();
auto label = r.read_big_u32();
exp_indexes_.insert(FunArity(f, arity), LabelIndex(label));
}
r0.advance_align<4>(chunk_size);
}
void BeamLoader::load_import_table(tool::Reader& r0) {
auto chunk_size = r0.read_big_u32();
tool::Reader r = r0.clone(chunk_size);
auto count = r.read_big_u32();
// Read triplets u32 module_atom_id; u32 method_atom_id; u32 arity
imports_.reserve(count);
for (Word i = 0; i < count; ++i) {
Str ms = atom_tab_index_to_str(r.read_big_u32());
Str fs = atom_tab_index_to_str(r.read_big_u32());
Term m = vm_.to_atom(ms);
Term f = vm_.to_atom(fs);
Word arity = r.read_big_u32();
imports_.push_back(MFArity(m, f, arity));
}
r0.advance_align<4>(chunk_size);
}
void BeamLoader::load_code(tool::Reader& r0) {
auto chunk_size = r0.read_big_u32();
tool::Reader r = r0.clone(chunk_size);
/*auto info_size =*/r.read_big_u32(); //=16
code_ver_ = r.read_big_u32();
if (code_ver_ != 0) {
throw err::BeamLoad("opcode set version");
}
code_opcode_max = r.read_big_u32();
code_label_count_ = r.read_big_u32();
code_fun_count_ = r.read_big_u32();
if (feature_line_numbers) {
linenums_.fun_code_map.reserve(code_fun_count_);
}
// Just read code here, parse later
code_ = ArrayView<const Uint8>(r.get_ptr(), chunk_size);
r0.advance_align<4>(chunk_size);
}
void BeamLoader::load_literal_table(tool::Reader& r0) {
auto chunk_size = r0.read_big_u32();
tool::Reader r1 = r0.clone(chunk_size);
auto uncompressed_size = r1.read_big_u32();
Term compressed = Term::make_binary(vm_, heap_, chunk_size);
r1.read_bytes(compressed.binary_get<Uint8>(), chunk_size);
Term uncompressed = Term::make_binary(vm_, heap_, uncompressed_size);
auto result =
mz_uncompress(uncompressed.binary_get<Uint8>(), &uncompressed_size,
compressed.binary_get<Uint8>(), chunk_size);
if (result != MZ_OK) {
throw err::BeamLoad("beam LitT error");
}
tool::Reader r(ArrayView<const Uint8>(uncompressed.binary_get<Uint8>(),
uncompressed_size));
auto count = r.read_big_u32();
literals_.reserve(count);
for (Word i = 0; i < count; ++i) {
/*auto lit_sz =*/r.read_big_u32();
auto lit = etf::read_ext_term_with_marker(vm_, heap_, r);
literals_.push_back(lit);
}
r0.advance_align<4>(chunk_size);
}
void BeamLoader::load_labels(tool::Reader& r0) {
auto chunk_size = r0.read_big_u32();
r0.advance_align<4>(chunk_size);
}
void BeamLoader::load_line_table(tool::Reader& r0) {
auto chunk_size = r0.read_big_u32();
if (!feature_line_numbers) {
r0.advance_align<4>(chunk_size);
return;
}
tool::Reader r = r0.clone(chunk_size);
// u32 table_version=0
if (r.read_big_u32() != 0) {
// Wrong version. Silently ignore the line number chunk.
throw err::BeamLoad("bad line info ver");
}
r.advance(4); // flags, ignore
Word line_instr_count = r.read_big_u32();
linenums_.line_instr.reserve(line_instr_count);
linenums_.num_line_refs = r.read_big_u32();
linenums_.num_filenames = r.read_big_u32();
// line_record[] (1-base index)
// invalid location goes as index 0
linenums_.line_refs.push_back(line::invalid_location);
Word fname_index = 0;
// First elements of ref table contain only offsets assuming they are for
// file #0
for (Word i = 0; i < linenums_.num_line_refs; ++i) {
Term val = parse_term(r);
if (val.is_small()) {
// We've got an offset for current filename
Word offs = val.small_word();
if (G_LIKELY(line::is_valid_loc(fname_index, offs))) {
linenums_.line_refs.push_back(
line::make_location(fname_index, offs));
// Std::fmt("line info: offs=" FMT_UWORD " f=" FMT_UWORD "\n",
// offs,
// fname_index);
} else {
linenums_.line_refs.push_back(line::invalid_location);
libc::fmt("line info: invalid loc\n");
}
} else if (val.is_atom()) {
// reference to another file
Word a_id = val.atom_val();
if (a_id > linenums_.num_filenames) {
throw err::BeamLoad("line info: bad file index");
}
fname_index = a_id;
}
}
// filenames[] = u16 length + characters
for (Word i = 0; i < linenums_.num_filenames; ++i) {
Word name_sz = r.read_big_u16();
Str name = r.read_string(name_sz);
libc::fmt("line info: file %s\n", name.c_str());
linenums_.filenames.push_back(vm_.to_atom(name));
}
r0.advance_align<4>(chunk_size);
}
Term BeamLoader::parse_term(tool::Reader& r) {
Uint8 first = r.read_byte();
TermTag tag = peek_tag(first);
//
// Base tagged values (int, literal, atom, label, register, character)
//
if (is_base_tag(tag)) {
auto int_overflow = parse_small_int(r, first);
G_ASSERT(int_overflow.second == false); // assert there's no overflow
// TODO: on overflow read bigint or something
Word val = (Word)int_overflow.first;
switch (tag) {
case TermTag::Integer:
case TermTag::Literal: {
return Term::make_small((SWord)val);
}
case TermTag::Atom: {
if (val == 0) {
return the_nil;
} else if (val >
atoms_.size()) { // we will subtract 1 when indexing
throw err::BeamLoad("bad atom index");
}
return vm_.to_atom(atom_tab_index_to_str(val));
}
case TermTag::Label: {
if (val == 0) {
return the_non_value; // Tag::NoLabel; // empty destination
} else if (val >= code_label_count_) {
throw err::BeamLoad("bad label");
}
// special value to be recognized by label resolver
return Term::make_catch(val);
}
case TermTag::XRegister: {
if (val >= erts::max_regs) {
throw err::BeamLoad("invalid x register");
}
return Term::make_regx(val);
}
case TermTag::YRegister: {
if (val >= erts::max_stack) {
throw err::BeamLoad("invalid y register");
}
return Term::make_regy(val);
}
case TermTag::Character: {
if (val > 65535) {
throw err::BeamLoad("invalid character range");
}
return Term::make_small_u(val);
}
case TermTag::Extended:
case TermTag::Extended_Base:
case TermTag::Extended_List:
case TermTag::Extended_FloatRegister:
case TermTag::Extended_Literal:
case TermTag::Extended_AllocList:
throw err::BeamLoad("bad tag");
} // end switch tag (Base tags)
} else
// ---- END BASE TAGS --- BEGIN EXTENDED ---
//
if (tag == TermTag::Extended_Float) {
return parse_float(r);
} else if (tag == TermTag::Extended_List) {
auto psi = parse_small_int(r, r.read_byte());
G_ASSERT(psi.second == false); // assert no overflow
Word length = (Word)psi.first;
length /= 2;
term::TupleBuilder tb(heap_, length * 2);
for (Word i = 0; i < length; ++i) {
Term base = parse_term(r);
tb.add(base);
auto label = parse_small_int(r, r.read_byte());
G_ASSERT(label.second == false); // assert no overflow
tb.add(Term::make_small(label.first));
}
Term result = tb.make_tuple();
// replace label numbers with pointers when loading finished
resolve_selectlists_.push_back(result);
return result;
} else if (tag == TermTag::Extended_FloatRegister) {
#if FEATURE_FLOAT
// pc, val = self._parse_floatreg(pc)
// args.append((tag, val))
gt_result = get_tag_and_value(r, tag, val);
G_RETURN_REWRAP_IF_ERROR_UNLIKELY(gt_result, Term);
if (tag != Tag::Literal) {
return error<Term>("fpreg: literal tag expected");
}
type = Tag::L;
break;
#else
throw err::FeatureMissing("FLOAT");
#endif
} else if (tag == TermTag::Extended_AllocList) {
return parse_alloclist(r);
} else if (tag == TermTag::Extended_Literal) {
Word val1 = parse_int_term(r, r.read_byte()).small_word();
if (val1 >= literals_.size()) {
throw err::BeamLoad("bad literal index");
}
return literals_[val1];
}
throw err::BeamLoad("bad extended tag");
}
// TODO: return reader as arg here, parse tag and value at once, while reading
// more
BeamLoader::TermTag BeamLoader::peek_tag(Uint8 value) {
if ((Word)(value & 0x7) == (Word)TermTag::Extended) {
Word result = ((Word)value >> 4) + (Word)TermTag::Extended_Base;
return (TermTag)result;
}
return (TermTag)(value & 0x7);
}
Term BeamLoader::parse_int_term(tool::Reader& r, Uint8 first) {
TermTag tag = peek_tag(first);
G_ASSERT(tag < TermTag::Extended_Base);
return create_int_term(r, first);
}
Term BeamLoader::create_int_term(tool::Reader& r, Uint8 tag) {
if (tag & 0x08) { // xxxx1xxx
if (tag & 0x10) { // xxx11xxx - extended
if ((tag & 0xe0) == 0xe0) { // length encoded in the tag
auto tmp = parse_small_int(r, tag);
G_ASSERT(tmp.second == false); // assert no overflow
auto length = tmp.first + (tag >> 5) + 2;
return parse_bigint(r, length);
} else {
return parse_bigint(r, 2 + (tag >> 5));
}
} else {
auto w = r.read_byte();
Term result = Term::make_small(((SWord)(tag & 0xe0) << 3) | w);
return result;
}
} else {
return Term::make_small(tag >> 4);
}
}
Pair<SWord, bool> BeamLoader::parse_small_int(tool::Reader& r, Uint8 first) {
TermTag tag = peek_tag(first);
G_ASSERT(tag < TermTag::Extended_Base);
return parse_create_small_int(r, first);
}
// Returns pair<result, overflow>
Pair<SWord, bool> BeamLoader::read_signed_word(tool::Reader& r, Word count) {
if (count == sizeof(Word) + 1) {
// The encoded value has one more byte than an size_t. It will still fit
// in an size_t if the most significant byte is 0.
Uint8 msb = r.read_byte();
SWord result = r.read_big_s(4);
return std::make_pair(result,
msb == 0); // caller decides if overflow is ok
}
if (count == sizeof(Word)) {
// The value must be positive (or the encoded value would have been
// one byte longer)
return std::make_pair(r.read_big_s(4), false);
}
if (count < sizeof(Word)) {
// If the sign bit is set, the value is negative (not allowed).
bool overflow = (r.peek_byte() & ((size_t)1 << (count * 8 - 1)));
return std::make_pair(r.read_big_s(count), overflow);
}
throw err::TODO("oops");
}
Pair<SWord, bool> BeamLoader::parse_create_small_int(tool::Reader& r,
Uint8 tag) {
if (tag & 0x08) { // xxxx1xxx
if (tag & 0x10) { // xxx11xxx - extended
Word len_code = tag >> 5;
if (len_code < 7) {
Word count = len_code + 2;
G_ASSERT(count <= sizeof(Word));
return read_signed_word(r, count);
}
// Read int which will encode length - we skip it here, it is too
// big
// G_FAIL("smallint too big");
return std::make_pair(0L, true);
} else {
auto w = r.read_byte();
return std::make_pair(((SWord)(tag & 0xe0) << 3) | w, false);
}
}
return std::make_pair(tag >> 4, false);
}
Term BeamLoader::parse_bigint(tool::Reader&, Word) {
#if FEATURE_BIGNUM
#error "todo load bignum from reader"
#else
throw err::FeatureMissing("BIGINT");
#endif
}
Term BeamLoader::parse_float(tool::Reader&) {
#if FEATURE_FLOAT
#error "todo load float from reader"
#else
throw err::FeatureMissing("FLOAT");
#endif
}
Term BeamLoader::parse_alloclist(tool::Reader& r) {
#if 0
Word n;
Word type1;
Word val1;
Word words = 0;
gt_result = get_tag_and_value(r, tag, n);
G_RETURN_REWRAP_IF_ERROR_UNLIKELY(gt_result, Term);
if (tag != Tag::Literal) {
return error<Term>("a_list: literal tag expected");
}
while (n-- > 0) {
gt_result = get_tag_and_value(r, tag, type1);
if (tag != Tag::Literal) {
return error<Term>("a_list: literal tag expected");
}
gt_result = get_tag_and_value(r, tag, val1);
if (tag != Tag::Literal) {
return error<Term>("a_list: literal tag expected");
}
switch (type1) {
case 0: // Heap words
words += val1;
break;
case 1:
#if FEATURE_FLOAT
words += FLOAT_SIZE_OBJECT * val;
break;
#else
return error<Term>("FEATURE_FLOAT");
#endif
default:
return error<Term>("a_list: bad allocation descr");
}
}
type = Tag::Literal;
val = words;
#endif
throw err::TODO("alloc list?");
}
} // ns gluon