nme               377 opal/mca/btl/usnic/btl_usnic_proc.c     int nme,
nme               387 opal/mca/btl/usnic/btl_usnic_proc.c     assert(nme >= 0);
nme               388 opal/mca/btl/usnic/btl_usnic_proc.c     for (i = 0; i < nme; ++i) {
nme               601 opal/mca/btl/usnic/btl_usnic_proc.c         int nme = 0;
nme               603 opal/mca/btl/usnic/btl_usnic_proc.c         err = opal_bp_graph_solve_bipartite_assignment(g, &nme, &me);
nme               609 opal/mca/btl/usnic/btl_usnic_proc.c         edge_pairs_to_match_table(proc, proc_is_left, nme, me);
nme               310 test/util/bipartite_graph.c     int nme;
nme               336 test/util/bipartite_graph.c                                                     &nme,
nme               339 test/util/bipartite_graph.c     check_int_eq(nme, 2);
nme               341 test/util/bipartite_graph.c     qsort(me, nme, 2*sizeof(int), &cmp_int_pair);
nme               376 test/util/bipartite_graph.c                                                     &nme,
nme               379 test/util/bipartite_graph.c     check_int_eq(nme, 2);
nme               381 test/util/bipartite_graph.c     qsort(me, nme, 2*sizeof(int), &cmp_int_pair);
nme               418 test/util/bipartite_graph.c                                                     &nme,
nme               421 test/util/bipartite_graph.c     check_int_eq(nme, 2);
nme               423 test/util/bipartite_graph.c     qsort(me, nme, 2*sizeof(int), &cmp_int_pair);
nme               459 test/util/bipartite_graph.c                                                     &nme,
nme               462 test/util/bipartite_graph.c     check_int_eq(nme, 2);
nme               464 test/util/bipartite_graph.c     qsort(me, nme, 2*sizeof(int), &cmp_int_pair);
nme               500 test/util/bipartite_graph.c                                                     &nme,
nme               503 test/util/bipartite_graph.c     check_int_eq(nme, 2);
nme               505 test/util/bipartite_graph.c     qsort(me, nme, 2*sizeof(int), &cmp_int_pair);
nme               543 test/util/bipartite_graph.c                                                     &nme,
nme               546 test/util/bipartite_graph.c     check_int_eq(nme, 2);
nme               548 test/util/bipartite_graph.c     qsort(me, nme, 2*sizeof(int), &cmp_int_pair);
nme               588 test/util/bipartite_graph.c                                                     &nme,
nme               591 test/util/bipartite_graph.c     check_int_eq(nme, 2);
nme               593 test/util/bipartite_graph.c     qsort(me, nme, 2*sizeof(int), &cmp_int_pair);
nme               628 test/util/bipartite_graph.c                                                     &nme,
nme               631 test/util/bipartite_graph.c     check_int_eq(nme, 1);
nme               633 test/util/bipartite_graph.c     qsort(me, nme, 2*sizeof(int), &cmp_int_pair);
nme               672 test/util/bipartite_graph.c                                                         &nme,
nme               675 test/util/bipartite_graph.c         check_int_eq(nme, 2);
nme               677 test/util/bipartite_graph.c         qsort(me, nme, 2*sizeof(int), &cmp_int_pair);