ckolivas/lrzip
1
0
Fork 0
mirror of https://github.com/ckolivas/lrzip.git synced 2025-12-06 07:12:00 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix libzpaq.cpp warnings

Browse source
This commit is contained in:
Con Kolivas 2015-03-10 21:29:04 +11:00
parent 2e36d2a580
commit a9fadeec1c
1 changed files with 7 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
libzpaq/libzpaq.cpp
View file

@ -504,7 +504,7 @@ int ZPAQL::execute() {
case 59: a = (a+m(b)+512)*773; break; // HASH case 59: a = (a+m(b)+512)*773; break; // HASH
case 60: h(d) = (h(d)+a+512)*773; break; // HASHD case 60: h(d) = (h(d)+a+512)*773; break; // HASHD
case 63: pc+=((header[pc]+128)&255)-127; break; // JMP N case 63: pc+=((header[pc]+128)&255)-127; break; // JMP N
case 64: a = a; break; // A=A case 64: break; // A=A
case 65: a = b; break; // A=B case 65: a = b; break; // A=B
case 66: a = c; break; // A=C case 66: a = c; break; // A=C
case 67: a = d; break; // A=D case 67: a = d; break; // A=D
@ -513,7 +513,7 @@ int ZPAQL::execute() {
case 70: a = h(d); break; // A=*D case 70: a = h(d); break; // A=*D
case 71: a = header[pc++]; break; // A= N case 71: a = header[pc++]; break; // A= N
case 72: b = a; break; // B=A case 72: b = a; break; // B=A
case 73: b = b; break; // B=B case 73: break; // B=B
case 74: b = c; break; // B=C case 74: b = c; break; // B=C
case 75: b = d; break; // B=D case 75: b = d; break; // B=D
case 76: b = m(b); break; // B=*B case 76: b = m(b); break; // B=*B
@ -522,7 +522,7 @@ int ZPAQL::execute() {
case 79: b = header[pc++]; break; // B= N case 79: b = header[pc++]; break; // B= N
case 80: c = a; break; // C=A case 80: c = a; break; // C=A
case 81: c = b; break; // C=B case 81: c = b; break; // C=B
case 82: c = c; break; // C=C case 82: break; // C=C
case 83: c = d; break; // C=D case 83: c = d; break; // C=D
case 84: c = m(b); break; // C=*B case 84: c = m(b); break; // C=*B
case 85: c = m(c); break; // C=*C case 85: c = m(c); break; // C=*C
@ -531,7 +531,7 @@ int ZPAQL::execute() {
case 88: d = a; break; // D=A case 88: d = a; break; // D=A
case 89: d = b; break; // D=B case 89: d = b; break; // D=B
case 90: d = c; break; // D=C case 90: d = c; break; // D=C
case 91: d = d; break; // D=D case 91: break; // D=D
case 92: d = m(b); break; // D=*B case 92: d = m(b); break; // D=*B
case 93: d = m(c); break; // D=*C case 93: d = m(c); break; // D=*C
case 94: d = h(d); break; // D=*D case 94: d = h(d); break; // D=*D
@ -648,7 +648,7 @@ int ZPAQL::execute() {
case 213: a >>= (m(c)&31); break; // A>>=*C case 213: a >>= (m(c)&31); break; // A>>=*C
case 214: a >>= (h(d)&31); break; // A>>=*D case 214: a >>= (h(d)&31); break; // A>>=*D
case 215: a >>= (header[pc++]&31); break; // A>>= N case 215: a >>= (header[pc++]&31); break; // A>>= N
case 216: f = (a == a); break; // A==A case 216: f = (true); break; // A==A
case 217: f = (a == b); break; // A==B case 217: f = (a == b); break; // A==B
case 218: f = (a == c); break; // A==C case 218: f = (a == c); break; // A==C
case 219: f = (a == d); break; // A==D case 219: f = (a == d); break; // A==D
@ -656,7 +656,7 @@ int ZPAQL::execute() {
case 221: f = (a == U32(m(c))); break; // A==*C case 221: f = (a == U32(m(c))); break; // A==*C
case 222: f = (a == h(d)); break; // A==*D case 222: f = (a == h(d)); break; // A==*D
case 223: f = (a == U32(header[pc++])); break; // A== N case 223: f = (a == U32(header[pc++])); break; // A== N
case 224: f = (a < a); break; // A<A case 224: f = (false); break; // A<A
case 225: f = (a < b); break; // A<B case 225: f = (a < b); break; // A<B
case 226: f = (a < c); break; // A<C case 226: f = (a < c); break; // A<C
case 227: f = (a < d); break; // A<D case 227: f = (a < d); break; // A<D
@ -664,7 +664,7 @@ int ZPAQL::execute() {
case 229: f = (a < U32(m(c))); break; // A<*C case 229: f = (a < U32(m(c))); break; // A<*C
case 230: f = (a < h(d)); break; // A<*D case 230: f = (a < h(d)); break; // A<*D
case 231: f = (a < U32(header[pc++])); break; // A< N case 231: f = (a < U32(header[pc++])); break; // A< N
case 232: f = (a > a); break; // A>A case 232: f = (false); break; // A>A
case 233: f = (a > b); break; // A>B case 233: f = (a > b); break; // A>B
case 234: f = (a > c); break; // A>C case 234: f = (a > c); break; // A>C
case 235: f = (a > d); break; // A>D case 235: f = (a > d); break; // A>D