int list_test() { list_node nodes[4]; // must be even number of nodes list_node list; list_node list2; list_node *p; int i; // don't change to unsigned! // // Test insert_before(). // list.value = (unsigned)-1; pj_list_init(&list); for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) { nodes[i].value = i; pj_list_insert_before(&list, &nodes[i]); } // check. for (i=0, p=list.next; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i, p=p->next) { pj_assert(p->value == i); if (p->value != i) { return -1; } } // // Test insert_after() // pj_list_init(&list); for (i=PJ_SIGNED_ARRAY_SIZE(nodes)-1; i>=0; --i) { pj_list_insert_after(&list, &nodes[i]); } // check. for (i=0, p=list.next; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i, p=p->next) { pj_assert(p->value == i); if (p->value != i) { return -1; } } // // Test merge_last() // // Init lists pj_list_init(&list); pj_list_init(&list2); for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes)/2; ++i) { pj_list_insert_before(&list, &nodes[i]); } for (i=PJ_SIGNED_ARRAY_SIZE(nodes)/2; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) { pj_list_insert_before(&list2, &nodes[i]); } // merge pj_list_merge_last(&list, &list2); // check. for (i=0, p=list.next; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i, p=p->next) { pj_assert(p->value == i); if (p->value != i) { return -1; } } // check list is empty pj_assert( pj_list_empty(&list2) ); if (!pj_list_empty(&list2)) { return -1; } // // Check merge_first() // pj_list_init(&list); pj_list_init(&list2); for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes)/2; ++i) { pj_list_insert_before(&list, &nodes[i]); } for (i=PJ_SIGNED_ARRAY_SIZE(nodes)/2; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) { pj_list_insert_before(&list2, &nodes[i]); } // merge pj_list_merge_first(&list2, &list); // check (list2). for (i=0, p=list2.next; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i, p=p->next) { pj_assert(p->value == i); if (p->value != i) { return -1; } } // check list is empty pj_assert( pj_list_empty(&list) ); if (!pj_list_empty(&list)) { return -1; } // // Test insert_nodes_before() // // init list pj_list_init(&list); for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes)/2; ++i) { pj_list_insert_before(&list, &nodes[i]); } // chain remaining nodes pj_list_init(&nodes[PJ_SIGNED_ARRAY_SIZE(nodes)/2]); for (i=PJ_SIGNED_ARRAY_SIZE(nodes)/2+1; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) { pj_list_insert_before(&nodes[PJ_SIGNED_ARRAY_SIZE(nodes)/2], &nodes[i]); } // insert nodes pj_list_insert_nodes_before(&list, &nodes[PJ_SIGNED_ARRAY_SIZE(nodes)/2]); // check for (i=0, p=list.next; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i, p=p->next) { pj_assert(p->value == i); if (p->value != i) { return -1; } } // erase test. pj_list_init(&list); for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) { nodes[i].value = i; pj_list_insert_before(&list, &nodes[i]); } for (i=PJ_SIGNED_ARRAY_SIZE(nodes)-1; i>=0; --i) { int j; pj_list_erase(&nodes[i]); for (j=0, p=list.next; j<i; ++j, p=p->next) { pj_assert(p->value == j); if (p->value != j) { return -1; } } } // find and search pj_list_init(&list); for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) { nodes[i].value = i; pj_list_insert_before(&list, &nodes[i]); } for (i=0; i<PJ_SIGNED_ARRAY_SIZE(nodes); ++i) { p = (list_node*) pj_list_find_node(&list, &nodes[i]); pj_assert( p == &nodes[i] ); if (p != &nodes[i]) { return -1; } p = (list_node*) pj_list_search(&list, (void*)(pj_ssize_t)i, &compare_node); pj_assert( p == &nodes[i] ); if (p != &nodes[i]) { return -1; } } return 0; }
static pj_status_t set_contact( pjsip_regc *regc, int contact_cnt, const pj_str_t contact[] ) { const pj_str_t CONTACT = { "Contact", 7 }; pjsip_contact_hdr *h; int i; /* Save existing contact list to removed_contact_hdr_list and * clear contact_hdr_list. */ pj_list_merge_last(®c->removed_contact_hdr_list, ®c->contact_hdr_list); /* Set the expiration of Contacts in to removed_contact_hdr_list * zero. */ h = regc->removed_contact_hdr_list.next; while (h != ®c->removed_contact_hdr_list) { h->expires = 0; h = h->next; } /* Process new contacts */ for (i=0; i<contact_cnt; ++i) { pjsip_contact_hdr *hdr; pj_str_t tmp; pj_strdup_with_null(regc->pool, &tmp, &contact[i]); hdr = (pjsip_contact_hdr*) pjsip_parse_hdr(regc->pool, &CONTACT, tmp.ptr, tmp.slen, NULL); if (hdr == NULL) { PJ_LOG(4,(THIS_FILE, "Invalid Contact: \"%.*s\"", (int)tmp.slen, tmp.ptr)); return PJSIP_EINVALIDURI; } /* Find the new contact in old contact list. If found, remove * the old header from the old header list. */ h = regc->removed_contact_hdr_list.next; while (h != ®c->removed_contact_hdr_list) { int rc; rc = pjsip_uri_cmp(PJSIP_URI_IN_CONTACT_HDR, h->uri, hdr->uri); if (rc == 0) { /* Match */ pj_list_erase(h); break; } h = h->next; } /* If add_xuid_param option is enabled and Contact URI is sip/sips, * add xuid parameter to assist matching the Contact URI in the * REGISTER response later. */ if (regc->add_xuid_param && (PJSIP_URI_SCHEME_IS_SIP(hdr->uri) || PJSIP_URI_SCHEME_IS_SIPS(hdr->uri))) { pjsip_param *xuid_param; pjsip_sip_uri *sip_uri; xuid_param = PJ_POOL_ZALLOC_T(regc->pool, pjsip_param); xuid_param->name = XUID_PARAM_NAME; pj_create_unique_string(regc->pool, &xuid_param->value); sip_uri = (pjsip_sip_uri*) pjsip_uri_get_uri(hdr->uri); pj_list_push_back(&sip_uri->other_param, xuid_param); } pj_list_push_back(®c->contact_hdr_list, hdr); } return PJ_SUCCESS; }
// // Merge list. // void merge_last(Pj_List *list) { pj_list_merge_last(&root_, &list->root_); }