otp.git - Mirror of Erlang/OTP repository.

Age	Commit message (Collapse)	Author
2014-02-05	beam_bsm: Eliminate emulator crash when a binary is called	Björn Gustavsson
	We must not do the delayed binary creation optimization if the code attempts to call the matched out binary. Calling a matchstate will crash the run-time system. Reported-by: Loïc Hoguin
2013-01-25	Update copyright years	Björn-Egil Dahlberg

2012-11-26	beam_bsm: Improve handling of bs_start_match2 instructions	Björn Gustavsson
	The handling of bs_start_match2 was both too conservative and too careless. It was too conservative in that would not do the optimization if the were copies of the match state in other registers. It was careless in that it did not consider the failure branch. Reorganize the code and fix both these issues. Add a test case to test that the failure branch is considered.
2012-11-26	beam_bsm: Make the optimization applicable in more circumstances	Björn Gustavsson
	When determining whether the delayed creation of sub-binaries optimizations is applicable, this module some tests whether the register containg the match state is killed. That is actually a stronger condition than necessary; since the register is initialized, it suffices to test whether the register is unused.
2012-10-10	beam_bsm: Handle calls slightly better	Björn Gustavsson
	We were too conservative when handling a call when there were copies of the match context in both x and y registers. Don't give up if there is are copies of the match context in y registers, as long as those copies are killed by the code that follows the call.
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.
2011-08-16	compiler: Generate line instructions	Björn Gustavsson

2011-05-20	Update copyright years	Björn-Egil Dahlberg

2011-04-12	beam_bsm: Eliminate uncovered line in warning generation	Björn Gustavsson
	In warning_translate_label/2, gb_trees:lookup/2 is called to translate from the entry label for a function to its name. Since the gb_tree has an entry for all functions in the module, there is no way that the lookup can fail unless there is a serious bug. Therefore, use gb_trees:get/2 so that an exception and an internal compiler error will be generated if the lookup would ever fail.
2009-11-20	The R13B03 release.OTP_R13B03	Erlang/OTP