1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368
|
/* -*- Mode: C; c-basic-offset:4 ; -*- */
/*
* Copyright (c) 2004-2006 The Trustees of Indiana University and Indiana
* University Research and Technology
* Corporation. All rights reserved.
* Copyright (c) 2004-2009 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights
* reserved.
* Copyright (c) 2004-2006 High Performance Computing Center Stuttgart,
* University of Stuttgart. All rights reserved.
* Copyright (c) 2004-2006 The Regents of the University of California.
* All rights reserved.
* Copyright (c) 2009 Oak Ridge National Labs. All rights reserved.
* $COPYRIGHT$
*
* Additional copyrights may follow
*
* $HEADER$
*/
#include "opal_config.h"
#include <stddef.h>
#include "opal/constants.h"
#include "opal/util/output.h"
#include "opal/datatype/opal_datatype.h"
#include "opal/datatype/opal_datatype_internal.h"
/* macros to play with the flags */
#define SET_CONTIGUOUS_FLAG( INT_VALUE ) (INT_VALUE) = (INT_VALUE) | (OPAL_DATATYPE_FLAG_CONTIGUOUS)
#define SET_NO_GAP_FLAG( INT_VALUE ) (INT_VALUE) = (INT_VALUE) | (OPAL_DATATYPE_FLAG_NO_GAPS)
#define UNSET_CONTIGUOUS_FLAG( INT_VALUE ) (INT_VALUE) = (INT_VALUE) & (~(OPAL_DATATYPE_FLAG_CONTIGUOUS | OPAL_DATATYPE_FLAG_NO_GAPS))
#if defined(__GNUC__) && !defined(__STDC__)
#define LMAX(A,B) ({ OPAL_PTRDIFF_TYPE _a = (A), _b = (B); (_a < _b ? _b : _a) })
#define LMIN(A,B) ({ OPAL_PTRDIFF_TYPE _a = (A), _b = (B); (_a < _b ? _a : _b); })
#define IMAX(A,B) ({ int _a = (A), _b = (B); (_a < _b ? _b : _a); })
#define IMIN(A,B) ({ int _a = (A), _b = (B); (_a < _b ? _a : _b); })
#else
static inline OPAL_PTRDIFF_TYPE LMAX( OPAL_PTRDIFF_TYPE a, OPAL_PTRDIFF_TYPE b ) { return ( a < b ? b : a ); }
static inline OPAL_PTRDIFF_TYPE LMIN( OPAL_PTRDIFF_TYPE a, OPAL_PTRDIFF_TYPE b ) { return ( a < b ? a : b ); }
static inline int IMAX( int a, int b ) { return ( a < b ? b : a ); }
static inline int IMIN( int a, int b ) { return ( a < b ? a : b ); }
#endif /* __GNU__ */
#define OPAL_DATATYPE_COMPUTE_REQUIRED_ENTRIES( _pdtAdd, _count, _extent, _place_needed) \
{ \
if( (_pdtAdd)->flags & OPAL_DATATYPE_FLAG_PREDEFINED ) { /* add a basic datatype */ \
(_place_needed) = ((_extent) == (OPAL_PTRDIFF_TYPE)(_pdtAdd)->size ? 1 : 3); \
} else { \
(_place_needed) = (_pdtAdd)->desc.used; \
if( (_count) != 1 ) { \
if( (_place_needed) < (MAX_DT_COMPONENT_COUNT - 2) ) { \
(_place_needed) += 2; /* for the loop markers */ \
} else { \
/* The data-type contain too many elements. We will be unable \
* to handle it, so let's just complain by now. \
*/ \
opal_output( 0, "Too many elements in the datatype. The limit is %ud\n", \
MAX_DT_COMPONENT_COUNT ); \
return OPAL_ERROR; \
} \
} \
} \
}
#define OPAL_DATATYPE_LB_UB_CONT( _count, _disp, _old_lb, _old_ub, _old_extent, _new_lb, _new_ub ) \
{ \
if( 0 == _count ) { \
_new_lb = (_old_lb) + (_disp); \
_new_ub = (_old_ub) + (_disp); \
} else { \
OPAL_PTRDIFF_TYPE lower, upper; \
upper = (_disp) + (_old_extent) * ((_count) - 1); \
lower = (_disp); \
if( lower < upper ) { \
_new_lb = lower; \
_new_ub = upper; \
} else { \
_new_lb = upper; \
_new_ub = lower; \
} \
_new_lb += (_old_lb); \
_new_ub += (_old_ub); \
}\
}
/* When we add a datatype we should update it's definition depending on
* the initial displacement for the whole data, so the displacement of
* all elements inside a datatype depend only on the loop displacement
* and it's own displacement.
*/
/* we have 3 differents structures to update:
* the first is the real representation of the datatype
* the second is the internal representation using extents
* the last is the representation used for send operations
* If the count is ZERO we dont have to add the pdtAdd datatype. But we have to
* be sure that the pdtBase datatype is correctly initialized with all fields
* set to ZERO if it's a empty datatype.
*/
int32_t opal_datatype_add( opal_datatype_t* pdtBase, const opal_datatype_t* pdtAdd,
uint32_t count, OPAL_PTRDIFF_TYPE disp, OPAL_PTRDIFF_TYPE extent )
{
uint32_t newLength, place_needed = 0, i;
short localFlags = 0; /* no specific options yet */
dt_elem_desc_t *pLast, *pLoop = NULL;
OPAL_PTRDIFF_TYPE lb, ub, true_lb, true_ub, epsilon, old_true_ub;
/* the extent should always be positive. So a negative
* value here have a special meaning ie. default extent as
* computed by ub - lb
*/
if( extent == -1 ) extent = (pdtAdd->ub - pdtAdd->lb);
/* Deal with the special markers (OPAL_DATATYPE_LB and OPAL_DATATYPE_UB) */
if( OPAL_DATATYPE_LB == pdtAdd->id ) {
pdtBase->bdt_used |= (((uint32_t)1) << OPAL_DATATYPE_LB);
if( pdtBase->flags & OPAL_DATATYPE_FLAG_USER_LB ) {
pdtBase->lb = LMIN( pdtBase->lb, disp );
} else {
pdtBase->lb = disp;
pdtBase->flags |= OPAL_DATATYPE_FLAG_USER_LB;
}
if( (pdtBase->ub - pdtBase->lb) != (OPAL_PTRDIFF_TYPE)pdtBase->size ) {
pdtBase->flags &= ~OPAL_DATATYPE_FLAG_NO_GAPS;
}
return OPAL_SUCCESS; /* Just ignore the OPAL_DATATYPE_LOOP and OPAL_DATATYPE_END_LOOP */
} else if( OPAL_DATATYPE_UB == pdtAdd->id ) {
pdtBase->bdt_used |= (((uint32_t)1) << OPAL_DATATYPE_UB);
if( pdtBase->flags & OPAL_DATATYPE_FLAG_USER_UB ) {
pdtBase->ub = LMAX( pdtBase->ub, disp );
} else {
pdtBase->ub = disp;
pdtBase->flags |= OPAL_DATATYPE_FLAG_USER_UB;
}
if( (pdtBase->ub - pdtBase->lb) != (OPAL_PTRDIFF_TYPE)pdtBase->size ) {
pdtBase->flags &= ~OPAL_DATATYPE_FLAG_NO_GAPS;
}
return OPAL_SUCCESS; /* Just ignore the OPAL_DATATYPE_LOOP and OPAL_DATATYPE_END_LOOP */
}
/* Compute the number of entries we need in the datatype description */
OPAL_DATATYPE_COMPUTE_REQUIRED_ENTRIES( pdtAdd, count, extent, place_needed );
/*
* Compute the lower and upper bound of the datatype. We do it in 2 steps.
* First compute the lb and ub of the new datatype taking in account the
* count. Then update the lb value depending on the user markers and
* update the global lb and ub.
*/
OPAL_DATATYPE_LB_UB_CONT( count, disp, pdtAdd->lb, pdtAdd->ub, extent, lb, ub );
/* Compute the true_lb and true_ub for the datatype to be added, taking
* in account the number of repetions. These values do not include the
* potential gaps at the begining and at the end of the datatype.
*/
true_lb = lb - (pdtAdd->lb - pdtAdd->true_lb);
true_ub = ub - (pdtAdd->ub - pdtAdd->true_ub);
if( true_lb > true_ub ) {
old_true_ub = true_lb;
true_lb = true_ub;
true_ub = old_true_ub;
}
#if 0
/* Avoid claiming overlap as much as possible. */
if( !(pdtBase->flags & OPAL_DATATYPE_FLAG_OVERLAP) ) {
if( ((disp + true_lb) >= pdtBase->true_ub) ||
((disp + true_ub) <= pdtBase->true_lb) ) {
} else {
/* potential overlap */
}
}
#endif
/* The lower bound should be inherited from the parent if and only
* if the USER has explicitly set it. The result lb is the MIN between
* the all lb + disp if and only if all or nobody flags's contain the LB.
*/
if( (pdtAdd->flags ^ pdtBase->flags) & OPAL_DATATYPE_FLAG_USER_LB ) {
if( pdtBase->flags & OPAL_DATATYPE_FLAG_USER_LB ) {
lb = pdtBase->lb; /* base type has a user provided lb */
}
pdtBase->flags |= OPAL_DATATYPE_FLAG_USER_LB;
} else {
/* both of them have the LB flag or both of them dont have it */
lb = LMIN( pdtBase->lb, lb );
}
/* the same apply for the upper bound except for the case where
* either of them has the flag UB, in which case we should
* compute the UB including the natural alignement of the data.
*/
if( (pdtBase->flags ^ pdtAdd->flags) & OPAL_DATATYPE_FLAG_USER_UB ) {
if( pdtBase->flags & OPAL_DATATYPE_FLAG_USER_UB ) {
ub = pdtBase->ub;
}
pdtBase->flags |= OPAL_DATATYPE_FLAG_USER_UB;
} else {
/* both of them have the UB flag or both of them dont have it */
/* we should compute the extent depending on the alignement */
ub = LMAX( pdtBase->ub, ub );
}
/* While the true_lb and true_ub have to be ordered to have the true_lb lower
* than the true_ub, the ub and lb do not have to be ordered. They should be
* as the user define them.
*/
pdtBase->lb = lb;
pdtBase->ub = ub;
/* compute the new memory alignement */
pdtBase->align = IMAX( pdtBase->align, pdtAdd->align );
/* Now that we have the new ub and the alignment we should update the ub to match
* the new alignement. We have to add an epsilon that is the least nonnegative
* increment needed to roung the extent to the next multiple of the alignment.
* This rule apply only if there is user specified upper bound as stated in the
* MPI standard MPI 1.2 page 71.
*/
if( !(pdtBase->flags & OPAL_DATATYPE_FLAG_USER_UB) ) {
epsilon = (pdtBase->ub - pdtBase->lb) % pdtBase->align;
if( 0 != epsilon ) {
pdtBase->ub += (pdtBase->align - epsilon);
}
}
/* now we know it contain some data */
pdtBase->flags |= OPAL_DATATYPE_FLAG_DATA;
/*
* MPI Standard 3.0 Chapter 4.1: Most datatype constructors have
* replication count or block length arguments. If the value is zero,
* no elements are generated in the type map and there is no effect
* on datatype bounds or extent.
*
* Therefore we support it here in the upper part of this function. As an
* extension, the count set to zero can be used to reset the alignment of
* the data, but not for changing the true_lb and true_ub.
*/
if( (0 == count) || (0 == pdtAdd->size) ) {
return OPAL_SUCCESS;
}
/* Now, once we know everything is fine and there are some bytes in
* the data-type we can update the size, true_lb and true_ub.
*/
pdtBase->size += count * pdtAdd->size;
if( 0 == pdtBase->nbElems ) old_true_ub = disp;
else old_true_ub = pdtBase->true_ub;
if( 0 != pdtBase->size ) {
pdtBase->true_lb = LMIN( true_lb, pdtBase->true_lb );
pdtBase->true_ub = LMAX( true_ub, pdtBase->true_ub );
} else {
pdtBase->true_lb = true_lb;
pdtBase->true_ub = true_ub;
}
pdtBase->bdt_used |= pdtAdd->bdt_used;
newLength = pdtBase->desc.used + place_needed;
if( newLength > pdtBase->desc.length ) {
newLength = ((newLength / DT_INCREASE_STACK) + 1 ) * DT_INCREASE_STACK;
pdtBase->desc.desc = (dt_elem_desc_t*)realloc( pdtBase->desc.desc,
sizeof(dt_elem_desc_t) * newLength );
pdtBase->desc.length = newLength;
}
pLast = &(pdtBase->desc.desc[pdtBase->desc.used]);
/* The condition to be able to use the optimized path here is to be in presence
* of an predefined contiguous datatype. This part is unable to handle any
* predefined non contiguous datatypes (like MPI_SHORT_INT).
*/
if( (pdtAdd->flags & (OPAL_DATATYPE_FLAG_PREDEFINED | OPAL_DATATYPE_FLAG_DATA)) == (OPAL_DATATYPE_FLAG_PREDEFINED | OPAL_DATATYPE_FLAG_DATA) ) {
pdtBase->btypes[pdtAdd->id] += count;
if( (extent != (OPAL_PTRDIFF_TYPE)pdtAdd->size) && (count > 1) ) { /* gaps around the datatype */
localFlags = pdtAdd->flags & ~(OPAL_DATATYPE_FLAG_COMMITED | OPAL_DATATYPE_FLAG_CONTIGUOUS | OPAL_DATATYPE_FLAG_NO_GAPS);
CREATE_LOOP_START( pLast, count, 2, extent, localFlags );
pLast++;
pLast->elem.common.type = pdtAdd->id;
pLast->elem.count = 1;
pLast->elem.disp = disp;
pLast->elem.extent = pdtAdd->size;
pLast->elem.common.flags = localFlags | OPAL_DATATYPE_FLAG_CONTIGUOUS;
pLast++;
CREATE_LOOP_END( pLast, 2, disp, pdtAdd->size, localFlags );
pdtBase->desc.used += 3;
pdtBase->btypes[OPAL_DATATYPE_LOOP] = 1;
pdtBase->btypes[OPAL_DATATYPE_END_LOOP] = 1;
} else {
pLast->elem.common.type = pdtAdd->id;
pLast->elem.count = count;
pLast->elem.disp = disp;
pLast->elem.extent = extent;
pdtBase->desc.used++;
pLast->elem.common.flags = pdtAdd->flags & ~(OPAL_DATATYPE_FLAG_COMMITED);
}
} else {
/* keep trace of the total number of basic datatypes in the datatype definition */
pdtBase->btypes[OPAL_DATATYPE_LOOP] += pdtAdd->btypes[OPAL_DATATYPE_LOOP];
pdtBase->btypes[OPAL_DATATYPE_END_LOOP] += pdtAdd->btypes[OPAL_DATATYPE_END_LOOP];
pdtBase->btypes[OPAL_DATATYPE_LB] |= pdtAdd->btypes[OPAL_DATATYPE_LB];
pdtBase->btypes[OPAL_DATATYPE_UB] |= pdtAdd->btypes[OPAL_DATATYPE_UB];
for( i = 4; i < OPAL_DATATYPE_MAX_PREDEFINED; i++ )
if( pdtAdd->btypes[i] != 0 ) pdtBase->btypes[i] += (count * pdtAdd->btypes[i]);
if( (1 == pdtAdd->desc.used) && (extent == (pdtAdd->ub - pdtAdd->lb)) &&
(extent == pdtAdd->desc.desc[0].elem.extent) ){
pLast->elem = pdtAdd->desc.desc[0].elem;
pLast->elem.count *= count;
pLast->elem.disp += disp;
pdtBase->desc.used++;
} else {
/* if the extent of the datatype is the same as the extent of the loop
* description of the datatype then we simply have to update the main loop.
*/
if( count != 1 ) {
pLoop = pLast;
CREATE_LOOP_START( pLast, count, pdtAdd->desc.used + 1, extent,
(pdtAdd->flags & ~(OPAL_DATATYPE_FLAG_COMMITED)) );
pdtBase->btypes[OPAL_DATATYPE_LOOP] += 2;
pdtBase->desc.used += 2;
pLast++;
}
for( i = 0; i < pdtAdd->desc.used; i++ ) {
pLast->elem = pdtAdd->desc.desc[i].elem;
if( OPAL_DATATYPE_FLAG_DATA & pLast->elem.common.flags )
pLast->elem.disp += disp;
else if( OPAL_DATATYPE_END_LOOP == pLast->elem.common.type ) {
pLast->end_loop.first_elem_disp += disp;
}
pLast++;
}
pdtBase->desc.used += pdtAdd->desc.used;
if( pLoop != NULL ) {
int index = GET_FIRST_NON_LOOP( pLoop );
assert( pLoop[index].elem.common.flags & OPAL_DATATYPE_FLAG_DATA );
CREATE_LOOP_END( pLast, pdtAdd->desc.used + 1, pLoop[index].elem.disp,
pdtAdd->size, pLoop->loop.common.flags );
}
}
/* should I add some space until the extent of this datatype ? */
}
/* Is the data still contiguous ?
* The only way for the data to be contiguous is to have the true extent
* equal to his size. In other words to avoid having internal gaps between
* elements. If any of the data are overlapping then this method will not work.
*/
localFlags = pdtBase->flags & pdtAdd->flags;
UNSET_CONTIGUOUS_FLAG(pdtBase->flags);
if( (localFlags & OPAL_DATATYPE_FLAG_CONTIGUOUS) /* both type were contiguous */
&& ((disp + pdtAdd->true_lb) == old_true_ub) /* and there is no gap between them */
&& ( ((OPAL_PTRDIFF_TYPE)pdtAdd->size == extent) /* the size and the extent of the
* added type have to match */
|| (count < 2)) ) { /* if the count is bigger than 2 */
SET_CONTIGUOUS_FLAG(pdtBase->flags);
if( (OPAL_PTRDIFF_TYPE)pdtBase->size == (pdtBase->ub - pdtBase->lb) )
SET_NO_GAP_FLAG(pdtBase->flags);
}
/* If the NO_GAP flag is set the contiguous have to be set too */
if( pdtBase->flags & OPAL_DATATYPE_FLAG_NO_GAPS ) {
assert( pdtBase->flags & OPAL_DATATYPE_FLAG_CONTIGUOUS );
}
pdtBase->nbElems += (count * pdtAdd->nbElems);
return OPAL_SUCCESS;
}
|