TAO/examples/AMI/FL_Callback/Progress_i.cpp

   1 #include "Progress_i.h"
   2
   3 #include <FL/Fl_Slider.H>
   4 #include <FL/Fl_Button.H>
   5
   6 Progress_i::Progress_i (Progress_Window *window)
   7   :  window_ (window)
   8 {
   9 }
  10
  11 void
  12 Progress_i::sent_request (CORBA::Long id)
  13 {
  14   //ACE_DEBUG ((LM_DEBUG, "Progress (%t) - sent request %d\n", id));
  15   this->window_->sent_request (id);
  16 }
  17
  18 void
  19 Progress_i::recv_reply (CORBA::Long id)
  20 {
  21   this->window_->recv_reply (id);
  22 }
  23
  24 CORBA::Long
  25 Progress_i::bind (Peer_ptr a_peer)
  26 {
  27   ACE_DEBUG ((LM_DEBUG, "Progress (%t) - peer bound\n"));
  28   return this->window_->bind (a_peer);
  29 }
  30
  31 // ****************************************************************
  32
  33 Progress_Window::Progress_Window (int n_peers,
  34                                   int n_iterations,
  35                                   int x, int y,
  36                                   int w, int h,
  37                                   const char* l)
  38   :  Fl_Box (x, y, w, h, l),
  39      n_peers_ (n_peers),
  40      peers_ (n_peers),
  41      n_iterations_ (n_iterations)
  42 {
  43   ACE_NEW (this->request_progress_, Fl_Widget*[this->n_peers_]);
  44   ACE_NEW (this->reply_progress_, Fl_Widget*[this->n_peers_]);
  45
  46   // @@ leak...
  47   Fl_Widget *button = new Fl_Button (x + 5, y + 5,
  48                                      50, h - 10,
  49                                      "Start");
  50   button->callback (Progress_Window::start_callback, this);
  51
  52   // Compute the slider height, leaving a little margin...
  53   int sh = h / ( 2 * this->n_peers_);
  54   sh = sh - 5;
  55
  56   // The initial position, with margin...
  57   int sy = y + 5;
  58
  59   // Set the width of the sliders...
  60   int sx = x + 60;
  61   int sw = w - 65;
  62   int max = this->n_peers_ * this->n_iterations_;
  63   for (int i = 0; i < this->n_peers_; ++i)
  64     {
  65       Fl_Slider *obj;
  66
  67       this->request_progress_[i] = obj =
  68         new Fl_Slider (FL_HOR_FILL_SLIDER, sx, sy, sw, sh, "");
  69       obj->color (FL_BLACK);
  70       obj->selection_color (FL_RED);
  71       obj->bounds (0, max);
  72       obj->precision (0);
  73       obj->value (0);
  74       sy += sh + 5;
  75
  76       this->reply_progress_[i] = obj =
  77         new Fl_Slider (FL_HOR_FILL_SLIDER, sx, sy, sw, sh, "");
  78       obj->color (FL_BLACK);
  79       obj->selection_color (FL_GREEN);
  80       obj->bounds (0, max);
  81       obj->precision (0);
  82       obj->value (0);
  83       sy += sh + 5;
  84     }
  85 }
  86
  87 void
  88 Progress_Window::sent_request (CORBA::Long id)
  89 {
  90   if (id < 0 || id >= this->n_peers_)
  91     return;
  92   Fl_Slider *obj =
  93     dynamic_cast<Fl_Slider*> (this->request_progress_[id]);
  94   obj->value (obj->value () + 1);
  95   obj->redraw ();
  96
  97   int i = static_cast<int> (obj->value ());
  98   if (i % 100 == 0)
  99     ACE_DEBUG ((LM_DEBUG, "Progress (%t) - recv reply %d\n", i));
 100 }
 101
 102 void
 103 Progress_Window::recv_reply (CORBA::Long id)
 104 {
 105   if (id < 0 || id >= this->n_peers_)
 106     return;
 107   Fl_Slider *obj =
 108     dynamic_cast<Fl_Slider*> (this->reply_progress_[id]);
 109   obj->value (obj->value () + 1);
 110   obj->redraw ();
 111
 112   int i = static_cast<int> (obj->value ());
 113   if (i % 100 == 0)
 114     ACE_DEBUG ((LM_DEBUG, "Progress (%t) - recv reply %d\n", i));
 115 }
 116
 117 CORBA::Long
 118 Progress_Window::bind (Peer_ptr a_peer)
 119 {
 120   CORBA::ULong l = this->peers_.length ();
 121   this->peers_.length (l + 1);
 122   this->peers_[l] = Peer::_duplicate (a_peer);
 123
 124   return l;
 125 }
 126
 127 void
 128 Progress_Window::start_callback (Fl_Widget* /* widget */,
 129                                  void *data)
 130 {
 131   Progress_Window *self = static_cast<Progress_Window*> (data);
 132   self->start ();
 133 }
 134
 135 void
 136 Progress_Window::start ()
 137 {
 138   if (this->peers_.length () < CORBA::ULong (this->n_peers_))
 139     return;
 140
 141   for (CORBA::ULong i = 0; i != this->peers_.length (); ++i)
 142     {
 143       try
 144         {
 145           this->peers_[i]->start (this->peers_,
 146                                   this->n_iterations_);
 147         }
 148       catch (const CORBA::Exception& ex)
 149         {
 150           // Ignore exceptions
 151         }
 152     }
 153 }