1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274
|
/************************************************************************
************************************************************************
FAUST compiler
Copyright (C) 2003-2018 GRAME, Centre National de Creation Musicale
---------------------------------------------------------------------
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
************************************************************************
************************************************************************/
#include "vec_code_container.hh"
#include "exception.hh"
#include "fir_code_checker.hh"
#include "fir_to_fir.hh"
#include "global.hh"
using namespace std;
void VectorCodeContainer::moveStack2Struct()
{
// Transform stack variables in struct variables
VariableMover::Move(this, "tmp");
VariableMover::Move(this, "Zec");
VariableMover::Move(this, "Yec");
VariableMover::Move(this, "Rec");
// Remove marked variables from fComputeBlockInstructions
RemoverCloneVisitor remover;
fComputeBlockInstructions = static_cast<BlockInst*>(fComputeBlockInstructions->clone(&remover));
}
void VectorCodeContainer::generateLocalInputs(BlockInst* loop_code, const string& index)
{
// Generates line like: FAUSTFLOAT* input0 = &input0_ptr[index];
Typed* type = IB::genArrayTyped(IB::genFloatMacroTyped(), 0);
for (int i = 0; i < inputs(); i++) {
string name1 = subst("input$0", T(i));
string name2 = subst("input$0_ptr", T(i));
loop_code->pushBackInst(IB::genDecStackVar(
name1, type, IB::genLoadArrayStackVarAddress(name2, IB::genLoadLoopVar(index))));
}
}
void VectorCodeContainer::generateLocalOutputs(BlockInst* loop_code, const string& index)
{
// Generates line like: FAUSTFLOAT* ouput0 = &output0_ptr[index];
Typed* type = IB::genArrayTyped(IB::genFloatMacroTyped(), 0);
for (int i = 0; i < outputs(); i++) {
string name1 = subst("output$0", T(i));
string name2 = subst("output$0_ptr", T(i));
loop_code->pushBackInst(IB::genDecStackVar(
name1, type, IB::genLoadArrayStackVarAddress(name2, IB::genLoadLoopVar(index))));
}
}
BlockInst* VectorCodeContainer::generateDAGLoopVariant0(const string& counter)
{
string index = "vindex";
string size = "vsize";
// Define result block
BlockInst* block_res = IB::genBlockInst();
// Declare the "index" variable outside the loop
DeclareVarInst* index_dec =
IB::genDecLoopVar(index, IB::genInt32Typed(), IB::genInt32NumInst(0));
block_res->pushBackInst(index_dec);
block_res->pushBackInst(IB::genLabelInst("/* Main loop */"));
BlockInst* loop_code = IB::genBlockInst();
// Generate local input/output access
generateLocalInputs(loop_code, index);
generateLocalOutputs(loop_code, index);
// Generate : int count = 32;
DeclareVarInst* size_dec =
IB::genDecLoopVar(size, IB::genInt32Typed(), IB::genInt32NumInst(gGlobal->gVecSize));
loop_code->pushBackInst(size_dec);
// Debug code
/*
loop_code->pushBackInst(IB::genLabelInst("std::cout << vsize << std::endl;"));
loop_code->pushBackInst(IB::genLabelInst("std::cout << fullcount << std::endl;"));
loop_code->pushBackInst(IB::genLabelInst("std::cout << vindex << std::endl;"));
*/
// Generates the loop DAG
generateDAGLoop(loop_code, size_dec->load());
// Generates the DAG enclosing loop
StoreVarInst* loop_init = index_dec->store(IB::genInt32NumInst(0));
ValueInst* loop_end = IB::genLessEqual(
index_dec->load(), IB::genSub(IB::genLoadFunArgsVar(counter), gGlobal->gVecSize));
StoreVarInst* loop_increment =
index_dec->store(IB::genAdd(index_dec->load(), gGlobal->gVecSize));
StatementInst* loop = IB::genForLoopInst(loop_init, loop_end, loop_increment, loop_code, true);
// Put loop in block_res
block_res->pushBackInst(loop);
// Remaining frames
block_res->pushBackInst(IB::genLabelInst("/* Remaining frames */"));
ValueInst* if_cond = IB::genLessThan(index_dec->load(), IB::genLoadFunArgsVar(counter));
BlockInst* then_block = IB::genBlockInst();
// Generate local input/output access
generateLocalInputs(then_block, index);
generateLocalOutputs(then_block, index);
// Generate : int count = fullcount-index;
DeclareVarInst* size_dec1 = IB::genDecLoopVar(
size, IB::genInt32Typed(), IB::genSub(IB::genLoadFunArgsVar(counter), index_dec->load()));
then_block->pushBackInst(size_dec1);
// Debug code
/*
then_block->pushBackInst(IB::genLabelInst("std::cout << vsize << std::endl;"));
then_block->pushBackInst(IB::genLabelInst("std::cout << fullcount << std::endl;"));
then_block->pushBackInst(IB::genLabelInst("std::cout << vindex << std::endl;"));
*/
// Generates the loop DAG
generateDAGLoop(then_block, size_dec1->load());
block_res->pushBackInst(IB::genIfInst(if_cond, then_block));
return block_res;
}
BlockInst* VectorCodeContainer::generateDAGLoopVariant1(const string& counter)
{
string index = "vindex";
string size = "vsize";
BlockInst* loop_code = IB::genBlockInst();
// Generates the DAG enclosing loop
DeclareVarInst* loop_dec =
IB::genDecLoopVar(index, IB::genInt32Typed(), IB::genInt32NumInst(0));
// Generate local input/output access
generateLocalInputs(loop_code, index);
generateLocalOutputs(loop_code, index);
// Generate : int count = min(32, (fullcount - index))
ValueInst* init1 = IB::genLoadFunArgsVar(counter);
ValueInst* init2 = IB::genSub(init1, loop_dec->load());
Values min_fun_args;
min_fun_args.push_back(IB::genInt32NumInst(gGlobal->gVecSize));
min_fun_args.push_back(init2);
ValueInst* init3 = IB::genFunCallInst("min_i", min_fun_args);
DeclareVarInst* size_dec = IB::genDecLoopVar(size, IB::genInt32Typed(), init3);
loop_code->pushBackInst(size_dec);
// Debug code
/*
loop_code->pushBackInst(IB::genLabelInst("std::cout << vsize << std::endl;"));
loop_code->pushBackInst(IB::genLabelInst("std::cout << fullcount << std::endl;"));
loop_code->pushBackInst(IB::genLabelInst("std::cout << vindex << std::endl;"));
*/
// Generates the loop DAG
generateDAGLoop(loop_code, size_dec->load());
ValueInst* loop_end = IB::genLessThan(loop_dec->load(), IB::genLoadFunArgsVar(counter));
StoreVarInst* loop_increment = loop_dec->store(IB::genAdd(loop_dec->load(), gGlobal->gVecSize));
StatementInst* loop = IB::genForLoopInst(loop_dec, loop_end, loop_increment, loop_code, true);
BlockInst* res_block = IB::genBlockInst();
res_block->pushBackInst(loop);
return res_block;
}
BlockInst* VectorCodeContainer::generateDAGLoopVariant2(const string& counter)
{
BlockInst* res_block = IB::genBlockInst();
string index = "vindex";
res_block->pushBackInst(
IB::genDecStackVar("vindex", IB::genInt32Typed(), IB::genInt32NumInst(0)));
// Generate local input/output access
generateLocalInputs(res_block, index);
generateLocalOutputs(res_block, index);
// Generates the loop DAG
generateDAGLoop(res_block, IB::genInt32NumInst(gGlobal->gVecSize));
return res_block;
}
void VectorCodeContainer::processFIR(void)
{
// Default FIR to FIR transformations
CodeContainer::processFIR();
// If stack variables take too much room, move them in struct
// dump2FIR(fComputeBlockInstructions);
VariableSizeCounter counter(Address::kStack);
generateComputeBlock(&counter);
/*
Possibly remove LoadVarAddress. The remover has to be shared between
fComputeBlockInstructions and fDAGBlock, so a *unique* one is defined here.
*/
VarAddressRemover remover;
if (gGlobal->gRemoveVarAddress) {
fComputeBlockInstructions = remover.getCode(fComputeBlockInstructions);
}
if (counter.fSizeBytes > gGlobal->gMachineMaxStackSize) {
// Transform stack array variables in struct variables
moveStack2Struct();
} else {
// Sort arrays to be at the beginning
// fComputeBlockInstructions->fCode.sort(sortArrayDeclarations);
}
if (gGlobal->gVectorLoopVariant == 0) {
fDAGBlock = generateDAGLoopVariant0(fFullCount);
} else if (gGlobal->gVectorLoopVariant == 1) {
fDAGBlock = generateDAGLoopVariant1(fFullCount);
} else if (gGlobal->gVectorLoopVariant == 2) {
fDAGBlock = generateDAGLoopVariant2(fFullCount);
} else {
faustassert(false);
}
// Possibly remove LoadVarAddress
if (gGlobal->gRemoveVarAddress) {
fDAGBlock = remover.getCode(fDAGBlock);
}
// Rewrite "Rec/Vec" indexes in iZone/fZone access
if (gGlobal->gMemoryManager >= 1) {
fDAGBlock = gGlobal->gIntZone->getCode(fDAGBlock);
fDAGBlock = gGlobal->gRealZone->getCode(fDAGBlock);
}
// Verify code
/*
Still not working for Array variables access
FIRCodeChecker verifier;
BlockInst* global_block = flattenFIR();
global_block->accept(&verifier);
if (verifier.fError) {
throw faustexception("Incorrect FIR code\n");
}
*/
}
BlockInst* VectorCodeContainer::flattenFIR(void)
{
BlockInst* global_block = CodeContainer::flattenFIR();
global_block->pushBackInst(fDAGBlock);
return global_block;
}
|