feat: Due to the deep modifications related to names and packet format,

this task cover a large part of the codebase and involves several changes:

- the library provides a name data structure (hicn_name_t ), which is composed
  of a name prefix (hicn_name_prefix_t) and a name suffix (hicn_name_suffix_t),
  and it has been extended to provide all support functions required for name
  manipulation, including common prefix computation, as required for the Longest
  Prefix Match (LPM)in the forwarder, in addition to Exact Prefix Match (EPM).
- all code has been rewritten to use this data structure instead of having for
  instance the forwarder define its own name class (used to be Name and NameBitVector)
  the code has been refactored to minimize name allocations and copies, one remaining
  aspect is the difference of name storage between PIT and CS entries (respectively
  in the PIT entry, and in the message buffer), which causes the packet cache
  index to be updated when a PIT entry is converted into a CS entry. By storing
  the name in the PIT/CS entry everytime, we might save on this operation).
- hicn-light FIB has been rewritten : code has been refactored and should now be
  shorter and documented; unit tests have been drafted but more would be required
  to cover all cases and match the algorithms to add/remove nodes, as specified in the doc.
  all protocol details and hICN header formats are now abstracted by the library
  for the forwarder (and thus header.h and  protocols/*.h have been removed from
  public includes, and replaced by packet.h providing protocol agnostic packet
  level functions, completely replacing the compat.h header that used to provide
  similar functions.
- this works by exposing a opaque buffer to the application (a kind of socket buffer)
  which is used by the lib to cache the packet format and offsets of the different
  layers in the buffer and provider efficient operations (the packet format is
  either defined for packet construction, or guessed at ingress, and this structure
  is updated accordingly only once).

Co-authored-by: Jordan Augé <jordan.auge+fdio@cisco.com>
Signed-off-by: Luca Muscariello <muscariello@ieee.org>
Change-Id: I31e321897f85f0267fe8ba4720363c180564492f

1 files changed, 86 insertions, 0 deletions

diff --git a/lib/src/test/test_interest_manifest.cc b/lib/src/test/test_interest_manifest.cc
new file mode 100644
index 000000000..c912b0bc6
--- /dev/null
+++ b/lib/src/test/test_interest_manifest.cc
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2021 Cisco and/or its affiliates.
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at:
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#include <gtest/gtest.h>
+
+extern "C"
+{
+#include <hicn/interest_manifest.h>
+}
+
+static constexpr hicn_uword WORD_SIZE = WORD_WIDTH;
+
+class InterestManifestTest : public ::testing::Test
+{
+protected:
+  InterestManifestTest () {}
+  virtual ~InterestManifestTest () {}
+};
+
+TEST_F (InterestManifestTest, OneWordBitmapUpdate)
+{
+  hicn_uword initial_bitmap[1];
+  hicn_uword curr_bitmap[1] = { 0 };
+  initial_bitmap[0] =
+    0x0000000000000b07; // ...000000000000000000000101100000111
+
+  // Consume first 4 'one' bits (i.e. suffixes), reaching position 9
+  size_t pos = 0, max_suffixes = 4;
+  pos = interest_manifest_update_bitmap (initial_bitmap, curr_bitmap, pos,
+					 WORD_SIZE, max_suffixes);
+  EXPECT_EQ (pos, std::size_t (9));
+  EXPECT_EQ (curr_bitmap[0], hicn_uword (0x0000000000000107));
+
+  // Consume the remaining 2 'one' bits, reaching end of bitmap
+  hicn_uword curr_bitmap2[1] = { 0 };
+  pos = interest_manifest_update_bitmap (initial_bitmap, curr_bitmap2, pos,
+					 WORD_SIZE, max_suffixes);
+  EXPECT_EQ (pos, WORD_SIZE);
+  EXPECT_EQ (curr_bitmap2[0], hicn_uword (0x00000a00));
+
+  // Consume all suffixes at once
+  hicn_uword curr_bitmap3[1] = { 0 };
+  max_suffixes = 16;
+  pos = interest_manifest_update_bitmap (initial_bitmap, curr_bitmap3, 0,
+					 WORD_SIZE, max_suffixes);
+  EXPECT_EQ (pos, WORD_SIZE);
+  EXPECT_EQ (curr_bitmap3[0], initial_bitmap[0]);
+}
+
+TEST_F (InterestManifestTest, TwoWordBitmapUpdate)
+{
+  hicn_uword initial_bitmap[2];
+  initial_bitmap[0] = 0x0000000000000b07;
+  initial_bitmap[1] = 0x0000000000000b07;
+  // -> 0000000000000000000010110000011100000000000000000000101100000111
+
+  int expected_pos[] = { WORD_SIZE + 2, 2 * WORD_SIZE };
+  u32 expected_bitmap[][2] = { { 0x00000b07, 0x00000003 },
+			       { 0x0, 0x00000b04 } };
+
+  // Loop to consume all suffixes
+  int pos = 0, max_suffixes = 8, i = 0, len = WORD_SIZE * 2;
+  while (pos != len)
+    {
+      hicn_uword curr_bitmap[2] = { 0 };
+      pos = interest_manifest_update_bitmap (initial_bitmap, curr_bitmap, pos,
+					     len, max_suffixes);
+
+      EXPECT_EQ (pos, expected_pos[i]);
+      EXPECT_EQ (curr_bitmap[0], expected_bitmap[i][0]);
+      EXPECT_EQ (curr_bitmap[1], expected_bitmap[i][1]);
+      i++;
+    }
+}
\ No newline at end of file