This could be done with the same interface to that for DFGs/CFGs/etc. (using TO_BE_INFERRED: ExtensionId as per #1195), but the algorithm needs to be significantly more complicated:
Build a (directed) call graph of functions
Identify cycles; all functions on a cycle must have the same ExtensionSet (so "merge metas")
Solve the unknowns (using existing "look at children" algorithm) in topsort order
This could be done with the same interface to that for DFGs/CFGs/etc. (using
TO_BE_INFERRED: ExtensionIdas per #1195), but the algorithm needs to be significantly more complicated: