pacemaker 2.1.5-a3f44794f94
Scalable High-Availability cluster resource manager
election.c
Go to the documentation of this file.
1/*
2 * Copyright 2004-2021 the Pacemaker project contributors
3 *
4 * The version control history for this file may have further details.
5 *
6 * This source code is licensed under the GNU Lesser General Public License
7 * version 2.1 or later (LGPLv2.1+) WITHOUT ANY WARRANTY.
8 */
9
10#include <crm_internal.h>
11
12#include <sys/time.h>
13#include <sys/resource.h>
14
15#include <crm/msg_xml.h>
16#include <crm/common/xml.h>
17
18#include <crm/common/mainloop.h>
21#include <crm/crm.h>
22
23#define STORM_INTERVAL 2 /* in seconds */
24
25struct election_s {
26 enum election_result state;
27 guint count; // How many times local node has voted
28 char *name; // Descriptive name for this election
29 char *uname; // Local node's name
30 GSourceFunc cb; // Function to call if election is won
31 GHashTable *voted; // Key = node name, value = how node voted
32 mainloop_timer_t *timeout; // When to abort if all votes not received
33 int election_wins; // Track wins, for storm detection
34 bool wrote_blackbox; // Write a storm blackbox at most once
35 time_t expires; // When storm detection period ends
36 time_t last_election_loss; // When dampening period ends
37};
38
39static void
40election_complete(election_t *e)
41{
42 e->state = election_won;
43 if (e->cb != NULL) {
44 e->cb(e);
45 }
47}
48
49static gboolean
50election_timer_cb(gpointer user_data)
51{
52 election_t *e = user_data;
53
54 crm_info("%s timed out, declaring local node as winner", e->name);
55 election_complete(e);
56 return FALSE;
57}
58
68{
69 return (e == NULL)? election_error : e->state;
70}
71
89election_init(const char *name, const char *uname, guint period_ms, GSourceFunc cb)
90{
91 election_t *e = NULL;
92
93 static guint count = 0;
94
95 CRM_CHECK(uname != NULL, return NULL);
96
97 e = calloc(1, sizeof(election_t));
98 if (e == NULL) {
99 crm_perror(LOG_CRIT, "Cannot create election");
100 return NULL;
101 }
102
103 e->uname = strdup(uname);
104 if (e->uname == NULL) {
105 crm_perror(LOG_CRIT, "Cannot create election");
106 free(e);
107 return NULL;
108 }
109
110 e->name = name? crm_strdup_printf("election-%s", name)
111 : crm_strdup_printf("election-%u", count++);
112 e->cb = cb;
113 e->timeout = mainloop_timer_add(e->name, period_ms, FALSE,
114 election_timer_cb, e);
115 crm_trace("Created %s", e->name);
116 return e;
117}
118
128void
130{
131 if ((e != NULL) && (uname != NULL) && (e->voted != NULL)) {
132 crm_trace("Discarding %s (no-)vote from lost peer %s", e->name, uname);
133 g_hash_table_remove(e->voted, uname);
134 }
135}
136
142void
144{
145 if (e != NULL) {
146 crm_trace("Resetting election %s", e->name);
147 mainloop_timer_stop(e->timeout);
148 if (e->voted) {
149 crm_trace("Destroying voted cache with %d members", g_hash_table_size(e->voted));
150 g_hash_table_destroy(e->voted);
151 e->voted = NULL;
152 }
153 }
154}
155
164void
166{
167 if (e != NULL) {
169 crm_trace("Destroying %s", e->name);
170 mainloop_timer_del(e->timeout);
171 free(e->uname);
172 free(e->name);
173 free(e);
174 }
175}
176
177static void
178election_timeout_start(election_t *e)
179{
180 if (e != NULL) {
181 mainloop_timer_start(e->timeout);
182 }
183}
184
190void
192{
193 if (e != NULL) {
194 mainloop_timer_stop(e->timeout);
195 }
196}
197
204void
206{
207 if (e != NULL) {
208 mainloop_timer_set_period(e->timeout, period);
209 } else {
210 crm_err("No election defined");
211 }
212}
213
214static int
215get_uptime(struct timeval *output)
216{
217 static time_t expires = 0;
218 static struct rusage info;
219
220 time_t tm_now = time(NULL);
221
222 if (expires < tm_now) {
223 int rc = 0;
224
225 info.ru_utime.tv_sec = 0;
226 info.ru_utime.tv_usec = 0;
227 rc = getrusage(RUSAGE_SELF, &info);
228
229 output->tv_sec = 0;
230 output->tv_usec = 0;
231
232 if (rc < 0) {
233 crm_perror(LOG_ERR, "Could not calculate the current uptime");
234 expires = 0;
235 return -1;
236 }
237
238 crm_debug("Current CPU usage is: %lds, %ldus", (long)info.ru_utime.tv_sec,
239 (long)info.ru_utime.tv_usec);
240 }
241
242 expires = tm_now + STORM_INTERVAL; /* N seconds after the last _access_ */
243 output->tv_sec = info.ru_utime.tv_sec;
244 output->tv_usec = info.ru_utime.tv_usec;
245
246 return 1;
247}
248
249static int
250compare_age(struct timeval your_age)
251{
252 struct timeval our_age;
253
254 get_uptime(&our_age); /* If an error occurred, our_age will be compared as {0,0} */
255
256 if (our_age.tv_sec > your_age.tv_sec) {
257 crm_debug("Win: %ld vs %ld (seconds)", (long)our_age.tv_sec, (long)your_age.tv_sec);
258 return 1;
259 } else if (our_age.tv_sec < your_age.tv_sec) {
260 crm_debug("Lose: %ld vs %ld (seconds)", (long)our_age.tv_sec, (long)your_age.tv_sec);
261 return -1;
262 } else if (our_age.tv_usec > your_age.tv_usec) {
263 crm_debug("Win: %ld.%06ld vs %ld.%06ld (usec)",
264 (long)our_age.tv_sec, (long)our_age.tv_usec, (long)your_age.tv_sec, (long)your_age.tv_usec);
265 return 1;
266 } else if (our_age.tv_usec < your_age.tv_usec) {
267 crm_debug("Lose: %ld.%06ld vs %ld.%06ld (usec)",
268 (long)our_age.tv_sec, (long)our_age.tv_usec, (long)your_age.tv_sec, (long)your_age.tv_usec);
269 return -1;
270 }
271
272 return 0;
273}
274
288void
290{
291 struct timeval age;
292 xmlNode *vote = NULL;
293 crm_node_t *our_node;
294
295 if (e == NULL) {
296 crm_trace("Election vote requested, but no election available");
297 return;
298 }
299
300 our_node = crm_get_peer(0, e->uname);
301 if ((our_node == NULL) || (crm_is_peer_active(our_node) == FALSE)) {
302 crm_trace("Cannot vote in %s yet: local node not connected to cluster",
303 e->name);
304 return;
305 }
306
308 e->state = election_in_progress;
309 vote = create_request(CRM_OP_VOTE, NULL, NULL, CRM_SYSTEM_CRMD, CRM_SYSTEM_CRMD, NULL);
310
311 e->count++;
312 crm_xml_add(vote, F_CRM_ELECTION_OWNER, our_node->uuid);
313 crm_xml_add_int(vote, F_CRM_ELECTION_ID, e->count);
314
315 get_uptime(&age);
317
318 send_cluster_message(NULL, crm_msg_crmd, vote, TRUE);
319 free_xml(vote);
320
321 crm_debug("Started %s round %d", e->name, e->count);
322 election_timeout_start(e);
323 return;
324}
325
341bool
343{
344 int voted_size = 0;
345 int num_members = 0;
346
347 if (e == NULL) {
348 crm_trace("Election check requested, but no election available");
349 return FALSE;
350 }
351 if (e->voted == NULL) {
352 crm_trace("%s check requested, but no votes received yet", e->name);
353 return FALSE;
354 }
355
356 voted_size = g_hash_table_size(e->voted);
357 num_members = crm_active_peers();
358
359 /* in the case of #voted > #members, it is better to
360 * wait for the timeout and give the cluster time to
361 * stabilize
362 */
363 if (voted_size >= num_members) {
364 /* we won and everyone has voted */
366 if (voted_size > num_members) {
367 GHashTableIter gIter;
368 const crm_node_t *node;
369 char *key = NULL;
370
371 crm_warn("Received too many votes in %s", e->name);
372 g_hash_table_iter_init(&gIter, crm_peer_cache);
373 while (g_hash_table_iter_next(&gIter, NULL, (gpointer *) & node)) {
374 if (crm_is_peer_active(node)) {
375 crm_warn("* expected vote: %s", node->uname);
376 }
377 }
378
379 g_hash_table_iter_init(&gIter, e->voted);
380 while (g_hash_table_iter_next(&gIter, (gpointer *) & key, NULL)) {
381 crm_warn("* actual vote: %s", key);
382 }
383
384 }
385
386 crm_info("%s won by local node", e->name);
387 election_complete(e);
388 return TRUE;
389
390 } else {
391 crm_debug("%s still waiting on %d of %d votes",
392 e->name, num_members - voted_size, num_members);
393 }
394
395 return FALSE;
396}
397
398#define LOSS_DAMPEN 2 /* in seconds */
399
400struct vote {
401 const char *op;
402 const char *from;
403 const char *version;
404 const char *election_owner;
405 int election_id;
406 struct timeval age;
407};
408
420static bool
421parse_election_message(election_t *e, xmlNode *message, struct vote *vote)
422{
423 CRM_CHECK(message && vote, return FALSE);
424
425 vote->election_id = -1;
426 vote->age.tv_sec = -1;
427 vote->age.tv_usec = -1;
428
429 vote->op = crm_element_value(message, F_CRM_TASK);
430 vote->from = crm_element_value(message, F_CRM_HOST_FROM);
431 vote->version = crm_element_value(message, F_CRM_VERSION);
432 vote->election_owner = crm_element_value(message, F_CRM_ELECTION_OWNER);
433
434 crm_element_value_int(message, F_CRM_ELECTION_ID, &(vote->election_id));
435
436 if ((vote->op == NULL) || (vote->from == NULL) || (vote->version == NULL)
437 || (vote->election_owner == NULL) || (vote->election_id < 0)) {
438
439 crm_warn("Invalid %s message from %s in %s ",
440 (vote->op? vote->op : "election"),
441 (vote->from? vote->from : "unspecified node"),
442 (e? e->name : "election"));
443 return FALSE;
444 }
445
446 // Op-specific validation
447
448 if (pcmk__str_eq(vote->op, CRM_OP_VOTE, pcmk__str_none)) {
449 // Only vote ops have uptime
451 F_CRM_ELECTION_AGE_US, &(vote->age));
452 if ((vote->age.tv_sec < 0) || (vote->age.tv_usec < 0)) {
453 crm_warn("Cannot count %s %s from %s because it is missing uptime",
454 (e? e->name : "election"), vote->op, vote->from);
455 return FALSE;
456 }
457
458 } else if (!pcmk__str_eq(vote->op, CRM_OP_NOVOTE, pcmk__str_none)) {
459 crm_info("Cannot process %s message from %s because %s is not a known election op",
460 (e? e->name : "election"), vote->from, vote->op);
461 return FALSE;
462 }
463
464 // Election validation
465
466 if (e == NULL) {
467 crm_info("Cannot count %s from %s because no election available",
468 vote->op, vote->from);
469 return FALSE;
470 }
471
472 /* If the membership cache is NULL, we REALLY shouldn't be voting --
473 * the question is how we managed to get here.
474 */
475 if (crm_peer_cache == NULL) {
476 crm_info("Cannot count %s %s from %s because no peer information available",
477 e->name, vote->op, vote->from);
478 return FALSE;
479 }
480 return TRUE;
481}
482
483static void
484record_vote(election_t *e, struct vote *vote)
485{
486 char *voter_copy = NULL;
487 char *vote_copy = NULL;
488
489 CRM_ASSERT(e && vote && vote->from && vote->op);
490 if (e->voted == NULL) {
491 e->voted = pcmk__strkey_table(free, free);
492 }
493
494 voter_copy = strdup(vote->from);
495 vote_copy = strdup(vote->op);
496 CRM_ASSERT(voter_copy && vote_copy);
497
498 g_hash_table_replace(e->voted, voter_copy, vote_copy);
499}
500
501static void
502send_no_vote(crm_node_t *peer, struct vote *vote)
503{
504 // @TODO probably shouldn't hardcode CRM_SYSTEM_CRMD and crm_msg_crmd
505
506 xmlNode *novote = create_request(CRM_OP_NOVOTE, NULL, vote->from,
508
509 crm_xml_add(novote, F_CRM_ELECTION_OWNER, vote->election_owner);
510 crm_xml_add_int(novote, F_CRM_ELECTION_ID, vote->election_id);
511
512 send_cluster_message(peer, crm_msg_crmd, novote, TRUE);
513 free_xml(novote);
514}
515
532election_count_vote(election_t *e, xmlNode *message, bool can_win)
533{
534 int log_level = LOG_INFO;
535 gboolean done = FALSE;
536 gboolean we_lose = FALSE;
537 const char *reason = "unknown";
538 bool we_are_owner = FALSE;
539 crm_node_t *our_node = NULL, *your_node = NULL;
540 time_t tm_now = time(NULL);
541 struct vote vote;
542
543 CRM_CHECK(message != NULL, return election_error);
544 if (parse_election_message(e, message, &vote) == FALSE) {
545 return election_error;
546 }
547
548 your_node = crm_get_peer(0, vote.from);
549 our_node = crm_get_peer(0, e->uname);
550 we_are_owner = (our_node != NULL)
551 && pcmk__str_eq(our_node->uuid, vote.election_owner,
553
554 if (!can_win) {
555 reason = "Not eligible";
556 we_lose = TRUE;
557
558 } else if (our_node == NULL || crm_is_peer_active(our_node) == FALSE) {
559 reason = "We are not part of the cluster";
560 log_level = LOG_ERR;
561 we_lose = TRUE;
562
563 } else if (we_are_owner && (vote.election_id != e->count)) {
564 log_level = LOG_TRACE;
565 reason = "Superseded";
566 done = TRUE;
567
568 } else if (your_node == NULL || crm_is_peer_active(your_node) == FALSE) {
569 /* Possibly we cached the message in the FSA queue at a point that it wasn't */
570 reason = "Peer is not part of our cluster";
571 log_level = LOG_WARNING;
572 done = TRUE;
573
574 } else if (pcmk__str_eq(vote.op, CRM_OP_NOVOTE, pcmk__str_none)
575 || pcmk__str_eq(vote.from, e->uname, pcmk__str_none)) {
576 /* Receiving our own broadcast vote, or a no-vote from peer, is a vote
577 * for us to win
578 */
579 if (!we_are_owner) {
580 crm_warn("Cannot count %s round %d %s from %s because we are not election owner (%s)",
581 e->name, vote.election_id, vote.op, vote.from,
582 vote.election_owner);
583 return election_error;
584 }
585 if (e->state != election_in_progress) {
586 // Should only happen if we already lost
587 crm_debug("Not counting %s round %d %s from %s because no election in progress",
588 e->name, vote.election_id, vote.op, vote.from);
589 return e->state;
590 }
591 record_vote(e, &vote);
592 reason = "Recorded";
593 done = TRUE;
594
595 } else {
596 // A peer vote requires a comparison to determine which node is better
597 int age_result = compare_age(vote.age);
598 int version_result = compare_version(vote.version, CRM_FEATURE_SET);
599
600 if (version_result < 0) {
601 reason = "Version";
602 we_lose = TRUE;
603
604 } else if (version_result > 0) {
605 reason = "Version";
606
607 } else if (age_result < 0) {
608 reason = "Uptime";
609 we_lose = TRUE;
610
611 } else if (age_result > 0) {
612 reason = "Uptime";
613
614 } else if (strcasecmp(e->uname, vote.from) > 0) {
615 reason = "Host name";
616 we_lose = TRUE;
617
618 } else {
619 reason = "Host name";
620 }
621 }
622
623 if (e->expires < tm_now) {
624 e->election_wins = 0;
625 e->expires = tm_now + STORM_INTERVAL;
626
627 } else if (done == FALSE && we_lose == FALSE) {
628 int peers = 1 + g_hash_table_size(crm_peer_cache);
629
630 /* If every node has to vote down every other node, thats N*(N-1) total elections
631 * Allow some leeway before _really_ complaining
632 */
633 e->election_wins++;
634 if (e->election_wins > (peers * peers)) {
635 crm_warn("%s election storm detected: %d wins in %d seconds",
636 e->name, e->election_wins, STORM_INTERVAL);
637 e->election_wins = 0;
638 e->expires = tm_now + STORM_INTERVAL;
639 if (e->wrote_blackbox == FALSE) {
640 /* It's questionable whether a black box (from every node in the
641 * cluster) would be truly helpful in diagnosing an election
642 * storm. It's also highly doubtful a production environment
643 * would get multiple election storms from distinct causes, so
644 * saving one blackbox per process lifetime should be
645 * sufficient. Alternatives would be to save a timestamp of the
646 * last blackbox write instead of a boolean, and write a new one
647 * if some amount of time has passed; or to save a storm count,
648 * write a blackbox on every Nth occurrence.
649 */
650 crm_write_blackbox(0, NULL);
651 e->wrote_blackbox = TRUE;
652 }
653 }
654 }
655
656 if (done) {
657 do_crm_log(log_level + 1,
658 "Processed %s round %d %s (current round %d) from %s (%s)",
659 e->name, vote.election_id, vote.op, e->count, vote.from,
660 reason);
661 return e->state;
662
663 } else if (we_lose == FALSE) {
664 /* We track the time of the last election loss to implement an election
665 * dampening period, reducing the likelihood of an election storm. If
666 * this node has lost within the dampening period, don't start a new
667 * election, even if we win against a peer's vote -- the peer we lost to
668 * should win again.
669 *
670 * @TODO This has a problem case: if an election winner immediately
671 * leaves the cluster, and a new election is immediately called, all
672 * nodes could lose, with no new winner elected. The ideal solution
673 * would be to tie the election structure with the peer caches, which
674 * would allow us to clear the dampening when the previous winner
675 * leaves (and would allow other improvements as well).
676 */
677 if ((e->last_election_loss == 0)
678 || ((tm_now - e->last_election_loss) > (time_t) LOSS_DAMPEN)) {
679
680 do_crm_log(log_level, "%s round %d (owner node ID %s) pass: %s from %s (%s)",
681 e->name, vote.election_id, vote.election_owner, vote.op,
682 vote.from, reason);
683
684 e->last_election_loss = 0;
686
687 /* Start a new election by voting down this, and other, peers */
688 e->state = election_start;
689 return e->state;
690 } else {
691 char *loss_time = ctime(&e->last_election_loss);
692
693 if (loss_time) {
694 // Show only HH:MM:SS
695 loss_time += 11;
696 loss_time[8] = '\0';
697 }
698 crm_info("Ignoring %s round %d (owner node ID %s) pass vs %s because we lost less than %ds ago at %s",
699 e->name, vote.election_id, vote.election_owner, vote.from,
700 LOSS_DAMPEN, (loss_time? loss_time : "unknown"));
701 }
702 }
703
704 e->last_election_loss = tm_now;
705
706 do_crm_log(log_level, "%s round %d (owner node ID %s) lost: %s from %s (%s)",
707 e->name, vote.election_id, vote.election_owner, vote.op,
708 vote.from, reason);
709
711 send_no_vote(your_node, &vote);
712 e->state = election_lost;
713 return e->state;
714}
715
721void
723{
724 e->last_election_loss = 0;
725}
const char * name
Definition: cib.c:24
GHashTable * crm_peer_cache
Definition: membership.c:36
@ crm_msg_crmd
Definition: cluster.h:108
gboolean send_cluster_message(crm_node_t *node, enum crm_ais_msg_types service, xmlNode *data, gboolean ordered)
Send an XML message via the cluster messaging layer.
Definition: cluster.c:133
crm_node_t * crm_get_peer(unsigned int id, const char *uname)
Get a cluster node cache entry.
Definition: membership.c:700
gboolean crm_is_peer_active(const crm_node_t *node)
Definition: membership.c:281
guint crm_active_peers(void)
Definition: membership.c:374
uint32_t version
Definition: remote.c:1
char * crm_strdup_printf(char const *format,...) G_GNUC_PRINTF(1
int compare_version(const char *version1, const char *version2)
Definition: utils.c:189
char uname[MAX_NAME]
Definition: cpg.c:5
A dumping ground.
#define CRM_SYSTEM_CRMD
Definition: crm.h:105
#define CRM_OP_VOTE
Definition: crm.h:136
#define CRM_FEATURE_SET
Definition: crm.h:69
#define CRM_OP_NOVOTE
Definition: crm.h:137
enum election_result election_count_vote(election_t *e, xmlNode *message, bool can_win)
Process an election message (vote or no-vote) from a peer.
Definition: election.c:532
void election_remove(election_t *e, const char *uname)
Disregard any previous vote by specified peer.
Definition: election.c:129
void election_fini(election_t *e)
Free an election object.
Definition: election.c:165
bool election_check(election_t *e)
Check whether local node has won an election.
Definition: election.c:342
#define LOSS_DAMPEN
Definition: election.c:398
void election_vote(election_t *e)
Start a new election by offering local node's candidacy.
Definition: election.c:289
void election_timeout_set_period(election_t *e, guint period)
Change an election's timeout (restarting timer if running)
Definition: election.c:205
election_t * election_init(const char *name, const char *uname, guint period_ms, GSourceFunc cb)
Create a new election object.
Definition: election.c:89
enum election_result election_state(election_t *e)
Get current state of an election.
Definition: election.c:67
void election_reset(election_t *e)
Stop election timer and disregard all votes.
Definition: election.c:143
#define STORM_INTERVAL
Definition: election.c:23
void election_timeout_stop(election_t *e)
Stop an election's timer, if running.
Definition: election.c:191
void election_clear_dampening(election_t *e)
Reset any election dampening currently in effect.
Definition: election.c:722
Functions for conducting elections.
struct election_s election_t
election_result
@ election_won
@ election_error
@ election_lost
@ election_in_progress
@ election_start
#define create_request(task, xml_data, host_to, sys_to, sys_from, uuid_from)
Definition: ipc.h:43
#define crm_info(fmt, args...)
Definition: logging.h:362
void crm_write_blackbox(int nsig, const struct qb_log_callsite *callsite)
Definition: logging.c:474
#define do_crm_log(level, fmt, args...)
Log a message.
Definition: logging.h:168
#define crm_warn(fmt, args...)
Definition: logging.h:360
#define crm_perror(level, fmt, args...)
Send a system error message to both the log and stderr.
Definition: logging.h:310
#define CRM_CHECK(expr, failure_action)
Definition: logging.h:227
#define crm_debug(fmt, args...)
Definition: logging.h:364
#define crm_err(fmt, args...)
Definition: logging.h:359
#define crm_trace(fmt, args...)
Definition: logging.h:365
#define LOG_TRACE
Definition: logging.h:37
Wrappers for and extensions to glib mainloop.
guint mainloop_timer_set_period(mainloop_timer_t *t, guint period_ms)
Definition: mainloop.c:1350
struct mainloop_timer_s mainloop_timer_t
Definition: mainloop.h:35
mainloop_timer_t * mainloop_timer_add(const char *name, guint period_ms, bool repeat, GSourceFunc cb, void *userdata)
Definition: mainloop.c:1366
void mainloop_timer_del(mainloop_timer_t *t)
Definition: mainloop.c:1387
void mainloop_timer_start(mainloop_timer_t *t)
Definition: mainloop.c:1330
void mainloop_timer_stop(mainloop_timer_t *t)
Definition: mainloop.c:1340
#define F_CRM_HOST_FROM
Definition: msg_xml.h:96
#define F_CRM_ELECTION_AGE_S
Definition: msg_xml.h:104
#define F_CRM_VERSION
Definition: msg_xml.h:98
#define F_CRM_ELECTION_OWNER
Definition: msg_xml.h:106
#define F_CRM_TASK
Definition: msg_xml.h:91
#define F_CRM_ELECTION_ID
Definition: msg_xml.h:103
#define F_CRM_ELECTION_AGE_US
Definition: msg_xml.h:105
const char * crm_element_value(const xmlNode *data, const char *name)
Retrieve the value of an XML attribute.
Definition: nvpair.c:517
const char * crm_xml_add_timeval(xmlNode *xml, const char *name_sec, const char *name_usec, const struct timeval *value)
Create XML attributes for seconds and microseconds.
Definition: nvpair.c:493
int crm_element_value_int(const xmlNode *data, const char *name, int *dest)
Retrieve the integer value of an XML attribute.
Definition: nvpair.c:553
const char * crm_xml_add_int(xmlNode *node, const char *name, int value)
Create an XML attribute with specified name and integer value.
Definition: nvpair.c:419
int crm_element_value_timeval(const xmlNode *data, const char *name_sec, const char *name_usec, struct timeval *dest)
Retrieve the value of XML second/microsecond attributes as time.
Definition: nvpair.c:667
const char * crm_xml_add(xmlNode *node, const char *name, const char *value)
Create an XML attribute with specified name and value.
Definition: nvpair.c:323
unsigned int timeout
Definition: pcmk_fence.c:32
#define CRM_ASSERT(expr)
Definition: results.h:42
GHashTable * pcmk__strkey_table(GDestroyNotify key_destroy_func, GDestroyNotify value_destroy_func)
Definition: strings.c:611
@ pcmk__str_none
char * uname
Definition: cluster.h:53
char * uuid
Definition: cluster.h:54
Wrappers for and extensions to libxml2.
void free_xml(xmlNode *child)
Definition: xml.c:885