source/libr2c2/trainrouter.cpp

   1 #include "driver.h"
   2 #include "layout.h"
   3 #include "route.h"
   4 #include "trackiter.h"
   5 #include "train.h"
   6 #include "trackchain.h"
   7 #include "trainroutemetric.h"
   8 #include "trainrouteplanner.h"
   9 #include "trainrouter.h"
  10
  11 using namespace std;
  12 using namespace Msp;
  13
  14 namespace R2C2 {
  15
  16 TrainRouter::TrainRouter(Train &t):
  17         TrainAI(t),
  18         priority(0),
  19         arrival(ON_THE_WAY),
  20         waypoints_changed(false),
  21         metrics_stale(false),
  22         current_sequence(0),
  23         sequence_check_pending(false)
  24 {
  25         train.get_layout().signal_block_reserved.connect(sigc::mem_fun(this, &TrainRouter::block_reserved));
  26         train.signal_advanced.connect(sigc::mem_fun(this, &TrainRouter::train_advanced));
  27         train.signal_rear_advanced.connect(sigc::mem_fun(this, &TrainRouter::train_rear_advanced));
  28 }
  29
  30 TrainRouter::~TrainRouter()
  31 {
  32         for(vector<TrainRouteMetric *>::iterator i=metrics.begin(); i!=metrics.end(); ++i)
  33                 delete *i;
  34 }
  35
  36 void TrainRouter::set_priority(int p)
  37 {
  38         priority = p;
  39 }
  40
  41 bool TrainRouter::set_route(const Route *r)
  42 {
  43         routes.clear();
  44         if(r)
  45         {
  46                 routes.push_back(r);
  47                 create_lead_route();
  48         }
  49
  50         waypoints.clear();
  51         sequence_points.clear();
  52         current_sequence = 0;
  53         sequence_check_pending = false;
  54
  55         route_changed();
  56
  57         return true;
  58 }
  59
  60 const Route *TrainRouter::get_route() const
  61 {
  62         if(routes.empty())
  63                 return 0;
  64         return routes.front();
  65 }
  66
  67 void TrainRouter::use_planned_route()
  68 {
  69         if(!planner || planner->get_result()!=TrainRoutePlanner::COMPLETE)
  70                 return;
  71         if(waypoints.empty())
  72                 return;
  73
  74         const list<Route *> &planned_routes = planner->get_routes_for(train);
  75
  76         routes.clear();
  77         routes.insert(routes.end(), planned_routes.begin(), planned_routes.end());
  78         create_lead_route();
  79
  80         sequence_points = planner->get_sequence_for(train);
  81         current_sequence = 0;
  82         sequence_check_pending = false;
  83
  84         route_changed();
  85 }
  86
  87 void TrainRouter::route_changed()
  88 {
  89         BlockIter fncb = train.get_last_critical_block().next();
  90
  91         arrival = ON_THE_WAY;
  92         reserving_route = routes.begin();
  93         if(!routes.empty())
  94         {
  95                 /* Find the route that should be used for the next allocated block.  We
  96                 can't rely on the resync code in block_reserved since we may need to
  97                 clear the stop marker to continue allocation. */
  98                 const BlockAllocator &allocator = train.get_block_allocator();
  99                 TrackIter track = allocator.first().track_iter();
 100                 list<SequencePoint>::iterator seq_begin = sequence_points.begin();
 101                 for(; track; track=track.next())
 102                 {
 103                         if(!advance_to_track(reserving_route, track))
 104                         {
 105                                 arrival = (allocator.is_block_current(track->get_block()) ? ADVANCED_TO_END : RESERVED_TO_END);
 106                                 break;
 107                         }
 108                         if(&track->get_block()==fncb.block())
 109                                 break;
 110
 111                         if(seq_begin!=sequence_points.end() && seq_begin->block==&track->get_block())
 112                         {
 113                                 // Assume any sequence points within critical blocks to be cleared
 114                                 current_sequence = seq_begin->sequence_out;
 115                                 ++seq_begin;
 116                         }
 117                 }
 118
 119                 sequence_points.erase(sequence_points.begin(), seq_begin);
 120
 121                 if(!sequence_points.empty())
 122                 {
 123                         const SequencePoint &sp = sequence_points.front();
 124                         if(sp.block==fncb.block() && sp.preceding_train)
 125                         {
 126                                 arrival = WAITING_FOR_SEQUENCE;
 127                                 sequence_check_pending = true;
 128                         }
 129                 }
 130         }
 131
 132         /* Refresh from the first non-critical block to pick up any changes in the
 133         route.  Set stop marker first in case an arrival condition was met within the
 134         critical blocks. */
 135         if(arrival)
 136                 train.stop_at(&*fncb.flip());
 137         train.refresh_blocks_from(*fncb);
 138         // If no arrival condition was found, clear a possible previous stop marker.
 139         if(!arrival)
 140                 train.stop_at(0);
 141
 142         const Route *route = get_route();
 143         signal_route_changed.emit(route);
 144         signal_event.emit(Message("route-changed", route));
 145 }
 146
 147 void TrainRouter::set_destination(const TrackChain &d)
 148 {
 149         if(waypoints.empty())
 150                 waypoints.push_back(Waypoint(d));
 151         else
 152                 waypoints.back() = Waypoint(d);
 153         waypoints_changed = true;
 154         metrics_stale = true;
 155 }
 156
 157 void TrainRouter::add_waypoint(const TrackChain &chain, TrackChain::Direction dir)
 158 {
 159         waypoints.push_back(Waypoint(chain, dir));
 160         waypoints_changed = true;
 161         metrics_stale = true;
 162 }
 163
 164 const TrainRouter::Waypoint &TrainRouter::get_waypoint(unsigned index) const
 165 {
 166         if(index>=waypoints.size())
 167                 throw out_of_range("TrainRouter::is_waypoint");
 168
 169         return waypoints[index];
 170 }
 171
 172 const TrainRouteMetric &TrainRouter::get_metric(int index) const
 173 {
 174         if(waypoints.empty())
 175                 throw logic_error("no metrics");
 176         else if(metrics_stale)
 177                 throw logic_error("metrics are stale");
 178
 179         if(index<0)
 180                 return *metrics.back();
 181         else if(static_cast<unsigned>(index)>=waypoints.size())
 182                 throw out_of_range("TrainRouter::get_metric");
 183         else
 184                 return *metrics[index];
 185 }
 186
 187 void TrainRouter::set_departure_delay(const Time::TimeDelta &d)
 188 {
 189         delay = d;
 190         waypoints_changed = true;
 191 }
 192
 193 void TrainRouter::set_trip_duration(const Time::TimeDelta &d)
 194 {
 195         duration = d;
 196 }
 197
 198 void TrainRouter::message(const Message &msg)
 199 {
 200         if(msg.type=="set-route")
 201         {
 202                 if(msg.value.check_type<Route *>())
 203                         set_route(msg.value.value<Route *>());
 204                 else
 205                         set_route(msg.value.value<const Route *>());
 206         }
 207         else if(msg.type=="clear-route")
 208                 set_route(0);
 209         else if(msg.type=="set-destination")
 210         {
 211                 if(msg.value.check_type<TrackChain *>())
 212                         set_destination(*msg.value.value<TrackChain *>());
 213                 else
 214                         set_destination(*msg.value.value<const TrackChain *>());
 215         }
 216         else if(msg.type=="add-waypoint")
 217         {
 218                 if(msg.value.check_type<Waypoint>())
 219                 {
 220                         Waypoint wp = msg.value.value<Waypoint>();
 221                         add_waypoint(*wp.chain, wp.direction);
 222                 }
 223                 else if(msg.value.check_type<TrackChain *>())
 224                         add_waypoint(*msg.value.value<TrackChain *>());
 225                 else
 226                         add_waypoint(*msg.value.value<const TrackChain *>());
 227         }
 228         else if(msg.type=="set-departure-delay")
 229                 set_departure_delay(msg.value.value<Time::TimeDelta>());
 230         else if(msg.type=="set-trip-duration")
 231                 set_trip_duration(msg.value.value<Time::TimeDelta>());
 232 }
 233
 234 void TrainRouter::tick(const Time::TimeDelta &dt)
 235 {
 236         if(waypoints_changed && !planner)
 237                 start_planning(train.get_layout());
 238
 239         if(planner && planner->check()!=TrainRoutePlanner::PENDING)
 240                 apply_plan(train.get_layout(), *planner);
 241
 242         Layout &layout = train.get_layout();
 243         if(!layout.get_driver().is_halted() && !layout.get_clock().is_stopped())
 244         {
 245                 if(delay)
 246                 {
 247                         delay -= dt;
 248                         if(delay<Time::zero)
 249                         {
 250                                 duration = max(duration+delay, Time::zero);
 251                                 delay = Time::zero;
 252                         }
 253                 }
 254                 else if(duration)
 255                         duration = max(duration-dt, Time::zero);
 256         }
 257
 258         if(sequence_check_pending)
 259         {
 260                 if(sequence_points.front().is_cleared())
 261                 {
 262                         arrival = ON_THE_WAY;
 263                         train.stop_at(0);
 264                 }
 265                 sequence_check_pending = false;
 266         }
 267
 268         if(arrival==ADVANCED_TO_END && !train.get_speed())
 269         {
 270                 signal_arrived.emit(waypoints.back().chain);
 271                 signal_event.emit(Message("arrived", waypoints.back().chain));
 272                 arrival = ARRIVED;
 273         }
 274         else if(arrival==ARRIVED && !train.get_block_allocator().is_active())
 275                 set_route(0);
 276 }
 277
 278 void TrainRouter::save(list<DataFile::Statement> &st) const
 279 {
 280         st.push_back((DataFile::Statement("priority"), priority));
 281
 282         if(!routes.empty())
 283         {
 284                 RouteList::const_iterator i = routes.begin();
 285                 for(; (i!=routes.end() && (*i)->is_temporary()); ++i) ;
 286                 if(i!=routes.end())
 287                         st.push_back((DataFile::Statement("route"), (*i)->get_name()));
 288         }
 289 }
 290
 291 void TrainRouter::block_reserved(Block &block, Train *t)
 292 {
 293         if(routes.empty())
 294                 return;
 295
 296         if(t!=&train)
 297         {
 298                 if(!t)
 299                         return;
 300
 301                 // Are we waiting for the other train to pass a sequence point?
 302                 SequencePoint &sp = sequence_points.front();
 303                 if(sp.preceding_train==t && sp.block==&block)
 304                         /* The other train's router will advance its sequence on the same
 305                         signal and may not have handled it yet. */
 306                         sequence_check_pending = true;
 307
 308                 return;
 309         }
 310
 311         // Did we reach our next sequence point?
 312         if(!sequence_points.empty())
 313         {
 314                 SequencePoint &sp = sequence_points.front();
 315                 if(sp.block==&block)
 316                 {
 317                         current_sequence = sp.sequence_out;
 318                         sequence_points.pop_front();
 319                 }
 320         }
 321
 322         TrackIter track = train.get_block_allocator().iter_for(block).track_iter();
 323
 324         // Is the block a turnout?  If it is, set it to the correct path.
 325         if(unsigned taddr = block.get_turnout_address())
 326         {
 327                 int path = (*reserving_route)->get_turnout(taddr);
 328                 if(path>=0)
 329                         track->set_active_path(path);
 330         }
 331
 332         /* If the allocator has released blocks from the front, we may need to
 333         resync reserving_route. */
 334         if(reserving_route==routes.end() || !(*reserving_route)->has_track(*track))
 335         {
 336                 reserving_route = routes.begin();
 337                 arrival = ON_THE_WAY;
 338                 track = t->get_block_allocator().first().track_iter();
 339                 for(; track; track=track.next())
 340                 {
 341                         if(!advance_to_track(reserving_route, track))
 342                                 throw logic_error("internal error (reservation outside of route)");
 343                         else if(&track->get_block()==&block)
 344                                 break;
 345                 }
 346         }
 347
 348         /* Keep reserving_route pointing to the route containing the block that is
 349         expected to be allocated next. */
 350         for(; track; track=track.next((*reserving_route)->get_path(*track)))
 351         {
 352                 if(!advance_to_track(reserving_route, track))
 353                 {
 354                         // We've reached the end of the route.  Stop here.
 355                         arrival = RESERVED_TO_END;
 356                         train.stop_at(&block);
 357                         return;
 358                 }
 359                 if(&track->get_block()!=&block)
 360                         break;
 361         }
 362
 363         // Do we need to wait for another train to pass?
 364         if(!sequence_points.empty())
 365         {
 366                 SequencePoint &sp = sequence_points.front();
 367                 if(sp.block==&track->get_block() && !sp.is_cleared())
 368                 {
 369                         arrival = WAITING_FOR_SEQUENCE;
 370                         train.stop_at(&block);
 371                 }
 372         }
 373 }
 374
 375 void TrainRouter::train_advanced(Block &block)
 376 {
 377         if(!waypoints.empty())
 378         {
 379                 // A waypoint is considered reached when the train has advanced through it.
 380                 BlockIter b_iter = train.get_block_allocator().iter_for(block);
 381                 const Waypoint &wp = waypoints.front();
 382                 TrackIter t_iter = b_iter.track_iter();
 383                 if(wp.chain->has_track(*t_iter))
 384                 {
 385                         while(1)
 386                         {
 387                                 TrackIter next = t_iter.next();
 388                                 if(!next)
 389                                         break;
 390
 391                                 if(!wp.chain->has_track(*next))
 392                                 {
 393                                         if(wp.direction!=TrackChain::UNSPECIFIED)
 394                                                 if(t_iter!=wp.chain->iter_for(*t_iter, wp.direction))
 395                                                         break;
 396
 397                                         if(waypoints.size()==1)
 398                                         {
 399                                                 if(arrival==RESERVED_TO_END)
 400                                                         arrival = ADVANCED_TO_END;
 401                                         }
 402                                         else
 403                                         {
 404                                                 const TrackChain *chain = wp.chain;
 405                                                 waypoints.erase(waypoints.begin());
 406                                                 metrics_stale = true;
 407                                                 signal_waypoint_reached.emit(chain);
 408                                                 signal_event.emit(Message("waypoint-reached", chain));
 409                                         }
 410                                         break;
 411                                 }
 412                                 else if(!block.has_track(*next))
 413                                         break;
 414
 415                                 t_iter = next;
 416                         }
 417                 }
 418         }
 419 }
 420
 421 void TrainRouter::train_rear_advanced(Block &block)
 422 {
 423         Track &track = *train.get_block_allocator().iter_for(block).endpoint().track;
 424
 425         // Drop any routes that are now completely behind the train.
 426         for(RouteList::iterator i=routes.begin(); i!=routes.end(); ++i)
 427                 if((*i)->has_track(track))
 428                 {
 429                         if(i!=routes.begin())
 430                         {
 431                                 routes.erase(routes.begin(), i);
 432                                 const Route *route = get_route();
 433                                 signal_route_changed.emit(route);
 434                                 signal_event.emit(Message("route-changed", route));
 435                         }
 436                         break;
 437                 }
 438 }
 439
 440 void TrainRouter::create_metrics()
 441 {
 442         for(vector<TrainRouteMetric *>::iterator i=metrics.begin(); i!=metrics.end(); ++i)
 443                 delete *i;
 444         metrics.clear();
 445
 446         metrics_stale = false;
 447
 448         if(waypoints.empty())
 449                 return;
 450
 451         for(vector<Waypoint>::const_iterator i=waypoints.begin(); i!=waypoints.end(); ++i)
 452                 metrics.push_back(new TrainRouteMetric(*i->chain, i->direction));
 453
 454         for(unsigned i=metrics.size()-1; i-->0; )
 455                 metrics[i]->chain_to(*metrics[i+1]);
 456 }
 457
 458 bool TrainRouter::create_lead_route()
 459 {
 460         if(routes.empty() || !train.is_placed())
 461                 return false;
 462
 463         BlockIter lcb = train.get_last_critical_block();
 464         TrackIter last_track_rev = lcb.reverse().track_iter();
 465
 466         unsigned count = 0;
 467         for(TrackIter i=last_track_rev; (i && i->get_block().get_train()==&train); i=i.next())
 468         {
 469                 if(routes.front()->has_track(*i))
 470                         ++count;
 471                 else if(count>0)
 472                 {
 473                         if(count==routes.front()->get_tracks().size())
 474                                 last_track_rev = i;
 475                         break;
 476                 }
 477         }
 478
 479         TrackIter next_track = last_track_rev.flip();
 480         if(!routes.front()->has_track(*last_track_rev) && !routes.front()->has_track(*next_track))
 481         {
 482                 Route *pf = Route::find(next_track, *routes.front());
 483                 if(!pf)
 484                         return false;
 485
 486                 routes.push_front(pf);
 487         }
 488
 489         Route *lead = 0;
 490         for(TrackIter i=last_track_rev; (i && i->get_block().get_train()==&train); i=i.next())
 491         {
 492                 if(!lead && !routes.front()->has_track(*i))
 493                 {
 494                         lead = new Route(train.get_layout());
 495                         lead->set_name("Lead");
 496                         lead->set_temporary(true);
 497                         routes.push_front(lead);
 498
 499                         TrackIter j = i.flip();
 500                         lead->add_track(*j);
 501                         lead->add_track(*j.next());
 502                 }
 503
 504                 if(lead)
 505                         lead->add_track(*i);
 506         }
 507
 508         return true;
 509 }
 510
 511 bool TrainRouter::advance_to_track(RouteList::iterator &route, const TrackIter &track)
 512 {
 513         Track &prev_track = *track.flip();
 514         unsigned taddr = (track->get_type().is_turnout() ? track->get_turnout_address() : 0);
 515         for(unsigned i=0; route!=routes.end(); ++i)
 516         {
 517                 bool in_route = (*route)->has_track(*track);
 518                 bool prev_in_route = (*route)->has_track(prev_track);
 519                 bool known_path = (!taddr || (*route)->get_turnout(taddr)>=0);
 520
 521                 if(in_route && (known_path || !prev_in_route))
 522                         return true;
 523                 else if(i==0 || prev_in_route)
 524                         ++route;
 525                 else
 526                         throw logic_error("internal error (routes are not continuous)");
 527         }
 528
 529         return false;
 530 }
 531
 532 void TrainRouter::get_routers(Layout &layout, vector<TrainRouter *> &routers)
 533 {
 534         const map<unsigned, Train *> &trains = layout.get_trains();
 535         routers.reserve(trains.size());
 536         for(map<unsigned, Train *>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
 537                 if(TrainRouter *router = i->second->get_ai_of_type<TrainRouter>())
 538                         routers.push_back(router);
 539 }
 540
 541 void TrainRouter::start_planning(Layout &layout)
 542 {
 543         vector<TrainRouter *> routers;
 544         get_routers(layout, routers);
 545
 546         for(vector<TrainRouter *>::const_iterator i=routers.begin(); i!=routers.end(); ++i)
 547                 if((*i)->metrics_stale)
 548                         (*i)->create_metrics();
 549
 550         RefPtr<TrainRoutePlanner> planner = new TrainRoutePlanner(layout);
 551         for(vector<TrainRouter *>::const_iterator i=routers.begin(); i!=routers.end(); ++i)
 552         {
 553                 (*i)->waypoints_changed = false;
 554                 (*i)->planner = planner;
 555         }
 556
 557         planner->plan_async();
 558 }
 559
 560 void TrainRouter::apply_plan(Layout &layout, TrainRoutePlanner &planner)
 561 {
 562         if(planner.get_result()==TrainRoutePlanner::FAILED)
 563                 layout.emergency(0, "Route planning failed");
 564
 565         vector<TrainRouter *> routers;
 566         get_routers(layout, routers);
 567
 568         for(vector<TrainRouter *>::const_iterator i=routers.begin(); i!=routers.end(); ++i)
 569                 if((*i)->planner.get()==&planner)
 570                 {
 571                         (*i)->use_planned_route();
 572                         (*i)->planner = 0;
 573                 }
 574 }
 575
 576
 577 TrainRouter::Waypoint::Waypoint(const TrackChain &c, TrackChain::Direction d):
 578         chain(&c),
 579         direction(d)
 580 { }
 581
 582
 583 TrainRouter::SequencePoint::SequencePoint(Block &b, unsigned o):
 584         block(&b),
 585         preceding_train(0),
 586         sequence_in(0),
 587         sequence_out(o)
 588 { }
 589
 590 bool TrainRouter::SequencePoint::is_cleared() const
 591 {
 592         if(!preceding_train)
 593                 return true;
 594
 595         TrainRouter *router = preceding_train->get_ai_of_type<TrainRouter>();
 596         return router->get_current_sequence()>=sequence_in;
 597 }
 598
 599
 600 TrainRouter::Loader::Loader(TrainRouter &r):
 601         DataFile::ObjectLoader<TrainRouter>(r)
 602 {
 603         add("priority", &TrainRouter::priority);
 604         add("route",    &Loader::route);
 605 }
 606
 607 void TrainRouter::Loader::route(const string &n)
 608 {
 609         obj.set_route(&obj.train.get_layout().get_route(n));
 610 }
 611
 612 } // namespace R2C2