~cnx/roux - Alternative QBE compiler

Age	Commit message (Collapse)	Author
2015-10-30	start integrating RAMem references	Quentin Carbonneaux

2015-10-30	prepare for using memory refs	Quentin Carbonneaux

2015-10-30	start work on fusing loads in arithmetic	Quentin Carbonneaux

2015-10-30	fix bug in pretty printer	Quentin Carbonneaux

2015-10-30	emit code for extensions, move slots into RAlt	Quentin Carbonneaux

2015-10-19	uniformize sign extension and mem loads	Quentin Carbonneaux

2015-10-13	rename valloc and balloc	Quentin Carbonneaux
	valloc is actually a POSIX function that prevents compilation on some systems.
2015-10-08	allow multiple functions in file	Quentin Carbonneaux

2015-10-08	use DEnd for strings too	Quentin Carbonneaux

2015-10-08	emit alignment directives properly	Quentin Carbonneaux

2015-10-07	finish implementing data parsing	Quentin Carbonneaux

2015-10-07	start work on parsing data blocks	Quentin Carbonneaux

2015-10-06	use new vector functions instead of reallocs	Quentin Carbonneaux

2015-10-06	specialize vdup into idup	Quentin Carbonneaux

2015-10-05	factor vector duplication in vdup()	Quentin Carbonneaux

2015-10-05	rename blocka to balloc	Quentin Carbonneaux

2015-10-05	factor some utility functions/data in util.c	Quentin Carbonneaux

2015-09-25	move return type information into Fn	Quentin Carbonneaux

2015-09-22	improve error reporting in the parser	Quentin Carbonneaux

2015-09-22	oops, missing newline in pretty-printer	Quentin Carbonneaux

2015-09-22	parse return types of functions	Quentin Carbonneaux

2015-09-21	print size suffix for swap	Quentin Carbonneaux

2015-09-18	use new function syntax in tests	Quentin Carbonneaux

2015-09-17	pretty print OPar os parn	Quentin Carbonneaux

2015-09-17	parse parameter lists of functions	Quentin Carbonneaux

2015-09-15	heavy modification of call handling	Quentin 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-15	cosmetic indentation style fix	Quentin Carbonneaux

2015-09-15	drop arity information from OpDesc	Quentin Carbonneaux

2015-09-15	implement aggregate passing in regs	Quentin Carbonneaux

2015-09-15	start function call lowering (wip)	Quentin Carbonneaux

2015-09-15	add parsing code for function calls	Quentin Carbonneaux

2015-09-15	define a new CMPS macro, shorten Type	Quentin Carbonneaux

2015-09-15	fix minor type parsing bugs	Quentin Carbonneaux

2015-09-15	start work on aggregate types	Quentin 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-15	get rid of OTrunc	Quentin Carbonneaux

2015-09-15	add a size to all operations (wip)	Quentin Carbonneaux

2015-09-15	add truncation operation	Quentin 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-15	add sign/zero extension operations	Quentin Carbonneaux

2015-09-15	add the mul instruction	Quentin Carbonneaux

2015-09-15	replace RMem refs with an OAddr opertation	Quentin Carbonneaux

2015-09-15	compile branches on and using test	Quentin Carbonneaux

2015-09-15	tentative support for fast allocs	Quentin 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-15	major lifting: get rid of RReg	Quentin 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-15	add basic support for stack allocation	Quentin Carbonneaux

2015-09-15	split store into store{w,l}	Quentin Carbonneaux

2015-09-15	cosmetics	Quentin Carbonneaux

2015-09-15	parse variants of store	Quentin Carbonneaux

2015-09-15	parse operations with no result	Quentin Carbonneaux

2015-09-15	simplify parsing	Quentin Carbonneaux

2015-09-15	add nmem to opdesc for use in the spiller	Quentin Carbonneaux
	This new machine-independent mechanism might not be general enough in the long term but, now, it provides a flexible way to inform the spiller about the maximum number of arguments of an instruction that can be spill locations.