interpretor/faust-0.9.47mr3/compiler/draw/schema/mergeSchema.cpp

   1 /************************************************************************
   2  ************************************************************************
   3     FAUST compiler
   4         Copyright (C) 2003-2004 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
  23 #include "mergeSchema.h"
  24 #include <iostream>
  25 #include <assert.h>
  26
  27 using namespace std;
  28
  29
  30 /**
  31  * Creates a new merge schema. Cables are enlarged to dWire.
  32  * The horizontal gap between the two subschema is such that
  33  * the connections are not too slopy.
  34  */
  35 schema* makeMergeSchema (schema* s1, schema* s2)
  36 {
  37         // avoid ugly diagram by ensuring at least dWire width
  38         schema * a = makeEnlargedSchema(s1, dWire);
  39         schema * b = makeEnlargedSchema(s2, dWire);
  40         double  hgap = (a->height()+b->height())/4;
  41         return new mergeSchema(a,b,hgap);
  42 }
  43
  44
  45 /**
  46  * Constructor for a merge schema s1 :> s2 where the outputs
  47  * of s1 are merged to the inputs of s2. The constructor is
  48  * private in order to enforce the usage of makeMergeSchema
  49  */
  50 mergeSchema::mergeSchema (schema* s1, schema* s2, double hgap)
  51         :       schema( s1->inputs(),
  52                                 s2->outputs(),
  53                                 s1->width() + s2->width() + hgap,
  54                                 max(s1->height(), s2->height()) ),
  55                 fSchema1(s1),
  56                 fSchema2(s2),
  57                 fHorzGap(hgap)
  58 {
  59 }
  60
  61
  62 /**
  63  * Places the two subschema horizontaly, centered, with enough gap for
  64  * the connections
  65  */
  66 void mergeSchema::place(double ox, double oy, int orientation)
  67 {
  68         beginPlace(ox, oy, orientation);
  69
  70         double dy1 = max(0.0, fSchema2->height()-fSchema1->height()) / 2.0;
  71         double dy2 = max(0.0, fSchema1->height()-fSchema2->height()) / 2.0;
  72
  73         if (orientation == kLeftRight) {
  74                 fSchema1->place(ox, oy+dy1, orientation);
  75                 fSchema2->place(ox+fSchema1->width()+fHorzGap, oy+dy2, orientation);
  76         } else {
  77                 fSchema2->place(ox, oy+dy2, orientation);
  78                 fSchema1->place(ox+fSchema2->width()+fHorzGap, oy+dy1, orientation);
  79         }
  80         endPlace();
  81 }
  82
  83
  84 /**
  85  * The inputs of s1 :> s2 are the inputs of s1
  86  */
  87 point mergeSchema::inputPoint(unsigned int i) const
  88 {
  89         return fSchema1->inputPoint(i);
  90 }
  91
  92
  93 /**
  94  * The outputs of s1 :> s2 are the outputs of s2
  95  */
  96 point mergeSchema::outputPoint(unsigned int i) const
  97 {
  98         return fSchema2->outputPoint(i);
  99 }
 100
 101
 102 /**
 103  * Draw the two sub schema and the connections between them
 104  */
 105 void mergeSchema::draw(device& dev)
 106 {
 107     assert(placed());
 108
 109     // draw the two subdiagrams
 110     fSchema1->draw(dev);
 111     fSchema2->draw(dev);
 112
 113 #if 0
 114     unsigned int r = fSchema2->inputs();
 115     assert(r>0);
 116
 117     // draw the connections between them
 118     for (unsigned int i=0; i<fSchema1->outputs(); i++) {
 119         point p = fSchema1->outputPoint(i);
 120         point q = fSchema2->inputPoint(i%r);
 121         dev.trait(p.x, p.y, q.x, q.y);
 122     }
 123 #endif
 124 }
 125
 126
 127 /**
 128  * Draw the two sub schema and the connections between them
 129  */
 130 void mergeSchema::collectTraits(collector& c)
 131 {
 132     assert(placed());
 133
 134     // draw the two subdiagrams
 135     fSchema1->collectTraits(c);
 136     fSchema2->collectTraits(c);
 137
 138     unsigned int r = fSchema2->inputs();
 139     assert(r>0);
 140
 141     // draw the connections between them
 142     for (unsigned int i=0; i<fSchema1->outputs(); i++) {
 143         point p = fSchema1->outputPoint(i);
 144         point q = fSchema2->inputPoint(i%r);
 145         c.addTrait(trait(p,q));
 146     }
 147 }
 148
 149