{"push_id":1374234650,"size":1000,"distinct_size":442,"ref":"refs/heads/master","head":"c49194c9239c0dcad17b902b6638edf53bb69c6c","before":"a75f44aafa24d38d9ab3036d2059ce0915069105","commits":[{"sha":"e49017f8cd3172a6e5db293720f09f30f3943342","author":{"name":"Siri Hansen","email":"48a99cafc128d6e4374ee5357a7b95d47164fe9b@erlang.org"},"message":"[reltool] Add test for ERL-167\n\nFor applications that are explicitly included in the reltool config,\nbut that are not included in a 'rel' spec, dependencies in the .app\nfile are not followed (only xref dependencies are taken care of).","distinct":false,"url":"https://api.github.com/repos/okeuday/otp/commits/e49017f8cd3172a6e5db293720f09f30f3943342"},{"sha":"7f4a1ad4ab5671e464b22a80071f914f5894b781","author":{"name":"Siri Hansen","email":"48a99cafc128d6e4374ee5357a7b95d47164fe9b@erlang.org"},"message":"[reltool] Fix dependency bug for applications in 'rel' specs\n\nFor applications that are included in a 'rel' spec in the reltool\nconfig, some dependency chains are not followed. E.g.\n\n* Application x has y as included application, and y in turn has z as\n  included application. Then z is not included.\n* Application x has y in its 'applications' tag in the .app file, and\n  y in turn has z as included application. Then z is not included.\n\nThis is now corrected - all app-file dependencies are recusively\nfollowed for all applications that are included in a 'rel' spec in the\nreltool config.","distinct":false,"url":"https://api.github.com/repos/okeuday/otp/commits/7f4a1ad4ab5671e464b22a80071f914f5894b781"},{"sha":"a72376e84b7829736b5674d2434e5224df7183cc","author":{"name":"Siri Hansen","email":"48a99cafc128d6e4374ee5357a7b95d47164fe9b@erlang.org"},"message":"[reltool] Fix dependency bug for applications not in 'rel' specs\n\nFor applications that are not included in a 'rel' spec in the reltool\nconfig, dependencies in the .app file are not followed. This is now\ncorrected.","distinct":false,"url":"https://api.github.com/repos/okeuday/otp/commits/a72376e84b7829736b5674d2434e5224df7183cc"},{"sha":"1bdaee9393a3cf45d7a62fba815c2a73ab637781","author":{"name":"Magnus Lång","email":"06c4ca77251c9f2f625b2fa5f349297369275cdd@telia.com"},"message":"hipe_icode_{bincomp,range}: Improve complexity\n\nhipe_icode_bincomp:find_bs_get_integer/3 was quadratic for no good reason. By observing\nthat NewSuccs and Rest are always disjoint, we can see that the worklist\ndoes not need to be a set. Furthermore, by replacing the ordset Visited\nwith a map, we reduce complexity to (a very low) O(n lg n).\n\nOn cuter_binlib, this change reduced the time for hipe_icode_bincomp\nfrom 60s to .25s. Using a gb_set for Visited gives .5s, and a sets:set\n1s.\n\nWe apply the same optimisation to hipe_icode_range.","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/1bdaee9393a3cf45d7a62fba815c2a73ab637781"},{"sha":"e74636ef2489d436b38726ae19bca2d8e7455cec","author":{"name":"Magnus Lång","email":"06c4ca77251c9f2f625b2fa5f349297369275cdd@telia.com"},"message":"hipe_sdi: Use segment trees to represent PARENTS\n\nThis speeds up parentsOfChild/2 from O(n) to O(lg n + k).\n\nA new module misc/hipe_segment_trees.erl is introduced.","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/e74636ef2489d436b38726ae19bca2d8e7455cec"},{"sha":"ad73c37d4af90834c62f961264dce00118309b0f","author":{"name":"Magnus Lång","email":"06c4ca77251c9f2f625b2fa5f349297369275cdd@telia.com"},"message":"hipe: segment tree delete operation\n\nProfiling showed that hipe_sdi spent most of its time in updateParents,\ndiscarding nodes that were already deleted. By introducing a delete\noperation to the segment trees, we can pay this cost only once, when\ndeleting the node from the graph.\n\nInstead of keeping the ranges around, we recompute the range of the node\nwhen we delete it, since this can be done in constant time, without any\nmemory allocation.\n\nAlthough segment trees are not designed to be modified once built,\nimplementing a delete operation turned out to be a simple matter of\nrepeating insertion, but deleting the index from, instead of consing it\non, the appropriate nodes' values (segment lists).\n\nThis optimisation drastically sped up hipe_sdi to the point of no longer\nbeing the bottleneck in the Assembly stage.","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/ad73c37d4af90834c62f961264dce00118309b0f"},{"sha":"89a6d16fa71870bf496bbe477a3f2c7854396e07","author":{"name":"Magnus Lång","email":"06c4ca77251c9f2f625b2fa5f349297369275cdd@telia.com"},"message":"hipe_icode_coordinator: Rewrite concurrently","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/89a6d16fa71870bf496bbe477a3f2c7854396e07"},{"sha":"fe4f60994fc0a1329629d8c56a784ccd2f414f57","author":{"name":"Magnus Lång","email":"06c4ca77251c9f2f625b2fa5f349297369275cdd@telia.com"},"message":"hipe_icode_range: Use maps over gb_trees,sets\n\nAlso, remove unused field 'counter' from #state{}.","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/fe4f60994fc0a1329629d8c56a784ccd2f414f57"},{"sha":"ebc557f315c99c8e1e0563ae6111c06c7cb271dc","author":{"name":"Magnus Lång","email":"06c4ca77251c9f2f625b2fa5f349297369275cdd@telia.com"},"message":"hipe_x86_frame: speed up find_temps","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/ebc557f315c99c8e1e0563ae6111c06c7cb271dc"},{"sha":"ab4062063727d713a8eca8cf09b8a0f50744bc9b","author":{"name":"Magnus Lång","email":"06c4ca77251c9f2f625b2fa5f349297369275cdd@telia.com"},"message":"hipe/flow/liveness.inc: Use map for liveness type\n\nSlightly improves performance.","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/ab4062063727d713a8eca8cf09b8a0f50744bc9b"},{"sha":"3f1fe056ba8673920a536093b23117f7d287cba7","author":{"name":"Magnus Lång","email":"06c4ca77251c9f2f625b2fa5f349297369275cdd@telia.com"},"message":"hipe_ssa_liveness: Use map as liveness ADT","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/3f1fe056ba8673920a536093b23117f7d287cba7"},{"sha":"4e2d74858fbcd7b62b6538722d5bed0887897c40","author":{"name":"Magnus Lång","email":"06c4ca77251c9f2f625b2fa5f349297369275cdd@telia.com"},"message":"hipe: Faster unreachable basic block removal","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/4e2d74858fbcd7b62b6538722d5bed0887897c40"},{"sha":"fd97ddb2c3031140f12c98c93a31325b15ea8cb6","author":{"name":"Magnus Lång","email":"06c4ca77251c9f2f625b2fa5f349297369275cdd@telia.com"},"message":"hipe_vectors: Change implementation to 'array'\n\nThe 'array' module is highly optimised for the hipe_vectors use-case,\nand seems to perform slightly better than the gb_trees implementation.\n\nAlso, we remove the completely unnecessary hipe_vectors.hrl header.","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/fd97ddb2c3031140f12c98c93a31325b15ea8cb6"},{"sha":"66cc419fd993204a66cf57a674a2c62bbd14d9fe","author":{"name":"Brujo Benavides","email":"43f7bd72a6bc6f78997e36a0c9f77b983b5de4c7@inaka.net"},"message":"Add clarification on LC semantics (#1)\n\nIt addresses the special case of generator-less LCs.\r\n\r\nAs a bonus, I fixed a typo :)","distinct":false,"url":"https://api.github.com/repos/okeuday/otp/commits/66cc419fd993204a66cf57a674a2c62bbd14d9fe"},{"sha":"8b83bc0b54b728cf9179ef3fa0e7610f99f7a6a4","author":{"name":"Björn-Egil Dahlberg","email":"4df9bd36472c1e25be46e9bd2d064dfe201d4b97@erlang.org"},"message":"compiler: Test literal binary matching\n\nThe following regression was introduced in 19.0:\n\n    foo(bar, <<\"x\">>) -> 1;\n    foo(_, <<\"x\">>) -> 2;\n    foo(_, <<\"y\">>) -> 3;\n    foo(_, _) -> fail.\n\nThe call foo(bar,<<\"y\">>) would errorneous return 'fail' instead of 3.\n\nA testcase in match_SUITE has been added to verify this.","distinct":false,"url":"https://api.github.com/repos/okeuday/otp/commits/8b83bc0b54b728cf9179ef3fa0e7610f99f7a6a4"},{"sha":"dd1162846eb7942243ea285310cf100b6959a845","author":{"name":"Björn-Egil Dahlberg","email":"4df9bd36472c1e25be46e9bd2d064dfe201d4b97@erlang.org"},"message":"Revert \"beam_dead: Improve optimization of literal binary matching\"\n\nThis reverts commit 105c5b0071056dc062797e58772e098d2a3a4627.","distinct":false,"url":"https://api.github.com/repos/okeuday/otp/commits/dd1162846eb7942243ea285310cf100b6959a845"},{"sha":"8fa0a2d96e3d5c89f68b8724a125e11fe04e993d","author":{"name":"Björn-Egil Dahlberg","email":"4df9bd36472c1e25be46e9bd2d064dfe201d4b97@erlang.org"},"message":"Update primary bootstrap","distinct":false,"url":"https://api.github.com/repos/okeuday/otp/commits/8fa0a2d96e3d5c89f68b8724a125e11fe04e993d"},{"sha":"d281213a4a04a61910a6c451d8f5c86e61416bb2","author":{"name":"Lukas Larsson","email":"7725246d78edfda814c85745e312e58ff7befafc@erlang.org"},"message":"erts: Move all functions in docs to be in alphabetical order\n\nThis commit only changes the order of functions and does some\nother rearrangements to that the diff with the next commit will\nbe easier to follow. No content or XML tags are changed.","distinct":false,"url":"https://api.github.com/repos/okeuday/otp/commits/d281213a4a04a61910a6c451d8f5c86e61416bb2"},{"sha":"b92f2964f17ac05b1ba476a4f9a7d9fd669650f9","author":{"name":"Siri Hansen","email":"48a99cafc128d6e4374ee5357a7b95d47164fe9b@erlang.org"},"message":"Merge branch 'siri/reltool/dep_in_app_not_xref/ERL-167/OTP-11993' into maint\n\n* siri/reltool/dep_in_app_not_xref/ERL-167/OTP-11993:\n  [reltool] Fix dependency bug for applications not in 'rel' specs\n  [reltool] Fix dependency bug for applications in 'rel' specs\n  [reltool] Add test for ERL-167","distinct":false,"url":"https://api.github.com/repos/okeuday/otp/commits/b92f2964f17ac05b1ba476a4f9a7d9fd669650f9"},{"sha":"ef2e0aadd8bb1ee5be0d1d344f0716f509848afb","author":{"name":"Siri Hansen","email":"48a99cafc128d6e4374ee5357a7b95d47164fe9b@erlang.org"},"message":"Merge branch 'maint'","distinct":true,"url":"https://api.github.com/repos/okeuday/otp/commits/ef2e0aadd8bb1ee5be0d1d344f0716f509848afb"}]}
{"actor":{"display_login":"okeuday"}}