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
98
|
/*
* Copyright (C) 2018 "IoT.bzh"
* Author "Romain Forlot" <romain.forlot@iot.bzh>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "list.h"
#include "string.h"
void destroy_list(struct list *l)
{
struct list *save;
while(l != NULL) {
save = l->next;
free(l);
l = save;
}
}
void add_elt(struct list **l, const char *key, json_object *value)
{
struct list *new_elt = malloc(sizeof(struct list));
new_elt->key = key;
new_elt->value = value;
new_elt->next = NULL;
if(*l) {
while((*l)->next != NULL) {
*l = (*l)->next;
}
(*l)->next = new_elt;
}
else {
*l = new_elt;
}
}
void add_key(struct list **l, const char *key)
{
struct list *new_elt = malloc(sizeof(struct list));
new_elt->key = key;
new_elt->value = NULL;
new_elt->next = NULL;
if(*l) {
while((*l)->next != NULL) {
*l = (*l)->next;
}
(*l)->next = new_elt;
}
else {
*l = new_elt;
}
}
struct list *get_elt(struct list *l, int index)
{
int i;
for (i = 0; i < index; i++) {
l = l->next;
if ( l == NULL )
return NULL;
}
return l;
}
struct list *find_elt_from_key(struct list *l, const char *key)
{
while(l != NULL) {
if(strcasecmp(l->key, key) == 0)
return l;
l = l->next;
}
return NULL;
}
json_object *find_key_value(struct list *l, const char *key)
{
while(l != NULL) {
if(strcasecmp(l->key, key) == 0)
return l->value;
l = l->next;
}
return NULL;
}
|
