qos_mi.c 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264
  1. /*
  2. * $Id$
  3. *
  4. * Copyright (C) 2007 SOMA Networks, Inc.
  5. * Written by Ovidiu Sas (osas)
  6. *
  7. * This file is part of Kamailio, a free SIP server.
  8. *
  9. * Kamailio is free software; you can redistribute it and/or modify it
  10. * under the terms of the GNU General Public License as published by
  11. * the Free Software Foundation; either version 2 of the License, or
  12. * (at your option) any later version
  13. *
  14. * Kamailio is distributed in the hope that it will be useful, but
  15. * WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  17. * General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU General Public License
  20. * along with this program; if not, write to the Free Software
  21. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301
  22. * USA
  23. *
  24. * History:
  25. * --------
  26. * 2007-07-16 initial version (osas)
  27. */
  28. #include "../../ut.h"
  29. #include "../../dprint.h"
  30. #include "../../lib/kmi/mi.h"
  31. #include "qos_handlers.h"
  32. #include "qos_ctx_helpers.h"
  33. int add_mi_sdp_payload_nodes(struct mi_node* node, int index, sdp_payload_attr_t* sdp_payload)
  34. {
  35. struct mi_node* node1;
  36. struct mi_attr* attr;
  37. char* p;
  38. int len;
  39. p = int2str((unsigned long)(index), &len);
  40. node1 = add_mi_node_child( node, MI_DUP_VALUE, "payload", 7, p, len);
  41. if (node1==NULL)
  42. return 1;
  43. attr = add_mi_attr(node1, MI_DUP_VALUE, "rtpmap", 6, sdp_payload->rtp_payload.s, sdp_payload->rtp_payload.len);
  44. if (attr==NULL)
  45. return 1;
  46. if (sdp_payload->rtp_enc.s!=NULL && sdp_payload->rtp_enc.len!=0) {
  47. attr = add_mi_attr(node1, MI_DUP_VALUE, "codec", 5, sdp_payload->rtp_enc.s, sdp_payload->rtp_enc.len);
  48. if(attr == NULL)
  49. return 1;
  50. }
  51. return 0;
  52. }
  53. int add_mi_stream_nodes(struct mi_node* node, int index, sdp_stream_cell_t* stream)
  54. {
  55. struct mi_node* node1;
  56. struct mi_attr* attr;
  57. sdp_payload_attr_t* sdp_payload;
  58. char* p;
  59. int i, len;
  60. p = int2str((unsigned long)(index), &len);
  61. node1 = add_mi_node_child( node, MI_DUP_VALUE, "stream", 6, p, len);
  62. if (node1==NULL)
  63. return 1;
  64. attr = add_mi_attr(node1, MI_DUP_VALUE, "media", 5, stream->media.s, stream->media.len);
  65. if(attr == NULL)
  66. return 1;
  67. attr = add_mi_attr(node1, MI_DUP_VALUE, "IP", 2, stream->ip_addr.s, stream->ip_addr.len);
  68. if(attr == NULL)
  69. return 1;
  70. attr = add_mi_attr(node1, MI_DUP_VALUE, "port", 4, stream->port.s, stream->port.len);
  71. if(attr == NULL)
  72. return 1;
  73. attr = add_mi_attr(node1, MI_DUP_VALUE, "transport", 9, stream->transport.s, stream->transport.len);
  74. if(attr == NULL)
  75. return 1;
  76. if (stream->sendrecv_mode.s!=NULL && stream->sendrecv_mode.len!=0) {
  77. attr = add_mi_attr(node1, MI_DUP_VALUE, "sendrecv", 8, stream->sendrecv_mode.s, stream->sendrecv_mode.len);
  78. if(attr == NULL)
  79. return 1;
  80. }
  81. if (stream->ptime.s!=NULL && stream->ptime.len!=0) {
  82. attr = add_mi_attr(node1, MI_DUP_VALUE, "ptime", 5, stream->ptime.s, stream->ptime.len);
  83. if(attr == NULL)
  84. return 1;
  85. }
  86. p = int2str((unsigned long)(stream->payloads_num), &len);
  87. attr = add_mi_attr(node1, MI_DUP_VALUE, "payloads_num", 12, p, len);
  88. if(attr == NULL)
  89. return 1;
  90. sdp_payload = stream->payload_attr;
  91. for(i=stream->payloads_num-1;i>=0;i--){
  92. if (!sdp_payload) {
  93. LM_ERR("got NULL sdp_payload\n");
  94. return 1;
  95. }
  96. if (0!=add_mi_sdp_payload_nodes(node1, i, sdp_payload)){
  97. return 1;
  98. }
  99. sdp_payload = sdp_payload->next;
  100. }
  101. return 0;
  102. }
  103. int add_mi_session_nodes(struct mi_node* node, int index, sdp_session_cell_t* session)
  104. {
  105. struct mi_node* node1;
  106. struct mi_attr* attr;
  107. sdp_stream_cell_t* stream;
  108. char* p;
  109. int i, len;
  110. switch (index) {
  111. case 0:
  112. node1 = add_mi_node_child( node, MI_DUP_VALUE, "session", 7, "caller", 6);
  113. if (node1==NULL)
  114. return 1;
  115. break;
  116. case 1:
  117. node1 = add_mi_node_child( node, MI_DUP_VALUE, "session", 7, "callee", 6);
  118. if (node1==NULL)
  119. return 1;
  120. break;
  121. default:
  122. return 1;
  123. }
  124. attr = add_mi_attr(node1, MI_DUP_VALUE, "cnt_disp", 8, session->cnt_disp.s, session->cnt_disp.len);
  125. if(attr == NULL)
  126. return 1;
  127. attr = add_mi_attr(node1, MI_DUP_VALUE, "bw_type", 7, session->bw_type.s, session->bw_type.len);
  128. if(attr == NULL)
  129. return 1;
  130. attr = add_mi_attr(node1, MI_DUP_VALUE, "bw_width", 8, session->bw_width.s, session->bw_width.len);
  131. if(attr == NULL)
  132. return 1;
  133. p = int2str((unsigned long)(session->streams_num), &len);
  134. attr = add_mi_attr(node1, MI_DUP_VALUE, "streams", 7, p, len);
  135. if(attr == NULL)
  136. return 1;
  137. stream = session->streams;
  138. for(i=session->streams_num-1;i>=0;i--){
  139. if (!stream) {
  140. LM_ERR("got NULL stream\n");
  141. return 1;
  142. }
  143. if (0!=add_mi_stream_nodes(node1, i, stream)){
  144. return 1;
  145. }
  146. stream = stream->next;
  147. }
  148. return 0;
  149. }
  150. int add_mi_sdp_nodes(struct mi_node* node, qos_sdp_t* qos_sdp)
  151. {
  152. struct mi_node* node1;
  153. struct mi_attr* attr;
  154. char* p;
  155. int i, len;
  156. sdp_session_cell_t* session;
  157. if ( qos_sdp->prev != NULL ) LM_ERR("got qos_sdp->prev=%p\n", qos_sdp->prev);
  158. while (qos_sdp) {
  159. node1 = add_mi_node_child( node, MI_DUP_VALUE, "sdp", 3, NULL, 0);
  160. if (node1==NULL)
  161. return 1;
  162. p = int2str((unsigned long)(qos_sdp->method_dir), &len);
  163. attr = add_mi_attr(node1, MI_DUP_VALUE, "m_dir", 5, p, len);
  164. if(attr == NULL)
  165. return 1;
  166. p = int2str((unsigned long)(qos_sdp->method_id), &len);
  167. attr = add_mi_attr(node1, MI_DUP_VALUE, "m_id", 4, p, len);
  168. if(attr == NULL)
  169. return 1;
  170. attr = add_mi_attr(node1, MI_DUP_VALUE, "method", 6, qos_sdp->method.s, qos_sdp->method.len);
  171. if(attr == NULL)
  172. return 1;
  173. attr = add_mi_attr(node1, MI_DUP_VALUE, "cseq", 4, qos_sdp->cseq.s, qos_sdp->cseq.len);
  174. if(attr == NULL)
  175. return 1;
  176. p = int2str((unsigned long)(qos_sdp->negotiation), &len);
  177. attr = add_mi_attr(node1, MI_DUP_VALUE, "negotiation", 11, p, len);
  178. if(attr == NULL)
  179. return 1;
  180. for (i=1;i>=0;i--){
  181. session = qos_sdp->sdp_session[i];
  182. if (session) {
  183. if (0 != add_mi_session_nodes(node1, i, session))
  184. return 1;
  185. }
  186. }
  187. qos_sdp = qos_sdp->next;
  188. }
  189. return 0;
  190. }
  191. void qos_dialog_mi_context_CB(struct dlg_cell* did, int type, struct dlg_cb_params * params)
  192. {
  193. struct mi_node* parent_node = (struct mi_node*)(params->dlg_data);
  194. struct mi_node* node;
  195. qos_ctx_t* qos_ctx = (qos_ctx_t*)*(params->param);
  196. qos_sdp_t* qos_sdp;
  197. qos_sdp = qos_ctx->pending_sdp;
  198. if (qos_sdp) {
  199. node = add_mi_node_child(parent_node, MI_DUP_VALUE, "qos", 3, "pending_sdp", 11);
  200. if (node==NULL) {
  201. LM_ERR("oom\n");
  202. return;
  203. }
  204. if (0 != add_mi_sdp_nodes( node, qos_sdp))
  205. return;
  206. }
  207. qos_sdp = qos_ctx->negotiated_sdp;
  208. if (qos_sdp) {
  209. node = add_mi_node_child(parent_node, MI_DUP_VALUE, "qos", 3, "negotiated_sdp", 14);
  210. if (node==NULL) {
  211. LM_ERR("oom\n");
  212. return;
  213. }
  214. if (0 != add_mi_sdp_nodes( node, qos_sdp))
  215. return;
  216. }
  217. return;
  218. }