{"push_id":1191352520,"size":124,"distinct_size":124,"ref":"refs/heads/release_39","head":"d2a6d3490def0120a31d890d9bf9093e277778c6","before":"20802433719d802a67ac592fe3ee7a5d4de2eb86","commits":[{"sha":"a90f917f6b2130e607bc0898dca071c3a9947a08","author":{"name":"Michael Kruse","email":"8cf53cb1e3fb918794d5d9a96f1237a23ea1e145@meinersbur.de"},"message":"Update to ISL 0.17.\n\nThis release includes sevaral improvments compared to the previous\nversion isl-0.16.1-145-g243bf7c (from the ISL 0.17 announcement):\n- optionally combine SCCs incrementally in scheduler\n- optionally maximize coincidence in scheduler\n- optionally avoid loop coalescing in scheduler\n- minor AST generator improvements\n- improve support for expansions in schedule trees\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@268500 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/a90f917f6b2130e607bc0898dca071c3a9947a08"},{"sha":"136cb43273b8fedcf5f48a6c47dd28bb76c286c1","author":{"name":"Tobias Grosser","email":"36c5bbefeb290c7a456f392d21ced31cf0271e32@grosser.es"},"message":"Update isl to isl-0.17-5-g57dc5ff\n\nThis update fixes an assertion in the isl scheduler.\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@268853 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/136cb43273b8fedcf5f48a6c47dd28bb76c286c1"},{"sha":"aa050bddf160d808e359f0200d5d63df19764753","author":{"name":"Tobias Grosser","email":"36c5bbefeb290c7a456f392d21ced31cf0271e32@grosser.es"},"message":"test: Use CHECK-NEXT to not miss instructions in test output\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@268854 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/aa050bddf160d808e359f0200d5d63df19764753"},{"sha":"0a51fac214268c3c1faf2d53e2870f1931015e22","author":{"name":"Tobias Grosser","email":"36c5bbefeb290c7a456f392d21ced31cf0271e32@grosser.es"},"message":"Codegen: Enable the detection of min/max expressions\n\nMin/max expressions are easier to read and can in some cases also result in\nmore concise IR that is generated as the min/max --- when lowered to a\ncmp+select pattern -- commonly has a simpler condition then the ternary\ncondition isl would normally generate.\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@268855 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/0a51fac214268c3c1faf2d53e2870f1931015e22"},{"sha":"5b106486cd7f0ce4df9e7101680e562badc497d7","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Expose interpretAsUnsigned in the SCEVAffinator [NFC]\n\n  This exposes the functionality to interpret a SCEV, or better the\n  piece-wise function created from the SCEV, as an unsigned value\n  instead of a signed one.\n\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269044 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/5b106486cd7f0ce4df9e7101680e562badc497d7"},{"sha":"ed04eb5a3e81498121d8b4576d3f388eb7f4b307","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Prevent complex access ranges with low number of pieces.\n\n  Previously we checked the number of pieces to decide whether or not a\n  invariant load was to complex to be generated. However, there are\n  cases when e.g., divisions cause the complexity to spike regardless of\n  the number of pieces. To this end we now check the number of totally\n  involved dimensions which will increase with the number of pieces but\n  also the number of divisions.\n\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269045 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/ed04eb5a3e81498121d8b4576d3f388eb7f4b307"},{"sha":"bbd322608c34794b7cbc092dc3896c3b61093e34","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Simplify access relation for invariant loads early [NFC]\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269046 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/bbd322608c34794b7cbc092dc3896c3b61093e34"},{"sha":"f62141ecdaa3daff6e8180bdcbf213640988fe90","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Simplify the internal representation according to the context [NFC]\n\n  We now use context information to simplify the domains and access\n  functions of the SCoP instead of just aligning them with the parameter\n  space.\n\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269048 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/f62141ecdaa3daff6e8180bdcbf213640988fe90"},{"sha":"67d5a38fe6d105dadcb1ba604f68dc898ffac598","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Refactor simplifySCoP [NFC]\n\n  Remove obsolete code and decrease the indention in the\n  Scop::simplifySCoP() function.\n\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269049 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/67d5a38fe6d105dadcb1ba604f68dc898ffac598"},{"sha":"cc92d0735694a6506bccd6a7467d6c95d0a9341b","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"[FIX] Create error-restrictions late\n\n  Before this patch we generated error-restrictions only for\n  error-blocks, thus blocks (or regions) containing a not represented\n  function call. However, the same reasoning is needed if the invalid\n  domain of a statement subsumes its actual domain. To this end we move\n  the generation of error-restrictions after the propagation of the\n  invalid domains. Consequently, error-statements are now defined more\n  general as statements that are assumed to be not executed.\n  Additionally, we do not record an empty domain for such statements but\n  a nullptr instead. This allows to distinguish between error-statements\n  and dead-statements.\n\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269053 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/cc92d0735694a6506bccd6a7467d6c95d0a9341b"},{"sha":"a17b9ee78cb0901665fbff3909372289c458de17","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Propagate complexity problems during domain generation [NFC]\n\n  This patches makes the propagation of complexity problems during\n  domain generation consistent. Additionally, it makes it less likely to\n  encounter ill-formed domains later, e.g., during schedule generation.\n\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269055 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/a17b9ee78cb0901665fbff3909372289c458de17"},{"sha":"a07fb828feb223cf5749e9fdf83b5ea7245e3295","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Handle llvm.assume inside the SCoP\n\n  The assumption attached to an llvm.assume in the SCoP needs to be\n  combined with the domain of the surrounding statement but can\n  nevertheless be used to refine the context.\n\n  This fixes the problems mentioned in PR27067.\n\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269060 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/a07fb828feb223cf5749e9fdf83b5ea7245e3295"},{"sha":"7ee38007210bc0d972ba7d0edf530782a8abcf90","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"[FIX] Cleanup isl objects prior to early exit\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269061 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/7ee38007210bc0d972ba7d0edf530782a8abcf90"},{"sha":"a9db63f76b4b6d4fc8747aaa5a025e95e136af45","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Weaken profitability constraints during ScopDetection\n\n  Regions with one affine loop can be profitable if the loop is\n  distributable. To this end we will allow them to be treated as\n  profitable if they contain at least two non-trivial basic blocks.\n\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269064 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/a9db63f76b4b6d4fc8747aaa5a025e95e136af45"},{"sha":"c4c59e5aa3d458dbfc62bfa80e6a13c5f3c34912","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Invalidate unprofitable SCoPs after creation\n\n  If a profitable run is performed we will check if the SCoP seems to be\n  profitable after creation but before e.g., dependence are computed. This is\n  needed as SCoP detection only approximates the actual SCoP representation.\n  In the end this should allow us to be less conservative during the SCoP\n  detection while keeping the compile time in check.\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269074 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/c4c59e5aa3d458dbfc62bfa80e6a13c5f3c34912"},{"sha":"37be057a8b1584d1708a8fdac9df11fc6f695208","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Check overflows in RTCs and bail accordingly\n\n  We utilize assumptions on the input to model IR in polyhedral world.\n  To verify these assumptions we version the code and guard it with a\n  runtime-check (RTC). However, since the RTCs are themselves generated\n  from the polyhedral representation we generate them under the same\n  assumptions that they should verify. In other words, the guarantees\n  that we try to provide with the RTCs do not hold for the RTCs\n  themselves. To this end it is necessary to employ a different check\n  for the RTCs that will verify the assumptions did hold for them too.\n\nDifferential Revision: http://reviews.llvm.org/D20165\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269299 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/37be057a8b1584d1708a8fdac9df11fc6f695208"},{"sha":"af095938884ca413c6e5b56f14a7bb15a2daa4f6","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Support truncate operations\n\n  Truncate operations are basically modulo operations, thus we can model\n  them that way. However, for large types we assume the operand to fit\n  in the new type size instead of introducing a modulo with a very large\n  constant.\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269300 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/af095938884ca413c6e5b56f14a7bb15a2daa4f6"},{"sha":"89db0d7fb32d8e18825d70a21f7cbf3a43d26501","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Bring some comments up to date [NFC]\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269301 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/89db0d7fb32d8e18825d70a21f7cbf3a43d26501"},{"sha":"d6be8d71b1341cfbb2e6938cacbca2a54138abcf","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Cleanup rejection log handling [NFC]\n\n  This patch cleans up the rejection log handling during the\n  ScopDetection. It consists of two interconnected parts:\n    - We keep all detection contexts for a function in order to provide\n      more information to the user, e.g., about the rejection of\n      extended/intermediate regions.\n    - We remove the mutable \"RejectLogs\" member as the information is\n      available through the detection contexts.\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269323 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/d6be8d71b1341cfbb2e6938cacbca2a54138abcf"},{"sha":"78ea8f0900013c3421230c9223eccac0f72d02e9","author":{"name":"Johannes Doerfert","email":"64bc5e5353aad6ac053be818779f2aa027384cb1@cs.uni-saarland.de"},"message":"Check late for profitability\n\n  Before this patch we only expanded valid __and__ profitable region. Therefor\n  we did not allow the expansion to create a profitable region from a\n  non-profitable one.  With this patch we will remember and expand all valid\n  regions and check for profitability only at the end.\n\n  This patch increases the number of valid SCoPs in the LLVM-TS and SPEC\n  2000/2006 by 28% (from 303 to 390), including the hot loop in hmmer.\n\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/polly/trunk@269343 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/dragon-tc/polly/commits/78ea8f0900013c3421230c9223eccac0f72d02e9"}]}
{"actor":{"display_login":"mydongistiny"}}