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

Use alloca instead of a C99 style array. This should fix the

Browse Source 
compilation problem in windows.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@16535 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Alkis Evlogimenos
2004-09-28 02:47:38 +00:00
parent 200a360ec6
commit 0ee6e2a6da
1 changed files with 6 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
lib/Target/TargetSchedInfo.cpp
View File

@@ -14,6 +14,7 @@
#include "llvm/Target/TargetSchedInfo.h" #include "llvm/Target/TargetSchedInfo.h"
#include "llvm/Target/TargetMachine.h" #include "llvm/Target/TargetMachine.h"
#include <algorithm>
#include <iostream> #include <iostream>
using namespace llvm; using namespace llvm;
@@ -175,12 +176,13 @@ TargetSchedInfo::computeIssueGaps(const std::vector<InstrRUsage>&
// resources usages for each class, because most instruction pairs will // resources usages for each class, because most instruction pairs will
// usually behave the same as their class. // usually behave the same as their class.
// //
int classPairGaps[numSchedClasses][numSchedClasses]; int* classPairGaps =
static_cast<int*>(alloca(sizeof(int) * numSchedClasses * numSchedClasses));
for (InstrSchedClass fromSC=0; fromSC < numSchedClasses; fromSC++) for (InstrSchedClass fromSC=0; fromSC < numSchedClasses; fromSC++)
for (InstrSchedClass toSC=0; toSC < numSchedClasses; toSC++) { for (InstrSchedClass toSC=0; toSC < numSchedClasses; toSC++) {
int classPairGap = ComputeMinGap(instrRUForClasses[fromSC], int classPairGap = ComputeMinGap(instrRUForClasses[fromSC],
instrRUForClasses[toSC]); instrRUForClasses[toSC]);
classPairGaps[fromSC][toSC] = classPairGap; classPairGaps[fromSC*numSchedClasses + toSC] = classPairGap;
} }
// Now, for each pair of instructions, use the class pair gap if both // Now, for each pair of instructions, use the class pair gap if both
@@ -193,7 +195,7 @@ TargetSchedInfo::computeIssueGaps(const std::vector<InstrRUsage>&
for (MachineOpCode toOp=0; toOp < numOpCodes; toOp++) { for (MachineOpCode toOp=0; toOp < numOpCodes; toOp++) {
int instrPairGap = int instrPairGap =
(instrRUsages[fromOp].sameAsClass && instrRUsages[toOp].sameAsClass) (instrRUsages[fromOp].sameAsClass && instrRUsages[toOp].sameAsClass)
? classPairGaps[getSchedClass(fromOp)][getSchedClass(toOp)] ? classPairGaps[getSchedClass(fromOp)*numSchedClasses + getSchedClass(toOp)]
: ComputeMinGap(instrRUsages[fromOp], instrRUsages[toOp]); : ComputeMinGap(instrRUsages[fromOp], instrRUsages[toOp]);
if (instrPairGap > 0) { if (instrPairGap > 0) {
@@ -228,7 +230,7 @@ void InstrRUsage::setTo(const InstrClassRUsage& classRU) {
// Sort each resource usage vector by resourceId_t to speed up conflict // Sort each resource usage vector by resourceId_t to speed up conflict
// checking // checking
for (unsigned i=0; i < this->resourcesByCycle.size(); i++) for (unsigned i=0; i < this->resourcesByCycle.size(); i++)
sort(resourcesByCycle[i].begin(), resourcesByCycle[i].end()); std::sort(resourcesByCycle[i].begin(), resourcesByCycle[i].end());
} }
// Add the extra resource usage requirements specified in the delta. // Add the extra resource usage requirements specified in the delta.