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

llvm-svn: 166376
This commit is contained in:
Benjamin Kramer 2012-10-20 12:53:26 +00:00
parent 7ddd70527c
commit a74129adad
4 changed files with 8 additions and 3 deletions

View File

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

View File

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

View File

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

View File

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