summaryrefslogtreecommitdiff
path: root/include/libelfu/libelfu.h
diff options
context:
space:
mode:
authornorly <ny-git@enpas.org>2013-05-30 04:01:51 +0100
committernorly <ny-git@enpas.org>2013-05-30 04:36:39 +0100
commit4addee4bda6064926b24cd1ae929303003bd9ff1 (patch)
tree10bad1be5ff2f71981fe87e1c43e171e94dacc8a /include/libelfu/libelfu.h
parenteb5a1daba781013ccf168b95510d0f67f0b9c946 (diff)
Redesign data structures, make basic reladd work.newparser
The memory ELF model is now a tree structure: ELF +--> PHDRs +--> PHDR +--> Section | | +--> Section | | ... | | \--> Section | | | +--> PHDR +--> Section | | ... | ... | \--> Orphaned sections +--> Section ... \--> Section This effectively introduces semantics into the binary blob we are editing, and allows us to re-layout its contents much more easily while keeping as close as possible to what is assumed to be the original semantics. As a side-effect, a first meta-function had to be introduced (elfu_mScnForall) in order to traverse all leaves of the tree. Much old code has been removed given the leaner environment available now, and automated insertion of .text and .data sections from object files into executables now works. However nothing else is inserted (such as string tables or .bss) and no relocation takes place yet.
Diffstat (limited to 'include/libelfu/libelfu.h')
-rw-r--r--include/libelfu/libelfu.h1
1 files changed, 0 insertions, 1 deletions
diff --git a/include/libelfu/libelfu.h b/include/libelfu/libelfu.h
index cc55282..328a75d 100644
--- a/include/libelfu/libelfu.h
+++ b/include/libelfu/libelfu.h
@@ -6,7 +6,6 @@
#include <libelfu/generic.h>
#include <libelfu/elfops.h>
-#include <libelfu/modeltypes.h>
#include <libelfu/modelops.h>
#include <libelfu/debug.h>