move udpard_fragment_free

Author: pavel-kirienko

libudpard/udpard.c

@@ -129,16 +129,15 @@ static uint32_t crc_add_byte(const uint32_t crc, const byte_t byte)
 }
 
 /// Do not forget to apply the output XOR when done, or use crc_compute().
-static uint32_t crc_add(const uint32_t crc, const size_t size, const void* const data)
+static uint32_t crc_add(uint32_t crc, const size_t size, const void* const data)
 {
     UDPARD_ASSERT((data != NULL) || (size == 0U));
-    uint32_t      out = crc;
-    const byte_t* p   = (const byte_t*)data;
+    const byte_t* p = (const byte_t*)data;
     for (size_t i = 0; i < size; i++) {
-        out = crc_add_byte(out, *p);
+        crc = crc_add_byte(crc, *p);
         ++p;
     }
-    return out;
+    return crc;
 }
 
 static uint32_t crc_compute(const size_t size, const void* const data)

libudpard/udpard.h

@@ -240,6 +240,14 @@ typedef struct udpard_fragment_t
     udpard_mem_deleter_t payload_deleter;
 } udpard_fragment_t;
 
+/// Frees the memory allocated for the payload and its fragment headers using the correct memory resources.
+/// The application can do the same thing manually if it has access to the required context to compute the size,
+/// or if the memory resource implementation does not require deallocation size.
+/// The head of the fragment list is passed by value so it is not freed. This is in line with the udpard_rx_transfer_t
+/// design, where the head is stored by value to reduce indirection in small transfers. We call it Scott's Head.
+/// If any of the arguments are NULL, the function has no effect.
+void udpard_fragment_free(const udpard_fragment_t head, const udpard_mem_resource_t memory_fragment);
+
 // =====================================================================================================================
 // =================================================    TX PIPELINE    =================================================
 // =====================================================================================================================
@@ -621,16 +629,6 @@ bool udpard_rx_new(udpard_rx_t* const                 self,
 /// The time complexity is logarithmic in the number of living sessions.
 void udpard_rx_poll(udpard_rx_t* const self, const udpard_microsecond_t now);
 
-/// Frees the memory allocated for the payload and its fragment headers using the correct memory resources.
-/// The application can do the same thing manually if it has access to the required context to compute the size,
-/// or if the memory resource implementation does not require deallocation size.
-/// The head of the fragment list is passed by value so it is not freed. This is in line with the UdpardRxTransfer
-/// design, where the head is stored by value to reduce indirection in small transfers. We call it Scott's Head.
-/// If any of the arguments are NULL, the function has no effect.
-void udpard_rx_fragment_free(const udpard_fragment_t     head,
-                             const udpard_mem_resource_t memory_fragment,
-                             const udpard_mem_deleter_t  memory_payload);
-
 /// To subscribe to a subject, the application should do this:
 ///     1. Create a new udpard_rx_subscription_t instance using udpard_rx_subscription_new().
 ///     2. Per redundant network interface: