static int rsreader_set_granular_digest (resrc_api_ctx_t *rsapi, machs_t *machs, resrc_tree_t *rt, char **err_str) { char *e_str = NULL; const char *digest = NULL; int nsocks = 0, ncs = 0; int rc = -1; resrc_t *r = NULL; if (rt) { r = resrc_tree_resrc (rt); if (strcmp (resrc_type (r), "node")) { if (resrc_tree_num_children (rt)) { resrc_tree_list_t *children = resrc_tree_children (rt); if (children) { resrc_tree_t *child = resrc_tree_list_first (children); while (child) { rc = rsreader_set_granular_digest (rsapi, machs, child, err_str); if (rc) break; child = resrc_tree_list_next (children); } } } } else if (!find_all_sockets_cores (rsapi, r, &nsocks, &ncs)) { /* matches based on the hostname, number of sockets and * cores. This linking isn't used by hwloc reader so * count-based matching is okay */ digest = rs2rank_tab_eq_by_count(machs, resrc_name (r), nsocks, ncs); if (digest) { (void) resrc_set_digest (r, xasprintf ("%s", digest)); rc = 0; } else e_str = xasprintf ("%s: Can't find a matching resrc for " "<%s,%d,%d>", __FUNCTION__, resrc_name (r), nsocks, ncs); } } if (err_str) *err_str = e_str; else free (e_str); return rc; }
/* * select_resources() selects from the set of resource candidates the * best resources for the job. * * Inputs: found_tree - tree of resource tree candidates * resrc_reqst - the resources the job requests * selected_parent - parent of the selected resource tree * Returns: a resource tree of however many resources were selected */ resrc_tree_t *select_resources (flux_t *h, resrc_tree_t *found_tree, resrc_reqst_t *resrc_reqst, resrc_tree_t *selected_parent) { resrc_t *resrc; resrc_tree_list_t *children = NULL; resrc_tree_t *child_tree; resrc_tree_t *selected_tree = NULL; if (!resrc_reqst) { flux_log (h, LOG_ERR, "%s: called with empty request", __FUNCTION__); return NULL; } /* * A start time of zero is used to restrict the search to now * (appropriate for FCFS) and prevent any search into the future. */ if (resrc_reqst_set_starttime (resrc_reqst, 0) || resrc_reqst_set_endtime (resrc_reqst, 0)) return NULL; resrc = resrc_tree_resrc (found_tree); if (resrc_match_resource (resrc, resrc_reqst, true)) { if (resrc_reqst_num_children (resrc_reqst)) { if (resrc_tree_num_children (found_tree)) { selected_tree = resrc_tree_new (selected_parent, resrc); if (select_children (h, resrc_tree_children (found_tree), resrc_reqst_children (resrc_reqst), selected_tree)) { resrc_stage_resrc (resrc, resrc_reqst_reqrd_size (resrc_reqst), resrc_reqst_graph_reqs (resrc_reqst)); resrc_reqst_add_found (resrc_reqst, 1); flux_log (h, LOG_DEBUG, "selected %s", resrc_name (resrc)); } else { resrc_tree_destroy (selected_tree, false); } } } else { selected_tree = resrc_tree_new (selected_parent, resrc); resrc_stage_resrc (resrc, resrc_reqst_reqrd_size (resrc_reqst), resrc_reqst_graph_reqs (resrc_reqst)); resrc_reqst_add_found (resrc_reqst, 1); flux_log (h, LOG_DEBUG, "selected %s", resrc_name (resrc)); } } else if (resrc_tree_num_children (found_tree)) { /* * This clause visits the children of the current resource * searching for a match to the resource request. The selected * tree must be extended to include this intermediate * resource. * * This also allows the resource request to be sparsely * defined. E.g., it might only stipulate a node with 4 cores * and omit the intervening socket. */ selected_tree = resrc_tree_new (selected_parent, resrc); children = resrc_tree_children (found_tree); child_tree = resrc_tree_list_first (children); while (child_tree) { if (select_resources (h, child_tree, resrc_reqst, selected_tree) && resrc_reqst_nfound (resrc_reqst) >= resrc_reqst_reqrd_qty (resrc_reqst)) break; child_tree = resrc_tree_list_next (children); } } return selected_tree; }