hardfork: change window semantics to not count the newly added block

This allows knowing the hard fork a block must obey in order to be
added to the blockchain. The previous semantics would use that new
block's version vote to determine this hard fork, which made it
impossible to use the rules to validate transactions entering the
tx pool (and made it impossible to validate a block before adding
it to the blockchain).

1 files changed, 13 insertions, 10 deletions

diff --git a/tests/unit_tests/hardfork.cpp b/tests/unit_tests/hardfork.cpp
index ad00ed60f..a476eca22 100644
--- a/tests/unit_tests/hardfork.cpp
+++ b/tests/unit_tests/hardfork.cpp
@@ -238,7 +238,7 @@ TEST(steps_1, Success)
   }
 
   for (uint64_t h = 0; h < 10; ++h) {
-    ASSERT_EQ(hf.get(h), h+1);
+    ASSERT_EQ(hf.get(h), std::max(1,(int)h));
   }
 }
 
@@ -265,7 +265,7 @@ TEST(reorganize, Same)
     for (uint64_t rh = 0; rh < 20; ++rh) {
       hf.reorganize_from_block_height(rh);
       for (int hh = 0; hh < 20; ++hh) {
-        uint8_t version = hh >= (history-1) ? block_versions[hh - (history-1)] : 1;
+        uint8_t version = hh >= history ? block_versions[hh - history] : 1;
         ASSERT_EQ(hf.get(hh), version);
       }
     }
@@ -285,8 +285,10 @@ TEST(reorganize, Changed)
   ASSERT_TRUE(hf.add(9, 6, 3));
   hf.init();
 
+  //                                 fork         4     7     9
   //                                 index  0  1  2  3  4  5  6  7  8  9
   static const uint8_t block_versions[] = { 1, 1, 4, 4, 7, 7, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 };
+  static const uint8_t expected_versions[] = { 1, 1, 1, 1, 1, 1, 4, 4, 7, 7, 9, 9, 9, 9, 9, 9 };
   for (uint64_t h = 0; h < 16; ++h) {
     db.add_block(mkblock(block_versions[h]), 0, 0, 0, crypto::hash());
     ASSERT_TRUE (hf.add(db.get_block_from_height(h), h));
@@ -295,14 +297,13 @@ TEST(reorganize, Changed)
   for (uint64_t rh = 0; rh < 16; ++rh) {
     hf.reorganize_from_block_height(rh);
     for (int hh = 0; hh < 16; ++hh) {
-      uint8_t version = hh >= (history-1) ? block_versions[hh - (history-1)] : 1;
-      ASSERT_EQ(hf.get(hh), version);
+      ASSERT_EQ(hf.get(hh), expected_versions[hh]);
     }
   }
 
   // delay a bit for 9, and go back to 1 to check it stays at 9
   static const uint8_t block_versions_new[] =    { 1, 1, 4, 4, 7, 7, 4, 7, 7, 7, 9, 9, 9, 9, 9, 1 };
-  static const uint8_t expected_versions_new[] = { 1, 1, 1, 1, 1, 4, 4, 4, 4, 4, 7, 7, 7, 9, 9, 9 };
+  static const uint8_t expected_versions_new[] = { 1, 1, 1, 1, 1, 1, 4, 4, 4, 4, 4, 7, 7, 7, 9, 9 };
   for (uint64_t h = 3; h < 16; ++h) {
     db.remove_block();
   }
@@ -336,11 +337,13 @@ TEST(voting, threshold)
       db.add_block(mkblock(v), 0, 0, 0, crypto::hash());
       bool ret = hf.add(db.get_block_from_height(h), h);
       if (h >= 8 && threshold == 87) {
+        // for threshold 87, we reach the treshold at height 7, so from height 8, hard fork to version 2, but 8 tries to add 1
         ASSERT_FALSE(ret);
       }
       else {
+        // for threshold 88, we never reach the threshold
         ASSERT_TRUE(ret);
-        uint8_t expected = threshold == 88 ? 1 : h < 7 ? 1 : 2;
+        uint8_t expected = threshold == 88 ? 1 : h < 8 ? 1 : 2;
         ASSERT_EQ(hf.get(h), expected);
       }
     }
@@ -370,7 +373,7 @@ TEST(new_blocks, denied)
     ASSERT_FALSE(hf.add(mkblock(1), 9)); // so this one can't get added
     ASSERT_TRUE(hf.add(mkblock(2), 10));
 
-    ASSERT_EQ(hf.get_start_height(2), 8);
+    ASSERT_EQ(hf.get_start_height(2), 9);
 }
 
 TEST(new_version, early)
@@ -428,8 +431,8 @@ TEST(reorganize, changed)
     ADD_TRUE(3, 7);
     ADD_TRUE(4, 8);
     ADD_TRUE(4, 9);
-    ASSERT_EQ(hf.get_start_height(2), 3);
-    ASSERT_EQ(hf.get_start_height(3), 8);
+    ASSERT_EQ(hf.get_start_height(2), 4); // reaches threshold 2 at height 3, so height 4 forks
+    ASSERT_EQ(hf.get_start_height(3), 9);
     ASSERT_EQ(hf.get_current_version(), 3);
 
     // pop a few blocks and check current version goes back down
@@ -446,7 +449,7 @@ TEST(reorganize, changed)
     ADD_TRUE(2, 7);
     ADD_TRUE(2, 8);
     ADD_TRUE(2, 9);
-    ASSERT_EQ(hf.get_start_height(2), 3); // unchanged
+    ASSERT_EQ(hf.get_start_height(2), 4); // unchanged
     ASSERT_EQ(hf.get_current_version(), 2); // we did not bump to 3 this time
     ASSERT_EQ(hf.get_start_height(3), std::numeric_limits<uint64_t>::max()); // not yet
 }