otp.git - Mirror of Erlang/OTP repository.

Age	Commit message (Collapse)	Author
2017-01-12	Add specs for the beam_*:module/2 functions	Björn Gustavsson

2016-04-13	Merge branch 'henrik/update-copyrightyear'	Henrik Nord
	* henrik/update-copyrightyear: update copyright-year
2016-04-08	Remove unreachable code after 'raise' instructions	Björn Gustavsson
	Remove the unreachable instructions after a 'raise' instruction (e.g. a 'jump' or 'deallocate', 'return') to decrease code size.
2016-03-15	update copyright-year	Henrik Nord

2015-06-18	Change license text to APLv2	Bruce Yinhe

2015-04-22	Move rewriting of bs_match from beam_clean to beam_z	Björn Gustavsson
	The actual bs_match_string instruction has four operands: bs_match_string {f,Lbl} Ctxt NumBits {string,ListOfBytes} However, v3_codegen emits a more compact representation where the bits to match are packaged in a bitstring: bs_match_string {f,Lbl} Ctxt Bitstring Currently, beam_clean:clean_labels/1 will rewrite the compact representation to the final representation. That is unfortunate since clean_labels/1 is called by beam_dead, which means that the less compact representation will be introduced long before it is actually needed by beam_asm. It will also complicate any optimizations that we might want to do. Move the rewriting of bs_match_string from beam_clean:clean_labels/1 to the beam_z pass, which is the last pass executed before beam_validator and beam_asm.
2015-01-26	beam_z: Remove the uncovered to_typed_literal/1 function	Björn Gustavsson
	It was a workaround for a bug that has been fixed.
2014-02-19	compiler: Transform list of Args to exact literal type	Björn-Egil Dahlberg

2014-02-13	compiler: Change map instructions for fetching values	Björn-Egil Dahlberg
	* Combine multiple get values with one instruction * Combine multiple check keys with one instruction
2014-01-28	compiler: Implement different instructions for => and :=	Björn Gustavsson

2012-10-10	Break apart tail-recursive call instructions	Björn Gustavsson
	Somewhat reduce the code bloat by eliminating special cases.
2012-10-10	Represent the 'send' instruction as a call_ext/2 instruction	Björn Gustavsson
	Somewhat reduce code bloat.
2012-10-10	Rewrite select_val and select_tuple_arity to a select instruction	Björn Gustavsson
	Eliminate some code bloat.
2012-10-09	Rewrite binary creation instructions to bs_init instructions	Björn Gustavsson
	Rewrite the five binary creation instructions to a bs_init instruction, in order to somewhat reduce code bloat.
2012-10-09	Rewrite bs_add, bs_utf*_size to BIF instructions in optimizations	Björn Gustavsson
	We can remove some code bloat by handling the special instructions as BIF instructions in the optimization passes. Also note that bs_utf*_size was not handled by beam_utils:check_liveness/3 (meaning the conservative answer instead of the correct answer would be returned).
2012-10-09	Rewrite bs_put* instructions to a generic bs_put instruction	Björn Gustavsson
	Seven bs_put_* instructions can be combined into one generic bs_put instruction to avoid some code bloat. That will also improve some optimizations (such as beam_trim) that did not handle all bs_put* variants.
2012-10-09	Introduce the mandatory beam_a and beam_z passes	Björn Gustavsson
	Introduce the mandary beam_a pass that will be run directly after code generation, and the mandatory beam_z pass that will be run just before beam_asm. Since these passes surround the optimizations, beam_a can (for example) do instruction renaming to simplify the optimization passes and beam_z can undo those renamings.