64 <<
"Size of list:" << Values.size()
65 <<
" does not equal the number of processors:"
76 label belowID = myComm.
below()[belowI];
77 const labelList& belowLeaves = comms[belowID].allBelow();
81 List<T> receivedValues(belowLeaves.size() + 1);
87 receivedValues.data_bytes(),
88 receivedValues.size_bytes(),
93 Values[belowID] = receivedValues[0];
97 Values[belowLeaves[leafI]] = receivedValues[leafI + 1];
110 fromBelow >> Values[belowID];
114 Pout<<
" received through "
115 << belowID <<
" data from:" << belowID
116 <<
" data:" << Values[belowID] <<
endl;
120 forAll(belowLeaves, leafI)
122 label leafID = belowLeaves[leafI];
123 fromBelow >> Values[leafID];
127 Pout<<
" received through "
128 << belowID <<
" data from:" << leafID
129 <<
" data:" << Values[leafID] <<
endl;
138 if (myComm.
above() != -1)
151 List<T> sendingValues(belowLeaves.size() + 1);
154 forAll(belowLeaves, leafI)
156 sendingValues[leafI + 1] = Values[belowLeaves[leafI]];
163 sendingValues.cdata_bytes(),
164 sendingValues.size_bytes(),
181 forAll(belowLeaves, leafI)
183 label leafID = belowLeaves[leafI];
187 Pout<<
" sending to "
188 << myComm.
above() <<
" data from:" << leafID
189 <<
" data:" << Values[leafID] <<
endl;
191 toAbove << Values[leafID];
216 const List<UPstream::commsStruct>& comms,
227 <<
"Size of list:" << Values.size()
228 <<
" does not equal the number of processors:"
237 if (myComm.above() != -1)
239 const labelList& notBelowLeaves = myComm.allNotBelow();
241 if (is_contiguous<T>::value)
243 List<T> receivedValues(notBelowLeaves.size());
249 receivedValues.data_bytes(),
250 receivedValues.size_bytes(),
255 forAll(notBelowLeaves, leafI)
257 Values[notBelowLeaves[leafI]] = receivedValues[leafI];
271 forAll(notBelowLeaves, leafI)
273 label leafID = notBelowLeaves[leafI];
274 fromAbove >> Values[leafID];
278 Pout<<
" received through "
279 << myComm.above() <<
" data for:" << leafID
280 <<
" data:" << Values[leafID] <<
endl;
289 label belowID = myComm.below()[belowI];
290 const labelList& notBelowLeaves = comms[belowID].allNotBelow();
292 if (is_contiguous<T>::value)
294 List<T> sendingValues(notBelowLeaves.size());
296 forAll(notBelowLeaves, leafI)
298 sendingValues[leafI] = Values[notBelowLeaves[leafI]];
305 sendingValues.cdata_bytes(),
306 sendingValues.size_bytes(),
323 forAll(notBelowLeaves, leafI)
325 label leafID = notBelowLeaves[leafI];
326 toBelow << Values[leafID];
330 Pout<<
" sent through "
331 << belowID <<
" data for:" << leafID
332 <<
" data:" << Values[leafID] <<
endl;