[PATCH] D39415: [ARMISelLowering] Better handling of NEON load/store for sequential memory regions

[Eugene Leviant via Phabricator via llvm-commits]

evgeny777 added a comment.

> Let's assume you have the absurd amount of 10 integers. That's 100 passes for N^2 in the worst possible case, ~33 for nlogn, only when the list is non-empty.

I believe algorithm complexity is O(N), where N is a number of nodes in Selection DAG (it's about finding a minimum value in a list of values). You're suggesting O(N*logN), why?

> You can't push a patch that will affect every Arm device on the planet by testing on ...

Like I said before, my testing capacity is limited and running test suite on a single device (even popular) also doesn't provide that much of data, you probably expect. Meanwhile someone might also want to give it a try, so I updated the diff.


https://reviews.llvm.org/D39415