lib/llst.c

   1 /* quvi
   2  * Copyright (C) 2010  Toni Gundogdu <legatvs@gmail.com>
   3  *
   4  * This library is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU Lesser General Public
   6  * License as published by the Free Software Foundation; either
   7  * version 2.1 of the License, or (at your option) any later version.
   8  *
   9  * This library is distributed in the hope that it will be useful,
  10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  12  * Lesser General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU Lesser General Public
  15  * License along with this library; if not, write to the Free Software
  16  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  17  * 02110-1301  USA
  18  */
  19
  20 #include "config.h"
  21
  22 #include <stdarg.h>
  23 #include <stdlib.h>
  24 #include <assert.h>
  25
  26 #include "llst.h"
  27 #include "quvi/quvi.h"
  28
  29 int llst_add(llst_node_t * node, void *data)
  30 {
  31   struct _llst_node_s *n = 0;
  32
  33   assert(node);
  34
  35   n = calloc(1, sizeof(*n));
  36   if (!n)
  37     return (QUVI_MEM);
  38
  39   if (*node)                    /* insert after the last. */
  40     {
  41       llst_node_t curr = *node;
  42       while (curr->next)
  43         curr = curr->next;
  44       curr->next = n;
  45       /* without the above, we would add the node to the beginning,
  46          see the else-block below. */
  47     }
  48   else                          /* add first node. */
  49     {
  50       n->next = *node;
  51       *node = n;
  52     }
  53
  54   n->data = data;
  55
  56   return (QUVI_OK);
  57 }
  58
  59 int llst_size(llst_node_t head)
  60 {
  61   llst_node_t curr = head;
  62   int n = 0;
  63   while (curr)
  64     {
  65       curr = curr->next;
  66       ++n;
  67     }
  68   return (n);
  69 }
  70
  71 void llst_free(llst_node_t * head)
  72 {
  73   llst_node_t curr = *head;
  74   assert(head);
  75   while (curr)
  76     {
  77       llst_node_t next = curr->next;
  78       free(curr->data);
  79       curr->data = 0;
  80       free(curr);
  81       curr = 0;
  82       curr = next;
  83     }
  84   *head = 0;
  85 }
  86
  87 /* vim: set ts=2 sw=2 tw=72 expandtab: */