6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-24 22:24:54 +00:00
Code Issues Projects Releases Wiki Activity

Minor cleanups

Browse Source 
Do not #include Parallelize.h, it's just a subset of Cilkifier.h


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8285 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2003-09-01 16:42:16 +00:00
parent 01112bd08a
commit aa9214524d
2 changed files with 16 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
lib/Analysis/DataStructure/Parallelize.cpp
View File

@@ -1,4 +1,4 @@
//===- Parallelize.cpp - Auto parallelization using DS Graphs ---*- C++ -*-===// //===- Parallelize.cpp - Auto parallelization using DS Graphs -------------===//
// //
// This file implements a pass that automatically parallelizes a program, // This file implements a pass that automatically parallelizes a program,
// using the Cilk multi-threaded runtime system to execute parallel code. // using the Cilk multi-threaded runtime system to execute parallel code.
@@ -28,19 +28,16 @@
// -- Excessive overhead at "spawned" function calls, which has no benefit // -- Excessive overhead at "spawned" function calls, which has no benefit
// once all threads are busy (especially common when the degree of // once all threads are busy (especially common when the degree of
// parallelism is low). // parallelism is low).
//
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
#include "llvm/Transforms/Parallelize.h"
#include "llvm/Transforms/Utils/DemoteRegToStack.h" #include "llvm/Transforms/Utils/DemoteRegToStack.h"
#include "llvm/Analysis/PgmDependenceGraph.h" #include "llvm/Analysis/PgmDependenceGraph.h"
#include "llvm/Analysis/Dominators.h" #include "llvm/Analysis/Dominators.h"
#include "llvm/Analysis/DataStructure.h" #include "llvm/Analysis/DataStructure.h"
#include "llvm/Analysis/DSGraph.h" #include "llvm/Analysis/DSGraph.h"
#include "llvm/Module.h" #include "llvm/Module.h"
#include "llvm/Function.h" #include "llvm/Instructions.h"
#include "llvm/iOther.h"
#include "llvm/iPHINode.h"
#include "llvm/iTerminators.h" #include "llvm/iTerminators.h"
#include "llvm/DerivedTypes.h" #include "llvm/DerivedTypes.h"
#include "llvm/Support/InstVisitor.h" #include "llvm/Support/InstVisitor.h"
@@ -49,8 +46,6 @@
#include "Support/STLExtras.h" #include "Support/STLExtras.h"
#include "Support/hash_set" #include "Support/hash_set"
#include "Support/hash_map" #include "Support/hash_map"
#include <vector>
#include <stack>
#include <functional> #include <functional>
#include <algorithm> #include <algorithm>
@@ -221,14 +216,14 @@ void Cilkifier::visitCallInst(CallInst& CI)
// Now find all outgoing SSA dependences to the eventual non-Phi users of // Now find all outgoing SSA dependences to the eventual non-Phi users of
// the call value (i.e., direct users that are not phis, and for any // the call value (i.e., direct users that are not phis, and for any
// user that is a Phi, direct non-Phi users of that Phi, and recursively). // user that is a Phi, direct non-Phi users of that Phi, and recursively).
std::stack<const PHINode*> phiUsers; std::vector<const PHINode*> phiUsers;
hash_set<const PHINode*> phisSeen; // ensures we don't visit a phi twice hash_set<const PHINode*> phisSeen; // ensures we don't visit a phi twice
for (Value::use_iterator UI=CI.use_begin(), UE=CI.use_end(); UI != UE; ++UI) for (Value::use_iterator UI=CI.use_begin(), UE=CI.use_end(); UI != UE; ++UI)
if (const PHINode* phiUser = dyn_cast<PHINode>(*UI)) if (const PHINode* phiUser = dyn_cast<PHINode>(*UI))
{ {
if (phisSeen.find(phiUser) == phisSeen.end()) if (phisSeen.find(phiUser) == phisSeen.end())
{ {
phiUsers.push(phiUser); phiUsers.push_back(phiUser);
phisSeen.insert(phiUser); phisSeen.insert(phiUser);
} }
} }
@@ -237,16 +232,16 @@ void Cilkifier::visitCallInst(CallInst& CI)
// Now we've found the non-Phi users and immediate phi users. // Now we've found the non-Phi users and immediate phi users.
// Recursively walk the phi users and add their non-phi users. // Recursively walk the phi users and add their non-phi users.
for (const PHINode* phiUser; !phiUsers.empty(); phiUsers.pop()) for (const PHINode* phiUser; !phiUsers.empty(); phiUsers.pop_back())
{ {
phiUser = phiUsers.top(); phiUser = phiUsers.back();
for (Value::use_const_iterator UI=phiUser->use_begin(), for (Value::use_const_iterator UI=phiUser->use_begin(),
UE=phiUser->use_end(); UI != UE; ++UI) UE=phiUser->use_end(); UI != UE; ++UI)
if (const PHINode* pn = dyn_cast<PHINode>(*UI)) if (const PHINode* pn = dyn_cast<PHINode>(*UI))
{ {
if (phisSeen.find(pn) == phisSeen.end()) if (phisSeen.find(pn) == phisSeen.end())
{ {
phiUsers.push(pn); phiUsers.push_back(pn);
phisSeen.insert(pn); phisSeen.insert(pn);
} }
} }

21
lib/Transforms/IPO/Parallelize.cpp
View File

@@ -1,4 +1,4 @@
//===- Parallelize.cpp - Auto parallelization using DS Graphs ---*- C++ -*-===// //===- Parallelize.cpp - Auto parallelization using DS Graphs -------------===//
// //
// This file implements a pass that automatically parallelizes a program, // This file implements a pass that automatically parallelizes a program,
// using the Cilk multi-threaded runtime system to execute parallel code. // using the Cilk multi-threaded runtime system to execute parallel code.
@@ -28,19 +28,16 @@
// -- Excessive overhead at "spawned" function calls, which has no benefit // -- Excessive overhead at "spawned" function calls, which has no benefit
// once all threads are busy (especially common when the degree of // once all threads are busy (especially common when the degree of
// parallelism is low). // parallelism is low).
//
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
#include "llvm/Transforms/Parallelize.h"
#include "llvm/Transforms/Utils/DemoteRegToStack.h" #include "llvm/Transforms/Utils/DemoteRegToStack.h"
#include "llvm/Analysis/PgmDependenceGraph.h" #include "llvm/Analysis/PgmDependenceGraph.h"
#include "llvm/Analysis/Dominators.h" #include "llvm/Analysis/Dominators.h"
#include "llvm/Analysis/DataStructure.h" #include "llvm/Analysis/DataStructure.h"
#include "llvm/Analysis/DSGraph.h" #include "llvm/Analysis/DSGraph.h"
#include "llvm/Module.h" #include "llvm/Module.h"
#include "llvm/Function.h" #include "llvm/Instructions.h"
#include "llvm/iOther.h"
#include "llvm/iPHINode.h"
#include "llvm/iTerminators.h" #include "llvm/iTerminators.h"
#include "llvm/DerivedTypes.h" #include "llvm/DerivedTypes.h"
#include "llvm/Support/InstVisitor.h" #include "llvm/Support/InstVisitor.h"
@@ -49,8 +46,6 @@
#include "Support/STLExtras.h" #include "Support/STLExtras.h"
#include "Support/hash_set" #include "Support/hash_set"
#include "Support/hash_map" #include "Support/hash_map"
#include <vector>
#include <stack>
#include <functional> #include <functional>
#include <algorithm> #include <algorithm>
@@ -221,14 +216,14 @@ void Cilkifier::visitCallInst(CallInst& CI)
// Now find all outgoing SSA dependences to the eventual non-Phi users of // Now find all outgoing SSA dependences to the eventual non-Phi users of
// the call value (i.e., direct users that are not phis, and for any // the call value (i.e., direct users that are not phis, and for any
// user that is a Phi, direct non-Phi users of that Phi, and recursively). // user that is a Phi, direct non-Phi users of that Phi, and recursively).
std::stack<const PHINode*> phiUsers; std::vector<const PHINode*> phiUsers;
hash_set<const PHINode*> phisSeen; // ensures we don't visit a phi twice hash_set<const PHINode*> phisSeen; // ensures we don't visit a phi twice
for (Value::use_iterator UI=CI.use_begin(), UE=CI.use_end(); UI != UE; ++UI) for (Value::use_iterator UI=CI.use_begin(), UE=CI.use_end(); UI != UE; ++UI)
if (const PHINode* phiUser = dyn_cast<PHINode>(*UI)) if (const PHINode* phiUser = dyn_cast<PHINode>(*UI))
{ {
if (phisSeen.find(phiUser) == phisSeen.end()) if (phisSeen.find(phiUser) == phisSeen.end())
{ {
phiUsers.push(phiUser); phiUsers.push_back(phiUser);
phisSeen.insert(phiUser); phisSeen.insert(phiUser);
} }
} }
@@ -237,16 +232,16 @@ void Cilkifier::visitCallInst(CallInst& CI)
// Now we've found the non-Phi users and immediate phi users. // Now we've found the non-Phi users and immediate phi users.
// Recursively walk the phi users and add their non-phi users. // Recursively walk the phi users and add their non-phi users.
for (const PHINode* phiUser; !phiUsers.empty(); phiUsers.pop()) for (const PHINode* phiUser; !phiUsers.empty(); phiUsers.pop_back())
{ {
phiUser = phiUsers.top(); phiUser = phiUsers.back();
for (Value::use_const_iterator UI=phiUser->use_begin(), for (Value::use_const_iterator UI=phiUser->use_begin(),
UE=phiUser->use_end(); UI != UE; ++UI) UE=phiUser->use_end(); UI != UE; ++UI)
if (const PHINode* pn = dyn_cast<PHINode>(*UI)) if (const PHINode* pn = dyn_cast<PHINode>(*UI))
{ {
if (phisSeen.find(pn) == phisSeen.end()) if (phisSeen.find(pn) == phisSeen.end())
{ {
phiUsers.push(pn); phiUsers.push_back(pn);
phisSeen.insert(pn); phisSeen.insert(pn);
} }
} }