RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-01-21 03:37:47 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Symbol hygiene: Make sure declarations and definitions match, make helper functions static.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@166376 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Benjamin Kramer 2012-10-20 12:53:26 +00:00
parent 2a13242b20
commit 63a4c24616
4 changed files with 8 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
include/llvm-c/Transforms/Vectorize.h
View File

@ -36,6 +36,9 @@ extern "C" {
/** See llvm::createBBVectorizePass function. */
void LLVMAddBBVectorizePass(LLVMPassManagerRef PM);
/** See llvm::createLoopVectorizePass function. */
void LLVMAddLoopVectorizePass(LLVMPassManagerRef PM);
/**
* @}
*/

2
lib/CodeGen/MachineFunctionPrinterPass.cpp
View File

@ -51,7 +51,7 @@ struct MachineFunctionPrinterPass : public MachineFunctionPass {
char MachineFunctionPrinterPass::ID = 0;
}
char &MachineFunctionPrinterPassID = MachineFunctionPrinterPass::ID;
char &llvm::MachineFunctionPrinterPassID = MachineFunctionPrinterPass::ID;
INITIALIZE_PASS(MachineFunctionPrinterPass, "print-machineinstrs",
"Machine Function Printer", false, false)

2
lib/CodeGen/SelectionDAG/ScheduleDAGFast.cpp
View File

@ -635,6 +635,7 @@ void ScheduleDAGFast::ListScheduleBottomUp() {
}
namespace {
//===----------------------------------------------------------------------===//
// ScheduleDAGLinearize - No scheduling scheduler, it simply linearize the
// DAG in topological order.
@ -654,6 +655,7 @@ private:
void ScheduleNode(SDNode *N);
};
} // end anonymous namespace
void ScheduleDAGLinearize::ScheduleNode(SDNode *N) {
if (N->getNodeId() != 0)

4
lib/MC/SubtargetFeature.cpp
View File

@ -119,8 +119,8 @@ void SubtargetFeatures::AddFeature(const StringRef String,
}
/// Find KV in array using binary search.
const SubtargetFeatureKV *Find(const StringRef S, const SubtargetFeatureKV *A,
size_t L) {
static const SubtargetFeatureKV *Find(StringRef S, const SubtargetFeatureKV *A,
size_t L) {
// Make the lower bound element we're looking for
SubtargetFeatureKV KV;
KV.Key = S.data();