[LLVMdev] How to deal with potentially unlimited count/length symbol names?

[Sean Silva]

On Wed, Jun 19, 2013 at 1:04 AM, edA-qa mort-ora-y <eda-qa at disemia.com>wrote:

>
> The problem is that if I derive the name from what the type contains the
> length of that name is essential unbound. So how does one generate
> names?  I'm thinking of just using a long hash and hoping I don't get
> accidental collisions. Surely there must be a better way?
>

Just a cryptographic hash (e.g. SHA1) to avoid the need to "hope" that
there are no collisions.

-- Sean Silva
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130619/ecee5cf2/attachment.html>