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 #define __STDC_LIMIT_MACROS 1
  22 #include <stdint.h>
  23 #include "ardour/chan_count.h"
  24
  25 #include "i18n.h"
  26
  27 static const char* state_node_name = "Channels";
  28
  29 using namespace std;
  30
  31 namespace ARDOUR {
  32
  33 // infinite/zero chan count stuff, for setting minimums and maximums, etc.
  34 // FIXME: implement this in a less fugly way
  35
  36 ChanCount::ChanCount(const XMLNode& node)
  37 {
  38         reset();
  39         XMLNodeConstIterator iter = node.children().begin();
  40         for ( ; iter != node.children().end(); ++iter) {
  41                 if ((*iter)->name() == X_(state_node_name)) {
  42                         const string& type_str  = (*iter)->property("type")->value();
  43                         const string& count_str = (*iter)->property("count")->value();
  44                         set(DataType(type_str), atol(count_str.c_str()));
  45                 }
  46         }
  47 }
  48
  49 ChanCount
  50 infinity_factory()
  51 {
  52         ChanCount ret;
  53
  54         for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
  55                 ret.set(*t, UINT32_MAX);
  56         }
  57
  58         return ret;
  59 }
  60
  61 XMLNode*
  62 ChanCount::state(const std::string& name) const
  63 {
  64         XMLNode* node = new XMLNode (name);
  65         for (DataType::iterator t = DataType::begin(); t != DataType::end(); ++t) {
  66                 uint32_t count = get(*t);
  67                 if (count > 0) {
  68                         XMLNode* n = new XMLNode(X_(state_node_name));
  69                         n->add_property("type", (*t).to_string());
  70                         n->add_property("count", count);
  71                         node->add_child_nocopy(*n);
  72                 }
  73         }
  74         return node;
  75 }
  76
  77 // Statics
  78 const ChanCount ChanCount::INFINITE = infinity_factory();
  79 const ChanCount ChanCount::ZERO     = ChanCount();
  80
  81 } // namespace ARDOUR
  82
  83 std::ostream& operator<<(std::ostream& o, const ARDOUR::ChanCount& c) {
  84         return o << "AUDIO=" << c.n_audio() << ":MIDI=" << c.n_midi();
  85 }