On Mon, 15 Jun 2020, Shuai Wang via Gcc wrote:
I am trying to analyze the following gimple statements, where the data dependency of _23 is a tree, whose leave nodes are three constant values {13, 4, 14}.Could anyone shed some light on how such a backward traversal can be implemented? Given _22 used in the last assignment, I have no idea of how to trace back to its definition on the fourth statement... Thank you very much!
SSA_NAME_DEF_STMT
_13 = 13; _14 = _13 + 4; _15 = 14; _22 = (unsigned long) _15; _23 = _22 + _14;
-- Marc Glisse
