forked from OpenSIPS/opensips
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtree.h
More file actions
108 lines (84 loc) · 2.86 KB
/
Copy pathtree.h
File metadata and controls
108 lines (84 loc) · 2.86 KB
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
/*
* $Id$
*
* Copyright (C) 2006 Voice Sistem SRL
*
* This file is part of opensips, a free SIP server.
*
* opensips is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* opensips is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
*
* History:
* ---------
* 2006-09-08 first version (bogdan)
*/
/*!
* \file
* \brief MI :: Tree
* \ingroup mi
*/
#ifndef _MI_TREE_H
#define _MI_TREE_H
#include <stdarg.h>
#include "../str.h"
struct mi_node;
struct mi_handler;
#include "attr.h"
#define MI_DUP_NAME (1<<0)
#define MI_DUP_VALUE (1<<1)
#define MI_NOT_COMPLETED (1<<2)
#define MI_WRITTEN (1<<3)
#define MI_OK_S "OK"
#define MI_OK_LEN (sizeof(MI_OK_S)-1)
#define MI_INTERNAL_ERR_S "Server Internal Error"
#define MI_INTERNAL_ERR_LEN (sizeof(MI_INTERNAL_ERR_S)-1)
#define MI_MISSING_PARM_S "Too few or too many arguments"
#define MI_MISSING_PARM_LEN (sizeof(MI_MISSING_PARM_S)-1)
#define MI_BAD_PARM_S "Bad parameter"
#define MI_BAD_PARM_LEN (sizeof(MI_BAD_PARM_S)-1)
#define MI_SSTR(_s) _s,(sizeof(_s)-1)
#define MI_OK MI_OK_S
#define MI_INTERNAL_ERR MI_INTERNAL_ERR_S
#define MI_MISSING_PARM MI_MISSING_PARM_S
#define MI_BAD_PARM MI_BAD_PARM_S
struct mi_node {
str value;
str name;
unsigned int flags;
struct mi_node *kids;
struct mi_node *next;
struct mi_node *last;
struct mi_attr *attributes;
};
struct mi_root {
unsigned int code;
str reason;
struct mi_handler *async_hdl;
struct mi_node node;
};
struct mi_root *init_mi_tree(unsigned int code, char *reason, int reason_len);
void free_mi_tree(struct mi_root *parent);
void free_mi_node(struct mi_node *parent);
struct mi_node *add_mi_node_sibling(struct mi_node *brother, int flags,
char *name, int name_len, char *value, int value_len);
struct mi_node *addf_mi_node_sibling(struct mi_node *brother, int flags,
char *name, int name_len, char *fmt_val, ...);
struct mi_node *add_mi_node_child(struct mi_node *parent, int flags,
char *name, int name_len, char *value, int value_len);
struct mi_node *addf_mi_node_child(struct mi_node *parent, int flags,
char *name, int name_len, char *fmt_val, ...);
struct mi_root* clone_mi_tree(struct mi_root *org, int shm);
void free_shm_mi_tree(struct mi_root *parent);
#endif