RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-02-24 06:27:56 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Eliminate some std::sets. This speeds up isel of kimwitu by about 0.9%

Browse Source 
llvm-svn: 33852
This commit is contained in:
Chris Lattner 2007-02-04 00:24:41 +00:00
parent a8abc21a3e
commit 6af2a892de
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
lib/CodeGen/SelectionDAG/SelectionDAG.cpp
View File

@ -24,9 +24,9 @@
#include "llvm/Target/TargetInstrInfo.h"
#include "llvm/Target/TargetMachine.h"
#include "llvm/ADT/SetVector.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/StringExtras.h"
#include <set>
#include <algorithm>
#include <cmath>
using namespace llvm;
@ -2548,12 +2548,12 @@ bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
SDOperand TheValue(const_cast<SDNode *>(this), Value);
std::set<SDNode*> UsersHandled;
SmallPtrSet<SDNode*, 32> UsersHandled;
for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
SDNode *User = *UI;
if (User->getNumOperands() == 1 ||
UsersHandled.insert(User).second) // First time we've seen this?
UsersHandled.insert(User)) // First time we've seen this?
for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
if (User->getOperand(i) == TheValue) {
if (NUses == 0)
@ -2599,8 +2599,8 @@ bool SDNode::isOperand(SDNode *N) const {
}
static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
std::set<SDNode *> &Visited) {
if (found || !Visited.insert(N).second)
SmallPtrSet<SDNode *, 32> &Visited) {
if (found || !Visited.insert(N))
return;
for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
@ -2618,7 +2618,7 @@ static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
/// up the operands.
/// NOTE: this is an expensive method. Use it carefully.
bool SDNode::isPredecessor(SDNode *N) const {
std::set<SDNode *> Visited;
SmallPtrSet<SDNode *, 32> Visited;
bool found = false;
findPredecessor(N, this, found, Visited);
return found;