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

fix 80 column violations

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@27084 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2006-03-24 21:52:20 +00:00
parent ac53eadc29
commit 947604b0e2
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
utils/TableGen/DAGISelEmitter.cpp
View File

@ -1138,7 +1138,7 @@ static bool HandleUse(TreePattern *I, TreePatternNode *Pat,
void DAGISelEmitter::
FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
std::map<std::string, TreePatternNode*> &InstInputs,
std::map<std::string, TreePatternNode*> &InstResults,
std::map<std::string, TreePatternNode*>&InstResults,
std::vector<Record*> &InstImpInputs,
std::vector<Record*> &InstImpResults) {
if (Pat->isLeaf()) {
@ -2220,7 +2220,8 @@ public:
/// EmitResultCode - Emit the action for a pattern. Now that it has matched
/// we actually have to build a DAG!
std::pair<unsigned, unsigned>
EmitResultCode(TreePatternNode *N, bool LikeLeaf = false, bool isRoot = false) {
EmitResultCode(TreePatternNode *N, bool LikeLeaf = false,
bool isRoot = false) {
// This is something selected from the pattern we matched.
if (!N->getName().empty()) {
std::string &Val = VariableMap[N->getName()];
@ -3056,8 +3057,8 @@ void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
}
// Print all declarations.
for (std::set<std::pair<bool, std::string> >::iterator I = GeneratedDecl.begin(),
E = GeneratedDecl.end(); I != E; ++I)
for (std::set<std::pair<bool, std::string> >::iterator
I = GeneratedDecl.begin(), E = GeneratedDecl.end(); I != E; ++I)
if (I->first)
OS << " SDNode *" << I->second << ";\n";
else
@ -3226,7 +3227,7 @@ void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) {
<< " }\n"
<< " return;\n"
<< " }\n"
<< " case ISD::INLINEASM: Select_INLINEASM(Result, N); return;\n";
<< " case ISD::INLINEASM: Select_INLINEASM(Result, N); return;\n";
// Loop over all of the case statements, emiting a call to each method we