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 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511
|
/* -*- Mode: C; c-basic-offset:4 ; indent-tabs-mode:nil -*- */
/*
* Copyright (c) 2009-2019 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights
* reserved.
* Copyright (c) 2009 Oak Ridge National Labs. All rights reserved.
* Copyright (c) 2010-2017 Cisco Systems, Inc. All rights reserved
* Copyright (c) 2013 Los Alamos National Security, LLC. All rights
* reserved.
* Copyright (c) 2015-2020 Research Organization for Information Science
* and Technology (RIST). All rights reserved.
* Copyright (c) 2018 FUJITSU LIMITED. All rights reserved.
* Copyright (c) 2021 IBM Corporation. All rights reserved.
* $COPYRIGHT$
*
* Additional copyrights may follow
*
* $HEADER$
*/
/**
* ompi_datatype_t interface for OMPI internal data type representation
*
* ompi_datatype_t is a class which represents contiguous or
* non-contiguous data together with constituent type-related
* information.
*/
#ifndef OMPI_DATATYPE_H_HAS_BEEN_INCLUDED
#define OMPI_DATATYPE_H_HAS_BEEN_INCLUDED
#include "ompi_config.h"
#include <stddef.h>
#include <stdint.h>
#include <string.h>
#include <limits.h>
#include "ompi/constants.h"
#include "opal/datatype/opal_convertor.h"
#include "opal/util/output.h"
#include "mpi.h"
BEGIN_C_DECLS
/* These flags are on top of the flags in opal_datatype.h */
/* Is the datatype predefined as MPI type (not necessarily as OPAL type, e.g. struct/block types) */
#define OMPI_DATATYPE_FLAG_PREDEFINED 0x0200
#define OMPI_DATATYPE_FLAG_ANALYZED 0x0400
#define OMPI_DATATYPE_FLAG_MONOTONIC 0x0800
/* Keep trace of the type of the predefined datatypes */
#define OMPI_DATATYPE_FLAG_DATA_INT 0x1000
#define OMPI_DATATYPE_FLAG_DATA_FLOAT 0x2000
#define OMPI_DATATYPE_FLAG_DATA_COMPLEX 0x3000
#define OMPI_DATATYPE_FLAG_DATA_TYPE 0x3000
/* In which language the datatype is intended for to be used */
#define OMPI_DATATYPE_FLAG_DATA_C 0x4000
#define OMPI_DATATYPE_FLAG_DATA_CPP 0x8000
#define OMPI_DATATYPE_FLAG_DATA_FORTRAN 0xC000
#define OMPI_DATATYPE_FLAG_DATA_LANGUAGE 0xC000
#define OMPI_DATATYPE_MAX_PREDEFINED 52
#if OMPI_DATATYPE_MAX_PREDEFINED > OPAL_DATATYPE_MAX_SUPPORTED
#error Need to increase the number of supported dataypes by OPAL (value OPAL_DATATYPE_MAX_SUPPORTED).
#endif
/* the data description.
*/
struct ompi_datatype_t {
opal_datatype_t super; /**< Base opal_datatype_t superclass */
/* --- cacheline 5 boundary (320 bytes) was 32 bytes ago --- */
int32_t id; /**< OMPI-layers unique id of the type */
int32_t d_f_to_c_index; /**< Fortran index for this datatype */
struct opal_hash_table_t *d_keyhash; /**< Attribute fields */
void* args; /**< Data description for the user */
opal_atomic_intptr_t packed_description; /**< Packed description of the datatype */
uint64_t pml_data; /**< PML-specific information */
/* --- cacheline 6 boundary (384 bytes) --- */
char name[MPI_MAX_OBJECT_NAME];/**< Externally visible name */
/* --- cacheline 7 boundary (448 bytes) --- */
/* size: 448, cachelines: 7, members: 7 */
};
typedef struct ompi_datatype_t ompi_datatype_t;
OMPI_DECLSPEC OBJ_CLASS_DECLARATION(ompi_datatype_t);
/**
* Padded struct to maintain back compatibility.
* See opal/communicator/communicator.h comments with struct opal_communicator_t
* for full explanation why we chose the following padding construct for predefines.
*/
/* Using set constant for padding of the DATATYPE handles because the size of
* base structure is very close to being the same no matter the bitness.
*/
#define PREDEFINED_DATATYPE_PAD 512
struct ompi_predefined_datatype_t {
struct ompi_datatype_t dt;
char padding[PREDEFINED_DATATYPE_PAD - sizeof(ompi_datatype_t)];
};
typedef struct ompi_predefined_datatype_t ompi_predefined_datatype_t;
/*
* The list of predefined datatypes is specified in ompi/include/mpi.h.in
*/
/* Base convertor for all external32 operations */
OMPI_DECLSPEC extern opal_convertor_t* ompi_mpi_external32_convertor;
OMPI_DECLSPEC extern opal_convertor_t* ompi_mpi_local_convertor;
extern struct opal_pointer_array_t ompi_datatype_f_to_c_table;
OMPI_DECLSPEC int32_t ompi_datatype_init( void );
OMPI_DECLSPEC int32_t ompi_datatype_default_convertors_init( void );
OMPI_DECLSPEC int32_t ompi_datatype_default_convertors_fini( void );
OMPI_DECLSPEC void ompi_datatype_dump (const ompi_datatype_t* pData);
OMPI_DECLSPEC ompi_datatype_t* ompi_datatype_create( int32_t expectedSize );
static inline int32_t
ompi_datatype_is_committed( const ompi_datatype_t* type )
{
return opal_datatype_is_committed(&type->super);
}
static inline int32_t
ompi_datatype_is_overlapped( const ompi_datatype_t* type )
{
return opal_datatype_is_overlapped(&type->super);
}
static inline int32_t
ompi_datatype_is_valid( const ompi_datatype_t* type )
{
return opal_datatype_is_valid(&type->super);
}
static inline int32_t
ompi_datatype_is_predefined( const ompi_datatype_t* type )
{
return (type->super.flags & OMPI_DATATYPE_FLAG_PREDEFINED);
}
static inline int32_t
ompi_datatype_is_contiguous_memory_layout( const ompi_datatype_t* type, int32_t count )
{
return opal_datatype_is_contiguous_memory_layout(&type->super, count);
}
static inline int32_t
ompi_datatype_is_monotonic( ompi_datatype_t * type ) {
if (!(type->super.flags & OMPI_DATATYPE_FLAG_ANALYZED)) {
if (opal_datatype_is_monotonic(&type->super)) {
type->super.flags |= OMPI_DATATYPE_FLAG_MONOTONIC;
}
type->super.flags |= OMPI_DATATYPE_FLAG_ANALYZED;
}
return type->super.flags & OMPI_DATATYPE_FLAG_MONOTONIC;
}
static inline int32_t
ompi_datatype_commit( ompi_datatype_t ** type )
{
return opal_datatype_commit ( (opal_datatype_t*)*type );
}
OMPI_DECLSPEC int32_t ompi_datatype_destroy( ompi_datatype_t** type);
/*
* Datatype creation functions
*/
static inline int32_t
ompi_datatype_add( ompi_datatype_t* pdtBase, const ompi_datatype_t* pdtAdd, size_t count,
ptrdiff_t disp, ptrdiff_t extent )
{
return opal_datatype_add( &pdtBase->super, &pdtAdd->super, count, disp, extent );
}
OMPI_DECLSPEC int32_t
ompi_datatype_duplicate( const ompi_datatype_t* oldType, ompi_datatype_t** newType );
OMPI_DECLSPEC int32_t ompi_datatype_create_contiguous( int count, const ompi_datatype_t* oldType, ompi_datatype_t** newType );
OMPI_DECLSPEC int32_t ompi_datatype_create_vector( int count, int bLength, int stride,
const ompi_datatype_t* oldType, ompi_datatype_t** newType );
OMPI_DECLSPEC int32_t ompi_datatype_create_hvector( int count, int bLength, ptrdiff_t stride,
const ompi_datatype_t* oldType, ompi_datatype_t** newType );
OMPI_DECLSPEC int32_t ompi_datatype_create_indexed( int count, const int* pBlockLength, const int* pDisp,
const ompi_datatype_t* oldType, ompi_datatype_t** newType );
OMPI_DECLSPEC int32_t ompi_datatype_create_hindexed( int count, const int* pBlockLength, const ptrdiff_t* pDisp,
const ompi_datatype_t* oldType, ompi_datatype_t** newType );
OMPI_DECLSPEC int32_t ompi_datatype_create_indexed_block( int count, int bLength, const int* pDisp,
const ompi_datatype_t* oldType, ompi_datatype_t** newType );
OMPI_DECLSPEC int32_t ompi_datatype_create_hindexed_block( int count, int bLength, const ptrdiff_t* pDisp,
const ompi_datatype_t* oldType, ompi_datatype_t** newType );
OMPI_DECLSPEC int32_t ompi_datatype_create_struct( int count, const int* pBlockLength, const ptrdiff_t* pDisp,
ompi_datatype_t* const* pTypes, ompi_datatype_t** newType );
OMPI_DECLSPEC int32_t ompi_datatype_create_darray( int size, int rank, int ndims, int const* gsize_array,
int const* distrib_array, int const* darg_array,
int const* psize_array, int order, const ompi_datatype_t* oldtype,
ompi_datatype_t** newtype);
OMPI_DECLSPEC int32_t ompi_datatype_create_subarray(int ndims, int const* size_array, int const* subsize_array,
int const* start_array, int order,
const ompi_datatype_t* oldtype, ompi_datatype_t** newtype);
static inline int32_t
ompi_datatype_create_resized( const ompi_datatype_t* oldType,
ptrdiff_t lb,
ptrdiff_t extent,
ompi_datatype_t** newType )
{
ompi_datatype_t * type;
ompi_datatype_duplicate( oldType, &type );
if ( NULL == type) {
return OMPI_ERR_OUT_OF_RESOURCE;
}
opal_datatype_resize ( &type->super, lb, extent );
*newType = type;
return OMPI_SUCCESS;
}
static inline int32_t
ompi_datatype_type_lb( const ompi_datatype_t* type, ptrdiff_t* disp )
{
return opal_datatype_type_lb(&type->super, disp);
}
static inline int32_t
ompi_datatype_type_ub( const ompi_datatype_t* type, ptrdiff_t* disp )
{
return opal_datatype_type_ub( &type->super, disp);
}
static inline int32_t
ompi_datatype_type_size ( const ompi_datatype_t* type, size_t *size )
{
return opal_datatype_type_size( &type->super, size);
}
static inline int32_t
ompi_datatype_type_extent( const ompi_datatype_t* type, ptrdiff_t* extent )
{
return opal_datatype_type_extent( &type->super, extent);
}
static inline int32_t
ompi_datatype_get_extent( const ompi_datatype_t* type, ptrdiff_t* lb, ptrdiff_t* extent)
{
return opal_datatype_get_extent( &type->super, lb, extent);
}
static inline int32_t
ompi_datatype_get_true_extent( const ompi_datatype_t* type, ptrdiff_t* true_lb, ptrdiff_t* true_extent)
{
return opal_datatype_get_true_extent( &type->super, true_lb, true_extent);
}
static inline ssize_t
ompi_datatype_get_element_count( const ompi_datatype_t* type, size_t iSize )
{
return opal_datatype_get_element_count( &type->super, iSize );
}
static inline int32_t
ompi_datatype_set_element_count( const ompi_datatype_t* type, size_t count, size_t* length )
{
return opal_datatype_set_element_count( &type->super, count, length );
}
static inline int32_t
ompi_datatype_copy_content_same_ddt( const ompi_datatype_t* type, size_t count,
char* pDestBuf, char* pSrcBuf )
{
int32_t length, rc;
ptrdiff_t extent;
ompi_datatype_type_extent( type, &extent );
while( 0 != count ) {
length = INT_MAX;
if( ((size_t)length) > count ) length = (int32_t)count;
rc = opal_datatype_copy_content_same_ddt( &type->super, length,
pDestBuf, pSrcBuf );
if( 0 != rc ) return rc;
pDestBuf += ((ptrdiff_t)length) * extent;
pSrcBuf += ((ptrdiff_t)length) * extent;
count -= (size_t)length;
}
return 0;
}
OMPI_DECLSPEC const ompi_datatype_t* ompi_datatype_match_size( int size, uint16_t datakind, uint16_t datalang );
/*
*
*/
OMPI_DECLSPEC int32_t ompi_datatype_sndrcv( const void *sbuf, int32_t scount, const ompi_datatype_t* sdtype,
void *rbuf, int32_t rcount, const ompi_datatype_t* rdtype);
/*
*
*/
OMPI_DECLSPEC int32_t ompi_datatype_get_args( const ompi_datatype_t* pData, int32_t which,
int32_t * ci, int32_t * i,
int32_t * ca, ptrdiff_t* a,
int32_t * cd, ompi_datatype_t** d, int32_t * type);
OMPI_DECLSPEC int32_t ompi_datatype_set_args( ompi_datatype_t* pData,
int32_t ci, const int32_t ** i,
int32_t ca, const ptrdiff_t* a,
int32_t cd, ompi_datatype_t* const * d,int32_t type);
OMPI_DECLSPEC int32_t ompi_datatype_copy_args( const ompi_datatype_t* source_data,
ompi_datatype_t* dest_data );
OMPI_DECLSPEC int32_t ompi_datatype_release_args( ompi_datatype_t* pData );
OMPI_DECLSPEC ompi_datatype_t* ompi_datatype_get_single_predefined_type_from_args( ompi_datatype_t* type );
/**
* Return the amount of buffer necessary to pack the entire description of
* the datatype. This value is computed once per datatype, and it is stored
* in the datatype structure together with the packed description. As a side
* note special care is taken to align the amount of data on void* for
* architectures that require it.
*/
OMPI_DECLSPEC size_t ompi_datatype_pack_description_length( ompi_datatype_t* datatype );
/**
* Return a pointer to the constant packed representation of the datatype.
* The length can be retrieved with the ompi_datatype_pack_description_length,
* and it is quarantee this is exactly the amount to be copied and not an
* upper bound. Additionally, the packed representation is slightly optimized
* compared with the get_content function, as all combiner_dup have been replaced
* directly with the target type.
*/
OMPI_DECLSPEC int ompi_datatype_get_pack_description( ompi_datatype_t* datatype,
const void** packed_buffer );
/**
* Extract a fully-fledged datatype from the packed representation. This datatype
* is ready to be used in communications (it is automatically committed). However,
* this datatype does not have an internal representation, so it might not be
* repacked. Read the comment for the ompi_datatype_get_pack_description function
* for extra information.
*/
struct ompi_proc_t;
OMPI_DECLSPEC ompi_datatype_t*
ompi_datatype_create_from_packed_description( void** packed_buffer,
struct ompi_proc_t* remote_processor );
/**
* Auxiliary function providing a pretty print for the packed data description.
*/
OMPI_DECLSPEC int32_t ompi_datatype_print_args( const ompi_datatype_t* pData );
/**
* Get the number of basic elements of the datatype in ucount
*
* @returns OMPI_SUCCESS if the count is valid
* @returns OMPI_ERR_VALUE_OUT_OF_BOUNDS if no
*/
OMPI_DECLSPEC int ompi_datatype_get_elements (ompi_datatype_t *datatype, size_t ucount,
size_t *count);
#if OPAL_ENABLE_DEBUG
/*
* Set a breakpoint to this function in your favorite debugger
* to make it stop on all pack and unpack errors.
*/
OMPI_DECLSPEC int ompi_datatype_safeguard_pointer_debug_breakpoint( const void* actual_ptr, int length,
const void* initial_ptr,
const ompi_datatype_t* pData,
int count );
#endif /* OPAL_ENABLE_DEBUG */
OMPI_DECLSPEC int ompi_datatype_pack_external( const char datarep[], const void *inbuf, int incount,
ompi_datatype_t *datatype, void *outbuf,
MPI_Aint outsize, MPI_Aint *position);
OMPI_DECLSPEC int ompi_datatype_unpack_external( const char datarep[], const void *inbuf, MPI_Aint insize,
MPI_Aint *position, void *outbuf, int outcount,
ompi_datatype_t *datatype);
OMPI_DECLSPEC int ompi_datatype_pack_external_size( const char datarep[], int incount,
ompi_datatype_t *datatype, MPI_Aint *size);
#define OMPI_DATATYPE_RETAIN(ddt) \
{ \
if( !ompi_datatype_is_predefined((ddt)) ) { \
OBJ_RETAIN((ddt)); \
OPAL_OUTPUT_VERBOSE((0, 100, "Datatype %p [%s] refcount %d in file %s:%d\n", \
(void*)(ddt), (ddt)->name, (ddt)->super.super.obj_reference_count, \
__FILE__, __LINE__)); \
} \
}
#define OMPI_DATATYPE_RELEASE(ddt) \
{ \
if( !ompi_datatype_is_predefined((ddt)) ) { \
OPAL_OUTPUT_VERBOSE((0, 100, "Datatype %p [%s] refcount %d in file %s:%d\n", \
(void*)(ddt), (ddt)->name, (ddt)->super.super.obj_reference_count, \
__func__, __LINE__)); \
OBJ_RELEASE((ddt)); \
} \
}
#define OMPI_DATATYPE_RELEASE_NO_NULLIFY(ddt) \
{ \
if( !ompi_datatype_is_predefined((ddt)) ) { \
OPAL_OUTPUT_VERBOSE((0, 100, "Datatype %p [%s] refcount %d in file %s:%d\n", \
(void*)(ddt), (ddt)->name, (ddt)->super.super.obj_reference_count, \
__func__, __LINE__)); \
OBJ_RELEASE_NO_NULLIFY((ddt)); \
} \
}
/*
* Sometimes it's faster to operate on a (count,datatype) pair if it's
* converted to (1,larger_datatype). This comes up in pack/unpack if
* the datatype is [int4b,empty4b] for example. With that datatype the
* (count,datatype) path has to loop over the count processing each
* occurrence of the datatype, but a larger type created via
* MPI_Type_contiguous(count,datatype,) will have a single description
* entry describing the whole vector and go through pack/unpack much
* faster.
*
* These functions convert an incoming (count,dt) if the performance
* is potentially better.
*
* Note this function is only likely to be useful if the (count,datatype)
* describes a simple evenly spaced vector that will boil down to a
* single description element, but I don't think it's cheap to traverse
* the incoming datatype to check if that will be the case. Eg I'm not
* sure it would be cheap enough to check that
* [int,int,space,int,int,space] is going to convert nicely, vs
* [int,int,space,int,space] which isn't.
* So the only checks performed are that the (count,datatype) isn't
* contiguous, and that the count is large enough to justify the
* overhead of making a new datatype.
*/
typedef struct {
MPI_Datatype dt;
MPI_Count count;
int new_type_was_created;
} ompi_datatype_consolidate_t;
static inline int
ompi_datatype_consolidate_create(
MPI_Count count, MPI_Datatype dtype, ompi_datatype_consolidate_t *dtmod,
int threshold)
{
int rc;
size_t dtsize;
MPI_Aint lb, extent;
/* default (do nothing) unless we decide otherwise below */
dtmod->dt = dtype;
dtmod->count = count;
dtmod->new_type_was_created = 0;
if (count >= threshold) {
opal_datatype_type_size ( &dtype->super, &dtsize);
rc = ompi_datatype_get_extent( dtype, &lb, &extent );
if (rc != OMPI_SUCCESS) { return rc; }
if ((dtype->super.flags & OPAL_DATATYPE_FLAG_CONTIGUOUS) &&
(MPI_Aint)dtsize == extent)
{
/* contig, no performance advantage to making a new type */
} else {
rc = ompi_datatype_create_contiguous( count, dtype, &dtmod->dt );
if (rc != OMPI_SUCCESS) { return rc; }
ompi_datatype_commit(&dtmod->dt);
dtmod->count = 1;
dtmod->new_type_was_created = 1;
}
}
return OMPI_SUCCESS;
}
static inline int
ompi_datatype_consolidate_free(ompi_datatype_consolidate_t *dtmod)
{
int rc = OMPI_SUCCESS;
if (dtmod->new_type_was_created) {
rc = ompi_datatype_destroy( &dtmod->dt );
/* caller isn't supposed to free twice, but safety valve if they do: */
dtmod->new_type_was_created = 0;
}
return rc;
}
/*
* The magic number below just came from empirical testing on a couple
* local PPC machines using [int,space] as the datatype. There's some
* overhead in constructing a new datatype, so just walking a sequence of
* description elements is better for a short list of elements vs
* creating a potentially shorter list and hoping the vector-walking
* of the new elements is faster. This could maybe be tuned dynamically
* but it doesn't really seem worth it.
*
* I only tested on two machines, the crossover point for pack and unpack
* were 80 and 62 on one machine, and 250 and 220 on the other. So I lean
* toward using 250 for both and assuming that's likely to not waste too
* much overhead on the datatype creation for most cases.
*/
#define OMPI_DATATYPE_CONSOLIDATE_THRESHOLD 250
END_C_DECLS
#endif /* OMPI_DATATYPE_H_HAS_BEEN_INCLUDED */
|