src/sllist.c

   1 /* the Music Player Daemon (MPD)
   2  * Copyright (C) 2003-2007 by Warren Dukes (warren.dukes@gmail.com)
   3  * This project's homepage is: http://www.musicpd.org
   4  *
   5  * This program is free software; you can redistribute it and/or modify
   6  * it under the terms of the GNU General Public License as published by
   7  * the Free Software Foundation; either version 2 of the License, or
   8  * (at your option) any later version.
   9  *
  10  * This program is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13  * GNU General Public License for more details.
  14  * You should have received a copy of the GNU General Public License
  15  * along with this program; if not, write to the Free Software
  16  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  17  */
  18
  19 /* a very simple singly-linked-list structure for queues/buffers */
  20
  21 #include <string.h>
  22 #include "sllist.h"
  23 #include "utils.h"
  24
  25 static void init_strnode(struct strnode *x, char *s)
  26 {
  27         x->data = s;
  28         x->next = NULL;
  29 }
  30
  31 struct strnode *new_strnode(char *s)
  32 {
  33         struct strnode *x = xmalloc(sizeof(struct strnode));
  34         init_strnode(x, s);
  35         return x;
  36 }
  37
  38 struct strnode *new_strnode_dup(char *s, const size_t size)
  39 {
  40         struct strnode *x = xmalloc(sizeof(struct strnode) + size);
  41         x->next = NULL;
  42         x->data = ((char *)x + sizeof(struct strnode));
  43         memcpy((void *)x->data, (void*)s, size);
  44         return x;
  45 }
  46
  47 struct sllnode *new_sllnode(void *s, const size_t size)
  48 {
  49         struct sllnode *x = xmalloc(sizeof(struct sllnode) + size);
  50         x->next = NULL;
  51         x->size = size;
  52         x->data = ((char *)x + sizeof(struct sllnode));
  53         memcpy(x->data, (void *)s, size);
  54         return x;
  55 }
  56
  57 struct strnode *dup_strlist(struct strnode *old)
  58 {
  59         struct strnode *tmp, *new, *cur;
  60
  61         tmp = old;
  62         cur = new = new_strnode_dup(tmp->data, strlen(tmp->data) + 1);
  63         tmp = tmp->next;
  64         while (tmp) {
  65                 cur->next = new_strnode_dup(tmp->data, strlen(tmp->data) + 1);
  66                 cur = cur->next;
  67                 tmp = tmp->next;
  68         }
  69         return new;
  70 }
  71
  72