r 506 daemons/controld/controld_te_actions.c struct te_peer_s *r = NULL; r 512 daemons/controld/controld_te_actions.c r = g_hash_table_lookup(te_targets, target); r 513 daemons/controld/controld_te_actions.c if(r == NULL) { r 514 daemons/controld/controld_te_actions.c r = pcmk__assert_alloc(1, sizeof(struct te_peer_s)); r 515 daemons/controld/controld_te_actions.c r->name = pcmk__str_copy(target); r 516 daemons/controld/controld_te_actions.c g_hash_table_insert(te_targets, r->name, r); r 519 daemons/controld/controld_te_actions.c r->jobs += offset; r 521 daemons/controld/controld_te_actions.c r->migrate_jobs += offset; r 523 daemons/controld/controld_te_actions.c crm_trace("jobs[%s] = %d", target, r->jobs); r 577 daemons/controld/controld_te_actions.c struct te_peer_s *r = NULL; r 589 daemons/controld/controld_te_actions.c r = g_hash_table_lookup(te_targets, target); r 592 daemons/controld/controld_te_actions.c if(r == NULL) { r 593 daemons/controld/controld_te_actions.c r = pcmk__assert_alloc(1, sizeof(struct te_peer_s)); r 594 daemons/controld/controld_te_actions.c r->name = pcmk__str_copy(target); r 595 daemons/controld/controld_te_actions.c g_hash_table_insert(te_targets, r->name, r); r 598 daemons/controld/controld_te_actions.c if(limit <= r->jobs) { r 600 daemons/controld/controld_te_actions.c target, limit, r->jobs, id); r 603 daemons/controld/controld_te_actions.c } else if(graph->migration_limit > 0 && r->migrate_jobs >= graph->migration_limit) { r 607 daemons/controld/controld_te_actions.c target, graph->migration_limit, r->migrate_jobs, id); r 612 daemons/controld/controld_te_actions.c crm_trace("Peer %s has not hit their limit yet. current jobs = %d limit= %d limit", target, r->jobs, limit); r 390 daemons/controld/controld_throttle.c struct throttle_record_s *r = p; r 391 daemons/controld/controld_throttle.c free(r->node); r 392 daemons/controld/controld_throttle.c free(r); r 490 daemons/controld/controld_throttle.c struct throttle_record_s *r = NULL; r 494 daemons/controld/controld_throttle.c while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &r)) { r 495 daemons/controld/controld_throttle.c switch(r->mode) { r 527 daemons/controld/controld_throttle.c struct throttle_record_s *r = NULL; r 529 daemons/controld/controld_throttle.c r = g_hash_table_lookup(throttle_records, node); r 530 daemons/controld/controld_throttle.c if(r == NULL) { r 531 daemons/controld/controld_throttle.c r = pcmk__assert_alloc(1, sizeof(struct throttle_record_s)); r 532 daemons/controld/controld_throttle.c r->node = pcmk__str_copy(node); r 533 daemons/controld/controld_throttle.c r->mode = throttle_low; r 534 daemons/controld/controld_throttle.c r->max = throttle_job_max; r 537 daemons/controld/controld_throttle.c g_hash_table_insert(throttle_records, r->node, r); r 540 daemons/controld/controld_throttle.c switch(r->mode) { r 546 daemons/controld/controld_throttle.c jobs = QB_MAX(1, r->max / 4); r 549 daemons/controld/controld_throttle.c jobs = QB_MAX(1, r->max / 2); r 552 daemons/controld/controld_throttle.c jobs = QB_MAX(1, r->max); r 555 daemons/controld/controld_throttle.c crm_err("Unknown throttle mode %.4x on %s", r->mode, node); r 566 daemons/controld/controld_throttle.c struct throttle_record_s *r = NULL; r 572 daemons/controld/controld_throttle.c r = g_hash_table_lookup(throttle_records, from); r 574 daemons/controld/controld_throttle.c if(r == NULL) { r 575 daemons/controld/controld_throttle.c r = pcmk__assert_alloc(1, sizeof(struct throttle_record_s)); r 576 daemons/controld/controld_throttle.c r->node = pcmk__str_copy(from); r 577 daemons/controld/controld_throttle.c g_hash_table_insert(throttle_records, r->node, r); r 580 daemons/controld/controld_throttle.c r->max = max; r 581 daemons/controld/controld_throttle.c r->mode = (enum throttle_state_e) mode; r 1722 lib/common/iso8601.c #define do_cmp_field(l, r, field) \ r 1724 lib/common/iso8601.c if(l->field > r->field) { \ r 1726 lib/common/iso8601.c #field, l->field, r->field); \ r 1728 lib/common/iso8601.c } else if(l->field < r->field) { \ r 1730 lib/common/iso8601.c #field, l->field, r->field); \ r 101 lib/common/md5.c char *r = resbuf; r 102 lib/common/md5.c set_uint32 (r + 0 * sizeof ctx->A, SWAP (ctx->A)); r 103 lib/common/md5.c set_uint32 (r + 1 * sizeof ctx->B, SWAP (ctx->B)); r 104 lib/common/md5.c set_uint32 (r + 2 * sizeof ctx->C, SWAP (ctx->C)); r 105 lib/common/md5.c set_uint32 (r + 3 * sizeof ctx->D, SWAP (ctx->D)); r 297 lib/pacemaker/pcmk_sched_fencing.c for (GList *r = scheduler->priv->resources; r != NULL; r = r->next) { r 298 lib/pacemaker/pcmk_sched_fencing.c rsc_stonith_ordering((pcmk_resource_t *) r->data, stonith_op); r 1132 lib/pacemaker/pcmk_sched_instances.c #define display_role(r) \ r 1133 lib/pacemaker/pcmk_sched_instances.c (((r) == pcmk_role_unknown)? "matching" : pcmk_role_text(r)) r 427 lib/pacemaker/pcmk_sched_location.c pcmk_resource_t *r = iter->data; r 439 lib/pacemaker/pcmk_sched_location.c status = regexec(®ex, r->id, nregs, pmatch, 0); r 442 lib/pacemaker/pcmk_sched_location.c crm_debug("'%s' matched '%s' for %s", r->id, value, id); r 443 lib/pacemaker/pcmk_sched_location.c unpack_rsc_location(xml_obj, r, NULL, NULL, r->id, nregs, r 448 lib/pacemaker/pcmk_sched_location.c r->id, value, id); r 449 lib/pacemaker/pcmk_sched_location.c unpack_rsc_location(xml_obj, r, NULL, NULL, NULL, 0, NULL); r 452 lib/pacemaker/pcmk_sched_location.c crm_trace("'%s' does not match '%s' for %s", r->id, value, id); r 399 lib/pacemaker/pcmk_sched_nodes.c for (GList *r = scheduler->priv->resources; r != NULL; r = r->next) { r 400 lib/pacemaker/pcmk_sched_nodes.c pcmk_resource_t *rsc = (pcmk_resource_t *) r->data; r 590 lib/pengine/utils.c pcmk_resource_t *r = (pcmk_resource_t *) lpc->data; r 592 lib/pengine/utils.c pe__clear_resource_flags_recursive(r, flag); r 1605 tools/crm_resource_runtime.c #define waiting_for_starts(d, r, h) ((d != NULL) || \ r 1606 tools/crm_resource_runtime.c (!resource_is_running_on((r), (h))))