文件
rocm-systems/tests/sos_tests/bcast.cpp
T
2024-11-25 14:25:29 -06:00

145 行
3.9 KiB
C++

/*
* Copyright 2011 Sandia Corporation. Under the terms of Contract
* DE-AC04-94AL85000 with Sandia Corporation, the U.S. Government
* retains certain rights in this software.
*
* Copyright (c) 2017 Intel Corporation. All rights reserved.
* This software is available to you under the BSD license below:
*
* Redistribution and use in source and binary forms, with or
* without modification, are permitted provided that the following
* conditions are met:
*
* - Redistributions of source code must retain the above
* copyright notice, this list of conditions and the following
* disclaimer.
*
* - Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
/*
* broadcast [0...num_pes]
*
* usage: bcast {-v|h}
*
* Loop - rocshmem_broadcast_all() with increasing data amount.
*/
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <rocshmem/rocshmem.hpp>
using namespace rocshmem;
#define START_BCAST_SIZE 16
#define BCAST_INCR 1024
int main(int argc, char *argv[]) {
int i, Verbose = 0;
int mpe, num_pes, loops = 10, cloop;
char *pgm;
long *dst, *src;
int nBytes = START_BCAST_SIZE;
int nLongs = 0;
long *pSync;
rocshmem_init();
mpe = rocshmem_my_pe();
num_pes = rocshmem_n_pes();
if (num_pes == 1) {
printf("%s: Requires number of PEs > 1\n", argv[0]);
rocshmem_finalize();
return 0;
}
if (sizeof(long) != 8) {
printf("Test assumes 64-bit long (%zd)\n", sizeof(long));
rocshmem_global_exit(1);
return 0;
}
if ((pgm = strrchr(argv[0], '/'))) {
pgm++;
} else {
pgm = argv[0];
}
if (argc > 1) {
if (strncmp(argv[1], "-v", 3) == 0) {
Verbose = 1;
} else if (strncmp(argv[1], "-h", 3) == 0) {
fprintf(stderr, "usage: %s {-v(verbose)|h(help)}\n", pgm);
rocshmem_finalize();
exit(1);
}
}
pSync = (long *)rocshmem_malloc(ROCSHMEM_BCAST_SYNC_SIZE);
for (i = 0; i < ROCSHMEM_BCAST_SYNC_SIZE; i += 1) {
pSync[i] = ROCSHMEM_SYNC_VALUE;
}
if (mpe == 0 && Verbose) {
fprintf(stderr, "%d loops\n", loops);
}
for (cloop = 1; cloop <= loops; cloop++) {
nLongs = nBytes / sizeof(long);
dst = (long *)rocshmem_malloc(nBytes * 2);
if (!dst) {
fprintf(stderr, "[%d] rocshmem_malloc(%d) failed %s\n", mpe, nBytes,
strerror(errno));
return 0;
}
memset((void *)dst, 0, nBytes);
src = &dst[nLongs];
for (i = 1; i < nLongs; i++) {
src[i] = i + 1;
}
rocshmem_barrier_all();
rocshmem_ctx_long_broadcast(ROCSHMEM_CTX_DEFAULT, dst, src, nLongs, 1, 0,
0, num_pes, pSync);
for (i = 0; i < nLongs; i++) {
/* the root node shouldn't have the result into dst (cf specification).*/
if (1 != mpe && dst[i] != src[i]) {
fprintf(stderr, "[%d] dst[%d] %ld != expected %ld\n", mpe, i, dst[i],
src[i]);
rocshmem_global_exit(1);
} else if (1 == mpe && dst[i] != 0) {
fprintf(stderr, "[%d] dst[%d] %ld != expected 0\n", mpe, i, dst[i]);
rocshmem_global_exit(1);
}
}
rocshmem_barrier_all();
rocshmem_free(dst);
if (Verbose && mpe == 0)
fprintf(stderr, "loop %2d Bcast %d, Done.\n", cloop, nBytes);
nBytes += BCAST_INCR;
}
rocshmem_finalize();
return 0;
}