6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-04-11 16:37:42 +00:00
Code Issues Projects Releases Wiki Activity

Add #include <cstdlib> and abort() to silence a warning

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@15413 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Misha Brukman 2004-08-02 14:02:21 +00:00
parent 82fd8d8cdd
commit 6a90f8202b
2 changed files with 12 additions and 10 deletions
lib
CodeGen/ModuloScheduling
MSchedGraph.cpp
Target/SparcV9/ModuloScheduling
MSchedGraph.cpp

11
lib/CodeGen/ModuloScheduling/MSchedGraph.cpp

@ -1,4 +1,4 @@
//===-- MSchedGraph.cpp - Scheduling Graph ------------------------*- C++ -*-===//
//===-- MSchedGraph.cpp - Scheduling Graph ----------------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
@ -17,6 +17,7 @@
#include "llvm/CodeGen/MachineBasicBlock.h"
#include "llvm/Target/TargetInstrInfo.h"
#include "Support/Debug.h"
#include <cstdlib>
using namespace llvm;
MSchedGraphNode::MSchedGraphNode(const MachineInstr* inst,
@ -35,13 +36,13 @@ void MSchedGraphNode::print(std::ostream &os) const {
MSchedGraphEdge MSchedGraphNode::getInEdge(MSchedGraphNode *pred) {
//Loop over all the successors of our predecessor
//return the edge the corresponds to this in edge
for(MSchedGraphNode::succ_iterator I = pred->succ_begin(), E = pred->succ_end();
I != E; ++I) {
if(*I == this)
for (MSchedGraphNode::succ_iterator I = pred->succ_begin(),
E = pred->succ_end(); I != E; ++I) {
if (*I == this)
return I.getEdge();
}
assert(0 && "Should have found edge between this node and its predecessor!");
abort();
}
unsigned MSchedGraphNode::getInEdgeNum(MSchedGraphNode *pred) {

11
lib/Target/SparcV9/ModuloScheduling/MSchedGraph.cpp

@ -1,4 +1,4 @@
//===-- MSchedGraph.cpp - Scheduling Graph ------------------------*- C++ -*-===//
//===-- MSchedGraph.cpp - Scheduling Graph ----------------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
@ -17,6 +17,7 @@
#include "llvm/CodeGen/MachineBasicBlock.h"
#include "llvm/Target/TargetInstrInfo.h"
#include "Support/Debug.h"
#include <cstdlib>
using namespace llvm;
MSchedGraphNode::MSchedGraphNode(const MachineInstr* inst,
@ -35,13 +36,13 @@ void MSchedGraphNode::print(std::ostream &os) const {
MSchedGraphEdge MSchedGraphNode::getInEdge(MSchedGraphNode *pred) {
//Loop over all the successors of our predecessor
//return the edge the corresponds to this in edge
for(MSchedGraphNode::succ_iterator I = pred->succ_begin(), E = pred->succ_end();
I != E; ++I) {
if(*I == this)
for (MSchedGraphNode::succ_iterator I = pred->succ_begin(),
E = pred->succ_end(); I != E; ++I) {
if (*I == this)
return I.getEdge();
}
assert(0 && "Should have found edge between this node and its predecessor!");
abort();
}
unsigned MSchedGraphNode::getInEdgeNum(MSchedGraphNode *pred) {