DragonX/dragonx
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

Cleanup code

Browse Source
This commit is contained in:
jl777
2019-04-01 03:06:38 -11:00
parent 32c65f4686
commit 16eddc774c
1 changed files with 13 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
src/komodo_gateway.h
View File

@@ -1738,36 +1738,26 @@ int32_t komodo_opretvalidate(int32_t nHeight,CScript scriptPubKey)
fprintf(stderr,"vs prev maxflag.%d cmp error\n",maxflag); fprintf(stderr,"vs prev maxflag.%d cmp error\n",maxflag);
return(-1); return(-1);
} // else this is the good case we hope to happen } // else this is the good case we hope to happen
} //else return(-1); } else return(-1);
if ( lag < ASSETCHAINS_BLOCKTIME && Mineropret.size() >= PRICES_SIZEBIT0 ) if ( lag < ASSETCHAINS_BLOCKTIME && Mineropret.size() >= PRICES_SIZEBIT0 )
{ {
memcpy(localbits,Mineropret.data(),Mineropret.size()); memcpy(localbits,Mineropret.data(),Mineropret.size());
for (i=0; i<n; i++) if ( nHeight < 500 )
if ( localbits[i] == 0 )
localbits[i] = prevbits[i];
/*if ( maxflag == 0 )
{ {
if ( komodo_pricecmp(nHeight,n,&maxflag,pricebits,localbits,PRICES_MAXCHANGE) < 0 ) for (i=0; i<n; i++)
{ if ( localbits[i] == 0 )
fprintf(stderr,"maxflag.0 cmp error\n"); localbits[i] = prevbits[i];
return(-1);
}
} }
else*/ for (i=1; i<n; i++)
{ {
for (i=1; i<n; i++) if ( (maxflag= maxflags[i]) != 0 )
{ {
//maxflag = 0; // make sure local price is moving in right direction
//if ( (newprice= komodo_pricenew(&maxflag,pricebits[i],prevbits[i],PRICES_MAXCHANGE)) != 0 ) // proposed price is clamped fprintf(stderr,"maxflag.%d i.%d localbits.%u vs pricebits.%u\n",maxflag,i,localbits[i],pricebits[i]);
if ( (maxflag= maxflags[i]) != 0 ) if ( maxflag > 0 && localbits[i] < prevbits[i] )
{ return(-1);
// make sure local price is moving in right direction else if ( maxflag < 0 && localbits[i] > prevbits[i] )
fprintf(stderr,"maxflag.%d i.%d localbits.%u vs pricebits.%u\n",maxflag,i,localbits[i],pricebits[i]); return(-1);
if ( maxflag > 0 && localbits[i] < prevbits[i] )
return(-1);
else if ( maxflag < 0 && localbits[i] > prevbits[i] )
return(-1);
}
} }
} }
} }