E = GT::child_end(Node); I != E; ++I)
ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
- IntStack.push(make_pair(Int, succ_begin(Int)));
+ IntStack.push(std::make_pair(Int, succ_begin(Int)));
return true;
}
#include <vector>
#include <map>
#include <cassert>
+#include <string>
namespace llvm {
#include "llvm/Pass.h"
#include "llvm/Target/TargetData.h"
#include "llvm/Support/GetElementPtrTypeIterator.h"
+#include <algorithm>
using namespace llvm;
// Make sure that anything that uses AliasAnalysis pulls in this file...
#include "llvm/Analysis/IntervalIterator.h"
#include "llvm/ADT/STLExtras.h"
+#include <algorithm>
namespace llvm {
// destroy - Reset state back to before function was analyzed
void IntervalPartition::destroy() {
- for_each(Intervals.begin(), Intervals.end(), deleter<Interval>);
+ std::for_each(Intervals.begin(), Intervals.end(), deleter<Interval>);
IntervalMap.clear();
RootInterval = 0;
}
#include "llvm/Support/CFG.h"
#include "llvm/Target/TargetData.h"
#include <set>
+#include <algorithm>
using namespace llvm;
namespace {
// Loop implementation
//
bool Loop::contains(const BasicBlock *BB) const {
- return find(Blocks.begin(), Blocks.end(), BB) != Blocks.end();
+ return std::find(Blocks.begin(), Blocks.end(), BB) != Blocks.end();
}
bool Loop::isLoopExit(const BasicBlock *BB) const {
#include "llvm/Support/CommandLine.h"
#include "llvm/ADT/Statistic.h"
#include <cmath>
+#include <algorithm>
using namespace llvm;
namespace {
#include "llvm/Support/GetElementPtrTypeIterator.h"
#include "llvm/ADT/StringExtras.h"
#include <sstream>
+#include <algorithm>
using namespace llvm;
namespace {
#include "llvm/ADT/STLExtras.h"
#include "VirtRegMap.h"
#include <cmath>
+#include <algorithm>
using namespace llvm;
// is active or inactive to properly update the PhysRegTracker
// and the VirtRegMap
IntervalPtrs::iterator it;
- if ((it = find(active_.begin(), active_.end(), i)) != active_.end()) {
+ if ((it = std::find(active_.begin(), active_.end(), i)) != active_.end()) {
active_.erase(it);
if (MRegisterInfo::isPhysicalRegister(i->reg)) {
prt_->delRegUse(i->reg);
vrm_->clearVirt(i->reg);
}
}
- else if ((it = find(inactive_.begin(), inactive_.end(), i)) != inactive_.end()) {
+ else if ((it = std::find(inactive_.begin(), inactive_.end(), i)) != inactive_.end()) {
inactive_.erase(it);
if (MRegisterInfo::isPhysicalRegister(i->reg))
unhandled_.push(i);
#include "llvm/Transforms/Utils/Local.h"
#include "llvm/Support/Debug.h"
#include "llvm/ADT/Statistic.h"
+#include <algorithm>
using namespace llvm;
namespace {
#include "llvm/Pass.h"
#include "llvm/Support/Debug.h"
#include "llvm/ADT/Statistic.h"
+#include <algorithm>
using namespace llvm;
namespace {
#include "llvm/Support/CFG.h"
#include "llvm/Support/StableBasicBlockNumbering.h"
#include "llvm/ADT/StringExtras.h"
+#include <algorithm>
using namespace llvm;
/// isAllocaPromotable - Return true if this alloca is legal for promotion.
// with incompatible values coming in from the two edges!
//
for (pred_iterator PI = pred_begin(Succ), PE = pred_end(Succ); PI != PE; ++PI)
- if (find(BBPreds.begin(), BBPreds.end(), *PI) != BBPreds.end()) {
+ if (std::find(BBPreds.begin(), BBPreds.end(), *PI) != BBPreds.end()) {
// Loop over all of the PHI nodes checking to see if there are
// incompatible values coming in.
for (BasicBlock::iterator I = Succ->begin();