add fill count func added

This commit is contained in:
Robin Müller 2020-10-14 23:41:16 +02:00
parent 7bd536e763
commit 57c9775d7d
3 changed files with 66 additions and 23 deletions

View File

@ -286,3 +286,16 @@ ReturnValue_t LocalPool::findEmpty(uint16_t poolIndex, uint16_t *element) {
} }
return status; return status;
} }
size_t LocalPool::getTotalSize(size_t* additionalSize) {
size_t totalSize = 0;
size_t sizesSize = 0;
for(uint8_t idx = 0; idx < NUMBER_OF_POOLS; idx ++) {
totalSize += elementSizes[idx] * numberOfElements[idx];
sizesSize += numberOfElements[idx] * sizeof(size_type);
}
if(additionalSize != nullptr) {
*additionalSize = sizesSize;
}
return totalSize;
}

View File

@ -16,14 +16,14 @@
/** /**
* @brief The LocalPool class provides an intermediate data storage with * @brief The LocalPool class provides an intermediate data storage with
* a fixed pool size policy. * a fixed pool size policy.
* @details The class implements the StorageManagerIF interface. While the * @details
* total number of pools is fixed, the element sizes in one pool and * The class implements the StorageManagerIF interface. While the total number
* the number of pool elements per pool are set on construction. * of pools is fixed, the element sizes in one pool and the number of pool
* The full amount of memory is allocated on construction. * elements per pool are set on construction. The full amount of memory is
* The overhead is 4 byte per pool element to store the size * allocated on construction.
* information of each stored element. * The overhead is 4 byte per pool element to store the size information of
* To maintain an "empty" information, the pool size is limited to * each stored element. To maintain an "empty" information, the pool size is
* 0xFFFF-1 bytes. * limited to 0xFFFF-1 bytes.
* It is possible to store empty packets in the pool. * It is possible to store empty packets in the pool.
* The local pool is NOT thread-safe. * The local pool is NOT thread-safe.
*/ */
@ -42,21 +42,21 @@ public:
const uint8_t NUMBER_OF_POOLS; const uint8_t NUMBER_OF_POOLS;
/** /**
* @brief This is the default constructor for a pool manager instance. * @brief This is the default constructor for a pool manager instance.
* @details By passing two arrays of size NUMBER_OF_POOLS, the constructor * @details
* allocates memory (with @c new) for store and size_list. These * The pool is configured by passing a set of pairs into the constructor.
* regions are all set to zero on start up. * The first value of that pair determines the number of one element on
* the respective page of the pool while the second value determines how
* many elements with that size are created on that page.
* All regions are to zero on start up.
* @param setObjectId The object identifier to be set. This allows for * @param setObjectId The object identifier to be set. This allows for
* multiple instances of LocalPool in the system. * multiple instances of LocalPool in the system.
* @param element_sizes An array of size NUMBER_OF_POOLS in which the size * @param poolConfig
* of a single element in each pool is determined. * This is a set of pairs to configure the number of pages in the pool,
* <b>The sizes must be provided in ascending order. * the size of an element on a page, the number of elements on a page
* </b> * and the total size of the pool at once while also implicitely
* @param n_elements An array of size NUMBER_OF_POOLS in which the * sorting the pairs in the right order.
* number of elements for each pool is determined. * @param registered
* The position of these values correspond to those in * Determines whether the pool is registered in the object manager or not.
* element_sizes.
* @param registered Register the pool in object manager or not.
* Default is false (local pool).
* @param spillsToHigherPools A variable to determine whether * @param spillsToHigherPools A variable to determine whether
* higher n pools are used if the store is full. * higher n pools are used if the store is full.
*/ */
@ -90,6 +90,26 @@ public:
virtual ReturnValue_t deleteData(store_address_t storeId) override; virtual ReturnValue_t deleteData(store_address_t storeId) override;
virtual ReturnValue_t deleteData(uint8_t* ptr, size_t size, virtual ReturnValue_t deleteData(uint8_t* ptr, size_t size,
store_address_t* storeId = nullptr) override; store_address_t* storeId = nullptr) override;
/**
* Get the total size of allocated memory for pool data.
* There is an additional overhead of the sizes of elements which will
* be assigned to additionalSize
* @return
*/
size_t getTotalSize(size_t* additionalSize) override;
/**
* Get the fill count of the pool. Each character inside the provided
* buffer will be assigned to a rounded percentage fill count for each
* page. The last written byte (at the index number of pools + 1)
* will contain the total fill count of the pool as a mean of the
* percentages.
* @param buffer
* @param maxSize
*/
void getFillCount(uint8_t* buffer, uint8_t* bytesWritten) override;
void clearStore() override; void clearStore() override;
ReturnValue_t initialize() override; ReturnValue_t initialize() override;
protected: protected:

View File

@ -164,6 +164,16 @@ public:
* Use with care! * Use with care!
*/ */
virtual void clearStore() = 0; virtual void clearStore() = 0;
/**
* Get the fill count of the pool. The exact form will be implementation
* dependant.
* @param buffer
* @param bytesWritten
*/
virtual void getFillCount(uint8_t* buffer, uint8_t* bytesWritten) = 0;
virtual size_t getTotalSize(size_t* additionalSize) = 0;
}; };
#endif /* FSFW_STORAGEMANAGER_STORAGEMANAGERIF_H_ */ #endif /* FSFW_STORAGEMANAGER_STORAGEMANAGERIF_H_ */