lib-lib/list.h

   1 /*
   2  *  This program is free software; you can redistribute it and/or modify
   3  *  it under the terms of the GNU General Public License as published by
   4  *  the Free Software Foundation; either version 2 of the License, or (at
   5  *  your option) any later version.
   6  *
   7  *  This program is distributed in the hope that it will be useful, but
   8  *  WITHOUT ANY WARRANTY; without even the implied warranty of
   9  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  10  *  General Public License for more details.
  11  *
  12  *  You should have received a copy of the GNU General Public License
  13  *  along with this program; if not, write to the Free Software
  14  *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
  15  *  MA 02110-1301, USA.
  16  *
  17  *  Copyright © 2006 Pierre Habouzit
  18  */
  19
  20 /*
  21  * Copyright notice from original mutt:
  22  * Copyright (C) 1996-2000 Michael R. Elkins <me@mutt.org>
  23  */
  24
  25 #ifndef MUTT_LIB_LIB_LIST_H
  26 #define MUTT_LIB_LIB_LIST_H
  27
  28 typedef struct list_t {
  29     char *data;
  30     struct list_t *next;
  31 } LIST;
  32
  33 #define mutt_new_list() p_new(LIST, 1)
  34 void mutt_free_list(LIST **);
  35
  36 LIST *mutt_copy_list(LIST *);
  37
  38 /* add an element to a list */
  39 LIST *mutt_add_list_n(LIST*, const void*, size_t len);
  40 static inline LIST *mutt_add_list(LIST *head, const char *data) {
  41     size_t len = m_strlen(data);
  42     return mutt_add_list_n(head, data, len ? len + 1 : 0);
  43 }
  44
  45 #define DO_SLIST(type, prefix)                                               \
  46     static inline type *prefix##_list_pop(type **list) {                     \
  47         if (*list) {                                                         \
  48             type *res = *list;                                               \
  49             *list = res->next;                                               \
  50             res->next = NULL;                                                \
  51             return res;                                                      \
  52         }                                                                    \
  53         return NULL;                                                         \
  54     }                                                                        \
  55     static inline void prefix##_list_push(type **list, type *item) {         \
  56         item->next = *list;                                                  \
  57         *list = item;                                                        \
  58     }                                                                        \
  59                                                                              \
  60     static inline type **prefix##_list_init(type **list) {                   \
  61         *list = NULL;                                                        \
  62         return list;                                                         \
  63     }                                                                        \
  64     static inline void prefix##_list_wipe(type **list, int del) {            \
  65         if (del) {                                                           \
  66             while (*list) {                                                  \
  67                 type *item = prefix##_list_pop(list);                        \
  68                 prefix##_delete(&item);                                      \
  69             }                                                                \
  70         } else {                                                             \
  71             *list = NULL;                                                    \
  72         }                                                                    \
  73     }                                                                        \
  74
  75
  76
  77
  78
  79 #endif /* MUTT_LIB_LIB_LIST_H */