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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
/*
* tuple.c
* management of key->value tuples
*
* Copyright (c) 2011, 2012 pkgconf authors (see AUTHORS).
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* This software is provided 'as is' and without any warranty, express or
* implied. In no event shall the authors be liable for any damages arising
* from the use of this software.
*/
#include "pkg.h"
#include "bsdstubs.h"
static pkg_list_t pkg_global_var = PKG_LIST_INITIALIZER;
void
pkg_tuple_add_global(const char *key, const char *value)
{
pkg_tuple_add(&pkg_global_var, key, value);
}
char *
pkg_tuple_find_global(const char *key)
{
pkg_node_t *node;
PKG_FOREACH_LIST_ENTRY(pkg_global_var.head, node)
{
pkg_tuple_t *tuple = node->data;
if (!strcmp(tuple->key, key))
return tuple->value;
}
return NULL;
}
void
pkg_tuple_free_global(void)
{
pkg_tuple_free(&pkg_global_var);
}
void
pkg_tuple_define_global(const char *kv)
{
char *workbuf = strdup(kv);
char *value;
value = strchr(workbuf, '=');
if (value == NULL)
goto out;
*value++ = '\0';
pkg_tuple_add_global(workbuf, value);
out:
free(workbuf);
}
pkg_tuple_t *
pkg_tuple_add(pkg_list_t *list, const char *key, const char *value)
{
pkg_tuple_t *tuple = calloc(sizeof(pkg_tuple_t), 1);
tuple->key = strdup(key);
tuple->value = pkg_tuple_parse(list, value);
pkg_node_insert(&tuple->iter, tuple, list);
return tuple;
}
char *
pkg_tuple_find(pkg_list_t *list, const char *key)
{
pkg_node_t *node;
char *res;
if ((res = pkg_tuple_find_global(key)) != NULL)
return res;
PKG_FOREACH_LIST_ENTRY(list->head, node)
{
pkg_tuple_t *tuple = node->data;
if (!strcmp(tuple->key, key))
return tuple->value;
}
return NULL;
}
char *
pkg_tuple_parse(pkg_list_t *vars, const char *value)
{
char buf[PKG_BUFSIZE];
const char *ptr;
char *bptr = buf;
for (ptr = value; *ptr != '\0' && bptr - buf < PKG_BUFSIZE; ptr++)
{
if (*ptr != '$' || (*ptr == '$' && *(ptr + 1) != '{'))
*bptr++ = *ptr;
else if (*(ptr + 1) == '{')
{
static char varname[PKG_BUFSIZE];
char *vptr = varname;
const char *pptr;
char *kv, *parsekv;
*vptr = '\0';
for (pptr = ptr + 2; *pptr != '\0'; pptr++)
{
if (*pptr != '}')
*vptr++ = *pptr;
else
{
*vptr = '\0';
break;
}
}
ptr += (pptr - ptr);
kv = pkg_tuple_find(vars, varname);
if (kv != NULL)
{
parsekv = pkg_tuple_parse(vars, kv);
strncpy(bptr, parsekv, PKG_BUFSIZE - (bptr - buf));
bptr += strlen(parsekv);
free(parsekv);
}
}
}
*bptr = '\0';
return strdup(buf);
}
void
pkg_tuple_free(pkg_list_t *list)
{
pkg_node_t *node, *next;
PKG_FOREACH_LIST_ENTRY_SAFE(list->head, next, node)
{
pkg_tuple_t *tuple = node->data;
free(tuple->key);
free(tuple->value);
free(tuple);
}
}
|
