1
/* $Id: pidf.c 3841 2011-10-24 09:28:13Z ming $ */
3
* Copyright (C) 2008-2011 Teluu Inc. (http://www.teluu.com)
4
* Copyright (C) 2003-2008 Benny Prijono <benny@prijono.org>
6
* This program is free software; you can redistribute it and/or modify
7
* it under the terms of the GNU General Public License as published by
8
* the Free Software Foundation; either version 2 of the License, or
9
* (at your option) any later version.
11
* This program is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU General Public License for more details.
16
* You should have received a copy of the GNU General Public License
17
* along with this program; if not, write to the Free Software
18
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20
#include <pjsip-simple/pidf.h>
21
#include <pj/string.h>
23
#include <pj/assert.h>
26
struct pjpidf_op_desc pjpidf_op =
29
&pjpidf_pres_construct,
30
&pjpidf_pres_add_tuple,
31
&pjpidf_pres_get_first_tuple,
32
&pjpidf_pres_get_next_tuple,
33
&pjpidf_pres_find_tuple,
34
&pjpidf_pres_remove_tuple,
35
&pjpidf_pres_add_note,
36
&pjpidf_pres_get_first_note,
37
&pjpidf_pres_get_next_note
40
&pjpidf_tuple_construct,
43
&pjpidf_tuple_get_status,
44
&pjpidf_tuple_get_contact,
45
&pjpidf_tuple_set_contact,
46
&pjpidf_tuple_set_contact_prio,
47
&pjpidf_tuple_get_contact_prio,
48
&pjpidf_tuple_add_note,
49
&pjpidf_tuple_get_first_note,
50
&pjpidf_tuple_get_next_note,
51
&pjpidf_tuple_get_timestamp,
52
&pjpidf_tuple_set_timestamp,
53
&pjpidf_tuple_set_timestamp_np
56
&pjpidf_status_construct,
57
&pjpidf_status_is_basic_open,
58
&pjpidf_status_set_basic_open
62
static pj_str_t PRESENCE = { "presence", 8 };
63
static pj_str_t ENTITY = { "entity", 6};
64
static pj_str_t TUPLE = { "tuple", 5 };
65
static pj_str_t ID = { "id", 2 };
66
static pj_str_t NOTE = { "note", 4 };
67
static pj_str_t STATUS = { "status", 6 };
68
static pj_str_t CONTACT = { "contact", 7 };
69
static pj_str_t PRIORITY = { "priority", 8 };
70
static pj_str_t TIMESTAMP = { "timestamp", 9 };
71
static pj_str_t BASIC = { "basic", 5 };
72
static pj_str_t OPEN = { "open", 4 };
73
static pj_str_t CLOSED = { "closed", 6 };
74
static pj_str_t EMPTY_STRING = { NULL, 0 };
76
static pj_str_t XMLNS = { "xmlns", 5 };
77
static pj_str_t PIDF_XMLNS = { "urn:ietf:params:xml:ns:pidf", 27 };
79
static void xml_init_node(pj_pool_t *pool, pj_xml_node *node,
80
pj_str_t *name, const pj_str_t *value)
82
pj_list_init(&node->attr_head);
83
pj_list_init(&node->node_head);
85
if (value) pj_strdup(pool, &node->content, value);
86
else node->content.ptr=NULL, node->content.slen=0;
89
static pj_xml_attr* xml_create_attr(pj_pool_t *pool, pj_str_t *name,
90
const pj_str_t *value)
92
pj_xml_attr *attr = PJ_POOL_ALLOC_T(pool, pj_xml_attr);
94
pj_strdup(pool, &attr->value, value);
99
PJ_DEF(void) pjpidf_pres_construct(pj_pool_t *pool, pjpidf_pres *pres,
100
const pj_str_t *entity)
104
xml_init_node(pool, pres, &PRESENCE, NULL);
105
attr = xml_create_attr(pool, &ENTITY, entity);
106
pj_xml_add_attr(pres, attr);
107
attr = xml_create_attr(pool, &XMLNS, &PIDF_XMLNS);
108
pj_xml_add_attr(pres, attr);
111
PJ_DEF(pjpidf_tuple*) pjpidf_pres_add_tuple(pj_pool_t *pool, pjpidf_pres *pres,
114
pjpidf_tuple *t = PJ_POOL_ALLOC_T(pool, pjpidf_tuple);
115
pjpidf_tuple_construct(pool, t, id);
116
pj_xml_add_node(pres, t);
120
PJ_DEF(pjpidf_tuple*) pjpidf_pres_get_first_tuple(pjpidf_pres *pres)
122
return pj_xml_find_node(pres, &TUPLE);
125
PJ_DEF(pjpidf_tuple*) pjpidf_pres_get_next_tuple(pjpidf_pres *pres,
128
return pj_xml_find_next_node(pres, tuple, &TUPLE);
131
static pj_bool_t find_tuple_by_id(const pj_xml_node *node, const void *id)
133
return pj_xml_find_attr(node, &ID, (const pj_str_t*)id) != NULL;
136
PJ_DEF(pjpidf_tuple*) pjpidf_pres_find_tuple(pjpidf_pres *pres, const pj_str_t *id)
138
return pj_xml_find(pres, &TUPLE, id, &find_tuple_by_id);
141
PJ_DEF(void) pjpidf_pres_remove_tuple(pjpidf_pres *pres, pjpidf_tuple *t)
147
PJ_DEF(pjpidf_note*) pjpidf_pres_add_note(pj_pool_t *pool, pjpidf_pres *pres,
148
const pj_str_t *text)
150
pjpidf_note *note = PJ_POOL_ALLOC_T(pool, pjpidf_note);
151
xml_init_node(pool, note, &NOTE, text);
152
pj_xml_add_node(pres, note);
156
PJ_DEF(pjpidf_note*) pjpidf_pres_get_first_note(pjpidf_pres *pres)
158
return pj_xml_find_node( pres, &NOTE);
161
PJ_DEF(pjpidf_note*) pjpidf_pres_get_next_note(pjpidf_pres *t, pjpidf_note *note)
163
return pj_xml_find_next_node(t, note, &NOTE);
168
PJ_DEF(void) pjpidf_tuple_construct(pj_pool_t *pool, pjpidf_tuple *t,
174
xml_init_node(pool, t, &TUPLE, NULL);
175
attr = xml_create_attr(pool, &ID, id);
176
pj_xml_add_attr(t, attr);
177
st = PJ_POOL_ALLOC_T(pool, pjpidf_status);
178
pjpidf_status_construct(pool, st);
179
pj_xml_add_node(t, st);
182
PJ_DEF(const pj_str_t*) pjpidf_tuple_get_id(const pjpidf_tuple *t)
184
const pj_xml_attr *attr = pj_xml_find_attr((pj_xml_node*)t, &ID, NULL);
189
PJ_DEF(void) pjpidf_tuple_set_id(pj_pool_t *pool, pjpidf_tuple *t, const pj_str_t *id)
191
pj_xml_attr *attr = pj_xml_find_attr(t, &ID, NULL);
193
pj_strdup(pool, &attr->value, id);
197
PJ_DEF(pjpidf_status*) pjpidf_tuple_get_status(pjpidf_tuple *t)
199
pjpidf_status *st = (pjpidf_status*)pj_xml_find_node(t, &STATUS);
205
PJ_DEF(const pj_str_t*) pjpidf_tuple_get_contact(const pjpidf_tuple *t)
207
pj_xml_node *node = pj_xml_find_node((pj_xml_node*)t, &CONTACT);
209
return &EMPTY_STRING;
210
return &node->content;
213
PJ_DEF(void) pjpidf_tuple_set_contact(pj_pool_t *pool, pjpidf_tuple *t,
214
const pj_str_t *contact)
216
pj_xml_node *node = pj_xml_find_node(t, &CONTACT);
218
node = PJ_POOL_ALLOC_T(pool, pj_xml_node);
219
xml_init_node(pool, node, &CONTACT, contact);
220
pj_xml_add_node(t, node);
222
pj_strdup(pool, &node->content, contact);
226
PJ_DEF(void) pjpidf_tuple_set_contact_prio(pj_pool_t *pool, pjpidf_tuple *t,
227
const pj_str_t *prio)
229
pj_xml_node *node = pj_xml_find_node(t, &CONTACT);
233
node = PJ_POOL_ALLOC_T(pool, pj_xml_node);
234
xml_init_node(pool, node, &CONTACT, NULL);
235
pj_xml_add_node(t, node);
237
attr = pj_xml_find_attr(node, &PRIORITY, NULL);
239
attr = xml_create_attr(pool, &PRIORITY, prio);
240
pj_xml_add_attr(node, attr);
242
pj_strdup(pool, &attr->value, prio);
246
PJ_DEF(const pj_str_t*) pjpidf_tuple_get_contact_prio(const pjpidf_tuple *t)
248
pj_xml_node *node = pj_xml_find_node((pj_xml_node*)t, &CONTACT);
252
return &EMPTY_STRING;
253
attr = pj_xml_find_attr(node, &PRIORITY, NULL);
255
return &EMPTY_STRING;
260
PJ_DEF(pjpidf_note*) pjpidf_tuple_add_note(pj_pool_t *pool, pjpidf_tuple *t,
261
const pj_str_t *text)
263
pjpidf_note *note = PJ_POOL_ALLOC_T(pool, pjpidf_note);
264
xml_init_node(pool, note, &NOTE, text);
265
pj_xml_add_node(t, note);
269
PJ_DEF(pjpidf_note*) pjpidf_tuple_get_first_note(pjpidf_tuple *t)
271
return pj_xml_find_node(t, &NOTE);
274
PJ_DEF(pjpidf_note*) pjpidf_tuple_get_next_note(pjpidf_tuple *t, pjpidf_note *n)
276
return pj_xml_find_next_node(t, n, &NOTE);
280
PJ_DEF(const pj_str_t*) pjpidf_tuple_get_timestamp(const pjpidf_tuple *t)
282
pj_xml_node *node = pj_xml_find_node((pj_xml_node*)t, &TIMESTAMP);
283
return node ? &node->content : &EMPTY_STRING;
286
PJ_DEF(void) pjpidf_tuple_set_timestamp(pj_pool_t *pool, pjpidf_tuple *t,
289
pj_xml_node *node = pj_xml_find_node(t, &TIMESTAMP);
291
node = PJ_POOL_ALLOC_T(pool, pj_xml_node);
292
xml_init_node(pool, node, &TIMESTAMP, ts);
293
pj_xml_add_node(t, node);
295
pj_strdup(pool, &node->content, ts);
300
PJ_DEF(void) pjpidf_tuple_set_timestamp_np(pj_pool_t *pool, pjpidf_tuple *t,
303
pj_xml_node *node = pj_xml_find_node(t, &TIMESTAMP);
305
node = PJ_POOL_ALLOC_T(pool, pj_xml_node);
306
xml_init_node(pool, node, &TIMESTAMP, ts);
314
PJ_DEF(void) pjpidf_status_construct(pj_pool_t *pool, pjpidf_status *st)
318
xml_init_node(pool, st, &STATUS, NULL);
319
node = PJ_POOL_ALLOC_T(pool, pj_xml_node);
320
xml_init_node(pool, node, &BASIC, &CLOSED);
321
pj_xml_add_node(st, node);
324
PJ_DEF(pj_bool_t) pjpidf_status_is_basic_open(const pjpidf_status *st)
326
pj_xml_node *node = pj_xml_find_node((pj_xml_node*)st, &BASIC);
329
return pj_stricmp(&node->content, &OPEN)==0;
332
PJ_DEF(void) pjpidf_status_set_basic_open(pjpidf_status *st, pj_bool_t open)
334
pj_xml_node *node = pj_xml_find_node(st, &BASIC);
336
node->content = open ? OPEN : CLOSED;
339
PJ_DEF(pjpidf_pres*) pjpidf_create(pj_pool_t *pool, const pj_str_t *entity)
341
pjpidf_pres *pres = PJ_POOL_ALLOC_T(pool, pjpidf_pres);
342
pjpidf_pres_construct(pool, pres, entity);
346
PJ_DEF(pjpidf_pres*) pjpidf_parse(pj_pool_t *pool, char *text, int len)
348
pjpidf_pres *pres = pj_xml_parse(pool, text, len);
349
if (pres && pres->name.slen >= 8) {
352
name.ptr = pres->name.ptr + (pres->name.slen - 8);
355
if (pj_stricmp(&name, &PRESENCE) == 0)
361
PJ_DEF(int) pjpidf_print(const pjpidf_pres* pres, char *buf, int len)
363
return pj_xml_print(pres, buf, len, PJ_TRUE);