1 /************************************************************************
2 ************************************************************************
3 FAUST compiler
4 Copyright (C) 2003-2018 GRAME, Centre National de Creation Musicale
5 ---------------------------------------------------------------------
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
10
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
19 ************************************************************************
20 ************************************************************************/
21
22 #include <iostream>
23
24 #include "exception.hh"
25 #include "parSchema.h"
26
27 using namespace std;
28
makeParSchema(schema * s1,schema * s2)29 schema* makeParSchema(schema* s1, schema* s2)
30 {
31 // make sure s1 and s2 have same width
32 return new parSchema(makeEnlargedSchema(s1, s2->width()), makeEnlargedSchema(s2, s1->width()));
33 }
34
parSchema(schema * s1,schema * s2)35 parSchema::parSchema(schema* s1, schema* s2)
36 : schema(s1->inputs() + s2->inputs(), s1->outputs() + s2->outputs(), s1->width(), s1->height() + s2->height()),
37 fSchema1(s1),
38 fSchema2(s2),
39 fInputFrontier(s1->inputs()),
40 fOutputFrontier(s1->outputs())
41 {
42 faustassert(s1->width() == s2->width());
43 }
44
place(double ox,double oy,int orientation)45 void parSchema::place(double ox, double oy, int orientation)
46 {
47 beginPlace(ox, oy, orientation);
48
49 if (orientation == kLeftRight) {
50 fSchema1->place(ox, oy, orientation);
51 fSchema2->place(ox, oy + fSchema1->height(), orientation);
52 } else {
53 fSchema2->place(ox, oy, orientation);
54 fSchema1->place(ox, oy + fSchema2->height(), orientation);
55 }
56
57 endPlace();
58 }
59
inputPoint(unsigned int i) const60 point parSchema::inputPoint(unsigned int i) const
61 {
62 return (i < fInputFrontier) ? fSchema1->inputPoint(i) : fSchema2->inputPoint(i - fInputFrontier);
63 }
64
outputPoint(unsigned int i) const65 point parSchema::outputPoint(unsigned int i) const
66 {
67 return (i < fOutputFrontier) ? fSchema1->outputPoint(i) : fSchema2->outputPoint(i - fOutputFrontier);
68 }
69
draw(device & dev)70 void parSchema::draw(device& dev)
71 {
72 fSchema1->draw(dev);
73 fSchema2->draw(dev);
74 }
75
collectTraits(collector & c)76 void parSchema::collectTraits(collector& c)
77 {
78 fSchema1->collectTraits(c);
79 fSchema2->collectTraits(c);
80 }
81