Age | Commit message (Collapse) | Author | |
---|---|---|---|
2016-11-23 | Correct copyright on remaining hipe files | Richard Carlsson | |
2016-07-11 | hipe_icode_{bincomp,range}: Improve complexity | Magnus Lång | |
hipe_icode_bincomp:find_bs_get_integer/3 was quadratic for no good reason. By observing that NewSuccs and Rest are always disjoint, we can see that the worklist does not need to be a set. Furthermore, by replacing the ordset Visited with a map, we reduce complexity to (a very low) O(n lg n). On cuter_binlib, this change reduced the time for hipe_icode_bincomp from 60s to .25s. Using a gb_set for Visited gives .5s, and a sets:set 1s. We apply the same optimisation to hipe_icode_range. | |||
2016-03-15 | update copyright-year | Henrik Nord | |
2015-06-18 | Change license text to APLv2 | Bruce Yinhe | |
2009-11-20 | The R13B03 release.OTP_R13B03 | Erlang/OTP | |