r 552 crmd/te_actions.c struct te_peer_s *r = NULL; r 558 crmd/te_actions.c r = g_hash_table_lookup(te_targets, target); r 559 crmd/te_actions.c if(r == NULL) { r 560 crmd/te_actions.c r = calloc(1, sizeof(struct te_peer_s)); r 561 crmd/te_actions.c r->name = strdup(target); r 562 crmd/te_actions.c g_hash_table_insert(te_targets, r->name, r); r 565 crmd/te_actions.c r->jobs += offset; r 567 crmd/te_actions.c r->migrate_jobs += offset; r 569 crmd/te_actions.c crm_trace("jobs[%s] = %d", target, r->jobs); r 609 crmd/te_actions.c struct te_peer_s *r = NULL; r 621 crmd/te_actions.c r = g_hash_table_lookup(te_targets, target); r 624 crmd/te_actions.c if(r == NULL) { r 625 crmd/te_actions.c r = calloc(1, sizeof(struct te_peer_s)); r 626 crmd/te_actions.c r->name = strdup(target); r 627 crmd/te_actions.c g_hash_table_insert(te_targets, r->name, r); r 630 crmd/te_actions.c if(limit <= r->jobs) { r 632 crmd/te_actions.c target, limit, r->jobs, id); r 635 crmd/te_actions.c } else if(graph->migration_limit > 0 && r->migrate_jobs >= graph->migration_limit) { r 638 crmd/te_actions.c target, graph->migration_limit, r->migrate_jobs, id); r 643 crmd/te_actions.c crm_trace("Peer %s has not hit their limit yet. current jobs = %d limit= %d limit", target, r->jobs, limit); r 402 crmd/throttle.c struct throttle_record_s *r = p; r 403 crmd/throttle.c free(r->node); r 404 crmd/throttle.c free(r); r 474 crmd/throttle.c struct throttle_record_s *r = NULL; r 478 crmd/throttle.c while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &r)) { r 479 crmd/throttle.c switch(r->mode) { r 512 crmd/throttle.c struct throttle_record_s *r = NULL; r 514 crmd/throttle.c r = g_hash_table_lookup(throttle_records, node); r 515 crmd/throttle.c if(r == NULL) { r 516 crmd/throttle.c r = calloc(1, sizeof(struct throttle_record_s)); r 517 crmd/throttle.c r->node = strdup(node); r 518 crmd/throttle.c r->mode = throttle_low; r 519 crmd/throttle.c r->max = throttle_job_max; r 522 crmd/throttle.c g_hash_table_insert(throttle_records, r->node, r); r 525 crmd/throttle.c switch(r->mode) { r 531 crmd/throttle.c jobs = QB_MAX(1, r->max / 4); r 534 crmd/throttle.c jobs = QB_MAX(1, r->max / 2); r 537 crmd/throttle.c jobs = QB_MAX(1, r->max); r 540 crmd/throttle.c crm_err("Unknown throttle mode %.4x on %s", r->mode, node); r 551 crmd/throttle.c struct throttle_record_s *r = NULL; r 557 crmd/throttle.c r = g_hash_table_lookup(throttle_records, from); r 559 crmd/throttle.c if(r == NULL) { r 560 crmd/throttle.c r = calloc(1, sizeof(struct throttle_record_s)); r 561 crmd/throttle.c r->node = strdup(from); r 562 crmd/throttle.c g_hash_table_insert(throttle_records, r->node, r); r 565 crmd/throttle.c r->max = max; r 566 crmd/throttle.c r->mode = mode; r 1136 lib/common/iso8601.c #define do_cmp_field(l, r, field) \ r 1138 lib/common/iso8601.c if(l->field > r->field) { \ r 1140 lib/common/iso8601.c #field, l->field, r->field); \ r 1142 lib/common/iso8601.c } else if(l->field < r->field) { \ r 1144 lib/common/iso8601.c #field, l->field, r->field); \ r 97 lib/gnu/md5.c char *r = resbuf; r 98 lib/gnu/md5.c set_uint32 (r + 0 * sizeof ctx->A, SWAP (ctx->A)); r 99 lib/gnu/md5.c set_uint32 (r + 1 * sizeof ctx->B, SWAP (ctx->B)); r 100 lib/gnu/md5.c set_uint32 (r + 2 * sizeof ctx->C, SWAP (ctx->C)); r 101 lib/gnu/md5.c set_uint32 (r + 3 * sizeof ctx->D, SWAP (ctx->D)); r 682 pengine/constraints.c resource_t *r = rIter->data; r 694 pengine/constraints.c status = regexec(r_patt, r->id, nregs, pmatch, 0); r 698 pengine/constraints.c .string = r->id, r 704 pengine/constraints.c .params = r->parameters, r 705 pengine/constraints.c .meta = r->meta, r 707 pengine/constraints.c crm_debug("'%s' matched '%s' for %s", r->id, value, id); r 708 pengine/constraints.c unpack_rsc_location(xml_obj, r, NULL, NULL, data_set, &match_data); r 711 pengine/constraints.c crm_debug("'%s' is an inverted match of '%s' for %s", r->id, value, id); r 712 pengine/constraints.c unpack_rsc_location(xml_obj, r, NULL, NULL, data_set, NULL); r 715 pengine/constraints.c crm_trace("'%s' does not match '%s' for %s", r->id, value, id); r 786 pengine/constraints.c enum rsc_role_e r = text2role(role); r 787 pengine/constraints.c switch(r) { r 795 pengine/constraints.c location->role_filter = r; r 771 pengine/graph.c GListPtr r = NULL; r 774 pengine/graph.c for (r = data_set->resources; r != NULL; r = r->next) { r 775 pengine/graph.c rsc_stonith_ordering((resource_t *) r->data, stonith_op, data_set); r 922 tools/crm_resource.c resource_t *r = (resource_t *) lpc->data; r 924 tools/crm_resource.c clear_bit(r->flags, pe_rsc_allocating); r 933 tools/crm_resource.c resource_t *r = (resource_t *) lpc->data; r 935 tools/crm_resource.c clear_bit(r->flags, pe_rsc_allocating); r 360 tools/crm_resource_runtime.c resource_t *r = (resource_t *) lpc->data; r 362 tools/crm_resource_runtime.c clear_bit(r->flags, pe_rsc_allocating); r 1060 tools/crm_resource_runtime.c #define waiting_for_starts(d, r, h) ((g_list_length(d) > 0) || \ r 1061 tools/crm_resource_runtime.c (resource_is_running_on((r), (h)) == FALSE))