maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

make this more efficient. Scan up to 16 nodes, not the whole list. 

llvm-svn: 20289
This commit is contained in:
Chris Lattner 2005-02-23 16:53:04 +00:00
parent d36552f34f
commit 25169caa80
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
llvm/lib/Transforms/IPO/GlobalOpt.cpp
View File

@ -377,7 +377,7 @@ static GlobalVariable *SRAGlobal(GlobalVariable *GV) {
else
assert(0 && "Unknown aggregate sequential type!");
if (NumElements > 16 && GV->getNumUses() > 16)
if (NumElements > 16 && GV->hasNUsesOrMore(16))
return 0; // It's not worth it.
NewGlobals.reserve(NumElements);
for (unsigned i = 0, e = NumElements; i != e; ++i) {

2
llvm/lib/VMCore/BasicBlock.cpp
View File

@ -136,7 +136,7 @@ void BasicBlock::dropAllReferences() {
// called while the predecessor still refers to this block.
//
void BasicBlock::removePredecessor(BasicBlock *Pred) {
assert((getNumUses() > 16 ||// Reduce cost of this assertion for complex CFGs.
assert((hasNUsesOrMore(16)||// Reduce cost of this assertion for complex CFGs.
find(pred_begin(this), pred_end(this), Pred) != pred_end(this)) &&
"removePredecessor: BB is not a predecessor!");