diff options
| author | Francis Visoiu Mistrih <fvisoiumistrih@apple.com> | 2017-02-28 18:34:55 +0000 |
|---|---|---|
| committer | Francis Visoiu Mistrih <fvisoiumistrih@apple.com> | 2017-02-28 18:34:55 +0000 |
| commit | 262ad16a3a63ceffcf7cca139ef0ceb1b57e3e88 (patch) | |
| tree | cf64e05916c751c09e0fe72ec53879df47828cb1 | |
| parent | e154020dc51e90dd20d55bd6371ac395d6422d62 (diff) | |
| download | bcm5719-llvm-262ad16a3a63ceffcf7cca139ef0ceb1b57e3e88.tar.gz bcm5719-llvm-262ad16a3a63ceffcf7cca139ef0ceb1b57e3e88.zip | |
[LCG] Fix EXPENSIVE_CHECKS typo. NFC
Differential Revision: https://reviews.llvm.org/D30434
llvm-svn: 296500
| -rw-r--r-- | llvm/lib/Analysis/LazyCallGraph.cpp | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/llvm/lib/Analysis/LazyCallGraph.cpp b/llvm/lib/Analysis/LazyCallGraph.cpp index a98ef2d8e00..eef56815f2e 100644 --- a/llvm/lib/Analysis/LazyCallGraph.cpp +++ b/llvm/lib/Analysis/LazyCallGraph.cpp @@ -817,7 +817,7 @@ void LazyCallGraph::RefSCC::switchOutgoingEdgeToCall(Node &SourceN, assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); assert(G->lookupRefSCC(TargetN) != this && "Target must not be in this RefSCC."); -#ifdef EXPENSIVE_CEHCKS +#ifdef EXPENSIVE_CHECKS assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && "Target must be a descendant of the Source."); #endif @@ -839,7 +839,7 @@ void LazyCallGraph::RefSCC::switchOutgoingEdgeToRef(Node &SourceN, assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); assert(G->lookupRefSCC(TargetN) != this && "Target must not be in this RefSCC."); -#ifdef EXPENSIVE_CEHCKS +#ifdef EXPENSIVE_CHECKS assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && "Target must be a descendant of the Source."); #endif @@ -876,7 +876,7 @@ void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN, RefSCC &TargetC = *G->lookupRefSCC(TargetN); assert(&TargetC != this && "Target must not be in this RefSCC."); -#ifdef EXPENSIVE_CEHCKS +#ifdef EXPENSIVE_CHECKS assert(TargetC.isDescendantOf(*this) && "Target must be a descendant of the Source."); #endif @@ -896,7 +896,7 @@ LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) { assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC."); RefSCC &SourceC = *G->lookupRefSCC(SourceN); assert(&SourceC != this && "Source must not be in this RefSCC."); -#ifdef EXPENSIVE_CEHCKS +#ifdef EXPENSIVE_CHECKS assert(SourceC.isDescendantOf(*this) && "Source must be a descendant of the Target."); #endif @@ -1449,7 +1449,7 @@ void LazyCallGraph::RefSCC::handleTrivialEdgeInsertion(Node &SourceN, return; } -#ifdef EXPENSIVE_CEHCKS +#ifdef EXPENSIVE_CHECKS assert(TargetRC.isDescendantOf(*this) && "Target must be a descendant of the Source."); #endif |
