On 4/19/16 4:50 PM, Marco Leise wrote:
What about using old string compression algorithms on the mangled name? That should effectively get rid of all the repeated words.
It's somewhat recursive, so I don't know how well string compression will work. It's possible, definitely. But I think a substitution scheme that is tailored to the issue may prove more effective. Just the fact that removing the struct out of the function itself cleans it up shows that there is a path to make this happen.
-Steve
