src/utils/list.c

   1 #include <stdio.h>
   2 #include <stdlib.h>
   3 #include <string.h>
   4 #include <errno.h>
   5
   6 #include "list.h"
   7
   8 /*#define DEBUG*/
   9
  10 void list_print(struct mail_list *lst)
  11 {
  12         size_t n;
  13
  14         if (!lst)
  15                 return;
  16
  17         for (n = 0; n < lst->n; n++) {
  18                 fprintf(stderr, "[%u] ", n);
  19                 print_mail_header(&lst->list[n].hdr);
  20         }
  21 }
  22
  23 /**
  24  * Allocate a list via malloc of n_elem elements
  25  *
  26  * @param[in|out] n_elem        number of elements in the list
  27  * @param[in]     limit         max number of elements
  28  *
  29  * @retval Pointer to the new allocated list or NULL on error
  30  */
  31 struct mail_list *list_create(size_t n_elem, size_t limit)
  32 {
  33         struct mail_list *lst;
  34
  35         if (n_elem == 0)
  36                 return NULL;
  37
  38         if (n_elem > limit)
  39                 n_elem = limit;
  40
  41         lst = malloc(sizeof(struct mail_list) + n_elem * sizeof(struct mail_entry));
  42         if (!lst) {
  43                 fprintf(stderr, "%s - MALLOC: %s", __func__, strerror(errno));
  44                 return NULL;
  45         }
  46
  47 #ifdef DEBUG
  48         fprintf(stderr, "%s - MALLOC: item %lu [%lu]\n", __func__,
  49                         (unsigned long) n_elem,
  50                         (unsigned long) (sizeof(struct mail_list) + n_elem * sizeof(struct mail_entry)));
  51 #endif
  52
  53         lst->n = n_elem;
  54         lst->nfree = 0;
  55
  56         return lst;
  57 }
  58
  59 void list_free(struct mail_list *lst)
  60 {
  61         if (lst) {
  62                 free(lst);
  63                 lst = NULL;
  64 #ifdef DEBUG
  65                 fprintf(stderr, "%s - FREE: list\n", __func__);
  66 #endif
  67         }
  68 }
  69
  70 int list_add_entry(struct mail_list *lst, struct mail_entry *entry)
  71 {
  72         size_t n = 0;
  73
  74         if (lst->nfree < LIST_LIMIT) {
  75                 n = lst->nfree;
  76                 /* Update List */
  77                 memcpy(&lst->list[n], entry, sizeof(struct mail_entry));
  78
  79                 /* Update 1st free slot index */
  80                 lst->nfree += 1;
  81                 return 0;
  82         }
  83
  84         /* No free slot */
  85         return -1;
  86 }