1/*
2  Copyright (c) 2002-2003 by Juliusz Chroboczek
3  Copyright (c) 2015 by Thomas Klausner
4
5  Permission is hereby granted, free of charge, to any person obtaining a copy
6  of this software and associated documentation files (the "Software"), to deal
7  in the Software without restriction, including without limitation the rights
8  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9  copies of the Software, and to permit persons to whom the Software is
10  furnished to do so, subject to the following conditions:
11
12  The above copyright notice and this permission notice shall be included in
13  all copies or substantial portions of the Software.
14
15  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
18  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
21  THE SOFTWARE.
22*/
23
24#include <stdlib.h>
25#include "constlist.h"
26
27ConstListPtr
28appendConstList(ConstListPtr first, ConstListPtr second)
29{
30    ConstListPtr current;
31
32    if (second == NULL)
33        return first;
34
35    if (first == NULL)
36        return second;
37
38    for (current = first; current->next; current = current->next)
39        ;
40
41    current->next = second;
42    return first;
43}
44
45ConstListPtr
46makeConstList(const char **a, int n, ConstListPtr old, int begin)
47{
48    ConstListPtr first, current;
49    int i;
50
51    if (n == 0)
52        return old;
53
54    first = malloc(sizeof(ConstListRec));
55    if (!first)
56        return NULL;
57
58    first->value = a[0];
59    first->next = NULL;
60
61    current = first;
62    for (i = 1; i < n; i++) {
63        ConstListPtr next = malloc(sizeof(ConstListRec));
64        if (!next) {
65            destroyConstList(first);
66            return NULL;
67        }
68        next->value = a[i];
69        next->next = NULL;
70
71        current->next = next;
72        current = next;
73    }
74    if (begin) {
75        current->next = old;
76        return first;
77    }
78    else {
79        return appendConstList(old, first);
80    }
81}
82
83void
84destroyConstList(ConstListPtr old)
85{
86    if (!old)
87        return;
88    while (old) {
89        ConstListPtr next = old->next;
90        free(old);
91        old = next;
92    }
93}
94