From e85fe660e4e99d30ca9292b706b8ffe6d0367dca Mon Sep 17 00:00:00 2001 From: Bill Wendling Date: Tue, 26 Feb 2008 10:49:39 +0000 Subject: [PATCH] Detabify git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@47597 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/llvm/ADT/APFloat.h | 12 +++++----- include/llvm/ADT/APInt.h | 26 ++++++++++----------- include/llvm/CodeGen/LiveInterval.h | 2 +- include/llvm/CodeGen/LiveIntervalAnalysis.h | 10 ++++---- 4 files changed, 25 insertions(+), 25 deletions(-) diff --git a/include/llvm/ADT/APFloat.h b/include/llvm/ADT/APFloat.h index 73d1e0244c7..65cb1e56bb8 100644 --- a/include/llvm/ADT/APFloat.h +++ b/include/llvm/ADT/APFloat.h @@ -113,11 +113,11 @@ namespace llvm { /* When bits of a floating point number are truncated, this enum is used to indicate what fraction of the LSB those bits represented. It essentially combines the roles of guard and sticky bits. */ - enum lostFraction { // Example of truncated bits: - lfExactlyZero, // 000000 - lfLessThanHalf, // 0xxxxx x's not all zero - lfExactlyHalf, // 100000 - lfMoreThanHalf // 1xxxxx x's not all zero + enum lostFraction { // Example of truncated bits: + lfExactlyZero, // 000000 + lfLessThanHalf, // 0xxxxx x's not all zero + lfExactlyHalf, // 100000 + lfMoreThanHalf // 1xxxxx x's not all zero }; class APFloat { @@ -207,7 +207,7 @@ namespace llvm { /* Conversions. */ opStatus convert(const fltSemantics &, roundingMode); opStatus convertToInteger(integerPart *, unsigned int, bool, - roundingMode) const; + roundingMode) const; opStatus convertFromSignExtendedInteger(const integerPart *, unsigned int, bool, roundingMode); opStatus convertFromZeroExtendedInteger(const integerPart *, unsigned int, diff --git a/include/llvm/ADT/APInt.h b/include/llvm/ADT/APInt.h index 8f470e46324..bf3f80c55bd 100644 --- a/include/llvm/ADT/APInt.h +++ b/include/llvm/ADT/APInt.h @@ -1130,12 +1130,12 @@ public: /// DST += RHS + CARRY where CARRY is zero or one. Returns the /// carry flag. static integerPart tcAdd(integerPart *, const integerPart *, - integerPart carry, unsigned); + integerPart carry, unsigned); /// DST -= RHS + CARRY where CARRY is zero or one. Returns the /// carry flag. static integerPart tcSubtract(integerPart *, const integerPart *, - integerPart carry, unsigned); + integerPart carry, unsigned); /// DST += SRC * MULTIPLIER + PART if add is true /// DST = SRC * MULTIPLIER + PART if add is false @@ -1149,23 +1149,23 @@ public: /// parts were zero return zero, otherwise overflow occurred and /// return one. static int tcMultiplyPart(integerPart *dst, const integerPart *src, - integerPart multiplier, integerPart carry, - unsigned int srcParts, unsigned int dstParts, - bool add); + integerPart multiplier, integerPart carry, + unsigned int srcParts, unsigned int dstParts, + bool add); /// DST = LHS * RHS, where DST has the same width as the operands /// and is filled with the least significant parts of the result. /// Returns one if overflow occurred, otherwise zero. DST must be /// disjoint from both operands. static int tcMultiply(integerPart *, const integerPart *, - const integerPart *, unsigned); + const integerPart *, unsigned); /// DST = LHS * RHS, where DST has width the sum of the widths of /// the operands. No overflow occurs. DST must be disjoint from /// both operands. Returns the number of parts required to hold the /// result. static unsigned int tcFullMultiply(integerPart *, const integerPart *, - const integerPart *, unsigned, unsigned); + const integerPart *, unsigned, unsigned); /// If RHS is zero LHS and REMAINDER are left unchanged, return one. /// Otherwise set LHS to LHS / RHS with the fractional part @@ -1178,18 +1178,18 @@ public: /// and are destroyed. LHS, REMAINDER and SCRATCH must be /// distinct. static int tcDivide(integerPart *lhs, const integerPart *rhs, - integerPart *remainder, integerPart *scratch, - unsigned int parts); + integerPart *remainder, integerPart *scratch, + unsigned int parts); /// Shift a bignum left COUNT bits. Shifted in bits are zero. /// There are no restrictions on COUNT. static void tcShiftLeft(integerPart *, unsigned int parts, - unsigned int count); + unsigned int count); /// Shift a bignum right COUNT bits. Shifted in bits are zero. /// There are no restrictions on COUNT. static void tcShiftRight(integerPart *, unsigned int parts, - unsigned int count); + unsigned int count); /// The obvious AND, OR and XOR and complement operations. static void tcAnd(integerPart *, const integerPart *, unsigned int); @@ -1199,14 +1199,14 @@ public: /// Comparison (unsigned) of two bignums. static int tcCompare(const integerPart *, const integerPart *, - unsigned int); + unsigned int); /// Increment a bignum in-place. Return the carry flag. static integerPart tcIncrement(integerPart *, unsigned int); /// Set the least significant BITS and clear the rest. static void tcSetLeastSignificantBits(integerPart *, unsigned int, - unsigned int bits); + unsigned int bits); /// @brief debug method void dump() const; diff --git a/include/llvm/CodeGen/LiveInterval.h b/include/llvm/CodeGen/LiveInterval.h index 532d814935d..a50fef96b3e 100644 --- a/include/llvm/CodeGen/LiveInterval.h +++ b/include/llvm/CodeGen/LiveInterval.h @@ -335,7 +335,7 @@ namespace llvm { /// the intervals are not joinable, this aborts. void join(LiveInterval &Other, const int *ValNoAssignments, const int *RHSValNoAssignments, - SmallVector &NewVNInfo); + SmallVector &NewVNInfo); /// removeRange - Remove the specified range from this interval. Note that /// the range must already be in this interval in its entirety. diff --git a/include/llvm/CodeGen/LiveIntervalAnalysis.h b/include/llvm/CodeGen/LiveIntervalAnalysis.h index 3474ed3f7be..f2991c6197c 100644 --- a/include/llvm/CodeGen/LiveIntervalAnalysis.h +++ b/include/llvm/CodeGen/LiveIntervalAnalysis.h @@ -172,15 +172,15 @@ namespace llvm { /// MBB return a pointer the MBB MachineBasicBlock* getMBBFromIndex(unsigned index) const { std::vector::const_iterator I = - std::lower_bound(Idx2MBBMap.begin(), Idx2MBBMap.end(), index); + std::lower_bound(Idx2MBBMap.begin(), Idx2MBBMap.end(), index); // Take the pair containing the index std::vector::const_iterator J = - ((I != Idx2MBBMap.end() && I->first > index) || - (I == Idx2MBBMap.end() && Idx2MBBMap.size()>0)) ? (I-1): I; + ((I != Idx2MBBMap.end() && I->first > index) || + (I == Idx2MBBMap.end() && Idx2MBBMap.size()>0)) ? (I-1): I; assert(J != Idx2MBBMap.end() && J->first < index+1 && - index <= getMBBEndIdx(J->second) && - "index does not correspond to an MBB"); + index <= getMBBEndIdx(J->second) && + "index does not correspond to an MBB"); return J->second; }