File: MulAddUGens.cpp

package info (click to toggle)
supercollider 1%3A3.10.0%2Brepack-1
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 45,496 kB
  • sloc: cpp: 283,513; lisp: 74,040; ansic: 72,252; sh: 23,016; python: 7,175; makefile: 1,087; perl: 766; java: 677; yacc: 314; lex: 175; ruby: 136; objc: 65; xml: 15
file content (716 lines) | stat: -rw-r--r-- 15,701 bytes parent folder | download
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
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
/*
	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_PlugIn.hpp"
#include "SIMD_Unit.hpp"

static InterfaceTable *ft;

namespace {

struct MulAdd:
	SIMD_Unit
{
	ControlRateInput<1> mMul;
	ControlRateInput<2> mAdd;

#define MULADD_CALCFUNC(METHOD_NAME)				\
	do {											\
		set_unrolled_calc_function<MulAdd, 			\
				&MulAdd::METHOD_NAME<unrolled_64>,	\
				&MulAdd::METHOD_NAME<unrolled>,		\
				&MulAdd::METHOD_NAME<scalar> >();	\
		return;										\
	} while (0)

	MulAdd(void)
	{
		mMul.init(this);
		mAdd.init(this);

		if (mCalcRate != calc_FullRate) {
			set_calc_function<MulAdd, &MulAdd::next_scalar>();
			return;
		}

		assert(inRate(0) == calc_FullRate);

		switch (inRate(1)) {
		case calc_FullRate:
			switch (inRate(2)) {
			case calc_FullRate:
				MULADD_CALCFUNC(next_aa);

			case calc_BufRate:
				MULADD_CALCFUNC(next_ak);

			case calc_ScalarRate:
				if (mAdd == 0.f)
					MULADD_CALCFUNC(next_a0);
				else
					MULADD_CALCFUNC(next_ai);

			default:
				assert(false);
			}

		case calc_BufRate:
			switch (inRate(2)) {
			case calc_FullRate:
				MULADD_CALCFUNC(next_ka);

			case calc_BufRate:
				MULADD_CALCFUNC(next_kk);

			case calc_ScalarRate:
				if (mAdd == 0.f)
					MULADD_CALCFUNC(next_k0);
				else
					MULADD_CALCFUNC(next_ki);

			default:
				assert(false);
			}

		case calc_ScalarRate:
			switch (inRate(2)) {
			case calc_FullRate:
				if (mMul == 1.0)
					MULADD_CALCFUNC(next_1a);
				else if (mMul == 0.f)
					MULADD_CALCFUNC(next_0a);
				else
					MULADD_CALCFUNC(next_ia);

			case calc_BufRate:
				if (mMul == 1.0)
					MULADD_CALCFUNC(next_1k);
				else if (mMul == 0.f)
					MULADD_CALCFUNC(next_0k);
				else
					MULADD_CALCFUNC(next_ik);

			case calc_ScalarRate:
				if (mMul == 1.0) {
					if (mAdd == 0)
						MULADD_CALCFUNC(next_10);
					else
						MULADD_CALCFUNC(next_1i);
				}

				else if (mMul == 0.f) {
					if (mAdd == 0.f)
						MULADD_CALCFUNC(next_00);
					else
						MULADD_CALCFUNC(next_0i);
				}
				else {
					if (mAdd == 0.f)
						MULADD_CALCFUNC(next_i0);
					else
						MULADD_CALCFUNC(next_ii);
				}

			default:
				assert(false);
			}

		default:
			assert(false);
		}
	}

	inline bool mulChanged(void) const
	{
		return mMul.changed(this);
	}

	inline bool addChanged(void) const
	{
		return mAdd.changed(this);
	}

#if __cplusplus <= 199711L
	nova::detail::scalar_ramp_argument<float> mulSlope(void)
#else
	decltype(nova::slope_argument(0.f, 0.f)) mulSlope(void)
#endif
	{
		return mMul.slope(this);
	}

#if __cplusplus <= 199711L
	nova::detail::scalar_ramp_argument<float> addSlope(void)
#else
	decltype(nova::slope_argument(0.f, 0.f)) addSlope(void)
#endif
	{
		return mAdd.slope(this);
	}

	void next_scalar(int inNumSamples)
	{
		out0(0) = (in0(0) * in0(1)) + in0(2);
	}

	template <int SIMD>
	void next_aa(int inNumSamples)
	{
		muladd<SIMD>(out(0), in(0), in(1), in(2), inNumSamples);
	}

	template <int SIMD>
	void next_ak(int inNumSamples)
	{
		if (addChanged())
			muladd<SIMD>(out(0), in(0), in(1), addSlope(), inNumSamples);
		else {
			if (mAdd == 0.f)
				times_vec<SIMD>(out(0), in(0), in(1), inNumSamples);
			else
				next_ai<SIMD>(inNumSamples);
		}
	}

	template <int SIMD>
	void next_ai(int inNumSamples)
	{
		muladd<SIMD>(out(0), in(0), in(1), mAdd, inNumSamples);
	}

	template <int SIMD>
	void next_ka(int inNumSamples)
	{
		if (mulChanged())
			muladd<SIMD>(out(0), in(0), mulSlope(), in(2), inNumSamples);
		else
			next_ia<SIMD>(inNumSamples);
	}

	template <int SIMD>
	void next_kk(int inNumSamples)
	{
		if (addChanged()) {
			if (mulChanged())
				muladd<SIMD>(out(0), in(0), mulSlope(), addSlope(), inNumSamples);
			else {
				if (mMul == 0)
					slope_vec<SIMD>(out(0), addSlope(), inNumSamples);
				else if (mMul == 1.f)
					plus_vec<SIMD>(out(0), in(0), addSlope(), inNumSamples);
				else
					muladd<SIMD>(out(0), in(0), mMul, addSlope(), inNumSamples);
			}
		} else
			next_ki<SIMD>(inNumSamples);
	}

	template <int SIMD>
	void next_ki(int inNumSamples)
	{
		if (mulChanged())
			muladd<SIMD>(out(0), in(0), mulSlope(), mAdd, inNumSamples);
		else
			next_ii<SIMD>(inNumSamples);
	}

	template <int SIMD>
	void next_ia(int inNumSamples)
	{
		if (mMul == 0)
			next_0a<SIMD>(inNumSamples);
		else if (mMul == 1.0)
			next_1a<SIMD>(inNumSamples);
		else
			muladd<SIMD>(out(0), in(0), mMul, in(2), inNumSamples);
	}

	template <int SIMD>
	void next_ik(int inNumSamples)
	{
		if (addChanged()) {
			if (mMul == 0.f)
				slope_vec<SIMD>(out(0), addSlope(), inNumSamples);
			else if (mMul == 1.f)
				plus_vec<SIMD>(out(0), in(0), addSlope(), inNumSamples);
			else
				muladd<SIMD>(out(0), in(0), mMul, addSlope(), inNumSamples);
		} else
			next_ii<SIMD>(inNumSamples);
	}

	template <int SIMD>
	void next_ii(int inNumSamples)
	{
		if (mMul == 0)
			next_0i<SIMD>(inNumSamples);
		else if (mMul == 1.f) {
			next_1i<SIMD>(inNumSamples);
		} else {
			if (mAdd == 0)
				times_vec<SIMD>(out(0), in(0), mMul, inNumSamples);
			else
				muladd<SIMD>(out(0), in(0), mMul, mAdd, inNumSamples);
		}
	}

	template <int SIMD>
	void next_1a(int inNumSamples)
	{
		plus_vec<SIMD>(out(0), in(0), in(2), inNumSamples);
	}

	template <int SIMD>
	void next_1k(int inNumSamples)
	{
		if (addChanged())
			plus_vec<SIMD>(out(0), in(0), addSlope(), inNumSamples);
		else
			next_1i<SIMD>(inNumSamples);
	}

	template <int SIMD>
	void next_1i(int inNumSamples)
	{
		if (mAdd == 0)
			copy_vec<SIMD>(out(0), in(0), inNumSamples);
		else
			plus_vec<SIMD>(out(0), in(0), mAdd, inNumSamples);
	}

	template <int SIMD>
	void next_0a(int inNumSamples)
	{
		copy_vec<SIMD>(out(0), in(2), inNumSamples);
	}

	template <int SIMD>
	void next_0k(int inNumSamples)
	{
		if (addChanged())
			slope_vec<SIMD>(out(0), addSlope(), inNumSamples);
		else
			next_0i<SIMD>(inNumSamples);
	}

	template <int SIMD>
	void next_0i(int inNumSamples)
	{
		set_vec<SIMD>(out(0), mAdd, inNumSamples);
	}

	template <int SIMD>
	void next_a0(int inNumSamples)
	{
		times_vec<SIMD>(out(0), in(0), in(1), inNumSamples);
	}

	template <int SIMD>
	void next_k0(int inNumSamples)
	{
		if (mulChanged())
			times_vec<SIMD>(out(0), in(0), mulSlope(), inNumSamples);
		else
			next_ik<SIMD>(inNumSamples);
	}

	template <int SIMD>
	void next_i0(int inNumSamples)
	{
		if (mMul == 0.f)
			next_00<SIMD>(inNumSamples);
		else if (mMul == 1.f)
			next_10<SIMD>(inNumSamples);
		else
			times_vec<SIMD>(out(0), in(0), mMul, inNumSamples);
	}

	template <int SIMD>
	void next_10(int inNumSamples)
	{
		copy_vec<SIMD>(out(0), in(0), inNumSamples);
	}

	template <int SIMD>
	void next_00(int inNumSamples)
	{
		set_vec<SIMD>(out(0), 0.f, inNumSamples);
	}
};

struct Sum3:
	SIMD_Unit
{
	ControlRateInput<1> in1;
	ControlRateInput<2> in2;

	Sum3(void)
	{
		in1.init(this);
		in2.init(this);

		if (mCalcRate != calc_FullRate) {
			set_calc_function<Sum3, &Sum3::next_scalar>();
			return;
		}

		assert(inRate(0) == calc_FullRate);

		switch (inRate(1)) {
		case calc_FullRate:
			switch (inRate(2)) {
			case calc_FullRate:
				set_vector_calc_function<Sum3, &Sum3::next_aaa<true>, &Sum3::next_aaa<false> >();
				return;

			case calc_BufRate:
				set_vector_calc_function<Sum3, &Sum3::next_aak<true>, &Sum3::next_aak<false> >();
				return;

			case calc_ScalarRate:
				set_vector_calc_function<Sum3, &Sum3::next_aai<true>, &Sum3::next_aai<false> >();
				return;

			default:
				assert(false);
			}

		case calc_BufRate:
			switch (inRate(2)) {
				case calc_BufRate:
					set_vector_calc_function<Sum3, &Sum3::next_akk<true>, &Sum3::next_akk<false> >();
					return;

				case calc_ScalarRate:
					set_vector_calc_function<Sum3, &Sum3::next_aki<true>, &Sum3::next_aki<false> >();
					return;

				default:
					assert(false);
			}

		case calc_ScalarRate:
			assert (inRate(2) == calc_ScalarRate);
			set_vector_calc_function<Sum3, &Sum3::next_aii<true>, &Sum3::next_aii<false> >();
			return;

		default:
			assert(false);
		}
	}

	template <bool SIMD, typename Arg1, typename Arg2, typename Arg3>
	static void sum_vec(float * out, Arg1 const & arg1, Arg2 const & arg2, Arg3 const & arg3, int inNumSamples)
	{
		if (SIMD)
			nova::sum_vec_simd(out, arg1, arg2, arg3, inNumSamples);
		else
			nova::sum_vec(out, arg1, arg2, arg3, inNumSamples);
	}

	void next_scalar(int inNumSamples)
	{
		out0(0) = in0(0) + in0(1) + in0(2);
	}

	template <bool SIMD>
	void next_aaa(int inNumSamples)
	{
		sum_vec<SIMD>(out(0), in(0), in(1), in(2), inNumSamples);
	}

	template <bool SIMD>
	void next_aak(int inNumSamples)
	{
		if (in2.changed(this))
			sum_vec<SIMD>(out(0), in(0), in(1), in2.slope(this), inNumSamples);
		else
			next_aai<SIMD>(inNumSamples);
	}

	template <bool SIMD>
	void next_aai(int inNumSamples)
	{
		sum_vec<SIMD>(out(0), in(0), in(1), in2, inNumSamples);
	}

	template <bool SIMD>
	void next_aki(int inNumSamples)
	{
		if (in1.changed(this))
			sum_vec<SIMD>(out(0), in(0), in1.slope(this), in2, inNumSamples);
		else
			next_aii<SIMD>(inNumSamples);
	}

	template <bool SIMD>
	void next_akk(int inNumSamples)
	{
		if (in2.changed(this)) {
			if (in1.changed(this))
				sum_vec<SIMD>(out(0), in(0), in1.slope(this), in2.slope(this), inNumSamples);
			else
				sum_vec<SIMD>(out(0), in(0), in1, in2.slope(this), inNumSamples);
		} else
			next_aki<SIMD>(inNumSamples);
	}

	template <bool SIMD>
	void next_aii(int inNumSamples)
	{
		sum_vec<SIMD>(out(0), in(0), in0(1), in0(2), inNumSamples);
	}
};

struct Sum4:
	SIMD_Unit
{
	ControlRateInput<1> in1;
	ControlRateInput<2> in2;
	ControlRateInput<3> in3;

	Sum4(void)
	{
		in1.init(this);
		in2.init(this);
		in3.init(this);

		if (mCalcRate != calc_FullRate) {
			set_calc_function<Sum4, &Sum4::next_scalar>();
			return;
		}

		assert(inRate(0) == calc_FullRate);

		switch (inRate(1)) {
		case calc_FullRate:
			switch (inRate(2)) {
			case calc_FullRate:
				switch (inRate(3)) {
				case calc_FullRate:
					set_vector_calc_function<Sum4, &Sum4::next_aaaa<true>, &Sum4::next_aaaa<false> >();
					return;

				case calc_BufRate:
					set_vector_calc_function<Sum4, &Sum4::next_aaak<true>, &Sum4::next_aaak<false> >();
					return;

				case calc_ScalarRate:
					set_vector_calc_function<Sum4, &Sum4::next_aaai<true>, &Sum4::next_aaai<false> >();
					return;

				default:
					assert(false);
				}

			case calc_BufRate:
				switch (inRate(3)) {
				case calc_BufRate:
					set_vector_calc_function<Sum4, &Sum4::next_aakk<true>, &Sum4::next_aakk<false> >();
					return;

				case calc_ScalarRate:
					set_vector_calc_function<Sum4, &Sum4::next_aaki<true>, &Sum4::next_aaki<false> >();
					return;

				default:
					assert(false);
				}

			case calc_ScalarRate:
				switch (inRate(3)) {
				case calc_ScalarRate:
					set_vector_calc_function<Sum4, &Sum4::next_aaii<true>, &Sum4::next_aaii<false> >();
					return;

				default:
					assert(false);
				}
			}
		case calc_BufRate:
			switch (inRate(2)) {
			case calc_BufRate:
				switch (inRate(3)) {
				case calc_BufRate:
					set_vector_calc_function<Sum4, &Sum4::next_akkk<true>, &Sum4::next_akkk<false> >();
					return;

				case calc_ScalarRate:
					set_vector_calc_function<Sum4, &Sum4::next_akki<true>, &Sum4::next_akki<false> >();
					return;

				default:
					assert(false);
				}

			case calc_ScalarRate:
				switch (inRate(3)) {
				case calc_ScalarRate:
					set_vector_calc_function<Sum4, &Sum4::next_akii<true>, &Sum4::next_akii<false> >();
					return;

				default:
					assert(false);
				}
			}

		case calc_ScalarRate:
			switch (inRate(2)) {
			case calc_ScalarRate:
				switch (inRate(3)) {
				case calc_ScalarRate:
					set_vector_calc_function<Sum4, &Sum4::next_aiii<true>, &Sum4::next_aiii<false> >();
					return;

				default:
					assert(false);
				}

			default:
				assert(false);
			}

		default:
			assert(false);
		}
	}

	void next_scalar(int inNumSamples)
	{
		out0(0) = in0(0) + in0(1) + in0(2) + in0(3);
	}

	template <bool SIMD, typename Arg1, typename Arg2, typename Arg3, typename Arg4>
	static void sum_vec(float * out, Arg1 const & arg1, Arg2 const & arg2, Arg3 const & arg3, Arg4 const & arg4, int inNumSamples)
	{
		if (SIMD)
			nova::sum_vec_simd(out, arg1, arg2, arg3, arg4, inNumSamples);
		else
			nova::sum_vec(out, arg1, arg2, arg3, arg4, inNumSamples);
	}

	template <bool SIMD>
	void next_aaaa(int inNumSamples)
	{
		sum_vec<SIMD>(out(0), in(0), in(1), in(2), in(3), inNumSamples);
	}

	template <bool SIMD>
	void next_aaak(int inNumSamples)
	{
		if (in3.changed(this))
			sum_vec<SIMD>(out(0), in(0), in(1), in(2), in3.slope(this), inNumSamples);
		else
			next_aaai<SIMD>(inNumSamples);
	}

	template <bool SIMD>
	void next_aaai(int inNumSamples)
	{
		sum_vec<SIMD>(out(0), in(0), in(1), in(2), in3, inNumSamples);
	}

	template <bool SIMD>
	void next_aakk(int inNumSamples)
	{
		if (in3.changed(this)) {
			if (in2.changed(this))
				sum_vec<SIMD>(out(0), in(0), in(1), in2.slope(this), in3.slope(this), inNumSamples);
			else
				sum_vec<SIMD>(out(0), in(0), in(1), in2, in3.slope(this), inNumSamples);
		} else
			next_aaki<SIMD>(inNumSamples);
	}

	template <bool SIMD>
	void next_aaki(int inNumSamples)
	{
		if (in2.changed(this))
			sum_vec<SIMD>(out(0), in(0), in(1), in2.slope(this), in3, inNumSamples);
		else
			next_aaii<SIMD>(inNumSamples);
	}

	template <bool SIMD>
	void next_aaii(int inNumSamples)
	{
		sum_vec<SIMD>(out(0), in(0), in(1), in2, in3, inNumSamples);
	}

	template <bool SIMD>
	void next_akkk(int inNumSamples)
	{
		if (in3.changed(this)) {
			if (in2.changed(this)) {
				if (in1.changed(this))
					sum_vec<SIMD>(out(0), in(0), in1.slope(this), in2.slope(this), in3.slope(this), inNumSamples);
				else
					sum_vec<SIMD>(out(0), in(0), in1, in2.slope(this), in3.slope(this), inNumSamples);
			} else {
				if (in1.changed(this))
					sum_vec<SIMD>(out(0), in(0), in1.slope(this), in2, in3.slope(this), inNumSamples);
				else
					sum_vec<SIMD>(out(0), in(0), in1, in2, in3.slope(this), inNumSamples);
			}
		} else
			next_akki<SIMD>(inNumSamples);
	}

	template <bool SIMD>
	void next_akki(int inNumSamples)
	{
		if (in2.changed(this)) {
			if (in1.changed(this))
				sum_vec<SIMD>(out(0), in(0), in1.slope(this), in2.slope(this), in3, inNumSamples);
			else
				sum_vec<SIMD>(out(0), in(0), in1, in2.slope(this), in3, inNumSamples);
		} else
			next_akii<SIMD>(inNumSamples);
	}

	template <bool SIMD>
	void next_akii(int inNumSamples)
	{
		if (in1.changed(this))
			sum_vec<SIMD>(out(0), in(0), in1.slope(this), in2, in3, inNumSamples);
		else
			next_aiii<SIMD>(inNumSamples);
	}

	template <bool SIMD>
	void next_aiii(int inNumSamples)
	{
		sum_vec<SIMD>(out(0), in(0), in1, in2, in3, inNumSamples);
	}
};

}

////////////////////////////////////////////////////////////////////////////////////////////////////////

PluginLoad(MulAdd)
{
	ft = inTable;

	registerUnit<MulAdd>(ft, "MulAdd" );
	registerUnit<Sum3>(ft,   "Sum3"   );
	registerUnit<Sum4>(ft,   "Sum4"   );
}