@@ -26,8 +26,8 @@ qvi_hwsplit_s::qvi_hwsplit_s(
26
26
uint_t group_size,
27
27
uint_t split_size,
28
28
qv_hw_obj_type_t split_at_type
29
- ) : m_rmi(parent->m_group ->task ()->rmi())
30
- , m_hwpool(parent->m_hwpool )
29
+ ) : m_rmi(parent->group () ->task()->rmi())
30
+ , m_hwpool(parent->hwpool () )
31
31
, m_group_size(group_size)
32
32
, m_split_size(split_size)
33
33
, m_split_at_type(split_at_type)
@@ -437,7 +437,7 @@ qvi_coll_hwsplit_s::qvi_coll_hwsplit_s(
437
437
) : m_parent(parent)
438
438
, m_color(color)
439
439
{
440
- const qvi_group_t *const pgroup = m_parent->m_group ;
440
+ const qvi_group_t *const pgroup = m_parent->group () ;
441
441
if (pgroup->rank () == qvi_coll_hwsplit_s::s_rootid) {
442
442
m_hwsplit = qvi_hwsplit_s (
443
443
m_parent, pgroup->size (), npieces, split_at_type
@@ -456,7 +456,7 @@ qvi_coll_hwsplit_s::scatter_values(
456
456
int rc = QV_SUCCESS;
457
457
qvi_bbuff_t *rxbuff = nullptr ;
458
458
459
- qvi_group_t *const group = m_parent->m_group ;
459
+ qvi_group_t *const group = m_parent->group () ;
460
460
std::vector<qvi_bbuff_t *> txbuffs (0 );
461
461
if (group->rank () == s_rootid) {
462
462
const uint_t group_size = group->size ();
@@ -494,7 +494,7 @@ qvi_coll_hwsplit_s::bcast_value(
494
494
TYPE *value
495
495
) {
496
496
static_assert (std::is_trivially_copyable<TYPE>::value, " " );
497
- qvi_group_t *const group = m_parent->m_group ;
497
+ qvi_group_t *const group = m_parent->group () ;
498
498
499
499
std::vector<TYPE> values;
500
500
if (group->rank () == s_rootid) {
@@ -511,7 +511,7 @@ qvi_coll_hwsplit_s::gather_values(
511
511
std::vector<TYPE> &outvals
512
512
) {
513
513
static_assert (std::is_trivially_copyable<TYPE>::value, " " );
514
- qvi_group_t *const group = m_parent->m_group ;
514
+ qvi_group_t *const group = m_parent->group () ;
515
515
const uint_t group_size = group->size ();
516
516
517
517
qvi_bbuff_t *txbuff = nullptr ;
@@ -558,7 +558,7 @@ qvi_coll_hwsplit_s::gather_hwpools(
558
558
qvi_hwpool_s *txpool,
559
559
std::vector<qvi_hwpool_s *> &rxpools
560
560
) {
561
- qvi_group_t *const group = m_parent->m_group ;
561
+ qvi_group_t *const group = m_parent->group () ;
562
562
const uint_t group_size = group->size ();
563
563
// Pack the hardware pool into a buffer.
564
564
qvi_bbuff_t txbuff;
@@ -602,19 +602,19 @@ qvi_coll_hwsplit_s::gather(void)
602
602
int rc = gather_values (qvi_task_t::mytid (), m_hwsplit.m_taskids );
603
603
if (qvi_unlikely (rc != QV_SUCCESS)) return rc;
604
604
// Note that the result hwpools are copies, so we can modify them freely.
605
- rc = gather_hwpools (m_parent->m_hwpool , m_hwsplit.m_hwpools );
605
+ rc = gather_hwpools (m_parent->hwpool () , m_hwsplit.m_hwpools );
606
606
if (qvi_unlikely (rc != QV_SUCCESS)) return rc;
607
607
608
608
rc = gather_values (m_color, m_hwsplit.m_colors );
609
609
if (qvi_unlikely (rc != QV_SUCCESS)) return rc;
610
610
611
- const int myid = m_parent->m_group ->rank ();
612
- const uint_t group_size = m_parent->m_group ->size ();
611
+ const int myid = m_parent->group () ->rank ();
612
+ const uint_t group_size = m_parent->group () ->size ();
613
613
if (myid == qvi_coll_hwsplit_s::s_rootid) {
614
614
m_hwsplit.m_affinities .resize (group_size);
615
615
for (uint_t tid = 0 ; tid < group_size; ++tid) {
616
616
hwloc_cpuset_t cpuset = nullptr ;
617
- rc = m_parent->m_group ->task ()->bind_top (&cpuset);
617
+ rc = m_parent->group () ->task ()->bind_top (&cpuset);
618
618
if (qvi_unlikely (rc != QV_SUCCESS)) break ;
619
619
//
620
620
rc = m_hwsplit.m_affinities [tid].set (cpuset);
@@ -635,7 +635,7 @@ qvi_coll_hwsplit_s::scatter_hwpools(
635
635
std::vector<qvi_bbuff_t *> txbuffs (0 );
636
636
qvi_bbuff_t *rxbuff = nullptr ;
637
637
638
- qvi_group_t *const group = m_parent->m_group ;
638
+ qvi_group_t *const group = m_parent->group () ;
639
639
640
640
if (group->rank () == s_rootid) {
641
641
const uint_t group_size = group->size ();
@@ -679,7 +679,7 @@ qvi_coll_hwsplit_s::scatter(
679
679
int
680
680
qvi_coll_hwsplit_s::barrier (void )
681
681
{
682
- return m_parent->m_group ->barrier ();
682
+ return m_parent->group () ->barrier ();
683
683
}
684
684
685
685
int
@@ -698,7 +698,7 @@ qvi_coll_hwsplit_s::split(
698
698
if (qvi_unlikely (rc != QV_SUCCESS)) return rc;
699
699
// The root does this calculation.
700
700
int rc2 = QV_SUCCESS;
701
- if (m_parent->m_group ->rank () == s_rootid) {
701
+ if (m_parent->group () ->rank () == s_rootid) {
702
702
rc2 = m_hwsplit.split ();
703
703
}
704
704
// Wait for the split information. Explicitly barrier here in case the
0 commit comments