File: lockcontention.c

package info (click to toggle)
mpich 4.0.2-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 423,384 kB
  • sloc: ansic: 1,088,434; cpp: 71,364; javascript: 40,763; f90: 22,829; sh: 17,463; perl: 14,773; xml: 14,418; python: 10,265; makefile: 9,246; fortran: 8,008; java: 4,355; asm: 324; ruby: 176; lisp: 19; php: 8; sed: 4
file content (97 lines) | stat: -rw-r--r-- 2,757 bytes parent folder | download | duplicates (4)
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
/*
 * Copyright (C) by Argonne National Laboratory
 *     See COPYRIGHT in top-level directory
 */

#include "mpi.h"
#include "stdio.h"
#include "stdlib.h"
#include "mpitest.h"

/* This is a modified version of test4.c. Sent by Liwei Peng, Microsoft. */

/* tests passive target RMA on 3 processes. tests the lock-single_op-unlock
   optimization. */


#define SIZE1 100
#define SIZE2 200

int main(int argc, char *argv[])
{
    int rank, nprocs, A[SIZE2], B[SIZE2], i;
    MPI_Comm CommThree;
    MPI_Win win;
    int errs = 0;
    int trank = 1;

    MTest_Init(&argc, &argv);
    MPI_Comm_size(MPI_COMM_WORLD, &nprocs);
    MPI_Comm_rank(MPI_COMM_WORLD, &rank);

    if (nprocs < 3) {
        fprintf(stderr, "Run this program with 3 or more processes\n");
        MPI_Abort(MPI_COMM_WORLD, 1);
    }

    MPI_Comm_split(MPI_COMM_WORLD, (rank < 3), rank, &CommThree);

    if (rank < 3) {
        if (rank == 0) {
            for (i = 0; i < SIZE2; i++) {
                A[i] = B[i] = i;
            }
        } else if (rank == 2) {
            for (i = 0; i < SIZE2; i++) {
                A[i] = B[i] = -1;
            }
        } else if (rank == 1) {
            for (i = 0; i < SIZE2; i++) {
                B[i] = (-4) * i;
            }
        }

        MPI_Win_create(B, SIZE2 * sizeof(int), sizeof(int), MPI_INFO_NULL, CommThree, &win);

        if (rank == 0) {
            for (i = 0; i < SIZE1; i++) {
                MPI_Win_lock(MPI_LOCK_EXCLUSIVE, trank, 0, win);
                MPI_Put(A + i, 1, MPI_INT, trank, i, 1, MPI_INT, win);
                /*  MPI_Put(A+i, 1, MPI_INT, trank, i, 1, MPI_INT, win);
                 * MPI_Put(A+i, 1, MPI_INT, trank, i, 1, MPI_INT, win); */
                MPI_Win_unlock(trank, win);
            }

            MPI_Win_free(&win);
        } else if (rank == 2) {
            for (i = 0; i < SIZE1; i++) {
                MPI_Win_lock(MPI_LOCK_EXCLUSIVE, trank, 0, win);
                MPI_Get(A + i, 1, MPI_INT, trank, SIZE1 + i, 1, MPI_INT, win);
                MPI_Win_unlock(trank, win);
            }

            MPI_Win_free(&win);

            for (i = 0; i < SIZE1; i++)
                if (A[i] != (-4) * (i + SIZE1)) {
                    printf("Get Error: A[%d] is %d, should be %d\n", i, A[i], (-4) * (i + SIZE1));
                    errs++;
                }
        }

        else if (rank == 1) {   /*target */
            MPI_Win_free(&win);

            for (i = 0; i < SIZE1; i++) {
                if (B[i] != i) {
                    printf("Put Error: B[%d] is %d, should be %d\n", i, B[i], i);
                    errs++;
                }
            }
        }
    }
    MPI_Comm_free(&CommThree);

    MTest_Finalize(errs);
    return MTestReturnValue(errs);
}