|
9 | 9 | * reserved. |
10 | 10 | * Copyright (c) 2014-2018 Research Organization for Information Science |
11 | 11 | * and Technology (RIST). All rights reserved. |
12 | | - * Copyright (c) 2017 IBM Corporation. All rights reserved. |
| 12 | + * Copyright (c) 2017-2022 IBM Corporation. All rights reserved. |
13 | 13 | * Copyright (c) 2018 FUJITSU LIMITED. All rights reserved. |
14 | 14 | * $COPYRIGHT$ |
15 | 15 | * |
@@ -768,9 +768,9 @@ allred_sched_ring(int r, int p, |
768 | 768 | /* first p-1 rounds are reductions */ |
769 | 769 | for (int round = 0 ; round < p - 1 ; ++round) { |
770 | 770 | int selement = (r+1-round + 2*p /*2*p avoids negative mod*/)%p; /* the element I am sending */ |
771 | | - int soffset = segoffsets[selement]*ext; |
| 771 | + size_t soffset = segoffsets[selement]*(size_t)ext; |
772 | 772 | int relement = (r-round + 2*p /*2*p avoids negative mod*/)%p; /* the element that I receive from my neighbor */ |
773 | | - int roffset = segoffsets[relement]*ext; |
| 773 | + size_t roffset = segoffsets[relement]*(size_t)ext; |
774 | 774 |
|
775 | 775 | /* first message come out of sendbuf */ |
776 | 776 | if (round == 0) { |
@@ -807,9 +807,9 @@ allred_sched_ring(int r, int p, |
807 | 807 | } |
808 | 808 | for (int round = p - 1 ; round < 2 * p - 2 ; ++round) { |
809 | 809 | int selement = (r+1-round + 2*p /*2*p avoids negative mod*/)%p; /* the element I am sending */ |
810 | | - int soffset = segoffsets[selement]*ext; |
| 810 | + size_t soffset = segoffsets[selement]*(size_t)ext; |
811 | 811 | int relement = (r-round + 2*p /*2*p avoids negative mod*/)%p; /* the element that I receive from my neighbor */ |
812 | | - int roffset = segoffsets[relement]*ext; |
| 812 | + size_t roffset = segoffsets[relement]*(size_t)ext; |
813 | 813 |
|
814 | 814 | res = NBC_Sched_send ((char *) recvbuf + soffset, false, segsizes[selement], datatype, speer, |
815 | 815 | schedule, false); |
|
0 commit comments