libs/ardour/chan_count.cc

   1 /*
   2     Copyright (C) 2006 Paul Davis
   3
   4     This program is free software; you can redistribute it and/or modify
   5     it under the terms of the GNU General Public License as published by
   6     the Free Software Foundation; either version 2 of the License, or
   7     (at your option) any later version.
   8
   9     This program is distributed in the hope that it will be useful,
  10     but WITHOUT ANY WARRANTY; without even the implied warranty of
  11     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12     GNU General Public License for more details.
  13
  14     You should have received a copy of the GNU General Public License
  15     along with this program; if not, write to the Free Software
  16     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  17
  18     $Id: insert.cc 712 2006-07-28 01:08:57Z drobilla $
  19 */
  20
  21 #include <stdint.h>
  22 #include "ardour/chan_count.h"
  23
  24 #include "i18n.h"
  25
  26 static const char* state_node_name = "Channels";
  27
  28 using namespace std;
  29
  30 namespace ARDOUR {
  31
  32 // infinite/zero chan count stuff, for setting minimums and maximums, etc.
  33 // FIXME: implement this in a less fugly way
  34
  35 ChanCount::ChanCount(const XMLNode& node)
  36 {
  37         reset();
  38         XMLNodeConstIterator iter = node.children().begin();
  39         for ( ; iter != node.children().end(); ++iter) {
  40                 if ((*iter)->name() == X_(state_node_name)) {
  41                         const string& type_str  = (*iter)->property("type")->value();
  42                         const string& count_str = (*iter)->property("count")->value();
  43                         set(DataType(type_str), atol(count_str.c_str()));
  44                 }
  45         }
  46 }
  47
  48 ChanCount
  49 infinity_factory()
  50 {
  51         ChanCount ret;
  52
  53         for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
  54                 ret.set(*t, UINT32_MAX);
  55         }
  56
  57         return ret;
  58 }
  59
  60 XMLNode*
  61 ChanCount::state(const std::string& name) const
  62 {
  63         XMLNode* node = new XMLNode (name);
  64         for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
  65                 uint32_t count = get(*t);
  66                 if (count > 0) {
  67                         XMLNode* n = new XMLNode(X_(state_node_name));
  68                         n->add_property("type", (*t).to_string());
  69                         n->add_property("count", count);
  70                         node->add_child_nocopy(*n);
  71                 }
  72         }
  73         return node;
  74 }
  75
  76 // Statics
  77 const ChanCount ChanCount::INFINITE = infinity_factory();
  78 const ChanCount ChanCount::ZERO     = ChanCount();
  79
  80 } // namespace ARDOUR
  81
  82 std::ostream& operator<<(std::ostream& o, const ARDOUR::ChanCount& c) {
  83         return o << "AUDIO=" << c.n_audio() << ":MIDI=" << c.n_midi();
  84 }