Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
M
micropython
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container Registry
Model registry
Operate
Environments
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
This is an archived project. Repository and other project resources are read-only.
Show more breadcrumbs
card10
micropython
Commits
1d899e17
Commit
1d899e17
authored
9 years ago
by
Damien George
Browse files
Options
Downloads
Patches
Plain Diff
py/bc: Use size_t instead of mp_uint_t to count size of state and args.
parent
7a30e87d
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
py/bc.c
+18
-18
18 additions, 18 deletions
py/bc.c
py/bc.h
+3
-3
3 additions, 3 deletions
py/bc.h
py/objfun.c
+5
-5
5 additions, 5 deletions
py/objfun.c
with
26 additions
and
26 deletions
py/bc.c
+
18
−
18
View file @
1d899e17
...
...
@@ -54,7 +54,7 @@ mp_uint_t mp_decode_uint(const byte **ptr) {
return
unum
;
}
STATIC
NORETURN
void
fun_pos_args_mismatch
(
mp_obj_fun_bc_t
*
f
,
mp_uint
_t
expected
,
mp_uint
_t
given
)
{
STATIC
NORETURN
void
fun_pos_args_mismatch
(
mp_obj_fun_bc_t
*
f
,
size
_t
expected
,
size
_t
given
)
{
#if MICROPY_ERROR_REPORTING == MICROPY_ERROR_REPORTING_TERSE
// generic message, used also for other argument issues
(
void
)
f
;
...
...
@@ -73,9 +73,9 @@ STATIC NORETURN void fun_pos_args_mismatch(mp_obj_fun_bc_t *f, mp_uint_t expecte
}
#if DEBUG_PRINT
STATIC
void
dump_args
(
const
mp_obj_t
*
a
,
mp_uint
_t
sz
)
{
STATIC
void
dump_args
(
const
mp_obj_t
*
a
,
size
_t
sz
)
{
DEBUG_printf
(
"%p: "
,
a
);
for
(
mp_uint
_t
i
=
0
;
i
<
sz
;
i
++
)
{
for
(
size
_t
i
=
0
;
i
<
sz
;
i
++
)
{
DEBUG_printf
(
"%p "
,
a
[
i
]);
}
DEBUG_printf
(
"
\n
"
);
...
...
@@ -89,10 +89,10 @@ STATIC void dump_args(const mp_obj_t *a, mp_uint_t sz) {
// - code_state->ip should contain the offset in bytes from the start of
// the bytecode chunk to just after n_state and n_exc_stack
// - code_state->n_state should be set to the state size (locals plus stack)
void
mp_setup_code_state
(
mp_code_state
*
code_state
,
mp_obj_fun_bc_t
*
self
,
mp_uint
_t
n_args
,
mp_uint
_t
n_kw
,
const
mp_obj_t
*
args
)
{
void
mp_setup_code_state
(
mp_code_state
*
code_state
,
mp_obj_fun_bc_t
*
self
,
size
_t
n_args
,
size
_t
n_kw
,
const
mp_obj_t
*
args
)
{
// This function is pretty complicated. It's main aim is to be efficient in speed and RAM
// usage for the common case of positional only args.
mp_uint
_t
n_state
=
code_state
->
n_state
;
size
_t
n_state
=
code_state
->
n_state
;
// ip comes in as an offset into bytecode, so turn it into a true pointer
code_state
->
ip
=
self
->
bytecode
+
(
size_t
)
code_state
->
ip
;
...
...
@@ -105,10 +105,10 @@ void mp_setup_code_state(mp_code_state *code_state, mp_obj_fun_bc_t *self, mp_ui
#endif
// get params
mp_uint
_t
scope_flags
=
*
code_state
->
ip
++
;
mp_uint
_t
n_pos_args
=
*
code_state
->
ip
++
;
mp_uint
_t
n_kwonly_args
=
*
code_state
->
ip
++
;
mp_uint
_t
n_def_pos_args
=
*
code_state
->
ip
++
;
size
_t
scope_flags
=
*
code_state
->
ip
++
;
size
_t
n_pos_args
=
*
code_state
->
ip
++
;
size
_t
n_kwonly_args
=
*
code_state
->
ip
++
;
size
_t
n_def_pos_args
=
*
code_state
->
ip
++
;
code_state
->
sp
=
&
code_state
->
state
[
0
]
-
1
;
code_state
->
exc_sp
=
(
mp_exc_stack_t
*
)(
code_state
->
state
+
n_state
)
-
1
;
...
...
@@ -139,9 +139,9 @@ void mp_setup_code_state(mp_code_state *code_state, mp_obj_fun_bc_t *self, mp_ui
// Apply processing and check below only if we don't have kwargs,
// otherwise, kw handling code below has own extensive checks.
if
(
n_kw
==
0
&&
(
scope_flags
&
MP_SCOPE_FLAG_DEFKWARGS
)
==
0
)
{
if
(
n_args
>=
(
mp_uint
_t
)(
n_pos_args
-
n_def_pos_args
))
{
if
(
n_args
>=
(
size
_t
)(
n_pos_args
-
n_def_pos_args
))
{
// given enough arguments, but may need to use some default arguments
for
(
mp_uint
_t
i
=
n_args
;
i
<
n_pos_args
;
i
++
)
{
for
(
size
_t
i
=
n_args
;
i
<
n_pos_args
;
i
++
)
{
code_state
->
state
[
n_state
-
1
-
i
]
=
self
->
extra_args
[
i
-
(
n_pos_args
-
n_def_pos_args
)];
}
}
else
{
...
...
@@ -151,7 +151,7 @@ void mp_setup_code_state(mp_code_state *code_state, mp_obj_fun_bc_t *self, mp_ui
}
// copy positional args into state
for
(
mp_uint
_t
i
=
0
;
i
<
n_args
;
i
++
)
{
for
(
size
_t
i
=
0
;
i
<
n_args
;
i
++
)
{
code_state
->
state
[
n_state
-
1
-
i
]
=
args
[
i
];
}
...
...
@@ -170,9 +170,9 @@ void mp_setup_code_state(mp_code_state *code_state, mp_obj_fun_bc_t *self, mp_ui
// get pointer to arg_names array
const
mp_obj_t
*
arg_names
=
(
const
mp_obj_t
*
)
code_state
->
const_table
;
for
(
mp_uint
_t
i
=
0
;
i
<
n_kw
;
i
++
)
{
for
(
size
_t
i
=
0
;
i
<
n_kw
;
i
++
)
{
mp_obj_t
wanted_arg_name
=
kwargs
[
2
*
i
];
for
(
mp_uint
_t
j
=
0
;
j
<
n_pos_args
+
n_kwonly_args
;
j
++
)
{
for
(
size
_t
j
=
0
;
j
<
n_pos_args
+
n_kwonly_args
;
j
++
)
{
if
(
wanted_arg_name
==
arg_names
[
j
])
{
if
(
code_state
->
state
[
n_state
-
1
-
j
]
!=
MP_OBJ_NULL
)
{
nlr_raise
(
mp_obj_new_exception_msg_varg
(
&
mp_type_TypeError
,
...
...
@@ -196,7 +196,7 @@ continue2:;
// fill in defaults for positional args
mp_obj_t
*
d
=
&
code_state
->
state
[
n_state
-
n_pos_args
];
mp_obj_t
*
s
=
&
self
->
extra_args
[
n_def_pos_args
-
1
];
for
(
mp_uint
_t
i
=
n_def_pos_args
;
i
>
0
;
i
--
,
d
++
,
s
--
)
{
for
(
size
_t
i
=
n_def_pos_args
;
i
>
0
;
i
--
,
d
++
,
s
--
)
{
if
(
*
d
==
MP_OBJ_NULL
)
{
*
d
=
*
s
;
}
...
...
@@ -215,7 +215,7 @@ continue2:;
// Check that all mandatory keyword args are specified
// Fill in default kw args if we have them
for
(
mp_uint
_t
i
=
0
;
i
<
n_kwonly_args
;
i
++
)
{
for
(
size
_t
i
=
0
;
i
<
n_kwonly_args
;
i
++
)
{
if
(
code_state
->
state
[
n_state
-
1
-
n_pos_args
-
i
]
==
MP_OBJ_NULL
)
{
mp_map_elem_t
*
elem
=
NULL
;
if
((
scope_flags
&
MP_SCOPE_FLAG_DEFKWARGS
)
!=
0
)
{
...
...
@@ -248,12 +248,12 @@ continue2:;
{
code_state
->
code_info
=
ip
;
const
byte
*
ip2
=
ip
;
mp_uint
_t
code_info_size
=
mp_decode_uint
(
&
ip2
);
size
_t
code_info_size
=
mp_decode_uint
(
&
ip2
);
ip
+=
code_info_size
;
}
// bytecode prelude: initialise closed over variables
mp_uint
_t
local_num
;
size
_t
local_num
;
while
((
local_num
=
*
ip
++
)
!=
255
)
{
code_state
->
state
[
n_state
-
1
-
local_num
]
=
mp_obj_new_cell
(
code_state
->
state
[
n_state
-
1
-
local_num
]);
...
...
This diff is collapsed.
Click to expand it.
py/bc.h
+
3
−
3
View file @
1d899e17
...
...
@@ -80,7 +80,7 @@ typedef struct _mp_code_state {
#if MICROPY_STACKLESS
struct
_mp_code_state
*
prev
;
#endif
mp_uint
_t
n_state
;
size
_t
n_state
;
// Variable-length
mp_obj_t
state
[
0
];
// Variable-length, never accessed by name, only as (void*)(state + n_state)
...
...
@@ -90,9 +90,9 @@ typedef struct _mp_code_state {
mp_uint_t
mp_decode_uint
(
const
byte
**
ptr
);
mp_vm_return_kind_t
mp_execute_bytecode
(
mp_code_state
*
code_state
,
volatile
mp_obj_t
inject_exc
);
mp_code_state
*
mp_obj_fun_bc_prepare_codestate
(
mp_obj_t
func
,
mp_uint
_t
n_args
,
mp_uint
_t
n_kw
,
const
mp_obj_t
*
args
);
mp_code_state
*
mp_obj_fun_bc_prepare_codestate
(
mp_obj_t
func
,
size
_t
n_args
,
size
_t
n_kw
,
const
mp_obj_t
*
args
);
struct
_mp_obj_fun_bc_t
;
void
mp_setup_code_state
(
mp_code_state
*
code_state
,
struct
_mp_obj_fun_bc_t
*
self
,
mp_uint
_t
n_args
,
mp_uint
_t
n_kw
,
const
mp_obj_t
*
args
);
void
mp_setup_code_state
(
mp_code_state
*
code_state
,
struct
_mp_obj_fun_bc_t
*
self
,
size
_t
n_args
,
size
_t
n_kw
,
const
mp_obj_t
*
args
);
void
mp_bytecode_print
(
const
void
*
descr
,
const
byte
*
code
,
mp_uint_t
len
,
const
mp_uint_t
*
const_table
);
void
mp_bytecode_print2
(
const
byte
*
code
,
mp_uint_t
len
);
const
byte
*
mp_bytecode_print_str
(
const
byte
*
ip
);
...
...
This diff is collapsed.
Click to expand it.
py/objfun.c
+
5
−
5
View file @
1d899e17
...
...
@@ -165,7 +165,7 @@ STATIC void dump_args(const mp_obj_t *a, mp_uint_t sz) {
#define VM_DETECT_STACK_OVERFLOW (0)
#if MICROPY_STACKLESS
mp_code_state
*
mp_obj_fun_bc_prepare_codestate
(
mp_obj_t
self_in
,
mp_uint
_t
n_args
,
mp_uint
_t
n_kw
,
const
mp_obj_t
*
args
)
{
mp_code_state
*
mp_obj_fun_bc_prepare_codestate
(
mp_obj_t
self_in
,
size
_t
n_args
,
size
_t
n_kw
,
const
mp_obj_t
*
args
)
{
MP_STACK_CHECK
();
mp_obj_fun_bc_t
*
self
=
MP_OBJ_TO_PTR
(
self_in
);
...
...
@@ -173,11 +173,11 @@ mp_code_state *mp_obj_fun_bc_prepare_codestate(mp_obj_t self_in, mp_uint_t n_arg
const
byte
*
ip
=
self
->
bytecode
;
// bytecode prelude: state size and exception stack size
mp_uint
_t
n_state
=
mp_decode_uint
(
&
ip
);
mp_uint
_t
n_exc_stack
=
mp_decode_uint
(
&
ip
);
size
_t
n_state
=
mp_decode_uint
(
&
ip
);
size
_t
n_exc_stack
=
mp_decode_uint
(
&
ip
);
// allocate state for locals and stack
mp_uint
_t
state_size
=
n_state
*
sizeof
(
mp_obj_t
)
+
n_exc_stack
*
sizeof
(
mp_exc_stack_t
);
size
_t
state_size
=
n_state
*
sizeof
(
mp_obj_t
)
+
n_exc_stack
*
sizeof
(
mp_exc_stack_t
);
mp_code_state
*
code_state
;
code_state
=
m_new_obj_var_maybe
(
mp_code_state
,
byte
,
state_size
);
if
(
!
code_state
)
{
...
...
@@ -186,7 +186,7 @@ mp_code_state *mp_obj_fun_bc_prepare_codestate(mp_obj_t self_in, mp_uint_t n_arg
code_state
->
ip
=
(
byte
*
)(
ip
-
self
->
bytecode
);
// offset to after n_state/n_exc_stack
code_state
->
n_state
=
n_state
;
mp_setup_code_state
(
code_state
,
self
_in
,
n_args
,
n_kw
,
args
);
mp_setup_code_state
(
code_state
,
self
,
n_args
,
n_kw
,
args
);
// execute the byte code with the correct globals context
code_state
->
old_globals
=
mp_globals_get
();
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment