en Copyright 2015 Java http://172.16.0.5:8080/history/llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll#5c028081 [polly] Introduce -polly-print-* passes to replace -analyze.The `opt -analyze` option only works with the legacy pass manager and might be removed in the future, as explained in llvm.org/PR53733. This patch introduced -polly-print-* passes that print what the pass would print with the `-analyze` option and replaces all uses of `-analyze` in the regression tests.There are two exceptions: `CodeGen\single_loop_param_less_equal.ll` and `CodeGen\loop_with_condition_nested.ll` use `-analyze on the `-loops` pass which is not part of Polly.Reviewed By: aeubanksDifferential Revision: https://reviews.llvm.org/D120782 List of files: /llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll Mon, 14 Mar 2022 13:39:25 +0000 Michael Kruse <llvm-project@meinersbur.de> http://172.16.0.5:8080/history/llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll#b210c989 [BasicAA] Replace -basicaa with -basic-aa in pollyFollow up to https://reviews.llvm.org/D82607. List of files: /llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll Tue, 30 Jun 2020 22:40:24 +0000 Arthur Eubanks <aeubanks@google.com> http://172.16.0.5:8080/history/llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll#f4ee371e tests: Drop -polly-detect-unprofitable and -polly-no-early-exitThese flags are now always passed to all tests and need to be disabled ifnot needed. Disabling these flags, rather than passing them to almost alltests, significantly simplfies our RUN: lines.llvm-svn: 249422 List of files: /llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll Tue, 06 Oct 2015 15:36:44 +0000 Tobias Grosser <tobias@grosser.es> http://172.16.0.5:8080/history/llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll#c94eca05 Update Polly tests to handle explicitly typed load changes in LLVM.llvm-svn: 230796 List of files: /llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll Fri, 27 Feb 2015 21:22:50 +0000 David Blaikie <dblaikie@gmail.com> http://172.16.0.5:8080/history/llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll#bad3ff20 Update Polly tests to handle explicitly typed gep changes in LLVMllvm-svn: 230784 List of files: /llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll Fri, 27 Feb 2015 19:20:19 +0000 David Blaikie <dblaikie@gmail.com> http://172.16.0.5:8080/history/llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll#d1e33e70 ScopDetection: Only detect scops that have at least one read and one writeScops that only read seem generally uninteresting and scops that only write aremost likely initializations where there is also little to optimize. To notwaste compile time we bail early.Differential Revision: http://reviews.llvm.org/D7735llvm-svn: 229820 List of files: /llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll Thu, 19 Feb 2015 05:31:07 +0000 Tobias Grosser <tobias@grosser.es> http://172.16.0.5:8080/history/llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll#32868bf4 Change the printing of reduction types We use the C operator representation when applicable. + Update all the test cases accordingly.llvm-svn: 214486 List of files: /llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll Fri, 01 Aug 2014 08:13:25 +0000 Johannes Doerfert <jdoerfert@codeaurora.org> http://172.16.0.5:8080/history/llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll#f618339a Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction typellvm-svn: 212126 List of files: /llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll Tue, 01 Jul 2014 20:52:51 +0000 Johannes Doerfert <jdoerfert@codeaurora.org> http://172.16.0.5:8080/history/llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll#e58a0120 Allow multiple reductions per statement Iterate over all store memory accesses and check for valid binary reduction candidate loads by following the operands of the stored value. For each candidate pair we check if they have the same base address and there are no other accesses which may overlap with them. This ensures that no intermediate value can escape into other memory locations or is overwritten at some point. + 17 test cases for reduction detection and reduction dependency modelingllvm-svn: 211957 List of files: /llvm-project-15.0.7/polly/test/ScopInfo/reduction_multiple_loops_array_sum_1.ll Fri, 27 Jun 2014 20:31:28 +0000 Johannes Doerfert <jdoerfert@codeaurora.org>