2014-05-03 18:27:38 -04:00
|
|
|
/*
|
|
|
|
* This file is part of the Micro Python project, http://micropython.org/
|
|
|
|
*
|
|
|
|
* The MIT License (MIT)
|
|
|
|
*
|
|
|
|
* Copyright (c) 2013, 2014 Damien P. George
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2013-11-17 08:19:33 -05:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <assert.h>
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
#include "mpconfig.h"
|
2014-05-02 10:47:01 -04:00
|
|
|
#include "misc.h"
|
2014-01-21 16:40:13 -05:00
|
|
|
#include "qstr.h"
|
2014-09-04 09:44:01 -04:00
|
|
|
#include "obj.h"
|
|
|
|
#include "runtime.h"
|
2013-12-21 13:17:45 -05:00
|
|
|
#include "bc0.h"
|
2014-09-04 09:44:01 -04:00
|
|
|
#include "bc.h"
|
2013-11-17 08:19:33 -05:00
|
|
|
|
2014-01-19 06:48:48 -05:00
|
|
|
#if MICROPY_DEBUG_PRINTERS
|
2014-01-07 10:20:33 -05:00
|
|
|
|
2014-02-20 19:31:05 -05:00
|
|
|
#define DECODE_UINT { \
|
|
|
|
unum = 0; \
|
|
|
|
do { \
|
|
|
|
unum = (unum << 7) + (*ip & 0x7f); \
|
|
|
|
} while ((*ip++ & 0x80) != 0); \
|
|
|
|
}
|
2013-11-17 08:19:33 -05:00
|
|
|
#define DECODE_ULABEL do { unum = (ip[0] | (ip[1] << 8)); ip += 2; } while (0)
|
|
|
|
#define DECODE_SLABEL do { unum = (ip[0] | (ip[1] << 8)) - 0x8000; ip += 2; } while (0)
|
2014-02-20 19:31:05 -05:00
|
|
|
#define DECODE_QSTR { \
|
|
|
|
qstr = 0; \
|
|
|
|
do { \
|
|
|
|
qstr = (qstr << 7) + (*ip & 0x7f); \
|
|
|
|
} while ((*ip++ & 0x80) != 0); \
|
|
|
|
}
|
2014-04-13 06:22:44 -04:00
|
|
|
#define DECODE_PTR do { \
|
2014-07-03 08:25:24 -04:00
|
|
|
ip = (byte*)(((mp_uint_t)ip + sizeof(mp_uint_t) - 1) & (~(sizeof(mp_uint_t) - 1))); /* align ip */ \
|
|
|
|
unum = *(mp_uint_t*)ip; \
|
|
|
|
ip += sizeof(mp_uint_t); \
|
2014-04-13 06:22:44 -04:00
|
|
|
} while (0)
|
2013-11-17 08:19:33 -05:00
|
|
|
|
2014-10-25 10:07:02 -04:00
|
|
|
void mp_bytecode_print(const void *descr, mp_uint_t n_total_args, const byte *ip, mp_uint_t len) {
|
2013-11-17 08:19:33 -05:00
|
|
|
const byte *ip_start = ip;
|
2013-12-30 17:32:17 -05:00
|
|
|
|
2014-01-18 18:24:36 -05:00
|
|
|
// get code info size
|
2014-04-13 09:51:56 -04:00
|
|
|
const byte *code_info = ip;
|
2014-09-04 09:44:01 -04:00
|
|
|
mp_uint_t code_info_size = mp_decode_uint(&code_info);
|
2014-01-18 18:24:36 -05:00
|
|
|
ip += code_info_size;
|
|
|
|
|
2014-09-04 09:44:01 -04:00
|
|
|
qstr block_name = mp_decode_uint(&code_info);
|
|
|
|
qstr source_file = mp_decode_uint(&code_info);
|
2014-10-03 13:54:25 -04:00
|
|
|
printf("File %s, code block '%s' (descriptor: %p, bytecode @%p " UINT_FMT " bytes)\n",
|
2014-06-02 18:24:29 -04:00
|
|
|
qstr_str(source_file), qstr_str(block_name), descr, code_info, len);
|
2014-06-02 09:11:16 -04:00
|
|
|
|
2014-10-24 10:42:50 -04:00
|
|
|
// raw bytecode dump
|
|
|
|
printf("Raw bytecode (code_info_size=" UINT_FMT ", bytecode_size=" UINT_FMT "):\n", code_info_size, len - code_info_size);
|
|
|
|
for (mp_uint_t i = 0; i < len; i++) {
|
|
|
|
if (i > 0 && i % 16 == 0) {
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
printf(" %02x", ip_start[i]);
|
|
|
|
}
|
|
|
|
printf("\n");
|
|
|
|
|
2014-10-25 10:07:02 -04:00
|
|
|
// bytecode prelude: arg names (as qstr objects)
|
|
|
|
printf("arg names:");
|
|
|
|
for (int i = 0; i < n_total_args; i++) {
|
|
|
|
printf(" %s", qstr_str(MP_OBJ_QSTR_VALUE(*(mp_obj_t*)ip)));
|
|
|
|
ip += sizeof(mp_obj_t);
|
|
|
|
}
|
|
|
|
printf("\n");
|
|
|
|
|
2014-03-28 14:38:20 -04:00
|
|
|
// bytecode prelude: state size and exception stack size; 16 bit uints
|
|
|
|
{
|
2014-09-04 09:44:01 -04:00
|
|
|
uint n_state = mp_decode_uint(&ip);
|
|
|
|
uint n_exc_stack = mp_decode_uint(&ip);
|
2014-03-28 14:38:20 -04:00
|
|
|
printf("(N_STATE %u)\n", n_state);
|
|
|
|
printf("(N_EXC_STACK %u)\n", n_exc_stack);
|
|
|
|
}
|
|
|
|
|
|
|
|
// bytecode prelude: initialise closed over variables
|
2013-12-30 17:32:17 -05:00
|
|
|
{
|
|
|
|
uint n_local = *ip++;
|
|
|
|
printf("(NUM_LOCAL %u)\n", n_local);
|
|
|
|
for (; n_local > 0; n_local--) {
|
|
|
|
uint local_num = *ip++;
|
|
|
|
printf("(INIT_CELL %u)\n", local_num);
|
|
|
|
}
|
|
|
|
len -= ip - ip_start;
|
|
|
|
}
|
|
|
|
|
2014-04-13 09:51:56 -04:00
|
|
|
// print out line number info
|
|
|
|
{
|
2014-10-24 10:42:50 -04:00
|
|
|
mp_int_t bc = (ip_start + code_info_size) - ip; // start counting from the prelude
|
2014-07-03 08:25:24 -04:00
|
|
|
mp_uint_t source_line = 1;
|
2014-04-13 09:51:56 -04:00
|
|
|
printf(" bc=" INT_FMT " line=" UINT_FMT "\n", bc, source_line);
|
2014-10-24 10:42:50 -04:00
|
|
|
for (const byte* ci = code_info; *ci;) {
|
2014-07-31 12:12:01 -04:00
|
|
|
if ((ci[0] & 0x80) == 0) {
|
|
|
|
// 0b0LLBBBBB encoding
|
|
|
|
bc += ci[0] & 0x1f;
|
|
|
|
source_line += ci[0] >> 5;
|
|
|
|
ci += 1;
|
|
|
|
} else {
|
|
|
|
// 0b1LLLBBBB 0bLLLLLLLL encoding (l's LSB in second byte)
|
|
|
|
bc += ci[0] & 0xf;
|
|
|
|
source_line += ((ci[0] << 4) & 0x700) | ci[1];
|
|
|
|
ci += 2;
|
|
|
|
}
|
2014-04-13 09:51:56 -04:00
|
|
|
printf(" bc=" INT_FMT " line=" UINT_FMT "\n", bc, source_line);
|
|
|
|
}
|
|
|
|
}
|
2014-05-10 05:36:38 -04:00
|
|
|
mp_bytecode_print2(ip, len - 0);
|
2014-04-22 20:40:24 -04:00
|
|
|
}
|
2014-04-13 09:51:56 -04:00
|
|
|
|
2014-10-03 13:44:14 -04:00
|
|
|
void mp_bytecode_print2(const byte *ip, mp_uint_t len) {
|
2014-04-22 20:40:24 -04:00
|
|
|
const byte *ip_start = ip;
|
2014-07-03 08:25:24 -04:00
|
|
|
mp_uint_t unum;
|
2013-11-17 08:19:33 -05:00
|
|
|
qstr qstr;
|
|
|
|
while (ip - ip_start < len) {
|
|
|
|
printf("%02u ", (uint)(ip - ip_start));
|
2014-10-03 13:44:14 -04:00
|
|
|
switch (*ip++) {
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_CONST_FALSE:
|
2013-11-17 08:19:33 -05:00
|
|
|
printf("LOAD_CONST_FALSE");
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_CONST_NONE:
|
2013-11-17 08:19:33 -05:00
|
|
|
printf("LOAD_CONST_NONE");
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_CONST_TRUE:
|
2013-11-17 08:19:33 -05:00
|
|
|
printf("LOAD_CONST_TRUE");
|
|
|
|
break;
|
|
|
|
|
2014-01-04 13:44:46 -05:00
|
|
|
case MP_BC_LOAD_CONST_ELLIPSIS:
|
|
|
|
printf("LOAD_CONST_ELLIPSIS");
|
|
|
|
break;
|
|
|
|
|
2014-02-19 08:47:59 -05:00
|
|
|
case MP_BC_LOAD_CONST_SMALL_INT: {
|
2014-07-03 08:25:24 -04:00
|
|
|
mp_int_t num = 0;
|
2014-02-19 08:47:59 -05:00
|
|
|
if ((ip[0] & 0x40) != 0) {
|
|
|
|
// Number is negative
|
|
|
|
num--;
|
|
|
|
}
|
|
|
|
do {
|
|
|
|
num = (num << 7) | (*ip & 0x7f);
|
|
|
|
} while ((*ip++ & 0x80) != 0);
|
2014-02-22 12:34:09 -05:00
|
|
|
printf("LOAD_CONST_SMALL_INT " INT_FMT, num);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
2014-02-19 08:47:59 -05:00
|
|
|
}
|
2013-11-17 08:19:33 -05:00
|
|
|
|
2014-01-09 21:16:50 -05:00
|
|
|
case MP_BC_LOAD_CONST_INT:
|
|
|
|
DECODE_QSTR;
|
|
|
|
printf("LOAD_CONST_INT %s", qstr_str(qstr));
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_CONST_DEC:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_QSTR;
|
2014-01-29 13:58:52 -05:00
|
|
|
printf("LOAD_CONST_DEC %s", qstr_str(qstr));
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-04-11 17:34:57 -04:00
|
|
|
case MP_BC_LOAD_CONST_BYTES:
|
|
|
|
DECODE_QSTR;
|
|
|
|
printf("LOAD_CONST_BYTES %s", qstr_str(qstr));
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_CONST_STRING:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_QSTR;
|
2014-04-12 09:18:40 -04:00
|
|
|
printf("LOAD_CONST_STRING '%s'", qstr_str(qstr));
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-04-11 17:32:38 -04:00
|
|
|
case MP_BC_LOAD_NULL:
|
|
|
|
printf("LOAD_NULL");
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_FAST_N:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("LOAD_FAST_N " UINT_FMT, unum);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-30 17:32:17 -05:00
|
|
|
case MP_BC_LOAD_DEREF:
|
|
|
|
DECODE_UINT;
|
|
|
|
printf("LOAD_DEREF " UINT_FMT, unum);
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_NAME:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_QSTR;
|
|
|
|
printf("LOAD_NAME %s", qstr_str(qstr));
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_GLOBAL:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_QSTR;
|
|
|
|
printf("LOAD_GLOBAL %s", qstr_str(qstr));
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_ATTR:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_QSTR;
|
2013-11-25 18:39:36 -05:00
|
|
|
printf("LOAD_ATTR %s", qstr_str(qstr));
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_METHOD:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_QSTR;
|
|
|
|
printf("LOAD_METHOD %s", qstr_str(qstr));
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LOAD_BUILD_CLASS:
|
2013-11-25 18:39:36 -05:00
|
|
|
printf("LOAD_BUILD_CLASS");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-04-17 17:10:53 -04:00
|
|
|
case MP_BC_LOAD_SUBSCR:
|
|
|
|
printf("LOAD_SUBSCR");
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_STORE_FAST_N:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("STORE_FAST_N " UINT_FMT, unum);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-30 17:32:17 -05:00
|
|
|
case MP_BC_STORE_DEREF:
|
|
|
|
DECODE_UINT;
|
|
|
|
printf("STORE_DEREF " UINT_FMT, unum);
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_STORE_NAME:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_QSTR;
|
|
|
|
printf("STORE_NAME %s", qstr_str(qstr));
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_STORE_GLOBAL:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_QSTR;
|
2014-01-03 09:03:48 -05:00
|
|
|
printf("STORE_GLOBAL %s", qstr_str(qstr));
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_STORE_ATTR:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_QSTR;
|
2013-11-25 18:39:36 -05:00
|
|
|
printf("STORE_ATTR %s", qstr_str(qstr));
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_STORE_SUBSCR:
|
2013-11-26 10:14:50 -05:00
|
|
|
printf("STORE_SUBSCR");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-04-09 10:26:46 -04:00
|
|
|
case MP_BC_DELETE_FAST:
|
|
|
|
DECODE_UINT;
|
|
|
|
printf("DELETE_FAST " UINT_FMT, unum);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case MP_BC_DELETE_DEREF:
|
|
|
|
DECODE_UINT;
|
|
|
|
printf("DELETE_DEREF " UINT_FMT, unum);
|
|
|
|
break;
|
|
|
|
|
2014-02-06 15:31:32 -05:00
|
|
|
case MP_BC_DELETE_NAME:
|
|
|
|
DECODE_QSTR;
|
|
|
|
printf("DELETE_NAME %s", qstr_str(qstr));
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_DUP_TOP:
|
2013-12-29 11:54:59 -05:00
|
|
|
printf("DUP_TOP");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_DUP_TOP_TWO:
|
2013-11-26 10:14:50 -05:00
|
|
|
printf("DUP_TOP_TWO");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_POP_TOP:
|
2013-11-17 08:19:33 -05:00
|
|
|
printf("POP_TOP");
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_ROT_TWO:
|
2014-01-09 21:16:50 -05:00
|
|
|
printf("ROT_TWO");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_ROT_THREE:
|
2013-11-26 10:14:50 -05:00
|
|
|
printf("ROT_THREE");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_JUMP:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_SLABEL;
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("JUMP " UINT_FMT, ip + unum - ip_start);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_POP_JUMP_IF_TRUE:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_SLABEL;
|
2014-12-12 12:18:56 -05:00
|
|
|
printf("POP_JUMP_IF_TRUE " INT_FMT, ip + unum - ip_start);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_POP_JUMP_IF_FALSE:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_SLABEL;
|
2014-12-12 12:18:56 -05:00
|
|
|
printf("POP_JUMP_IF_FALSE " INT_FMT, ip + unum - ip_start);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_JUMP_IF_TRUE_OR_POP:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_SLABEL;
|
2014-12-12 12:18:56 -05:00
|
|
|
printf("JUMP_IF_TRUE_OR_POP " INT_FMT, ip + unum - ip_start);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_JUMP_IF_FALSE_OR_POP:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_SLABEL;
|
2014-12-12 12:18:56 -05:00
|
|
|
printf("JUMP_IF_FALSE_OR_POP " INT_FMT, ip + unum - ip_start);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-03-27 06:29:34 -04:00
|
|
|
case MP_BC_SETUP_WITH:
|
|
|
|
DECODE_ULABEL; // loop-like labels are always forward
|
|
|
|
printf("SETUP_WITH " UINT_FMT, ip + unum - ip_start);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case MP_BC_WITH_CLEANUP:
|
|
|
|
printf("WITH_CLEANUP");
|
|
|
|
break;
|
|
|
|
|
2014-02-01 15:08:18 -05:00
|
|
|
case MP_BC_UNWIND_JUMP:
|
|
|
|
DECODE_SLABEL;
|
|
|
|
printf("UNWIND_JUMP " UINT_FMT " %d", ip + unum - ip_start, *ip);
|
|
|
|
ip += 1;
|
2014-01-31 12:33:31 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_SETUP_EXCEPT:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_ULABEL; // except labels are always forward
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("SETUP_EXCEPT " UINT_FMT, ip + unum - ip_start);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-01-31 12:33:31 -05:00
|
|
|
case MP_BC_SETUP_FINALLY:
|
|
|
|
DECODE_ULABEL; // except labels are always forward
|
|
|
|
printf("SETUP_FINALLY " UINT_FMT, ip + unum - ip_start);
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_END_FINALLY:
|
2013-11-17 08:19:33 -05:00
|
|
|
// if TOS is an exception, reraises the exception (3 values on TOS)
|
|
|
|
// if TOS is an integer, does something else
|
|
|
|
// if TOS is None, just pops it and continues
|
|
|
|
// else error
|
2013-12-29 11:54:59 -05:00
|
|
|
printf("END_FINALLY");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_GET_ITER:
|
2013-11-26 10:14:50 -05:00
|
|
|
printf("GET_ITER");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_FOR_ITER:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_ULABEL; // the jump offset if iteration finishes; for labels are always forward
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("FOR_ITER " UINT_FMT, ip + unum - ip_start);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_POP_BLOCK:
|
2013-11-17 08:19:33 -05:00
|
|
|
// pops block and restores the stack
|
2013-12-29 11:54:59 -05:00
|
|
|
printf("POP_BLOCK");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_POP_EXCEPT:
|
2013-11-17 08:19:33 -05:00
|
|
|
// pops block, checks it's an exception block, and restores the stack, saving the 3 exception values to local threadstate
|
2013-12-29 11:54:59 -05:00
|
|
|
printf("POP_EXCEPT");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-02-01 18:04:09 -05:00
|
|
|
case MP_BC_NOT:
|
|
|
|
printf("NOT");
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_BUILD_TUPLE:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("BUILD_TUPLE " UINT_FMT, unum);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_BUILD_LIST:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("BUILD_LIST " UINT_FMT, unum);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_LIST_APPEND:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2014-01-02 13:15:33 -05:00
|
|
|
printf("LIST_APPEND " UINT_FMT, unum);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_BUILD_MAP:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("BUILD_MAP " UINT_FMT, unum);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_STORE_MAP:
|
2014-01-18 09:10:48 -05:00
|
|
|
printf("STORE_MAP");
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_MAP_ADD:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2014-05-11 12:25:01 -04:00
|
|
|
printf("MAP_ADD " UINT_FMT, unum);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_BUILD_SET:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2013-12-30 07:52:32 -05:00
|
|
|
printf("BUILD_SET " UINT_FMT, unum);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_SET_ADD:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2013-12-30 07:52:32 -05:00
|
|
|
printf("SET_ADD " UINT_FMT, unum);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-06-01 08:32:54 -04:00
|
|
|
#if MICROPY_PY_BUILTINS_SLICE
|
2014-01-18 09:10:48 -05:00
|
|
|
case MP_BC_BUILD_SLICE:
|
|
|
|
DECODE_UINT;
|
|
|
|
printf("BUILD_SLICE " UINT_FMT, unum);
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_UNPACK_SEQUENCE:
|
2013-11-26 10:14:50 -05:00
|
|
|
DECODE_UINT;
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("UNPACK_SEQUENCE " UINT_FMT, unum);
|
2013-11-26 10:14:50 -05:00
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_MAKE_FUNCTION:
|
2014-04-13 06:22:44 -04:00
|
|
|
DECODE_PTR;
|
2014-06-02 18:24:29 -04:00
|
|
|
printf("MAKE_FUNCTION %p", (void*)unum);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-02-01 08:05:04 -05:00
|
|
|
case MP_BC_MAKE_FUNCTION_DEFARGS:
|
2014-04-13 06:22:44 -04:00
|
|
|
DECODE_PTR;
|
2014-06-02 18:24:29 -04:00
|
|
|
printf("MAKE_FUNCTION_DEFARGS %p", (void*)unum);
|
2014-02-01 08:05:04 -05:00
|
|
|
break;
|
|
|
|
|
2014-04-22 20:22:10 -04:00
|
|
|
case MP_BC_MAKE_CLOSURE: {
|
2014-04-13 06:22:44 -04:00
|
|
|
DECODE_PTR;
|
2014-07-03 08:25:24 -04:00
|
|
|
mp_uint_t n_closed_over = *ip++;
|
2014-06-02 18:24:29 -04:00
|
|
|
printf("MAKE_CLOSURE %p " UINT_FMT, (void*)unum, n_closed_over);
|
2013-12-30 17:32:17 -05:00
|
|
|
break;
|
2014-04-22 20:22:10 -04:00
|
|
|
}
|
2013-12-30 17:32:17 -05:00
|
|
|
|
2014-04-22 20:22:10 -04:00
|
|
|
case MP_BC_MAKE_CLOSURE_DEFARGS: {
|
2014-04-13 06:22:44 -04:00
|
|
|
DECODE_PTR;
|
2014-07-03 08:25:24 -04:00
|
|
|
mp_uint_t n_closed_over = *ip++;
|
2014-06-02 18:24:29 -04:00
|
|
|
printf("MAKE_CLOSURE_DEFARGS %p " UINT_FMT, (void*)unum, n_closed_over);
|
2014-03-26 17:14:59 -04:00
|
|
|
break;
|
2014-04-22 20:22:10 -04:00
|
|
|
}
|
2014-03-26 17:14:59 -04:00
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_CALL_FUNCTION:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("CALL_FUNCTION n=" UINT_FMT " nkw=" UINT_FMT, unum & 0xff, (unum >> 8) & 0xff);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-03-30 10:39:25 -04:00
|
|
|
case MP_BC_CALL_FUNCTION_VAR_KW:
|
|
|
|
DECODE_UINT;
|
|
|
|
printf("CALL_FUNCTION_VAR_KW n=" UINT_FMT " nkw=" UINT_FMT, unum & 0xff, (unum >> 8) & 0xff);
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_CALL_METHOD:
|
2013-11-17 08:19:33 -05:00
|
|
|
DECODE_UINT;
|
2013-12-29 20:38:32 -05:00
|
|
|
printf("CALL_METHOD n=" UINT_FMT " nkw=" UINT_FMT, unum & 0xff, (unum >> 8) & 0xff);
|
2013-11-17 08:19:33 -05:00
|
|
|
break;
|
|
|
|
|
2014-03-30 10:39:25 -04:00
|
|
|
case MP_BC_CALL_METHOD_VAR_KW:
|
|
|
|
DECODE_UINT;
|
|
|
|
printf("CALL_METHOD_VAR_KW n=" UINT_FMT " nkw=" UINT_FMT, unum & 0xff, (unum >> 8) & 0xff);
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_RETURN_VALUE:
|
2013-11-17 08:19:33 -05:00
|
|
|
printf("RETURN_VALUE");
|
|
|
|
break;
|
|
|
|
|
2014-01-09 21:16:50 -05:00
|
|
|
case MP_BC_RAISE_VARARGS:
|
|
|
|
unum = *ip++;
|
|
|
|
printf("RAISE_VARARGS " UINT_FMT, unum);
|
|
|
|
break;
|
|
|
|
|
2013-12-21 13:17:45 -05:00
|
|
|
case MP_BC_YIELD_VALUE:
|
2014-01-02 13:15:33 -05:00
|
|
|
printf("YIELD_VALUE");
|
|
|
|
break;
|
2013-11-17 08:19:33 -05:00
|
|
|
|
2014-03-22 07:47:06 -04:00
|
|
|
case MP_BC_YIELD_FROM:
|
|
|
|
printf("YIELD_FROM");
|
|
|
|
break;
|
|
|
|
|
2014-01-03 09:03:48 -05:00
|
|
|
case MP_BC_IMPORT_NAME:
|
|
|
|
DECODE_QSTR;
|
2014-04-12 09:18:40 -04:00
|
|
|
printf("IMPORT_NAME '%s'", qstr_str(qstr));
|
2014-01-03 09:03:48 -05:00
|
|
|
break;
|
|
|
|
|
|
|
|
case MP_BC_IMPORT_FROM:
|
|
|
|
DECODE_QSTR;
|
2014-04-12 09:18:40 -04:00
|
|
|
printf("IMPORT_FROM '%s'", qstr_str(qstr));
|
2014-01-03 09:03:48 -05:00
|
|
|
break;
|
|
|
|
|
2014-02-13 17:22:06 -05:00
|
|
|
case MP_BC_IMPORT_STAR:
|
|
|
|
printf("IMPORT_STAR");
|
|
|
|
break;
|
|
|
|
|
2013-11-17 08:19:33 -05:00
|
|
|
default:
|
py: Compress load-int, load-fast, store-fast, unop, binop bytecodes.
There is a lot potential in compress bytecodes and make more use of the
coding space. This patch introduces "multi" bytecodes which have their
argument included in the bytecode (by addition).
UNARY_OP and BINARY_OP now no longer take a 1 byte argument for the
opcode. Rather, the opcode is included in the first byte itself.
LOAD_FAST_[0,1,2] and STORE_FAST_[0,1,2] are removed in favour of their
multi versions, which can take an argument between 0 and 15 inclusive.
The majority of LOAD_FAST/STORE_FAST codes fit in this range and so this
saves a byte for each of these.
LOAD_CONST_SMALL_INT_MULTI is used to load small ints between -16 and 47
inclusive. Such ints are quite common and now only need 1 byte to
store, and now have much faster decoding.
In all this patch saves about 2% RAM for typically bytecode (1.8% on
64-bit test, 2.5% on pyboard test). It also reduces the binary size
(because bytecodes are simplified) and doesn't harm performance.
2014-10-25 11:43:46 -04:00
|
|
|
if (ip[-1] < MP_BC_LOAD_CONST_SMALL_INT_MULTI + 64) {
|
|
|
|
printf("LOAD_CONST_SMALL_INT " INT_FMT, (mp_int_t)ip[-1] - MP_BC_LOAD_CONST_SMALL_INT_MULTI - 16);
|
|
|
|
} else if (ip[-1] < MP_BC_LOAD_FAST_MULTI + 16) {
|
|
|
|
printf("LOAD_FAST " UINT_FMT, (mp_uint_t)ip[-1] - MP_BC_LOAD_FAST_MULTI);
|
|
|
|
} else if (ip[-1] < MP_BC_STORE_FAST_MULTI + 16) {
|
|
|
|
printf("STORE_FAST " UINT_FMT, (mp_uint_t)ip[-1] - MP_BC_STORE_FAST_MULTI);
|
|
|
|
} else if (ip[-1] < MP_BC_UNARY_OP_MULTI + 5) {
|
|
|
|
printf("UNARY_OP " UINT_FMT, (mp_uint_t)ip[-1] - MP_BC_UNARY_OP_MULTI);
|
|
|
|
} else if (ip[-1] < MP_BC_BINARY_OP_MULTI + 35) {
|
|
|
|
printf("BINARY_OP " UINT_FMT, (mp_uint_t)ip[-1] - MP_BC_BINARY_OP_MULTI);
|
|
|
|
} else {
|
|
|
|
printf("code %p, byte code 0x%02x not implemented\n", ip, ip[-1]);
|
|
|
|
assert(0);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
break;
|
2013-11-17 08:19:33 -05:00
|
|
|
}
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
}
|
2014-01-07 10:20:33 -05:00
|
|
|
|
2014-01-19 06:48:48 -05:00
|
|
|
#endif // MICROPY_DEBUG_PRINTERS
|