@@ -1029,7 +1029,7 @@ Attributor::getAssumedConstant(const IRPosition &IRP,
1029
1029
return C;
1030
1030
// First check all callbacks provided by outside AAs. If any of them returns
1031
1031
// a non-null value that is different from the associated value, or None, we
1032
- // assume it's simpliied .
1032
+ // assume it's simplified .
1033
1033
for (auto &CB : SimplificationCallbacks.lookup (IRP)) {
1034
1034
Optional<Value *> SimplifiedV = CB (IRP, &AA, UsedAssumedInformation);
1035
1035
if (!SimplifiedV.hasValue ())
@@ -1067,7 +1067,7 @@ Attributor::getAssumedSimplified(const IRPosition &IRP,
1067
1067
bool &UsedAssumedInformation) {
1068
1068
// First check all callbacks provided by outside AAs. If any of them returns
1069
1069
// a non-null value that is different from the associated value, or None, we
1070
- // assume it's simpliied .
1070
+ // assume it's simplified .
1071
1071
for (auto &CB : SimplificationCallbacks.lookup (IRP))
1072
1072
return CB (IRP, AA, UsedAssumedInformation);
1073
1073
@@ -1917,7 +1917,8 @@ ChangeStatus Attributor::cleanupIR() {
1917
1917
<< ToBeDeletedBlocks.size () << " blocks and "
1918
1918
<< ToBeDeletedInsts.size () << " instructions and "
1919
1919
<< ToBeChangedValues.size () << " values and "
1920
- << ToBeChangedUses.size () << " uses. "
1920
+ << ToBeChangedUses.size () << " uses. To insert "
1921
+ << ToBeChangedToUnreachableInsts.size () << " unreachables."
1921
1922
<< " Preserve manifest added " << ManifestAddedBlocks.size ()
1922
1923
<< " blocks\n " );
1923
1924
@@ -1937,7 +1938,7 @@ ChangeStatus Attributor::cleanupIR() {
1937
1938
1938
1939
Instruction *I = dyn_cast<Instruction>(U->getUser ());
1939
1940
assert ((!I || isRunOn (*I->getFunction ())) &&
1940
- " Cannot replace an invoke outside the current SCC!" );
1941
+ " Cannot replace an instruction outside the current SCC!" );
1941
1942
1942
1943
// Do not replace uses in returns if the value is a must-tail call we will
1943
1944
// not delete.
@@ -3108,8 +3109,8 @@ raw_ostream &llvm::operator<<(raw_ostream &OS,
3108
3109
if (!S.isValidState ())
3109
3110
OS << " full-set" ;
3110
3111
else {
3111
- for (auto &it : S.getAssumedSet ())
3112
- OS << it << " , " ;
3112
+ for (auto &It : S.getAssumedSet ())
3113
+ OS << It << " , " ;
3113
3114
if (S.undefIsContained ())
3114
3115
OS << " undef " ;
3115
3116
}
0 commit comments