algo              107 ompi/mca/coll/portals4/coll_portals4_bcast.c         request->u.bcast.algo = OMPI_COLL_PORTALS4_BCAST_PIPELINE_ALGO;
algo              110 ompi/mca/coll/portals4/coll_portals4_bcast.c         request->u.bcast.algo = OMPI_COLL_PORTALS4_BCAST_KARY_TREE_ALGO;
algo              856 ompi/mca/coll/portals4/coll_portals4_bcast.c     switch (request->u.bcast.algo) {
algo              870 ompi/mca/coll/portals4/coll_portals4_bcast.c                 __FILE__, __LINE__, request->u.bcast.algo);
algo              903 ompi/mca/coll/portals4/coll_portals4_bcast.c     switch (request->u.bcast.algo) {
algo              915 ompi/mca/coll/portals4/coll_portals4_bcast.c                 __FILE__, __LINE__, request->u.bcast.algo);
algo              928 ompi/mca/coll/portals4/coll_portals4_bcast.c     switch (request->u.bcast.algo) {
algo              938 ompi/mca/coll/portals4/coll_portals4_bcast.c                 __FILE__, __LINE__, request->u.bcast.algo);
algo               61 ompi/mca/coll/portals4/coll_portals4_request.h             ompi_coll_portals4_bcast_algo_t algo;
algo                9 ompi/mca/topo/treematch/treematch/k-partitioning.c void algo(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n,  int * const deficit, int * const surplus);
algo               39 ompi/mca/topo/treematch/treematch/k-partitioning.c       algo(part, comm, &Qpart, Q, Qinst, D, real_n, &deficit, &surplus);