I would like to know whether there is a pass available in the LLVM framework that does Partial Redundancy elimination on lexically equivalent expressions using the Lazy Code Motion algorithm by Knoop et al. or any other PRE algorithms.
I would like to know whether there is a pass available in the LLVM framework that does Partial Redundancy elimination on lexically equivalent expressions using the Lazy Code Motion algorithm by Knoop et al. or any other PRE algorithms.