tree 69359f7b97c7a2b25d276b936d6cd56145ae572a
parent 1433c3e997ef7cc29f460d7b2f5da813acd0cafa
author Gaëtan Bossu <gaetan.bossu@arm.com> 1745934442 +0100
committer GitHub <noreply@github.com> 1745934442 +0100
gpgsig -----BEGIN PGP SIGNATURE-----
 
 wsFcBAABCAAQBQJoENhqCRC1aQ7uu5UhlAAAlvkQACAQ7sB9r/lhyrvMKURLrHyB
 HbwjuBHKA+V0nJBfyO8pjwSAj+f1b2k9m/LZdVMhN4/0Tzq5IgX3khJC/+NQg6mf
 BSAqNy50wqdstG1e3J5dSNb6yVdvFF/Rx7SZb0YR56OT+z/6hp6WAx6ulqZi8s4w
 uTHU8DrRVqhVm6BtklP8yJqy6vUZXVKNCGwaElh60wp3PdT0NLtmOHMicGzTNSUb
 JTU0ontmUjrHHGxrvwDVmSmMn0SsWC+gvJSs7xFc99MO+m/IynqJ9dcGwtcW0+2b
 vxhqlPmzoh4fSKZaoaXPiJ5a9CYlKV/eXDtOOvQhr/9ZZvhQvuYt7ceRsaMPhMCe
 stqJ38CpVSahYRkOeM5N7l39vHN6D+rmbgfnRsIlyNfRc6U9fczVjMULu7okY48J
 ygO6HtulELqJuo4Yl4hA/7RkMjwWwF+8TNFbKYSzq0s7ky3LeEhpATRfb4T1BC0a
 X6Vhch1qlEwFFh2pnhjJNWY2gVpl34Rol0jIvTDVP/CMAp3Bpso0uHSKMC82ir+q
 CbDEJ/UTmvTtzXcKSUuNvoKX9YIyxG49smsf3VUU6TtWKmu/AjSoQmqi4UEGfFQM
 mZF/6WFMhYdvZSt3Q0enRgRt0JbFqcHoubqTsSRnJdiCOnttfO8TRjg0+ZsO2f8y
 5KXhKwBv44PJptpE5agj
 =CKcM
 -----END PGP SIGNATURE-----
 

[SLP] Simplify tryToFindDuplicates() (NFC) (#135766)

This NFC aims to simplify the control-flow and interfaces used in tryToFindDuplicates(). The point is to make it easier to understand where decisions for scalar de-duplication are made.

In particular:
 - Limit indentation
 - Rename some variables to better match their use case
- Always give consistent outputs for VL and ReuseShuffleIndices. This makes it possible to use the same code for building gather TreeEntry everywhere. This also allows to remove the TryToFindDuplicates lambda.