Changes between Version 2 and Version 3 of Commentary/EvilMangler

May 7, 2011 6:41:43 PM (9 years ago)



  • Commentary/EvilMangler

    v2 v3  
    33= HC files and the Evil Mangler =
    6 GHC uses {{{gcc}}} as a code generator, in a very stylised way:
    7  * Generate {{{Foo.hc}}}
    8  * Compile it with {{{gcc}}}, using {{{register}}} declarations to nail a bunch of things into registers (e.g. the allocation pointer)
    9  * Post-process the generated assembler code with the Evil Mangler
    11 The Evil Mangler (EM) is a Perl script invoked by GHC after the C compiler (gcc) has translated the GHC-produced C code into assembly. Consequently, it is only of interest if {{{-fvia-C}}} is in effect (either explicitly or implicitly).
    13 == What the Evil Mangler does ==
    15 The EM reads the assembly produced by gcc and re-arranges code blocks as well as nukes instructions that it considers non-essential. It derives it evilness from its utterly ad hoc, machine, compiler, and whatnot dependent design and implementation. More precisely, the EM performs the following tasks:
    17  * The code executed when a closure is entered is moved adjacent to that closure's infotable. Moreover, the order of the info table entries is reversed. Also, SRT pointers are removed from closures that don't need them (non-FUN, RET and THUNK ones).
    18  * Function prologue and epilogue code is removed. (GHC generated code manages its own stack and uses the system stack only for return addresses and during calls to C code.)
    19  * Certain code patterns are replaced by simpler code (eg, loads of fast entry points followed by indirect jumps are replaced by direct jumps to the fast entry point).
    21 == Implementation of the Evil Mangler ==
    23 The EM is located in the Perl script [[GhcFile(driver/mangler/ghc-asm.lprl)]].  The script reads the {{{.s}}} file and chops it up into chunks (that's how they are actually called in the script) that roughly correspond to basic blocks. Each chunk is annotated with an educated guess about what kind of code it contains (e.g., infotable, fast entry point, slow entry point, etc.). The annotations also contain the symbol introducing the chunk of assembly and whether that chunk has already been processed or not.
    25 The parsing of the input into chunks as well as recognising assembly instructions that are to be removed or altered is based on a large number of Perl regular expressions sprinkled over the whole code. These expressions are rather fragile as they heavily rely on the structure of the generated code - in fact, they even rely on the right amount of white space and thus on the formatting of the assembly.
    27 Afterwards, the chunks are reordered, some of them purged, and some stripped of some useless instructions. Moreover, some instructions are manipulated (eg, loads of fast entry points followed by indirect jumps are replaced by direct jumps to the fast entry point).
    29 The EM knows which part of the code belongs to function prologues and epilogues as STG C adds tags of the form {{{--- BEGIN ---}}} and {{{--- END ---}}} the assembler just before and after the code proper of a function starts. It adds these tags using gcc's {{{__asm__}}} feature.
    31 Update: Gcc 2.96 upwards performs more aggressive basic block re-ordering and dead code elimination. This seems to make the whole {{{--- END ---}}} tag business redundant -- in fact, if proper code is generated, no {{{--- END ---}}} tags survive the gcc optimiser.
     5GHC no longer has an evil mangler.