File: pbu_list.c

package info (click to toggle)
bs1770gain 0.4.12-2
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 1,832 kB
  • sloc: ansic: 9,380; sh: 1,288; makefile: 212
file content (97 lines) | stat: -rwxr-xr-x 1,924 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
/*
 * pbu_list.c
 * Copyright (C) 2014 Peter Belkner <pbelkner@users.sf.net>
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public
 * License as published by the Free Software Foundation; either
 * version 2.0 of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA  02110-1301  USA
 */
#include <pbutil_priv.h>

///////////////////////////////////////////////////////////////////////////////
void *pbu_list_create(void *node)
{
  list_t *n=node;

  n->prev=node;
  n->next=node;

  return node;
}

int pbu_list_append(void *head, void *node, size_t size)
{
  list_t **hp=head;
  list_t *h=*hp;
  list_t *n;

  if (NULL==(n=MALLOC(size)))
    goto malloc;

  memcpy(n,node,size);

  if (NULL==h) {
    n->prev=n;
    n->next=n;
    h=n;
  }
  else {
    n->next=h;
    n->prev=h->prev;
    h->prev->next=n;
    h->prev=n;
  }

  *hp=h;

  return 0;
malloc:
  return -1;
}

void *pbu_list_remove_link(void *head, void *node)
{
  list_t *h=head;
  list_t *n=node;

  if (n!=h)
    ;
  else if (n->next!=h)
    h=n->next;
  else
    h=NULL;

  n->prev->next=n->next;
  n->next->prev=n->prev;
  n->prev=NULL;
  n->next=NULL;

  return h;
}

void pbu_list_free_full(void *head, void *free_func)
{
  list_t *h=head;
  list_t *n;

  while (NULL!=(n=h)) {
    h=pbu_list_remove_link(n,n);
    ((void (*)(list_t *))free_func)(n);
  }
}

void pbu_list_free(void *head)
{
  pbu_list_free_full(head,PBU_FREE_PTR);
}