Wrapper infrastructure for "shuffle and boot"

Initial checkin of a wrapper infrastructure for the "shuffle and boot"
interface, both real and protected mode.  This code automatically will
figure out the necessary sequence of moves, taking into account swaps
and overlaps as necessary.

1 files changed, 0 insertions, 47 deletions

diff --git a/com32/libutil/include/movebits.h b/com32/libutil/include/movebits.h
deleted file mode 100644
index de6ee1ff..00000000
--- a/com32/libutil/include/movebits.h
+++ /dev/null
@@ -1,47 +0,0 @@
-#ifndef LIBUTIL_MOVEBITS_H
-#define LIBUTIL_MOVEBITS_H
-
-#include <inttypes.h>
-#include <setjmp.h>
-
-struct movelist {
-  uintptr_t dst;
-  uintptr_t src;
-  uintptr_t len;
-  struct movelist *next;
-};
-
-struct move_descriptor {
-  uint32_t dst;
-  uint32_t src;
-  uint32_t len;
-};
-
-/*
- * Creates a movelist consisting of only one element, and
- * if parent == NULL insert into the movelist chain immediately after
- * the parent element.
- */
-struct movelist *
-make_movelist(struct movelist *parent, uintptr_t dst,
-	      uintptr_t src, uintptr_t len);
-
-/*
- * Convert a movelist into a linear array of struct move_descriptors,
- * returning the number of descriptors and freeing the movelist.
- *
- * Returns (size_t)-1 on failure; if so the movelist is still valid.
- */
-size_t
-linearize_movelist(struct move_descriptor **d, struct movelist *m);
-
-/*
- * moves is computed from "frags" and "freemem".  "space" lists
- * free memory areas at our disposal, and is (src, cnt) only.
- */
-
-int
-compute_movelist(struct movelist **moves, struct movelist *frags,
-		 struct movelist *space);
-
-#endif /* LIBUTIL_MOVEBITS_H */