refactor(*): remove runtime-inactive assert statements from non-test code

Author: bladehan1

actuator/src/main/java/org/tron/core/vm/repository/RepositoryImpl.java

@@ -900,7 +900,6 @@ private long increase(long lastUsage, long usage, long lastTime, long now, long
     long averageUsage = divideCeil(usage * precision, windowSize);
 
     if (lastTime != now) {
-      assert now > lastTime;
       if (lastTime + windowSize > now) {
         long delta = now - lastTime;
         double decay = (windowSize - delta) / (double) windowSize;
@@ -930,8 +929,6 @@ public long calculateGlobalEnergyLimit(AccountCapsule accountCapsule) {
     long totalEnergyLimit = getDynamicPropertiesStore().getTotalEnergyCurrentLimit();
     long totalEnergyWeight = getDynamicPropertiesStore().getTotalEnergyWeight();
 
-    assert totalEnergyWeight > 0;
-
     return (long) (energyWeight * ((double) totalEnergyLimit / totalEnergyWeight));
   }
 

chainbase/src/main/java/org/tron/common/zksnark/MerklePath.java

@@ -75,7 +75,6 @@ private static long convertVectorToLong(List<Boolean> v) throws ZksnarkException
   }
 
   public byte[] encode() throws ZksnarkException {
-    assert (authenticationPath.size() == index.size());
     List<List<Byte>> pathByteList = Lists.newArrayList();
     long indexLong; // 64
     for (int i = 0; i < authenticationPath.size(); i++) {

chainbase/src/main/java/org/tron/core/db/EnergyProcessor.java

@@ -153,7 +153,6 @@ public long calculateGlobalEnergyLimit(AccountCapsule accountCapsule) {
     if (dynamicPropertiesStore.allowNewReward() && totalEnergyWeight <= 0) {
       return 0;
     } else {
-      assert totalEnergyWeight > 0;
     }
     return (long) (energyWeight * ((double) totalEnergyLimit / totalEnergyWeight));
   }
@@ -187,4 +186,3 @@ private long getHeadSlot() {
 
 }
 
-

chainbase/src/main/java/org/tron/core/db/ResourceProcessor.java

@@ -49,7 +49,6 @@ protected long increase(long lastUsage, long usage, long lastTime, long now, lon
     long averageUsage = divideCeil(usage * precision, windowSize);
 
     if (lastTime != now) {
-      assert now > lastTime;
       if (lastTime + windowSize > now) {
         long delta = now - lastTime;
         double decay = (windowSize - delta) / (double) windowSize;

crypto/src/main/java/org/tron/common/crypto/Blake2bfMessageDigest.java

@@ -79,7 +79,6 @@ public static class Blake2bfDigest implements Digest {
     // for tests
     Blake2bfDigest(
         final long[] h, final long[] m, final long[] t, final boolean f, final long rounds) {
-      assert rounds <= 4294967295L; // uint max value
       buffer = new byte[MESSAGE_LENGTH_BYTES];
       bufferPos = 0;
 
@@ -269,4 +268,3 @@ private void mix(
     }
   }
 }
-

framework/src/main/java/org/tron/core/trie/TrieImpl.java

@@ -758,7 +758,6 @@ private void parse() {
 
     public Node branchNodeGetChild(int hex) {
       parse();
-      assert getType() == NodeType.BranchNode;
       Object n = children[hex];
       if (n == null && parsedRlp != null) {
         if (parsedRlp.isList(hex)) {
@@ -778,15 +777,13 @@ public Node branchNodeGetChild(int hex) {
 
     public Node branchNodeSetChild(int hex, Node node) {
       parse();
-      assert getType() == NodeType.BranchNode;
       children[hex] = node == null ? NULL_NODE : node;
       dirty = true;
       return this;
     }
 
     public byte[] branchNodeGetValue() {
       parse();
-      assert getType() == NodeType.BranchNode;
       Object n = children[16];
       if (n == null && parsedRlp != null) {
         byte[] bytes = parsedRlp.getBytes(16);
@@ -802,15 +799,13 @@ public byte[] branchNodeGetValue() {
 
     public Node branchNodeSetValue(byte[] val) {
       parse();
-      assert getType() == NodeType.BranchNode;
       children[16] = val == null ? NULL_NODE : val;
       dirty = true;
       return this;
     }
 
     public int branchNodeCompactIdx() {
       parse();
-      assert getType() == NodeType.BranchNode;
       int cnt = 0;
       int idx = -1;
       for (int i = 0; i < 16; i++) {
@@ -827,7 +822,6 @@ public int branchNodeCompactIdx() {
 
     public boolean branchNodeCanCompact() {
       parse();
-      assert getType() == NodeType.BranchNode;
       int cnt = 0;
       for (int i = 0; i < 16; i++) {
         cnt += branchNodeGetChild(i) == null ? 0 : 1;
@@ -840,39 +834,33 @@ public boolean branchNodeCanCompact() {
 
     public TrieKey kvNodeGetKey() {
       parse();
-      assert getType() != NodeType.BranchNode;
       return (TrieKey) children[0];
     }
 
     public Node kvNodeGetChildNode() {
       parse();
-      assert getType() == NodeType.KVNodeNode;
       return (Node) children[1];
     }
 
     public byte[] kvNodeGetValue() {
       parse();
-      assert getType() == NodeType.KVNodeValue;
       return (byte[]) children[1];
     }
 
     public Node kvNodeSetValue(byte[] value) {
       parse();
-      assert getType() == NodeType.KVNodeValue;
       children[1] = value;
       dirty = true;
       return this;
     }
 
     public Object kvNodeGetValueOrNode() {
       parse();
-      assert getType() != NodeType.BranchNode;
       return children[1];
     }
 
     public Node kvNodeSetValueOrNode(Object valueOrNode) {
       parse();
-      assert getType() != NodeType.BranchNode;
       children[1] = valueOrNode;
       dirty = true;
       return this;