summary refs log tree commit diff
path: root/lisc/parse.c
AgeCommit message (Collapse)Author
2015-11-30stores becomes storehQuentin Carbonneaux
2015-11-18support _ in identifiersQuentin Carbonneaux
2015-11-13export printref functionQuentin Carbonneaux
2015-11-11move usage computation in filluse()Quentin Carbonneaux
2015-11-05support lighter syntax for arraysQuentin Carbonneaux
2015-11-01break Tmp.phi chains at phi nodesQuentin Carbonneaux
This makes sure the Tmp.phi "chain" is at most two elements long. Something smarted could be possible, but union-find with path compression is still not exactly what I want.
2015-11-01support dots in idents for k0gaQuentin Carbonneaux
2015-10-31make phi-class handling more localQuentin Carbonneaux
The phi classes are no longer in a union-find structure, instead each temporary argument of a phi node gets a pointer to it. The hinting of the phi node is then shared with its the one of its arguments. When liveness proceeds and finds out that two elements with same hinting (a phi node and one of its arguments or two arguments of the same phi node) interfere, one of them has its phi pointer reset, that way, the hinting won't be shared.
2015-10-30print memory references in IR dumpsQuentin Carbonneaux
2015-10-30start integrating RAMem referencesQuentin Carbonneaux
2015-10-30prepare for using memory refsQuentin Carbonneaux
2015-10-30start work on fusing loads in arithmeticQuentin Carbonneaux
2015-10-30fix bug in pretty printerQuentin Carbonneaux
2015-10-30emit code for extensions, move slots into RAltQuentin Carbonneaux
2015-10-19uniformize sign extension and mem loadsQuentin Carbonneaux
2015-10-13rename valloc and ballocQuentin Carbonneaux
valloc is actually a POSIX function that prevents compilation on some systems.
2015-10-08allow multiple functions in fileQuentin Carbonneaux
2015-10-08use DEnd for strings tooQuentin Carbonneaux
2015-10-08emit alignment directives properlyQuentin Carbonneaux
2015-10-07finish implementing data parsingQuentin Carbonneaux
2015-10-07start work on parsing data blocksQuentin Carbonneaux
2015-10-06use new vector functions instead of reallocsQuentin Carbonneaux
2015-10-06specialize vdup into idupQuentin 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-25move return type information into FnQuentin Carbonneaux
2015-09-22improve error reporting in the parserQuentin Carbonneaux
2015-09-22oops, missing newline in pretty-printerQuentin Carbonneaux
2015-09-22parse return types of functionsQuentin Carbonneaux
2015-09-21print size suffix for swapQuentin Carbonneaux
2015-09-18use new function syntax in testsQuentin Carbonneaux
2015-09-17pretty print OPar os parnQuentin Carbonneaux
2015-09-17parse parameter lists of functionsQuentin 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-15cosmetic indentation style fixQuentin Carbonneaux
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-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-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-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
generated by cgit-pink 1.4.1 (git 2.36.1) at 2024-10-19 17:18:58 +0000