Aldy Hernandez wrote:
>> You could combine the two ideas: a global hash table of types used in
>> casts, where each entry had a list of functions using those types. That
>> should take up no more storage than the per-function vectors. Then,
>> you'd have to walk the entire hash table, writing out each type for
>> which at least one of the associated functions was written out,
>> including being inlined into another function.
>
> Do we keep a hash of functions that have been written out somewhere?
>
You need a list of functions that have been written or scheduled to be
emitted? Each node in the call graph has a field 'output' set to true
when the function is marked for generation.
