g 805 ompi/debuggers/ompi_msgq_dll.c group_t * g = comm->group; g 808 ompi/debuggers/ompi_msgq_dll.c for (i=0; i<g->entries; i++) g 809 ompi/debuggers/ompi_msgq_dll.c group_members[i] = g->local_to_global[i]; g 196 ompi/mca/common/ompio/common_ompio_aggregators.c int k=0, p=0, g=0; g 211 ompi/mca/common/ompio/common_ompio_aggregators.c for ( g=0; g<contg_groups[p].procs_per_contg_group; g++ ) { g 212 ompi/mca/common/ompio/common_ompio_aggregators.c k = g*num_groups+p; g 213 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_in_contg_group[g] = k; g 217 ompi/mca/common/ompio/common_ompio_aggregators.c for ( g=0; g<contg_groups[p].procs_per_contg_group; g++ ) { g 218 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_in_contg_group[g] = k; g 234 ompi/mca/common/ompio/common_ompio_aggregators.c int g = 0; g 287 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_in_contg_group[g] = start_offsets_lens[3*k + 2]; g 288 ompi/mca/common/ompio/common_ompio_aggregators.c g++; g 289 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_per_contg_group = g; g 294 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_in_contg_group[g] = start_offsets_lens[3*k + 2]; g 295 ompi/mca/common/ompio/common_ompio_aggregators.c g++; g 296 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_per_contg_group = g; g 301 ompi/mca/common/ompio/common_ompio_aggregators.c g = 0; g 303 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_in_contg_group[g] = start_offsets_lens[3*k + 2]; g 304 ompi/mca/common/ompio/common_ompio_aggregators.c g++; g 305 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_per_contg_group = g; g 329 ompi/mca/common/ompio/common_ompio_aggregators.c int g=0; g 400 ompi/mca/common/ompio/common_ompio_aggregators.c for ( g=1; g< contg_groups[k].procs_per_contg_group; g++ ) { g 423 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[k].procs_in_contg_group[g] = tmp_rank; g 1468 ompi/mca/common/ompio/common_ompio_aggregators.c double g=.0000119; g 1517 ompi/mca/common/ompio/common_ompio_aggregators.c g = .00000108; g 1519 ompi/mca/common/ompio/common_ompio_aggregators.c t_send = n_s * (L + 2 * o + (n_as -1) * g + (m_s - 1) * n_as * G); g 1520 ompi/mca/common/ompio/common_ompio_aggregators.c t_recv= n_r * (L + 2 * o + (n_ar -1) * g + (m_s - 1) * n_ar * G);; g 33 ompi/mpi/cxx/group.h inline Group(const Group& g) : pmpi_group(g.pmpi_group) { } g 35 ompi/mpi/cxx/group.h inline Group(const PMPI::Group& g) : pmpi_group(g) { } g 39 ompi/mpi/cxx/group.h Group& operator=(const Group& g) { g 40 ompi/mpi/cxx/group.h pmpi_group = g.pmpi_group; return *this; g 65 ompi/mpi/cxx/group.h inline Group(const Group& g) : mpi_group(g.mpi_group) { } g 69 ompi/mpi/cxx/group.h inline Group& operator=(const Group& g) { mpi_group = g.mpi_group; return *this; } g 87 ompi/mpi/fortran/mpif-h/grequest_start_f.c ompi_grequest_t *g = (ompi_grequest_t*) c_req; g 88 ompi/mpi/fortran/mpif-h/grequest_start_f.c g->greq_funcs_are_c = false; g 16 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! and the back-end OMPI implementation subroutine name (e.g., g 37 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! files (e.g., finalized_f08.F90) use the "mpi" module to get a g 44 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! the right types (e.g., convert MPI handles from comm to g 46 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! arrays* of handles (e.g., the sendtypes and recvtypes arrays g 11 ompi/mpi/fortran/use-mpi-tkr/mpi-f90-cptr-interfaces.h ! the TYPE(C_PTR) type, which not all Fortran compilers support (e.g., g 13 ompi/mpi/fortran/use-mpi-tkr/pmpi-f90-cptr-interfaces.h ! the TYPE(C_PTR) type, which not all Fortran compilers support (e.g., g 13 ompi/mpiext/example/use-mpi-f08/mpiext_example_usempif08.h ! first, so there's no need to re-define anything that's in there (e.g., g 13 ompi/mpiext/example/use-mpi/mpiext_example_usempi.h ! first, so there's no need to re-define anything that's in there (e.g., g 16 ompi/mpiext/pcollreq/use-mpi-f08/mpiext_pcollreq_usempif08.h ! first, so there's no need to re-define anything that's in there (e.g., g 16 ompi/mpiext/pcollreq/use-mpi/mpiext_pcollreq_usempi.h ! first, so there's no need to re-define anything that's in there (e.g., g 203 ompi/request/grequest.c ompi_grequest_t *g = (ompi_grequest_t*) request; g 213 ompi/request/grequest.c if (NULL != g->greq_query.c_query) { g 214 ompi/request/grequest.c if (g->greq_funcs_are_c) { g 215 ompi/request/grequest.c rc = g->greq_query.c_query(g->greq_state, status); g 219 ompi/request/grequest.c g->greq_query.f_query((MPI_Aint*)g->greq_state, fstatus, &ierr); g 437 opal/mca/btl/usnic/btl_usnic_proc.c opal_bp_graph_t *g = NULL; g 448 opal/mca/btl/usnic/btl_usnic_proc.c err = opal_bp_graph_create(NULL, NULL, &g); g 457 opal/mca/btl/usnic/btl_usnic_proc.c err = opal_bp_graph_add_vertex(g, g 468 opal/mca/btl/usnic/btl_usnic_proc.c err = opal_bp_graph_add_vertex(g, &proc->proc_modex[i], &idx); g 513 opal/mca/btl/usnic/btl_usnic_proc.c err = opal_bp_graph_add_edge(g, u, v, cost, g 523 opal/mca/btl/usnic/btl_usnic_proc.c *g_out = g; g 527 opal/mca/btl/usnic/btl_usnic_proc.c opal_bp_graph_free(g); g 551 opal/mca/btl/usnic/btl_usnic_proc.c opal_bp_graph_t *g = NULL; g 596 opal/mca/btl/usnic/btl_usnic_proc.c err = create_proc_module_graph(proc, proc_is_left, &g); g 603 opal/mca/btl/usnic/btl_usnic_proc.c err = opal_bp_graph_solve_bipartite_assignment(g, &nme, &me); g 612 opal/mca/btl/usnic/btl_usnic_proc.c err = opal_bp_graph_free(g); g 659 opal/mca/btl/usnic/btl_usnic_proc.c opal_bp_graph_free(g); g 147 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c struct timeval g; g 149 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g.tv_sec = 1; g 150 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g.tv_usec = 0; g 151 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c tick_len = &g; g 187 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c #define LOCK_GROUP(g) EVLOCK_LOCK((g)->lock, 0) g 188 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c #define UNLOCK_GROUP(g) EVLOCK_UNLOCK((g)->lock, 0) g 190 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c static int _bev_group_suspend_reading(struct bufferevent_rate_limit_group *g); g 191 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c static int _bev_group_suspend_writing(struct bufferevent_rate_limit_group *g); g 192 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c static void _bev_group_unsuspend_reading(struct bufferevent_rate_limit_group *g); g 193 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c static void _bev_group_unsuspend_writing(struct bufferevent_rate_limit_group *g); g 208 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c #define GROUP_SUSPENDED(g) \ g 209 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c (is_write ? (g)->write_suspended : (g)->read_suspended) g 231 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c struct bufferevent_rate_limit_group *g = g 234 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c LOCK_GROUP(g); g 235 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (GROUP_SUSPENDED(g)) { g 249 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c share = LIM(g->rate_limit) / g->n_members; g 250 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (share < g->min_share) g 251 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c share = g->min_share; g 253 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c UNLOCK_GROUP(g); g 352 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c _bev_group_suspend_reading(struct bufferevent_rate_limit_group *g) g 356 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->read_suspended = 1; g 357 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->pending_unsuspend_read = 0; g 365 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c TAILQ_FOREACH(bev, &g->members, rate_limiting->next_in_group) { g 377 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c _bev_group_suspend_writing(struct bufferevent_rate_limit_group *g) g 381 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->write_suspended = 1; g 382 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->pending_unsuspend_write = 0; g 383 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c TAILQ_FOREACH(bev, &g->members, rate_limiting->next_in_group) { g 475 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c first = _bev_group_random_element(g); \ g 476 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c for (bev = first; bev != TAILQ_END(&g->members); \ g 480 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c for (bev = TAILQ_FIRST(&g->members); bev && bev != first; \ g 487 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c _bev_group_unsuspend_reading(struct bufferevent_rate_limit_group *g) g 492 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->read_suspended = 0; g 502 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->pending_unsuspend_read = again; g 506 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c _bev_group_unsuspend_writing(struct bufferevent_rate_limit_group *g) g 510 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->write_suspended = 0; g 521 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->pending_unsuspend_write = again; g 530 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c struct bufferevent_rate_limit_group *g = arg; g 534 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c event_base_gettimeofday_cached(event_get_base(&g->master_refill_event), &now); g 536 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c LOCK_GROUP(g); g 538 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c tick = ev_token_bucket_get_tick(&now, &g->rate_limit_cfg); g 539 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c ev_token_bucket_update(&g->rate_limit, &g->rate_limit_cfg, tick); g 541 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (g->pending_unsuspend_read || g 542 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c (g->read_suspended && (g->rate_limit.read_limit >= g->min_share))) { g 543 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c _bev_group_unsuspend_reading(g); g 545 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (g->pending_unsuspend_write || g 546 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c (g->write_suspended && (g->rate_limit.write_limit >= g->min_share))){ g 547 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c _bev_group_unsuspend_writing(g); g 555 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c UNLOCK_GROUP(g); g 641 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c struct bufferevent_rate_limit_group *g; g 648 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g = mm_calloc(1, sizeof(struct bufferevent_rate_limit_group)); g 649 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (!g) g 651 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c memcpy(&g->rate_limit_cfg, cfg, sizeof(g->rate_limit_cfg)); g 652 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c TAILQ_INIT(&g->members); g 654 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c ev_token_bucket_init(&g->rate_limit, cfg, tick, 0); g 656 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c event_assign(&g->master_refill_event, base, -1, EV_PERSIST, g 657 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c _bev_group_refill_callback, g); g 659 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c event_add(&g->master_refill_event, &cfg->tick_timeout); g 661 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c EVTHREAD_ALLOC_LOCK(g->lock, EVTHREAD_LOCKTYPE_RECURSIVE); g 663 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c bufferevent_rate_limit_group_set_min_share(g, 64); g 665 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c return g; g 670 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c struct bufferevent_rate_limit_group *g, g 674 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (!g || !cfg) g 677 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c LOCK_GROUP(g); g 679 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c &g->rate_limit_cfg.tick_timeout, &cfg->tick_timeout, ==); g 680 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c memcpy(&g->rate_limit_cfg, cfg, sizeof(g->rate_limit_cfg)); g 682 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (g->rate_limit.read_limit > (ev_ssize_t)cfg->read_maximum) g 683 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->rate_limit.read_limit = cfg->read_maximum; g 684 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (g->rate_limit.write_limit > (ev_ssize_t)cfg->write_maximum) g 685 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->rate_limit.write_limit = cfg->write_maximum; g 689 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c event_add(&g->master_refill_event, &cfg->tick_timeout); g 693 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c bufferevent_rate_limit_group_set_min_share(g, g->configured_min_share); g 695 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c UNLOCK_GROUP(g); g 701 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c struct bufferevent_rate_limit_group *g, g 707 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->configured_min_share = share; g 711 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (share > g->rate_limit_cfg.read_rate) g 712 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c share = g->rate_limit_cfg.read_rate; g 713 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (share > g->rate_limit_cfg.write_rate) g 714 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c share = g->rate_limit_cfg.write_rate; g 716 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c g->min_share = share; g 721 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c bufferevent_rate_limit_group_free(struct bufferevent_rate_limit_group *g) g 723 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c LOCK_GROUP(g); g 724 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c EVUTIL_ASSERT(0 == g->n_members); g 725 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c event_del(&g->master_refill_event); g 726 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c UNLOCK_GROUP(g); g 727 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c EVTHREAD_FREE_LOCK(g->lock, EVTHREAD_LOCKTYPE_RECURSIVE); g 728 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c mm_free(g); g 733 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c struct bufferevent_rate_limit_group *g) g 752 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c if (bevp->rate_limiting->group == g) { g 759 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c LOCK_GROUP(g); g 760 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c bevp->rate_limiting->group = g; g 761 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c ++g->n_members; g 762 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c TAILQ_INSERT_TAIL(&g->members, bevp, rate_limiting->next_in_group); g 764 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c rsuspend = g->read_suspended; g 765 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c wsuspend = g->write_suspended; g 767 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c UNLOCK_GROUP(g); g 792 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c struct bufferevent_rate_limit_group *g = g 794 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c LOCK_GROUP(g); g 796 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c --g->n_members; g 797 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c TAILQ_REMOVE(&g->members, bevp, rate_limiting->next_in_group); g 798 opal/mca/event/libevent2022/libevent/bufferevent_ratelim.c UNLOCK_GROUP(g); g 120 opal/util/bipartite_graph.c static int get_capacity(opal_bp_graph_t *g, int source, int target) g 124 opal/util/bipartite_graph.c CHECK_VERTEX_RANGE(g, source); g 125 opal/util/bipartite_graph.c CHECK_VERTEX_RANGE(g, target); g 127 opal/util/bipartite_graph.c FOREACH_OUT_EDGE(g, source, e) { g 138 opal/util/bipartite_graph.c set_capacity(opal_bp_graph_t *g, int source, int target, int cap) g 142 opal/util/bipartite_graph.c CHECK_VERTEX_RANGE(g, source); g 143 opal/util/bipartite_graph.c CHECK_VERTEX_RANGE(g, target); g 145 opal/util/bipartite_graph.c FOREACH_OUT_EDGE(g, source, e) { g 156 opal/util/bipartite_graph.c static void free_vertex(opal_bp_graph_t *g, g 160 opal/util/bipartite_graph.c if (NULL != g->v_data_cleanup_fn && NULL != v->v_data) { g 161 opal/util/bipartite_graph.c g->v_data_cleanup_fn(v->v_data); g 172 opal/util/bipartite_graph.c opal_bp_graph_t *g = NULL; g 179 opal/util/bipartite_graph.c g = calloc(1, sizeof(*g)); g 180 opal/util/bipartite_graph.c if (NULL == g) { g 186 opal/util/bipartite_graph.c g->source_idx = -1; g 187 opal/util/bipartite_graph.c g->sink_idx = -1; g 189 opal/util/bipartite_graph.c g->v_data_cleanup_fn = v_data_cleanup_fn; g 190 opal/util/bipartite_graph.c g->e_data_cleanup_fn = e_data_cleanup_fn; g 193 opal/util/bipartite_graph.c OBJ_CONSTRUCT(&g->vertices, opal_pointer_array_t); g 194 opal/util/bipartite_graph.c err = opal_pointer_array_init(&g->vertices, 0, INT_MAX, 32); g 199 opal/util/bipartite_graph.c *g_out = g; g 203 opal/util/bipartite_graph.c free(g); g 207 opal/util/bipartite_graph.c int opal_bp_graph_free(opal_bp_graph_t *g) g 214 opal/util/bipartite_graph.c for (i = 0; i < NUM_VERTICES(g); ++i) { g 215 opal/util/bipartite_graph.c v = V_ID_TO_PTR(g, i); g 223 opal/util/bipartite_graph.c for (i = 0; i < NUM_VERTICES(g); ++i) { g 224 opal/util/bipartite_graph.c v = V_ID_TO_PTR(g, i); g 229 opal/util/bipartite_graph.c if (NULL != g->e_data_cleanup_fn && NULL != e->e_data) { g 230 opal/util/bipartite_graph.c g->e_data_cleanup_fn(e->e_data); g 235 opal/util/bipartite_graph.c free_vertex(g, V_ID_TO_PTR(g, i)); g 236 opal/util/bipartite_graph.c opal_pointer_array_set_item(&g->vertices, i, NULL); g 238 opal/util/bipartite_graph.c g->num_vertices = 0; g 240 opal/util/bipartite_graph.c OBJ_DESTRUCT(&g->vertices); g 241 opal/util/bipartite_graph.c free(g); g 246 opal/util/bipartite_graph.c int opal_bp_graph_clone(const opal_bp_graph_t *g, g 276 opal/util/bipartite_graph.c for (i = 0; i < NUM_VERTICES(g); ++i) { g 286 opal/util/bipartite_graph.c for (i = 0; i < NUM_VERTICES(g); ++i) { g 287 opal/util/bipartite_graph.c FOREACH_OUT_EDGE(g, i, e) { g 307 opal/util/bipartite_graph.c int opal_bp_graph_indegree(const opal_bp_graph_t *g, g 312 opal/util/bipartite_graph.c v = V_ID_TO_PTR(g, vertex); g 316 opal/util/bipartite_graph.c int opal_bp_graph_outdegree(const opal_bp_graph_t *g, g 321 opal/util/bipartite_graph.c v = V_ID_TO_PTR(g, vertex); g 325 opal/util/bipartite_graph.c int opal_bp_graph_add_edge(opal_bp_graph_t *g, g 335 opal/util/bipartite_graph.c if (from < 0 || from >= NUM_VERTICES(g)) { g 338 opal/util/bipartite_graph.c if (to < 0 || to >= NUM_VERTICES(g)) { g 349 opal/util/bipartite_graph.c FOREACH_OUT_EDGE(g, from, e) { g 369 opal/util/bipartite_graph.c v_from = V_ID_TO_PTR(g, from); g 373 opal/util/bipartite_graph.c v_to = V_ID_TO_PTR(g, to); g 379 opal/util/bipartite_graph.c int opal_bp_graph_add_vertex(opal_bp_graph_t *g, g 393 opal/util/bipartite_graph.c v->v_index = opal_pointer_array_add(&g->vertices, v); g 399 opal/util/bipartite_graph.c assert(v->v_index == g->num_vertices); g 401 opal/util/bipartite_graph.c ++g->num_vertices; g 414 opal/util/bipartite_graph.c int opal_bp_graph_order(const opal_bp_graph_t *g) g 416 opal/util/bipartite_graph.c return NUM_VERTICES(g); g 610 opal/util/bipartite_graph.c int opal_bp_graph_bipartite_to_flow(opal_bp_graph_t *g) g 618 opal/util/bipartite_graph.c order = opal_bp_graph_order(g); g 620 opal/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, &g->source_idx); g 624 opal/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, &g->sink_idx); g 639 opal/util/bipartite_graph.c int inbound = opal_bp_graph_indegree(g, u); g 640 opal/util/bipartite_graph.c int outbound = opal_bp_graph_outdegree(g, u); g 650 opal/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, u, g->sink_idx, g 662 opal/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, g->source_idx, u, g 684 opal/util/bipartite_graph.c order = opal_bp_graph_order(g); /* need residuals for newly created g 688 opal/util/bipartite_graph.c FOREACH_OUT_EDGE(g, u, e_ptr) { g 694 opal/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, v, u, g 837 opal/util/bipartite_graph.c int opal_bp_graph_solve_bipartite_assignment(const opal_bp_graph_t *g, g 855 opal/util/bipartite_graph.c err = opal_bp_graph_clone(g, false, &gx); g 894 opal/util/bipartite_graph.c n = opal_bp_graph_order(g); g 59 opal/util/bipartite_graph.h int opal_bp_graph_free(opal_bp_graph_t *g); g 73 opal/util/bipartite_graph.h int opal_bp_graph_clone(const opal_bp_graph_t *g, g 84 opal/util/bipartite_graph.h int opal_bp_graph_indegree(const opal_bp_graph_t *g, g 94 opal/util/bipartite_graph.h int opal_bp_graph_outdegree(const opal_bp_graph_t *g, g 109 opal/util/bipartite_graph.h int opal_bp_graph_add_edge(opal_bp_graph_t *g, g 125 opal/util/bipartite_graph.h int opal_bp_graph_add_vertex(opal_bp_graph_t *g, g 134 opal/util/bipartite_graph.h int opal_bp_graph_order(const opal_bp_graph_t *g); g 160 opal/util/bipartite_graph.h int opal_bp_graph_solve_bipartite_assignment(const opal_bp_graph_t *g, g 96 opal/util/bipartite_graph_internal.h #define NUM_VERTICES(g) (g->num_vertices) g 98 opal/util/bipartite_graph_internal.h #define CHECK_VERTEX_RANGE(g,v) \ g 101 opal/util/bipartite_graph_internal.h (v) >= NUM_VERTICES(g)) { \ g 108 opal/util/bipartite_graph_internal.h #define V_ID_TO_PTR(g, v_id) \ g 110 opal/util/bipartite_graph_internal.h opal_pointer_array_get_item((opal_pointer_array_t *)&g->vertices, v_id)) g 112 opal/util/bipartite_graph_internal.h #define FOREACH_OUT_EDGE(g,v_id,e_ptr) \ g 114 opal/util/bipartite_graph_internal.h &(V_ID_TO_PTR(g, v_id)->out_edges), \ g 118 opal/util/bipartite_graph_internal.h #define FOREACH_IN_EDGE(g,v_id,e_ptr) \ g 120 opal/util/bipartite_graph_internal.h &(V_ID_TO_PTR(g, v_id)->in_edges), \ g 138 opal/util/bipartite_graph_internal.h int opal_bp_graph_bipartite_to_flow(opal_bp_graph_t *g); g 60 test/util/bipartite_graph.c #define check_graph_is_consistent(g) \ g 62 test/util/bipartite_graph.c check(opal_bp_graph_order(g) <= opal_pointer_array_get_size(&g->vertices)); \ g 63 test/util/bipartite_graph.c check(g->source_idx >= -1 || g->source_idx < opal_bp_graph_order(g)); \ g 64 test/util/bipartite_graph.c check(g->sink_idx >= -1 || g->sink_idx < opal_bp_graph_order(g)); \ g 67 test/util/bipartite_graph.c #define check_has_in_out_degree(g, u, expected_indegree, expected_outdegree) \ g 69 test/util/bipartite_graph.c check_int_eq(opal_bp_graph_indegree(g, (u)), expected_indegree); \ g 70 test/util/bipartite_graph.c check_int_eq(opal_bp_graph_outdegree(g, (u)), expected_outdegree); \ g 149 test/util/bipartite_graph.c opal_bp_graph_t *g; g 156 test/util/bipartite_graph.c g = NULL; g 157 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 159 test/util/bipartite_graph.c check(g != NULL); g 160 test/util/bipartite_graph.c check(opal_bp_graph_order(g) == 0); g 161 test/util/bipartite_graph.c check_graph_is_consistent(g); g 162 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 166 test/util/bipartite_graph.c g = NULL; g 167 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 169 test/util/bipartite_graph.c check(g != NULL); g 170 test/util/bipartite_graph.c check_graph_is_consistent(g); g 173 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, &user_data, &index); g 177 test/util/bipartite_graph.c check(opal_bp_graph_order(g) == 4); g 178 test/util/bipartite_graph.c check_graph_is_consistent(g); g 179 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 183 test/util/bipartite_graph.c g = NULL; g 186 test/util/bipartite_graph.c err = opal_bp_graph_create(&v_cleanup, &e_cleanup, &g); g 188 test/util/bipartite_graph.c check(g != NULL); g 189 test/util/bipartite_graph.c check_graph_is_consistent(g); g 191 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, &user_data, &index); g 195 test/util/bipartite_graph.c check(opal_bp_graph_order(g) == 5); g 196 test/util/bipartite_graph.c check_graph_is_consistent(g); g 197 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/1, g 199 test/util/bipartite_graph.c check_graph_is_consistent(g); g 202 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 212 test/util/bipartite_graph.c opal_bp_graph_t *g, *gx; g 219 test/util/bipartite_graph.c g = NULL; g 222 test/util/bipartite_graph.c err = opal_bp_graph_create(&v_cleanup, &e_cleanup, &g); g 224 test/util/bipartite_graph.c check(g != NULL); g 225 test/util/bipartite_graph.c check_graph_is_consistent(g); g 229 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, &user_data, &index); g 232 test/util/bipartite_graph.c check(opal_bp_graph_order(g) == 5); g 233 test/util/bipartite_graph.c check_graph_is_consistent(g); g 236 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/1, g 239 test/util/bipartite_graph.c check_graph_is_consistent(g); g 240 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/3, /*v=*/1, /*cost=*/2, g 243 test/util/bipartite_graph.c check_graph_is_consistent(g); g 247 test/util/bipartite_graph.c err = opal_bp_graph_clone(g, /*copy_user_data=*/false, &gx); g 256 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 266 test/util/bipartite_graph.c opal_bp_graph_t *g; g 271 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 273 test/util/bipartite_graph.c check(g != NULL); g 276 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 279 test/util/bipartite_graph.c check(opal_bp_graph_indegree(g, i) == 0); g 280 test/util/bipartite_graph.c check(opal_bp_graph_outdegree(g, i) == 0); g 283 test/util/bipartite_graph.c check(opal_bp_graph_order(g) == 4); g 285 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/2, /*cost=*/2, g 287 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/1, /*cost=*/2, g 290 test/util/bipartite_graph.c check(opal_bp_graph_indegree(g, 0) == 0); g 291 test/util/bipartite_graph.c check(opal_bp_graph_outdegree(g, 0) == 2); g 292 test/util/bipartite_graph.c check(opal_bp_graph_indegree(g, 1) == 1); g 293 test/util/bipartite_graph.c check(opal_bp_graph_outdegree(g, 1) == 0); g 294 test/util/bipartite_graph.c check(opal_bp_graph_indegree(g, 2) == 1); g 295 test/util/bipartite_graph.c check(opal_bp_graph_outdegree(g, 2) == 0); g 296 test/util/bipartite_graph.c check(opal_bp_graph_indegree(g, 3) == 0); g 297 test/util/bipartite_graph.c check(opal_bp_graph_outdegree(g, 3) == 0); g 299 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 307 test/util/bipartite_graph.c opal_bp_graph_t *g; g 320 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 322 test/util/bipartite_graph.c check(g != NULL); g 325 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 329 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/2, /*cost=*/10, g 331 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/3, /*cost=*/2, g 335 test/util/bipartite_graph.c err = opal_bp_graph_solve_bipartite_assignment(g, g 345 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 355 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 357 test/util/bipartite_graph.c check(g != NULL); g 360 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 364 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/10, g 367 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/4, /*cost=*/2, g 370 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/4, /*cost=*/1, g 375 test/util/bipartite_graph.c err = opal_bp_graph_solve_bipartite_assignment(g, g 386 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 397 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 399 test/util/bipartite_graph.c check(g != NULL); g 402 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 406 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/2, /*cost=*/10, g 409 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/1, g 412 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/3, /*cost=*/5, g 417 test/util/bipartite_graph.c err = opal_bp_graph_solve_bipartite_assignment(g, g 428 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 438 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 440 test/util/bipartite_graph.c check(g != NULL); g 443 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 447 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/2, /*cost=*/10, g 450 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/2, /*cost=*/1, g 453 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/3, /*cost=*/5, g 458 test/util/bipartite_graph.c err = opal_bp_graph_solve_bipartite_assignment(g, g 469 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 479 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 481 test/util/bipartite_graph.c check(g != NULL); g 484 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 488 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/2, /*cost=*/-1, g 491 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/-10, g 494 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/3, /*cost=*/-5, g 499 test/util/bipartite_graph.c err = opal_bp_graph_solve_bipartite_assignment(g, g 510 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 522 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 524 test/util/bipartite_graph.c check(g != NULL); g 527 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 531 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/2, /*cost=*/-1, g 534 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/-10, g 537 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/3, /*cost=*/-5, g 542 test/util/bipartite_graph.c err = opal_bp_graph_solve_bipartite_assignment(g, g 553 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 564 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 566 test/util/bipartite_graph.c check(g != NULL); g 569 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 573 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/2, /*cost=*/-4294967296, g 576 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/2, /*cost=*/-4294967296, g 579 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/-4294967296, g 582 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/3, /*cost=*/-4294967296, g 587 test/util/bipartite_graph.c err = opal_bp_graph_solve_bipartite_assignment(g, g 603 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 612 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 614 test/util/bipartite_graph.c check(g != NULL); g 617 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 621 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/2, /*cost=*/-100, g 623 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/2, /*cost=*/-100, g 627 test/util/bipartite_graph.c err = opal_bp_graph_solve_bipartite_assignment(g, g 636 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 651 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 653 test/util/bipartite_graph.c check(g != NULL); g 656 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 660 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/10, g 663 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/4, /*cost=*/2, g 666 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/4, /*cost=*/1, g 671 test/util/bipartite_graph.c err = opal_bp_graph_solve_bipartite_assignment(g, g 682 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 698 test/util/bipartite_graph.c opal_bp_graph_t *g; g 713 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 715 test/util/bipartite_graph.c check(g != NULL); g 718 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 722 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/2, /*cost=*/10, g 725 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/3, /*cost=*/2, g 728 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/4, /*v=*/0, /*cost=*/0, g 731 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/4, /*v=*/1, /*cost=*/0, g 734 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/5, /*cost=*/0, g 737 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/3, /*v=*/5, /*cost=*/0, g 743 test/util/bipartite_graph.c path_found = opal_bp_graph_bellman_ford(g, /*source=*/4, /*target=*/5, pred); g 751 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 762 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 764 test/util/bipartite_graph.c check(g != NULL); g 767 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 771 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/10, g 774 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/4, /*cost=*/2, g 777 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/4, /*cost=*/1, g 781 test/util/bipartite_graph.c err = opal_bp_graph_bipartite_to_flow(g); g 786 test/util/bipartite_graph.c path_found = opal_bp_graph_bellman_ford(g, /*source=*/5, /*target=*/6, pred); g 788 test/util/bipartite_graph.c check_int_eq(g->source_idx, 5); g 789 test/util/bipartite_graph.c check_int_eq(g->sink_idx, 6); g 796 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 806 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 808 test/util/bipartite_graph.c check(g != NULL); g 811 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 815 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/INT32_MAX+10LL, g 818 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/4, /*cost=*/INT32_MAX+2LL, g 821 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/4, /*cost=*/INT32_MAX+1LL, g 825 test/util/bipartite_graph.c err = opal_bp_graph_bipartite_to_flow(g); g 830 test/util/bipartite_graph.c path_found = opal_bp_graph_bellman_ford(g, /*source=*/5, /*target=*/6, pred); g 832 test/util/bipartite_graph.c check_int_eq(g->source_idx, 5); g 833 test/util/bipartite_graph.c check_int_eq(g->sink_idx, 6); g 840 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 851 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 853 test/util/bipartite_graph.c check(g != NULL); g 856 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 860 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/-1, g 863 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/4, /*cost=*/-2, g 866 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/4, /*cost=*/-10, g 870 test/util/bipartite_graph.c err = opal_bp_graph_bipartite_to_flow(g); g 875 test/util/bipartite_graph.c path_found = opal_bp_graph_bellman_ford(g, /*source=*/5, /*target=*/6, pred); g 877 test/util/bipartite_graph.c check_int_eq(g->source_idx, 5); g 878 test/util/bipartite_graph.c check_int_eq(g->sink_idx, 6); g 885 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 893 test/util/bipartite_graph.c opal_bp_graph_t *g; g 904 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 906 test/util/bipartite_graph.c check(g != NULL); g 909 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 913 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/0, /*v=*/3, /*cost=*/10, g 916 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/1, /*v=*/4, /*cost=*/2, g 919 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/4, /*cost=*/1, g 923 test/util/bipartite_graph.c check_int_eq(opal_bp_graph_order(g), 5); g 924 test/util/bipartite_graph.c check_has_in_out_degree(g, 0, /*exp_indeg=*/0, /*exp_outdeg=*/1); g 925 test/util/bipartite_graph.c check_has_in_out_degree(g, 1, /*exp_indeg=*/0, /*exp_outdeg=*/1); g 926 test/util/bipartite_graph.c check_has_in_out_degree(g, 2, /*exp_indeg=*/0, /*exp_outdeg=*/1); g 927 test/util/bipartite_graph.c check_has_in_out_degree(g, 3, /*exp_indeg=*/1, /*exp_outdeg=*/0); g 928 test/util/bipartite_graph.c check_has_in_out_degree(g, 4, /*exp_indeg=*/2, /*exp_outdeg=*/0); g 931 test/util/bipartite_graph.c err = opal_bp_graph_bipartite_to_flow(g); g 934 test/util/bipartite_graph.c check_int_eq(opal_bp_graph_order(g), 7); g 935 test/util/bipartite_graph.c check_has_in_out_degree(g, 0, /*exp_indeg=*/2, /*exp_outdeg=*/2); g 936 test/util/bipartite_graph.c check_has_in_out_degree(g, 1, /*exp_indeg=*/2, /*exp_outdeg=*/2); g 937 test/util/bipartite_graph.c check_has_in_out_degree(g, 2, /*exp_indeg=*/2, /*exp_outdeg=*/2); g 938 test/util/bipartite_graph.c check_has_in_out_degree(g, 3, /*exp_indeg=*/2, /*exp_outdeg=*/2); g 939 test/util/bipartite_graph.c check_has_in_out_degree(g, 4, /*exp_indeg=*/3, /*exp_outdeg=*/3); g 940 test/util/bipartite_graph.c check_has_in_out_degree(g, 5, /*exp_indeg=*/3, /*exp_outdeg=*/3); g 941 test/util/bipartite_graph.c check_has_in_out_degree(g, 6, /*exp_indeg=*/2, /*exp_outdeg=*/2); g 943 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 952 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 954 test/util/bipartite_graph.c check(g != NULL); g 955 test/util/bipartite_graph.c check_int_eq(opal_bp_graph_order(g), 0); g 956 test/util/bipartite_graph.c err = opal_bp_graph_bipartite_to_flow(g); g 958 test/util/bipartite_graph.c err = opal_bp_graph_free(g); g 966 test/util/bipartite_graph.c opal_bp_graph_t *g; g 970 test/util/bipartite_graph.c err = opal_bp_graph_create(NULL, NULL, &g); g 972 test/util/bipartite_graph.c check(g != NULL); g 975 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/3, /*v=*/5, /*cost=*/0, g 980 test/util/bipartite_graph.c err = opal_bp_graph_add_vertex(g, NULL, NULL); g 985 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/9, /*v=*/5, /*cost=*/0, g 988 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/6, /*v=*/5, /*cost=*/0, g 993 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/8, /*cost=*/0, g 996 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/6, /*cost=*/0, g 1001 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/4, /*cost=*/0, g 1004 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/4, /*cost=*/0, g 1009 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/3, /*cost=*/INT64_MAX, g 1012 test/util/bipartite_graph.c err = opal_bp_graph_add_edge(g, /*u=*/2, /*v=*/3, /*cost=*/INT64_MAX-1, g 1016 test/util/bipartite_graph.c err = opal_bp_graph_free(g);