/usr/include/CLAM/SMSTransformationChain.hxx is in libclam-dev 1.4.0-6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 | /*
* Copyright (c) 2001-2004 MUSIC TECHNOLOGY GROUP (MTG)
* UNIVERSITAT POMPEU FABRA
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#ifndef _SMSTransformationChain_
#define _SMSTransformationChain_
#include "SegmentTransformation.hxx"
#include "SMSTransformationChainConfig.hxx"
#include "ProcessingComposite.hxx"
#include "ProcessingData.hxx"
#include "InPort.hxx"
#include "OutPort.hxx"
#include "InControlArray.hxx"
#include "ProcessingFactory.hxx"
#include "Array.hxx"
#include "FrameTransformation.hxx"
namespace CLAM {
/** Using Segment as the type for * input and output ports.
* It implements the supervised Do and a helper method for
* updating the frame counter in the Segment.
*/
class SMSTransformationChain: public ProcessingComposite
{
InControlArray mOnCtrlArray;
/** Temporal ProcessingData used as an internal node for intermediate Processing */
Array<Segment*> mpTmpDataArray;
/** Internal configuration. A pointer is used because polymorphism may be used on it */
SMSTransformationChainConfig* mpConfig;
Segment* mpChainInput;
Segment* mpChainOutput;
public:
void AttachIn(Segment& data) { mpChainInput = &data; }
void AttachOut(Segment& data) { mpChainOutput = &data; }
SMSTransformationChain() :
mpChainInput(0),
mpChainOutput(0)
{
mpConfig=NULL;
}
/** Destructor. Deletes temporal ProcessingData and Configuration and any previously
* allocated Processing chainee.
*/
virtual ~SMSTransformationChain(){
for(int i=0;i<mpTmpDataArray.Size();i++)
if(mpTmpDataArray[i]) delete mpTmpDataArray[i];
if (mpConfig) delete mpConfig;
for(iterator obj=composite_begin();obj!=composite_end();obj++)
{
delete (*obj);
}
}
virtual bool DoChildren()
{
CLAM_DEBUG_ASSERT(IsRunning(),
"SMSTransformationChain: Do(): Not in execution mode");
bool result=true;
int i=0;
//We iterate through all chainees and call their Do()
for (iterator obj=composite_begin(); obj!=composite_end(); obj++,i++)
{
Processing & proc = *(*obj);
SegmentTransformation& trans = dynamic_cast<SegmentTransformation&>(proc);
//TODO have a list instead of being a composite
if(mOnCtrlArray[i].GetLastValue()||i==0||i==int(composite_size())-1)
//Note: First and last chainee's will always be active regartheless the value
//of their On control.
{
CLAM_DEBUG_ASSERT(proc.IsRunning(), "child is not running" );
result &= trans.DoWithSegments();
}
}
return result;
}
bool Do()
{
if(IsLastFrame())
{
printf("TransChain::Do() is last frame\n");
return false;
}
NextFrame();
return DoChildren();
}
bool ConcreteStart()
{
void InitSegmentArray();
Segment* pCurrentData;
pCurrentData=new Segment(*mpChainInput);
mpTmpDataArray.AddElem(pCurrentData);
// set up connections: inSegment<--trans-->outSegment
iterator obj;
for(obj=composite_begin();obj!=composite_end();obj++)
{
//connecting ports for non-supervised mode
Processing & processing = *(*(obj));
SegmentTransformation&concreteObj = dynamic_cast<SegmentTransformation&>(processing);
concreteObj.AttachIn(*pCurrentData);
if(!(*obj)->CanProcessInplace())
{
printf("Can't process inplace: setting a temporal segment\n");
pCurrentData=new Segment(*mpChainInput);
mpTmpDataArray.AddElem(pCurrentData);
}
concreteObj.AttachOut(*pCurrentData);
}
// now we have to restore the inSegment of the first child
obj=composite_begin();
SegmentTransformation& concreteObj = dynamic_cast<SegmentTransformation&>( *(*(obj)) );
concreteObj.AttachIn(*mpChainInput);
obj=composite_end();
obj--;
SegmentTransformation& concreteObj2 = dynamic_cast<SegmentTransformation&>( *(*(obj)) );
concreteObj2.AttachOut( *mpChainOutput);
InitAllFrameIndex();
return ProcessingComposite::ConcreteStart();
}
void InitSegmentArray()
{
for(int i=0;i<mpTmpDataArray.Size();i++)
if(mpTmpDataArray[i])
delete mpTmpDataArray[i];
mpTmpDataArray.SetSize(0);
}
void InitAllFrameIndex()
{
for(int i=0;i<mpTmpDataArray.Size();i++)
mpTmpDataArray[i]->mCurrentFrameIndex=0;
mpChainInput->mCurrentFrameIndex=0;
}
/** Accessor to On/off control. Turns on the specified control in the array.*/
void TurnOn(TIndex index)
{
mOnCtrlArray[index].DoControl(1);
}
/** Accessor to On/off control. Turns on the specified control in the array.*/
void TurnOff(TIndex index)
{
mOnCtrlArray[index].DoControl(0);
}
const ProcessingConfig& GetConfig() const
{
return *mpConfig;
}
bool ConcreteConfigure(const ProcessingConfig& c)
{
mpConfig=new SMSTransformationChainConfig(dynamic_cast<const SMSTransformationChainConfig&>(c));
bool result=true;
iterator obj;
/** First we remove existing chainee if any*/
obj=composite_begin();
while(obj!=composite_end())
{
Remove(*(*obj));
obj=composite_begin();
}
SMSTransformationChainConfig::iterator cfg;
for(cfg=mpConfig->ConfigList_begin();cfg!=mpConfig->ConfigList_end();cfg++)
{
AddChainee((*cfg).GetConcreteClassName());
obj=composite_end();
obj--;
result&=(*obj)->Configure((*cfg).GetConcreteConfig());
}
CLAM_ASSERT(mpConfig->GetConfigurations().size()==composite_size(),"Number of configurations should be the same as number of children");
//TODO: right now there is no way to add or remove controls than to instantiate control array again
CLAM_ASSERT(mpConfig->GetOnArray().Size()==(int)composite_size(),"SMSTransformationChain::ConcreteConfigure: On array does not have same size as number of configurations");
TSize nControls=composite_size();
mOnCtrlArray.Resize(nControls,"OnControlArray",this);
for(int i=0;i<nControls;i++)
{
mOnCtrlArray[i].DoControl(mpConfig->GetOnArray()[i]);
}
return result;
}
/** Returns first transformation in chain belonging to a given class
* or NULL if not found
* */
SegmentTransformation* GetTransformation(const std::string& name)
{
for(iterator obj=composite_begin(); obj!=composite_end(); obj++)
{
if(name == (*obj)->GetClassName()) return dynamic_cast<SegmentTransformation*>((*obj));;
}
return NULL;
}
private:
void AddChainee(const std::string& classname)
{
//TODO: Instead of connecting controls, use the publishing mechanism
//TODO2: If all amount controls were named the same I might be able to get rid of the string comparison
ProcessingFactory & theFactory = ProcessingFactory::GetInstance();
SegmentTransformation* wrapper = new SegmentTransformation;
Processing * proc = theFactory.Create(classname);
struct Supported
{
const char * name;
const char * control;
} supported[] = {
{"SMSFreqShift", "Shift Steps"},
{"SMSSinusoidalGain", "Gain"},
{"SMSResidualGain", "Gain"},
{"SMSPitchShift", "PitchSteps"},
{"SMSOddEvenHarmonicRatio", "Odd Factor"},
{"SMSSpectralShapeShift", "Shift Steps"},
{"SMSPitchDiscretization", 0},
{"SMSGenderChange", "Amount"},
{"SMSSineFilter", 0},
{0,0}
};
for (Supported * processing = supported; processing->name; processing ++)
{
if (classname != processing->name) continue;
FrameTransformation * transformation = dynamic_cast<FrameTransformation*> (proc);
wrapper->WrapFrameTransformation(transformation);
if (processing->control)
wrapper->mAmountCtrl.PublishInControl((FloatInControl&)proc->GetInControl(processing->control));
Insert( *wrapper );
return;
}
delete wrapper;
Insert( *proc );
}
/** Helper method for updating frame counters both in ports and in internal data*/
void NextFrame()
{
mpChainInput->mCurrentFrameIndex++;
}
/** Returns true if current frame pointer at input port is pointing past the last
* frame in the segment
*/
bool IsLastFrame()
{
for(iterator obj=composite_begin(); obj!=composite_end(); obj++)
{
SegmentTransformation* transf =dynamic_cast<SegmentTransformation*>((*obj));
if(!transf->IsLastFrame()) return false;
}
return true;
}
};
} // namespace CLAM
#endif // _SMSTransformationChain_
|