diff options
| author | Jakob Stoklund Olesen <stoklund@2pi.dk> | 2010-02-21 18:51:48 +0000 |
|---|---|---|
| committer | Jakob Stoklund Olesen <stoklund@2pi.dk> | 2010-02-21 18:51:48 +0000 |
| commit | 951d27e54469a6f5e1ceab3e3686c0930c8d207a (patch) | |
| tree | b83d72487f0bffc3e9f308ea955d4bd35bc3cf22 | |
| parent | 90d554ecb30d5282aff54aca2f9b0f3751e83c8c (diff) | |
| download | bcm5719-llvm-951d27e54469a6f5e1ceab3e3686c0930c8d207a.tar.gz bcm5719-llvm-951d27e54469a6f5e1ceab3e3686c0930c8d207a.zip | |
Enable assertion to detect cyclic valno references.
This changes the stack overflow in PR6363 to an assertion failure.
llvm-svn: 96744
| -rw-r--r-- | llvm/lib/CodeGen/SimpleRegisterCoalescing.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/llvm/lib/CodeGen/SimpleRegisterCoalescing.cpp b/llvm/lib/CodeGen/SimpleRegisterCoalescing.cpp index e7b0cff53b3..dcbbb1a0045 100644 --- a/llvm/lib/CodeGen/SimpleRegisterCoalescing.cpp +++ b/llvm/lib/CodeGen/SimpleRegisterCoalescing.cpp @@ -1864,7 +1864,7 @@ static unsigned ComputeUltimateVN(VNInfo *VNI, // If the VN has already been computed, just return it. if (ThisValNoAssignments[VN] >= 0) return ThisValNoAssignments[VN]; -// assert(ThisValNoAssignments[VN] != -2 && "Cyclic case?"); + assert(ThisValNoAssignments[VN] != -2 && "Cyclic value numbers"); // If this val is not a copy from the other val, then it must be a new value // number in the destination. |
