libs/ardour/chan_mapping.cc

   1 /*
   2     Copyright (C) 2009 Paul Davis
   3     Author: David Robillard
   4
   5     This program is free software; you can redistribute it and/or modify
   6     it under the terms of the GNU General Public License as published by
   7     the Free Software Foundation; either version 2 of the License, or
   8     (at your option) any later version.
   9
  10     This program is distributed in the hope that it will be useful,
  11     but WITHOUT ANY WARRANTY; without even the implied warranty of
  12     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13     GNU General Public License for more details.
  14
  15     You should have received a copy of the GNU General Public License
  16     along with this program; if not, write to the Free Software
  17     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  18
  19     $Id: insert.cc 712 2006-07-28 01:08:57Z drobilla $
  20 */
  21
  22 #include <stdint.h>
  23 #include <iostream>
  24 #include "ardour/chan_mapping.h"
  25
  26 using namespace std;
  27
  28 namespace ARDOUR {
  29
  30 ChanMapping::ChanMapping(ChanCount identity)
  31 {
  32         if (identity == ChanCount::INFINITE) {
  33                 return;
  34         }
  35
  36         for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
  37                 for (size_t i = 0; i < identity.get(*t); ++i) {
  38                         set(*t, i, i);
  39                 }
  40         }
  41 }
  42
  43 uint32_t
  44 ChanMapping::get(DataType t, uint32_t from)
  45 {
  46         Mappings::iterator tm = _mappings.find(t);
  47         assert(tm != _mappings.end());
  48         TypeMapping::iterator m = tm->second.find(from);
  49         assert(m != tm->second.end());
  50         return m->second;
  51 }
  52
  53 void
  54 ChanMapping::set(DataType t, uint32_t from, uint32_t to)
  55 {
  56         assert(t != DataType::NIL);
  57         Mappings::iterator tm = _mappings.find(t);
  58         if (tm == _mappings.end()) {
  59                 tm = _mappings.insert(std::make_pair(t, TypeMapping())).first;
  60         }
  61         tm->second.insert(std::make_pair(from, to));
  62 }
  63
  64 /** Offset the 'from' field of every mapping for type @a t by @a delta */
  65 void
  66 ChanMapping::offset_from(DataType t, int32_t delta)
  67 {
  68         Mappings::iterator tm = _mappings.find(t);
  69         if (tm != _mappings.end()) {
  70                 TypeMapping new_map;
  71                 for (TypeMapping::iterator m = tm->second.begin(); m != tm->second.end(); ++m) {
  72                         new_map.insert(make_pair(m->first + delta, m->second));
  73                 }
  74                 tm->second = new_map;
  75         }
  76 }
  77
  78 /** Offset the 'to' field of every mapping for type @a t by @a delta */
  79 void
  80 ChanMapping::offset_to(DataType t, int32_t delta)
  81 {
  82         Mappings::iterator tm = _mappings.find(t);
  83         if (tm != _mappings.end()) {
  84                 for (TypeMapping::iterator m = tm->second.begin(); m != tm->second.end(); ++m) {
  85                         m->second += delta;
  86                 }
  87         }
  88 }
  89
  90 } // namespace ARDOUR
  91
  92 std::ostream& operator<<(std::ostream& o, const ARDOUR::ChanMapping& cm)
  93 {
  94         for (ARDOUR::ChanMapping::Mappings::const_iterator tm = cm.mappings().begin();
  95                         tm != cm.mappings().end(); ++tm) {
  96                 o << tm->first.to_string() << endl;
  97                 for (ARDOUR::ChanMapping::TypeMapping::const_iterator i = tm->second.begin();
  98                                 i != tm->second.end(); ++i) {
  99                         o << "\t" << i->first << " => " << i->second << endl;
 100                 }
 101         }
 102
 103         return o;
 104 }
 105