From da659eeeb413c488f5efae0269c5d37837c62dc2 Mon Sep 17 00:00:00 2001 From: Pierre-Marie Pédrot Date: Thu, 23 Nov 2017 15:44:52 +0100 Subject: Use a more compact representation for bytecode relocations stored on disk. The previous implementation used a list of pairs, which has size 9n where n is the number of relocations. We instead use two arrays for a total memory cost of 2n + 5 words. The use of arrays may turn out to be problematic on 32-bit machines, I am unsure if we will hit this limitation in practice. --- kernel/cemitcodes.mli | 2 -- 1 file changed, 2 deletions(-) (limited to 'kernel/cemitcodes.mli') diff --git a/kernel/cemitcodes.mli b/kernel/cemitcodes.mli index aa055dcb0..03920dc1a 100644 --- a/kernel/cemitcodes.mli +++ b/kernel/cemitcodes.mli @@ -13,8 +13,6 @@ val patch : emitcodes -> patches -> (reloc_info -> int) -> Vmvalues.tcode type to_patch = emitcodes * patches * fv -val subst_to_patch : Mod_subst.substitution -> to_patch -> to_patch - type body_code = | BCdefined of to_patch | BCalias of Constant.t -- cgit v1.2.3