updated on Thu Jan 19 16:10:29 UTC 2012
[aur-mirror.git] / libecwj2 / libecwj2-3.3-2593.patch
blobfbb66adca78c53002425b918c5ba48761515e10c
1 --- Source/C/NCSEcw/NCSJP2/NCSJPCResolution.cpp 2006-07-03 10:15:12.000000000 -0500
2 +++ Source/C/NCSEcw/NCSJP2/NCSJPCResolution.cpp 2008-12-10 08:58:47.000000000 -0600
3 @@ -1773,11 +1773,11 @@
4 //Step0-1 == 2State.
5 //
7 - UINT32 n = 0;
8 + INT32 n = 0;
9 nWidth = NCSCeilDiv(nWidth, 2);
11 - UINT32 n2n = n * 2 - 2;
13 + INT32 n2n = n * 2 - 2;
15 INT32 nPrevVert01 = pSrc1Down[n2n] - NCSFloorDiv(pSrc0[n2n] + pSrc2Down[n2n], 2);
16 INT32 nPrevVert11 = pSrc1Down[n2n+1] - NCSFloorDiv(pSrc0[n2n+1] + pSrc2Down[n2n+1], 2);
17 INT32 nPrevVert00 = pSrc0[n2n] + NCSFloorDiv(pSrc1Up[n2n] - NCSFloorDiv(pSrc2Up[n2n] + pSrc0[n2n], 2) + nPrevVert01 + 2, 4);
18 @@ -1788,7 +1788,7 @@
19 INT32 nVert01 = pSrc1Down[n2n] - NCSFloorDiv(pSrc0[n2n] + pSrc2Down[n2n], 2);
20 INT32 nVert00 = pSrc0[n2n] + NCSFloorDiv(pSrc1Up[n2n] - NCSFloorDiv(pSrc2Up[n2n] + pSrc0[n2n], 2) + nVert01 + 2, 4);
22 - for(; n < nWidth; n++) {
23 + for(; n < (INT32)nWidth; n++) {
24 n2n = 2 * n;
26 INT32 nVert11 = pSrc1Down[n2n+1] - NCSFloorDiv(pSrc0[n2n+1] + pSrc2Down[n2n+1], 2);