altos/lisp: bounds check in move_map plus binary search

This makes move_map faster by skipping all addresses which aren't
changing.

Also changed the interface from address to offset to avoid computing
the offset multiple times.

Signed-off-by: Keith Packard <keithp@keithp.com>

1 files changed, 1 insertions, 0 deletions

diff --git a/src/lisp/ao_lisp.h b/src/lisp/ao_lisp.h
index e238d4fe..af6ff8bb 100644
--- a/src/lisp/ao_lisp.h
+++ b/src/lisp/ao_lisp.h
@@ -128,6 +128,7 @@ ao_lisp_is_const(ao_poly poly) {
 
 #define AO_LISP_IS_CONST(a)	(ao_lisp_const <= ((uint8_t *) (a)) && ((uint8_t *) (a)) < ao_lisp_const + AO_LISP_POOL_CONST)
 #define AO_LISP_IS_POOL(a)	(ao_lisp_pool <= ((uint8_t *) (a)) && ((uint8_t *) (a)) < ao_lisp_pool + AO_LISP_POOL)
+#define AO_LISP_IS_INT(p)	(ao_lisp_base_type(p) == AO_LISP_INT);
 
 void *
 ao_lisp_ref(ao_poly poly);