-
Notifications
You must be signed in to change notification settings - Fork 745
/
SC_Graph.cpp
642 lines (572 loc) · 17.2 KB
/
SC_Graph.cpp
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
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
/*
SuperCollider real time audio synthesis system
Copyright (c) 2002 James McCartney. All rights reserved.
http://www.audiosynth.com
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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "SC_Graph.h"
#include "SC_GraphDef.h"
#include "SC_Unit.h"
#include "SC_UnitSpec.h"
#include "SC_UnitDef.h"
#include "SC_HiddenWorld.h"
#include "SC_Wire.h"
#include "SC_WireSpec.h"
#include <stdio.h>
#include <string.h>
#include "SC_Prototypes.h"
#include "SC_Errors.h"
#include "Unroll.h"
void Unit_ChooseMulAddFunc(Unit* unit);
////////////////////////////////////////////////////////////////////////////////
void Graph_FirstCalc(Graph *inGraph);
void Graph_Dtor(Graph *inGraph)
{
//scprintf("->Graph_Dtor %d\n", inGraph->mNode.mID);
World *world = inGraph->mNode.mWorld;
int numUnits = inGraph->mNumUnits;
Unit** graphUnits = inGraph->mUnits;
if (inGraph->mNode.mCalcFunc != (NodeCalcFunc)Graph_FirstCalc) {
// the above test insures that dtors are not called if ctors have not been called.
for (int i = 0; i<numUnits; ++i) {
Unit *unit = graphUnits[i];
UnitDtorFunc dtor = unit->mUnitDef->mUnitDtorFunc;
if (dtor) (dtor)(unit);
}
}
world->mNumUnits -= numUnits;
world->mNumGraphs --;
GraphDef* def = GRAPHDEF(inGraph);
if (--def->mRefCount <= 0) {
if (world->mRealTime) GraphDef_DeleteMsg(world, def);
else GraphDef_Free(def);
}
Node_Dtor(&inGraph->mNode);
//scprintf("<-Graph_Dtor\n");
}
////////////////////////////////////////////////////////////////////////////////
int Graph_New(struct World *inWorld, struct GraphDef *inGraphDef, int32 inID,
struct sc_msg_iter* args, Graph** outGraph,bool argtype)//true for normal args , false for setn type args
{
Graph* graph;
int err = Node_New(inWorld, &inGraphDef->mNodeDef, inID, (Node**)&graph);
if (err) return err;
Graph_Ctor(inWorld, inGraphDef, graph, args,argtype);
*outGraph = graph;
return err;
}
void Graph_Ctor(World *inWorld, GraphDef *inGraphDef, Graph *graph, sc_msg_iter *msg,bool argtype)//true for normal args , false for setn type args
{
//scprintf("->Graph_Ctor\n");
// hit the memory allocator only once.
char *memory = (char*)graph + sizeof(Graph);
// allocate space for children
int numUnits = inGraphDef->mNumUnitSpecs;
graph->mNumUnits = numUnits;
inWorld->mNumUnits += numUnits;
inWorld->mNumGraphs ++;
graph->mUnits = (Unit**)memory;
memory += inGraphDef->mUnitsAllocSize;
// set calc func
graph->mNode.mCalcFunc = (NodeCalcFunc)&Graph_FirstCalc;
// allocate wires
graph->mNumWires = inGraphDef->mNumWires;
graph->mWire = (Wire*)memory;
memory += inGraphDef->mWiresAllocSize;
graph->mNumCalcUnits = inGraphDef->mNumCalcUnits;
graph->mCalcUnits = (Unit**)memory;
memory += inGraphDef->mCalcUnitsAllocSize;
// initialize controls
int numControls = inGraphDef->mNumControls;
graph->mNumControls = numControls;
graph->mControls = (float*)memory;
memory += inGraphDef->mControlAllocSize;
graph->mMapControls = (float**)memory;
memory += inGraphDef->mMapControlsAllocSize;
graph->mControlRates = (int*)memory;
memory += inGraphDef->mMapControlRatesAllocSize;
{
float* graphControls = graph->mControls;
float* initialControlValues = inGraphDef->mInitialControlValues;
float** graphMapControls = graph->mMapControls;
/* add */
int* graphControlRates = graph->mControlRates;
for (int i=0; i<numControls; ++i, ++graphControls) {
*graphControls = initialControlValues[i];
graphMapControls[i] = graphControls;
/* add */
graphControlRates[i] = 0; // init to 0 for now... control bus is 1, audio is 2
}
}
// set controls
//if argtype == true -> normal args as always
//if argtype == false -> setn type args
if(argtype) {
while( msg->remain()>=8) {
int i = 0;
int loop = 0;
if (msg->nextTag('i') == 's') {
int32* name = msg->gets4();
int32 hash = Hash(name);
do {
switch (msg->nextTag('f') ) {
case 'f' :
case 'i' :
{
float32 value = msg->getf();
Graph_SetControl(graph, hash, name, i, value);
break;
}
case 's' :
{
const char* string = msg->gets();
if ( *string == 'c') {
int bus = sc_atoi(string+1);
Graph_MapControl(graph, hash, name, i, bus);
} else {
if (*string == 'a') {
int bus = sc_atoi(string+1);
Graph_MapAudioControl(graph, hash, name, i, bus);
}
}
break;
}
case ']':
msg->count++;
loop -= 1;
break;
case '[':
msg->count++;
loop += 1;
i -= 1;
break;
}
++i;
}
while (loop);
} else {
int32 index = msg->geti();
do {
switch (msg->nextTag('f') ) {
case 'f' :
case 'i' :
{
float32 value = msg->getf();
Graph_SetControl(graph, index + i, value);
break;
}
case 's' :
{
const char* string = msg->gets();
if ( *string == 'c') {
int bus = sc_atoi(string+1);
Graph_MapControl(graph, index + i, bus);
} else {
if (*string == 'a') {
int bus = sc_atoi(string+1);
Graph_MapAudioControl(graph, index + i, bus);
}
}
break;
}
case ']':
msg->count++;
loop -= 1;
break;
case '[':
msg->count++;
loop += 1;
i -= 1;
break;
}
++i;
}
while (loop);
}
}
}
//{
// while( msg->remain()>=8) {
// int i = 0;
// int loop = 0;
// if (msg->nextTag('i') == 's') {
// int32* name = msg->gets4();
// int32 hash = Hash(name);
// if (msg->nextTag('f') == '[' ) {
// msg->count++;
// loop = 1;
// }
// do {
// if (msg->nextTag('f') == 's' ) {
// const char* string = msg->gets();
// if ( *string == 'c') {
// int bus = sc_atoi(string+1);
// Graph_MapControl(graph, hash, name, i, bus);
// }
// } else {
// if (msg->nextTag('f') == ']' ) {
// msg->count++;
// loop = 0;
// } else {
// float32 value = msg->getf();
// Graph_SetControl(graph, hash, name, i, value);
// }
// }
// ++i;
// }
// while (loop);
// } else {
// int32 index = msg->geti();
// if (msg->nextTag('f') == '[' ) {
// msg->count++;
// loop = 1;
// }
// do {
// if (msg->nextTag('f') == 's') {
// const char* string = msg->gets();
// if (*string == 'c') {
// int bus = sc_atoi(string+1);
// Graph_MapControl(graph, index + i, bus);
// }
// } else {
// if (msg->nextTag('f') == ']' ) {
// msg->count++;
// loop = 0;
// } else {
// float32 value = msg->getf();
// Graph_SetControl(graph, index + i, value);
// }
// }
// ++i;
// }
// while (loop);
// }
// }
//
// }
else{
while (msg->remain()) {
if (msg->nextTag('i') == 's') {
int32* name = msg->gets4();
int32 hash = Hash(name);
int32 n = msg->geti();
for (int i=0; msg->remain() && i<n; ++i) {
if (msg->nextTag('f') == 's') {
const char* string = msg->gets();
if (*string == 'c') {
int bus = sc_atoi(string+1);
Graph_MapControl(graph, hash, name, i, bus);
//Node_MapControl(node, hash, name, i, bus);
} else {
if (*string == 'a') {
int bus = sc_atoi(string+1);
Graph_MapAudioControl(graph, hash, name, i, bus);
}
}
} else {
float32 value = msg->getf();
Graph_SetControl(graph, hash, name, i, value);
//Node_SetControl(node, hash, name, i, value);
}
}
} else {
int32 index = msg->geti();
int32 n = msg->geti();
for (int i=0; msg->remain() && i<n; ++i) {
if (msg->nextTag('f') == 's') {
const char* string = msg->gets();
if (*string == 'c') {
int bus = sc_atoi(string+1);
Graph_MapControl(graph, index+i, bus);
//Node_MapControl(node, index+i, bus);
} else {
if (*string == 'a') {
int bus = sc_atoi(string+1);
Graph_MapAudioControl(graph, index + i, bus);
}
}
} else {
float32 value = msg->getf();
Graph_SetControl(graph, index+i, value);
//Node_SetControl(node, index+i, value);
}
}
}
}
}
// set up scalar values
Wire *graphWires = graph->mWire;
int numConstants = inGraphDef->mNumConstants;
{
float *constants = inGraphDef->mConstants;
Wire *wire = graphWires;
for (int i=0; i<numConstants; ++i, ++wire) {
wire->mFromUnit = 0;
wire->mCalcRate = calc_ScalarRate;
wire->mBuffer = &wire->mScalarValue;
wire->mScalarValue = constants[i];
}
}
graph->mSampleOffset = inWorld->mSampleOffset;
graph->mSubsampleOffset = inWorld->mSubsampleOffset;
graph->mRGen = inWorld->mRGen; // defaults to rgen zero.
graph->mLocalAudioBusUnit = NULL;
graph->mLocalControlBusUnit = NULL;
graph->localBufNum = 0;
graph->localMaxBufNum = 0; // this is set from synth
// initialize units
//scprintf("initialize units\n");
Unit** calcUnits = graph->mCalcUnits;
Unit** graphUnits = graph->mUnits;
int calcCtr=0;
float *bufspace = inWorld->hw->mWireBufSpace;
int wireCtr = numConstants;
UnitSpec *unitSpec = inGraphDef->mUnitSpecs;
for (int i=0; i<numUnits; ++i, ++unitSpec) {
// construct unit from spec
Unit *unit = Unit_New(inWorld, unitSpec, memory);
// set parent
unit->mParent = graph;
unit->mParentIndex = i;
graphUnits[i] = unit;
{
// hook up unit inputs
//scprintf("hook up unit inputs\n");
InputSpec *inputSpec = unitSpec->mInputSpec;
Wire** unitInput = unit->mInput;
float** unitInBuf = unit->mInBuf;
int numInputs = unitSpec->mNumInputs;
for (int j=0; j<numInputs; ++j, ++inputSpec) {
Wire *wire = graphWires + inputSpec->mWireIndex;
unitInput[j] = wire;
unitInBuf[j] = wire->mBuffer;
}
}
{
// hook up unit outputs
//scprintf("hook up unit outputs\n");
Wire** unitOutput = unit->mOutput;
float** unitOutBuf = unit->mOutBuf;
int numOutputs = unitSpec->mNumOutputs;
Wire *wire = graphWires + wireCtr;
wireCtr += numOutputs;
int unitCalcRate = unit->mCalcRate;
if (unitCalcRate == calc_FullRate) {
OutputSpec *outputSpec = unitSpec->mOutputSpec;
for (int j=0; j<numOutputs; ++j, ++wire, ++outputSpec) {
wire->mFromUnit = unit;
wire->mCalcRate = calc_FullRate;
wire->mBuffer = bufspace + outputSpec->mBufferIndex;
unitOutput[j] = wire;
unitOutBuf[j] = wire->mBuffer;
}
calcUnits[calcCtr++] = unit;
} else {
for (int j=0; j<numOutputs; ++j, ++wire) {
wire->mFromUnit = unit;
wire->mCalcRate = unitCalcRate;
wire->mBuffer = &wire->mScalarValue;
unitOutput[j] = wire;
unitOutBuf[j] = wire->mBuffer;
}
if (unitCalcRate == calc_BufRate) {
calcUnits[calcCtr++] = unit;
}
}
}
}
inGraphDef->mRefCount ++ ;
}
void Graph_RemoveID(World* inWorld, Graph *inGraph)
{
if (!World_RemoveNode(inWorld, &inGraph->mNode)) {
int err = kSCErr_Failed; // shouldn't happen..
throw err;
}
HiddenWorld* hw = inWorld->hw;
int id = hw->mHiddenID = (hw->mHiddenID - 8) | 0x80000000;
inGraph->mNode.mID = id;
inGraph->mNode.mHash = Hash(id);
if (!World_AddNode(inWorld, &inGraph->mNode)) {
scprintf("mysterious failure in Graph_RemoveID\n");
Node_Delete(&inGraph->mNode);
// enums are uncatchable. must throw an int.
int err = kSCErr_Failed; // shouldn't happen..
throw err;
}
//inWorld->hw->mRecentID = id;
}
void Graph_FirstCalc(Graph *inGraph)
{
//scprintf("->Graph_FirstCalc\n");
int numUnits = inGraph->mNumUnits;
Unit **units = inGraph->mUnits;
for (int i=0; i<numUnits; ++i) {
Unit *unit = units[i];
// call constructor
(*unit->mUnitDef->mUnitCtorFunc)(unit);
}
//scprintf("<-Graph_FirstCalc\n");
inGraph->mNode.mCalcFunc = (NodeCalcFunc)&Graph_Calc;
// now do actual graph calculation
Graph_Calc(inGraph);
}
void Node_NullCalc(struct Node* /*inNode*/);
void Graph_NullFirstCalc(Graph *inGraph)
{
//scprintf("->Graph_FirstCalc\n");
int numUnits = inGraph->mNumUnits;
Unit **units = inGraph->mUnits;
for (int i=0; i<numUnits; ++i) {
Unit *unit = units[i];
// call constructor
(*unit->mUnitDef->mUnitCtorFunc)(unit);
}
//scprintf("<-Graph_FirstCalc\n");
inGraph->mNode.mCalcFunc = &Node_NullCalc;
}
inline void Graph_Calc_unit(Unit * unit)
{
(unit->mCalcFunc)(unit, unit->mBufLength);
}
void Graph_Calc(Graph *inGraph)
{
//scprintf("->Graph_Calc\n");
int numCalcUnits = inGraph->mNumCalcUnits;
Unit **calcUnits = inGraph->mCalcUnits;
int unroll8 = numCalcUnits / 8;
int remain8 = numCalcUnits % 8;
int i = 0;
for (int j = 0; j!=unroll8; i += 8, ++j) {
Graph_Calc_unit(calcUnits[i]);
Graph_Calc_unit(calcUnits[i+1]);
Graph_Calc_unit(calcUnits[i+2]);
Graph_Calc_unit(calcUnits[i+3]);
Graph_Calc_unit(calcUnits[i+4]);
Graph_Calc_unit(calcUnits[i+5]);
Graph_Calc_unit(calcUnits[i+6]);
Graph_Calc_unit(calcUnits[i+7]);
}
int unroll4 = remain8 / 4;
int remain4 = remain8 % 4;
if (unroll4) {
Graph_Calc_unit(calcUnits[i]);
Graph_Calc_unit(calcUnits[i+1]);
Graph_Calc_unit(calcUnits[i+2]);
Graph_Calc_unit(calcUnits[i+3]);
i+=4;
}
int unroll2 = remain4 / 2;
int remain2 = remain4 % 2;
if (unroll2) {
Graph_Calc_unit(calcUnits[i]);
Graph_Calc_unit(calcUnits[i+1]);
i += 2;
}
if (remain2)
Graph_Calc_unit(calcUnits[i]);
//scprintf("<-Graph_Calc\n");
}
void Graph_CalcTrace(Graph *inGraph);
void Graph_CalcTrace(Graph *inGraph)
{
int numCalcUnits = inGraph->mNumCalcUnits;
Unit **calcUnits = inGraph->mCalcUnits;
scprintf("\nTRACE %d %s #units: %d\n", inGraph->mNode.mID, inGraph->mNode.mDef->mName, numCalcUnits);
for (int i=0; i<numCalcUnits; ++i) {
Unit *unit = calcUnits[i];
scprintf(" unit %d %s\n in ", i, (char*)unit->mUnitDef->mUnitDefName);
for (int j=0; j<unit->mNumInputs; ++j) {
scprintf(" %g", ZIN0(j));
}
scprintf("\n");
(unit->mCalcFunc)(unit, unit->mBufLength);
scprintf(" out");
for (int j=0; j<unit->mNumOutputs; ++j) {
scprintf(" %g", ZOUT0(j));
}
scprintf("\n");
}
inGraph->mNode.mCalcFunc = (NodeCalcFunc)&Graph_Calc;
}
void Graph_Trace(Graph *inGraph)
{
if (inGraph->mNode.mCalcFunc == (NodeCalcFunc)&Graph_Calc) {
inGraph->mNode.mCalcFunc = (NodeCalcFunc)&Graph_CalcTrace;
}
}
int Graph_GetControl(Graph* inGraph, uint32 inIndex, float& outValue)
{
if (inIndex >= GRAPHDEF(inGraph)->mNumControls) return kSCErr_IndexOutOfRange;
outValue = inGraph->mControls[inIndex];
return kSCErr_None;
}
int Graph_GetControl(Graph* inGraph, int32 inHash, int32 *inName, uint32 inIndex, float& outValue)
{
ParamSpecTable* table = GRAPH_PARAM_TABLE(inGraph);
ParamSpec *spec = table->Get(inHash, inName);
if (!spec) return kSCErr_IndexOutOfRange;
return Graph_GetControl(inGraph, spec->mIndex + inIndex, outValue);
}
void Graph_SetControl(Graph* inGraph, uint32 inIndex, float inValue)
{
if (inIndex >= GRAPHDEF(inGraph)->mNumControls) return;
inGraph->mControlRates[inIndex] = 0;
float *ptr = inGraph->mControls + inIndex;
inGraph->mMapControls[inIndex] = ptr; // unmap the control
*ptr = inValue;
}
void Graph_SetControl(Graph* inGraph, int32 inHash, int32 *inName, uint32 inIndex, float inValue)
{
ParamSpecTable* table = GRAPH_PARAM_TABLE(inGraph);
ParamSpec *spec = table->Get(inHash, inName);
if (spec) Graph_SetControl(inGraph, spec->mIndex + inIndex, inValue);
}
void Graph_MapControl(Graph* inGraph, int32 inHash, int32 *inName, uint32 inIndex, uint32 inBus)
{
ParamSpecTable* table = GRAPH_PARAM_TABLE(inGraph);
ParamSpec *spec = table->Get(inHash, inName);
if (spec) Graph_MapControl(inGraph, spec->mIndex + inIndex, inBus);
}
void Graph_MapControl(Graph* inGraph, uint32 inIndex, uint32 inBus)
{
if (inIndex >= GRAPHDEF(inGraph)->mNumControls) return;
World *world = inGraph->mNode.mWorld;
if (inBus >= 0x80000000) {
inGraph->mControlRates[inIndex] = 0;
inGraph->mMapControls[inIndex] = inGraph->mControls + inIndex;
} else if (inBus < world->mNumControlBusChannels) {
inGraph->mControlRates[inIndex] = 1;
inGraph->mMapControls[inIndex] = world->mControlBus + inBus;
}
}
void Graph_MapAudioControl(Graph* inGraph, int32 inHash, int32 *inName, uint32 inIndex, uint32 inBus)
{
ParamSpecTable* table = GRAPH_PARAM_TABLE(inGraph);
ParamSpec *spec = table->Get(inHash, inName);
if (spec) Graph_MapAudioControl(inGraph, spec->mIndex + inIndex, inBus);
}
void Graph_MapAudioControl(Graph* inGraph, uint32 inIndex, uint32 inBus)
{
if (inIndex >= GRAPHDEF(inGraph)->mNumControls) return;
World *world = inGraph->mNode.mWorld;
// inGraph->mControlRates[inIndex] = 2;
/* what is the below doing??? it is unmapping by looking for negative ints */
if (inBus >= 0x80000000) {
inGraph->mControlRates[inIndex] = 0;
inGraph->mMapControls[inIndex] = inGraph->mControls + inIndex;
} else if (inBus < world->mNumAudioBusChannels) {
inGraph->mControlRates[inIndex] = 2;
inGraph->mMapControls[inIndex] = world->mAudioBus + (inBus * world->mBufLength);
}
}