summaryrefslogtreecommitdiff
path: root/py/binary.h
diff options
context:
space:
mode:
authorPaul Sokolovsky <pfalcon@users.sourceforge.net>2014-04-10 03:45:38 +0300
committerPaul Sokolovsky <pfalcon@users.sourceforge.net>2014-04-10 03:58:03 +0300
commite9db8404804f2eed07eb0a6190f73ae21e0dc43c (patch)
tree29aa05cc8892116fa6ff008d0407b0e4108a8e5b /py/binary.h
parentacb133d1b1a68847bd85c545312c3e221a6f7c0b (diff)
py: Start implementing "struct" module.
Only calcsize() and unpack() functions provided so far, for little-endian byte order. Format strings don't support repition spec (like "2b3i"). Unfortunately, dealing with all the various binary type sizes and alignments will lead to quite a bloated "binary" helper functions - if optimizing for speed. Need to think if using dynamic parametrized algos makes more sense.
Diffstat (limited to 'py/binary.h')
-rw-r--r--py/binary.h1
1 files changed, 1 insertions, 0 deletions
diff --git a/py/binary.h b/py/binary.h
index 0bd6ad17a..d6bab14d0 100644
--- a/py/binary.h
+++ b/py/binary.h
@@ -4,4 +4,5 @@
int mp_binary_get_size(char typecode);
mp_obj_t mp_binary_get_val(char typecode, void *p, int index);
+mp_obj_t mp_binary_get_val_unaligned_le(char typecode, byte **ptr);
void mp_binary_set_val(char typecode, void *p, int index, mp_obj_t val_in);