[all-commits] [llvm/llvm-project] aeedab: [SLP]Correctly decide if the non-power-of-2 number...

[Alexey Bataev via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: aeedab77b596f858b0c53923657fc8c190d48ea8
      https://github.com/llvm/llvm-project/commit/aeedab77b596f858b0c53923657fc8c190d48ea8
  Author: Alexey Bataev <a.bataev at outlook.com>
  Date:   2024-08-29 (Thu, 29 Aug 2024)

  Changed paths:
    M llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp
    M llvm/test/Transforms/SLPVectorizer/X86/odd_store.ll

  Log Message:
  -----------
  [SLP]Correctly decide if the non-power-of-2 number of stores can be vectorized.

Need to consider the maximum type size in the graph before doing attempt
for the vectorization of non-power-of-2 number of elements, which may be
  less than MinVF.



To unsubscribe from these emails, change your notification settings at https://github.com/llvm/llvm-project/settings/notifications