Function serialize_branches

serialize.c:88–264

! \brief * Loads contacts in destination set into "serial_avp" AVP in reverse * priority order and associated each contact with Q_FLAG telling if * contact is the last one in its priority class. Finally, removes * all branches from destination set. */

 * all branches from destination set.
 */
int serialize_branches(struct sip_msg *msg, int clean_before, int keep_order)
{
	static struct serial_contact contacts[MAX_BRANCHES];
	struct msg_branch *branch;
	int n, last, first, i, prev, bflags;
	str *ruri;
	qvalue_t ruri_q;
	char *p;
	str enc_info;
	int_str val;
	int idx;

	/* Check if anything needs to be done */
	if (get_dset_size() == 0) {
		LM_DBG("nothing to do - no branches!\n");
		return 0;
	}

	ruri = GET_RURI(msg);
	ruri_q = get_ruri_q(msg);
	bflags = getb0flags(msg);

	for (idx = 0; (branch = get_msg_branch(idx)); idx++) {
		if (branch->q != ruri_q)
			break;
	}

	if (branch==NULL && !keep_order) {
		LM_DBG("nothing to do - all same q!\n");
		return 0;
	}

	/* reset contact array */
	n = 0;

	/* Insert Request-URI to contact list */
	enc_info.len = 3 * sizeof(long)
			+ ruri->len + msg->dst_uri.len + msg->path_vec.len + 3;
	enc_info.s = (char*) pkg_malloc (enc_info.len);

	if (!enc_info.s) {
		LM_ERR("no pkg memory left\n");
		goto error; /* nothing to free here */
	}

	memset(enc_info.s, 0, enc_info.len);
	p = enc_info.s;

	LM_DBG("Msg information <%.*s,%.*s,%.*s,%d,%u>\n",
			ruri->len, ruri->s,
			msg->dst_uri.len, msg->dst_uri.s,
			msg->path_vec.len, msg->path_vec.s,
			ruri_q, bflags);

	seras(p, &msg->force_send_socket, long);
	p += sizeof(long);
	seras(p, &bflags, long);
	p += sizeof(long);