summary refs log tree commit diff
path: root/lisc
AgeCommit message (Collapse)Author
2015-09-21emit syntactically valid callsQuentin Carbonneaux
2015-09-20factor formatting inside emitfQuentin Carbonneaux
2015-09-20simplify two loops with a pointerQuentin Carbonneaux
2015-09-20save callee-save registersQuentin Carbonneaux
2015-09-18add the first stand-alone test programQuentin Carbonneaux
2015-09-18use new function syntax in testsQuentin Carbonneaux
2015-09-17this fixme was really more a todoQuentin Carbonneaux
2015-09-17add hack in emit to support stack argumentsQuentin Carbonneaux
The number stored in the .val field of SLOTs has to be sign extended, so we can reach into the caller's frame when necessary (arguments passed on the stack).
2015-09-17fix buggy handling of stack arguments in selpar()Quentin Carbonneaux
2015-09-17fix two bugs in selpar()Quentin Carbonneaux
- One missing argument for OAlloc. - One reference shuffling.
2015-09-17pretty print OPar os parnQuentin Carbonneaux
2015-09-17parse parameter lists of functionsQuentin Carbonneaux
2015-09-17fix memcpy bugQuentin Carbonneaux
2015-09-17start work on fuction parametersQuentin Carbonneaux
2015-09-16follow suggestion of gccQuentin Carbonneaux
2015-09-15use unison default choicesQuentin Carbonneaux
2015-09-15synchronize large doc with unisonQuentin Carbonneaux
2015-09-15fix call bug in regaQuentin Carbonneaux
When rdx is used to return a value and is used as argument, it is in the call defs and hence made dead by the loop modified here. This is obviously erroneous behavior. We instead rephrase the loop to make it clear that among the caller-save registers, only the ones used by the call must be live before the call.
2015-09-15simplify call handling in spillerQuentin Carbonneaux
2015-09-15heavy modification of call handlingQuentin Carbonneaux
The IR generated by calls was very bulky because two instructions were used for marking the live range of a clobber. This patch attempts to store the information of what registers are use/def/clobber in the call instruction itself, this leads to more compact code (even more when we'll have SSE registers). However, I find that the amount of extra code needed is not really easonable. Fortunately it is not too invasive, thus if the complexity creeps in, it should be easy to revert.
2015-09-15emit stack fixup only when necessaryQuentin Carbonneaux
2015-09-15cosmetic indentation style fixQuentin Carbonneaux
2015-09-15reshuffle instructions around callQuentin Carbonneaux
2015-09-15drop arity information from OpDescQuentin Carbonneaux
2015-09-15add a simple function call testQuentin Carbonneaux
2015-09-15hack to enable proper regalloc on callsQuentin Carbonneaux
I add the dual to dummy uses: dummy defs. They are compiled to nothing, but help preserving the invariants I had when writing the register allocator. Clearly, there should be a better way.
2015-09-15fix alignment for structs on the stackQuentin Carbonneaux
2015-09-15diagnose float structsQuentin Carbonneaux
2015-09-15implement aggregate passing in regsQuentin Carbonneaux
2015-09-15start function call lowering (wip)Quentin Carbonneaux
2015-09-15add parsing code for function callsQuentin Carbonneaux
2015-09-15define a new CMPS macro, shorten TypeQuentin Carbonneaux
2015-09-15make type size unsignedQuentin Carbonneaux
2015-09-15fix minor type parsing bugsQuentin Carbonneaux
2015-09-15turn test files in one function definitionQuentin Carbonneaux
2015-09-15start work on aggregate typesQuentin Carbonneaux
The parser now has some code to parse the description of structured types. I tried to be even less specific than LLVM "type" by creating just enough abstraction so that I can deal with both AARCH64 and x64. The base types used in the definition of an aggregate are really just syntactic sugar to give a structure a size and an alignment. Only the location of float components matters for the compilation. In particular this means that the front-ends have to know how the ABI works to pass/return small integer types. This also means that the font-end has to be aware of the layout of structures. Chris Lattner has a proposition [1] for LLVM that is still pending and goes in the direction of giving more control of the ABI the front-end. [1]: http://www.nondot.org/sabre/LLVMNotes/ExtendedIntegerResults.txt
2015-09-15add source and authorship to cprime.ssaQuentin Carbonneaux
2015-09-15add the first generated test!Quentin Carbonneaux
2015-09-15split some long callsQuentin Carbonneaux
2015-09-15new alignment testQuentin Carbonneaux
This test also exposes a loose handling of clobbers, I think it should be possible to compile it without spilling.
2015-09-15get rid of OTruncQuentin Carbonneaux
2015-09-15fix two bugs in new emitQuentin Carbonneaux
2015-09-15update emit to the new settingQuentin Carbonneaux
2015-09-15new meaning for comparison typesQuentin Carbonneaux
Before, they designated the width of the comparison result, but now, it specifies the size of the arguments.
2015-09-15the wide bit of OAddr matters!Quentin Carbonneaux
2015-09-15more modifications to regaQuentin Carbonneaux
2015-09-15add a size to all operations (wip)Quentin Carbonneaux
2015-09-15add new prime finding programQuentin Carbonneaux
2015-09-15fix invalid test in emitQuentin Carbonneaux
It could be that the destination of the copy is a spill location, so we have to check the type of i.to first.
2015-09-15my assumptions in dopm() were wrongQuentin Carbonneaux
revert commit d0e9e3ada106dfe8dcda7a0099b341000f00afb2.