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
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
/*
* This is a test case to make sure synchronization in unlock works correctly.
*
* Essentially this program does the following:
*
* lock_all
* req=rget(buf)
* unlock_all
* re-use buf
* wait(req)
*
* This program is valid but if unlock_all does not implement the synchronization
* semantics correctly reusing the buffer would race with outstanding rgets.
*/
#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
#include <mpi.h>
#include "mpitest.h"
#define N_ELMS (128)
#define BLOCKSIZE (1)
#define N_BLOCKS (N_ELMS/BLOCKSIZE)
int main(int argc, char *argv[])
{
MPI_Win win;
int i;
int *rbuf, *lbuf;
int rank, size, trg;
MPI_Request *reqs;
int errs = 0;
MTest_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &size);
trg = (rank + 1) % size;
rbuf = malloc(sizeof(int) * N_ELMS);
for (i = 0; i < N_ELMS; i++)
rbuf[i] = rank;
lbuf = malloc(sizeof(int) * N_ELMS);
memset(lbuf, -1, sizeof(int) * N_ELMS);
reqs = malloc(sizeof(MPI_Request) * N_BLOCKS);
MPI_Win_create(rbuf, sizeof(int) * N_ELMS, sizeof(int), MPI_INFO_NULL, MPI_COMM_WORLD, &win);
MPI_Win_lock_all(MPI_MODE_NOCHECK, win);
for (i = 0; i < N_BLOCKS; i++)
MPI_Rget(lbuf + i * BLOCKSIZE, BLOCKSIZE, MPI_INT, trg, i * BLOCKSIZE, BLOCKSIZE, MPI_INT,
win, &reqs[i]);
MPI_Win_unlock_all(win);
for (i = 0; i < N_ELMS; i++)
lbuf[i] = -2;
MPI_Waitall(N_BLOCKS, reqs, MPI_STATUSES_IGNORE);
for (i = 0; i < N_ELMS; i++) {
int v = lbuf[i];
if (v != -2) {
printf("lbuf[%d]=%d, expected -2\n", i, v);
errs++;
}
}
MPI_Win_free(&win);
free(reqs);
free(lbuf);
free(rbuf);
MTest_Finalize(errs);
return MTestReturnValue(errs);
}
|
