mirror of https://github.com/sipwise/kamailio.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
102 lines
3.0 KiB
102 lines
3.0 KiB
/*
|
|
* $Id$
|
|
*
|
|
* Copyright (C) 2012 Andrew Mortensen
|
|
*
|
|
* This file is part of the sca module for sip-router, a free SIP server.
|
|
*
|
|
* The sca module 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
|
|
*
|
|
* The sca module 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
|
|
*
|
|
*
|
|
*/
|
|
/* common includes for s-r modules */
|
|
|
|
#ifndef SCA_COMMON_H
|
|
#define SCA_COMMON_H
|
|
|
|
#include <assert.h>
|
|
|
|
/* general headers for module API, debugging, parsing, str handling */
|
|
#include "../../sr_module.h"
|
|
#include "../../data_lump.h"
|
|
#include "../../data_lump_rpl.h"
|
|
#include "../../dprint.h"
|
|
#include "../../dset.h"
|
|
#include "../../flags.h"
|
|
#include "../../hashes.h"
|
|
#include "../../locking.h"
|
|
#include "../../parser/hf.h"
|
|
#include "../../parser/msg_parser.h"
|
|
#include "../../parser/contact/parse_contact.h"
|
|
#include "../../parser/parse_expires.h"
|
|
#include "../../parser/parse_from.h"
|
|
#include "../../str.h"
|
|
|
|
/* memory management */
|
|
#include "../../mem/mem.h"
|
|
#include "../../mem/shm_mem.h"
|
|
|
|
/* bound API headers */
|
|
#include "../../modules/sl/sl.h"
|
|
#include "../../modules/tm/tm_load.h"
|
|
|
|
|
|
/* convenience macros */
|
|
#define SCA_STRUCT_PTR_OFFSET( struct1, cast1, offset1 ) \
|
|
(cast1)(struct1) + (offset1)
|
|
|
|
#define SCA_STR_COPY( str1, str2 ) \
|
|
memcpy((str1)->s, (str2)->s, (str2)->len ); \
|
|
(str1)->len = (str2)->len;
|
|
|
|
#define SCA_STR_APPEND( str1, str2 ) \
|
|
memcpy((str1)->s + (str1)->len, (str2)->s, (str2)->len); \
|
|
(str1)->len += (str2)->len;
|
|
|
|
#define SCA_STR_APPEND_L( str1, str1_lim, s2, s2_len ) \
|
|
if ((str1)->len + (s2_len) >= (str1_lim)) { \
|
|
LM_ERR( "Failed to append to str: too long" ); \
|
|
} else { \
|
|
SCA_STR_APPEND((str1), (s2), (s2_len)); \
|
|
(str1_lim) -= (s2_len); \
|
|
}
|
|
|
|
#define SCA_STR_COPY_CSTR( str1, cstr1 ) \
|
|
memcpy((str1)->s + (str1)->len, (cstr1), strlen((cstr1))); \
|
|
(str1)->len += strlen((cstr1));
|
|
|
|
#define SCA_STR_APPEND_CSTR( str1, cstr1 ) \
|
|
SCA_STR_COPY_CSTR((str1), (cstr1))
|
|
|
|
#define SCA_STR_APPEND_CSTR_L( str1, str1_lim, cstr1 ) \
|
|
if ((str1)->len + strlen(cstr1) >= (str1_lim)) { \
|
|
LM_ERR( "Failed to append to str: too long" ); \
|
|
} else { \
|
|
SCA_STR_APPEND_CSTR((str1), (cstr1)); \
|
|
}
|
|
|
|
/* STR_EQ assumes we're not using str pointers, which is obnoxious */
|
|
#define SCA_STR_EQ( str1, str2 ) \
|
|
(((str1)->len == (str2)->len) && \
|
|
memcmp((str1)->s, (str2)->s, (str1)->len) == 0)
|
|
|
|
#define SCA_STR_EMPTY( str1 ) \
|
|
((str1) == NULL || ((str1)->s == NULL || (str1)->len <= 0 ))
|
|
|
|
#define SCA_HEADER_EMPTY( hdr1 ) \
|
|
((hdr1) == NULL || SCA_STR_EMPTY( &(hdr1)->body ))
|
|
|
|
#endif /* SCA_COMMON_H */
|