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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
|
/** BEGIN COPYRIGHT BLOCK
* Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
* Copyright (C) 2005 Red Hat, Inc.
* All rights reserved.
* END COPYRIGHT BLOCK **/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "reshash.h"
/* ======================== Value with Language list ==================== */
int ValueAddLanguageItem(ValueNode *node, char *value, char *language)
{
ValueNode *prev, *pvalue;
if (node == NULL)
return 0;
if (language == NULL || *language == '\0') {
/* should be added to default value */
return 0;
}
prev = pvalue = node;
while (pvalue != NULL) {
if ((pvalue->language == NULL) ||
(strcmp(pvalue->language,language) == 0)) {
/* if value for the language is already there
replace it with latest one.
*/
if (pvalue->language == NULL)
pvalue->language = strdup(language);
if (pvalue->value)
free(pvalue->value);
pvalue->value = strdup(value);
return 0;
}
prev = pvalue;
pvalue = pvalue->next;
}
pvalue = (ValueNode *) malloc(sizeof(ValueNode));
memset(pvalue, 0, sizeof(ValueNode));
prev->next = pvalue;
pvalue->language = strdup(language);
pvalue->value = strdup(value);
return 0;
}
const char *ValueSearchItem(ValueNode *node, char *language)
{
ValueNode *pvalue;
if (node == NULL)
return NULL;
pvalue = node;
while (pvalue && pvalue->language) {
if (strcmp(pvalue->language,language) == 0) {
return pvalue->value;
}
pvalue = pvalue->next;
}
return NULL;
}
void ValueDestroy(ValueNode *node)
{
ValueNode *p, *current;
p = node;
/* free itself and go next */
while (p) {
current = p;
p = p->next;
if (current->language)
free (current->language);
if (current->value)
free (current->value);
}
}
/* ======================== End of Value with Language list ==================== */
/* ======================== Tree List Implementation============================ */
const char * TreeSearchItem(TreeNode *res, char *key, char *language)
{
int k;
const char *result;
if (res == NULL || res->key == NULL)
return NULL;
k = strcmp(key, res->key);
if (k > 0) {
return TreeSearchItem(res->right, key, language);
}
else if (k < 0) {
return TreeSearchItem(res->left, key, language);
}
else {
/* Add to the current node; */
if (language == NULL || *language == '\0')
return res->value;
result = ValueSearchItem(res->vlist, language);
if (result)
return result;
else /* fallback to default value if there is any */
return res->value;
}
}
/*
TreeAddItem
Add value for specific language to the resource tree
Using binary tree now --> Balanced tree later
*/
int TreeAddItem(TreeNode *res, char *key, char *value, char *language)
{
TreeNode *node;
ValueNode *vnode;
int k;
if (res->key == NULL) {
res->key = strdup(key);
k = 0;
}
else {
k = strcmp(key, res->key);
}
if (k > 0) {
if (res->right == NULL) {
/* Create node and it's value sub list
*/
node = (TreeNode *) malloc (sizeof(TreeNode));
memset(node, 0, sizeof(TreeNode));
vnode = (ValueNode *) malloc(sizeof(ValueNode));
memset(vnode, 0, sizeof(ValueNode));
node->vlist = vnode;
res->right = node;
/* assign value to node */
node->key = strdup(key);
if (language == NULL)
node->value = strdup(value);
else
ValueAddLanguageItem(node->vlist, value, language);
}
else {
return TreeAddItem(res->right, key, value, language);
}
}
else if (k < 0) {
if (res->left == NULL) {
node = (TreeNode *) malloc (sizeof(TreeNode));
memset(node, 0, sizeof(TreeNode));
vnode = (ValueNode *) malloc(sizeof(ValueNode));
memset(vnode, 0, sizeof(ValueNode));
node->vlist = vnode;
res->left = node;
/* assign value to node */
node->key = strdup(key);
if (language == NULL)
node->value = strdup(value);
else
return ValueAddLanguageItem(node->vlist, value, language);
}
else {
return TreeAddItem(res->left, key, value, language);
}
}
else {
/* Add to the current node; */
if (language == NULL)
res->value = strdup(value);
else
return ValueAddLanguageItem(res->vlist, value, language);
}
return 0;
}
void TreeDestroy(TreeNode *tree)
{
if (tree == NULL)
return;
if (tree->vlist)
ValueDestroy(tree->vlist);
if (tree->key)
free(tree->key);
if (tree->value)
free(tree->value);
if (tree->left)
TreeDestroy(tree->left);
if (tree->right)
TreeDestroy(tree->right);
}
/* ====================== End of Tree implementation ================= */
/* ====================== Tree controller (hash ?) ================ */
ResHash * ResHashCreate(char * name)
{
ResHash *pResHash;
/* Create hash table */
pResHash = (ResHash *) malloc (sizeof(ResHash));
if (pResHash == NULL)
return NULL;
memset(pResHash, 0, sizeof(ResHash));
if (name)
pResHash->name = strdup(name);
/* Create initial tree item and it's valuelist to hash table */
pResHash->treelist = (TreeNode *) malloc(sizeof(TreeNode));
if (pResHash->treelist)
memset(pResHash->treelist, 0, sizeof(TreeNode));
pResHash->treelist->vlist = (ValueNode *) malloc(sizeof(ValueNode));
memset(pResHash->treelist->vlist, 0, sizeof(ValueNode));
return pResHash;
}
int ResHashAdd(ResHash *res, char *key, char *value, char *language)
{
#if 0
hash = get hash value from key
tree = find the tree associated with hash value
#endif
return TreeAddItem(res->treelist, key, value, language);
}
const char *ResHashSearch(ResHash *res, char *key, char *language)
{
#if 0
hash = get hash value from key
tree = find the tree associated with hash value
#endif
return TreeSearchItem(res->treelist, key, language);
}
void ResHashDestroy(ResHash *res)
{
if (res == NULL)
return;
if (res->name)
free(res->name);
if (res->treelist)
TreeDestroy(res->treelist);
}
/* ========================= End of Tree controller ====================== */
|
