mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 11:42:57 +01:00
80-columns
llvm-svn: 108228
This commit is contained in:
parent
8c1f6adf81
commit
bc774d339c
@ -125,9 +125,11 @@ private:
|
||||
key_type_ref KCurrent = ImutInfo::KeyOfValue(this->Value(T));
|
||||
|
||||
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
|
||||
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.
|
||||
@ -150,9 +152,11 @@ private:
|
||||
|
||||
// If current key does not overlap the inserted key.
|
||||
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())
|
||||
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.
|
||||
// Remove the current key.
|
||||
|
@ -243,8 +243,8 @@ public:
|
||||
/// environment components with a single string.
|
||||
void setOSAndEnvironmentName(StringRef Str);
|
||||
|
||||
/// getArchNameForAssembler - Get an architecture name that is understood by the
|
||||
/// target assembler.
|
||||
/// getArchNameForAssembler - Get an architecture name that is understood by
|
||||
/// the target assembler.
|
||||
const char *getArchNameForAssembler();
|
||||
|
||||
/// @}
|
||||
|
@ -21,9 +21,9 @@ namespace llvm {
|
||||
/// by the enclosing function (which is required to exist). This routine can
|
||||
/// be expensive, so consider caching the results. The boolean ReturnCaptures
|
||||
/// specifies whether returning the value (or part of it) from the function
|
||||
/// counts as capturing it or not. The boolean StoreCaptures specified whether
|
||||
/// storing the value (or part of it) into memory anywhere automatically
|
||||
/// counts as capturing it or not.
|
||||
/// counts as capturing it or not. The boolean StoreCaptures specified
|
||||
/// whether storing the value (or part of it) into memory anywhere
|
||||
/// automatically counts as capturing it or not.
|
||||
bool PointerMayBeCaptured(const Value *V,
|
||||
bool ReturnCaptures,
|
||||
bool StoreCaptures);
|
||||
|
@ -580,7 +580,8 @@ namespace llvm {
|
||||
unsigned RunTimeVer = 0);
|
||||
|
||||
/// 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.
|
||||
DIEnumerator CreateEnumerator(StringRef Name, uint64_t Val);
|
||||
|
@ -152,8 +152,9 @@ void Compress(DominatorTreeBase<typename GraphT::NodeType>& DT,
|
||||
}
|
||||
|
||||
template<class GraphT>
|
||||
typename GraphT::NodeType* Eval(DominatorTreeBase<typename GraphT::NodeType>& DT,
|
||||
typename GraphT::NodeType *V) {
|
||||
typename GraphT::NodeType*
|
||||
Eval(DominatorTreeBase<typename GraphT::NodeType>& DT,
|
||||
typename GraphT::NodeType *V) {
|
||||
typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VInfo =
|
||||
DT.Info[V];
|
||||
#if !BALANCE_IDOM_TREE
|
||||
|
Loading…
Reference in New Issue
Block a user