art.git - Android's art

	Commit message (Collapse)	Author	Age	Files	Lines
*	Plug code generator into liveness analysis.	Nicolas Geoffray	2014-06-10	1	-42/+24
\| \| \| \| \| \|	Also implement spill slot support. Change-Id: If5e28811e9fbbf3842a258772c633318a2f4fafc
*	Fix some bugs in graph construction/simplification methods.	Nicolas Geoffray	2014-06-09	1	-1/+1
\| \| \| \| \| \| \| \|	Also fix a brano during SSA construction. The code should not have been commented out. Added a test to cover what the code intends. Change-Id: Ia00ae79dcf75eb0d412f07649d73e7f94dbfb6f0
*	Add a linear scan register allocator to the optimizing compiler.	Nicolas Geoffray	2014-05-26	1	-8/+21
\| \| \| \| \| \| \| \| \| \| \| \|	This is a "by-the-book" implementation. It currently only deals with allocating registers, with no hint optimizations. The changes remaining to make it functional are: - Allocate spill slots. - Resolution and placements of Move instructions. - Connect it to the code generator. Change-Id: Ie0b2f6ba1b98da85425be721ce4afecd6b4012a4
*	Rewrite BitVector index iterator.	Vladimir Marko	2014-05-23	1	-31/+7
\| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \|	The BitVector::Iterator was not iterating over the bits but rather over indexes of the set bits. Therefore, we rename it to IndexIterator and provide a BitVector::Indexes() to get a container-style interface with begin() and end() for range based for loops. Also, simplify InsertPhiNodes where the tmp_blocks isn't needed since the phi_nodes and input_blocks cannot lose any blocks in subsequent iterations, so we can do the Union() directly in those bit vectors and we need to repeat the loop only if we have new input_blocks, rather than on phi_nodes change. And move the temporary bit vectors to scoped arena. Change-Id: I6cb87a2f60724eeef67c6aaa34b36ed5acde6d43
*	Build live ranges in preparation for register allocation.	Nicolas Geoffray	2014-05-19	1	-24/+98
\| \| \| \|	Change-Id: I7ae24afaa4e49276136bf34f4ba7d62db7f28c01
*	Linearize the graph before creating live ranges.	Nicolas Geoffray	2014-05-16	1	-2/+81
\| \| \| \|	Change-Id: I02eb5671e3304ab062286131745c1366448aff58
*	Add a compilation tracing mechanism to the new compiler.	Nicolas Geoffray	2014-05-14	1	-4/+4
\| \| \| \| \| \|	Code mostly imported from: https://android-review.googlesource.com/#/c/81653/. Change-Id: I150fe942be0fb270e03fabb19032180f7a065d13
*	Add loop recognition and CFG simplifications in new compiler.	Nicolas Geoffray	2014-05-13	1	-3/+3
\| \| \| \| \| \| \| \| \|	We do three simplifications: - Split critical edges, for code generation from SSA (new). - Ensure one back edge per loop, to simplify loop recognition (new). - Ensure only one pre header for a loop, to simplify SSA creation (existing). Change-Id: I9bfccd4b236a00486a261078627b091c8a68be33
*	Build live-in, live-out and kill sets for each block.	Nicolas Geoffray	2014-05-07	1	-0/+170
	This information will be used when computing live ranges of instructions. Change-Id: I345ee833c1ccb4a8e725c7976453f6d58d350d74