source/libmarklin/block.cpp

   1 /* $Id$
   2
   3 This file is part of the MSP Märklin suite
   4 Copyright © 2006-2010  Mikkosoft Productions, Mikko Rasa
   5 Distributed under the GPL
   6 */
   7
   8 #include <algorithm>
   9 #include "block.h"
  10 #include "layout.h"
  11 #include "route.h"
  12 #include "trackiter.h"
  13 #include "tracktype.h"
  14
  15 using namespace std;
  16 using namespace Msp;
  17
  18 namespace Marklin {
  19
  20 Block::Block(Layout &l, Track &start):
  21         layout(l),
  22         id(0),
  23         sensor_id(start.get_sensor_id()),
  24         turnout_id(start.get_turnout_id()),
  25         train(0)
  26 {
  27         tracks.insert(&start);
  28         start.set_block(this);
  29
  30         list<Track *> queue;
  31         queue.push_back(&start);
  32
  33         while(!queue.empty())
  34         {
  35                 Track *track = queue.front();
  36                 queue.erase(queue.begin());
  37
  38                 const vector<Track *> &links = track->get_links();
  39                 for(unsigned i=0; i<links.size(); ++i)
  40                         if(links[i] && !tracks.count(links[i]))
  41                         {
  42                                 if(links[i]->get_sensor_id()==sensor_id && links[i]->get_turnout_id()==turnout_id)
  43                                 {
  44                                         queue.push_back(links[i]);
  45                                         tracks.insert(links[i]);
  46                                         links[i]->set_block(this);
  47                                 }
  48                                 else
  49                                         endpoints.push_back(Endpoint(track, i));
  50                         }
  51         }
  52
  53         determine_id();
  54
  55         for(unsigned i=0; i<endpoints.size(); ++i)
  56         {
  57                 unsigned path = 1<<i;
  58                 endpoints[i].paths |= path;
  59                 find_paths(TrackIter(endpoints[i].track, endpoints[i].track_ep), path);
  60         }
  61
  62         layout.add_block(*this);
  63 }
  64
  65 Block::~Block()
  66 {
  67         set<Track *> trks = tracks;
  68         tracks.clear();
  69         for(set<Track *>::iterator i=trks.begin(); i!=trks.end(); ++i)
  70                 (*i)->set_block(0);
  71
  72         for(vector<Endpoint>::iterator i=endpoints.begin(); i!=endpoints.end(); ++i)
  73                 if(Block *blk = i->link)
  74                 {
  75                         i->link = 0;
  76                         blk->break_link(*this);
  77                 }
  78
  79         layout.remove_block(*this);
  80 }
  81
  82 bool Block::has_track(Track &t) const
  83 {
  84         return tracks.count(&t);
  85 }
  86
  87 const Block::Endpoint &Block::get_endpoint(unsigned i) const
  88 {
  89         if(i>=endpoints.size())
  90                 throw InvalidParameterValue("Endpoint index out of range");
  91
  92         return endpoints[i];
  93 }
  94
  95 int Block::get_endpoint_by_link(Block &other) const
  96 {
  97         for(unsigned i=0; i<endpoints.size(); ++i)
  98                 if(endpoints[i].link==&other)
  99                         return i;
 100
 101         return -1;
 102 }
 103
 104 float Block::get_path_length(unsigned entry, const Route *route) const
 105 {
 106         if(entry>=endpoints.size())
 107                 throw InvalidParameterValue("Endpoint index out of range");
 108
 109         TrackIter t_iter(endpoints[entry].track, endpoints[entry].track_ep);
 110
 111         float result = 0;
 112         while(t_iter && has_track(*t_iter))
 113         {
 114                 unsigned path = (route ? route->get_path(*t_iter) : t_iter->get_active_path());
 115                 result += t_iter->get_type().get_path_length(path);
 116
 117                 t_iter = t_iter.next(path);
 118         }
 119
 120         return result;
 121 }
 122
 123 void Block::check_link(Block &other)
 124 {
 125         for(vector<Endpoint>::iterator i=endpoints.begin(); i!=endpoints.end(); ++i)
 126         {
 127                 if(i->link)
 128                         continue;
 129
 130                 for(vector<Endpoint>::iterator j=other.endpoints.begin(); j!=other.endpoints.end(); ++j)
 131                         if(j->track==i->track->get_link(i->track_ep) && j->track->get_link(j->track_ep)==i->track && !j->link)
 132                         {
 133                                 i->link = &other;
 134                                 j->link = this;
 135
 136                                 determine_id();
 137                                 other.determine_id();
 138                         }
 139         }
 140 }
 141
 142 void Block::break_link(Block &other)
 143 {
 144         for(vector<Endpoint>::iterator i=endpoints.begin(); i!=endpoints.end(); ++i)
 145                 if(i->link==&other)
 146                 {
 147                         i->link = 0;
 148                         other.break_link(*this);
 149                         determine_id();
 150                 }
 151 }
 152
 153 Block *Block::get_link(unsigned epi) const
 154 {
 155         if(epi>=endpoints.size())
 156                 throw InvalidParameterValue("Endpoint index out of range");
 157         return endpoints[epi].link;
 158 }
 159
 160 bool Block::reserve(Train *t)
 161 {
 162         if(!t || !train)
 163         {
 164                 train = t;
 165                 layout.signal_block_reserved.emit(*this, train);
 166                 return true;
 167         }
 168         else
 169                 return false;
 170 }
 171
 172 void Block::find_paths(TrackIter track, unsigned path)
 173 {
 174         unsigned mask = track.endpoint().paths;
 175         for(unsigned i=0; mask>>i; ++i)
 176                 if(mask&(1<<i))
 177                 {
 178                         TrackIter next = track.next(i);
 179                         if(!next)
 180                                 continue;
 181                         else if(has_track(*next))
 182                                 find_paths(track.next(i), path);
 183                         else
 184                         {
 185                                 next = next.flip();
 186                                 for(vector<Endpoint>::iterator j=endpoints.begin(); j!=endpoints.end(); ++j)
 187                                         if(j->track==next.track() && j->track_ep==next.entry())
 188                                                 j->paths |= path;
 189                         }
 190                 }
 191 }
 192
 193 void Block::determine_id()
 194 {
 195         if(sensor_id)
 196                 id = 0x1000|sensor_id;
 197         else if(turnout_id)
 198                 id = 0x2000|turnout_id;
 199         else if(endpoints.size()==2)
 200         {
 201                 unsigned id1 = endpoints[0].link ? endpoints[0].link->get_id() : 1;
 202                 unsigned id2 = endpoints[1].link ? endpoints[1].link->get_id() : 1;
 203                 if(id2<id1)
 204                         swap(id1, id2);
 205                 id = (id1<<16)|id2;
 206         }
 207         else if(endpoints.size()==1)
 208         {
 209                 unsigned id1 = endpoints[0].link ? endpoints[0].link->get_id() : 1;
 210                 id = 0x10000 | id1;
 211         }
 212 }
 213
 214
 215 Block::Endpoint::Endpoint(Track *t, unsigned e):
 216         track(t),
 217         track_ep(e),
 218         link(0),
 219         paths(0)
 220 { }
 221
 222 } // namespace Marklin