A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Merge if statements.
[simgrid.git]
/
teshsuite
/
smpi
/
coll-bcast
/
coll-bcast.c
diff --git
a/teshsuite/smpi/coll-bcast/coll-bcast.c
b/teshsuite/smpi/coll-bcast/coll-bcast.c
index
0e22735
..
a53771a
100644
(file)
--- a/
teshsuite/smpi/coll-bcast/coll-bcast.c
+++ b/
teshsuite/smpi/coll-bcast/coll-bcast.c
@@
-1,4
+1,4
@@
-/* Copyright (c) 2009, 2013-201
4
. The SimGrid Team.
+/* Copyright (c) 2009, 2013-201
7
. The SimGrid Team.
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
@@
-9,7
+9,9
@@
int main(int argc, char **argv)
{
int main(int argc, char **argv)
{
- int i, size, rank;
+ int i;
+ int size;
+ int rank;
int count = 2048;
MPI_Init(&argc, &argv);
int count = 2048;
MPI_Init(&argc, &argv);
@@
-32,7
+34,7
@@
int main(int argc, char **argv)
xbt_free(values);
count = 4096;
xbt_free(values);
count = 4096;
- values = (int *) xbt_malloc(count * sizeof(int));
+ values = (int *) xbt_malloc(count * sizeof(int));
for (i = 0; i < count; i++)
values[i] = (size -1 == rank) ? 17 : 3;
for (i = 0; i < count; i++)
values[i] = (size -1 == rank) ? 17 : 3;
@@
-44,11
+46,9
@@
int main(int argc, char **argv)
if (values[i]==17) good++;
printf("[%d] number of values equals to 17: %d\n", rank, good);
if (values[i]==17) good++;
printf("[%d] number of values equals to 17: %d\n", rank, good);
- if (rank == 0) {
- if (status != MPI_SUCCESS) {
- printf("bcast returned %d\n", status);
- fflush(stdout);
- }
+ if (rank == 0 && status != MPI_SUCCESS) {
+ printf("bcast returned %d\n", status);
+ fflush(stdout);
}
xbt_free(values);
MPI_Finalize();
}
xbt_free(values);
MPI_Finalize();