source/libr2c2/block.cpp

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