80-columns

llvm-svn: 108228
This commit is contained in:
Eric Christopher 2010-07-13 05:50:08 +00:00
parent c1c6f4796e
commit 9ac75957e2
5 changed files with 18 additions and 12 deletions

View File

@ -125,9 +125,11 @@ private:
key_type_ref KCurrent = ImutInfo::KeyOfValue(this->Value(T)); key_type_ref KCurrent = ImutInfo::KeyOfValue(this->Value(T));
if (ImutInfo::isLess(K, KCurrent)) if (ImutInfo::isLess(K, KCurrent))
return this->Balance(Add_internal(V, this->Left(T)), this->Value(T), this->Right(T)); return this->Balance(Add_internal(V, this->Left(T)), this->Value(T),
this->Right(T));
else else
return this->Balance(this->Left(T), this->Value(T), Add_internal(V, this->Right(T))); return this->Balance(this->Left(T), this->Value(T),
Add_internal(V, this->Right(T)));
} }
// Remove all overlaps from T. // Remove all overlaps from T.
@ -150,9 +152,11 @@ private:
// If current key does not overlap the inserted key. // If current key does not overlap the inserted key.
if (CurrentK.getStart() > K.getEnd()) if (CurrentK.getStart() > K.getEnd())
return this->Balance(RemoveOverlap(this->Left(T), K, Changed), this->Value(T), this->Right(T)); return this->Balance(RemoveOverlap(this->Left(T), K, Changed),
this->Value(T), this->Right(T));
else if (CurrentK.getEnd() < K.getStart()) else if (CurrentK.getEnd() < K.getStart())
return this->Balance(this->Left(T), this->Value(T), RemoveOverlap(this->Right(T), K, Changed)); return this->Balance(this->Left(T), this->Value(T),
RemoveOverlap(this->Right(T), K, Changed));
// Current key overlaps with the inserted key. // Current key overlaps with the inserted key.
// Remove the current key. // Remove the current key.

View File

@ -243,8 +243,8 @@ public:
/// environment components with a single string. /// environment components with a single string.
void setOSAndEnvironmentName(StringRef Str); void setOSAndEnvironmentName(StringRef Str);
/// getArchNameForAssembler - Get an architecture name that is understood by the /// getArchNameForAssembler - Get an architecture name that is understood by
/// target assembler. /// the target assembler.
const char *getArchNameForAssembler(); const char *getArchNameForAssembler();
/// @} /// @}

View File

@ -21,9 +21,9 @@ namespace llvm {
/// by the enclosing function (which is required to exist). This routine can /// by the enclosing function (which is required to exist). This routine can
/// be expensive, so consider caching the results. The boolean ReturnCaptures /// be expensive, so consider caching the results. The boolean ReturnCaptures
/// specifies whether returning the value (or part of it) from the function /// specifies whether returning the value (or part of it) from the function
/// counts as capturing it or not. The boolean StoreCaptures specified whether /// counts as capturing it or not. The boolean StoreCaptures specified
/// storing the value (or part of it) into memory anywhere automatically /// whether storing the value (or part of it) into memory anywhere
/// counts as capturing it or not. /// automatically counts as capturing it or not.
bool PointerMayBeCaptured(const Value *V, bool PointerMayBeCaptured(const Value *V,
bool ReturnCaptures, bool ReturnCaptures,
bool StoreCaptures); bool StoreCaptures);

View File

@ -580,7 +580,8 @@ namespace llvm {
unsigned RunTimeVer = 0); unsigned RunTimeVer = 0);
/// CreateFile - Create a new descriptor for the specified file. /// CreateFile - Create a new descriptor for the specified file.
DIFile CreateFile(StringRef Filename, StringRef Directory, DICompileUnit CU); DIFile CreateFile(StringRef Filename, StringRef Directory,
DICompileUnit CU);
/// CreateEnumerator - Create a single enumerator value. /// CreateEnumerator - Create a single enumerator value.
DIEnumerator CreateEnumerator(StringRef Name, uint64_t Val); DIEnumerator CreateEnumerator(StringRef Name, uint64_t Val);

View File

@ -152,8 +152,9 @@ void Compress(DominatorTreeBase<typename GraphT::NodeType>& DT,
} }
template<class GraphT> template<class GraphT>
typename GraphT::NodeType* Eval(DominatorTreeBase<typename GraphT::NodeType>& DT, typename GraphT::NodeType*
typename GraphT::NodeType *V) { Eval(DominatorTreeBase<typename GraphT::NodeType>& DT,
typename GraphT::NodeType *V) {
typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VInfo = typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VInfo =
DT.Info[V]; DT.Info[V];
#if !BALANCE_IDOM_TREE #if !BALANCE_IDOM_TREE