/
main.c
1054 lines (850 loc) · 33.3 KB
/
main.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
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
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
Copyright (C) 2005-2014, Parrot Foundation.
=head1 NAME
pbc_merge - Merge multiple Parrot bytecode (PBC) files into
a single PBC file.
=head1 SYNOPSIS
pbc_merge -o out.pbc input1.pbc input2.pbc ...
=head1 DESCRIPTION
This program takes two or more PBC files and produces a single
merged output PBC file with a single fix-up table and constants
table.
=head2 Command-Line Options
=over 4
=item C<-o out.pbc>
The name of the PBC file to produce, containing the merged
segments from the input PBC files.
=item C<-?> or C<--help>
=back
=head2 Functions
=over 4
=cut
*/
#define PARROT_IN_EXTENSION
#include "parrot/parrot.h"
#include "parrot/longopt.h"
#include "parrot/oplib/ops.h"
#include "parrot/oplib/core_ops.h"
#include "pmc/pmc_sub.h"
extern const unsigned char * Parrot_get_config_hash_bytes(void);
extern int Parrot_get_config_hash_length(void);
/* This struct describes an input file. */
typedef struct pbc_merge_input {
const char *filename; /* name of the input file */
PackFile *pf; /* loaded packfile struct */
opcode_t code_start; /* where the bytecode is located in the merged
packfile */
struct {
opcode_t const_start; /* where the const table is located within the
merged table */
opcode_t *const_map; /* map constants from input files to their location
in the output file */
} num, str, pmc;
} pbc_merge_input;
/* HEADERIZER HFILE: none */
/* HEADERIZER BEGIN: static */
/* Don't modify between HEADERIZER BEGIN / HEADERIZER END. Your changes will be lost. */
static void ensure_libdep(PARROT_INTERP,
ARGMOD(PackFile_ByteCode *bc),
ARGIN(STRING *lib))
__attribute__nonnull__(1)
__attribute__nonnull__(2)
__attribute__nonnull__(3)
FUNC_MODIFIES(*bc);
PARROT_DOES_NOT_RETURN
static void help(void);
static void pbc_fixup_bytecode(PARROT_INTERP,
ARGMOD(pbc_merge_input **inputs),
int num_inputs,
ARGMOD(PackFile_ByteCode *bc))
__attribute__nonnull__(1)
__attribute__nonnull__(2)
__attribute__nonnull__(4)
FUNC_MODIFIES(*inputs)
FUNC_MODIFIES(*bc);
static void pbc_fixup_constants(PARROT_INTERP,
ARGMOD(pbc_merge_input **inputs),
int num_inputs)
__attribute__nonnull__(1)
__attribute__nonnull__(2)
FUNC_MODIFIES(*inputs);
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
static PackFile_Annotations* pbc_merge_annotations(PARROT_INTERP,
ARGMOD(pbc_merge_input **inputs),
int num_inputs,
ARGMOD(PackFile *pf),
ARGMOD(PackFile_ByteCode *bc))
__attribute__nonnull__(1)
__attribute__nonnull__(2)
__attribute__nonnull__(4)
__attribute__nonnull__(5)
FUNC_MODIFIES(*inputs)
FUNC_MODIFIES(*pf)
FUNC_MODIFIES(*bc);
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
static PackFile* pbc_merge_begin(PARROT_INTERP,
ARGMOD(pbc_merge_input **inputs),
int num_inputs)
__attribute__nonnull__(1)
__attribute__nonnull__(2)
FUNC_MODIFIES(*inputs);
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
static PackFile_ByteCode* pbc_merge_bytecode(PARROT_INTERP,
ARGMOD(pbc_merge_input **inputs),
int num_inputs,
ARGMOD(PackFile *pf))
__attribute__nonnull__(1)
__attribute__nonnull__(2)
__attribute__nonnull__(4)
FUNC_MODIFIES(*inputs)
FUNC_MODIFIES(*pf);
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
static PackFile_ConstTable* pbc_merge_constants(PARROT_INTERP,
ARGMOD(pbc_merge_input **inputs),
int num_inputs,
ARGMOD(PackFile *pf))
__attribute__nonnull__(1)
__attribute__nonnull__(2)
__attribute__nonnull__(4)
FUNC_MODIFIES(*inputs)
FUNC_MODIFIES(*pf);
static void pbc_merge_debugs(PARROT_INTERP,
ARGMOD(pbc_merge_input **inputs),
int num_inputs,
ARGMOD(PackFile_ByteCode *bc))
__attribute__nonnull__(1)
__attribute__nonnull__(2)
__attribute__nonnull__(4)
FUNC_MODIFIES(*inputs)
FUNC_MODIFIES(*bc);
static void pbc_merge_write(PARROT_INTERP,
ARGMOD(PackFile *pf),
ARGIN(const char *filename))
__attribute__nonnull__(1)
__attribute__nonnull__(2)
__attribute__nonnull__(3)
FUNC_MODIFIES(*pf);
#define ASSERT_ARGS_ensure_libdep __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp) \
, PARROT_ASSERT_ARG(bc) \
, PARROT_ASSERT_ARG(lib))
#define ASSERT_ARGS_help __attribute__unused__ int _ASSERT_ARGS_CHECK = (0)
#define ASSERT_ARGS_pbc_fixup_bytecode __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp) \
, PARROT_ASSERT_ARG(inputs) \
, PARROT_ASSERT_ARG(bc))
#define ASSERT_ARGS_pbc_fixup_constants __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp) \
, PARROT_ASSERT_ARG(inputs))
#define ASSERT_ARGS_pbc_merge_annotations __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp) \
, PARROT_ASSERT_ARG(inputs) \
, PARROT_ASSERT_ARG(pf) \
, PARROT_ASSERT_ARG(bc))
#define ASSERT_ARGS_pbc_merge_begin __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp) \
, PARROT_ASSERT_ARG(inputs))
#define ASSERT_ARGS_pbc_merge_bytecode __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp) \
, PARROT_ASSERT_ARG(inputs) \
, PARROT_ASSERT_ARG(pf))
#define ASSERT_ARGS_pbc_merge_constants __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp) \
, PARROT_ASSERT_ARG(inputs) \
, PARROT_ASSERT_ARG(pf))
#define ASSERT_ARGS_pbc_merge_debugs __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp) \
, PARROT_ASSERT_ARG(inputs) \
, PARROT_ASSERT_ARG(bc))
#define ASSERT_ARGS_pbc_merge_write __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp) \
, PARROT_ASSERT_ARG(pf) \
, PARROT_ASSERT_ARG(filename))
/* Don't modify between HEADERIZER BEGIN / HEADERIZER END. Your changes will be lost. */
/* HEADERIZER END: static */
/*
=item C<static void help(void)>
Prints usage info.
=cut
*/
PARROT_DOES_NOT_RETURN
static void
help(void)
{
printf("pbc_merge - merge multiple parrot bytecode files into one\n");
printf("Usage:\n");
printf(" pbc_merge -o out.pbc file1.pbc file2.pbc ...\n\n");
exit(0);
}
/*
=item C<static void ensure_libdep(PARROT_INTERP, PackFile_ByteCode *bc, STRING
*lib)>
Ensures that the libdep C<lib> is in the libdeps list for C<bc>.
=cut
*/
static void
ensure_libdep(PARROT_INTERP, ARGMOD(PackFile_ByteCode *bc), ARGIN(STRING *lib))
{
ASSERT_ARGS(ensure_libdep)
size_t i;
for (i = 0; i < bc->n_libdeps; i++) {
if (Parrot_str_equal(interp, bc->libdeps[i], lib)) {
return;
}
}
/* not found, add to libdeps list */
bc->libdeps = mem_gc_realloc_n_typed_zeroed(interp, bc->libdeps, bc->n_libdeps + 1,
bc->n_libdeps, STRING *);
bc->libdeps[bc->n_libdeps] = lib;
bc->n_libdeps++;
}
/*
=item C<static PackFile_ByteCode* pbc_merge_bytecode(PARROT_INTERP,
pbc_merge_input **inputs, int num_inputs, PackFile *pf)>
This function merges the bytecode from the input packfiles, storing the
offsets that each bit of bytecode now exists at.
=cut
*/
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
static PackFile_ByteCode*
pbc_merge_bytecode(PARROT_INTERP, ARGMOD(pbc_merge_input **inputs),
int num_inputs, ARGMOD(PackFile *pf))
{
ASSERT_ARGS(pbc_merge_bytecode)
int i;
size_t j;
opcode_t *bc = mem_gc_allocate_typed(interp, opcode_t);
opcode_t cursor = 0;
/* Add a bytecode segment. */
PackFile_ByteCode * const bc_seg =
(PackFile_ByteCode *)Parrot_pf_new_segment(interp,
&pf->directory, PF_BYTEC_SEG, BYTE_CODE_SEGMENT_NAME, 1);
if (!bc_seg) {
Parrot_io_eprintf(interp, "PBC Merge: Can not create bytecode segment");
exit(1);
}
/* Loop over input files. */
for (i = 0; i < num_inputs; ++i) {
/* Get the bytecode segment from the input file. */
PackFile_ByteCode * const in_seg = inputs[i]->pf->cur_cs;
if (in_seg == NULL) {
Parrot_io_eprintf(interp,
"PBC Merge: Cannot locate bytecode segment in %s",
inputs[i]->filename);
exit(1);
}
/* Re-allocate the current buffer. */
bc = mem_gc_realloc_n_typed(interp, bc, cursor + in_seg->base.size, opcode_t);
/* Copy data and store cursor. */
memcpy(bc + cursor, in_seg->base.data,
in_seg->base.size * sizeof (opcode_t));
inputs[i]->code_start = cursor;
/* Update cursor. */
cursor += in_seg->base.size;
/* Update libdeps. */
for (j = 0; j < in_seg->n_libdeps; j++)
ensure_libdep(interp, bc_seg, in_seg->libdeps[j]);
/* Update main_sub. */
if (in_seg->main_sub >= 0) {
if (bc_seg->main_sub < 0)
bc_seg->main_sub = in_seg->main_sub + inputs[i]->pmc.const_start;
/*
XXX hide incessant warning messages triggered by implicit :main
this can be added when GH #571 is implemented
else
Parrot_io_eprintf(interp,
"PBC Merge: multiple :main subs encountered, using first "
"and ignoring sub found in `%s'",
inputs[i]->filename);
*/
}
}
/* Stash produced bytecode. */
bc_seg->base.data = bc;
bc_seg->base.size = cursor;
bc_seg->base.name = Parrot_str_new_constant(interp, "MERGED");
return bc_seg;
}
/*
=item C<static PackFile_ConstTable* pbc_merge_constants(PARROT_INTERP,
pbc_merge_input **inputs, int num_inputs, PackFile *pf)>
This function merges the constants tables from the input PBC files.
=cut
*/
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
static PackFile_ConstTable*
pbc_merge_constants(PARROT_INTERP, ARGMOD(pbc_merge_input **inputs),
int num_inputs, ARGMOD(PackFile *pf))
{
ASSERT_ARGS(pbc_merge_constants)
/* STRING -> idx mapping for all strings */
Hash *all_seen_strings = Parrot_hash_create(interp, enum_type_INTVAL,
Hash_key_type_STRING);
FLOATVAL *num_constants = mem_gc_allocate_typed(interp, FLOATVAL);
STRING **str_constants = mem_gc_allocate_typed(interp, STRING *);
PMC **pmc_constants = mem_gc_allocate_typed(interp, PMC *);
opcode_t num_cursor = 0;
opcode_t str_cursor = 0;
opcode_t pmc_cursor = 0;
opcode_t tag_cursor = 0;
int i;
/* Add a constant table segment. */
PackFile_ConstTable * const const_seg = (PackFile_ConstTable *)
Parrot_pf_new_segment(interp, &pf->directory,
PF_CONST_SEG, CONSTANT_SEGMENT_NAME, 1);
if (const_seg == NULL) {
Parrot_io_eprintf(interp,
"PBC Merge: Error creating constant table segment.");
exit(1);
}
/* Loop over input files. */
for (i = 0; i < num_inputs; ++i) {
/* opcode_t pmc_cursor_start = pmc_cursor; */
int j;
/* Get the constant table segment from the input file. */
PackFile_ConstTable * const in_seg = inputs[i]->pf->cur_cs->const_table;
if (in_seg == NULL) {
Parrot_io_eprintf(interp,
"PBC Merge: Cannot locate constant table segment in %s\n",
inputs[i]->filename);
exit(1);
}
/* Store cursor as position where constant table starts. */
inputs[i]->num.const_start = num_cursor;
inputs[i]->str.const_start = str_cursor;
inputs[i]->pmc.const_start = pmc_cursor;
/* Allocate space for the constant list, provided we have some. */
if (in_seg->num.const_count > 0)
num_constants = mem_gc_realloc_n_typed(interp, num_constants,
num_cursor + in_seg->num.const_count, FLOATVAL);
if (in_seg->pmc.const_count > 0)
pmc_constants = mem_gc_realloc_n_typed(interp, pmc_constants,
pmc_cursor + in_seg->pmc.const_count, PMC *);
/* Allocate enough space for all strings, even though de-duplication
may mean some slots are not filled */
if (in_seg->str.const_count > 0)
str_constants = mem_gc_realloc_n_typed(interp, str_constants,
str_cursor + in_seg->str.const_count, STRING *);
/* Loop over the constants and copy them to the output PBC. */
for (j = 0; j < in_seg->num.const_count; j++) {
num_constants[num_cursor] = in_seg->num.constants[j];
inputs[i]->num.const_map[j] = num_cursor;
num_cursor++;
}
for (j = 0; j < in_seg->str.const_count; j++) {
STRING * const str = in_seg->str.constants[j];
if (Parrot_hash_exists(interp, all_seen_strings, str)) {
opcode_t new_idx = (opcode_t)Parrot_hash_get(interp, all_seen_strings, str);
inputs[i]->str.const_map[j] = new_idx;
continue;
}
str_constants[str_cursor] = str;
Parrot_hash_put(interp, all_seen_strings, str, (void *)str_cursor);
inputs[i]->str.const_map[j] = str_cursor;
str_cursor++;
}
for (j = 0; j < in_seg->pmc.const_count; j++) {
pmc_constants[pmc_cursor] = in_seg->pmc.constants[j];
inputs[i]->pmc.const_map[j] = pmc_cursor;
pmc_cursor++;
}
/* Update the pointers and counts here, so we have that information when
we add tags*/
const_seg->num.const_count = num_cursor;
const_seg->num.constants = num_constants;
const_seg->str.const_count = str_cursor;
const_seg->str.constants = str_constants;
const_seg->pmc.const_count = pmc_cursor;
const_seg->pmc.constants = pmc_constants;
/* Loop over the tags, inserting tags into the tag_map, keeping them
ordered by tag name */
for (j = 0; j < in_seg->ntags; j++) {
opcode_t old_tag_idx = in_seg->tag_map[j].tag_idx;
opcode_t new_tag_idx = inputs[i]->str.const_map[old_tag_idx];
opcode_t old_pmc_idx = in_seg->tag_map[j].const_idx;
opcode_t new_pmc_idx = inputs[i]->pmc.const_map[old_pmc_idx];
/*
Parrot_io_eprintf(interp,
"\nmerging tag [%d->%d '%S','%S'] = %d->%d\n",
old_tag_idx,
new_tag_idx,
in_seg->str.constants[old_tag_idx],
str_constants[new_tag_idx],
in_seg->tag_map[j].const_idx,
in_seg->tag_map[j].const_idx + pmc_cursor_start);
*/
Parrot_pf_tag_constant(interp, const_seg, new_tag_idx, new_pmc_idx);
tag_cursor++;
}
}
/* Return the merged segment */
return const_seg;
}
/*
=item C<static PackFile_Annotations* pbc_merge_annotations(PARROT_INTERP,
pbc_merge_input **inputs, int num_inputs, PackFile *pf, PackFile_ByteCode *bc)>
Merge Annotations segments from C<inputs> into a new C<PackFile_Annotations>
segment. Returns the new merged segment (which is also already appended to
the directory in C<pf>).
=cut
*/
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
static PackFile_Annotations*
pbc_merge_annotations(PARROT_INTERP, ARGMOD(pbc_merge_input **inputs),
int num_inputs, ARGMOD(PackFile *pf), ARGMOD(PackFile_ByteCode *bc))
{
ASSERT_ARGS(pbc_merge_annotations)
int i;
PackFile_Annotations * const merged = Parrot_pf_get_annotations_segment(interp, pf, bc);
int key_cursor = 0;
for (i = 0; i < num_inputs; i++) {
PackFile_ByteCode * const in_bc = inputs[i]->pf->cur_cs;
PackFile_Annotations * const in_ann =
Parrot_pf_get_annotations_segment(interp, inputs[i]->pf, in_bc);
int j;
for (j = 0; j < in_ann->num_keys; j++) {
const opcode_t old_name_idx = in_ann->keys[j].name;
const opcode_t old_len = in_ann->keys[j].len;
const opcode_t old_start = in_ann->keys[j].start;
const opcode_t new_key = inputs[i]->str.const_map[old_name_idx];
int k;
for (k = 0; k < old_len; k++) {
const opcode_t idx = (old_start + k) * 2;
const opcode_t old_offset = in_ann->base.data[idx];
const opcode_t old_value = in_ann->base.data[idx + 1];
opcode_t new_value;
switch (in_ann->keys[j].type) {
case PF_ANNOTATION_KEY_TYPE_INT:
new_value = old_value;
break;
case PF_ANNOTATION_KEY_TYPE_STR:
new_value = inputs[i]->str.const_map[old_value];
break;
case PF_ANNOTATION_KEY_TYPE_PMC:
new_value = inputs[i]->pmc.const_map[old_value];
break;
default:
Parrot_io_eprintf(interp, "Wrong annotation type %d",
in_ann->keys[j].type);
exit(1);
}
Parrot_pf_annotations_add_entry(interp, merged,
old_offset + inputs[i]->code_start,
new_key,
in_ann->keys[j].type,
new_value);
}
key_cursor++;
}
}
return merged;
}
/*
=item C<static void pbc_merge_debugs(PARROT_INTERP, pbc_merge_input **inputs,
int num_inputs, PackFile_ByteCode *bc)>
This function merges the debug segments from the input PBC files.
=cut
*/
static void
pbc_merge_debugs(PARROT_INTERP, ARGMOD(pbc_merge_input **inputs),
int num_inputs, ARGMOD(PackFile_ByteCode *bc))
{
ASSERT_ARGS(pbc_merge_debugs)
PackFile_Debug *debug_seg;
opcode_t *lines = mem_gc_allocate_typed(interp,
opcode_t);
PackFile_DebugFilenameMapping *mappings =
mem_gc_allocate_typed(interp, PackFile_DebugFilenameMapping);
opcode_t num_mappings = 0;
opcode_t num_lines = 0;
int i;
/* We need to merge both the mappings and the list of line numbers.
The line numbers can just be concatenated. The mappings must have
their offsets fixed up. */
for (i = 0; i < num_inputs; ++i) {
const PackFile_Debug * const in_seg = inputs[i]->pf->cur_cs->debugs;
int j;
/* Concatenate line numbers. */
lines = mem_gc_realloc_n_typed(interp, lines,
num_lines + in_seg->base.size, opcode_t);
memcpy(lines + num_lines, in_seg->base.data,
in_seg->base.size * sizeof (opcode_t));
/* Concatenate mappings. */
mappings = mem_gc_realloc_n_typed(interp, mappings,
num_mappings + in_seg->num_mappings,
PackFile_DebugFilenameMapping);
for (j = 0; j < in_seg->num_mappings; ++j) {
PackFile_DebugFilenameMapping *mapping = mappings + num_mappings + j;
STRUCT_COPY_FROM_STRUCT(mapping, in_seg->mappings[j]);
mapping->offset += num_lines;
mapping->filename = inputs[i]->str.const_map[mapping->filename];
}
num_lines += in_seg->base.size - 1;
num_mappings += in_seg->num_mappings;
}
/* Create merged debug segment. Replace created data and mappings
with merged ones we have created. */
debug_seg = Parrot_pf_new_debug_segment(interp, bc, num_lines);
mem_gc_free(interp, debug_seg->base.data);
debug_seg->base.data = lines;
mem_gc_free(interp, debug_seg->mappings);
debug_seg->mappings = mappings;
debug_seg->num_mappings = num_mappings;
}
static opcode_t
bytecode_remap_op(PARROT_INTERP, PackFile *pf, opcode_t op) {
int i;
op_info_t *info = pf->cur_cs->op_info_table[op];
op_lib_t *lib = info->lib;
op_func_t op_func = pf->cur_cs->op_func_table[op];
PackFile_ByteCode *bc = interp->code;
PackFile_ByteCode_OpMappingEntry *om;
for (i = 0; i < bc->op_mapping.n_libs; i++) {
if (lib == bc->op_mapping.libs[i].lib) {
om = &bc->op_mapping.libs[i];
goto found_lib;
}
}
/* library not yet mapped */
bc->op_mapping.n_libs++;
bc->op_mapping.libs = mem_gc_realloc_n_typed_zeroed(interp, bc->op_mapping.libs,
bc->op_mapping.n_libs, bc->op_mapping.n_libs - 1,
PackFile_ByteCode_OpMappingEntry);
/* initialize a new lib entry */
om = &bc->op_mapping.libs[bc->op_mapping.n_libs - 1];
om->lib = lib;
om->n_ops = 0;
om->lib_ops = mem_gc_allocate_n_zeroed_typed(interp, 0, opcode_t);
om->table_ops = mem_gc_allocate_n_zeroed_typed(interp, 0, opcode_t);
found_lib:
for (i = 0; i < om->n_ops; i++) {
if (bc->op_func_table[om->table_ops[i]] == op_func)
return om->table_ops[i];
}
/* op not yet mapped */
bc->op_count++;
bc->op_func_table =
mem_gc_realloc_n_typed_zeroed(interp, bc->op_func_table, bc->op_count, bc->op_count - 1,
op_func_t);
bc->op_func_table[bc->op_count - 1] = op_func;
bc->op_info_table =
mem_gc_realloc_n_typed_zeroed(interp, bc->op_info_table, bc->op_count, bc->op_count - 1,
op_info_t *);
bc->op_info_table[bc->op_count - 1] = info;
/* initialize new op mapping */
om->n_ops++;
om->lib_ops =
mem_gc_realloc_n_typed_zeroed(interp, om->lib_ops, om->n_ops, om->n_ops - 1, opcode_t);
for (i = 0; i < lib->op_count; i++) {
if (lib->op_func_table[i] == op_func) {
om->lib_ops[om->n_ops - 1] = i;
break;
}
}
PARROT_ASSERT(om->lib_ops[om->n_ops - 1] || !i);
om->table_ops =
mem_gc_realloc_n_typed_zeroed(interp, om->table_ops, om->n_ops, om->n_ops - 1, opcode_t);
om->table_ops[om->n_ops - 1] = bc->op_count - 1;
return bc->op_count - 1;
}
/*
=item C<static void pbc_fixup_bytecode(PARROT_INTERP, pbc_merge_input **inputs,
int num_inputs, PackFile_ByteCode *bc)>
Fixup bytecode. This includes correcting pointers into the constant table
and updating the ops mapping.
=cut
*/
static void
pbc_fixup_bytecode(PARROT_INTERP, ARGMOD(pbc_merge_input **inputs),
int num_inputs, ARGMOD(PackFile_ByteCode *bc))
{
ASSERT_ARGS(pbc_fixup_bytecode)
opcode_t *ops = bc->base.data;
opcode_t cur_op = 0;
int cur_input = 0;
op_lib_t *core_ops = PARROT_GET_CORE_OPLIB(interp);
/* Loop over the ops in the merged bytecode. */
while (cur_op < (opcode_t)bc->base.size) {
op_info_t *op;
opcode_t op_num;
op_func_t op_func;
opcode_t *op_ptr;
int cur_arg;
/* Keep track of the current input file. */
if (cur_input + 1 < num_inputs &&
cur_op >= inputs[cur_input + 1]->code_start)
++cur_input;
/* Get info about this op, remap it, and jump over it. */
op_num = ops[cur_op] = bytecode_remap_op(interp, inputs[cur_input]->pf, ops[cur_op]);
op = bc->op_info_table[op_num];
op_ptr = ops + cur_op;
++cur_op;
/* Loop over the arguments. */
for (cur_arg = 1; cur_arg < op->op_count; ++cur_arg) {
/* Pick out any indexes into the constant table and correct them. */
switch (op->types[cur_arg - 1]) {
case PARROT_ARG_NC:
ops[cur_op] = inputs[cur_input]->num.const_map[ ops[cur_op] ];
break;
case PARROT_ARG_SC:
case PARROT_ARG_NAME_SC:
ops[cur_op] = inputs[cur_input]->str.const_map[ ops[cur_op] ];
break;
case PARROT_ARG_PC:
case PARROT_ARG_KC:
ops[cur_op] = inputs[cur_input]->pmc.const_map[ ops[cur_op] ];
break;
default:
break;
}
/* Move along the bytecode array. */
++cur_op;
}
/* Handle special case variable argument opcodes. */
op_func = interp->code->op_func_table[op_num];
if (op_func == core_ops->op_func_table[PARROT_OP_set_args_pc] ||
op_func == core_ops->op_func_table[PARROT_OP_get_results_pc] ||
op_func == core_ops->op_func_table[PARROT_OP_get_params_pc] ||
op_func == core_ops->op_func_table[PARROT_OP_set_returns_pc]) {
/* Get the signature. */
PMC * const sig = bc->const_table->pmc.constants[op_ptr[1]];
/* Loop over the arguments to locate any that need a fixup. */
const int sig_items = VTABLE_elements(interp, sig);
for (cur_arg = 0; cur_arg < sig_items; ++cur_arg) {
switch (VTABLE_get_integer_keyed_int(interp, sig, cur_arg)) {
case PARROT_ARG_NC:
ops[cur_op] = inputs[cur_input]->num.const_map[ ops[cur_op] ];
break;
case PARROT_ARG_SC:
case PARROT_ARG_NAME_SC:
ops[cur_op] = inputs[cur_input]->str.const_map[ ops[cur_op] ];
break;
case PARROT_ARG_PC:
case PARROT_ARG_KC:
ops[cur_op] = inputs[cur_input]->pmc.const_map[ ops[cur_op] ];
break;
default:
break;
}
++cur_op;
}
}
}
}
/*
=item C<static void pbc_fixup_constants(PARROT_INTERP, pbc_merge_input **inputs,
int num_inputs)>
Fixup constants. This includes correcting pointers into bytecode.
=cut
*/
static void
pbc_fixup_constants(PARROT_INTERP, ARGMOD(pbc_merge_input **inputs), int num_inputs)
{
ASSERT_ARGS(pbc_fixup_constants)
int i, j;
/* Loop over input files. */
for (i = 0; i < num_inputs; ++i) {
/* Get the constant table segment from the input file. */
PackFile_ConstTable * const in_seg = inputs[i]->pf->cur_cs->const_table;
for (j = 0; j < in_seg->pmc.const_count; j++) {
PMC * const v = in_seg->pmc.constants[j];
/* If it's a sub PMC, need to deal with offsets. */
switch (v->vtable->base_type) {
case enum_class_Sub:
case enum_class_Coroutine:
{
Parrot_Sub_attributes *sub;
PMC_get_sub(interp, v, sub);
sub->start_offs += inputs[i]->code_start;
sub->end_offs += inputs[i]->code_start;
}
break;
default:
break;
}
}
}
}
/*
=item C<static PackFile* pbc_merge_begin(PARROT_INTERP, pbc_merge_input
**inputs, int num_inputs)>
This is the function that drives PBC merging process.
=cut
*/
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
static PackFile*
pbc_merge_begin(PARROT_INTERP, ARGMOD(pbc_merge_input **inputs), int num_inputs)
{
ASSERT_ARGS(pbc_merge_begin)
PackFile_ByteCode *bc;
PackFile_ConstTable *ct;
PackFile_Annotations *at;
int i;
/* Create a new empty packfile. */
PackFile * const merged = Parrot_pf_new(interp, 0);
if (merged == NULL) {
Parrot_io_eprintf(interp, "PBC Merge: Error creating new packfile.\n");
Parrot_x_exit(interp, 1);
}
/* calculate how many constants are stored in the packfiles to be merged */
for (i = 0; i < num_inputs; ++i) {
PackFile_Directory *pf_dir = &inputs[i]->pf->directory;
unsigned int j = 0;
for (j = 0; j < pf_dir->num_segments; ++j) {
const PackFile_Segment * const seg = pf_dir->segments[j];
if (seg->type == PF_CONST_SEG) {
const PackFile_ConstTable * const cct = (const PackFile_ConstTable *)seg;
inputs[i]->num.const_map = mem_gc_allocate_n_typed(interp, cct->num.const_count,
opcode_t);
inputs[i]->str.const_map = mem_gc_allocate_n_typed(interp, cct->str.const_count,
opcode_t);
inputs[i]->pmc.const_map = mem_gc_allocate_n_typed(interp, cct->pmc.const_count,
opcode_t);
}
}
}
/* Merge the various stuff. */
ct = pbc_merge_constants(interp, inputs, num_inputs, merged);
bc = pbc_merge_bytecode(interp, inputs, num_inputs, merged);
bc->const_table = ct;
ct->code = bc;
interp->code = bc;
at = pbc_merge_annotations(interp, inputs, num_inputs, merged, bc);
pbc_merge_debugs(interp, inputs, num_inputs, bc);
/* Walk bytecode and fix ops that reference the constants table. */
pbc_fixup_bytecode(interp, inputs, num_inputs, bc);
/* Walk constants and fix references into bytecode. */
pbc_fixup_constants(interp, inputs, num_inputs);
for (i = 0; i < num_inputs; ++i) {
mem_gc_free(interp, inputs[i]->num.const_map);
mem_gc_free(interp, inputs[i]->str.const_map);
mem_gc_free(interp, inputs[i]->pmc.const_map);
}
/* Return merged result. */
return merged;
}
/*
=item C<static void pbc_merge_write(PARROT_INTERP, PackFile *pf, const char
*filename)>
This functions writes out the merged packfile.
=cut
*/
static void
pbc_merge_write(PARROT_INTERP, ARGMOD(PackFile *pf), ARGIN(const char *filename))
{
ASSERT_ARGS(pbc_merge_write)
FILE *fp;
/* Get size of packfile we'll write. */
const size_t size = Parrot_pf_pack_size(interp, pf) * sizeof (opcode_t);
/* Allocate memory. */
opcode_t * const pack = (opcode_t*) Parrot_gc_allocate_memory_chunk(interp, size);
/* Write and clean up. */
Parrot_pf_pack(interp, pf, pack);
if ((fp = fopen(filename, "wb")) == 0) {
Parrot_io_eprintf(interp, "PBC Merge: Couldn't open %s\n", filename);
exit(1);
}
if ((1 != fwrite(pack, size, 1, fp))) {
Parrot_io_eprintf(interp, "PBC Merge: Couldn't write %s\n", filename);
exit(1);
}
fclose(fp);
mem_gc_free(interp, pack);
}
/*
=item C<int main(int argc, const char **argv)>
The main function checks arguments, reads in the packfiles provided they exist,
call the merge functions and writes out the produced packfile.
=cut
*/
static struct longopt_opt_decl options[] = {
{ 'o', 'o', OPTION_required_FLAG, { "--output" } },
{ '?', '?', OPTION_optional_FLAG, { "--help" } },
{ 0 , 0 , OPTION_optional_FLAG, { NULL } }
};
int
main(int argc, const char **argv)
{
int status;
pbc_merge_input** input_files;
PackFile *merged;
int i;
const char *output_file = NULL;
struct longopt_opt_info opt = LONGOPT_OPT_INFO_INIT;
Interp * const interp = Parrot_interp_new(NULL);
STRING * pbcname = NULL;
PMC * pbcpmc = NULL;
Parrot_block_GC_mark(interp);
/* Get options, ensuring we have at least one input
file and an output file. */
if (argc < 4)
help();
while ((status = Parrot_longopt_get(argc, argv, options, &opt)) > 0) {
switch (opt.opt_id) {
case 'o':
if (output_file == NULL)
output_file = opt.opt_arg;
else
help();
break;
case '?':
help();
break;
default:
break;
}
}
if (status == -1 || !output_file)
help();
argc -= opt.opt_index; /* Now the number of input files. */
argv += opt.opt_index; /* Now at first input filename. */
/* Load each packfile that we are to merge and set up an input