Ben Clayton 5a13258981 TD: Fix O(2^n) of reachable-by-entry-point
Re-jig the code so that this can be performed in O(n).

Fixed: tint:245
Change-Id: I6dc341c0313e3a1c808f15c66e0c70a7339640e5
Reviewed-on: https://dawn-review.googlesource.com/c/tint/+/43641
Reviewed-by: David Neto <dneto@google.com>
Commit-Queue: David Neto <dneto@google.com>
2021-03-03 19:54:44 +00:00
..
2021-03-02 20:51:18 +00:00
2021-03-02 20:51:18 +00:00
2021-03-02 20:51:18 +00:00
2021-01-21 15:30:10 +00:00
2021-03-02 20:51:18 +00:00
2021-02-18 21:40:19 +00:00
2021-02-18 21:40:19 +00:00
2021-02-18 21:40:19 +00:00
2021-02-24 13:51:13 +00:00
2021-02-18 21:40:19 +00:00
2021-02-24 14:15:02 +00:00
2021-02-11 14:54:41 +00:00
2021-02-11 14:54:41 +00:00
2021-02-11 14:54:41 +00:00
2020-12-10 16:56:02 +00:00
2020-12-10 16:56:02 +00:00