Searched refs:num_roots (Results 1 – 11 of 11) sorted by relevance
69 unsigned num_roots; member354 if (!p_updn->num_roots) { in updn_build_lid_matrices()501 p_updn->num_roots++; in updn_find_root_nodes_by_min_hop()564 updn->num_roots++; in rank_root_node()593 p_updn->num_roots = 0; in updn_lid_matrices()609 p_updn->num_roots > 1) in updn_lid_matrices()630 if (p_updn->num_roots) { in updn_lid_matrices()
3630 unsigned num_roots; in fabric_load_roots() local3649 num_roots = cl_list_count(p_ranking_bfs_list); in fabric_load_roots()3650 if (!num_roots) { in fabric_load_roots()3657 "Ranked %u valid root switches\n", num_roots); in fabric_load_roots()
501 unsigned PatFrag::num_roots() const { in num_roots() function in llvm::gi::PatFrag603 if (num_out_params() != 0 && num_roots() == 0) { in checkSemantics()608 if (num_roots() > 1) { in checkSemantics()740 assert(PF.num_roots() == 1); in getApplyDefsNeeded()
580 unsigned num_roots() const;590 bool canBeMatchRoot() const { return num_roots() == 1; } in canBeMatchRoot()
452 int i, num_roots, len, err; in xpcife_attach() local459 "root_num", "%d", &num_roots); in xpcife_attach()469 for (i = 0; i < num_roots; i++) { in xpcife_attach()
381 unsigned num_roots() const { return Roots.size(); } in num_roots() function
90 if (G.num_roots() == 0) { // Initialize the analysis by constructing in ExecuteWorkList()
2614 assert(TrimmedGraph->num_roots() == 1); in BugPathGetter()
5532 tdg->tdg_id, tdg->num_roots));5535 kmp_int32 this_num_roots = tdg->num_roots;5574 tdg->tdg_id, tdg->num_roots));5591 tdg->num_roots = -1;5678 tdg->num_roots = this_num_roots;
2643 kmp_int32 num_roots; // Number of roots tasks int the TDG member
1654 assert(PF.num_roots() == 1); in emitPatFragMatchPattern()