3 Routines for handling Flash2 AVM2 ABC Actionscript
5 Extension module for the rfxswf library.
6 Part of the swftools package.
8 Copyright (c) 2008 Matthias Kramm <kramm@quiss.org>
10 This program is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 2 of the License, or
13 (at your option) any later version.
15 This program is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program; if not, write to the Free Software
22 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
29 #define OP_STACK_ARGS 2
37 #define OP_LOOKUPSWITCH 512
38 #define OP_NEED_ACTIVATION 1024
39 #define OP_STACK_ARGS2 2048
40 #define OP_INTERNAL 32768
42 /* 2 = u30 index into multiname
43 m = u30 index into method
44 n = u30 number of params
45 i = u30 index into method info
47 c = u30 index into class
48 N = u30 index into namespaces
49 s = string (u30 index into strings)
56 {0xa0, "add", "", -2, 1, 0, 0},
57 {0xc5, "add_i", "", -2, 1, 0, 0},
58 {0x86, "astype", "2", -1, 1, 0, 0},
59 {0x87, "astypelate", "", -2, 1, 0, 0},
60 {0xA8, "bitand", "", -2, 1, 0, 0},
61 {0x97, "bitnot", "", -1, 1, 0, 0},
62 {0xa9, "bitor", "", -2, 1, 0, 0},
63 {0xaa, "bitxor", "", -2, 1, 0, 0},
64 {0x41, "call", "n", -2, 1, 0, OP_STACK_ARGS},
65 {0x43, "callmethod", "mn", -1, 1, 0, OP_STACK_ARGS},
66 {0x4c, "callproplex", "2n", -1, 1, 0, OP_STACK_ARGS|OP_STACK_NS},
67 {0x46, "callproperty", "2n", -1, 1, 0, OP_STACK_ARGS|OP_STACK_NS},
68 {0x4f, "callpropvoid", "2n", -1, 0, 0, OP_STACK_ARGS|OP_STACK_NS},
69 {0x44, "callstatic", "in", -1, 1, 0, OP_STACK_ARGS},
70 {0x45, "callsuper", "2n", -1, 1, 0, OP_STACK_ARGS|OP_STACK_NS},
71 {0x4e, "callsupervoid", "2n", -1, 0, 0, OP_STACK_ARGS|OP_STACK_NS},
72 {0x78, "checkfilter", "", -1, 1, 0, 0},
73 {0x80, "coerce", "2", -1, 1, 0, 0},
74 {0x82, "coerce_a", "", -1, 1, 0, 0},
75 {0x85, "coerce_s", "", -1, 1, 0, 0},
76 {0x42, "construct", "n", -1, 1, 0, OP_STACK_ARGS},
77 {0x4a, "constructprop", "2n", -1, 1, 0, OP_STACK_ARGS|OP_STACK_NS},
78 {0x49, "constructsuper", "n", -1, 0, 0, OP_STACK_ARGS},
79 {0x76, "convert_b", "", -1, 1, 0, 0},
80 {0x73, "convert_i", "", -1, 1, 0, 0},
81 {0x75, "convert_d", "", -1, 1, 0, 0},
82 {0x77, "convert_o", "", -1, 1, 0, 0},
83 {0x74, "convert_u", "", -1, 1, 0, 0},
84 {0x70, "convert_s", "", -1, 1, 0, 0},
85 {0xef, "debug", "D", 0, 0, 0, 0},
86 {0xf1, "debugfile", "s", 0, 0, 0, 0},
87 {0xf0, "debugline", "u", 0, 0, 0, 0},
88 {0x94, "declocal", "r", 0, 0, 0, OP_REGISTER},
89 {0xc3, "declocal_i", "r", 0, 0, 0, OP_REGISTER},
90 {0x93, "decrement", "", -1, 1, 0, 0},
91 {0xc1, "decrement_i", "", -1, 1, 0, 0},
92 {0x6a, "deleteproperty", "2", -1, 1, 0, OP_STACK_NS},
93 {0xa3, "divide", "", -2, 1, 0, 0},
94 {0x2a, "dup", "", -1, 2, 0, 0},
95 {0x06, "dxns", "s", 0, 0, 0, OP_SET_DXNS},
96 {0x07, "dxnslate", "", -1, 0, 0, OP_SET_DXNS},
97 {0xab, "equals", "", -2, 1, 0, 0},
98 {0x72, "esc_xattr", "", -1, 1, 0, 0},
99 {0x71, "esc_xelem", "", -1, 1, 0, 0},
100 {0x5e, "findproperty", "2", 0, 1, 0, OP_STACK_NS},
101 {0x5d, "findpropstrict", "2", 0, 1, 0, OP_STACK_NS},
102 {0x59, "getdescendants", "2", -1, 1, 0, OP_STACK_NS},
103 {0x64, "getglobalscope", "", 0, 1, 0, 0},
104 {0x6e, "getglobalslot", "u", 0, 1, 0, 0},
105 {0x60, "getlex", "2", 0, 1, 0, 0}, //multiname may not be runtime
106 {0x62, "getlocal", "r", 0, 1, 0, OP_REGISTER},
107 {0xd0, "getlocal_0", "", 0, 1, 0, OP_REGISTER},
108 {0xd1, "getlocal_1", "", 0, 1, 0, OP_REGISTER},
109 {0xd2, "getlocal_2", "", 0, 1, 0, OP_REGISTER},
110 {0xd3, "getlocal_3", "", 0, 1, 0, OP_REGISTER},
111 {0x66, "getproperty", "2", -1, 1, 0, OP_STACK_NS},
112 {0x65, "getscopeobject", "u", 0, 1, 0, 0}, // u = index into scope stack
113 {0x6c, "getslot", "u", -1, 1, 0, 0},
114 {0x04, "getsuper", "2", -1, 1, 0, OP_STACK_NS},
115 {0xaf, "greaterthan", "", -2, 1, 0, 0},
116 {0xb0, "greaterequals", "", -2, 1, 0, 0},
117 {0x1f, "hasnext", "", -2, 1, 0, 0},
118 {0x32, "hasnext2", "rr", 0, 1, 0, OP_REGISTER},
119 {0x13, "ifeq", "j", -2, 0, 0, OP_BRANCH},
120 {0x12, "iffalse", "j", -1, 0, 0, OP_BRANCH},
121 {0x18, "ifge", "j", -2, 0, 0, OP_BRANCH},
122 {0x17, "ifgt", "j", -2, 0, 0, OP_BRANCH},
123 {0x16, "ifle", "j", -2, 0, 0, OP_BRANCH},
124 {0x15, "iflt", "j", -2, 0, 0, OP_BRANCH},
125 {0x0f, "ifnge", "j", -2, 0, 0, OP_BRANCH},
126 {0x0e, "ifngt", "j", -2, 0, 0, OP_BRANCH},
127 {0x0d, "ifnle", "j", -2, 0, 0, OP_BRANCH},
128 {0x0c, "ifnlt", "j", -2, 0, 0, OP_BRANCH},
129 {0x14, "ifne", "j", -2, 0, 0, OP_BRANCH},
130 {0x19, "ifstricteq", "j", -2, 0, 0, OP_BRANCH},
131 {0x1a, "ifstrictne", "j", -2, 0, 0, OP_BRANCH},
132 {0x11, "iftrue", "j", -1, 0, 0, OP_BRANCH},
133 {0xb4, "in", "", -2, 1, 0, 0},
134 {0x92, "inclocal", "r", 0, 0, 0, OP_REGISTER},
135 {0xc2, "inclocal_i", "r", 0, 0, 0, OP_REGISTER},
136 {0x91, "increment", "", -1, 1, 0, 0},
137 {0xc0, "increment_i", "", -1, 1, 0, 0},
138 {0x68, "initproperty", "2", -2, 0, 0, OP_STACK_NS},
139 {0xb1, "instanceof", "", -2, 1, 0, 0},
140 {0xb2, "istype", "2", -1, 1, 0, 0}, // may not be a runtime multiname
141 {0xb3, "istypelate", "", -2, 1, 0, 0},
142 {0x10, "jump", "j", 0, 0, 0, OP_JUMP},
143 {0x08, "kill", "r", 0, 0, 0, OP_REGISTER},
144 {0x09, "label", "", 0, 0, 0, OP_LABEL},
145 {0xae, "lessequals", "", -2, 1, 0, 0},
146 {0xad, "lessthan", "", -2, 1, 0, 0},
147 {0x1b, "lookupswitch", "S", -1, 0, 0, OP_LOOKUPSWITCH},
148 {0xa5, "lshift", "", -2, 1, 0, 0},
149 {0xa4, "modulo", "", -2, 1, 0, 0},
150 {0xa2, "multiply", "", -2, 1, 0, 0},
151 {0xc7, "multiply_i", "", -2, 1, 0, 0},
152 {0x90, "negate", "", -1, 1, 0, 0},
153 {0xc4, "negate_i", "", -1, 1, 0, 0},
154 {0x57, "newactivation", "", 0, 1, 0, OP_NEED_ACTIVATION},
155 {0x56, "newarray", "n", 0, 1, 0, OP_STACK_ARGS},
156 {0x5a, "newcatch", "u", 0, 1, 0, 0}, //u = index into exception_info
157 {0x58, "newclass", "c", -1, 1, 0, 0}, //c = index into class_info
158 {0x40, "newfunction", "m", 0, 1, 0, 0}, //i = index into method_info
159 {0x55, "newobject", "n", 0, 1, 0, OP_STACK_ARGS2},
160 {0x1e, "nextname", "", -2, 1, 0, 0},
161 {0x23, "nextvalue", "", -2, 1, 0, 0},
162 {0x02, "nop", "", 0, 0, 0, 0},
163 {0x96, "not", "", -1, 1, 0 ,0},
164 {0x29, "pop", "", -1, 0, 0, 0},
165 {0x1d, "popscope", "", 0, 0,-1, 0},
166 {0x24, "pushbyte", "b", 0, 1, 0, 0},
167 {0x2f, "pushdouble", "f", 0, 1, 0, 0}, //index into floats
168 {0x27, "pushfalse", "", 0, 1, 0, 0},
169 {0x2d, "pushint", "I", 0, 1, 0, 0}, //index into ints
170 {0x31, "pushnamespace", "N", 0, 1, 0, 0}, //index into namespace
171 {0x28, "pushnan", "", 0, 1, 0, 0},
172 {0x20, "pushnull", "", 0, 1, 0, 0},
173 {0x30, "pushscope", "", -1, 0, 1, 0},
174 {0x25, "pushshort", "u", 0, 1, 0, 0},
175 {0x2c, "pushstring", "s", 0, 1, 0, 0},
176 {0x26, "pushtrue", "", 0, 1, 0, 0},
177 {0x2e, "pushuint", "U", 0, 1, 0, 0}, //index into uints
178 {0x21, "pushundefined", "", 0, 1, 0, 0},
179 {0x1c, "pushwith", "", -1, 0, 1, 0},
180 {0x48, "returnvalue", "", -1, 0, 0, OP_RETURN},
181 {0x47, "returnvoid", "", 0, 0, 0, OP_RETURN},
182 {0xa6, "rshift", "", -2, 1, 0, 0},
183 {0x63, "setlocal", "r", -1, 0, 0, OP_REGISTER},
184 {0xd4, "setlocal_0", "", -1, 0, 0, OP_REGISTER},
185 {0xd5, "setlocal_1", "", -1, 0, 0, OP_REGISTER},
186 {0xd6, "setlocal_2", "", -1, 0, 0, OP_REGISTER},
187 {0xd7, "setlocal_3", "", -1, 0, 0, OP_REGISTER},
188 {0x6f, "setglobalslot", "u", -1, 0, 0, 0},
189 {0x61, "setproperty", "2", -2, 0, 0, OP_STACK_NS},
190 {0x6d, "setslot", "u", -2, 0, 0, 0},
191 {0x05, "setsuper", "2", -2, 0, 0, OP_STACK_NS},
192 {0xac, "strictequals", "", -2, 1, 0, 0},
193 {0xa1, "subtract", "", -2, 1, 0, 0},
194 {0xc6, "subtract_i", "", -2, 1, 0, 0},
195 {0x2b, "swap", "", -2, 2, 0, 0},
196 {0x03, "throw", "", -1, 0, 0, OP_THROW},
197 {0x95, "typeof", "", -1, 1, 0, 0},
198 {0xa7, "urshift", "", -2, 1, 0, 0},
200 /* opcodes not documented, but seen in the wild */
201 {0x53, "applytype", "n", -1, 1, 0, OP_STACK_ARGS}, //seen in builtin.abc
203 /* dummy instructions. Warning: these are not actually supported by flash */
204 {0xfb, "__pushpackage__", "s", 0, 1, 0, OP_INTERNAL},
205 {0xfc, "__rethrow__", "", 0, 0, 0, OP_THROW|OP_INTERNAL},
206 {0xfd, "__fallthrough__", "s", 0, 0, 0, OP_INTERNAL},
207 {0xfe, "__continue__", "s", 0, 0, 0, OP_RETURN|OP_INTERNAL},
208 {0xff, "__break__", "s", 0, 0, 0, OP_RETURN|OP_INTERNAL},
211 static opcode_t* op2op[256] = {0,0,0};
213 static inline opcode_t* opcode_get(U8 op)
217 memset(op2op, 0, sizeof(op2op));
218 for(t=0;t<sizeof(opcodes)/sizeof(opcodes[0]);t++) {
219 op2op[opcodes[t].opcode] = &opcodes[t];
225 static code_t*pos2code(code_t**bytepos, code_t*c, int pos, int len)
232 (pos!=len && !bytepos[pos])) {
233 /* flex likes to generate these. yuck. */
235 opcode_t*op = opcode_get(c->opcode);
236 fprintf(stderr, "Warning: Invalid jump instruction \"%s\" from %d to %d (%d)\n", op->name, c->pos, pos, len);
238 fprintf(stderr, "Warning: Invalid jump to %d (%d)\n", pos, len);
243 //opcode_t*op = opcode_get(c->opcode);
244 //fprintf(stderr, "Warning: jump beyond end of code in instruction %s at position %d\n", op->name, c->pos);
251 code_t* code_atposition(codelookup_t*l, int pos)
253 return pos2code(l->bytepos, 0, pos, l->len);
256 void lookupswitch_print(lookupswitch_t*l)
258 printf("default: %08x\n", l->def);
259 code_list_t*t = l->targets;
261 printf("target: %08x\n", t->code);
266 code_t*code_parse(TAG*tag, int len, abc_file_t*file, pool_t*pool, codelookup_t**codelookup)
271 int end=tag->pos+len;
272 //printf("-->\n");fflush(stdout);
274 code_t**bytepos = rfx_calloc(sizeof(code_t*)*len);
276 while(tag->pos<end) {
277 int codepos = tag->pos-start;
278 U8 opcode = swf_GetU8(tag);
279 opcode_t*op = opcode_get(opcode);
281 fprintf(stderr, "Can't parse opcode %02x\n", opcode);
284 //printf("%s\n", op->name);fflush(stdout);
288 bytepos[codepos] = c;
304 if(*p == 'n') { // number
305 data = (void*)(ptroff_t)swf_GetU30(tag);
306 } else if(*p == '2') { //multiname
307 data = multiname_clone(pool_lookup_multiname(pool, swf_GetU30(tag)));
308 } else if(*p == 'N') { //namespace
309 data = namespace_clone(pool_lookup_namespace(pool, swf_GetU30(tag)));
310 } else if(*p == 'U') { //uint
311 data = (void*)(ptroff_t)pool_lookup_uint(pool, swf_GetU30(tag));
312 } else if(*p == 'I') { //int
313 data = (void*)(ptroff_t)pool_lookup_int(pool, swf_GetU30(tag));
314 } else if(*p == 'f') { //int
315 double*fp = malloc(sizeof(double));
316 *fp = pool_lookup_float(pool, swf_GetU30(tag));
318 } else if(*p == 'm') { //method
319 data = array_getvalue(file->methods, swf_GetU30(tag));
320 } else if(*p == 'c') { //classinfo
321 data = array_getvalue(file->classes, swf_GetU30(tag));
322 } else if(*p == 'i') {
323 data = array_getvalue(file->method_bodies, swf_GetU30(tag));
324 } else if(*p == 'u') { // generic integer
325 data = (void*)(ptroff_t)swf_GetU30(tag);
326 } else if(*p == 'r') { // local register
327 data = (void*)(ptroff_t)swf_GetU30(tag);
328 } else if(*p == 'b') { // byte
329 data = (void*)(ptroff_t)swf_GetU8(tag);
330 } else if(*p == 'j') { // jump
331 int j = swf_GetS24(tag);
332 data = (void*)(ptroff_t)j;
333 } else if(*p == 's') { // string
334 string_t s = pool_lookup_string2(pool, swf_GetU30(tag));
335 data = string_dup3(&s);
336 } else if(*p == 'D') { // debug
338 U8 type = swf_GetU8(tag);
340 fprintf(stderr, "Unknown debug type: %02x\n", type);
342 code->data[0] = strdup((char*)pool_lookup_string(pool, swf_GetU30(tag)));
344 code->data[1] = (void*)(ptroff_t)swf_GetU8(tag);
347 } else if(*p == 'S') { // switch statement
348 lookupswitch_t*l = malloc(sizeof(lookupswitch_t));
349 l->def = (code_t*)(ptroff_t)swf_GetS24(tag);
350 l->targets = list_new();
351 int num = swf_GetU30(tag)+1;
354 list_append(l->targets, (code_t*)(ptroff_t)swf_GetS24(tag));
357 printf("Can't parse opcode param type \"%c\" (for op %02x %s).\n", *p, code->opcode, op->name);
361 code->data[pos++] = data;
366 //#define DEBUG_BYTES
370 code_t*c = bytepos[t];
372 opcode_t*op = opcode_get(c->opcode);
373 if(op->flags & (OP_JUMP|OP_BRANCH)) {
374 printf("%50d) %02x %s %d\n", t, tag->data[start+t], op->name, c->data[0]);
376 printf("%50d) %02x %s\n", t, tag->data[start+t], op->name);
379 printf("%50d) %02x\n", t, tag->data[start+t]);
382 //printf("%05d) %02x\n", t, tag->data[start+t]);
387 opcode_t*op = opcode_get(c->opcode);
388 if(op->flags & (OP_JUMP|OP_BRANCH)) {
389 int j = ((int)(ptroff_t)c->data[0]);
390 c->branch = pos2code(bytepos,c,j+4,len);
391 } else if(op->flags & (OP_LOOKUPSWITCH)) {
392 lookupswitch_t*l = (lookupswitch_t*)c->data[0];
394 l->def = pos2code(bytepos,c,(ptroff_t)l->def+offset,len);
395 code_list_t*t=l->targets;
397 t->code = pos2code(bytepos,c,(ptroff_t)t->code+offset,len);
405 (*codelookup) = malloc(sizeof(codelookup_t));
406 (*codelookup)->bytepos = bytepos;
407 (*codelookup)->len = len;
415 void codelookup_free(codelookup_t*codelookup)
417 free(codelookup->bytepos);codelookup->bytepos=0;
421 void code_free(code_t*c)
425 code_t*next = c->next;
426 opcode_t*op = opcode_get(c->opcode);
427 char*p = op?op->params:"";
430 void*data = c->data[pos];
431 if(*p == '2') { //multiname
432 multiname_destroy(data);
433 } else if(*p == 'N') { //namespace
434 namespace_destroy(data);
435 } else if(strchr("sDf", *p)) {
437 } else if(strchr("S", *p)) {
438 lookupswitch_t*l = (lookupswitch_t*)data;
439 list_free(l->targets);l->targets=0;
445 memset(c, 0, sizeof(c));
451 static int opcode_write(TAG*tag, code_t*c, pool_t*pool, abc_file_t*file, int length)
453 opcode_t*op = opcode_get(c->opcode);
459 swf_SetU8(tag, c->opcode);
462 if(op->flags & OP_INTERNAL) {
463 if(c->opcode == OPCODE___BREAK__ ||
464 c->opcode == OPCODE___CONTINUE__) {
465 fprintf(stderr, "Unresolved %s\n", op->name);
467 fprintf(stderr, "Error: writing undefined internal opcode %s\n", op->name);
472 void*data = c->data[pos++];
474 if(*p == 'n') { // number
475 len += swf_SetU30(tag, (ptroff_t)data);
476 } else if(*p == '2') { //multiname
477 multiname_t*m = (multiname_t*)data;
478 len += swf_SetU30(tag, pool_register_multiname(pool, m));
479 } else if(*p == 'N') { //namespace
480 namespace_t*ns = (namespace_t*)data;
481 len += swf_SetU30(tag, pool_register_namespace(pool, ns));
482 } else if(*p == 'm') { //method
483 abc_method_t*m = (abc_method_t*)data;
484 len += swf_SetU30(tag, m->index);
485 } else if(*p == 'c') { //classinfo
486 abc_class_t*cls = (abc_class_t*)data;
487 len += swf_SetU30(tag, cls->index);
488 } else if(*p == 'i') { //methodbody
489 abc_method_body_t*m = (abc_method_body_t*)data;
490 len += swf_SetU30(tag, m->index);
491 } else if(*p == 'I') { // int
492 len += swf_SetU30(tag, pool_register_int(pool, (ptroff_t)data));
493 } else if(*p == 'U') { // uint
494 len += swf_SetU30(tag, pool_register_uint(pool, (ptroff_t)data));
495 } else if(*p == 'f') { // float
496 len += swf_SetU30(tag, pool_register_float(pool, *(double*)data));
497 } else if(*p == 'u') { // integer
498 len += swf_SetU30(tag, (ptroff_t)data);
499 } else if(*p == 'r') { // integer
500 len += swf_SetU30(tag, (ptroff_t)data);
501 } else if(*p == 'b') { // byte
503 swf_SetU8(tag, (ptroff_t)data);
505 } else if(*p == 'j') { // jump
506 int skip = length-c->pos-4;
508 skip = (c->branch->pos) - c->pos - 4;
509 len += swf_SetS24(tag, skip);
510 } else if(*p == 's') { // string
511 int index = pool_register_string2(pool, (string_t*)data);
512 len += swf_SetU30(tag, index);
513 } else if(*p == 'D') { // debug statement
517 len+=swf_SetU30(tag, pool_register_string(pool,c->data[0]));
519 swf_SetU8(tag, (ptroff_t)c->data[1]);
521 len+=swf_SetU30(tag, 0);
522 } else if(*p == 'S') { // switch statement
523 lookupswitch_t*l = (lookupswitch_t*)data;
525 len+=swf_SetS24(tag, l->def->pos-c->pos+offset); //default
526 code_list_t*t = l->targets;
528 len+=swf_SetU30(tag, list_length(t)-1); //nr-1
529 code_list_t*t = l->targets;
531 len+=swf_SetS24(tag, t->code->pos - c->pos+offset);
535 len+=swf_SetU30(tag, 0); //nr-1
536 len+=swf_SetS24(tag, l->def->pos-c->pos+offset);
539 printf("Can't parse opcode param type \"%c\"\n", *p);
546 void code_write(TAG*tag, code_t*code, pool_t*pool, abc_file_t*file)
548 code = code_start(code);
554 pos += opcode_write(0, c, pool, file, 0);
558 swf_SetU30(tag, pos);
559 int start = tag->len;
563 opcode_t*op = opcode_get(code->opcode);
564 if(op->flags&(OP_BRANCH|OP_JUMP)) {
567 pos += opcode_write(tag, c, pool, file, length);
570 assert(tag->len - start == pos);
590 static int stack_minus(code_t*c)
592 opcode_t*op = opcode_get(c->opcode);
593 if(op->stack_minus>0) {
594 fprintf(stderr, "Invalid opcode entry %02x %s\n", c->opcode, op->name);
596 int stack = op->stack_minus;
597 if(op->flags&OP_STACK_NS) {
598 multiname_t*m = (multiname_t*)c->data[0];
599 if(multiname_late_namespace(m))
601 if(multiname_late_name(m))
604 if(op->flags&OP_STACK_ARGS || op->flags&OP_STACK_ARGS2) {
605 assert(strchr(op->params, 'n'));
606 int nr = (ptroff_t)(op->params[0]=='n'?c->data[0]:c->data[1]);
608 if(op->flags&OP_STACK_ARGS2)
613 static void handleregister(currentstats_t*stats, int reg)
615 if(reg+1 > stats->maxlocal)
616 stats->maxlocal = reg+1;
622 static void dumpstack(currentstats_t*stats)
625 for(t=0;t<stats->num;t++) {
626 code_t*c = stats->stack[t].code;
627 opcode_t*op = opcode_get(c->opcode);
628 printf("%05d) %c %d:%d %s", t, (stats->stack[t].flags&FLAG_SEEN)?'x':'|',
629 stats->stack[t].stackpos,
630 stats->stack[t].scopepos,
633 if(op->flags&(OP_BRANCH|OP_JUMP)) {
635 printf(" ->%d\n", c->branch->pos);
637 printf(" 00000000\n");
639 if(op->params[0]=='2') {
640 printf(" %s", multiname_tostring(c->data[0]));
641 } else if(op->params[0]=='N') {
642 printf(" %s", namespace_tostring(c->data[0]));
648 static char callcode(currentstats_t*stats, int pos, int stack, int scope)
650 while(pos<stats->num) {
651 if(stats->stack[pos].flags&FLAG_SEEN) {
652 if(stats->stack[pos].stackpos != stack ||
653 stats->stack[pos].scopepos != scope) {
655 stats->stack[pos].flags |= FLAG_ERROR;
656 fprintf(stderr, "Stack mismatch at pos %d\n", pos);
657 fprintf(stderr, "Should be: %d:%d, is: %d:%d\n", stack, scope,
658 stats->stack[pos].stackpos, stats->stack[pos].scopepos);
660 /* return error here if we do verification */
666 stats->stack[pos].flags |= FLAG_SEEN;
667 stats->stack[pos].stackpos = stack;
668 stats->stack[pos].scopepos = scope;
670 code_t*c = stats->stack[pos].code;
671 opcode_t*op = opcode_get(c->opcode);
673 //printf("Walking %s at position %d, stack=%d, scope=%d\n", op->name, pos, stack, scope);
675 stack += stack_minus(c);
678 stats->stack[pos].flags |= FLAG_ERROR;
679 fprintf(stderr, "error: stack underflow at %d (%s)\n", pos, op->name);
681 /* if we would do true verification (if we would be a vm), this is
682 where we would return the error
687 stack += op->stack_plus;
688 scope += op->scope_stack_plus;
690 if(stack > stats->maxstack)
691 stats->maxstack = stack;
692 if(scope > stats->maxscope)
693 stats->maxscope = scope;
695 if(op->flags & OP_SET_DXNS)
696 stats->flags |= FLAGS_SET_DXNS;
697 if(op->flags & OP_NEED_ACTIVATION)
698 stats->flags |= FLAGS_ACTIVATION;
700 if(c->opcode == OPCODE_NEWCLASS) {
701 abc_class_t*cls = (abc_class_t*)(c->data[0]);
702 if(scope > cls->init_scope_depth)
703 cls->init_scope_depth = scope;
705 if(c->opcode == OPCODE_NEWFUNCTION) {
706 abc_method_t*m = (abc_method_t*)(c->data[0]);
707 if(m->body && scope > m->body->init_scope_depth)
708 m->body->init_scope_depth = scope;
711 if(op->flags & OP_REGISTER) {
717 handleregister(stats, (ptroff_t)c->data[pos]);
723 handleregister(stats, c->opcode&3);
726 if(op->flags&OP_RETURN) {
727 if(OP_RETURN==0x48/*returnvalue*/) {
729 stats->stack[pos].flags |= FLAG_ERROR;
730 fprintf(stderr, "return(value) with stackposition %d\n", stack);
732 } else if(OP_RETURN==0x47) {
734 stats->stack[pos].flags |= FLAG_ERROR;
735 fprintf(stderr, "return(void) with stackposition %d\n", stack);
739 if(op->flags & (OP_THROW|OP_RETURN))
741 if(op->flags & OP_JUMP) {
743 stats->stack[pos].flags |= FLAG_ERROR;
744 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d.\n", op->name, pos);
751 if(op->flags & OP_BRANCH) {
753 stats->stack[pos].flags |= FLAG_ERROR;
754 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d\n", op->name, pos);
757 int newpos = c->branch->pos;
758 if(!callcode(stats, newpos, stack, scope))
761 if(op->flags & OP_LOOKUPSWITCH) {
762 lookupswitch_t*l = c->data[0];
764 stats->stack[pos].flags |= FLAG_ERROR;
765 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d\n", op->name, pos);
768 if(!callcode(stats, l->def->pos, stack, scope))
770 code_list_t*t = l->targets;
773 stats->stack[pos].flags |= FLAG_ERROR;
774 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d\n", op->name, pos);
777 if(!callcode(stats, t->code->pos, stack, scope))
785 assert(c->next == stats->stack[pos].code);
791 static currentstats_t* code_get_stats(code_t*code, abc_exception_list_t*exceptions)
793 code = code_start(code);
800 currentstats_t* current = malloc(sizeof(currentstats_t));
801 current->stack = rfx_calloc(sizeof(stackpos_t)*num);
802 current->maxlocal = 0;
803 current->maxstack = 0;
804 current->maxscope = 0;
808 //#define DEBUG_BYTES
813 opcode_t*op = opcode_get(c->opcode);
814 if(op->flags & (OP_JUMP|OP_BRANCH)) {
815 printf("%05d) %s %08x\n", t, op->name, c->branch);
816 } else if(op->params[0]=='2') {
817 printf("%05d) %s %s\n", t, op->name, multiname_tostring(c->data[0]));
818 } else if(op->params[0]=='N') {
819 printf("%05d) %s %s\n", t, op->name, namespace_tostring(c->data[0]));
821 printf("%05d) %s\n", t, op->name);
825 //printf("%05d) %02x\n", t, tag->data[start+t]);
832 current->stack[num].code = c;
838 if(!callcode(current, 0, 0, 0)) {
842 abc_exception_list_t*e = exceptions;
844 if(e->abc_exception->target)
845 callcode(current, e->abc_exception->target->pos, 1, 0);
852 void stats_free(currentstats_t*stats)
855 free(stats->stack);stats->stack=0;
860 int code_dump(code_t*c)
862 code_t*cc = code_start(c);
864 assert(!cc->next || cc->next->prev == cc);
868 return code_dump2(c, 0, 0, "", stdout);
870 int code_dump2(code_t*c, abc_exception_list_t*exceptions, abc_file_t*file, char*prefix, FILE*fo)
872 abc_exception_list_t*e = exceptions;
874 currentstats_t*stats = code_get_stats(c, exceptions);
878 U8 opcode = c->opcode;
880 opcode_t*op = opcode_get(opcode);
884 if(c==e->abc_exception->from)
885 fprintf(fo, "%s TRY {\n", prefix);
886 if(c==e->abc_exception->target) {
887 char*s1 = multiname_tostring(e->abc_exception->exc_type);
888 char*s2 = multiname_tostring(e->abc_exception->var_name);
889 fprintf(fo, "%s CATCH(%s %s)\n", prefix, s1, s2);
897 fprintf(stderr, "Can't parse opcode %02x.\n", opcode);
905 int f = stats->stack[c->pos].flags;
906 fprintf(fo, "%s%05d) %c %d:%d %s ", prefix, c->pos,
907 (f&FLAG_ERROR)?'E':((f&FLAG_SEEN)?'+':'|'),
908 stats->stack[c->pos].stackpos,
909 stats->stack[c->pos].scopepos,
912 fprintf(fo, "%s%05d) ? ?:? %s ", prefix, c->pos, op->name);
916 void*data = c->data[i];
921 int n = (ptroff_t)data;
922 fprintf(fo, "%d params", n);
923 } else if(*p == '2') {
924 multiname_t*n = (multiname_t*)data;
925 char* m = multiname_tostring(n);
926 fprintf(fo, "%s", m);
928 } else if(*p == 'N') {
929 namespace_t*ns = (namespace_t*)data;
930 char* m = namespace_tostring(ns);
931 fprintf(fo, "%s", m);
933 } else if(*p == 'm') {
934 abc_method_t*m = (abc_method_t*)data;
935 fprintf(fo, "[method %08x %s]", m->index, m->name);
936 } else if(*p == 'c') {
937 abc_class_t*cls = (abc_class_t*)data;
938 char*classname = multiname_tostring(cls->classname);
939 fprintf(fo, "[classinfo %08x %s]", cls->index, classname);
941 } else if(*p == 'i') {
942 abc_method_body_t*b = (abc_method_body_t*)data;
943 fprintf(fo, "[methodbody]");
944 } else if(*p == 'u' || *p == 'I' || *p == 'U') {
945 int n = (ptroff_t)data;
946 fprintf(fo, "%d", n);
947 } else if(*p == 'f') {
948 double f = *(double*)data;
949 fprintf(fo, "%f", f);
950 } else if(*p == 'r') {
951 int n = (ptroff_t)data;
952 fprintf(fo, "r%d", n);
953 } else if(*p == 'b') {
954 int b = (signed char)(ptroff_t)data;
955 fprintf(fo, "%d", b);
956 } else if(*p == 'j') {
958 fprintf(fo, "->%d", c->branch->pos);
960 fprintf(fo, "%08x", c->branch);
961 } else if(*p == 's') {
962 char*s = string_escape((string_t*)data);
963 fprintf(fo, "\"%s\"", s);
965 } else if(*p == 'D') {
966 fprintf(fo, "[register %02x=%s]", (ptroff_t)c->data[1], (char*)c->data[0]);
967 } else if(*p == 'S') {
968 lookupswitch_t*l = c->data[0];
971 fprintf(fo, "default->%d", l->def->pos);
973 fprintf(fo, "default->00000000");
974 code_list_t*t = l->targets;
977 fprintf(fo, ",->%d", t->code->pos);
979 fprintf(fo, ",->00000000");
984 fprintf(stderr, "Can't parse opcode param type \"%c\"\n", *p);
996 if(c==e->abc_exception->to) {
997 if(e->abc_exception->target)
998 fprintf(fo, "%s } // END TRY (HANDLER: %d)\n", prefix, e->abc_exception->target->pos);
1000 fprintf(fo, "%s } // END TRY (HANDLER: 00000000)\n", prefix);
1012 codestats_t* code_get_statistics(code_t*code, abc_exception_list_t*exceptions)
1014 currentstats_t*current = code_get_stats(code, exceptions);
1017 codestats_t*stats = rfx_calloc(sizeof(codestats_t));
1018 stats->local_count = current->maxlocal;
1019 stats->max_stack = current->maxstack;
1020 stats->max_scope_depth = current->maxscope;
1021 stats->flags = current->flags;
1023 stats_free(current);current=0;
1027 void codestats_free(codestats_t*s)
1032 code_t* add_opcode(code_t*atag, U8 op)
1034 code_t*tmp = (code_t*)rfx_calloc(sizeof(code_t));
1038 tmp->next = atag->next;
1040 tmp->next->prev = tmp;
1049 void codestats_print(codestats_t*stats)
1051 printf("max_stack: %d\n", stats->max_stack);
1052 printf("local_count: %d\n", stats->local_count);
1053 printf("scope_depth: %d\n", stats->max_scope_depth);
1056 code_t* code_end(code_t*code)
1064 code_t* code_start(code_t*code)
1073 code_t* code_append(code_t*code, code_t*toappend)
1076 return code_end(toappend);
1078 return code_end(code);
1079 //find end of first list
1083 code_t*start=toappend;
1084 //and start of second list
1085 while(start->prev) {
1086 start = start->prev;
1090 return code_end(toappend);
1093 lookupswitch_t*lookupswitch_dup(lookupswitch_t*l)
1095 lookupswitch_t*n = malloc(sizeof(lookupswitch_t));
1096 fprintf(stderr, "Error: lookupswitch dupping not supported yet\n");
1097 n->targets = list_clone(l->targets);
1101 code_t*code_dup(code_t*c)
1105 dict_t*pos2pos = dict_new2(&ptr_type);
1110 char does_branch = 0;
1113 memcpy(n, c, sizeof(code_t));
1117 if(c->opcode == OPCODE_LABEL || c->opcode == OPCODE_NOP) {
1118 dict_put(pos2pos, c, n);
1124 opcode_t*op = opcode_get(c->opcode);
1126 char*p = op?op->params:"";
1129 if(*p == '2') { //multiname
1130 c->data[pos] = multiname_clone(c->data[pos]);
1131 } else if(*p == 'N') { //multiname
1132 c->data[pos] = namespace_clone(c->data[pos]);
1133 } else if(*p == 's') {
1134 c->data[pos] = string_dup3(c->data[pos]);
1135 } else if(*p == 'D') {
1136 c->data[pos] = strdup(c->data[pos]);
1137 } else if(*p == 'f') {
1138 double old = *(double*)c->data[pos];
1139 c->data[pos] = malloc(sizeof(double));
1140 *(double*)c->data[pos] = old;
1141 } else if(strchr("S", *p)) {
1142 c->data[pos] = lookupswitch_dup(c->data[pos]);
1159 code_t*target = dict_lookup(pos2pos, c->branch);
1161 fprintf(stderr, "Error: Can't find branch target in code_dup\n");
1169 dict_destroy(pos2pos);
1173 code_t*code_cut(code_t*c)
1176 code_t*prev = c->prev;
1177 code_t*next = c->next;
1180 if(prev) prev->next=next;
1181 if(next) next->prev=prev;
1184 if(next) return code_end(next);
1188 code_t*code_cutlast(code_t*c)
1195 code_t* cut_last_push(code_t*c)
1200 opcode_t*op = opcode_get(c->opcode);
1201 /* cut conversion type operations */
1202 if(op->stack_minus == -1 && op->stack_plus == 1 && !(op->flags)) {
1203 c = code_cutlast(c);
1206 /* cut any type of push */
1207 else if(op->stack_minus == 0 && op->stack_plus == 1 && !(op->flags)) {
1208 return code_cutlast(c);
1210 /* cut register lookups */
1211 else if(c->opcode == OPCODE_GETLOCAL ||
1212 c->opcode == OPCODE_GETLOCAL_0 ||
1213 c->opcode == OPCODE_GETLOCAL_1 ||
1214 c->opcode == OPCODE_GETLOCAL_2 ||
1215 c->opcode == OPCODE_GETLOCAL_3) {
1216 return code_cutlast(c);
1218 /* discard function call values */
1219 else if(c->opcode == OPCODE_CALLPROPERTY) {
1220 c->opcode = OPCODE_CALLPROPVOID;
1222 } else if(c->opcode == OPCODE_CALLSUPER) {
1223 c->opcode = OPCODE_CALLSUPERVOID;
1225 } else if((c->opcode == OPCODE_NEWOBJECT ||
1226 c->opcode == OPCODE_NEWARRAY) &&
1228 // we can discard these if they're not eating up stack parameters
1229 return code_cutlast(c);
1230 } else if(op->stack_minus ==0 && op->stack_plus == 0 &&
1231 !(op->flags&~(OP_REGISTER|OP_SET_DXNS)) && c->prev) {
1232 // trim code *before* the kill, inclocal, declocal, dxns
1236 return code_append(cut_last_push(p), c);