Hi Alfie, Another basic and possibly stupid question.
Initially I asked whether a length-based approach would make sense for aarch64 as well. Not really in the sense of re-using len masking but rather treating the number of actually read bytes as a length from which a mask can be built. As I'm a bit confused by all the masks being passed around and unpacked: How bad would it be to build the mask via WHILE_ULT from the result of COND_COUNT_ACTIVE (if that's possible)? I guess that involves a costly vector -> GPR -> vector roundtrip but only in the fixup block that's cold anyway. Probably that's already the answer but I still wanted to make sure (because that would allow us to avoid quite a bit of implementation complexity). -- Regards Robin
