xavp.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846
  1. /*
  2. * Copyright (C) 2009 Daniel-Constantin Mierla (asipto.com)
  3. *
  4. * Permission to use, copy, modify, and distribute this software for any
  5. * purpose with or without fee is hereby granted, provided that the above
  6. * copyright notice and this permission notice appear in all copies.
  7. *
  8. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  9. * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  10. * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
  11. * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  12. * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
  13. * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
  14. * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  15. */
  16. /*!
  17. * \file
  18. * \brief Kamailio core :: Extended AVPs
  19. * \ingroup core
  20. * Module: \ref core
  21. */
  22. #ifdef WITH_XAVP
  23. #include <stdio.h>
  24. #include <string.h>
  25. #include "mem/mem.h"
  26. #include "mem/shm_mem.h"
  27. #include "dprint.h"
  28. #include "hashes.h"
  29. #include "xavp.h"
  30. /*! XAVP list head */
  31. static sr_xavp_t *_xavp_list_head = 0;
  32. /*! Pointer to XAVP current list */
  33. static sr_xavp_t **_xavp_list_crt = &_xavp_list_head;
  34. /*! Helper functions */
  35. static sr_xavp_t *xavp_get_internal(str *name, sr_xavp_t **list, int idx, sr_xavp_t **prv);
  36. static int xavp_rm_internal(str *name, sr_xavp_t **head, int idx);
  37. void xavp_shm_free(void *p)
  38. {
  39. shm_free(p);
  40. }
  41. void xavp_shm_free_unsafe(void *p)
  42. {
  43. shm_free_unsafe(p);
  44. }
  45. void xavp_free(sr_xavp_t *xa)
  46. {
  47. if(xa->val.type == SR_XTYPE_DATA) {
  48. if(xa->val.v.data!=NULL && xa->val.v.data->pfree!=NULL) {
  49. xa->val.v.data->pfree(xa->val.v.data->p, xavp_shm_free);
  50. shm_free(xa->val.v.data);
  51. }
  52. } else if(xa->val.type == SR_XTYPE_XAVP) {
  53. xavp_destroy_list(&xa->val.v.xavp);
  54. }
  55. shm_free(xa);
  56. }
  57. void xavp_free_unsafe(sr_xavp_t *xa)
  58. {
  59. if(xa->val.type == SR_XTYPE_DATA) {
  60. if(xa->val.v.data!=NULL && xa->val.v.data->pfree!=NULL) {
  61. xa->val.v.data->pfree(xa->val.v.data->p, xavp_shm_free_unsafe);
  62. shm_free_unsafe(xa->val.v.data);
  63. }
  64. } else if(xa->val.type == SR_XTYPE_XAVP) {
  65. xavp_destroy_list_unsafe(&xa->val.v.xavp);
  66. }
  67. shm_free_unsafe(xa);
  68. }
  69. static sr_xavp_t *xavp_new_value(str *name, sr_xval_t *val)
  70. {
  71. sr_xavp_t *avp;
  72. int size;
  73. unsigned int id;
  74. if(name==NULL || name->s==NULL || val==NULL)
  75. return NULL;
  76. id = get_hash1_raw(name->s, name->len);
  77. size = sizeof(sr_xavp_t) + name->len + 1;
  78. if(val->type == SR_XTYPE_STR)
  79. size += val->v.s.len + 1;
  80. avp = (sr_xavp_t*)shm_malloc(size);
  81. if(avp==NULL)
  82. return NULL;
  83. memset(avp, 0, size);
  84. avp->id = id;
  85. avp->name.s = (char*)avp + sizeof(sr_xavp_t);
  86. memcpy(avp->name.s, name->s, name->len);
  87. avp->name.s[name->len] = '\0';
  88. avp->name.len = name->len;
  89. memcpy(&avp->val, val, sizeof(sr_xval_t));
  90. if(val->type == SR_XTYPE_STR)
  91. {
  92. avp->val.v.s.s = avp->name.s + avp->name.len + 1;
  93. memcpy(avp->val.v.s.s, val->v.s.s, val->v.s.len);
  94. avp->val.v.s.s[val->v.s.len] = '\0';
  95. avp->val.v.s.len = val->v.s.len;
  96. }
  97. return avp;
  98. }
  99. int xavp_add(sr_xavp_t *xavp, sr_xavp_t **list)
  100. {
  101. if (xavp==NULL)
  102. return -1;
  103. /* Prepend new xavp to the list */
  104. if(list) {
  105. xavp->next = *list;
  106. *list = xavp;
  107. } else {
  108. xavp->next = *_xavp_list_crt;
  109. *_xavp_list_crt = xavp;
  110. }
  111. return 0;
  112. }
  113. int xavp_add_last(sr_xavp_t *xavp, sr_xavp_t **list)
  114. {
  115. sr_xavp_t *prev;
  116. sr_xavp_t *crt;
  117. if (xavp==NULL)
  118. return -1;
  119. crt = xavp_get_internal(&xavp->name, list, 0, 0);
  120. prev = NULL;
  121. while(crt) {
  122. prev = crt;
  123. crt = xavp_get_next(prev);
  124. }
  125. if(prev==NULL) {
  126. /* Prepend new xavp to the list */
  127. if(list) {
  128. xavp->next = *list;
  129. *list = xavp;
  130. } else {
  131. xavp->next = *_xavp_list_crt;
  132. *_xavp_list_crt = xavp;
  133. }
  134. } else {
  135. xavp->next = prev->next;
  136. prev->next = xavp;
  137. }
  138. return 0;
  139. }
  140. sr_xavp_t *xavp_add_value(str *name, sr_xval_t *val, sr_xavp_t **list)
  141. {
  142. sr_xavp_t *avp=0;
  143. avp = xavp_new_value(name, val);
  144. if (avp==NULL)
  145. return NULL;
  146. /* Prepend new value to the list */
  147. if(list) {
  148. avp->next = *list;
  149. *list = avp;
  150. } else {
  151. avp->next = *_xavp_list_crt;
  152. *_xavp_list_crt = avp;
  153. }
  154. return avp;
  155. }
  156. sr_xavp_t *xavp_add_xavp_value(str *rname, str *name, sr_xval_t *val, sr_xavp_t **list)
  157. {
  158. sr_xavp_t *ravp=0;
  159. sr_xavp_t *cavp=0;
  160. sr_xval_t rval;
  161. cavp = xavp_new_value(name, val);
  162. if (cavp==NULL)
  163. return NULL;
  164. memset(&rval, 0, sizeof(sr_xval_t));
  165. rval.type = SR_XTYPE_XAVP;
  166. rval.v.xavp = cavp;
  167. ravp = xavp_new_value(rname, &rval);
  168. if (ravp==NULL) {
  169. xavp_destroy_list(&cavp);
  170. return NULL;
  171. }
  172. /* Prepend new value to the list */
  173. if(list) {
  174. ravp->next = *list;
  175. *list = ravp;
  176. } else {
  177. ravp->next = *_xavp_list_crt;
  178. *_xavp_list_crt = ravp;
  179. }
  180. return ravp;
  181. }
  182. sr_xavp_t *xavp_set_value(str *name, int idx, sr_xval_t *val, sr_xavp_t **list)
  183. {
  184. sr_xavp_t *avp;
  185. sr_xavp_t *cur;
  186. sr_xavp_t *prv=0;
  187. if(val==NULL)
  188. return NULL;
  189. /* Find the current value */
  190. cur = xavp_get_internal(name, list, idx, &prv);
  191. if(cur==NULL)
  192. return NULL;
  193. avp = xavp_new_value(name, val);
  194. if (avp==NULL)
  195. return NULL;
  196. /* Replace the current value with the new */
  197. avp->next = cur->next;
  198. if(prv)
  199. prv->next = avp;
  200. else if(list)
  201. *list = avp;
  202. else
  203. *_xavp_list_crt = avp;
  204. xavp_free(cur);
  205. return avp;
  206. }
  207. static sr_xavp_t *xavp_get_internal(str *name, sr_xavp_t **list, int idx, sr_xavp_t **prv)
  208. {
  209. sr_xavp_t *avp;
  210. unsigned int id;
  211. int n = 0;
  212. if(name==NULL || name->s==NULL)
  213. return NULL;
  214. id = get_hash1_raw(name->s, name->len);
  215. if(list && *list)
  216. avp = *list;
  217. else
  218. avp = *_xavp_list_crt;
  219. while(avp)
  220. {
  221. if(avp->id==id && avp->name.len==name->len
  222. && strncmp(avp->name.s, name->s, name->len)==0)
  223. {
  224. if(idx==n)
  225. return avp;
  226. n++;
  227. }
  228. if(prv)
  229. *prv = avp;
  230. avp = avp->next;
  231. }
  232. return NULL;
  233. }
  234. sr_xavp_t *xavp_get(str *name, sr_xavp_t *start)
  235. {
  236. return xavp_get_internal(name, (start)?&start:NULL, 0, NULL);
  237. }
  238. sr_xavp_t *xavp_get_by_index(str *name, int idx, sr_xavp_t **start)
  239. {
  240. return xavp_get_internal(name, start, idx, NULL);
  241. }
  242. sr_xavp_t *xavp_get_next(sr_xavp_t *start)
  243. {
  244. sr_xavp_t *avp;
  245. if(start==NULL)
  246. return NULL;
  247. avp = start->next;
  248. while(avp)
  249. {
  250. if(avp->id==start->id && avp->name.len==start->name.len
  251. && strncmp(avp->name.s, start->name.s, start->name.len)==0)
  252. return avp;
  253. avp=avp->next;
  254. }
  255. return NULL;
  256. }
  257. int xavp_rm(sr_xavp_t *xa, sr_xavp_t **head)
  258. {
  259. sr_xavp_t *avp;
  260. sr_xavp_t *prv=0;
  261. if(head!=NULL)
  262. avp = *head;
  263. else
  264. avp=*_xavp_list_crt;
  265. while(avp)
  266. {
  267. if(avp==xa)
  268. {
  269. if(prv)
  270. prv->next=avp->next;
  271. else if(head!=NULL)
  272. *head = avp->next;
  273. else
  274. *_xavp_list_crt = avp->next;
  275. xavp_free(avp);
  276. return 1;
  277. }
  278. prv=avp; avp=avp->next;
  279. }
  280. return 0;
  281. }
  282. /* Remove xavps
  283. * idx: <0 remove all xavps with the same name
  284. * >=0 remove only the specified index xavp
  285. * Returns number of xavps that were deleted
  286. */
  287. static int xavp_rm_internal(str *name, sr_xavp_t **head, int idx)
  288. {
  289. sr_xavp_t *avp;
  290. sr_xavp_t *foo;
  291. sr_xavp_t *prv=0;
  292. unsigned int id;
  293. int n=0;
  294. int count=0;
  295. if(name==NULL || name->s==NULL)
  296. return 0;
  297. id = get_hash1_raw(name->s, name->len);
  298. if(head!=NULL)
  299. avp = *head;
  300. else
  301. avp = *_xavp_list_crt;
  302. while(avp)
  303. {
  304. foo = avp;
  305. avp=avp->next;
  306. if(foo->id==id && foo->name.len==name->len
  307. && strncmp(foo->name.s, name->s, name->len)==0)
  308. {
  309. if(idx<0 || idx==n)
  310. {
  311. if(prv!=NULL)
  312. prv->next=foo->next;
  313. else if(head!=NULL)
  314. *head = foo->next;
  315. else
  316. *_xavp_list_crt = foo->next;
  317. xavp_free(foo);
  318. if(idx>=0)
  319. return 1;
  320. count++;
  321. }
  322. n++;
  323. } else {
  324. prv = foo;
  325. }
  326. }
  327. return count;
  328. }
  329. int xavp_rm_by_name(str *name, int all, sr_xavp_t **head)
  330. {
  331. return xavp_rm_internal(name, head, -1*all);
  332. }
  333. int xavp_rm_by_index(str *name, int idx, sr_xavp_t **head)
  334. {
  335. if (idx<0)
  336. return 0;
  337. return xavp_rm_internal(name, head, idx);
  338. }
  339. int xavp_count(str *name, sr_xavp_t **start)
  340. {
  341. sr_xavp_t *avp;
  342. unsigned int id;
  343. int n = 0;
  344. if(name==NULL || name->s==NULL)
  345. return -1;
  346. id = get_hash1_raw(name->s, name->len);
  347. if(start)
  348. avp = *start;
  349. else
  350. avp=*_xavp_list_crt;
  351. while(avp)
  352. {
  353. if(avp->id==id && avp->name.len==name->len
  354. && strncmp(avp->name.s, name->s, name->len)==0)
  355. {
  356. n++;
  357. }
  358. avp=avp->next;
  359. }
  360. return n;
  361. }
  362. void xavp_destroy_list_unsafe(sr_xavp_t **head)
  363. {
  364. sr_xavp_t *avp, *foo;
  365. avp = *head;
  366. while(avp)
  367. {
  368. foo = avp;
  369. avp = avp->next;
  370. xavp_free_unsafe(foo);
  371. }
  372. *head = 0;
  373. }
  374. void xavp_destroy_list(sr_xavp_t **head)
  375. {
  376. sr_xavp_t *avp, *foo;
  377. LM_DBG("destroying xavp list %p\n", *head);
  378. avp = *head;
  379. while(avp)
  380. {
  381. foo = avp;
  382. avp = avp->next;
  383. xavp_free(foo);
  384. }
  385. *head = 0;
  386. }
  387. void xavp_reset_list(void)
  388. {
  389. assert(_xavp_list_crt!=0 );
  390. if (_xavp_list_crt!=&_xavp_list_head)
  391. _xavp_list_crt=&_xavp_list_head;
  392. xavp_destroy_list(_xavp_list_crt);
  393. }
  394. sr_xavp_t **xavp_set_list(sr_xavp_t **head)
  395. {
  396. sr_xavp_t **avp;
  397. assert(_xavp_list_crt!=0);
  398. avp = _xavp_list_crt;
  399. _xavp_list_crt = head;
  400. return avp;
  401. }
  402. sr_xavp_t **xavp_get_crt_list(void)
  403. {
  404. assert(_xavp_list_crt!=0);
  405. return _xavp_list_crt;
  406. }
  407. void xavp_print_list_content(sr_xavp_t **head, int level)
  408. {
  409. sr_xavp_t *avp=0;
  410. sr_xavp_t *start=0;
  411. if(head!=NULL)
  412. start = *head;
  413. else
  414. start=*_xavp_list_crt;
  415. LM_INFO("+++++ start XAVP list: %p (level=%d)\n", start, level);
  416. avp = start;
  417. while(avp)
  418. {
  419. LM_INFO(" *** XAVP name: %s\n", avp->name.s);
  420. LM_INFO(" XAVP id: %u\n", avp->id);
  421. LM_INFO(" XAVP value type: %d\n", avp->val.type);
  422. switch(avp->val.type) {
  423. case SR_XTYPE_NULL:
  424. LM_INFO(" XAVP value: <null>\n");
  425. break;
  426. case SR_XTYPE_INT:
  427. LM_INFO(" XAVP value: %d\n", avp->val.v.i);
  428. break;
  429. case SR_XTYPE_STR:
  430. LM_INFO(" XAVP value: %s\n", avp->val.v.s.s);
  431. break;
  432. case SR_XTYPE_TIME:
  433. LM_INFO(" XAVP value: %lu\n",
  434. (long unsigned int)avp->val.v.t);
  435. break;
  436. case SR_XTYPE_LONG:
  437. LM_INFO(" XAVP value: %ld\n", avp->val.v.l);
  438. break;
  439. case SR_XTYPE_LLONG:
  440. LM_INFO(" XAVP value: %lld\n", avp->val.v.ll);
  441. break;
  442. case SR_XTYPE_XAVP:
  443. LM_INFO(" XAVP value: <xavp:%p>\n", avp->val.v.xavp);
  444. xavp_print_list_content(&avp->val.v.xavp, level+1);
  445. break;
  446. case SR_XTYPE_DATA:
  447. LM_INFO(" XAVP value: <data:%p>\n", avp->val.v.data);
  448. break;
  449. }
  450. avp = avp->next;
  451. }
  452. LM_INFO("----- end XAVP list: %p (level=%d)\n", start, level);
  453. }
  454. void xavp_print_list(sr_xavp_t **head)
  455. {
  456. xavp_print_list_content(head, 0);
  457. }
  458. /**
  459. * returns a list of str with key names.
  460. * Example:
  461. * If we have this structure
  462. * $xavp(test=>one) = 1
  463. * $xavp(test[0]=>two) = "2"
  464. * $xavp(test[0]=>three) = 3
  465. * $xavp(test[0]=>four) = $xavp(whatever)
  466. * $xavp(test[0]=>two) = "other 2"
  467. *
  468. * xavp_get_list_keys_names(test[0]) returns
  469. * {"one", "two", "three", "four"}
  470. *
  471. * free the struct str_list afterwards
  472. * but do *NO* free the strings inside
  473. */
  474. struct str_list *xavp_get_list_key_names(sr_xavp_t *xavp)
  475. {
  476. sr_xavp_t *avp = NULL;
  477. struct str_list *result = NULL;
  478. struct str_list *r = NULL;
  479. struct str_list *f = NULL;
  480. int total = 0;
  481. if(xavp==NULL){
  482. LM_ERR("xavp is NULL\n");
  483. return 0;
  484. }
  485. if(xavp->val.type!=SR_XTYPE_XAVP){
  486. LM_ERR("%s not xavp?\n", xavp->name.s);
  487. return 0;
  488. }
  489. avp = xavp->val.v.xavp;
  490. if (avp)
  491. {
  492. result = (struct str_list*)pkg_malloc(sizeof(struct str_list));
  493. if (result==NULL) {
  494. PKG_MEM_ERROR;
  495. return 0;
  496. }
  497. r = result;
  498. r->s.s = avp->name.s;
  499. r->s.len = avp->name.len;
  500. r->next = NULL;
  501. avp = avp->next;
  502. }
  503. while(avp)
  504. {
  505. f = result;
  506. while(f)
  507. {
  508. if((avp->name.len==f->s.len)&&
  509. (strncmp(avp->name.s, f->s.s, f->s.len)==0))
  510. {
  511. break; /* name already on list */
  512. }
  513. f = f->next;
  514. }
  515. if (f==NULL)
  516. {
  517. r = append_str_list(avp->name.s, avp->name.len, &r, &total);
  518. if(r==NULL){
  519. while(result){
  520. r = result;
  521. result = result->next;
  522. pkg_free(r);
  523. }
  524. return 0;
  525. }
  526. }
  527. avp = avp->next;
  528. }
  529. return result;
  530. }
  531. /**
  532. * clone the xavp without values that are custom data
  533. * - only one list level is cloned, other sublists are ignored
  534. */
  535. sr_xavp_t *xavp_clone_level_nodata(sr_xavp_t *xold)
  536. {
  537. sr_xavp_t *xnew = NULL;
  538. sr_xavp_t *navp = NULL;
  539. sr_xavp_t *oavp = NULL;
  540. sr_xavp_t *pavp = NULL;
  541. if(xold == NULL)
  542. {
  543. return NULL;
  544. }
  545. if(xold->val.type==SR_XTYPE_DATA)
  546. {
  547. LM_INFO("xavp value type is 'data' - ignoring in clone\n");
  548. return NULL;
  549. }
  550. xnew = xavp_new_value(&xold->name, &xold->val);
  551. if(xnew==NULL)
  552. {
  553. LM_ERR("cannot create cloned root xavp\n");
  554. return NULL;
  555. }
  556. LM_DBG("cloned root xavp [%.*s]\n", xold->name.len, xold->name.s);
  557. if(xold->val.type!=SR_XTYPE_XAVP)
  558. {
  559. return xnew;
  560. }
  561. xnew->val.v.xavp = NULL;
  562. oavp = xold->val.v.xavp;
  563. while(oavp)
  564. {
  565. if(oavp->val.type!=SR_XTYPE_DATA && oavp->val.type!=SR_XTYPE_XAVP)
  566. {
  567. navp = xavp_new_value(&oavp->name, &oavp->val);
  568. if(navp==NULL)
  569. {
  570. LM_ERR("cannot create cloned embedded xavp\n");
  571. if(xnew->val.v.xavp == NULL)
  572. {
  573. shm_free(xnew);
  574. return NULL;
  575. } else {
  576. xavp_destroy_list(&navp);
  577. return NULL;
  578. }
  579. }
  580. LM_DBG("cloned inner xavp [%.*s]\n", oavp->name.len, oavp->name.s);
  581. if(xnew->val.v.xavp == NULL)
  582. {
  583. /* link to val in head xavp */
  584. xnew->val.v.xavp = navp;
  585. } else {
  586. /* link to prev xavp in the list */
  587. pavp->next = navp;
  588. }
  589. pavp = navp;
  590. }
  591. oavp = oavp->next;
  592. }
  593. if(xnew->val.v.xavp == NULL)
  594. {
  595. shm_free(xnew);
  596. return NULL;
  597. }
  598. return xnew;
  599. }
  600. int xavp_insert(sr_xavp_t *xavp, int idx, sr_xavp_t **list)
  601. {
  602. sr_xavp_t *crt = 0;
  603. sr_xavp_t *lst = 0;
  604. sr_xval_t val;
  605. int n = 0;
  606. int i = 0;
  607. crt = xavp_get_internal(&xavp->name, list, 0, NULL);
  608. if (idx == 0 && (!crt || crt->val.type != SR_XTYPE_NULL))
  609. return xavp_add(xavp, list);
  610. while(crt!=NULL && n<idx) {
  611. lst = crt;
  612. n++;
  613. crt = xavp_get_next(lst);
  614. }
  615. if (crt && crt->val.type == SR_XTYPE_NULL) {
  616. xavp->next = crt->next;
  617. crt->next = xavp;
  618. xavp_rm(crt, list);
  619. return 0;
  620. }
  621. memset(&val, 0, sizeof(sr_xval_t));
  622. val.type = SR_XTYPE_NULL;
  623. for(i=0; i<idx-n; i++) {
  624. crt = xavp_new_value(&xavp->name, &val);
  625. if(crt==NULL)
  626. return -1;
  627. if (lst == NULL) {
  628. xavp_add(crt, list);
  629. } else {
  630. crt->next = lst->next;
  631. lst->next = crt;
  632. }
  633. lst = crt;
  634. }
  635. if(lst==NULL) {
  636. LM_ERR("cannot link the xavp\n");
  637. return -1;
  638. }
  639. xavp->next = lst->next;
  640. lst->next = xavp;
  641. return 0;
  642. }
  643. sr_xavp_t *xavp_extract(str *name, sr_xavp_t **list)
  644. {
  645. sr_xavp_t *avp = 0;
  646. sr_xavp_t *foo;
  647. sr_xavp_t *prv = 0;
  648. unsigned int id;
  649. if(name==NULL || name->s==NULL) {
  650. if(list!=NULL) {
  651. avp = *list;
  652. if(avp!=NULL) {
  653. *list = avp->next;
  654. avp->next = NULL;
  655. }
  656. } else {
  657. avp = *_xavp_list_crt;
  658. if(avp!=NULL) {
  659. *_xavp_list_crt = avp->next;
  660. avp->next = NULL;
  661. }
  662. }
  663. return avp;
  664. }
  665. id = get_hash1_raw(name->s, name->len);
  666. if(list!=NULL)
  667. avp = *list;
  668. else
  669. avp = *_xavp_list_crt;
  670. while(avp)
  671. {
  672. foo = avp;
  673. avp=avp->next;
  674. if(foo->id==id && foo->name.len==name->len
  675. && strncmp(foo->name.s, name->s, name->len)==0)
  676. {
  677. if(prv!=NULL)
  678. prv->next=foo->next;
  679. else if(list!=NULL)
  680. *list = foo->next;
  681. else
  682. *_xavp_list_crt = foo->next;
  683. foo->next = NULL;
  684. return foo;
  685. } else {
  686. prv = foo;
  687. }
  688. }
  689. return NULL;
  690. }
  691. /**
  692. * return child node of an xavp
  693. * - $xavp(rname=>cname)
  694. */
  695. sr_xavp_t* xavp_get_child(str *rname, str *cname)
  696. {
  697. sr_xavp_t *ravp=NULL;
  698. ravp = xavp_get(rname, NULL);
  699. if(ravp==NULL || ravp->val.type!=SR_XTYPE_XAVP)
  700. return NULL;
  701. return xavp_get(cname, ravp->val.v.xavp);
  702. }
  703. /**
  704. * return child node of an xavp if it has int value
  705. * - $xavp(rname=>cname)
  706. */
  707. sr_xavp_t* xavp_get_child_with_ival(str *rname, str *cname)
  708. {
  709. sr_xavp_t *vavp=NULL;
  710. vavp = xavp_get_child(rname, cname);
  711. if(vavp==NULL || vavp->val.type!=SR_XTYPE_INT)
  712. return NULL;
  713. return vavp;
  714. }
  715. /**
  716. * return child node of an xavp if it has string value
  717. * - $xavp(rname=>cname)
  718. */
  719. sr_xavp_t* xavp_get_child_with_sval(str *rname, str *cname)
  720. {
  721. sr_xavp_t *vavp=NULL;
  722. vavp = xavp_get_child(rname, cname);
  723. if(vavp==NULL || vavp->val.type!=SR_XTYPE_STR)
  724. return NULL;
  725. return vavp;
  726. }
  727. #endif