simplify code
This commit is contained in:
parent
869e6da81b
commit
993ceb4612
1 changed files with 0 additions and 6 deletions
|
@ -223,17 +223,11 @@ int laplace(void *arg)
|
||||||
for (i = 1; i < n + 1; i++) {
|
for (i = 1; i < n + 1; i++) {
|
||||||
// over all rows
|
// over all rows
|
||||||
for (j = 1; j < m + 1; j++) {
|
for (j = 1; j < m + 1; j++) {
|
||||||
#if 1
|
|
||||||
NewValues[I + i][J + j] =
|
NewValues[I + i][J + j] =
|
||||||
(OldValues[I + i - 1][J + j] +
|
(OldValues[I + i - 1][J + j] +
|
||||||
OldValues[I + i + 1][J + j] +
|
OldValues[I + i + 1][J + j] +
|
||||||
OldValues[I + i][J + j - 1] +
|
OldValues[I + i][J + j - 1] +
|
||||||
OldValues[I + i][J + j + 1]) / 4;
|
OldValues[I + i][J + j + 1]) / 4;
|
||||||
//if ( NewValues[I+i][J+j] < 0.0 ) NewValues[I+i][J+j] = 0.0 * FIX;
|
|
||||||
//else if ( NewValues[I+i][J+j] > 255.0 ) NewValues[I+i][J+j] = 255.0 * FIX;
|
|
||||||
#else
|
|
||||||
NewValues[I + i][J + j] = 25 * (DATA) (my_rank + 1);
|
|
||||||
#endif
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
#if USE_LAZYRELEASE
|
#if USE_LAZYRELEASE
|
||||||
|
|
Loading…
Add table
Reference in a new issue