| 72 | } |
| 73 | |
| 74 | static void PrintCode(const Proto* f) |
| 75 | { |
| 76 | const Instruction* code=f->code; |
| 77 | int pc,n=f->sizecode; |
| 78 | for (pc=0; pc<n; pc++) |
| 79 | { |
| 80 | Instruction i=code[pc]; |
| 81 | OpCode o=GET_OPCODE(i); |
| 82 | int a=GETARG_A(i); |
| 83 | int b=GETARG_B(i); |
| 84 | int c=GETARG_C(i); |
| 85 | int bx=GETARG_Bx(i); |
| 86 | int sbx=GETARG_sBx(i); |
| 87 | int line=getline(f,pc); |
| 88 | printf("\t%d\t",pc+1); |
| 89 | if (line>0) printf("[%d]\t",line); else printf("[-]\t"); |
| 90 | printf("%-9s\t",luaP_opnames[o]); |
| 91 | switch (getOpMode(o)) |
| 92 | { |
| 93 | case iABC: |
| 94 | printf("%d",a); |
| 95 | if (getBMode(o)!=OpArgN) printf(" %d",ISK(b) ? (-1-INDEXK(b)) : b); |
| 96 | if (getCMode(o)!=OpArgN) printf(" %d",ISK(c) ? (-1-INDEXK(c)) : c); |
| 97 | break; |
| 98 | case iABx: |
| 99 | if (getBMode(o)==OpArgK) printf("%d %d",a,-1-bx); else printf("%d %d",a,bx); |
| 100 | break; |
| 101 | case iAsBx: |
| 102 | if (o==OP_JMP) printf("%d",sbx); else printf("%d %d",a,sbx); |
| 103 | break; |
| 104 | } |
| 105 | switch (o) |
| 106 | { |
| 107 | case OP_LOADK: |
| 108 | printf("\t; "); PrintConstant(f,bx); |
| 109 | break; |
| 110 | case OP_GETUPVAL: |
| 111 | case OP_SETUPVAL: |
| 112 | printf("\t; %s", (f->sizeupvalues>0) ? getstr(f->upvalues[b]) : "-"); |
| 113 | break; |
| 114 | case OP_GETGLOBAL: |
| 115 | case OP_SETGLOBAL: |
| 116 | printf("\t; %s",svalue(&f->k[bx])); |
| 117 | break; |
| 118 | case OP_GETTABLE: |
| 119 | case OP_SELF: |
| 120 | if (ISK(c)) { printf("\t; "); PrintConstant(f,INDEXK(c)); } |
| 121 | break; |
| 122 | case OP_SETTABLE: |
| 123 | case OP_ADD: |
| 124 | case OP_SUB: |
| 125 | case OP_MUL: |
| 126 | case OP_DIV: |
| 127 | case OP_POW: |
| 128 | case OP_EQ: |
| 129 | case OP_LT: |
| 130 | case OP_LE: |
| 131 | if (ISK(b) || ISK(c)) |
no test coverage detected