summary refs log tree commit diff
path: root/lisc/lisc.h
AgeCommit message (Collapse)Author
2015-10-08allow multiple functions in fileQuentin Carbonneaux
2015-10-08emit alignment directives properlyQuentin Carbonneaux
2015-10-08rename ealloc to emallocQuentin Carbonneaux
2015-10-07finish implementing data parsingQuentin Carbonneaux
2015-10-06add pool memory managementQuentin Carbonneaux
2015-10-06use new vector functions instead of reallocsQuentin Carbonneaux
2015-10-06specialize vdup into idupQuentin Carbonneaux
2015-10-06factor ins array edition in icpyQuentin Carbonneaux
2015-10-05factor vector duplication in vdup()Quentin Carbonneaux
2015-10-05rename blocka to ballocQuentin Carbonneaux
2015-10-05factor some utility functions/data in util.cQuentin Carbonneaux
2015-09-30use more machine registersQuentin Carbonneaux
2015-09-29wip on new stack slots (emit, spill)Quentin Carbonneaux
2015-09-29more fixes for the new slot representationQuentin Carbonneaux
2015-09-29wip on a simpler slot handlingQuentin Carbonneaux
2015-09-28stupid hinting works better without traces!Quentin Carbonneaux
2015-09-27compute reg interferences in filllive()Quentin Carbonneaux
2015-09-26move the liveon() function in live.cQuentin Carbonneaux
2015-09-25add union-find based phi-class computationQuentin Carbonneaux
2015-09-25change controversial (at best) typedefQuentin Carbonneaux
2015-09-25move return type information into FnQuentin Carbonneaux
2015-09-22parse return types of functionsQuentin Carbonneaux
2015-09-20save callee-save registersQuentin Carbonneaux
2015-09-17start work on fuction parametersQuentin Carbonneaux
2015-09-16follow suggestion of gccQuentin 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-15drop arity information from OpDescQuentin 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-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-15get rid of OTruncQuentin Carbonneaux
2015-09-15add a size to all operations (wip)Quentin Carbonneaux
2015-09-15make spiller aware of parallel assignmentsQuentin Carbonneaux
2015-09-15remove non-critical diagnosticsQuentin Carbonneaux
2015-09-15add truncation operationQuentin Carbonneaux
It would be nicer to have some kind of subtyping where a l variable can be used in place of a w variable but it is more complications than a truncation insutruction. In some cases, it might be less efficient than the above solution by requiring two registers instead of one. (I.e when both the truncated variable and the long variable live together.) We have to see what are the usage patterns.
2015-09-15new NAlign constant and fix frame size computationQuentin Carbonneaux
2015-09-15move spill and emit to the new slot systemQuentin Carbonneaux
In emit, I worked a little to make sure that framesz works when we change the size of the svec array (if we need more alignments).
2015-09-15add sign/zero extension operationsQuentin Carbonneaux
2015-09-15add the mul instructionQuentin Carbonneaux
2015-09-15replace RMem refs with an OAddr opertationQuentin Carbonneaux
2015-09-15compile branches on and using testQuentin Carbonneaux
2015-09-15tentative support for fast allocsQuentin Carbonneaux
It seems that the MEM reference type is meaningless in too many positions. Because of this, it is unclear if we should keep it or just introduce a OAddr instruction that only accepts slots. Regardless of the above, the spilling module needs to use the new slot_() function, also, the emit function needs to fetch the size of the stack frame from the slot[] array. The naming is still very transitional, here is a list of all bogus names I can think of: - SLOT() - Tmp.spill - slot_
2015-09-15major lifting: get rid of RRegQuentin Carbonneaux
I've been septic since I introduced it, this commit proves that it costs more than it helps. I've also fixed a bad bug in rega() where I alloc'ed the wrong size for internal arrays. Enums now have names so I can use them to cast in gdb to get the name corresponding to a constant.
2015-09-15add basic support for stack allocationQuentin Carbonneaux
2015-09-15split store into store{w,l}Quentin Carbonneaux
2015-09-15prefix register macrosQuentin Carbonneaux
generated by cgit-pink 1.4.1 (git 2.36.1) at 2024-10-19 13:29:15 +0000