author | Mikael Hallendal <micke@imendio.com> |
Sun, 10 Jun 2007 18:14:31 +0200 | |
changeset 268 | 7eb1cedb3241 |
parent 185 | 08fa49e0e7f5 |
child 417 | 364c17252e5f |
child 555 | 695c909d0c45 |
permissions | -rw-r--r-- |
1 | 1 |
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */ |
2 |
/* |
|
99
81e9d035de02
2004-10-05 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
84
diff
changeset
|
3 |
* Copyright (C) 2003 Imendio AB |
1 | 4 |
* |
5 |
* This program is free software; you can redistribute it and/or |
|
6 |
* modify it under the terms of the GNU Lesser General Public License as |
|
7 |
* published by the Free Software Foundation; either version 2 of the |
|
8 |
* License, or (at your option) any later version. |
|
9 |
* |
|
10 |
* This program is distributed in the hope that it will be useful, |
|
11 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
12 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
|
13 |
* Lesser General Public License for more details. |
|
14 |
* |
|
15 |
* You should have received a copy of the GNU Lesser General Public |
|
16 |
* License along with this program; if not, write to the |
|
17 |
* Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
|
18 |
* Boston, MA 02111-1307, USA. |
|
19 |
*/ |
|
20 |
||
21 |
#include <config.h> |
|
22 |
#include <string.h> |
|
23 |
||
24 |
#include "lm-internals.h" |
|
25 |
#include "lm-message-node.h" |
|
26 |
||
27 |
typedef struct { |
|
28 |
gchar *key; |
|
29 |
gchar *value; |
|
30 |
} KeyValuePair; |
|
31 |
||
32 |
static void message_node_free (LmMessageNode *node); |
|
33 |
static LmMessageNode * message_node_last_child (LmMessageNode *node); |
|
34 |
||
35 |
static void |
|
36 |
message_node_free (LmMessageNode *node) |
|
37 |
{ |
|
38 |
LmMessageNode *l; |
|
39 |
GSList *list; |
|
40 |
||
41 |
g_return_if_fail (node != NULL); |
|
42 |
||
43 |
for (l = node->children; l;) { |
|
44 |
LmMessageNode *next = l->next; |
|
45 |
||
46 |
lm_message_node_unref (l); |
|
47 |
l = next; |
|
48 |
} |
|
49 |
||
50 |
g_free (node->name); |
|
51 |
g_free (node->value); |
|
52 |
||
53 |
for (list = node->attributes; list; list = list->next) { |
|
54 |
KeyValuePair *kvp = (KeyValuePair *) list->data; |
|
55 |
||
56 |
g_free (kvp->key); |
|
57 |
g_free (kvp->value); |
|
58 |
g_free (kvp); |
|
59 |
} |
|
60 |
||
61 |
g_slist_free (node->attributes); |
|
62 |
g_free (node); |
|
63 |
} |
|
64 |
||
65 |
static LmMessageNode * |
|
66 |
message_node_last_child (LmMessageNode *node) |
|
67 |
{ |
|
68 |
LmMessageNode *l; |
|
69 |
||
70 |
g_return_val_if_fail (node != NULL, NULL); |
|
71 |
||
72 |
if (!node->children) { |
|
73 |
return NULL; |
|
74 |
} |
|
75 |
||
76 |
l = node->children; |
|
77 |
||
78 |
while (l->next) { |
|
79 |
l = l->next; |
|
80 |
} |
|
81 |
||
82 |
return l; |
|
83 |
} |
|
84 |
||
85 |
LmMessageNode * |
|
86 |
_lm_message_node_new (const gchar *name) |
|
87 |
{ |
|
88 |
LmMessageNode *node; |
|
89 |
||
90 |
node = g_new0 (LmMessageNode, 1); |
|
91 |
||
7
d8eae83450ac
2003-06-13 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
6
diff
changeset
|
92 |
node->name = g_strdup (name); |
1 | 93 |
node->value = NULL; |
6
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
94 |
node->raw_mode = FALSE; |
1 | 95 |
node->attributes = NULL; |
96 |
node->next = NULL; |
|
97 |
node->prev = NULL; |
|
98 |
node->parent = NULL; |
|
99 |
node->children = NULL; |
|
100 |
||
101 |
node->ref_count = 1; |
|
102 |
||
103 |
return node; |
|
104 |
} |
|
105 |
void |
|
106 |
_lm_message_node_add_child_node (LmMessageNode *node, LmMessageNode *child) |
|
107 |
{ |
|
108 |
LmMessageNode *prev; |
|
109 |
||
110 |
g_return_if_fail (node != NULL); |
|
111 |
||
112 |
prev = message_node_last_child (node); |
|
113 |
lm_message_node_ref (child); |
|
114 |
||
115 |
if (prev) { |
|
116 |
prev->next = child; |
|
117 |
child->prev = prev; |
|
118 |
} else { |
|
119 |
node->children = child; |
|
120 |
} |
|
121 |
||
122 |
child->parent = node; |
|
123 |
} |
|
124 |
||
125 |
/** |
|
126 |
* lm_message_node_get_value: |
|
127 |
* @node: an #LmMessageNode |
|
128 |
* |
|
129 |
* Retrieves the value of @node. |
|
130 |
* |
|
131 |
* Return value: |
|
132 |
**/ |
|
133 |
const gchar * |
|
134 |
lm_message_node_get_value (LmMessageNode *node) |
|
135 |
{ |
|
136 |
g_return_val_if_fail (node != NULL, NULL); |
|
137 |
||
138 |
return node->value; |
|
139 |
} |
|
140 |
||
141 |
/** |
|
142 |
* lm_message_node_set_value: |
|
143 |
* @node: an #LmMessageNode |
|
144 |
* @value: the new value. |
|
145 |
* |
|
146 |
* Sets the value of @node. If a previous value is set it will be freed. |
|
147 |
**/ |
|
148 |
void |
|
149 |
lm_message_node_set_value (LmMessageNode *node, const gchar *value) |
|
150 |
{ |
|
151 |
g_return_if_fail (node != NULL); |
|
152 |
||
153 |
g_free (node->value); |
|
154 |
||
155 |
if (!value) { |
|
156 |
node->value = NULL; |
|
157 |
return; |
|
158 |
} |
|
159 |
||
160 |
node->value = g_strdup (value); |
|
161 |
} |
|
162 |
||
163 |
/** |
|
164 |
* lm_message_node_add_child: |
|
165 |
* @node: an #LmMessageNode |
|
166 |
* @name: the name of the new child |
|
167 |
* @value: value of the new child |
|
168 |
* |
|
169 |
* Add a child node with @name and value set to @value. |
|
170 |
* |
|
171 |
* Return value: the newly created child |
|
172 |
**/ |
|
173 |
LmMessageNode * |
|
174 |
lm_message_node_add_child (LmMessageNode *node, |
|
175 |
const gchar *name, |
|
176 |
const gchar *value) |
|
177 |
{ |
|
178 |
LmMessageNode *child; |
|
179 |
||
168
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
180 |
g_return_val_if_fail (node != NULL, NULL); |
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
181 |
g_return_val_if_fail (name != NULL, NULL); |
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
182 |
|
1 | 183 |
child = _lm_message_node_new (name); |
184 |
||
185 |
lm_message_node_set_value (child, value); |
|
186 |
_lm_message_node_add_child_node (node, child); |
|
187 |
lm_message_node_unref (child); |
|
188 |
||
189 |
return child; |
|
190 |
} |
|
191 |
||
192 |
/** |
|
193 |
* lm_message_node_set_attributes: |
|
194 |
* @node: an #LmMessageNode |
|
195 |
* @name: the first attribute, should be followed by a string with the value |
|
56
3bf928955fc5
2003-11-20 Ross Burton <ross@burtonini.com>
hallski <hallski>
parents:
7
diff
changeset
|
196 |
* @Varargs: The rest of the name/value pairs |
1 | 197 |
* |
198 |
* Sets a list of attributes. The arguments should be names and corresponding |
|
199 |
* value and needs to be ended with %NULL. |
|
200 |
**/ |
|
201 |
void |
|
202 |
lm_message_node_set_attributes (LmMessageNode *node, |
|
203 |
const gchar *name, |
|
204 |
...) |
|
205 |
{ |
|
206 |
va_list args; |
|
207 |
||
208 |
g_return_if_fail (node != NULL); |
|
209 |
||
210 |
for (va_start (args, name); |
|
211 |
name; |
|
212 |
name = (const gchar *) va_arg (args, gpointer)) { |
|
213 |
const gchar *value; |
|
214 |
||
215 |
value = (const gchar *) va_arg (args, gpointer); |
|
216 |
||
217 |
lm_message_node_set_attribute (node, name, value); |
|
218 |
||
219 |
} |
|
220 |
||
221 |
va_end (args); |
|
222 |
} |
|
223 |
||
224 |
/** |
|
225 |
* lm_message_node_set_attribute: |
|
226 |
* @node: an #LmMessageNode |
|
227 |
* @name: name of attribute |
|
228 |
* @value: value of attribute. |
|
229 |
* |
|
230 |
* Sets the attribute @name to @value. |
|
231 |
**/ |
|
232 |
void |
|
233 |
lm_message_node_set_attribute (LmMessageNode *node, |
|
234 |
const gchar *name, |
|
235 |
const gchar *value) |
|
236 |
{ |
|
237 |
gboolean found = FALSE; |
|
238 |
GSList *l; |
|
239 |
||
168
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
240 |
g_return_if_fail (node != NULL); |
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
241 |
g_return_if_fail (name != NULL); |
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
242 |
g_return_if_fail (value != NULL); |
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
243 |
|
1 | 244 |
for (l = node->attributes; l; l = l->next) { |
245 |
KeyValuePair *kvp = (KeyValuePair *) l->data; |
|
246 |
||
7
d8eae83450ac
2003-06-13 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
6
diff
changeset
|
247 |
if (strcmp (kvp->key, name) == 0) { |
1 | 248 |
g_free (kvp->value); |
249 |
kvp->value = g_strdup (value); |
|
250 |
found = TRUE; |
|
251 |
break; |
|
252 |
} |
|
253 |
} |
|
254 |
||
255 |
if (!found) { |
|
256 |
KeyValuePair *kvp; |
|
257 |
||
258 |
kvp = g_new0 (KeyValuePair, 1); |
|
7
d8eae83450ac
2003-06-13 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
6
diff
changeset
|
259 |
kvp->key = g_strdup (name); |
1 | 260 |
kvp->value = g_strdup (value); |
261 |
||
7
d8eae83450ac
2003-06-13 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
6
diff
changeset
|
262 |
node->attributes = g_slist_prepend (node->attributes, kvp); |
1 | 263 |
} |
264 |
} |
|
265 |
||
266 |
/** |
|
267 |
* lm_message_node_get_attribute: |
|
268 |
* @node: an #LmMessageNode |
|
269 |
* @name: the attribute name |
|
270 |
* |
|
271 |
* Fetches the attribute @name from @node. |
|
272 |
* |
|
273 |
* Return value: the attribute value or %NULL if not set |
|
274 |
**/ |
|
275 |
const gchar * |
|
276 |
lm_message_node_get_attribute (LmMessageNode *node, const gchar *name) |
|
277 |
{ |
|
278 |
GSList *l; |
|
279 |
const gchar *ret_val = NULL; |
|
280 |
||
281 |
g_return_val_if_fail (node != NULL, NULL); |
|
168
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
282 |
g_return_val_if_fail (name != NULL, NULL); |
1 | 283 |
|
284 |
for (l = node->attributes; l; l = l->next) { |
|
285 |
KeyValuePair *kvp = (KeyValuePair *) l->data; |
|
286 |
||
7
d8eae83450ac
2003-06-13 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
6
diff
changeset
|
287 |
if (strcmp (kvp->key, name) == 0) { |
1 | 288 |
ret_val = kvp->value; |
289 |
} |
|
290 |
} |
|
291 |
||
292 |
return ret_val; |
|
293 |
} |
|
294 |
||
295 |
/** |
|
296 |
* lm_message_node_get_child: |
|
297 |
* @node: an #LmMessageNode |
|
298 |
* @child_name: the childs name |
|
299 |
* |
|
300 |
* Fetches the child @child_name from @node. If child is not found as an |
|
301 |
* immediate child of @node %NULL is returned. |
|
302 |
* |
|
303 |
* Return value: the child node or %NULL if not found |
|
304 |
**/ |
|
305 |
LmMessageNode * |
|
306 |
lm_message_node_get_child (LmMessageNode *node, const gchar *child_name) |
|
307 |
{ |
|
308 |
LmMessageNode *l; |
|
168
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
309 |
|
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
310 |
g_return_val_if_fail (node != NULL, NULL); |
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
311 |
g_return_val_if_fail (child_name != NULL, NULL); |
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
312 |
|
1 | 313 |
for (l = node->children; l; l = l->next) { |
7
d8eae83450ac
2003-06-13 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
6
diff
changeset
|
314 |
if (strcmp (l->name, child_name) == 0) { |
1 | 315 |
return l; |
316 |
} |
|
317 |
} |
|
318 |
||
319 |
return NULL; |
|
320 |
} |
|
321 |
||
322 |
/** |
|
323 |
* lm_message_node_find_child: |
|
56
3bf928955fc5
2003-11-20 Ross Burton <ross@burtonini.com>
hallski <hallski>
parents:
7
diff
changeset
|
324 |
* @node: A #LmMessageNode |
3bf928955fc5
2003-11-20 Ross Burton <ross@burtonini.com>
hallski <hallski>
parents:
7
diff
changeset
|
325 |
* @child_name: The name of the child to find |
1 | 326 |
* |
327 |
* Locates a child among all children of @node. The entire tree will be search |
|
328 |
* until a child with name @child_name is located. |
|
329 |
* |
|
330 |
* Return value: the located child or %NULL if not found |
|
331 |
**/ |
|
332 |
LmMessageNode * |
|
333 |
lm_message_node_find_child (LmMessageNode *node, |
|
334 |
const gchar *child_name) |
|
335 |
{ |
|
336 |
LmMessageNode *l; |
|
337 |
LmMessageNode *ret_val = NULL; |
|
338 |
||
168
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
339 |
g_return_val_if_fail (node != NULL, NULL); |
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
340 |
g_return_val_if_fail (child_name != NULL, NULL); |
ac1affcd5d22
2006-09-01 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
166
diff
changeset
|
341 |
|
1 | 342 |
for (l = node->children; l; l = l->next) { |
7
d8eae83450ac
2003-06-13 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
6
diff
changeset
|
343 |
if (strcmp (l->name, child_name) == 0) { |
1 | 344 |
return l; |
345 |
} |
|
346 |
if (l->children) { |
|
347 |
ret_val = lm_message_node_find_child (l, child_name); |
|
348 |
if (ret_val) { |
|
349 |
return ret_val; |
|
350 |
} |
|
351 |
} |
|
352 |
} |
|
353 |
||
354 |
return NULL; |
|
355 |
} |
|
356 |
||
357 |
/** |
|
6
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
358 |
* lm_message_node_get_raw_mode: |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
359 |
* @node: an #LmMessageNode |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
360 |
* |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
361 |
* Checks if the nodes value should be sent as raw mode. |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
362 |
* |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
363 |
* Return value: %TRUE if nodes value should be sent as is and %FALSE if the value will be escaped before sending. |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
364 |
**/ |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
365 |
gboolean |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
366 |
lm_message_node_get_raw_mode (LmMessageNode *node) |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
367 |
{ |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
368 |
g_return_val_if_fail (node != NULL, FALSE); |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
369 |
|
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
370 |
return node->raw_mode; |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
371 |
} |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
372 |
|
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
373 |
/** |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
374 |
* lm_message_node_set_raw_mode: |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
375 |
* @node: an #LmMessageNode |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
376 |
* @raw_mode: boolean specifying if node value should be escaped or not. |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
377 |
* |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
378 |
* Set @raw_mode to %TRUE if you don't want to escape the value. You need to make sure the value is valid XML yourself. |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
379 |
**/ |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
380 |
void |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
381 |
lm_message_node_set_raw_mode (LmMessageNode *node, gboolean raw_mode) |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
382 |
{ |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
383 |
g_return_if_fail (node != NULL); |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
384 |
|
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
385 |
node->raw_mode = raw_mode; |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
386 |
} |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
387 |
|
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
388 |
/** |
1 | 389 |
* lm_message_node_ref: |
390 |
* @node: an #LmMessageNode |
|
391 |
* |
|
392 |
* Adds a reference to @node. |
|
393 |
* |
|
394 |
* Return value: the node |
|
395 |
**/ |
|
396 |
LmMessageNode * |
|
397 |
lm_message_node_ref (LmMessageNode *node) |
|
398 |
{ |
|
399 |
g_return_val_if_fail (node != NULL, NULL); |
|
400 |
||
401 |
node->ref_count++; |
|
402 |
||
403 |
return node; |
|
404 |
} |
|
405 |
||
406 |
/** |
|
407 |
* lm_message_node_unref: |
|
408 |
* @node: an #LmMessageNode |
|
409 |
* |
|
410 |
* Removes a reference from @node. When no more references are present the |
|
411 |
* node is freed. When freed lm_message_node_unref() will be called on all |
|
412 |
* children. If caller needs to keep references to the children a call to |
|
413 |
* lm_message_node_ref() needs to be done before the call to |
|
414 |
*lm_message_unref(). |
|
415 |
**/ |
|
416 |
void |
|
417 |
lm_message_node_unref (LmMessageNode *node) |
|
418 |
{ |
|
419 |
g_return_if_fail (node != NULL); |
|
420 |
||
421 |
node->ref_count--; |
|
422 |
||
423 |
if (node->ref_count == 0) { |
|
424 |
message_node_free (node); |
|
425 |
} |
|
426 |
} |
|
427 |
||
428 |
/** |
|
429 |
* lm_message_node_to_string: |
|
430 |
* @node: an #LmMessageNode |
|
431 |
* |
|
432 |
* Returns an XML string representing the node. This is what is sent over the |
|
433 |
* wire. This is used internally Loudmouth and is external for debugging |
|
434 |
* purposes. |
|
435 |
* |
|
436 |
* Return value: an XML string representation of @node |
|
437 |
**/ |
|
438 |
gchar * |
|
439 |
lm_message_node_to_string (LmMessageNode *node) |
|
440 |
{ |
|
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
441 |
GString *ret; |
1 | 442 |
GSList *l; |
443 |
LmMessageNode *child; |
|
166
2e6fae54b2fb
2006-08-22 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
99
diff
changeset
|
444 |
|
2e6fae54b2fb
2006-08-22 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
99
diff
changeset
|
445 |
g_return_val_if_fail (node != NULL, NULL); |
1 | 446 |
|
447 |
if (node->name == NULL) { |
|
448 |
return g_strdup (""); |
|
449 |
} |
|
450 |
||
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
451 |
ret = g_string_new ("<"); |
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
452 |
g_string_append (ret, node->name); |
1 | 453 |
|
454 |
for (l = node->attributes; l; l = l->next) { |
|
455 |
KeyValuePair *kvp = (KeyValuePair *) l->data; |
|
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
456 |
|
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
457 |
if (node->raw_mode == FALSE) { |
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
458 |
gchar *escaped; |
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
459 |
|
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
460 |
escaped = g_markup_escape_text (kvp->value, -1); |
185
08fa49e0e7f5
2006-10-17 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
184
diff
changeset
|
461 |
g_string_append_printf (ret, " %s=\"%s\"", |
08fa49e0e7f5
2006-10-17 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
184
diff
changeset
|
462 |
kvp->key, escaped); |
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
463 |
g_free (escaped); |
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
464 |
} else { |
185
08fa49e0e7f5
2006-10-17 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
184
diff
changeset
|
465 |
g_string_append_printf (ret, " %s=\"%s\"", |
08fa49e0e7f5
2006-10-17 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
184
diff
changeset
|
466 |
kvp->key, kvp->value); |
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
467 |
} |
1 | 468 |
|
469 |
} |
|
470 |
||
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
471 |
g_string_append_c (ret, '>'); |
1 | 472 |
|
473 |
if (node->value) { |
|
474 |
gchar *tmp; |
|
475 |
||
6
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
476 |
if (node->raw_mode == FALSE) { |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
477 |
tmp = g_markup_escape_text (node->value, -1); |
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
478 |
g_string_append (ret, tmp); |
6
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
479 |
g_free (tmp); |
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
480 |
} else { |
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
481 |
g_string_append (ret, node->value); |
6
78fdf5d9eb1b
2003-06-11 Mikael Hallendal <micke@codefactory.se>
hallski <hallski>
parents:
4
diff
changeset
|
482 |
} |
1 | 483 |
} |
484 |
||
485 |
for (child = node->children; child; child = child->next) { |
|
486 |
gchar *child_str = lm_message_node_to_string (child); |
|
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
487 |
g_string_append_c (ret, ' '); |
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
488 |
g_string_append (ret, child_str); |
79 | 489 |
g_free (child_str); |
1 | 490 |
} |
491 |
||
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
492 |
g_string_append_printf (ret, "</%s>\n", node->name); |
1 | 493 |
|
184
4e16d32b2410
2006-10-16 Mikael Hallendal <micke@imendio.com>
hallski <hallski>
parents:
168
diff
changeset
|
494 |
return g_string_free (ret, FALSE); |
1 | 495 |
} |