| commit | 98307d4dea6d5a1d30f1e042b86ef9e573468999 | |
| author | Linus Torvalds <torvalds@ppc970.osdl.org> | |
| Wed, 1 Dec 2004 16:05:50 +0000 (1 09:05 -0700) | ||
| committer | Linus Torvalds <torvalds@ppc970.osdl.org> | |
| Fri, 8 Apr 2005 04:05:22 +0000 (7 21:05 -0700) | ||
| tree | 8812f3e73fbc6cf0d7c11f85da6b08ba806284b1 | treesnapshot (tar.gz zip) |
| parent | ac0a6eccafcb0a84cd0f1079e2fbb8b3d688b9af | commitdiff |
When simplifying memops, follow the whole chain of adds/subs.
This means we find multiple cases faster, but more importantly,
it also means that if the chain is infinite, we can trivially
notice. We used to just notice immediate recursive uses, not the
more complex cases.
This means we find multiple cases faster, but more importantly,
it also means that if the chain is infinite, we can trivially
notice. We used to just notice immediate recursive uses, not the
more complex cases.
| simplify.c | diffblobblamehistory |