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 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870
|
/* upstart
*
* event.c - event queue and handling
*
* Copyright © 2010 Canonical Ltd.
* Author: Scott James Remnant <scott@netsplit.com>.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2, as
* published by the Free Software Foundation.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif /* HAVE_CONFIG_H */
#include <string.h>
#include <unistd.h>
#include <nih/macros.h>
#include <nih/alloc.h>
#include <nih/string.h>
#include <nih/list.h>
#include <nih/hash.h>
#include <nih/main.h>
#include <nih/logging.h>
#include <nih/error.h>
#include "dbus/upstart.h"
#include "environ.h"
#include "event.h"
#include "job.h"
#include "blocked.h"
#include "control.h"
#include "errors.h"
#include "quiesce.h"
#include "com.ubuntu.Upstart.h"
/* Prototypes for static functions */
static void event_pending (Event *event);
static void event_pending_handle_jobs (Event *event);
static void event_finished (Event *event);
static const char * event_progress_enum_to_str (EventProgress progress)
__attribute__ ((warn_unused_result));
static EventProgress
event_progress_str_to_enum (const char *name)
__attribute__ ((warn_unused_result));
extern json_object *json_events;
/**
* events:
*
* This list holds the list of events in the process of pending, being
* handled or awaiting cleanup; each item is an Event structure.
**/
NihList *events = NULL;
/**
* event_init:
*
* Initialise the event list.
**/
void
event_init (void)
{
if (! events)
events = NIH_MUST (nih_list_new (NULL));
}
/**
* event_new:
* @parent: parent object for new event,
* @name: name of event to emit,
* @env: NULL-terminated array of environment variables for event.
*
* Allocates an Event structure for the event details given and
* appends it to the queue of events.
*
* @env is optional, and may be NULL; if given it should be a NULL-terminated
* array of environment variables in KEY=VALUE form. @env will be referenced
* by the new event. After calling this function, you should never use
* nih_free() to free @env and instead use nih_unref() or nih_discard() if
* you no longer need to use it.
*
* When the event reaches the top of the queue, it is taken off and placed
* into the handling queue. It is not removed from that queue until there
* are no remaining references to it.
*
* The event is created with nothing blocking it. Be sure to call
* event_block() otherwise it will be automatically freed next time
* through the main loop.
*
* If @parent is not NULL, it should be a pointer to another object which
* will be used as a parent for the returned event. When all parents
* of the returned event are freed, the returned event will also be
* freed.
*
* Returns: new Event structure pending in the queue or NULL if insufficent
* memory.
**/
Event *
event_new (const void *parent,
const char *name,
char **env)
{
Event *event;
nih_assert (name != NULL);
nih_assert (strlen (name) > 0);
event_init ();
event = nih_new (parent, Event);
if (! event)
return NULL;
nih_list_init (&event->entry);
event->session = NULL;
event->fd = -1;
event->progress = EVENT_PENDING;
event->failed = FALSE;
event->blockers = 0;
nih_list_init (&event->blocking);
nih_alloc_set_destructor (event, nih_list_destroy);
/* Fill in the event details */
event->name = nih_strdup (event, name);
if (! event->name) {
nih_free (event);
return NULL;
}
event->env = env;
if (event->env)
nih_ref (event->env, event);
/* Place it in the pending list */
nih_debug ("Pending %s event", name);
nih_list_add (events, &event->entry);
nih_main_loop_interrupt ();
return event;
}
/**
* event_block:
* @event: event to block.
*
* This function should be called by jobs that wish to hold a reference on
* the event and block it from finishing.
*
* Once the reference is no longer needed, you must call event_unblock()
* to allow the event to be finished, and potentially freed.
**/
void
event_block (Event *event)
{
nih_assert (event != NULL);
event->blockers++;
}
/**
* event_unblock:
* @event: event to unblock.
*
* This function should be called by jobs that are holding a reference on the
* event which blocks it from finishing, and wish to discard that reference.
*
* It must match a previous call to event_block().
**/
void
event_unblock (Event *event)
{
nih_assert (event != NULL);
nih_assert (event->blockers > 0);
event->blockers--;
}
/**
* event_poll:
*
* This function is used to process the list of events; any in the pending
* state are moved into the handling state and job states changed. Any
* in the finished state will have subscribers and jobs notified that the
* event has completed.
*
* Events remain in the handling state while they have blocking jobs.
*
* This function will only return once the events list is empty, or all
* events are in the handling state; so any time an event queues another,
* it will be processed immediately.
*
* Normally this function is used as a main loop callback.
**/
void
event_poll (void)
{
int poll_again;
event_init ();
do {
poll_again = FALSE;
NIH_LIST_FOREACH_SAFE (events, iter) {
Event *event = (Event *)iter;
/* Ignore events that we're handling and are
* blocked, there's nothing we can do to hurry them.
*
* Decide whether to poll again based on the state
* before handling the event; that way we always loop
* at least once more after finding a pending or
* finished event, in case they added new events as
* a side effect that we missed.
*/
switch (event->progress) {
case EVENT_PENDING:
event_pending (event);
poll_again = TRUE;
/* fall through */
case EVENT_HANDLING:
if (event->blockers)
break;
event->progress = EVENT_FINISHED;
/* fall through */
case EVENT_FINISHED:
event_finished (event);
poll_again = TRUE;
break;
default:
nih_assert_not_reached ();
}
}
} while (poll_again);
}
/**
* event_pending:
* @event: pending event.
*
* This function is called for each event in the list that is in the pending
* state. Subscribers to emitted events are notified, and the event is
* passed to the job system to start or stop any.
*
* The event is marked as handling; if no jobs took it, then it is
* immediately finished.
**/
static void
event_pending (Event *event)
{
nih_assert (event != NULL);
nih_assert (event->progress == EVENT_PENDING);
nih_info (_("Handling %s event"), event->name);
event->progress = EVENT_HANDLING;
event_pending_handle_jobs (event);
}
/**
* event_pending_handle_jobs:
* @event: event to be handled.
*
* This function is called whenever an event reaches the handling state.
* It iterates the list of jobs and stops or starts any necessary.
**/
static void
event_pending_handle_jobs (Event *event)
{
int empty = TRUE;
nih_assert (event != NULL);
job_class_init ();
NIH_HASH_FOREACH_SAFE (job_classes, iter) {
JobClass *class = (JobClass *)iter;
/* Only affect jobs within the same session as the event
* unless the event has no session, in which case do them
* all.
*/
if (event->session && (class->session != event->session))
continue;
/* We stop first so that if an event is listed both as a
* stop and start event, it causes an active running process
* to be killed, and then stop script then the start script
* to be run. In any other state, it has no special effect.
*
* (The other way around would be just strange, it'd cause
* a process's start and stop scripts to be run without the
* actual process).
*/
NIH_HASH_FOREACH_SAFE (class->instances, job_iter) {
Job *job = (Job *)job_iter;
if (job->stop_on
&& event_operator_handle (job->stop_on, event,
job->env)
&& job->stop_on->value) {
if (job->goal != JOB_STOP) {
size_t len = 0;
if (job->stop_env)
nih_unref (job->stop_env, job);
job->stop_env = NULL;
/* Collect environment that stopped
* the job for the pre-stop script;
* it can make a more informed
* decision whether the stop is valid.
* We don't add class environment
* since this is appended to the
* existing job environment.
*/
NIH_MUST (event_operator_environment (
job->stop_on, &job->stop_env,
job, &len, "UPSTART_STOP_EVENTS"));
job_finished (job, FALSE);
event_operator_events (
job->stop_on,
job, &job->blocking);
job_change_goal (job, JOB_STOP);
}
event_operator_reset (job->stop_on);
}
}
/* Now we match the start events for the class to see
* whether we need a new instance.
*/
if (class->start_on
&& event_operator_handle (class->start_on, event, NULL)
&& class->start_on->value) {
nih_local char **env = NULL;
nih_local char *name = NULL;
size_t len;
Job *job;
/* Construct the environment for the new instance
* from the class and the start events.
*/
env = NIH_MUST (job_class_environment (
NULL, class, &len));
NIH_MUST (event_operator_environment (class->start_on,
&env, NULL, &len,
"UPSTART_EVENTS"));
/* Expand the instance name against the environment */
name = NIH_SHOULD (environ_expand (NULL,
class->instance,
env));
if (! name) {
NihError *err;
err = nih_error_get ();
nih_warn (_("Failed to obtain %s instance: %s"),
class->name, err->message);
nih_free (err);
event_operator_reset (class->start_on);
continue;
}
/* Locate the current instance or create a new one */
job = (Job *)nih_hash_lookup (class->instances, name);
if (! job)
job = NIH_MUST (job_new (class, name));
nih_debug ("New instance %s", job_name (job));
/* Start the job with the environment we want */
if (job->goal != JOB_START) {
if (job->start_env)
nih_unref (job->start_env, job);
job->start_env = env;
nih_ref (job->start_env, job);
nih_discard (env);
env = NULL;
job_finished (job, FALSE);
NIH_MUST (event_operator_fds (class->start_on, job,
&job->fds, &job->num_fds,
&job->start_env, &len,
"UPSTART_FDS"));
event_operator_events (job->class->start_on,
job, &job->blocking);
job_change_goal (job, JOB_START);
}
event_operator_reset (class->start_on);
}
}
if (! quiesce_in_progress ())
return;
/* Determine if any job instances remain */
NIH_HASH_FOREACH_SAFE (job_classes, iter) {
JobClass *class = (JobClass *)iter;
NIH_HASH_FOREACH_SAFE (class->instances, job_iter) {
empty = FALSE;
break;
}
if (! empty)
break;
}
/* If no instances remain, force quiesce to finish */
if (empty)
quiesce_complete ();
}
/**
* event_finished:
* @event: finished event.
*
* This function is called for each event in the list that is in the finished
* state. Subscribers and jobs are notified, then, if the event failed, a
* new pending failed event is queued. Finally the event is freed and
* removed from the list.
**/
static void
event_finished (Event *event)
{
nih_assert (event != NULL);
nih_assert (event->progress == EVENT_FINISHED);
nih_debug ("Finished %s event", event->name);
NIH_LIST_FOREACH_SAFE (&event->blocking, iter) {
Blocked *blocked = (Blocked *)iter;
switch (blocked->type) {
case BLOCKED_JOB:
/* Event was blocking a job, let it enter the
* next state.
*/
blocked->job->blocker = NULL;
job_change_state (blocked->job,
job_next_state (blocked->job));
break;
case BLOCKED_EMIT_METHOD:
/* Event was blocking an emit method call, send
* the reply, or an error if the event failed.
*/
if (event->failed) {
NIH_ZERO (nih_dbus_message_error (
blocked->message,
DBUS_INTERFACE_UPSTART ".Error.EventFailed",
"%s", _("Event failed")));
} else {
NIH_ZERO (control_emit_event_reply (
blocked->message));
}
break;
default:
nih_assert_not_reached ();
}
nih_free (blocked);
}
close (event->fd);
if (event->failed) {
char *name;
name = strrchr (event->name, '/');
if ((! name) || strcmp (name, "/failed")) {
nih_local char *failed = NULL;
Event *new_event;
failed = NIH_MUST (nih_sprintf (NULL, "%s/failed",
event->name));
new_event = NIH_MUST (event_new (NULL, failed, NULL));
new_event->session = event->session;
if (event->env)
new_event->env = NIH_MUST (nih_str_array_copy (
new_event, NULL, event->env));
}
}
control_notify_event_emitted (event);
nih_free (event);
}
/**
* event_serialise:
* @event: event to serialise.
*
* Convert @event into a JSON representation for serialisation.
* Caller must free returned value using json_object_put().
*
* Note that event->blocking is NOT serialised. Instead, those objects
* which event->blocking refers to encode the fact that they are blocked
* on the event (index in the JSON) in question. Deserialisation
* restores event->blocking via a 2-pass technique. event->blockers is
* recorded to allow a double-check.
*
* Returns: JSON-serialised Event object, or NULL on error.
**/
json_object *
event_serialise (const Event *event)
{
json_object *json;
int session_index;
nih_assert (event);
nih_assert (event->name);
json = json_object_new_object ();
if (! json)
return NULL;
session_index = session_get_index (event->session);
if (session_index < 0)
goto error;
if (! state_set_json_int_var (json, "session", session_index))
goto error;
if (! state_set_json_string_var_from_obj (json, event, name))
goto error;
if (event->env) {
if (! state_set_json_str_array_from_obj (json, event, env))
goto error;
}
if (! state_set_json_int_var_from_obj (json, event, fd))
goto error;
if (! state_set_json_enum_var (json,
event_progress_enum_to_str,
"progress", event->progress))
goto error;
if (! state_set_json_int_var_from_obj (json, event, failed))
goto error;
if (! state_set_json_int_var_from_obj (json, event, blockers))
goto error;
if (! NIH_LIST_EMPTY (&event->blocking)) {
json_object *json_blocking;
json_blocking = state_serialise_blocking (&event->blocking);
if (! json_blocking)
goto error;
json_object_object_add (json, "blocking", json_blocking);
}
return json;
error:
json_object_put (json);
return NULL;
}
/**
* event_serialise_all:
*
* Convert existing Event objects to JSON representation.
*
* Returns: JSON object containing array of Events, or NULL on error.
**/
json_object *
event_serialise_all (void)
{
json_object *json;
event_init ();
json = json_object_new_array ();
if (! json)
return NULL;
NIH_LIST_FOREACH (events, iter) {
Event *event = (Event *)iter;
json_object *json_event;
json_event = event_serialise (event);
if (! json_event)
goto error;
json_object_array_add (json, json_event);
}
return json;
error:
json_object_put (json);
return NULL;
}
/**
* event_deserialise:
* @json: JSON-serialised Event object to deserialise.
*
* Convert @json into an Event object.
*
* Returns: Event object, or NULL on error.
**/
Event *
event_deserialise (json_object *json)
{
json_object *json_env;
Event *event = NULL;
nih_local char *name = NULL;
nih_local char **env = NULL;
int session_index = -1;
nih_assert (json);
if (! state_check_json_type (json, object))
return NULL;
if (! state_get_json_string_var_strict (json, "name", NULL, name))
goto error;
if (json_object_object_get (json, "env")) {
if (! state_get_json_var_full (json, "env", array, json_env))
goto error;
if (! state_deserialise_str_array (NULL, json_env, &env))
goto error;
}
event = event_new (NULL, name, env);
if (! event)
return NULL;
if (! state_get_json_int_var_to_obj (json, event, fd))
goto error;
if (! state_get_json_int_var (json, "session", session_index))
goto error;
/* can't check return value here (as all values are legitimate) */
event->session = session_from_index (session_index);
if (! state_get_json_enum_var (json,
event_progress_str_to_enum,
"progress", event->progress))
goto error;
if (! state_get_json_int_var_to_obj (json, event, failed))
goto error;
/* We can only set the blockers count in the scenario that
* EventOperators are serialised (since without this, it is not
* possible to manually reconstruct the state of the
* EventOperators post-re-exec.
*/
if (json_object_object_get (json, "blockers")) {
if (! state_get_json_int_var_to_obj (json, event, blockers))
goto error;
}
return event;
error:
nih_free (event);
return NULL;
}
/**
* event_deserialise_all:
*
* @json: root of JSON-serialised state.
*
* Convert JSON representation of events back into Event objects.
*
* Returns: 0 on success, -1 on error.
**/
int
event_deserialise_all (json_object *json)
{
Event *event;
nih_assert (json);
event_init ();
nih_assert (NIH_LIST_EMPTY (events));
json_events = json_object_object_get (json, "events");
if (! json_events)
goto error;
if (! state_check_json_type (json_events, array))
goto error;
for (int i = 0; i < json_object_array_length (json_events); i++) {
json_object *json_event;
json_event = json_object_array_get_idx (json_events, i);
if (! json_event)
goto error;
if (! state_check_json_type (json_event, object))
goto error;
event = event_deserialise (json_event);
if (! event)
goto error;
}
return 0;
error:
return -1;
}
/**
* event_progress_enum_to_str:
*
* @progress: event progress.
*
* Convert EventProgress to a string representation.
*
* Returns: string representation of @progress, or NULL if not known.
**/
static const char *
event_progress_enum_to_str (EventProgress progress)
{
state_enum_to_str (EVENT_PENDING, progress);
state_enum_to_str (EVENT_HANDLING, progress);
state_enum_to_str (EVENT_FINISHED, progress);
return NULL;
}
/**
* event_progress_str_to_enum:
*
* @: name of EventOperator value.
*
* Convert string representation of EventProgress into a
* real EventProgress value.
*
* Returns: EventProgress representing @progress, or -1 if not known.
**/
static EventProgress
event_progress_str_to_enum (const char *progress)
{
state_str_to_enum (EVENT_PENDING, progress);
state_str_to_enum (EVENT_HANDLING, progress);
state_str_to_enum (EVENT_FINISHED, progress);
return -1;
}
/**
* event_to_index:
*
* @event: event.
*
* Convert an Event to an index number within
* the list of events.
*
* Returns: event index, or -1 on error.
**/
int
event_to_index (const Event *event)
{
int event_index = 0;
int found = FALSE;
nih_assert (event);
event_init ();
NIH_LIST_FOREACH (events, iter) {
Event *tmp = (Event *)iter;
if (tmp == event) {
found = TRUE;
break;
}
event_index++;
}
if (! found)
return -1;
return event_index;
}
/**
* event_from_index:
*
* @event_index: event index number.
*
* Lookup Event based on index number.
*
* Returns: existing Event on success, or NULL if event not found.
**/
Event *
event_from_index (int event_index)
{
int i = 0;
nih_assert (event_index >= 0);
event_init ();
NIH_LIST_FOREACH (events, iter) {
Event *event = (Event *)iter;
if (i == event_index)
return event;
i++;
}
return NULL;
}
|