| commit | b9c33c32292d0ae5da2d75623a84a0e7796a2b63 | [log] [tgz] |
|---|---|---|
| author | Dan Gohman <gohman@apple.com> | Wed Jul 09 23:03:14 2008 +0000 |
| committer | Dan Gohman <gohman@apple.com> | Wed Jul 09 23:03:14 2008 +0000 |
| tree | 183104403198bc320675e679ecf019ad7c78ab3d | |
| parent | 1373c1c3951ddd785d4f7f83c0bc89df699d22a0 [diff] |
Simplify hasNUsesOfValue and hasAnyUsesOfValue even more. This makes their special-case checks of use_size() less beneficial, so remove them. This eliminates all but one use of use_size(), which is in AssignTopologicalOrder, which uses it only once for each node, and so can reasonably afford to recompute it, as this allows the UsesSize field of SDNode to be removed altogether. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53377 91177308-0d34-0410-b5e6-96231b3b80d8