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
|
#include "mergepoints.h"
#include "vcompiler.h"
#include "stats.h"
#include "Python/pycinternal.h"
/* set to 1 to compute the detailed control flow
which allows for early variable deletion */
#define FULL_CONTROL_FLOW 1
#define DUMP_CONTROL_FLOW 0
/* the list of builtins whose usage should disable control flow
because they use the current frame's locals */
static char* NoControlFlowIfBuiltin[] = {
"eval", "execfile", "locals", "vars", "dir", "input",
NULL
};
#define CONFLUENCE_TOTAL_DELAY 3 /* see comments in the code */
#define INLINE_MAXIMUM_WEIGHT 6 /* see comments in the code */
/***************************************************************/
/*** Tables of code merge points ***/
/***************************************************************/
/* for each code object we build a bitarray specifying which
positions in the byte code are potential merge points.
A "merge point" is an instruction which can be executed
immediately after two or more other instructions,
typically jump targets.
The respawn mecanisms (see psyco_prepare_respawn()) require
that a merge point be also added after each instruction
whose produced machine code might depend on external data.
We should also avoid too long uninterrupted ranges of
instructions without a single merge point.
*/
/* instructions that cause an unconditional jump: */
#define IS_JUMP_INSTR(op) (op == BREAK_LOOP || \
op == RETURN_VALUE || \
op == JUMP_FORWARD || \
op == JUMP_ABSOLUTE || \
op == CONTINUE_LOOP || \
op == RAISE_VARARGS || \
IS_EPILOGUE_INSTR(op))
/* instructions with a target: */
#define HAS_JREL_INSTR(op) (op == JUMP_FORWARD || \
op == JUMP_IF_FALSE || \
op == JUMP_IF_TRUE || \
op == FOR_ITER || \
/* SETUP_LOOP replaced by FOR_ITER */ \
op == SETUP_EXCEPT || \
op == SETUP_FINALLY)
#define HAS_JABS_INSTR(op) (op == JUMP_ABSOLUTE || \
op == CONTINUE_LOOP)
/* instructions whose target may be jumped to several times: */
#define HAS_J_MULTIPLE(op) (op == FOR_ITER || \
/* SETUP_LOOP replaced by FOR_ITER */ \
op == SETUP_EXCEPT || \
op == SETUP_FINALLY)
/* instructions through which it is not safe to respawn:
LOAD_GLOBAL may produce a run-time or various compile-time values
each time it is respawned */
#define IS_CTXDEP_INSTR(op) (op == LOAD_GLOBAL || \
op == LOAD_NAME)
#define MAX_UNINTERRUPTED_RANGE 170 /* bytecode instructions */
/* opcodes that never or seldom produce machine code are listed as
lightweight instructions and don't account for the mesured code weight. */
#define IS_LIGHT_INSTR(op) (IS_JUMP_INSTR(op) || \
HAS_JREL_INSTR(op) || \
HAS_JABS_INSTR(op) || \
IS_SET_LINENO(op) || \
IS_NOP(op) || \
op == POP_TOP || \
op == ROT_TWO || \
op == ROT_THREE || \
op == ROT_FOUR || \
op == DUP_TOP || \
op == DUP_TOPX || \
op == POP_BLOCK || \
op == END_FINALLY || \
op == LOAD_CONST || \
op == LOAD_FAST || \
op == STORE_FAST || \
op == DELETE_FAST || \
op == UNPACK_SEQUENCE || \
op == BUILD_TUPLE || \
op == BUILD_LIST || \
op == BUILD_MAP)
/* opcodes that can only be compiled at module top-level,
when locals() is globals() */
#define IS_MODULE_INSTR(op) (op == STORE_NAME || \
op == DELETE_NAME || \
op == LOAD_NAME || \
op == IMPORT_STAR)
/* all other supported instructions must be listed here. */
#define OTHER_OPCODE(op) (op == UNARY_POSITIVE || \
op == UNARY_NEGATIVE || \
op == UNARY_NOT || \
op == UNARY_CONVERT || \
op == UNARY_INVERT || \
op == BINARY_POWER || \
op == BINARY_MULTIPLY || \
op == BINARY_DIVIDE || \
op == BINARY_MODULO || \
op == BINARY_ADD || \
op == BINARY_SUBTRACT || \
op == BINARY_SUBSCR || \
op == BINARY_LSHIFT || \
op == BINARY_RSHIFT || \
op == BINARY_AND || \
op == BINARY_XOR || \
op == BINARY_OR || \
op == BINARY_FLOOR_DIVIDE || \
op == BINARY_TRUE_DIVIDE || \
op == INPLACE_FLOOR_DIVIDE || \
op == INPLACE_TRUE_DIVIDE || \
IS_LIST_APPEND(op) || \
op == INPLACE_POWER || \
op == INPLACE_MULTIPLY || \
op == INPLACE_DIVIDE || \
op == INPLACE_MODULO || \
op == INPLACE_ADD || \
op == INPLACE_SUBTRACT || \
op == INPLACE_LSHIFT || \
op == INPLACE_RSHIFT || \
op == INPLACE_AND || \
op == INPLACE_XOR || \
op == INPLACE_OR || \
op == SLICE+0 || \
op == SLICE+1 || \
op == SLICE+2 || \
op == SLICE+3 || \
op == STORE_SLICE+0 || \
op == STORE_SLICE+1 || \
op == STORE_SLICE+2 || \
op == STORE_SLICE+3 || \
op == DELETE_SLICE+0 || \
op == DELETE_SLICE+1 || \
op == DELETE_SLICE+2 || \
op == DELETE_SLICE+3 || \
op == STORE_SUBSCR || \
op == DELETE_SUBSCR || \
op == PRINT_EXPR || \
op == PRINT_ITEM || \
op == PRINT_ITEM_TO || \
op == PRINT_NEWLINE || \
op == PRINT_NEWLINE_TO || \
op == BUILD_CLASS || \
op == STORE_ATTR || \
op == DELETE_ATTR || \
op == STORE_GLOBAL || \
op == DELETE_GLOBAL || \
op == LOAD_GLOBAL || \
op == LOAD_ATTR || \
/* COMPARE_OP special-cased */ \
op == IMPORT_NAME || \
op == IMPORT_FROM || \
op == GET_ITER || \
op == CALL_FUNCTION || \
op == CALL_FUNCTION_VAR || \
op == CALL_FUNCTION_KW || \
op == CALL_FUNCTION_VAR_KW || \
op == MAKE_FUNCTION || \
op == BUILD_SLICE || \
op == SETUP_LOOP)
#define SUPPORTED_COMPARE_ARG(oparg) ( \
(oparg) == Py_LT || \
(oparg) == Py_LE || \
(oparg) == Py_EQ || \
(oparg) == Py_NE || \
(oparg) == Py_GT || \
(oparg) == Py_GE || \
(oparg) == PyCmp_IS || \
(oparg) == PyCmp_IS_NOT || \
(oparg) == PyCmp_IN || \
(oparg) == PyCmp_NOT_IN || \
(oparg) == PyCmp_EXC_MATCH || \
0)
/***************************************************************/
#ifdef RETURN_NONE
# define IS_EPILOGUE_INSTR(op) (op == RETURN_NONE)
#else
# define IS_EPILOGUE_INSTR(op) 0
#endif
#ifdef SET_LINENO
# define IS_SET_LINENO(op) (op == SET_LINENO)
#else
# define IS_SET_LINENO(op) 0
#endif
#ifdef NOP
# define IS_NOP(op) (op == NOP)
#else
# define IS_NOP(op) 0
#endif
#ifdef LIST_APPEND
# define IS_LIST_APPEND(op) (op == LIST_APPEND)
#else
# define IS_LIST_APPEND(op) 0
#endif
/***************************************************************/
#define MP_OTHER 0x01
#define MP_IS_JUMP 0x02
#define MP_HAS_JREL 0x04
#define MP_HAS_JABS 0x08
#define MP_HAS_J_MULTIPLE 0x10
#define MP_LIGHT 0x20
#define MP_IS_CTXDEP 0x40
#define MP_IS_MODULE 0x80
#define F(op) ((IS_JUMP_INSTR(op) ? MP_IS_JUMP : 0) | \
(HAS_JREL_INSTR(op) ? MP_HAS_JREL : 0) | \
(HAS_JABS_INSTR(op) ? MP_HAS_JABS : 0) | \
(HAS_J_MULTIPLE(op) ? MP_HAS_J_MULTIPLE : 0) | \
(IS_LIGHT_INSTR(op) ? MP_LIGHT : 0) | \
(IS_CTXDEP_INSTR(op) ? MP_IS_CTXDEP : 0) | \
(IS_MODULE_INSTR(op) ? MP_IS_MODULE : 0) | \
(OTHER_OPCODE(op) ? MP_OTHER : 0))
/* opcode table -- the preprocessor expands this into several hundreds KB
of code (which reduces down to 256 bytes!). Hopefully not a problem
for modern C compilers */
static const unsigned char instr_control_flow[256] = {
F(0x00), F(0x01), F(0x02), F(0x03), F(0x04), F(0x05), F(0x06), F(0x07),
F(0x08), F(0x09), F(0x0A), F(0x0B), F(0x0C), F(0x0D), F(0x0E), F(0x0F),
F(0x10), F(0x11), F(0x12), F(0x13), F(0x14), F(0x15), F(0x16), F(0x17),
F(0x18), F(0x19), F(0x1A), F(0x1B), F(0x1C), F(0x1D), F(0x1E), F(0x1F),
F(0x20), F(0x21), F(0x22), F(0x23), F(0x24), F(0x25), F(0x26), F(0x27),
F(0x28), F(0x29), F(0x2A), F(0x2B), F(0x2C), F(0x2D), F(0x2E), F(0x2F),
F(0x30), F(0x31), F(0x32), F(0x33), F(0x34), F(0x35), F(0x36), F(0x37),
F(0x38), F(0x39), F(0x3A), F(0x3B), F(0x3C), F(0x3D), F(0x3E), F(0x3F),
F(0x40), F(0x41), F(0x42), F(0x43), F(0x44), F(0x45), F(0x46), F(0x47),
F(0x48), F(0x49), F(0x4A), F(0x4B), F(0x4C), F(0x4D), F(0x4E), F(0x4F),
F(0x50), F(0x51), F(0x52), F(0x53), F(0x54), F(0x55), F(0x56), F(0x57),
F(0x58), F(0x59), F(0x5A), F(0x5B), F(0x5C), F(0x5D), F(0x5E), F(0x5F),
F(0x60), F(0x61), F(0x62), F(0x63), F(0x64), F(0x65), F(0x66), F(0x67),
F(0x68), F(0x69), F(0x6A), F(0x6B), F(0x6C), F(0x6D), F(0x6E), F(0x6F),
F(0x70), F(0x71), F(0x72), F(0x73), F(0x74), F(0x75), F(0x76), F(0x77),
F(0x78), F(0x79), F(0x7A), F(0x7B), F(0x7C), F(0x7D), F(0x7E), F(0x7F),
F(0x80), F(0x81), F(0x82), F(0x83), F(0x84), F(0x85), F(0x86), F(0x87),
F(0x88), F(0x89), F(0x8A), F(0x8B), F(0x8C), F(0x8D), F(0x8E), F(0x8F),
F(0x90), F(0x91), F(0x92), F(0x93), F(0x94), F(0x95), F(0x96), F(0x97),
F(0x98), F(0x99), F(0x9A), F(0x9B), F(0x9C), F(0x9D), F(0x9E), F(0x9F),
F(0xA0), F(0xA1), F(0xA2), F(0xA3), F(0xA4), F(0xA5), F(0xA6), F(0xA7),
F(0xA8), F(0xA9), F(0xAA), F(0xAB), F(0xAC), F(0xAD), F(0xAE), F(0xAF),
F(0xB0), F(0xB1), F(0xB2), F(0xB3), F(0xB4), F(0xB5), F(0xB6), F(0xB7),
F(0xB8), F(0xB9), F(0xBA), F(0xBB), F(0xBC), F(0xBD), F(0xBE), F(0xBF),
F(0xC0), F(0xC1), F(0xC2), F(0xC3), F(0xC4), F(0xC5), F(0xC6), F(0xC7),
F(0xC8), F(0xC9), F(0xCA), F(0xCB), F(0xCC), F(0xCD), F(0xCE), F(0xCF),
F(0xD0), F(0xD1), F(0xD2), F(0xD3), F(0xD4), F(0xD5), F(0xD6), F(0xD7),
F(0xD8), F(0xD9), F(0xDA), F(0xDB), F(0xDC), F(0xDD), F(0xDE), F(0xDF),
F(0xE0), F(0xE1), F(0xE2), F(0xE3), F(0xE4), F(0xE5), F(0xE6), F(0xE7),
F(0xE8), F(0xE9), F(0xEA), F(0xEB), F(0xEC), F(0xED), F(0xEE), F(0xEF),
F(0xF0), F(0xF1), F(0xF2), F(0xF3), F(0xF4), F(0xF5), F(0xF6), F(0xF7),
F(0xF8), F(0xF9), F(0xFA), F(0xFB), F(0xFC), F(0xFD), F(0xFE), F(0xFF),
};
#undef F
struct instrnode_s {
struct instrnode_s* next1; /* next instruction */
struct instrnode_s* next2; /* next instr (jump target) */
struct instrnode_s* next3; /* next instr (exception handler) */
unsigned char opcode; /* copy of the instruction opcode */
unsigned char back; /* # of bytes to go back to find the instruction */
unsigned char inpaths; /* number of incoming paths to this point */
unsigned char pending; /* parse bytecode pending */
global_entries_t* mp; /* set a mergepoint here? (see MPSET_XXX) */
int mask; /* mask of bits for needed variables */
int storemask; /* mask of bits for stored variables */
};
#define MPSET_NEVER ((global_entries_t*) NULL)
#define MPSET_MAYBE ((global_entries_t*) -1)
#define MPSET_YES ((global_entries_t*) -2)
#define MPSET_FORCE ((global_entries_t*) -3)
/***************************************************************/
#if FULL_CONTROL_FLOW
/* how many variables fit in the 'int' bitfield of instrnode_s */
#define VARS_PER_PASS (sizeof(int)*8-1)
PSY_INLINE bool back_propagate_mask(struct instrnode_s* instrnodes,
struct instrnode_s* node,
int var0)
{
bool modif = false;
int prevmask, mask, oparg;
while (node > instrnodes)
{
node--;
oparg = node->mask;
node -= node->back; /* skip back argument */
if (node->next1 != NULL)
{
prevmask = mask = node->mask;
mask |= node->next1->mask;
/*fprintf(stderr, "propagate1 %d <- %d\n",
node-instrnodes, node->next1-instrnodes);*/
if (node->next2 != NULL)
{
mask |= node->next2->mask;
/*fprintf(stderr, "propagate2 %d <- %d\n",
node-instrnodes, node->next1-instrnodes);*/
if (node->next3 != NULL) {
mask |= node->next3->mask;
/*fprintf(stderr, "propagate3 %d <- %d\n",
node-instrnodes, node->next1-instrnodes);*/
}
}
if (node->opcode == STORE_FAST)
{
int bit = oparg - var0;
if (0 <= bit && bit < VARS_PER_PASS)
mask &= ~(1<<bit);
}
if (mask != prevmask)
{
/*fprintf(stderr, "mask of %d: %x -> %x\n",
node-instrnodes, mask, node->mask);*/
node->mask = mask;
modif = true;
}
}
}
return modif;
}
PSY_INLINE void mark_var_uses(struct instrnode_s* instrnodes,
struct instrnode_s* node,
int var0)
{
while (node > instrnodes)
{
int m1 = 1<<VARS_PER_PASS;
node--;
if (node->back)
{
int oparg = node->mask;
node -= node->back; /* skip back argument */
if (node->opcode == LOAD_FAST || node->opcode == DELETE_FAST)
{
int bit = oparg - var0;
if (0 <= bit && bit < VARS_PER_PASS)
m1 |= (1<<bit);
/*fprintf(stderr, "load_fast at opcode %d: %x\n", node-instrnodes, m1);*/
}
}
node->mask = m1;
node->storemask = 0;
}
}
PSY_INLINE int function_args_mask(int var0, int ninitialized)
{
int bits = ninitialized - var0;
if (bits <= 0)
return 0;
else if (bits >= VARS_PER_PASS)
return -1;
else
return (1<<bits)-1;
}
static void forward_propagate(struct instrnode_s* node, int newmask, int var0)
{
while ((newmask |= node->storemask) != node->storemask)
{
node->storemask = newmask;
if (!node->next1)
break;
if (node->mp)
{
/* at each mergepoint, we only keep variables that are
also present in mode->mask. */
newmask &= node->mask;
}
if (node->opcode == STORE_FAST)
{
/* after each STORE_FAST, add the corresponding bit into newmask */
int oparg = node[1].mask;
int bit = oparg - var0;
if (0 <= bit && bit < VARS_PER_PASS)
newmask |= (1<<bit);
}
if (node->next2)
{
forward_propagate(node->next2, newmask, var0);
if (node->next3)
forward_propagate(node->next3, newmask, var0);
}
node = node->next1;
}
}
PSY_INLINE void find_unused_vars(struct instrnode_s* instrnodes,
struct instrnode_s* node,
int var0)
{
while (node > instrnodes)
{
node--;
node -= node->back; /* skip back argument */
if (node->mp)
{
/* if at that mergepoint we have no use for a variable,
write a note to say it can be deleted. */
int remove = node->storemask & ~node->mask;
int i;
psyco_assert(node->mask & (1<<VARS_PER_PASS));
for (i=var0; remove; i++, remove>>=1)
if (remove & 1)
psyco_ge_unused_var(node->mp, i);
}
}
}
static void analyse_variables(struct instrnode_s* instrnodes,
struct instrnode_s* end,
PyCodeObject* co)
{
int var0;
int nlocals = co->co_nlocals;
int ninitialized = co->co_argcount;
if (co->co_flags & CO_VARKEYWORDS) ninitialized++;
if (co->co_flags & CO_VARARGS) ninitialized++;
for (var0 = 0; var0 < nlocals; var0 += VARS_PER_PASS)
{
mark_var_uses(instrnodes, end, var0);
while (back_propagate_mask(instrnodes, end, var0))
;
forward_propagate(instrnodes, (function_args_mask(var0, ninitialized) |
(1<<VARS_PER_PASS)), var0);
/*propagate_stores(instrnodes, end);*/
find_unused_vars(instrnodes, end, var0);
}
#if DUMP_CONTROL_FLOW
/* debugging dump */
{
int i;
fprintf(stderr, "mergepoints.c: %s: [listing of deleted vars]\n", PyCodeObject_NAME(co));
for (i=0; instrnodes<end; i++,instrnodes++)
if (instrnodes->mp)
{
PyObject* plist = instrnodes->mp->fatlist;
int j;
fprintf(stderr, " line %d: %d ", PyCode_Addr2Line(co, i), i);
for (j=0; j<PyList_GET_SIZE(plist); j++)
{
int num;
PyObject* o1 = PyList_GET_ITEM(plist, j);
if (!PyInt_Check(o1))
break;
num = PyInt_AS_LONG(o1);
o1 = PyTuple_GetItem(co->co_varnames, num);
fprintf(stderr, " [%s]", PyString_AsString(o1));
}
fprintf(stderr, "\n");
}
}
#endif
}
#endif /* FULL_CONTROL_FLOW */
/***************************************************************/
DEFINEFN
PyObject* psyco_build_merge_points(PyCodeObject* co, int module)
{
PyObject* s;
mergepoint_t* mp;
int mp_flags = MP_FLAGS_EXTRA;
int length = PyString_GET_SIZE(co->co_code);
unsigned char* source = (unsigned char*) PyString_AS_STRING(co->co_code);
size_t ibytes = (length+1) * sizeof(struct instrnode_s);
struct instrnode_s* instrnodes;
int i, lasti, count;
bool modif;
PyTryBlock blockstack[CO_MAXBLOCKS];
int iblock, bytecodeweight, iblockmax = 0;
bool valid_controlflow = true;
PyObject *etype, *evalue, *etb;
if (length == 0)
{
/* normally a code object's code string is never empty,
but pyexpat.c has some hacks that we have to work around */
Py_INCREF(Py_None);
return Py_None;
}
#ifdef CO_GENERATOR
/* check for this flag -- it is not enough to check for the presence of
a YIELD_VALUE instruction because such an instruction might exist but
be unreachable. */
if (co->co_flags & CO_GENERATOR)
{
debug_printf(1 + (strcmp(PyCodeObject_NAME(co), "?")==0),
("unsupported generator at %s\n",
PyCodeObject_NAME(co)));
Py_INCREF(Py_None);
return Py_None;
}
#endif /* CO_GENERATOR */
instrnodes = (struct instrnode_s*) PyMem_MALLOC(ibytes);
if (instrnodes == NULL)
OUT_OF_MEMORY();
memset(instrnodes, 0, ibytes);
PyErr_Fetch(&etype, &evalue, &etb);
/* parse the bytecode once, filling the instrnodes[].opcode,back,mask fields */
iblock = 0;
for (i=0; i<length; )
{
int oparg = 0;
int i0 = i;
int btop;
unsigned char op = source[i++];
instrnodes[i0].opcode = op;
if (HAS_ARG(op))
{
i += 2;
oparg = (source[i-1]<<8) + source[i-2];
if (op == EXTENDED_ARG)
{
op = source[i++];
psyco_assert(HAS_ARG(op) && op != EXTENDED_ARG);
i += 2;
oparg = oparg<<16 | ((source[i-1]<<8) + source[i-2]);
}
instrnodes[i0+1].back = instrnodes[i-1].back = (i-1) - i0;
instrnodes[i0+1].mask = instrnodes[i-1].mask = oparg; /* save oparg */
}
for (btop = iblock; btop--; )
{
if (blockstack[btop].b_type == SETUP_EXCEPT ||
blockstack[btop].b_type == SETUP_FINALLY) {
/* control flow may jump to the b_handler at any time */
instrnodes[i0].next3 = instrnodes + blockstack[btop].b_handler;
break;
}
}
switch (op)
{
case SETUP_EXCEPT:
case SETUP_FINALLY:
case SETUP_LOOP:
switch (op) {
case SETUP_EXCEPT: mp_flags |= MP_FLAGS_HAS_EXCEPT; break;
case SETUP_FINALLY: mp_flags |= MP_FLAGS_HAS_FINALLY; break;
}
psyco_assert(iblock < CO_MAXBLOCKS);
blockstack[iblock].b_type = op;
blockstack[iblock].b_handler = i + oparg;
iblock++;
if (iblock > iblockmax) iblockmax = iblock;
break;
case POP_BLOCK:
psyco_assert(iblock > 0);
iblock--;
break;
case BREAK_LOOP:
/* break the innermost loop */
btop = iblock;
do {
psyco_assert(btop>0);
btop--;
} while (blockstack[btop].b_type != SETUP_LOOP &&
blockstack[btop].b_type != SETUP_FINALLY);
/* jump to the loop bottom or finally handler */
instrnodes[i0].next3 = instrnodes + blockstack[btop].b_handler;
if (blockstack[btop].b_type != SETUP_LOOP)
{ /* argh, this gets messy */
/* because END_FINALLY will then jump to the loop bottom */
valid_controlflow = false;
}
break;
case CONTINUE_LOOP:
btop = iblock;
do {
psyco_assert(btop>0);
btop--;
} while (blockstack[btop].b_type != SETUP_LOOP &&
blockstack[btop].b_type != SETUP_FINALLY);
if (blockstack[btop].b_type == SETUP_LOOP)
{ /* jump to the loop head */
instrnodes[i0].next3 = instrnodes + oparg;
}
else
{ /* argh, this gets messy */
instrnodes[i0].next3 = instrnodes + blockstack[btop].b_handler;
valid_controlflow = false;
}
break;
case LOAD_GLOBAL:
case LOAD_NAME:
{
PyObject* namev = PyTuple_GET_ITEM(co->co_names, oparg);
char** p;
for (p = NoControlFlowIfBuiltin; *p; p++)
if (strcmp(PyString_AS_STRING(namev), *p) == 0)
valid_controlflow = false;
}
break;
}
}
if (iblock != 0)
valid_controlflow = false; /* ?? */
/* control flow analysis */
bytecodeweight = 0;
instrnodes[0].pending = 1;
do
{
modif = false;
for (i=0; i<length; i++)
if (instrnodes[i].pending == 1)
{
unsigned char op = instrnodes[i].opcode;
int oparg = instrnodes[i+1].mask;
int nextinstr = i+1 + instrnodes[i+1].back;
unsigned char flags = instr_control_flow[(int) op];
if (flags == 0)
if (op != COMPARE_OP || !SUPPORTED_COMPARE_ARG(oparg))
{
unsupported_instruction:
debug_printf(1 + (strcmp(PyCodeObject_NAME(co), "?")==0),
("unsupported opcode %d at %s:%d\n",
(int) op, PyCodeObject_NAME(co), i));
s = Py_None;
Py_INCREF(s);
goto done;
}
if (flags & (MP_HAS_JREL|MP_HAS_JABS))
{
int jtarget = oparg;
if (flags & MP_HAS_JREL)
jtarget += nextinstr;
if (flags & MP_HAS_J_MULTIPLE || !++instrnodes[jtarget].inpaths)
instrnodes[jtarget].inpaths = 99;
instrnodes[i].next2 = instrnodes + jtarget;
}
if (!(flags & MP_IS_JUMP))
{
if (!++instrnodes[nextinstr].inpaths)
instrnodes[nextinstr].inpaths = 99;
instrnodes[i].next1 = instrnodes + nextinstr;
}
if (!(flags & MP_LIGHT))
{
if (instrnodes[i].mp == MPSET_NEVER)
instrnodes[i].mp = MPSET_MAYBE;
bytecodeweight++;
}
if (flags & MP_IS_CTXDEP)
{
instrnodes[nextinstr].inpaths = 99;
instrnodes[nextinstr].mp = MPSET_FORCE;
}
if (flags & MP_IS_MODULE)
{
if ( /*!module*/ 1) /* disabled, currently buggy */
goto unsupported_instruction;
mp_flags |= MP_FLAGS_MODULE;
}
/* compact the next1-next2-next3 */
if (instrnodes[i].next2 == NULL)
{
instrnodes[i].next2 = instrnodes[i].next3;
instrnodes[i].next3 = NULL;
}
if (instrnodes[i].next1 == NULL)
{
instrnodes[i].next1 = instrnodes[i].next2;
instrnodes[i].next2 = instrnodes[i].next3;
instrnodes[i].next3 = NULL;
}
if (instrnodes[i].next1 != NULL)
{
instrnodes[i].next1->pending |= 1;
if (instrnodes[i].next2 != NULL)
{
instrnodes[i].next2->pending |= 1;
if (instrnodes[i].next3 != NULL)
instrnodes[i].next3->pending |= 1;
}
}
instrnodes[i].pending = 3; /* the current instruction is done */
modif = true;
}
} while (modif);
/* check with the user-defined filter function, if any */
if (psyco_codeobj_filter_fn != NULL)
{
int res;
PyObject* o = PyObject_CallFunction(psyco_codeobj_filter_fn, "O",
(PyObject*) co);
res = o == NULL ? -1 : PyObject_IsTrue(o);
Py_XDECREF(o);
if (res < 0)
PyErr_WriteUnraisable(psyco_codeobj_filter_fn);
if (res <= 0)
{
s = Py_None;
Py_INCREF(s);
goto done;
}
}
/* set and count merge points */
/* a confluence point is an instruction with more than one incoming path */
/* a merge point is generally set for each confluence point, but it may be
set a bit later than the actual confluence point or completely
omitted if there is another confluence point just after */
/* ensure there are confluence points at regular intervals */
lasti = MAX_UNINTERRUPTED_RANGE;
for (i=1; i<length; i++)
if (instrnodes[i].inpaths > 0)
{
if (instrnodes[i].inpaths >= 2)
lasti = MAX_UNINTERRUPTED_RANGE; /* fine */
else
if (!--lasti)
{
/* it's been too long, force a confluence point */
instrnodes[i].inpaths = 99;
}
}
instrnodes[0].inpaths = 99;
instrnodes[0].mp = MPSET_YES; /* there is a merge point at the beginning */
count = 1;
{
/* the "weight" of a confluence point is the number of important
intructions that have to be done to reach the next confluence point.
It may be zero. The un-important instructions are listed in
IS_LIGHT_INSTR() and are marked MPSET_NEVER.
Some confluence points need not induce a merge point, but the total
weight of such omitted confluence points must not exceed
CONFLUENCE_TOTAL_DELAY. */
/* Confluence points of weight zero are stripped right away.
'cpnodes' is a list of the best non-null lightweight confluence points,
sorted by weight, ended by a sentinel with cpnodes==NULL and cpweight==
CONFLUENCE_TOTAL_DELAY+1 - (sum of the previous cpweights). */
struct instrnode_s* cpnodes[CONFLUENCE_TOTAL_DELAY+1];
int cpweight[CONFLUENCE_TOTAL_DELAY+1];
int weight, insertat, nextweight, insertweight;
struct instrnode_s* node;
struct instrnode_s* mpnode;
struct instrnode_s* nextnode;
cpnodes[0] = NULL;
cpweight[0] = CONFLUENCE_TOTAL_DELAY+1;
for (i=1; i<length; i++)
if (instrnodes[i].inpaths >= 2) /* confluence point */
{
/* compute the weight */
weight = 0;
insertat = 0;
mpnode = node = instrnodes + i;
if (mpnode->mp == MPSET_FORCE)
goto set_merge_point;
while (1)
{
if (node->next2 != NULL)
goto set_merge_point; /* give up in case of fork */
node = node->next1;
if (node == NULL || node->inpaths >= 2)
break;
if (node->mp == MPSET_MAYBE)
{
/* skipping over an important instruction */
weight++;
while (weight >= cpweight[insertat])
{
if (cpnodes[insertat] == NULL) /* sentinel */
goto set_merge_point; /* too heavy, give up */
insertat++;
}
}
}
/* reached the next confluence point or the end of the code */
if (weight > 0)
{
/* record the confluence point */
insertweight = weight;
do
{
nextnode = cpnodes [insertat];
nextweight = cpweight[insertat];
cpnodes [insertat] = mpnode;
cpweight[insertat] = insertweight;
mpnode = nextnode;
insertweight = nextweight;
insertat++;
}
while (mpnode != NULL); /* sentinel */
if (insertweight > weight)
{
/* no need to discard a confluence point, the
total weight is still low enough */
cpnodes [insertat] = NULL;
cpweight[insertat] = insertweight - weight;
}
else
{
/* total weight exceeded, force the latest (heaviest)
confluence point into a merge point */
insertat--;
mpnode = cpnodes[insertat];
cpnodes [insertat] = NULL;
cpweight[insertat] += insertweight - weight;
extra_assert(cpweight[insertat] >= 1);
goto set_merge_point;
}
}
/* if we get here, the merge point is not needed */
continue;
set_merge_point:
mpnode->mp = MPSET_YES;
count++;
}
/* confluence points left in 'cpnodes' are discarded */
}
/* { */
/* static int stats = 0, statsc = 0; */
/* stats++; */
/* statsc += count; */
/* fprintf(stderr, "%d mergepoints in %d code obj\n", statsc, stats); */
/* } */
/* inlinable functions are those not too heavy, with no merge point
after the mandatory first one, and with no iblock stack use */
if (count == 1 && bytecodeweight <= INLINE_MAXIMUM_WEIGHT && iblockmax == 0)
{
mp_flags |= MP_FLAGS_INLINABLE;
debug_printf(2, ("inlining code object '%s'\n", PyCodeObject_NAME(co)));
}
/* allocate the string buffer, one mergepoint_t per merge point plus
the room for a final negative bitfield flags. */
ibytes = count * sizeof(mergepoint_t) + sizeof(int);
s = PyString_FromStringAndSize(NULL, ibytes);
if (s == NULL)
OUT_OF_MEMORY();
mp = (mergepoint_t*) PyString_AS_STRING(s);
for (i=0; i<length; i++)
{
if (instrnodes[i].mp != MPSET_YES)
instrnodes[i].mp = NULL;
else
{
mp->bytecode_position = i;
instrnodes[i].mp = &mp->entries;
psyco_ge_init(&mp->entries);
mp++;
}
}
extra_assert(mp - (mergepoint_t*) PyString_AS_STRING(s) == count);
mp->bytecode_position = mp_flags;
#if FULL_CONTROL_FLOW
if (valid_controlflow)
{
mp->bytecode_position |= MP_FLAGS_CONTROLFLOW;
analyse_variables(instrnodes, instrnodes+length, co);
}
#endif
done:
PyMem_FREE(instrnodes);
PyErr_Restore(etype, evalue, etb);
return s;
}
DEFINEFN
mergepoint_t* psyco_next_merge_point(PyObject* mergepoints,
int position)
{
mergepoint_t* array;
int bufsize;
extra_assert(PyString_Check(mergepoints));
array = (mergepoint_t*) PyString_AS_STRING(mergepoints);
bufsize = PyString_GET_SIZE(mergepoints);
extra_assert((bufsize % sizeof(mergepoint_t)) == sizeof(int));
bufsize /= sizeof(mergepoint_t);
extra_assert(bufsize > 0);
do {
int test = bufsize/2;
if (position > array[test].bytecode_position)
{
++test;
array += test;
bufsize -= test;
}
else
{
bufsize = test;
}
} while (bufsize > 0);
return array;
}
DEFINEFN
PyObject* psyco_get_merge_points(PyCodeObject* co, int module)
{
return PyCodeStats_MergePoints(PyCodeStats_Get(co), module);
}
DEFINEVAR PyObject* psyco_codeobj_filter_fn = NULL;
|
