LCOV - code coverage report
Current view: top level - spdk/test/unit/lib/blobfs/tree.c - tree_ut.c (source / functions) Hit Total Coverage
Test: Combined Lines: 66 66 100.0 %
Date: 2024-07-15 14:57:06 Functions: 3 3 100.0 %
Legend: Lines: hit not hit | Branches: + taken - not taken # not executed Branches: 9 16 56.2 %

           Branch data     Line data    Source code
       1                 :            : /*   SPDX-License-Identifier: BSD-3-Clause
       2                 :            :  *   Copyright (C) 2017 Intel Corporation.
       3                 :            :  *   All rights reserved.
       4                 :            :  */
       5                 :            : 
       6                 :            : #include "spdk_internal/cunit.h"
       7                 :            : 
       8                 :            : #include "blobfs/tree.c"
       9                 :            : 
      10                 :            : void
      11                 :         25 : cache_buffer_free(struct cache_buffer *cache_buffer)
      12                 :            : {
      13                 :         25 :         free(cache_buffer);
      14                 :         25 : }
      15                 :            : 
      16                 :            : static void
      17                 :          5 : blobfs_tree_op_test(void)
      18                 :            : {
      19                 :            :         struct cache_tree *tree;
      20                 :          4 :         struct cache_buffer *buffer[5];
      21                 :            :         struct cache_buffer *tmp_buffer;
      22                 :            :         int i;
      23                 :            : 
      24         [ +  + ]:         30 :         for (i = 0; i < 5; i ++) {
      25                 :         25 :                 buffer[i] = calloc(1, sizeof(struct cache_buffer));
      26         [ -  + ]:         25 :                 SPDK_CU_ASSERT_FATAL(buffer[i]);
      27                 :            :         }
      28                 :            : 
      29                 :          5 :         tree = calloc(1, sizeof(*tree));
      30         [ -  + ]:          5 :         SPDK_CU_ASSERT_FATAL(tree != NULL);
      31                 :            : 
      32                 :            :         /* insert buffer[0] */
      33                 :          5 :         buffer[0]->offset = 0;
      34                 :          5 :         tree = tree_insert_buffer(tree, buffer[0]);
      35         [ -  + ]:          5 :         SPDK_CU_ASSERT_FATAL(tree != NULL);
      36                 :          5 :         CU_ASSERT(tree->level == 0);
      37                 :          5 :         tmp_buffer = tree_find_buffer(tree, buffer[0]->offset);
      38                 :          5 :         CU_ASSERT(tmp_buffer == buffer[0]);
      39                 :            : 
      40                 :            :         /* insert buffer[1] */
      41                 :          5 :         buffer[1]->offset = CACHE_BUFFER_SIZE;
      42                 :            :         /* set the bytes_filled equal = bytes_filled with same non zero value, e.g., 32 */
      43                 :          5 :         buffer[1]->bytes_filled = buffer[1]->bytes_flushed = 32;
      44                 :          5 :         tree = tree_insert_buffer(tree, buffer[1]);
      45         [ -  + ]:          5 :         SPDK_CU_ASSERT_FATAL(tree != NULL);
      46                 :          5 :         CU_ASSERT(tree->level == 0);
      47                 :          5 :         tmp_buffer = tree_find_filled_buffer(tree, buffer[1]->offset);
      48                 :          5 :         CU_ASSERT(tmp_buffer == buffer[1]);
      49                 :            : 
      50                 :            :         /* insert buffer[2] */
      51                 :          5 :         buffer[2]->offset = (CACHE_TREE_WIDTH - 1) * CACHE_BUFFER_SIZE;
      52                 :          5 :         tree = tree_insert_buffer(tree, buffer[2]);
      53         [ -  + ]:          5 :         SPDK_CU_ASSERT_FATAL(tree != NULL);
      54                 :          5 :         CU_ASSERT(tree->level == 0);
      55                 :          5 :         tmp_buffer = tree_find_buffer(tree, buffer[2]->offset);
      56                 :          5 :         CU_ASSERT(tmp_buffer == buffer[2]);
      57                 :          5 :         tmp_buffer = tree_find_filled_buffer(tree, buffer[2]->offset);
      58                 :          5 :         CU_ASSERT(tmp_buffer == NULL);
      59                 :            : 
      60                 :            :         /* insert buffer[3], set an offset which can not be fit level 0 */
      61                 :          5 :         buffer[3]->offset = CACHE_TREE_LEVEL_SIZE(1);
      62                 :          5 :         tree = tree_insert_buffer(tree, buffer[3]);
      63         [ -  + ]:          5 :         SPDK_CU_ASSERT_FATAL(tree != NULL);
      64                 :          5 :         CU_ASSERT(tree->level == 1);
      65                 :          5 :         tmp_buffer = tree_find_buffer(tree, buffer[3]->offset);
      66                 :          5 :         CU_ASSERT(tmp_buffer == buffer[3]);
      67                 :            : 
      68                 :            :         /*  insert buffer[4], set an offset which can not be fit level 1 */
      69                 :          5 :         buffer[4]->offset = CACHE_TREE_LEVEL_SIZE(2);
      70                 :          5 :         tree = tree_insert_buffer(tree, buffer[4]);
      71         [ -  + ]:          5 :         SPDK_CU_ASSERT_FATAL(tree != NULL);
      72                 :          5 :         CU_ASSERT(tree->level == 2);
      73                 :          5 :         tmp_buffer = tree_find_buffer(tree, buffer[4]->offset);
      74                 :          5 :         CU_ASSERT(tmp_buffer == buffer[4]);
      75                 :            : 
      76                 :            :         /* delete buffer[0] */
      77                 :          5 :         tree_remove_buffer(tree, buffer[0]);
      78                 :            :         /* check whether buffer[0] is still existed or not */
      79                 :          5 :         tmp_buffer = tree_find_buffer(tree, 0);
      80                 :          5 :         CU_ASSERT(tmp_buffer == NULL);
      81                 :            : 
      82                 :            :         /* delete buffer[3] */
      83                 :          5 :         tree_remove_buffer(tree, buffer[3]);
      84                 :            :         /* check whether buffer[3] is still existed or not */
      85                 :          5 :         tmp_buffer = tree_find_buffer(tree, CACHE_TREE_LEVEL_SIZE(1));
      86                 :          5 :         CU_ASSERT(tmp_buffer == NULL);
      87                 :            : 
      88                 :            :         /* free all buffers in the tree */
      89                 :          5 :         tree_free_buffers(tree);
      90                 :            : 
      91                 :            :         /* check whether buffer[1] is still existed or not */
      92                 :          5 :         tmp_buffer = tree_find_buffer(tree, CACHE_BUFFER_SIZE);
      93                 :          5 :         CU_ASSERT(tmp_buffer == NULL);
      94                 :            :         /* check whether buffer[2] is still existed or not */
      95                 :          5 :         tmp_buffer = tree_find_buffer(tree, (CACHE_TREE_WIDTH - 1) * CACHE_BUFFER_SIZE);
      96                 :          5 :         CU_ASSERT(tmp_buffer == NULL);
      97                 :            :         /* check whether buffer[4] is still existed or not */
      98                 :          5 :         tmp_buffer = tree_find_buffer(tree, CACHE_TREE_LEVEL_SIZE(2));
      99                 :          5 :         CU_ASSERT(tmp_buffer == NULL);
     100                 :            : 
     101                 :            :         /* According to tree_free_buffers, root will not be freed */
     102                 :          5 :         free(tree);
     103                 :          5 : }
     104                 :            : 
     105                 :            : int
     106                 :          5 : main(int argc, char **argv)
     107                 :            : {
     108                 :          5 :         CU_pSuite       suite = NULL;
     109                 :            :         unsigned int    num_failures;
     110                 :            : 
     111                 :          5 :         CU_initialize_registry();
     112                 :            : 
     113                 :          5 :         suite = CU_add_suite("tree", NULL, NULL);
     114                 :          5 :         CU_ADD_TEST(suite, blobfs_tree_op_test);
     115                 :            : 
     116                 :          5 :         num_failures = spdk_ut_run_tests(argc, argv, NULL);
     117                 :          5 :         CU_cleanup_registry();
     118                 :            : 
     119                 :          5 :         return num_failures;
     120                 :            : }

Generated by: LCOV version 1.14