-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathrep_test.c
More file actions
185 lines (137 loc) · 4.21 KB
/
Copy pathrep_test.c
File metadata and controls
185 lines (137 loc) · 4.21 KB
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
#include <stdio.h>
#include <sys/types.h>
#include <unistd.h>
#include <signal.h>
#include "src/replication/rep.h"
#include <pthread.h>
int initSeg = 80;
extern Node node;
// adding Node node here will result in node variable defined in MPI user's address space
// and not in libreplication address space.
//extern Node node;
void f4(int *a) {
sleep(10);
MPI_Send(a, 1, MPI_INT, 1, 0, MPI_COMM_WORLD);
/*if(node.rank == 1)
exit(EXIT_FAILURE);*/
sleep(10);
MPI_Send(a, 1, MPI_INT, 1, 0, MPI_COMM_WORLD);
sleep(10);
MPI_Send(a, 1, MPI_INT, 1, 0, MPI_COMM_WORLD);
sleep(10);
MPI_Send(a, 1, MPI_INT, 1, 0, MPI_COMM_WORLD);
}
void f3(int *a) {
f4(a);
}
void f2(int *a) {
f3(a);
}
void f1(int *a) {
f2(a);
}
int main(int argc, char** argv){
int rank, size = 9, len, oo = 9, sendRecvData;
char procName[100];
int *a, *b;
char *c;
int bkpt = 0;
/*while(0 == bkpt)
sleep(5);*/
MPI_Init(&argc, &argv);
//MPI_Comm_set_errhandler(MPI_COMM_WORLD, MPI_ERRORS_RETURN);
pid_t pid;
pid = getpid();
printf("Process ID: %d\n", pid);
/*if(node.rank == 1)
exit(EXIT_FAILURE);
MPI_Comm new_comm;
int sc = MPIX_Comm_shrink(node.world_job_comm, &new_comm);
if(sc != MPI_SUCCESS) {
char str[500];
int len;
MPI_Error_string(sc, str, &len);
printf("Rank: %d | Shrink not success | Message: %s\n", node.rank, str);
}
int rk, sz;
PMPI_Comm_size(new_comm, &sz);
PMPI_Comm_rank(new_comm, &rk);
printf("Rank: %d | After Shrink | Rank: %d | Size: %d\n", node.rank, rk, sz);*/
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
printf("[USER CODE] Rank Address: %p\n", &rank);
//if(rank == 1)
//readProcMapFile();
if(rank == 0) {
rep_malloc(&a, sizeof(int));
*a = 43;
oo = 96;
initSeg = 1945;
sendRecvData = 2019;
printf("[User Code] Container Address: %p | Rank: %d\n", &a, rank);
f1(&sendRecvData);
}
else {
rep_malloc(&b, sizeof(int));
*b = 34;
oo = 77;
initSeg = 200000;
printf("[User Code] Container Address: %p | Rank: %d\n", &a, rank);
sleep(10);
MPI_Recv(&sendRecvData, 1, MPI_INT, 0, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
printf("[User Code] BEFORE 1 | Rank: %d\n", rank);
sleep(10);
MPI_Recv(&sendRecvData, 1, MPI_INT, 0, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
printf("[User Code] BEFORE 2 | Rank: %d\n", rank);
sleep(10);
MPI_Recv(&sendRecvData, 1, MPI_INT, 0, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
printf("[User Code] BEFORE 3 | Rank: %d\n", rank);
sleep(10);
MPI_Recv(&sendRecvData, 1, MPI_INT, 0, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
printf("[User Code] BEFORE 4 | Rank: %d\n", rank);
}
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
printf("[User Code] Rank: %d\n", rank);
if(rank == 0)
printf("[Heap Seg] Rank: %d | [Users program] Value: %d | address: %p\n", rank, *a, a);
if(rank == 1)
printf("[Heap Seg] Rank: %d | [Users program] Value: %d | address: %p\n", rank, *b, b);
printf("[Data Seg] Rank: %d | [Users program] Value: %d | address: %p\n", rank, initSeg, &initSeg);
printf("[Stack Seg] Rank: %d | [Users program] Value: %d | address: %p\n", rank, oo, &oo);
printf("[Send recv Data] Rank: %d | [Users program] Value: %d\n", rank, sendRecvData);
//printf("**************Node Rank: %d\n", node.rank);
if(rank == 0) {
if(*a == 43)
printf("[Heap Seg] Rank: %d | SUCCESS\n", rank);
else
printf("[Heap Seg] Rank: %d | FAIL\n", rank);
if(initSeg == 1945)
printf("[Data Seg] Rank: %d | SUCCESS\n", rank);
else
printf("[Data Seg] Rank: %d | FAIL\n", rank);
if(oo == 96)
printf("[Stack Seg] Rank: %d | SUCCESS\n", rank);
else
printf("[Stack Seg] Rank: %d | FAIL\n", rank);
}
else if(rank == 1) {
if(*b == 34)
printf("[Heap Seg] Rank: %d | SUCCESS\n", rank);
else
printf("[Heap Seg] Rank: %d | FAIL\n", rank);
if(initSeg == 200000)
printf("[Data Seg] Rank: %d | SUCCESS\n", rank);
else
printf("[Data Seg] Rank: %d | FAIL\n", rank);
if(oo == 77)
printf("[Stack Seg] Rank: %d | SUCCESS\n", rank);
else
printf("[Stack Seg] Rank: %d | FAIL\n", rank);
if(sendRecvData == 2019)
printf("[Send recv Data] Rank: %d | SUCCESS\n", rank);
else
printf("[Send recv Data] Rank: %d | FAIL\n", rank);
}
printf("***Before Finalize %d\n", node.rank);
MPI_Finalize();
printf("******END of User Program %d\n", node.rank);
}