From 283ee8181a2d48ec11682f149c557e3057495ed3 Mon Sep 17 00:00:00 2001 From: NAKAMURA Takumi Date: Mon, 4 Jul 2016 01:26:33 +0000 Subject: [PATCH] Reformat blank lines. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@274481 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Analysis/LazyValueInfo.cpp | 17 ++++++++--------- lib/ExecutionEngine/RuntimeDyld/RuntimeDyld.cpp | 4 ++-- 2 files changed, 10 insertions(+), 11 deletions(-) diff --git a/lib/Analysis/LazyValueInfo.cpp b/lib/Analysis/LazyValueInfo.cpp index 655b4d2f631..4d09b7ca006 100644 --- a/lib/Analysis/LazyValueInfo.cpp +++ b/lib/Analysis/LazyValueInfo.cpp @@ -116,7 +116,7 @@ public: Res.markOverdefined(); return Res; } - + bool isUndefined() const { return Tag == undefined; } bool isConstant() const { return Tag == constant; } bool isNotConstant() const { return Tag == notconstant; } @@ -494,7 +494,7 @@ namespace { return lookup(V)[BB]; } - + public: /// This is the query interface to determine the lattice /// value for the specified Value* at the end of the specified block. @@ -933,7 +933,7 @@ bool LazyValueInfoCache::solveBlockValueSelect(LVILatticeVal &BBLV, return true; }; } - + // TODO: ABS, NABS from the SelectPatternResult } @@ -993,7 +993,7 @@ bool LazyValueInfoCache::solveBlockValueSelect(LVILatticeVal &BBLV, }; } } - + LVILatticeVal Result; // Start Undefined. Result.mergeIn(TrueVal, DL); Result.mergeIn(FalseVal, DL); @@ -1028,7 +1028,6 @@ bool LazyValueInfoCache::solveBlockValueCast(LVILatticeVal &BBLV, return true; } - // Figure out the range of the LHS. If that fails, we still apply the // transfer rule on the full set since we may be able to locally infer // interesting facts. @@ -1105,7 +1104,7 @@ bool LazyValueInfoCache::solveBlockValueBinaryOp(LVILatticeVal &BBLV, BBLV.markOverdefined(); return true; }; - + // Figure out the range of the LHS. If that fails, use a conservative range, // but apply the transfer rule anyways. This lets us pick up facts from // expressions like "and i32 (call i32 @foo()), 32" @@ -1204,7 +1203,7 @@ bool getValueFromFromCondition(Value *Val, ICmpInst *ICI, return true; } } - + return false; } @@ -1282,7 +1281,7 @@ bool LazyValueInfoCache::getEdgeValue(Value *Val, BasicBlock *BBFrom, // If we couldn't constrain the value on the edge, LocalResult doesn't // provide any information. LocalResult.markOverdefined(); - + if (hasSingleValue(LocalResult)) { // Can't get any more precise here Result = LocalResult; @@ -1664,7 +1663,7 @@ LazyValueInfo::getPredicateAt(unsigned Pred, Value *V, Constant *C, // Note that PredBB may be BB itself. Tristate Result = getPredicateOnEdge(Pred, Incoming, C, PredBB, BB, CxtI); - + // Keep going as long as we've seen a consistent known result for // all inputs. Baseline = (i == 0) ? Result /* First iteration */ diff --git a/lib/ExecutionEngine/RuntimeDyld/RuntimeDyld.cpp b/lib/ExecutionEngine/RuntimeDyld/RuntimeDyld.cpp index 9965f021aef..60479d4bc76 100644 --- a/lib/ExecutionEngine/RuntimeDyld/RuntimeDyld.cpp +++ b/lib/ExecutionEngine/RuntimeDyld/RuntimeDyld.cpp @@ -368,7 +368,7 @@ static bool isRequiredForExecution(const SectionRef Section) { (COFF::IMAGE_SCN_MEM_DISCARDABLE | COFF::IMAGE_SCN_LNK_INFO); return HasContent && !IsDiscardable; } - + assert(isa(Obj)); return true; } @@ -595,7 +595,7 @@ Error RuntimeDyldImpl::emitCommonSymbols(const ObjectFile &Obj, uint64_t Size = Sym.getCommonSize(); CommonSize = alignTo(CommonSize, Align) + Size; - + SymbolsToAllocate.push_back(Sym); } -- 2.50.0