I think we already went through this. I'd really like to see code VL agnostic and make comparisons of SVE vs R-V vector extension.
I've seen VL agnostic SVE code that doesn't need a single change for different VL. But I guess there are cases where that doesn't work (shuffles?) and I'd be interested in seeing how R-V handles that.
Vector ISA is hardware abstraction layer. By definition everything just works - and it's not only theoretical as working vector cpus have been build from 70's. Every op is scalar - SIMD packing is only done in hardware level which doesn't show outside. (there might be side-channels though). SVE other hand have some instructions scalable with hardware tail handling and part of instructions needs different software handlers for different SIMD widths. It seems to be nightmare beyond any other commercial architechture. Waiting to see when some hardware maker finally implements SVE over 128 bits, offers Linux support and Linus Torvalds tries to implement and verify algorithms to support it. I might be totally wrong and SVE is actually fine to code for - but as years go and nobody bothers to use it I suspect that everybody else is also seeing SVE problems and stay as far as possible from it.