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++];
475 case 'n': { // number
476 len += swf_SetU30(tag, (ptroff_t)data);
479 case '2': { //multiname
480 multiname_t*m = (multiname_t*)data;
481 len += swf_SetU30(tag, pool_register_multiname(pool, m));
484 case 'N': { //namespace
485 namespace_t*ns = (namespace_t*)data;
486 len += swf_SetU30(tag, pool_register_namespace(pool, ns));
490 abc_method_t*m = (abc_method_t*)data;
491 len += swf_SetU30(tag, m->index);
494 case 'c': { //classinfo
495 abc_class_t*cls = (abc_class_t*)data;
496 len += swf_SetU30(tag, cls->index);
499 case 'i': { //methodbody
500 abc_method_body_t*m = (abc_method_body_t*)data;
501 len += swf_SetU30(tag, m->index);
505 len += swf_SetU30(tag, pool_register_int(pool, (ptroff_t)data));
509 len += swf_SetU30(tag, pool_register_uint(pool, (ptroff_t)data));
513 len += swf_SetU30(tag, pool_register_float(pool, *(double*)data));
516 case 'u': { // integer
517 len += swf_SetU30(tag, (ptroff_t)data);
520 case 'r': { // integer
521 len += swf_SetU30(tag, (ptroff_t)data);
526 swf_SetU8(tag, (ptroff_t)data);
531 int skip = length-c->pos-4;
533 skip = (c->branch->pos) - c->pos - 4;
534 len += swf_SetS24(tag, skip);
537 case 's': { // string
538 int index = pool_register_string2(pool, (string_t*)data);
539 len += swf_SetU30(tag, index);
542 case 'D': { // debug statement
546 len+=swf_SetU30(tag, pool_register_string(pool,c->data[0]));
548 swf_SetU8(tag, (ptroff_t)c->data[1]);
550 len+=swf_SetU30(tag, 0);
553 case 'S': { // switch statement
554 lookupswitch_t*l = (lookupswitch_t*)data;
556 len+=swf_SetS24(tag, l->def->pos-c->pos+offset); //default
557 code_list_t*t = l->targets;
559 len+=swf_SetU30(tag, list_length(t)-1); //nr-1
560 code_list_t*t = l->targets;
562 len+=swf_SetS24(tag, t->code->pos - c->pos+offset);
566 len+=swf_SetU30(tag, 0); //nr-1
567 len+=swf_SetS24(tag, l->def->pos-c->pos+offset);
572 printf("Can't parse opcode param type \"%c\"\n", *p);
579 void code_write(TAG*tag, code_t*code, pool_t*pool, abc_file_t*file)
581 code = code_start(code);
587 pos += opcode_write(0, c, pool, file, 0);
591 swf_SetU30(tag, pos);
592 int start = tag->len;
596 opcode_t*op = opcode_get(code->opcode);
597 if(op->flags&(OP_BRANCH|OP_JUMP)) {
600 pos += opcode_write(tag, c, pool, file, length);
603 assert(tag->len - start == pos);
623 static int stack_minus(code_t*c)
625 opcode_t*op = opcode_get(c->opcode);
626 if(op->stack_minus>0) {
627 fprintf(stderr, "Invalid opcode entry %02x %s\n", c->opcode, op->name);
629 int stack = op->stack_minus;
630 if(op->flags&OP_STACK_NS) {
631 multiname_t*m = (multiname_t*)c->data[0];
632 if(multiname_late_namespace(m))
634 if(multiname_late_name(m))
637 if(op->flags&OP_STACK_ARGS || op->flags&OP_STACK_ARGS2) {
638 assert(strchr(op->params, 'n'));
639 int nr = (ptroff_t)(op->params[0]=='n'?c->data[0]:c->data[1]);
641 if(op->flags&OP_STACK_ARGS2)
646 static void handleregister(currentstats_t*stats, int reg)
648 if(reg+1 > stats->maxlocal)
649 stats->maxlocal = reg+1;
655 static void dumpstack(currentstats_t*stats)
658 for(t=0;t<stats->num;t++) {
659 code_t*c = stats->stack[t].code;
660 opcode_t*op = opcode_get(c->opcode);
661 printf("%05d) %c %d:%d %s", t, (stats->stack[t].flags&FLAG_SEEN)?'x':'|',
662 stats->stack[t].stackpos,
663 stats->stack[t].scopepos,
666 if(op->flags&(OP_BRANCH|OP_JUMP)) {
668 printf(" ->%d\n", c->branch->pos);
670 printf(" 00000000\n");
672 if(op->params[0]=='2') {
673 printf(" %s", multiname_tostring(c->data[0]));
674 } else if(op->params[0]=='N') {
675 printf(" %s", namespace_tostring(c->data[0]));
681 static char callcode(currentstats_t*stats, int pos, int stack, int scope)
683 while(pos<stats->num) {
684 if(stats->stack[pos].flags&FLAG_SEEN) {
685 if(stats->stack[pos].stackpos != stack ||
686 stats->stack[pos].scopepos != scope) {
688 stats->stack[pos].flags |= FLAG_ERROR;
689 fprintf(stderr, "Stack mismatch at pos %d\n", pos);
690 fprintf(stderr, "Should be: %d:%d, is: %d:%d\n", stack, scope,
691 stats->stack[pos].stackpos, stats->stack[pos].scopepos);
693 /* return error here if we do verification */
699 stats->stack[pos].flags |= FLAG_SEEN;
700 stats->stack[pos].stackpos = stack;
701 stats->stack[pos].scopepos = scope;
703 code_t*c = stats->stack[pos].code;
704 opcode_t*op = opcode_get(c->opcode);
706 //printf("Walking %s at position %d, stack=%d, scope=%d\n", op->name, pos, stack, scope);
708 stack += stack_minus(c);
711 stats->stack[pos].flags |= FLAG_ERROR;
712 fprintf(stderr, "error: stack underflow at %d (%s)\n", pos, op->name);
714 /* if we would do true verification (if we would be a vm), this is
715 where we would return the error
720 stack += op->stack_plus;
721 scope += op->scope_stack_plus;
723 if(stack > stats->maxstack)
724 stats->maxstack = stack;
725 if(scope > stats->maxscope)
726 stats->maxscope = scope;
728 if(op->flags & OP_SET_DXNS)
729 stats->flags |= FLAGS_SET_DXNS;
730 if(op->flags & OP_NEED_ACTIVATION)
731 stats->flags |= FLAGS_ACTIVATION;
733 if(c->opcode == OPCODE_NEWCLASS) {
734 abc_class_t*cls = (abc_class_t*)(c->data[0]);
735 if(scope > cls->init_scope_depth)
736 cls->init_scope_depth = scope;
738 if(c->opcode == OPCODE_NEWFUNCTION) {
739 abc_method_t*m = (abc_method_t*)(c->data[0]);
740 if(m->body && scope > m->body->init_scope_depth)
741 m->body->init_scope_depth = scope;
744 if(op->flags & OP_REGISTER) {
750 handleregister(stats, (ptroff_t)c->data[pos]);
756 handleregister(stats, c->opcode&3);
759 if(op->flags&OP_RETURN) {
760 if(OP_RETURN==0x48/*returnvalue*/) {
762 stats->stack[pos].flags |= FLAG_ERROR;
763 fprintf(stderr, "return(value) with stackposition %d\n", stack);
765 } else if(OP_RETURN==0x47) {
767 stats->stack[pos].flags |= FLAG_ERROR;
768 fprintf(stderr, "return(void) with stackposition %d\n", stack);
772 if(op->flags & (OP_THROW|OP_RETURN))
774 if(op->flags & OP_JUMP) {
776 stats->stack[pos].flags |= FLAG_ERROR;
777 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d.\n", op->name, pos);
784 if(op->flags & OP_BRANCH) {
786 stats->stack[pos].flags |= FLAG_ERROR;
787 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d\n", op->name, pos);
790 int newpos = c->branch->pos;
791 if(!callcode(stats, newpos, stack, scope))
794 if(op->flags & OP_LOOKUPSWITCH) {
795 lookupswitch_t*l = c->data[0];
797 stats->stack[pos].flags |= FLAG_ERROR;
798 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d\n", op->name, pos);
801 if(!callcode(stats, l->def->pos, stack, scope))
803 code_list_t*t = l->targets;
806 stats->stack[pos].flags |= FLAG_ERROR;
807 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d\n", op->name, pos);
810 if(!callcode(stats, t->code->pos, stack, scope))
818 assert(c->next == stats->stack[pos].code);
824 static currentstats_t* code_get_stats(code_t*code, abc_exception_list_t*exceptions)
826 code = code_start(code);
833 currentstats_t* current = malloc(sizeof(currentstats_t));
834 current->stack = rfx_calloc(sizeof(stackpos_t)*num);
835 current->maxlocal = 0;
836 current->maxstack = 0;
837 current->maxscope = 0;
841 //#define DEBUG_BYTES
846 opcode_t*op = opcode_get(c->opcode);
847 if(op->flags & (OP_JUMP|OP_BRANCH)) {
848 printf("%05d) %s %08x\n", t, op->name, c->branch);
849 } else if(op->params[0]=='2') {
850 printf("%05d) %s %s\n", t, op->name, multiname_tostring(c->data[0]));
851 } else if(op->params[0]=='N') {
852 printf("%05d) %s %s\n", t, op->name, namespace_tostring(c->data[0]));
854 printf("%05d) %s\n", t, op->name);
858 //printf("%05d) %02x\n", t, tag->data[start+t]);
865 current->stack[num].code = c;
871 if(!callcode(current, 0, 0, 0)) {
875 abc_exception_list_t*e = exceptions;
877 if(e->abc_exception->target)
878 callcode(current, e->abc_exception->target->pos, 1, 0);
885 void stats_free(currentstats_t*stats)
888 free(stats->stack);stats->stack=0;
893 int code_dump(code_t*c)
895 code_t*cc = code_start(c);
897 assert(!cc->next || cc->next->prev == cc);
901 return code_dump2(c, 0, 0, "", stdout);
903 int code_dump2(code_t*c, abc_exception_list_t*exceptions, abc_file_t*file, char*prefix, FILE*fo)
905 abc_exception_list_t*e = exceptions;
907 currentstats_t*stats = code_get_stats(c, exceptions);
911 U8 opcode = c->opcode;
913 opcode_t*op = opcode_get(opcode);
917 if(c==e->abc_exception->from)
918 fprintf(fo, "%s TRY {\n", prefix);
919 if(c==e->abc_exception->target) {
920 char*s1 = multiname_tostring(e->abc_exception->exc_type);
921 char*s2 = multiname_tostring(e->abc_exception->var_name);
922 fprintf(fo, "%s CATCH(%s %s)\n", prefix, s1, s2);
930 fprintf(stderr, "Can't parse opcode %02x.\n", opcode);
938 int f = stats->stack[c->pos].flags;
939 fprintf(fo, "%s%05d) %c %d:%d %s ", prefix, c->pos,
940 (f&FLAG_ERROR)?'E':((f&FLAG_SEEN)?'+':'|'),
941 stats->stack[c->pos].stackpos,
942 stats->stack[c->pos].scopepos,
945 fprintf(fo, "%s%05d) ? ?:? %s ", prefix, c->pos, op->name);
949 void*data = c->data[i];
954 int n = (ptroff_t)data;
955 fprintf(fo, "%d params", n);
956 } else if(*p == '2') {
957 multiname_t*n = (multiname_t*)data;
958 char* m = multiname_tostring(n);
959 fprintf(fo, "%s", m);
961 } else if(*p == 'N') {
962 namespace_t*ns = (namespace_t*)data;
963 char* m = namespace_tostring(ns);
964 fprintf(fo, "%s", m);
966 } else if(*p == 'm') {
967 abc_method_t*m = (abc_method_t*)data;
968 fprintf(fo, "[method %08x %s]", m->index, m->name);
969 } else if(*p == 'c') {
970 abc_class_t*cls = (abc_class_t*)data;
971 char*classname = multiname_tostring(cls->classname);
972 fprintf(fo, "[classinfo %08x %s]", cls->index, classname);
974 } else if(*p == 'i') {
975 abc_method_body_t*b = (abc_method_body_t*)data;
976 fprintf(fo, "[methodbody]");
977 } else if(*p == 'u' || *p == 'I' || *p == 'U') {
978 int n = (ptroff_t)data;
979 fprintf(fo, "%d", n);
980 } else if(*p == 'f') {
981 double f = *(double*)data;
982 fprintf(fo, "%f", f);
983 } else if(*p == 'r') {
984 int n = (ptroff_t)data;
985 fprintf(fo, "r%d", n);
986 } else if(*p == 'b') {
987 int b = (signed char)(ptroff_t)data;
988 fprintf(fo, "%d", b);
989 } else if(*p == 'j') {
991 fprintf(fo, "->%d", c->branch->pos);
993 fprintf(fo, "%08x", c->branch);
994 } else if(*p == 's') {
995 char*s = string_escape((string_t*)data);
996 fprintf(fo, "\"%s\"", s);
998 } else if(*p == 'D') {
999 fprintf(fo, "[register %02x=%s]", (ptroff_t)c->data[1], (char*)c->data[0]);
1000 } else if(*p == 'S') {
1001 lookupswitch_t*l = c->data[0];
1004 fprintf(fo, "default->%d", l->def->pos);
1006 fprintf(fo, "default->00000000");
1007 code_list_t*t = l->targets;
1010 fprintf(fo, ",->%d", t->code->pos);
1012 fprintf(fo, ",->00000000");
1017 fprintf(stderr, "Can't parse opcode param type \"%c\"\n", *p);
1029 if(c==e->abc_exception->to) {
1030 if(e->abc_exception->target)
1031 fprintf(fo, "%s } // END TRY (HANDLER: %d)\n", prefix, e->abc_exception->target->pos);
1033 fprintf(fo, "%s } // END TRY (HANDLER: 00000000)\n", prefix);
1045 codestats_t* code_get_statistics(code_t*code, abc_exception_list_t*exceptions)
1047 currentstats_t*current = code_get_stats(code, exceptions);
1050 codestats_t*stats = rfx_calloc(sizeof(codestats_t));
1051 stats->local_count = current->maxlocal;
1052 stats->max_stack = current->maxstack;
1053 stats->max_scope_depth = current->maxscope;
1054 stats->flags = current->flags;
1056 stats_free(current);current=0;
1060 void codestats_free(codestats_t*s)
1065 code_t* add_opcode(code_t*atag, U8 op)
1067 code_t*tmp = (code_t*)rfx_calloc(sizeof(code_t));
1071 tmp->next = atag->next;
1073 tmp->next->prev = tmp;
1082 void codestats_print(codestats_t*stats)
1084 printf("max_stack: %d\n", stats->max_stack);
1085 printf("local_count: %d\n", stats->local_count);
1086 printf("scope_depth: %d\n", stats->max_scope_depth);
1089 code_t* code_end(code_t*code)
1097 code_t* code_start(code_t*code)
1106 code_t* code_append(code_t*code, code_t*toappend)
1109 return code_end(toappend);
1111 return code_end(code);
1112 //find end of first list
1116 code_t*start=toappend;
1117 //and start of second list
1118 while(start->prev) {
1119 start = start->prev;
1123 return code_end(toappend);
1126 lookupswitch_t*lookupswitch_dup(lookupswitch_t*l)
1128 lookupswitch_t*n = malloc(sizeof(lookupswitch_t));
1129 fprintf(stderr, "Error: lookupswitch dupping not supported yet\n");
1130 n->targets = list_clone(l->targets);
1134 code_t*code_dup(code_t*c)
1138 dict_t*pos2pos = dict_new2(&ptr_type);
1143 char does_branch = 0;
1146 memcpy(n, c, sizeof(code_t));
1150 if(c->opcode == OPCODE_LABEL || c->opcode == OPCODE_NOP) {
1151 dict_put(pos2pos, c, n);
1157 opcode_t*op = opcode_get(c->opcode);
1159 char*p = op?op->params:"";
1162 if(*p == '2') { //multiname
1163 c->data[pos] = multiname_clone(c->data[pos]);
1164 } else if(*p == 'N') { //multiname
1165 c->data[pos] = namespace_clone(c->data[pos]);
1166 } else if(*p == 's') {
1167 c->data[pos] = string_dup3(c->data[pos]);
1168 } else if(*p == 'D') {
1169 c->data[pos] = strdup(c->data[pos]);
1170 } else if(*p == 'f') {
1171 double old = *(double*)c->data[pos];
1172 c->data[pos] = malloc(sizeof(double));
1173 *(double*)c->data[pos] = old;
1174 } else if(strchr("S", *p)) {
1175 c->data[pos] = lookupswitch_dup(c->data[pos]);
1192 code_t*target = dict_lookup(pos2pos, c->branch);
1194 fprintf(stderr, "Error: Can't find branch target in code_dup\n");
1202 dict_destroy(pos2pos);
1206 code_t*code_cut(code_t*c)
1209 code_t*prev = c->prev;
1210 code_t*next = c->next;
1213 if(prev) prev->next=next;
1214 if(next) next->prev=prev;
1217 if(next) return code_end(next);
1221 code_t*code_cutlast(code_t*c)
1228 char is_getlocal(code_t*c)
1231 if(c->opcode == OPCODE_GETLOCAL ||
1232 c->opcode == OPCODE_GETLOCAL_0 ||
1233 c->opcode == OPCODE_GETLOCAL_1 ||
1234 c->opcode == OPCODE_GETLOCAL_2 ||
1235 c->opcode == OPCODE_GETLOCAL_3) {
1241 code_t* cut_last_push(code_t*c)
1246 opcode_t*op = opcode_get(c->opcode);
1247 /* cut conversion type operations */
1248 if(op->stack_minus == -1 && op->stack_plus == 1 && !(op->flags)) {
1249 c = code_cutlast(c);
1252 /* cut any type of push */
1253 else if(op->stack_minus == 0 && op->stack_plus == 1 && !(op->flags)) {
1254 return code_cutlast(c);
1256 /* cut register lookups */
1257 else if(c->opcode == OPCODE_GETLOCAL ||
1258 c->opcode == OPCODE_GETLOCAL_0 ||
1259 c->opcode == OPCODE_GETLOCAL_1 ||
1260 c->opcode == OPCODE_GETLOCAL_2 ||
1261 c->opcode == OPCODE_GETLOCAL_3) {
1262 return code_cutlast(c);
1264 /* discard function call values */
1265 else if(c->opcode == OPCODE_CALLPROPERTY) {
1266 c->opcode = OPCODE_CALLPROPVOID;
1268 } else if(c->opcode == OPCODE_CALLSUPER) {
1269 c->opcode = OPCODE_CALLSUPERVOID;
1271 } else if((c->opcode == OPCODE_NEWOBJECT ||
1272 c->opcode == OPCODE_NEWARRAY) &&
1274 // we can discard these if they're not eating up stack parameters
1275 return code_cutlast(c);
1276 } else if(op->stack_minus ==0 && op->stack_plus == 0 &&
1277 !(op->flags&~(OP_REGISTER|OP_SET_DXNS)) && c->prev) {
1278 // trim code *before* the kill, inclocal, declocal, dxns
1282 return code_append(cut_last_push(p), c);