summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Target/Hexagon/HexagonVLIWPacketizer.cpp
diff options
context:
space:
mode:
authorKrzysztof Parzyszek <kparzysz@codeaurora.org>2017-06-01 18:00:47 +0000
committerKrzysztof Parzyszek <kparzysz@codeaurora.org>2017-06-01 18:00:47 +0000
commit51fd5405d5266f35b97a256ca5b566589dd41643 (patch)
tree0bf3528e3c68ffae4c2702cf9de0851af1c54b8d /llvm/lib/Target/Hexagon/HexagonVLIWPacketizer.cpp
parent8f5073446fc118386971daf7586fcb92440a268c (diff)
downloadbcm5719-llvm-51fd5405d5266f35b97a256ca5b566589dd41643.tar.gz
bcm5719-llvm-51fd5405d5266f35b97a256ca5b566589dd41643.zip
[Hexagon] Handle long-running simplification loop in idiom recognition
The initial assumption was that the simplification would converge to a fixed point relatvely quickly. Turns out that there are legitimate situa- tions where the complexity of the code causes it to take a large number of iterations. Two main changes: - Instead of aborting upon hitting the limit, simply return nullptr. - Reduce the limit to 10,000 from 100,000. llvm-svn: 304441
Diffstat (limited to 'llvm/lib/Target/Hexagon/HexagonVLIWPacketizer.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud