Uploaded image for project: 'JDK'
  1. JDK
  2. JDK-8324751

C2 SuperWord: Aliasing Analysis runtime check

XMLWordPrintable

      If we can prove (statically or with a runtime-check) that two arrays are different, then this removes edges from the dependency graph, and may allow vectorization that would otherwise not be possible.

      As discussed in JDK-8323582 / https://github.com/openjdk/jdk/pull/22016#issuecomment-2680894298, we should write some benchmarks to prove that we need the slow and fast loop, and so that the complexity of the slow_loop is really justified.

      Also: add a Flag to disable the predicate for Auto Vectorization.

            epeter Emanuel Peter
            epeter Emanuel Peter
            Votes:
            0 Vote for this issue
            Watchers:
            1 Start watching this issue

              Created:
              Updated: