src/utils/slist.c


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

/*
 * blogc: A blog compiler.
 * Copyright (C) 2014-2015 Rafael G. Martins <rafael@rafaelmartins.eng.br>
 *
 * This program can be distributed under the terms of the BSD License.
 * See the file COPYING.
 */

#include <stdlib.h>
#include "utils.h"


b_slist_t*
b_slist_append(b_slist_t *l, void *data)
{
    b_slist_t *node = malloc(sizeof(b_slist_t));
    if (node == NULL) {
        l = NULL;
        return l;
    }
    node->data = data;
    node->next = NULL;
    if (l == NULL)
        l = node;
    else {
        b_slist_t *tmp;
        for (tmp = l; tmp->next != NULL; tmp = tmp->next);
        tmp->next = node;
    }
    return l;
}


void
b_slist_free_full(b_slist_t *l, b_free_func_t free_func)
{
    while (l != NULL) {
        b_slist_t *tmp = l->next;
        free_func(l->data);
        free(l);
        l = tmp;
    }
}


void
b_slist_free(b_slist_t *l)
{
    while (l != NULL) {
        b_slist_t *tmp = l->next;
        free(l);
        l = tmp;
    }
}


unsigned int
b_slist_length(b_slist_t *l)
{
    unsigned int i;
    b_slist_t *tmp;
    for (tmp = l, i = 0; tmp != NULL; tmp = tmp->next, i++);
    return i;
}