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
41 /* 2 = u30 index into multiname
42 m = u30 index into method
43 n = u30 number of params
44 i = u30 index into method info
46 c = u30 index into class
47 s = string (u30 index into strings)
54 {0xa0, "add", "", -2, 1, 0, 0},
55 {0xc5, "add_i", "", -2, 1, 0, 0},
56 {0x86, "astype", "2", -1, 1, 0, 0},
57 {0x87, "astypelate", "", -2, 1, 0, 0},
58 {0xA8, "bitand", "", -2, 1, 0, 0},
59 {0x97, "bitnot", "", -1, 1, 0, 0},
60 {0xa9, "bitor", "", -2, 1, 0, 0},
61 {0xaa, "bitxor", "", -2, 1, 0, 0},
62 {0x41, "call", "n", -2, 1, 0, OP_STACK_ARGS},
63 {0x43, "callmethod", "mn", -1, 1, 0, OP_STACK_ARGS},
64 {0x4c, "callproplex", "2n", -1, 1, 0, OP_STACK_ARGS|OP_STACK_NS},
65 {0x46, "callproperty", "2n", -1, 1, 0, OP_STACK_ARGS|OP_STACK_NS},
66 {0x4f, "callpropvoid", "2n", -1, 0, 0, OP_STACK_ARGS|OP_STACK_NS},
67 {0x44, "callstatic", "in", -1, 1, 0, OP_STACK_ARGS},
68 {0x45, "callsuper", "2n", -1, 1, 0, OP_STACK_ARGS|OP_STACK_NS},
69 {0x4e, "callsupervoid", "2n", -1, 0, 0, OP_STACK_ARGS|OP_STACK_NS},
70 {0x78, "checkfilter", "", -1, 1, 0, 0},
71 {0x80, "coerce", "2", -1, 1, 0, 0},
72 {0x82, "coerce_a", "", -1, 1, 0, 0},
73 {0x85, "coerce_s", "", -1, 1, 0, 0},
74 {0x42, "construct", "n", -1, 1, 0, OP_STACK_ARGS},
75 {0x4a, "constructprop", "2n", -1, 1, 0, OP_STACK_ARGS|OP_STACK_NS},
76 {0x49, "constructsuper", "n", -1, 0, 0, OP_STACK_ARGS},
77 {0x76, "convert_b", "", -1, 1, 0, 0},
78 {0x73, "convert_i", "", -1, 1, 0, 0},
79 {0x75, "convert_d", "", -1, 1, 0, 0},
80 {0x77, "convert_o", "", -1, 1, 0, 0},
81 {0x74, "convert_u", "", -1, 1, 0, 0},
82 {0x70, "convert_s", "", -1, 1, 0, 0},
83 {0xef, "debug", "D", 0, 0, 0, 0},
84 {0xf1, "debugfile", "s", 0, 0, 0, 0},
85 {0xf0, "debugline", "u", 0, 0, 0, 0},
86 {0x94, "declocal", "r", 0, 0, 0, OP_REGISTER},
87 {0xc3, "declocal_i", "r", 0, 0, 0, OP_REGISTER},
88 {0x93, "decrement", "", -1, 1, 0, 0},
89 {0xc1, "decrement_i", "", -1, 1, 0, 0},
90 {0x6a, "deleteproperty", "2", -1, 1, 0, OP_STACK_NS},
91 {0xa3, "divide", "", -2, 1, 0, 0},
92 {0x2a, "dup", "", -1, 2, 0, 0},
93 {0x06, "dxns", "s", 0, 0, 0, OP_SET_DXNS},
94 {0x07, "dxnslate", "", -1, 0, 0, OP_SET_DXNS},
95 {0xab, "equals", "", -2, 1, 0, 0},
96 {0x72, "esc_xattr", "", -1, 1, 0, 0},
97 {0x71, "esc_xelem", "", -1, 1, 0, 0},
98 {0x5e, "findproperty", "2", 0, 1, 0, OP_STACK_NS},
99 {0x5d, "findpropstrict", "2", 0, 1, 0, OP_STACK_NS},
100 {0x59, "getdescendants", "2", -1, 1, 0, OP_STACK_NS},
101 {0x64, "getglobalscope", "", 0, 1, 0, 0},
102 {0x6e, "getglobalslot", "u", 0, 1, 0, 0},
103 {0x60, "getlex", "2", 0, 1, 0, 0}, //multiname may not be runtime
104 {0x62, "getlocal", "r", 0, 1, 0, OP_REGISTER},
105 {0xd0, "getlocal_0", "", 0, 1, 0, OP_REGISTER},
106 {0xd1, "getlocal_1", "", 0, 1, 0, OP_REGISTER},
107 {0xd2, "getlocal_2", "", 0, 1, 0, OP_REGISTER},
108 {0xd3, "getlocal_3", "", 0, 1, 0, OP_REGISTER},
109 {0x66, "getproperty", "2", -1, 1, 0, OP_STACK_NS},
110 {0x65, "getscopeobject", "u", 0, 1, 0, 0}, // u = index into scope stack
111 {0x6c, "getslot", "u", -1, 1, 0, 0},
112 {0x04, "getsuper", "2", -1, 1, 0, OP_STACK_NS},
113 {0xaf, "greaterthan", "", -2, 1, 0, 0},
114 {0xb0, "greaterequals", "", -2, 1, 0, 0},
115 {0x1f, "hasnext", "", -2, 1, 0, 0},
116 {0x32, "hasnext2", "rr", 0, 1, 0, OP_REGISTER},
117 {0x13, "ifeq", "j", -2, 0, 0, OP_BRANCH},
118 {0x12, "iffalse", "j", -1, 0, 0, OP_BRANCH},
119 {0x18, "ifge", "j", -2, 0, 0, OP_BRANCH},
120 {0x17, "ifgt", "j", -2, 0, 0, OP_BRANCH},
121 {0x16, "ifle", "j", -2, 0, 0, OP_BRANCH},
122 {0x15, "iflt", "j", -2, 0, 0, OP_BRANCH},
123 {0x0f, "ifnge", "j", -2, 0, 0, OP_BRANCH},
124 {0x0e, "ifngt", "j", -2, 0, 0, OP_BRANCH},
125 {0x0d, "ifnle", "j", -2, 0, 0, OP_BRANCH},
126 {0x0c, "ifnlt", "j", -2, 0, 0, OP_BRANCH},
127 {0x14, "ifne", "j", -2, 0, 0, OP_BRANCH},
128 {0x19, "ifstricteq", "j", -2, 0, 0, OP_BRANCH},
129 {0x1a, "ifstrictne", "j", -2, 0, 0, OP_BRANCH},
130 {0x11, "iftrue", "j", -1, 0, 0, OP_BRANCH},
131 {0xb4, "in", "", -2, 1, 0, 0},
132 {0x92, "inclocal", "r", 0, 0, 0, OP_REGISTER},
133 {0xc2, "inclocal_i", "r", 0, 0, 0, OP_REGISTER},
134 {0x91, "increment", "", -1, 1, 0, 0},
135 {0xc0, "increment_i", "", -1, 1, 0, 0},
136 {0x68, "initproperty", "2", -2, 0, 0, OP_STACK_NS},
137 {0xb1, "instanceof", "", -2, 1, 0, 0},
138 {0xb2, "istype", "2", -1, 1, 0, 0}, // may not be a runtime multiname
139 {0xb3, "istypelate", "", -2, 1, 0, 0},
140 {0x10, "jump", "j", 0, 0, 0, OP_JUMP},
141 {0x08, "kill", "r", 0, 0, 0, OP_REGISTER},
142 {0x09, "label", "", 0, 0, 0, OP_LABEL},
143 {0xae, "lessequals", "", -2, 1, 0, 0},
144 {0xad, "lessthan", "", -2, 1, 0, 0},
145 {0x1b, "lookupswitch", "S", -1, 0, 0, OP_LOOKUPSWITCH},
146 {0xa5, "lshift", "", -2, 1, 0, 0},
147 {0xa4, "modulo", "", -2, 1, 0, 0},
148 {0xa2, "multiply", "", -2, 1, 0, 0},
149 {0xc7, "multiply_i", "", -2, 1, 0, 0},
150 {0x90, "negate", "", -1, 1, 0, 0},
151 {0xc4, "negate_i", "", -1, 1, 0, 0},
152 {0x57, "newactivation", "", 0, 1, 0, OP_NEED_ACTIVATION},
153 {0x56, "newarray", "n", 0, 1, 0, OP_STACK_ARGS},
154 {0x5a, "newcatch", "u", 0, 1, 0, 0}, //u = index into exception_info
155 #define OP_NEWCLASS 0x58
156 {0x58, "newclass", "c", -1, 1, 0, 0}, //c = index into class_info
157 #define OP_NEWFUNCTION 0x40
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", "u", 0, 1, 0, 0}, //index into namespace TODO
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: seen in builtin.abc- followed by 0x01 (might be the number of stack params)
202 {0x53, "xxx1", "", -1, 0, 0, 0},
203 {0x01, "xxx2", "", 0, 0, 0, 0},
205 /* dummy instruction. Warning: this one is not actually supported by flash */
206 {0xff, "__break__", "", 0, 0, 0, OP_RETURN},
209 static U8 op2index[256] = {254};
211 opcode_t* opcode_get(U8 op)
214 if(op2index[0]==254) {
215 memset(op2index, 255, sizeof(op2index));
216 for(t=0;t<sizeof(opcodes)/sizeof(opcodes[0]);t++) {
217 op2index[opcodes[t].opcode] = t;
220 if(op2index[op]!=255)
221 return &opcodes[op2index[op]];
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;
303 if(*p == 'n') { // number
304 data = (void*)(ptroff_t)swf_GetU30(tag);
305 } else if(*p == '2') { //multiname
306 data = multiname_clone(pool_lookup_multiname(pool, swf_GetU30(tag)));
307 } else if(*p == 'U') { //uint
308 data = (void*)(ptroff_t)pool_lookup_uint(pool, swf_GetU30(tag));
309 } else if(*p == 'I') { //int
310 data = (void*)(ptroff_t)pool_lookup_int(pool, swf_GetU30(tag));
311 } else if(*p == 'f') { //int
312 double*fp = malloc(sizeof(double));
313 *fp = pool_lookup_float(pool, swf_GetU30(tag));
315 } else if(*p == 'm') { //method
316 data = array_getvalue(file->methods, swf_GetU30(tag));
317 } else if(*p == 'c') { //classinfo
318 data = array_getvalue(file->classes, swf_GetU30(tag));
319 } else if(*p == 'i') {
320 data = array_getvalue(file->method_bodies, swf_GetU30(tag));
321 } else if(*p == 'u') { // generic integer
322 data = (void*)(ptroff_t)swf_GetU30(tag);
323 } else if(*p == 'r') { // local register
324 data = (void*)(ptroff_t)swf_GetU30(tag);
325 } else if(*p == 'b') { // byte
326 data = (void*)(ptroff_t)swf_GetU8(tag);
327 } else if(*p == 'j') { // jump
328 int j = swf_GetS24(tag);
329 data = (void*)(ptroff_t)j;
330 } else if(*p == 's') { // string
331 data = strdup((char*)pool_lookup_string(pool, swf_GetU30(tag)));
332 } else if(*p == 'D') { // debug
334 U8 type = swf_GetU8(tag);
336 fprintf(stderr, "Unknown debug type: %02x\n", type);
338 code->data[0] = strdup((char*)pool_lookup_string(pool, swf_GetU30(tag)));
340 code->data[1] = (void*)(ptroff_t)swf_GetU8(tag);
343 } else if(*p == 'S') { // switch statement
344 lookupswitch_t*l = malloc(sizeof(lookupswitch_t));
345 l->def = (code_t*)(ptroff_t)swf_GetS24(tag);
346 l->targets = list_new();
347 int num = swf_GetU30(tag)+1;
350 list_append(l->targets, (code_t*)(ptroff_t)swf_GetS24(tag));
353 printf("Can't parse opcode param type \"%c\" (for op %02x %s).\n", *p, code->opcode, op->name);
357 code->data[pos++] = data;
362 //#define DEBUG_BYTES
366 code_t*c = bytepos[t];
368 opcode_t*op = opcode_get(c->opcode);
369 if(op->flags & (OP_JUMP|OP_BRANCH)) {
370 printf("%5d) %02x %s %d\n", t, tag->data[start+t], op->name, c->data[0]);
372 printf("%5d) %02x %s\n", t, tag->data[start+t], op->name);
375 printf("%5d) %02x\n", t, tag->data[start+t]);
378 //printf("%5d) %02x\n", t, tag->data[start+t]);
383 opcode_t*op = opcode_get(c->opcode);
384 if(op->flags & (OP_JUMP|OP_BRANCH)) {
385 int j = ((int)(ptroff_t)c->data[0]);
386 c->branch = pos2code(bytepos,c,j+4,len);
387 } else if(op->flags & (OP_LOOKUPSWITCH)) {
388 lookupswitch_t*l = (lookupswitch_t*)c->data[0];
390 l->def = pos2code(bytepos,c,(ptroff_t)l->def+offset,len);
391 code_list_t*t=l->targets;
393 t->code = pos2code(bytepos,c,(ptroff_t)t->code+offset,len);
401 (*codelookup) = malloc(sizeof(codelookup_t));
402 (*codelookup)->bytepos = bytepos;
403 (*codelookup)->len = len;
411 void codelookup_free(codelookup_t*codelookup)
413 free(codelookup->bytepos);codelookup->bytepos=0;
417 code_t*code_find_start(code_t*c)
424 void code_free(code_t*c)
426 c = code_find_start(c);
428 code_t*next = c->next;
429 opcode_t*op = opcode_get(c->opcode);
430 char*p = op?op->params:"";
433 void*data = c->data[pos];
434 if(*p == '2') { //multiname
435 multiname_destroy(data);
436 } else if(strchr("sDf", *p)) {
438 } else if(strchr("S", *p)) {
439 lookupswitch_t*l = (lookupswitch_t*)data;
440 list_free(l->targets);l->targets=0;
446 memset(c, 0, sizeof(c));
452 static int opcode_write(TAG*tag, code_t*c, pool_t*pool, abc_file_t*file, int length)
454 opcode_t*op = opcode_get(c->opcode);
460 swf_SetU8(tag, c->opcode);
464 void*data = c->data[pos++];
466 if(*p == 'n') { // number
467 len += swf_SetU30(tag, (ptroff_t)data);
468 } else if(*p == '2') { //multiname
469 multiname_t*m = (multiname_t*)data;
470 len += swf_SetU30(tag, pool_register_multiname(pool, m));
471 } else if(*p == 'm') { //method
472 abc_method_t*m = (abc_method_t*)data;
473 len += swf_SetU30(tag, m->index);
474 } else if(*p == 'c') { //classinfo
475 abc_class_t*cls = (abc_class_t*)data;
476 len += swf_SetU30(tag, cls->index);
477 } else if(*p == 'i') { //methodbody
478 abc_method_body_t*m = (abc_method_body_t*)data;
479 len += swf_SetU30(tag, m->index);
480 } else if(*p == 'I') { // int
481 len += swf_SetU30(tag, pool_register_int(pool, (ptroff_t)data));
482 } else if(*p == 'U') { // uint
483 len += swf_SetU30(tag, pool_register_uint(pool, (ptroff_t)data));
484 } else if(*p == 'f') { // float
485 len += swf_SetU30(tag, pool_register_float(pool, *(double*)data));
486 } else if(*p == 'u') { // integer
487 len += swf_SetU30(tag, (ptroff_t)data);
488 } else if(*p == 'r') { // integer
489 len += swf_SetU30(tag, (ptroff_t)data);
490 } else if(*p == 'b') { // byte
492 swf_SetU8(tag, (ptroff_t)data);
494 } else if(*p == 'j') { // jump
495 int skip = length-c->pos-4;
497 skip = (c->branch->pos) - c->pos - 4;
498 len += swf_SetS24(tag, skip);
499 } else if(*p == 's') { // string
500 int index = pool_register_string(pool, data);
501 len += swf_SetU30(tag, index);
502 } else if(*p == 'D') { // debug statement
506 len+=swf_SetU30(tag, pool_register_string(pool,c->data[0]));
508 swf_SetU8(tag, (ptroff_t)c->data[1]);
510 len+=swf_SetU30(tag, 0);
511 } else if(*p == 'S') { // switch statement
512 lookupswitch_t*l = (lookupswitch_t*)data;
514 len+=swf_SetS24(tag, l->def->pos-c->pos+offset); //default
515 code_list_t*t = l->targets;
517 len+=swf_SetU30(tag, list_length(t)-1); //nr-1
518 code_list_t*t = l->targets;
520 len+=swf_SetS24(tag, t->code->pos - c->pos+offset);
524 len+=swf_SetU30(tag, 0); //nr-1
525 len+=swf_SetS24(tag, l->def->pos-c->pos+offset);
528 printf("Can't parse opcode param type \"%c\"\n", *p);
535 void code_write(TAG*tag, code_t*code, pool_t*pool, abc_file_t*file)
537 code = code_find_start(code);
543 pos += opcode_write(0, c, pool, file, 0);
547 swf_SetU30(tag, pos);
548 int start = tag->len;
552 opcode_t*op = opcode_get(code->opcode);
553 if(op->flags&(OP_BRANCH|OP_JUMP)) {
556 pos += opcode_write(tag, c, pool, file, length);
559 assert(tag->len - start == pos);
579 static int stack_minus(code_t*c)
581 opcode_t*op = opcode_get(c->opcode);
582 if(op->stack_minus>0) {
583 fprintf(stderr, "Invalid opcode entry %02x %s\n", c->opcode, op->name);
585 int stack = op->stack_minus;
586 if(op->flags&OP_STACK_NS) {
587 multiname_t*m = (multiname_t*)c->data[0];
588 if(multiname_late_namespace(m))
590 if(multiname_late_name(m))
593 if(op->flags&OP_STACK_ARGS || op->flags&OP_STACK_ARGS2) {
594 assert(strchr(op->params, 'n'));
595 int nr = (ptroff_t)(op->params[0]=='n'?c->data[0]:c->data[1]);
597 if(op->flags&OP_STACK_ARGS2)
602 static void handleregister(currentstats_t*stats, int reg)
604 if(reg+1 > stats->maxlocal)
605 stats->maxlocal = reg+1;
611 static void dumpstack(currentstats_t*stats)
614 for(t=0;t<stats->num;t++) {
615 code_t*c = stats->stack[t].code;
616 opcode_t*op = opcode_get(c->opcode);
617 printf("%5d) %c %d:%d %s", t, (stats->stack[t].flags&FLAG_SEEN)?'x':'|',
618 stats->stack[t].stackpos,
619 stats->stack[t].scopepos,
622 if(op->flags&(OP_BRANCH|OP_JUMP)) {
624 printf(" ->%d\n", c->branch->pos);
626 printf(" 00000000\n");
628 if(op->params[0]=='2') {
629 printf(" %s", multiname_tostring(c->data[0]));
635 static char callcode(currentstats_t*stats, int pos, int stack, int scope)
637 while(pos<stats->num) {
638 if(stats->stack[pos].flags&FLAG_SEEN) {
639 if(stats->stack[pos].stackpos != stack ||
640 stats->stack[pos].scopepos != scope) {
642 stats->stack[pos].flags |= FLAG_ERROR;
643 fprintf(stderr, "Stack mismatch at pos %d\n", pos);
644 fprintf(stderr, "Should be: %d:%d, is: %d:%d\n", stack, scope,
645 stats->stack[pos].stackpos, stats->stack[pos].scopepos);
647 /* return error here if we do verification */
653 stats->stack[pos].flags |= FLAG_SEEN;
654 stats->stack[pos].stackpos = stack;
655 stats->stack[pos].scopepos = scope;
657 code_t*c = stats->stack[pos].code;
658 opcode_t*op = opcode_get(c->opcode);
660 //printf("Walking %s at position %d, stack=%d, scope=%d\n", op->name, pos, stack, scope);
662 stack += stack_minus(c);
665 stats->stack[pos].flags |= FLAG_ERROR;
666 fprintf(stderr, "error: stack underflow at %d (%s)\n", pos, op->name);
668 /* if we would do true verification (if we would be a vm), this is
669 where we would return the error
674 stack += op->stack_plus;
675 scope += op->scope_stack_plus;
677 if(stack > stats->maxstack)
678 stats->maxstack = stack;
679 if(scope > stats->maxscope)
680 stats->maxscope = scope;
682 if(op->flags & OP_SET_DXNS)
683 stats->flags |= FLAGS_SET_DXNS;
684 if(op->flags & OP_NEED_ACTIVATION)
685 stats->flags |= FLAGS_ACTIVATION;
687 if(c->opcode == OP_NEWCLASS) {
688 abc_class_t*cls = (abc_class_t*)(c->data[0]);
689 if(scope > cls->init_scope_depth)
690 cls->init_scope_depth = scope;
692 if(c->opcode == OP_NEWFUNCTION) {
693 abc_method_t*m = (abc_method_t*)(c->data[0]);
694 if(m->body && scope > m->body->init_scope_depth)
695 m->body->init_scope_depth = scope;
698 if(op->flags & OP_REGISTER) {
704 handleregister(stats, (ptroff_t)c->data[pos]);
710 handleregister(stats, c->opcode&3);
713 if(op->flags&OP_RETURN) {
714 if(OP_RETURN==0x48/*returnvalue*/) {
716 stats->stack[pos].flags |= FLAG_ERROR;
717 fprintf(stderr, "return(value) with stackposition %d\n", stack);
719 } else if(OP_RETURN==0x47) {
721 stats->stack[pos].flags |= FLAG_ERROR;
722 fprintf(stderr, "return(void) with stackposition %d\n", stack);
726 if(op->flags & (OP_THROW|OP_RETURN))
728 if(op->flags & OP_JUMP) {
730 stats->stack[pos].flags |= FLAG_ERROR;
731 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d.\n", op->name, pos);
738 if(op->flags & OP_BRANCH) {
740 stats->stack[pos].flags |= FLAG_ERROR;
741 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d\n", op->name, pos);
744 int newpos = c->branch->pos;
745 if(!callcode(stats, newpos, stack, scope))
748 if(op->flags & OP_LOOKUPSWITCH) {
749 lookupswitch_t*l = c->data[0];
751 stats->stack[pos].flags |= FLAG_ERROR;
752 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d\n", op->name, pos);
755 if(!callcode(stats, l->def->pos, stack, scope))
757 code_list_t*t = l->targets;
760 stats->stack[pos].flags |= FLAG_ERROR;
761 fprintf(stderr, "Error: Invalid jump target in instruction %s at position %d\n", op->name, pos);
764 if(!callcode(stats, t->code->pos, stack, scope))
772 assert(c->next == stats->stack[pos].code);
778 static currentstats_t* code_get_stats(code_t*code, abc_exception_list_t*exceptions)
780 code = code_find_start(code);
787 currentstats_t* current = malloc(sizeof(currentstats_t));
788 current->stack = rfx_calloc(sizeof(stackpos_t)*num);
789 current->maxlocal = 0;
790 current->maxstack = 0;
791 current->maxscope = 0;
795 //#define DEBUG_BYTES
800 opcode_t*op = opcode_get(c->opcode);
801 if(op->flags & (OP_JUMP|OP_BRANCH)) {
802 printf("%5d) %s %08x\n", t, op->name, c->branch);
803 } else if(op->params[0]=='2') {
804 printf("%5d) %s %s\n", t, op->name, multiname_tostring(c->data[0]));
806 printf("%5d) %s\n", t, op->name);
810 //printf("%5d) %02x\n", t, tag->data[start+t]);
817 current->stack[num].code = c;
823 if(!callcode(current, 0, 0, 0)) {
827 abc_exception_list_t*e = exceptions;
829 if(e->exception->target)
830 callcode(current, e->exception->target->pos, 1, 0);
837 void stats_free(currentstats_t*stats)
840 free(stats->stack);stats->stack=0;
845 int code_dump(code_t*c, abc_exception_list_t*exceptions, abc_file_t*file, char*prefix, FILE*fo)
847 abc_exception_list_t*e = exceptions;
848 c = code_find_start(c);
849 currentstats_t*stats = code_get_stats(c, exceptions);
853 U8 opcode = c->opcode;
855 opcode_t*op = opcode_get(opcode);
859 if(c==e->exception->from)
860 fprintf(fo, "%s TRY {\n", prefix);
861 if(c==e->exception->target) {
862 char*s1 = multiname_tostring(e->exception->exc_type);
863 char*s2 = multiname_tostring(e->exception->var_name);
864 fprintf(fo, "%s CATCH(%s %s)\n", prefix, s1, s2);
872 fprintf(stderr, "Can't parse opcode %02x.\n", opcode);
880 int f = stats->stack[c->pos].flags;
881 fprintf(fo, "%s%5d) %c %d:%d %s ", prefix, c->pos,
882 (f&FLAG_ERROR)?'E':((f&FLAG_SEEN)?'+':'|'),
883 stats->stack[c->pos].stackpos,
884 stats->stack[c->pos].scopepos,
887 fprintf(fo, "%s%5d) ? ?:? %s ", prefix, c->pos, op->name);
891 void*data = c->data[i];
896 int n = (ptroff_t)data;
897 fprintf(fo, "%d params", n);
898 } else if(*p == '2') {
899 multiname_t*n = (multiname_t*)data;
900 char* m = multiname_tostring(n);
901 fprintf(fo, "%s", m);
903 } else if(*p == 'm') {
904 abc_method_t*m = (abc_method_t*)data;
905 fprintf(fo, "[method %s]", m->name);
906 } else if(*p == 'c') {
907 abc_class_t*cls = (abc_class_t*)data;
908 char*classname = multiname_tostring(cls->classname);
909 fprintf(fo, "[classinfo %s]", classname);
911 } else if(*p == 'i') {
912 abc_method_body_t*b = (abc_method_body_t*)data;
913 fprintf(fo, "[methodbody]");
914 } else if(*p == 'u' || *p == 'I' || *p == 'U') {
915 int n = (ptroff_t)data;
916 fprintf(fo, "%d", n);
917 } else if(*p == 'f') {
918 double f = *(double*)data;
919 fprintf(fo, "%f", f);
920 } else if(*p == 'r') {
921 int n = (ptroff_t)data;
922 fprintf(fo, "r%d", n);
923 } else if(*p == 'b') {
924 int b = (ptroff_t)data;
925 fprintf(fo, "%02x", b);
926 } else if(*p == 'j') {
928 fprintf(fo, "->%d", c->branch->pos);
930 fprintf(fo, "%08x", c->branch);
931 } else if(*p == 's') {
932 fprintf(fo, "\"%s\"", data);
933 } else if(*p == 'D') {
934 fprintf(fo, "[register %02x=%s]", (ptroff_t)c->data[1], (char*)c->data[0]);
935 } else if(*p == 'S') {
936 lookupswitch_t*l = c->data[0];
939 fprintf(fo, "default->%d", l->def->pos);
941 fprintf(fo, "default->00000000", l->def->pos);
942 code_list_t*t = l->targets;
945 fprintf(fo, ",->%d", t->code->pos);
947 fprintf(fo, ",->00000000");
952 fprintf(stderr, "Can't parse opcode param type \"%c\"\n", *p);
964 if(c==e->exception->to) {
965 if(e->exception->target)
966 fprintf(fo, "%s } // END TRY (HANDLER: %d)\n", prefix, e->exception->target->pos);
968 fprintf(fo, "%s } // END TRY (HANDLER: 00000000)\n", prefix);
980 codestats_t* code_get_statistics(code_t*code, abc_exception_list_t*exceptions)
982 currentstats_t*current = code_get_stats(code, exceptions);
985 codestats_t*stats = rfx_calloc(sizeof(codestats_t));
986 stats->local_count = current->maxlocal;
987 stats->max_stack = current->maxstack;
988 stats->max_scope_depth = current->maxscope;
989 stats->flags = current->flags;
991 stats_free(current);current=0;
995 void codestats_free(codestats_t*s)
1000 code_t* add_opcode(code_t*atag, U8 op)
1002 code_t*tmp = (code_t*)rfx_calloc(sizeof(code_t));
1007 tmp->next = atag->next;
1015 void codestats_print(codestats_t*stats)
1017 printf("max_stack: %d\n", stats->max_stack);
1018 printf("local_count: %d\n", stats->local_count);
1019 printf("scope_depth: %d\n", stats->max_scope_depth);
1022 code_t* code_end(code_t*code)
1031 code_t* code_append(code_t*code, code_t*toappend)
1034 return code_end(toappend);
1036 return code_end(code);
1037 //find end of first list
1041 code_t*start=toappend;
1042 //and start of second list
1043 while(start->prev) {
1044 start = start->prev;
1048 return code_end(toappend);