1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700
|
static const char *RcsId = "$Id: eventqueue.cpp 22213 2013-03-07 14:32:56Z taurel $\n$Name$";
//============================================================================
//
// file : eventqueue.cpp
//
// description : Implementation of the event queue classes for
// all Tango events
//
// project : TANGO
//
// author(s) : J. Meyer
//
// Copyright (C) : 2004,2005,2006,2007,2008,2009,2010,2011,2012,2013
// European Synchrotron Radiation Facility
// BP 220, Grenoble 38043
// FRANCE
//
// This file is part of Tango.
//
// Tango is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// Tango is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with Tango. If not, see <http://www.gnu.org/licenses/>.
//
// $Revision: 22213 $
//
//
//============================================================================
#include <tango.h>
#include <event.h>
namespace Tango
{
////////////////////////////////////////////////////////////////////////////
// EventQueue class implementation
////////////////////////////////////////////////////////////////////////////
//+-------------------------------------------------------------------------
//
// method : EventQueue::EventQueue
//
// description : Two constructors for the EventQueue class.
// The first one does not take any argument and will
// allow unlimited event buffering.
// The second one creates a circular buffer with the
// maximum size given as argument.
//
// argument : in : - max_size : the maximum buffer size
//
//--------------------------------------------------------------------------
EventQueue::EventQueue()
{
max_elt = 0;
insert_elt = 0;
nb_elt = 0;
}
EventQueue::EventQueue(long max_size)
{
if ( max_size == 0 )
max_elt = 0;
else
max_elt = max_size;
insert_elt = 0;
nb_elt = 0;
}
//+-------------------------------------------------------------------------
//
// method : EventQueue::EventQueue
//
// description : The class destructor. It frees all the memory allocated
// to store event data.
//
//--------------------------------------------------------------------------
EventQueue::~EventQueue()
{
cout3 << "Entering EventQueue::~EventQueue nb_elt = " << nb_elt << endl;
// lock the event queue
omni_mutex_lock l(modification_mutex);
long nb = nb_elt;
// check whether the events are not attribute configuration events
if (event_buffer.size() > 0 )
{
for (long i=0; i<nb; i++)
delete event_buffer[i];
event_buffer.clear();
}
// for attibute configuration events
else
{
if (conf_event_buffer.size() > 0)
{
for (long i=0; i<nb; i++)
delete conf_event_buffer[i];
conf_event_buffer.clear();
}
else
{
for (long i=0; i<nb; i++)
delete ready_event_buffer[i];
ready_event_buffer.clear();
}
}
}
//+-------------------------------------------------------------------------
//
// method : EventQueue::insert_event
//
// description : Insert a new event in the event queue
//
// argument : in : - new_event : A pointer to the allocated event data
// structure.
//
//--------------------------------------------------------------------------
void EventQueue::insert_event (EventData *new_event)
{
cout3 << "Entering EventQueue::insert_event" << endl;
// lock the event queue
omni_mutex_lock l(modification_mutex);
//
// Insert data in the event queue
//
// when no maximum queue size is given, just add the new event
if ( max_elt == 0 )
{
event_buffer.push_back (new_event);
}
// when a maximum size is given, handle a circular buffer
else
{
// allocate ring buffer when not yet done
if ( event_buffer.empty() == true )
{
event_buffer.resize (max_elt, NULL);
}
// free data when necessary
if ( event_buffer[insert_elt] != NULL )
{
delete event_buffer[insert_elt];
}
// insert the event data pointer into the queue
event_buffer[insert_elt] = new_event;
}
// Manage insert and read indexes
inc_indexes();
}
//+-------------------------------------------------------------------------
//
// method : EventQueue::insert_event
//
// description : Insert a new attribute configuration event in the
// event queue
//
// argument : in : - new_event : A pointer to the allocated attribute
// configuration event data structure.
//
//--------------------------------------------------------------------------
void EventQueue::insert_event (AttrConfEventData *new_event)
{
cout3 << "Entering EventQueue::insert_event" << endl;
// lock the event queue
omni_mutex_lock l(modification_mutex);
//
// Insert data in the event queue
//
// when no maximum queue size is given, just add the new event
if ( max_elt == 0 )
{
conf_event_buffer.push_back (new_event);
}
// when a maximum size s given, handle a circular buffer
else
{
// allocate ring buffer when not yet done
if ( conf_event_buffer.empty() == true )
{
conf_event_buffer.resize (max_elt, NULL);
}
// free data when necessary
if ( conf_event_buffer[insert_elt] != NULL )
{
delete conf_event_buffer[insert_elt];
}
// insert the event data pointer into the queue
conf_event_buffer[insert_elt] = new_event;
}
// Manage insert and read indexes
inc_indexes();
}
//+-------------------------------------------------------------------------
//
// method : EventQueue::insert_event
//
// description : Insert a new attribute data ready event in the
// event queue
//
// argument : in : - new_event : A pointer to the allocated attribute
// data ready event data structure.
//
//--------------------------------------------------------------------------
void EventQueue::insert_event (DataReadyEventData *new_event)
{
cout3 << "Entering EventQueue::insert_event" << endl;
// lock the event queue
omni_mutex_lock l(modification_mutex);
//
// Insert data in the event queue
//
// when no maximum queue size is given, just add the new event
if ( max_elt == 0 )
{
ready_event_buffer.push_back (new_event);
}
// when a maximum size s given, handle a circular buffer
else
{
// allocate ring buffer when not yet done
if ( ready_event_buffer.empty() == true )
{
ready_event_buffer.resize (max_elt, NULL);
}
// free data when necessary
if ( ready_event_buffer[insert_elt] != NULL )
{
delete ready_event_buffer[insert_elt];
}
// insert the event data pointer into the queue
ready_event_buffer[insert_elt] = new_event;
}
// Manage insert and read indexes
inc_indexes();
}
//+-------------------------------------------------------------------------
//
// method : EventQueue::inc_indexes
//
// description : This private method increments the indexes used to acces
// the queue itself. This is necessary because the queue must
// be managed as a circular buffer
//
//--------------------------------------------------------------------------
void EventQueue::inc_indexes()
{
if (max_elt == 0)
{
// unlimited buffer size
insert_elt++;
nb_elt++;
}
else
{
// circular buffer
insert_elt++;
if (insert_elt == max_elt)
insert_elt = 0;
if (nb_elt != max_elt)
nb_elt++;
}
}
//+-------------------------------------------------------------------------
//
// method : EventQueue::size
//
// description : Returns the number of events stored in the event queue
//
//--------------------------------------------------------------------------
int EventQueue::size()
{
// lock the event queue
omni_mutex_lock l(modification_mutex);
return nb_elt;
}
//+-------------------------------------------------------------------------
//
// method : EventQueue::::get_last_event_date
//
// description : Returns the date of the last inserted, and not yet
// extracted event in the circular buffer
//
//--------------------------------------------------------------------------
TimeVal EventQueue::get_last_event_date()
{
cout3 << "Entering EventQueue::get_last_insert_date" << endl;
// lock the event queue
omni_mutex_lock l(modification_mutex);
if ( event_buffer.empty() == false )
{
if (insert_elt == 0)
{
return event_buffer[max_elt - 1]->get_date();
}
else
{
return event_buffer[insert_elt - 1]->get_date();
}
}
else
{
if ( conf_event_buffer.empty() == false )
{
if (insert_elt == 0)
{
return conf_event_buffer[max_elt - 1]->get_date();
}
else
{
return conf_event_buffer[insert_elt - 1]->get_date();
}
}
else
{
if ( ready_event_buffer.empty() == false )
{
if (insert_elt == 0)
return ready_event_buffer[max_elt - 1]->get_date();
else
return conf_event_buffer[insert_elt - 1]->get_date();
}
else
{
TangoSys_OMemStream o;
o << "No new events available!\n";
o << "Cannot return any event date" << ends;
EventSystemExcept::throw_exception((const char *)API_EventQueues,
o.str(),
(const char *)"EventQueue::get_last_event_date()");
}
}
}
// Should never reach here. To make compiler happy
struct TimeVal tv;
tv.tv_sec = tv.tv_usec = tv.tv_nsec = 0;
return tv;
}
//-------------------------------------------------------------------------
//
// method : EventQueue::get_events
//
// description : Return a vector with all events in the circular buffer.
// Events are kept in the buffer since the last extraction
// with get_events().
// After returning the event data, the circular buffer gets
// emptied!
//
//--------------------------------------------------------------------------
void EventQueue::get_events(EventDataList &event_list)
{
cout3 << "Entering EventQueue::get_events" << endl;
// lock the event queue
omni_mutex_lock l(modification_mutex);
//
// Set index to read the ring buffer and to initialise the vector
// of pointers to return.
// In the returned sequence , indice 0 is the oldest data
//
long index = insert_elt;
if (index == 0)
index = max_elt;
index--;
long seq_index = nb_elt - 1;
// prepare the vector to be returned
event_list.clear();
event_list.resize(nb_elt);
//
// Read buffer
//
for (long i=0; i < nb_elt; i++)
{
event_list[seq_index] = event_buffer[index];
// we do not want to free the event data when cleaning-up
// the vector
event_buffer[index] = NULL;
if (index == 0)
index = max_elt;
index--;
seq_index--;
}
// empty the event queue now
event_buffer.clear();
insert_elt = 0;
nb_elt = 0;
cout3 << "EventQueue::get_events() : size = " << event_list.size() << endl;
return;
}
//-------------------------------------------------------------------------
//
// method : EventQueue::get_events
//
// description : Return a vector with all events in the circular buffer.
// Events are kept in the buffer since the last extraction
// with get_events().
// After returning the event data, the circular buffer gets
// emptied!
//
//--------------------------------------------------------------------------
void EventQueue::get_events(AttrConfEventDataList &event_list)
{
cout3 << "Entering EventQueue::get_events" << endl;
// lock the event queue
omni_mutex_lock l(modification_mutex);
//
// Set index to read the ring buffer and to initialise the vector
// of pointers to return.
// In the returned sequence , indice 0 is the oldest data
//
long index = insert_elt;
if (index == 0)
index = max_elt;
index--;
long seq_index = nb_elt - 1;
// prepare the vector to be returned
event_list.clear();
event_list.resize(nb_elt);
//
// Read buffer
//
for (long i=0; i < nb_elt; i++)
{
event_list[seq_index] = conf_event_buffer[index];
// we do not want to free the event data when cleaning-up
// the vector
conf_event_buffer[index] = NULL;
if (index == 0)
index = max_elt;
index--;
seq_index--;
}
// empty the event queue now
conf_event_buffer.clear();
insert_elt = 0;
nb_elt = 0;
cout3 << "EventQueue::get_events() : size = " << event_list.size() << endl;
return;
}
//-------------------------------------------------------------------------
//
// method : EventQueue::get_events
//
// description : Return a vector with all events in the circular buffer.
// Events are kept in the buffer since the last extraction
// with get_events().
// After returning the event data, the circular buffer gets
// emptied!
//
//--------------------------------------------------------------------------
void EventQueue::get_events(DataReadyEventDataList &event_list)
{
cout3 << "Entering EventQueue::get_events" << endl;
// lock the event queue
omni_mutex_lock l(modification_mutex);
//
// Set index to read the ring buffer and to initialise the vector
// of pointers to return.
// In the returned sequence , indice 0 is the oldest data
//
long index = insert_elt;
if (index == 0)
index = max_elt;
index--;
long seq_index = nb_elt - 1;
// prepare the vector to be returned
event_list.clear();
event_list.resize(nb_elt);
//
// Read buffer
//
for (long i=0; i < nb_elt; i++)
{
event_list[seq_index] = ready_event_buffer[index];
// we do not want to free the event data when cleaning-up
// the vector
ready_event_buffer[index] = NULL;
if (index == 0)
index = max_elt;
index--;
seq_index--;
}
// empty the event queue now
ready_event_buffer.clear();
insert_elt = 0;
nb_elt = 0;
cout3 << "EventQueue::get_events() : size = " << event_list.size() << endl;
return;
}
//-------------------------------------------------------------------------
//
// method : EventQueue::get_events
//
// description : Call the callback method for all events in the
// circular buffer.
// Events are kept in the buffer since the last extraction
// with get_events().
// After returning the event data, the circular buffer gets
// emptied!
//
//--------------------------------------------------------------------------
void EventQueue::get_events(CallBack *cb)
{
cout3 << "Entering EventQueue::get_events" << endl;
if ( cb == NULL )
{
TangoSys_OMemStream o;
o << "No callback object given!\n";
o << "Cannot return any event data" << ends;
EventSystemExcept::throw_exception((const char *)API_EventQueues,
o.str(),
(const char *)"EventQueue::get_events()");
}
// Check the event type
if ( event_buffer.empty() == false )
{
// Get event data for a local data copy.
// The event reception should not be blocked in
// case of a problem in the callback method!
EventDataList event_list;
get_events (event_list);
// Loop over all events
EventDataList::iterator vpos;
for (vpos=event_list.begin(); vpos!=event_list.end(); ++vpos)
{
// call the callback method
try
{
cb->push_event(*vpos);
}
catch (...)
{
cerr << "Tango::EventQueue::get_events() exception in callback method \nfor attribute " <<
(*vpos)->attr_name << "with event type " << (*vpos)->event << endl;
}
}
}
else if ( conf_event_buffer.empty() == false )
{
// Get event data for a local data copy.
// The event reception should not be blocked in
// case of a problem in the callback method!
AttrConfEventDataList attr_conf_event_list;
get_events (attr_conf_event_list);
// Loop over all events
AttrConfEventDataList::iterator vpos;
for (vpos=attr_conf_event_list.begin(); vpos!=attr_conf_event_list.end(); ++vpos)
{
// call the callback method
try
{
cb->push_event(*vpos);
}
catch (...)
{
cerr << "Tango::EventQueue::get_events() exception in callback method \nfor attribute " <<
(*vpos)->attr_name << "with event type " << (*vpos)->event << endl;
}
}
}
else
{
// Get event data for a local data copy.
// The event reception should not be blocked in
// case of a problem in the callback method!
DataReadyEventDataList d_ready_event_list;
get_events (d_ready_event_list);
// Loop over all events
DataReadyEventDataList::iterator vpos;
for (vpos=d_ready_event_list.begin(); vpos!=d_ready_event_list.end(); ++vpos)
{
// call the callback method
try
{
cb->push_event(*vpos);
}
catch (...)
{
cerr << "Tango::EventQueue::get_events() exception in callback method \nfor attribute " <<
(*vpos)->attr_name << "with event type " << (*vpos)->event << endl;
}
}
}
}
} // End of Tango namespace
|