2004-04-28 20:43:06 +00:00
|
|
|
/*
|
2005-09-14 20:46:50 +00:00
|
|
|
* Asterisk -- An open source telephony toolkit.
|
2004-04-28 20:43:06 +00:00
|
|
|
*
|
2005-01-21 07:06:25 +00:00
|
|
|
* Copyright (C) 2004 - 2005, Adrian Kennard, rights assigned to Digium
|
2004-04-28 20:43:06 +00:00
|
|
|
*
|
2005-09-14 20:46:50 +00:00
|
|
|
* See http://www.asterisk.org for more information about
|
|
|
|
* the Asterisk project. Please do not directly contact
|
|
|
|
* any of the maintainers of this project for assistance;
|
|
|
|
* the project provides a web site, mailing lists and IRC
|
|
|
|
* channels for your use.
|
|
|
|
*
|
2004-04-28 20:43:06 +00:00
|
|
|
* This program is free software, distributed under the terms of
|
2005-09-14 20:46:50 +00:00
|
|
|
* the GNU General Public License Version 2. See the LICENSE file
|
|
|
|
* at the top of the source tree.
|
|
|
|
*/
|
|
|
|
|
2005-10-24 20:12:06 +00:00
|
|
|
/*! \file
|
2005-09-14 20:46:50 +00:00
|
|
|
*
|
2006-12-21 16:50:26 +00:00
|
|
|
* \brief SMS application - ETSI ES 201 912 protocol 1 implementation
|
|
|
|
*
|
|
|
|
* \par Development notes
|
|
|
|
* \note The ETSI standards are available free of charge from ETSI at
|
|
|
|
* http://pda.etsi.org/pda/queryform.asp
|
|
|
|
* Among the relevant documents here we have:
|
|
|
|
*
|
|
|
|
* ES 201 912 SMS for PSTN/ISDN
|
|
|
|
* TS 123 040 Technical realization of SMS
|
|
|
|
*
|
|
|
|
*
|
2005-11-06 15:09:47 +00:00
|
|
|
* \ingroup applications
|
2005-12-30 21:18:06 +00:00
|
|
|
*
|
2006-12-21 16:50:26 +00:00
|
|
|
* \author Adrian Kennard (for the original protocol 1 code)
|
2006-12-27 16:58:03 +00:00
|
|
|
* \author Filippo Grassilli (Hyppo) - protocol 2 support
|
2007-06-22 19:53:57 +00:00
|
|
|
* Not fully tested, under development
|
2004-04-28 20:43:06 +00:00
|
|
|
*/
|
|
|
|
|
2011-07-14 20:28:54 +00:00
|
|
|
/*** MODULEINFO
|
|
|
|
<support_level>extended</support_level>
|
|
|
|
***/
|
|
|
|
|
2006-06-07 18:54:56 +00:00
|
|
|
#include "asterisk.h"
|
|
|
|
|
|
|
|
ASTERISK_FILE_VERSION(__FILE__, "$Revision$")
|
|
|
|
|
2004-04-28 20:43:06 +00:00
|
|
|
#include <dirent.h>
|
|
|
|
#include <ctype.h>
|
2005-11-08 04:48:00 +00:00
|
|
|
#include <sys/stat.h>
|
2005-06-06 22:39:32 +00:00
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
#include "asterisk/paths.h" /* use ast_config_AST_SPOOL_DIR and LOG_DIR */
|
2005-06-06 22:39:32 +00:00
|
|
|
#include "asterisk/lock.h"
|
|
|
|
#include "asterisk/file.h"
|
|
|
|
#include "asterisk/channel.h"
|
|
|
|
#include "asterisk/pbx.h"
|
|
|
|
#include "asterisk/module.h"
|
|
|
|
#include "asterisk/alaw.h"
|
|
|
|
#include "asterisk/callerid.h"
|
2006-12-21 22:03:54 +00:00
|
|
|
#include "asterisk/utils.h"
|
|
|
|
#include "asterisk/app.h"
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
#include "asterisk/format_cache.h"
|
2005-06-06 22:39:32 +00:00
|
|
|
|
2008-12-07 22:43:46 +00:00
|
|
|
/*** DOCUMENTATION
|
|
|
|
<application name="SMS" language="en_US">
|
|
|
|
<synopsis>
|
|
|
|
Communicates with SMS service centres and SMS capable analogue phones.
|
|
|
|
</synopsis>
|
|
|
|
<syntax>
|
|
|
|
<parameter name="name" required="true">
|
|
|
|
<para>The name of the queue used in <filename>/var/spool/asterisk/sms</filename></para>
|
|
|
|
</parameter>
|
|
|
|
<parameter name="options">
|
|
|
|
<optionlist>
|
|
|
|
<option name="a">
|
|
|
|
<para>Answer, i.e. send initial FSK packet.</para>
|
|
|
|
</option>
|
|
|
|
<option name="s">
|
|
|
|
<para>Act as service centre talking to a phone.</para>
|
|
|
|
</option>
|
|
|
|
<option name="t">
|
|
|
|
<para>Use protocol 2 (default used is protocol 1).</para>
|
|
|
|
</option>
|
|
|
|
<option name="p">
|
|
|
|
<para>Set the initial delay to N ms (default is <literal>300</literal>).
|
|
|
|
addr and body are a deprecated format to send messages out.</para>
|
|
|
|
</option>
|
|
|
|
<option name="r">
|
|
|
|
<para>Set the Status Report Request (SRR) bit.</para>
|
|
|
|
</option>
|
|
|
|
<option name="o">
|
|
|
|
<para>The body should be coded as octets not 7-bit symbols.</para>
|
|
|
|
</option>
|
|
|
|
</optionlist>
|
|
|
|
</parameter>
|
|
|
|
<parameter name="addr" />
|
|
|
|
<parameter name="body" />
|
|
|
|
</syntax>
|
|
|
|
<description>
|
|
|
|
<para>SMS handles exchange of SMS data with a call to/from SMS capable phone or SMS PSTN service center.
|
|
|
|
Can send and/or receive SMS messages. Works to ETSI ES 201 912; compatible with BT SMS PSTN service in
|
|
|
|
UK and Telecom Italia in Italy.</para>
|
|
|
|
<para>Typical usage is to use to handle calls from the SMS service centre CLI, or to set up a call using
|
|
|
|
<literal>outgoing</literal> or manager interface to connect service centre to SMS().</para>
|
|
|
|
<para>"Messages are processed as per text file message queues. smsq (a separate software) is a command to
|
|
|
|
generate message queues and send messages.</para>
|
|
|
|
<note><para>The protocol has tight delay bounds. Please use short frames and disable/keep short the
|
|
|
|
jitter buffer on the ATA to make sure that respones (ACK etc.) are received in time.</para></note>
|
|
|
|
</description>
|
|
|
|
</application>
|
|
|
|
***/
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
/* #define OUTALAW */ /* enable this to output Alaw rather than linear */
|
2004-12-11 22:36:27 +00:00
|
|
|
|
2004-04-28 20:43:06 +00:00
|
|
|
/* ToDo */
|
|
|
|
/* Add full VP support */
|
|
|
|
/* Handle status report messages (generation and reception) */
|
2004-12-11 22:36:27 +00:00
|
|
|
/* Time zones on time stamps */
|
|
|
|
/* user ref field */
|
2004-04-28 20:43:06 +00:00
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
static volatile unsigned char message_ref; /* arbitary message ref */
|
|
|
|
static volatile unsigned int seq; /* arbitrary message sequence number for unqiue files */
|
2004-04-28 20:43:06 +00:00
|
|
|
|
2004-10-07 19:00:00 +00:00
|
|
|
static char log_file[255];
|
|
|
|
|
2004-04-28 20:43:06 +00:00
|
|
|
static char *app = "SMS";
|
|
|
|
|
2006-12-19 21:29:55 +00:00
|
|
|
/*
|
|
|
|
* 80 samples of a single period of the wave. At 8000 Hz, it means these
|
|
|
|
* are the samples of a 100 Hz signal.
|
|
|
|
* To pick the two carriers (1300Hz for '1' and 2100 Hz for '0') used by
|
|
|
|
* the modulation, we should take one every 13 and 21 samples respectively.
|
|
|
|
*/
|
2009-05-21 21:13:09 +00:00
|
|
|
static const signed short wave[] = {
|
2005-04-29 16:13:04 +00:00
|
|
|
0, 392, 782, 1167, 1545, 1913, 2270, 2612, 2939, 3247, 3536, 3802, 4045, 4263, 4455, 4619, 4755, 4862, 4938, 4985,
|
|
|
|
5000, 4985, 4938, 4862, 4755, 4619, 4455, 4263, 4045, 3802, 3536, 3247, 2939, 2612, 2270, 1913, 1545, 1167, 782, 392,
|
|
|
|
0, -392, -782, -1167,
|
|
|
|
-1545, -1913, -2270, -2612, -2939, -3247, -3536, -3802, -4045, -4263, -4455, -4619, -4755, -4862, -4938, -4985, -5000,
|
|
|
|
-4985, -4938, -4862,
|
|
|
|
-4755, -4619, -4455, -4263, -4045, -3802, -3536, -3247, -2939, -2612, -2270, -1913, -1545, -1167, -782, -392
|
2004-04-28 20:43:06 +00:00
|
|
|
};
|
|
|
|
|
2004-12-11 22:36:27 +00:00
|
|
|
#ifdef OUTALAW
|
|
|
|
static unsigned char wavea[80];
|
2006-12-19 23:56:08 +00:00
|
|
|
typedef unsigned char output_t;
|
2008-10-14 18:58:19 +00:00
|
|
|
static const output_t *wave_out = wavea; /* outgoing samples */
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
#define __OUT_FMT ast_format_alaw
|
2006-12-19 23:56:08 +00:00
|
|
|
#else
|
|
|
|
typedef signed short output_t;
|
2008-10-14 18:58:19 +00:00
|
|
|
static const output_t *wave_out = wave; /* outgoing samples */
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
#define __OUT_FMT ast_format_slin
|
2004-12-11 22:36:27 +00:00
|
|
|
#endif
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
#define OSYNC_BITS 80 /* initial sync bits */
|
2006-12-21 16:50:26 +00:00
|
|
|
|
|
|
|
/*!
|
|
|
|
* The SMS spec ETSI ES 201 912 defines two protocols with different message types.
|
|
|
|
* Also note that the high bit is used to indicate whether the message
|
|
|
|
* is complete or not, but in two opposite ways:
|
|
|
|
* for Protocol 1, 0x80 means that the message is complete;
|
|
|
|
* for Protocol 2, 0x00 means that the message is complete;
|
|
|
|
*/
|
|
|
|
enum message_types {
|
2008-10-14 18:58:19 +00:00
|
|
|
DLL_SMS_MASK = 0x7f, /* mask for the valid bits */
|
2006-12-21 16:50:26 +00:00
|
|
|
|
|
|
|
/* Protocol 1 values */
|
2008-10-14 18:58:19 +00:00
|
|
|
DLL1_SMS_DATA = 0x11, /* data packet */
|
|
|
|
DLL1_SMS_ERROR = 0x12,
|
|
|
|
DLL1_SMS_EST = 0x13, /* start the connection */
|
|
|
|
DLL1_SMS_REL = 0x14, /* end the connection */
|
|
|
|
DLL1_SMS_ACK = 0x15,
|
|
|
|
DLL1_SMS_NACK = 0x16,
|
2006-12-21 16:50:26 +00:00
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
DLL1_SMS_COMPLETE = 0x80, /* packet is complete */
|
|
|
|
DLL1_SMS_MORE = 0x00, /* more data to follow */
|
2006-12-21 16:50:26 +00:00
|
|
|
|
|
|
|
/* Protocol 2 values */
|
2008-10-14 18:58:19 +00:00
|
|
|
DLL2_SMS_EST = 0x7f, /* magic number. No message body */
|
|
|
|
DLL2_SMS_INFO_MO = 0x10,
|
|
|
|
DLL2_SMS_INFO_MT = 0x11,
|
|
|
|
DLL2_SMS_INFO_STA = 0x12,
|
|
|
|
DLL2_SMS_NACK = 0x13,
|
|
|
|
DLL2_SMS_ACK0 = 0x14, /* ack even-numbered frame */
|
|
|
|
DLL2_SMS_ACK1 = 0x15, /* ack odd-numbered frame */
|
|
|
|
DLL2_SMS_ENQ = 0x16,
|
|
|
|
DLL2_SMS_REL = 0x17, /* end the connection */
|
|
|
|
|
|
|
|
DLL2_SMS_COMPLETE = 0x00, /* packet is complete */
|
|
|
|
DLL2_SMS_MORE = 0x80, /* more data to follow */
|
2006-12-21 16:50:26 +00:00
|
|
|
};
|
2004-04-28 20:43:06 +00:00
|
|
|
|
2004-12-11 22:36:27 +00:00
|
|
|
/* SMS 7 bit character mapping to UCS-2 */
|
|
|
|
static const unsigned short defaultalphabet[] = {
|
2005-04-29 16:13:04 +00:00
|
|
|
0x0040, 0x00A3, 0x0024, 0x00A5, 0x00E8, 0x00E9, 0x00F9, 0x00EC,
|
|
|
|
0x00F2, 0x00E7, 0x000A, 0x00D8, 0x00F8, 0x000D, 0x00C5, 0x00E5,
|
|
|
|
0x0394, 0x005F, 0x03A6, 0x0393, 0x039B, 0x03A9, 0x03A0, 0x03A8,
|
|
|
|
0x03A3, 0x0398, 0x039E, 0x00A0, 0x00C6, 0x00E6, 0x00DF, 0x00C9,
|
|
|
|
' ', '!', '"', '#', 164, '%', '&', 39, '(', ')', '*', '+', ',', '-', '.', '/',
|
|
|
|
'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', ':', ';', '<', '=', '>', '?',
|
|
|
|
161, 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O',
|
|
|
|
'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 196, 214, 209, 220, 167,
|
|
|
|
191, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',
|
|
|
|
'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 228, 246, 241, 252, 224,
|
2004-04-28 20:43:06 +00:00
|
|
|
};
|
2004-12-11 22:36:27 +00:00
|
|
|
|
|
|
|
static const unsigned short escapes[] = {
|
2005-04-29 16:13:04 +00:00
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0x000C, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0x005E, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0x007B, 0x007D, 0, 0, 0, 0, 0, 0x005C,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0x005B, 0x007E, 0x005D, 0,
|
|
|
|
0x007C, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0x20AC, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
2004-12-11 22:36:27 +00:00
|
|
|
};
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
#define SMSLEN 160 /*!< max SMS length */
|
|
|
|
#define SMSLEN_8 140 /*!< max SMS length for 8-bit char */
|
2004-04-28 20:43:06 +00:00
|
|
|
|
2006-12-21 18:35:22 +00:00
|
|
|
typedef struct sms_s {
|
2006-12-02 14:07:20 +00:00
|
|
|
unsigned char hangup; /*!< we are done... */
|
|
|
|
unsigned char err; /*!< set for any errors */
|
2014-04-19 01:31:27 +00:00
|
|
|
unsigned char sent_rel:1; /*!< have sent REL message... */
|
2006-12-02 14:07:20 +00:00
|
|
|
unsigned char smsc:1; /*!< we are SMSC */
|
|
|
|
unsigned char rx:1; /*!< this is a received message */
|
|
|
|
char queue[30]; /*!< queue name */
|
|
|
|
char oa[20]; /*!< originating address */
|
|
|
|
char da[20]; /*!< destination address */
|
2007-09-12 21:25:57 +00:00
|
|
|
struct timeval scts; /*!< time stamp, UTC */
|
2006-12-02 14:07:20 +00:00
|
|
|
unsigned char pid; /*!< protocol ID */
|
|
|
|
unsigned char dcs; /*!< data coding scheme */
|
2006-12-21 22:03:54 +00:00
|
|
|
short mr; /*!< message reference - actually a byte, but use -1 for not set */
|
2006-12-02 14:07:20 +00:00
|
|
|
int udl; /*!< user data length */
|
|
|
|
int udhl; /*!< user data header length */
|
|
|
|
unsigned char srr:1; /*!< Status Report request */
|
|
|
|
unsigned char udhi:1; /*!< User Data Header required, even if length 0 */
|
|
|
|
unsigned char rp:1; /*!< Reply Path */
|
|
|
|
unsigned int vp; /*!< validity period in minutes, 0 for not set */
|
|
|
|
unsigned short ud[SMSLEN]; /*!< user data (message), UCS-2 coded */
|
|
|
|
unsigned char udh[SMSLEN]; /*!< user data header */
|
|
|
|
char cli[20]; /*!< caller ID */
|
|
|
|
unsigned char ophase; /*!< phase (0-79) for 0 and 1 frequencies (1300Hz and 2100Hz) */
|
|
|
|
unsigned char ophasep; /*!< phase (0-79) for 1200 bps */
|
|
|
|
unsigned char obyte; /*!< byte being sent */
|
|
|
|
unsigned int opause; /*!< silent pause before sending (in sample periods) */
|
|
|
|
unsigned char obitp; /*!< bit in byte */
|
|
|
|
unsigned char osync; /*!< sync bits to send */
|
|
|
|
unsigned char obytep; /*!< byte in data */
|
|
|
|
unsigned char obyten; /*!< bytes in data */
|
|
|
|
unsigned char omsg[256]; /*!< data buffer (out) */
|
2006-12-19 23:56:08 +00:00
|
|
|
unsigned char imsg[250]; /*!< data buffer (in) */
|
2005-04-29 16:13:04 +00:00
|
|
|
signed long long ims0,
|
|
|
|
imc0,
|
|
|
|
ims1,
|
2007-06-22 19:53:57 +00:00
|
|
|
imc1; /*!< magnitude averages sin/cos 0/1 */
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned int idle;
|
2006-12-02 14:07:20 +00:00
|
|
|
unsigned short imag; /*!< signal level */
|
2007-06-22 19:53:57 +00:00
|
|
|
unsigned char ips0; /*!< phase sin for bit 0, start at 0 inc by 21 mod 80 */
|
|
|
|
unsigned char ips1; /*!< phase cos for bit 0, start at 20 inc by 21 mod 80 */
|
|
|
|
unsigned char ipc0; /*!< phase sin for bit 1, start at 0 inc by 13 mod 80 */
|
|
|
|
unsigned char ipc1; /*!< phase cos for bit 1, start at 20 inc by 13 mod 80 */
|
2006-12-02 14:07:20 +00:00
|
|
|
unsigned char ibitl; /*!< last bit */
|
|
|
|
unsigned char ibitc; /*!< bit run length count */
|
|
|
|
unsigned char iphasep; /*!< bit phase (0-79) for 1200 bps */
|
|
|
|
unsigned char ibitn; /*!< bit number in byte being received */
|
|
|
|
unsigned char ibytev; /*!< byte value being received */
|
2006-12-19 21:29:55 +00:00
|
|
|
unsigned char ibytep; /*!< byte pointer in message */
|
2006-12-02 14:07:20 +00:00
|
|
|
unsigned char ibytec; /*!< byte checksum for message */
|
|
|
|
unsigned char ierr; /*!< error flag */
|
|
|
|
unsigned char ibith; /*!< history of last bits */
|
2006-12-19 21:29:55 +00:00
|
|
|
unsigned char ibitt; /*!< total of 1's in last 3 bytes */
|
2005-04-29 16:13:04 +00:00
|
|
|
/* more to go here */
|
2006-12-21 16:50:26 +00:00
|
|
|
|
2007-06-22 19:53:57 +00:00
|
|
|
int opause_0; /*!< initial delay in ms, p() option */
|
2006-12-21 16:50:26 +00:00
|
|
|
int protocol; /*!< ETSI SMS protocol to use (passed at app call) */
|
|
|
|
int oseizure; /*!< protocol 2: channel seizure bits to send */
|
|
|
|
int framenumber; /*!< protocol 2: frame number (for sending ACK0 or ACK1) */
|
2008-10-14 18:58:19 +00:00
|
|
|
char udtxt[SMSLEN]; /*!< user data (message), PLAIN text */
|
2004-04-28 20:43:06 +00:00
|
|
|
} sms_t;
|
|
|
|
|
2004-12-11 22:36:27 +00:00
|
|
|
/* different types of encoding */
|
2008-10-14 18:58:19 +00:00
|
|
|
#define is7bit(dcs) ( ((dcs) & 0xC0) ? (!((dcs) & 4) ) : (((dcs) & 0xc) == 0) )
|
|
|
|
#define is8bit(dcs) ( ((dcs) & 0xC0) ? ( ((dcs) & 4) ) : (((dcs) & 0xc) == 4) )
|
|
|
|
#define is16bit(dcs) ( ((dcs) & 0xC0) ? 0 : (((dcs) & 0xc) == 8) )
|
2004-12-11 22:36:27 +00:00
|
|
|
|
2007-06-22 19:53:57 +00:00
|
|
|
static void sms_messagetx(sms_t *h);
|
2004-04-28 20:43:06 +00:00
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief copy number, skipping non digits apart from leading + */
|
2006-12-21 22:15:03 +00:00
|
|
|
static void numcpy(char *d, char *s)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2008-10-14 18:58:19 +00:00
|
|
|
if (*s == '+') {
|
2005-04-29 16:13:04 +00:00
|
|
|
*d++ = *s++;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
while (*s) {
|
2008-04-25 20:20:10 +00:00
|
|
|
if (isdigit(*s)) {
|
|
|
|
*d++ = *s;
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
s++;
|
|
|
|
}
|
|
|
|
*d = 0;
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief static, return a date/time in ISO format */
|
2007-06-22 19:53:57 +00:00
|
|
|
static char *isodate(time_t t, char *buf, int len)
|
2005-04-29 16:13:04 +00:00
|
|
|
{
|
2007-07-18 19:47:20 +00:00
|
|
|
struct ast_tm tm;
|
2008-08-10 14:45:25 +00:00
|
|
|
struct timeval local = { t, 0 };
|
|
|
|
ast_localtime(&local, &tm, NULL);
|
2007-07-18 19:47:20 +00:00
|
|
|
ast_strftime(buf, len, "%Y-%m-%dT%H:%M:%S", &tm);
|
2006-12-21 22:15:03 +00:00
|
|
|
return buf;
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-12-21 22:15:03 +00:00
|
|
|
/*! \brief Reads next UCS character from NUL terminated UTF-8 string and advance pointer */
|
2004-12-11 22:36:27 +00:00
|
|
|
/* for non valid UTF-8 sequences, returns character as is */
|
|
|
|
/* Does not advance pointer for null termination */
|
2006-12-21 23:33:44 +00:00
|
|
|
static long utf8decode(unsigned char **pp)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned char *p = *pp;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (!*p) {
|
|
|
|
return 0; /* null termination of string */
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
(*pp)++;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (*p < 0xC0) {
|
|
|
|
return *p; /* ascii or continuation character */
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
if (*p < 0xE0) {
|
2008-10-14 18:58:19 +00:00
|
|
|
if (*p < 0xC2 || (p[1] & 0xC0) != 0x80) {
|
|
|
|
return *p; /* not valid UTF-8 */
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
(*pp)++;
|
|
|
|
return ((*p & 0x1F) << 6) + (p[1] & 0x3F);
|
|
|
|
}
|
|
|
|
if (*p < 0xF0) {
|
2008-10-14 18:58:19 +00:00
|
|
|
if ((*p == 0xE0 && p[1] < 0xA0) || (p[1] & 0xC0) != 0x80 || (p[2] & 0xC0) != 0x80) {
|
|
|
|
return *p; /* not valid UTF-8 */
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
(*pp) += 2;
|
|
|
|
return ((*p & 0x0F) << 12) + ((p[1] & 0x3F) << 6) + (p[2] & 0x3F);
|
|
|
|
}
|
|
|
|
if (*p < 0xF8) {
|
2008-10-14 18:58:19 +00:00
|
|
|
if ((*p == 0xF0 && p[1] < 0x90) || (p[1] & 0xC0) != 0x80 || (p[2] & 0xC0) != 0x80 || (p[3] & 0xC0) != 0x80) {
|
|
|
|
return *p; /* not valid UTF-8 */
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
(*pp) += 3;
|
|
|
|
return ((*p & 0x07) << 18) + ((p[1] & 0x3F) << 12) + ((p[2] & 0x3F) << 6) + (p[3] & 0x3F);
|
|
|
|
}
|
|
|
|
if (*p < 0xFC) {
|
|
|
|
if ((*p == 0xF8 && p[1] < 0x88) || (p[1] & 0xC0) != 0x80 || (p[2] & 0xC0) != 0x80 || (p[3] & 0xC0) != 0x80
|
2008-10-14 18:58:19 +00:00
|
|
|
|| (p[4] & 0xC0) != 0x80) {
|
|
|
|
return *p; /* not valid UTF-8 */
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
(*pp) += 4;
|
|
|
|
return ((*p & 0x03) << 24) + ((p[1] & 0x3F) << 18) + ((p[2] & 0x3F) << 12) + ((p[3] & 0x3F) << 6) + (p[4] & 0x3F);
|
|
|
|
}
|
|
|
|
if (*p < 0xFE) {
|
|
|
|
if ((*p == 0xFC && p[1] < 0x84) || (p[1] & 0xC0) != 0x80 || (p[2] & 0xC0) != 0x80 || (p[3] & 0xC0) != 0x80
|
2008-10-14 18:58:19 +00:00
|
|
|
|| (p[4] & 0xC0) != 0x80 || (p[5] & 0xC0) != 0x80) {
|
|
|
|
return *p; /* not valid UTF-8 */
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
(*pp) += 5;
|
|
|
|
return ((*p & 0x01) << 30) + ((p[1] & 0x3F) << 24) + ((p[2] & 0x3F) << 18) + ((p[3] & 0x3F) << 12) + ((p[4] & 0x3F) << 6) + (p[5] & 0x3F);
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
return *p; /* not sensible */
|
2004-12-11 22:36:27 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief takes a binary header (udhl bytes at udh) and UCS-2 message (udl characters at ud) and packs in to o using SMS 7 bit character codes */
|
2004-12-11 22:36:27 +00:00
|
|
|
/* The return value is the number of septets packed in to o, which is internally limited to SMSLEN */
|
|
|
|
/* o can be null, in which case this is used to validate or count only */
|
|
|
|
/* if the input contains invalid characters then the return value is -1 */
|
2006-12-21 23:33:44 +00:00
|
|
|
static int packsms7(unsigned char *o, int udhl, unsigned char *udh, int udl, unsigned short *ud)
|
2004-12-11 22:36:27 +00:00
|
|
|
{
|
2008-10-14 18:58:19 +00:00
|
|
|
unsigned char p = 0; /* output pointer (bytes) */
|
|
|
|
unsigned char b = 0; /* bit position */
|
|
|
|
unsigned char n = 0; /* output character count */
|
2006-12-21 23:33:44 +00:00
|
|
|
unsigned char dummy[SMSLEN];
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
if (o == NULL) { /* output to a dummy buffer if o not set */
|
2006-12-21 23:33:44 +00:00
|
|
|
o = dummy;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
if (udhl) { /* header */
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p++] = udhl;
|
2005-04-29 16:13:04 +00:00
|
|
|
b = 1;
|
|
|
|
n = 1;
|
|
|
|
while (udhl--) {
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p++] = *udh++;
|
2005-04-29 16:13:04 +00:00
|
|
|
b += 8;
|
|
|
|
while (b >= 7) {
|
|
|
|
b -= 7;
|
|
|
|
n++;
|
|
|
|
}
|
|
|
|
if (n >= SMSLEN)
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
if (b) {
|
|
|
|
b = 7 - b;
|
|
|
|
if (++n >= SMSLEN)
|
|
|
|
return n;
|
2008-10-14 18:58:19 +00:00
|
|
|
} /* filling to septet boundary */
|
2006-12-21 23:33:44 +00:00
|
|
|
}
|
|
|
|
o[p] = 0;
|
|
|
|
/* message */
|
|
|
|
while (udl--) {
|
|
|
|
long u;
|
|
|
|
unsigned char v;
|
|
|
|
u = *ud++;
|
|
|
|
/* XXX 0 is invalid ? */
|
|
|
|
/* look up in defaultalphabet[]. If found, v is the 7-bit code */
|
|
|
|
for (v = 0; v < 128 && defaultalphabet[v] != u; v++);
|
|
|
|
if (v == 128 /* not found */ && u && n + 1 < SMSLEN) {
|
|
|
|
/* if not found, look in the escapes table (we need 2 bytes) */
|
|
|
|
for (v = 0; v < 128 && escapes[v] != u; v++);
|
|
|
|
if (v < 128) { /* escaped sequence, esc + v */
|
|
|
|
/* store the low (8-b) bits in o[p], the remaining bits in o[p+1] */
|
2008-10-14 18:58:19 +00:00
|
|
|
o[p] |= (27 << b); /* the low bits go into o[p] */
|
2005-04-29 16:13:04 +00:00
|
|
|
b += 7;
|
|
|
|
if (b >= 8) {
|
|
|
|
b -= 8;
|
|
|
|
p++;
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p] = (27 >> (7 - b));
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
n++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (v == 128)
|
2008-10-14 18:58:19 +00:00
|
|
|
return -1; /* invalid character */
|
2006-12-21 23:33:44 +00:00
|
|
|
/* store, same as above */
|
|
|
|
o[p] |= (v << b);
|
2005-04-29 16:13:04 +00:00
|
|
|
b += 7;
|
|
|
|
if (b >= 8) {
|
|
|
|
b -= 8;
|
|
|
|
p++;
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p] = (v >> (7 - b));
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
if (++n >= SMSLEN)
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
return n;
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-12-21 23:33:44 +00:00
|
|
|
/*! \brief takes a binary header (udhl bytes at udh) and UCS-2 message (udl characters at ud)
|
|
|
|
* and packs in to o using 8 bit character codes.
|
|
|
|
* The return value is the number of bytes packed in to o, which is internally limited to 140.
|
|
|
|
* o can be null, in which case this is used to validate or count only.
|
|
|
|
* if the input contains invalid characters then the return value is -1
|
|
|
|
*/
|
|
|
|
static int packsms8(unsigned char *o, int udhl, unsigned char *udh, int udl, unsigned short *ud)
|
2004-12-11 22:36:27 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned char p = 0;
|
2006-12-21 23:33:44 +00:00
|
|
|
unsigned char dummy[SMSLEN_8];
|
2005-04-29 16:13:04 +00:00
|
|
|
|
2006-12-21 23:33:44 +00:00
|
|
|
if (o == NULL)
|
|
|
|
o = dummy;
|
2005-04-29 16:13:04 +00:00
|
|
|
/* header - no encoding */
|
|
|
|
if (udhl) {
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p++] = udhl;
|
2005-04-29 16:13:04 +00:00
|
|
|
while (udhl--) {
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p++] = *udh++;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (p >= SMSLEN_8) {
|
2005-04-29 16:13:04 +00:00
|
|
|
return p;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
while (udl--) {
|
|
|
|
long u;
|
|
|
|
u = *ud++;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (u < 0 || u > 0xFF) {
|
|
|
|
return -1; /* not valid */
|
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p++] = u;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (p >= SMSLEN_8) {
|
2005-04-29 16:13:04 +00:00
|
|
|
return p;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
return p;
|
2004-12-11 22:36:27 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief takes a binary header (udhl bytes at udh) and UCS-2
|
2005-04-29 16:13:04 +00:00
|
|
|
message (udl characters at ud) and packs in to o using 16 bit
|
|
|
|
UCS-2 character codes
|
|
|
|
The return value is the number of bytes packed in to o, which is
|
|
|
|
internally limited to 140
|
|
|
|
o can be null, in which case this is used to validate or count
|
|
|
|
only if the input contains invalid characters then
|
|
|
|
the return value is -1 */
|
2006-12-21 23:33:44 +00:00
|
|
|
static int packsms16(unsigned char *o, int udhl, unsigned char *udh, int udl, unsigned short *ud)
|
2004-12-11 22:36:27 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned char p = 0;
|
2006-12-21 23:33:44 +00:00
|
|
|
unsigned char dummy[SMSLEN_8];
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
if (o == NULL) {
|
2006-12-21 23:33:44 +00:00
|
|
|
o = dummy;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
/* header - no encoding */
|
|
|
|
if (udhl) {
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p++] = udhl;
|
2005-04-29 16:13:04 +00:00
|
|
|
while (udhl--) {
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p++] = *udh++;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (p >= SMSLEN_8) {
|
2005-04-29 16:13:04 +00:00
|
|
|
return p;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
while (udl--) {
|
|
|
|
long u;
|
|
|
|
u = *ud++;
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p++] = (u >> 8);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (p >= SMSLEN_8) {
|
|
|
|
return p - 1; /* could not fit last character */
|
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p++] = u;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (p >= SMSLEN_8) {
|
2005-04-29 16:13:04 +00:00
|
|
|
return p;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
return p;
|
2004-12-11 22:36:27 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief general pack, with length and data,
|
2005-04-29 16:13:04 +00:00
|
|
|
returns number of bytes of target used */
|
2006-12-21 23:33:44 +00:00
|
|
|
static int packsms(unsigned char dcs, unsigned char *base, unsigned int udhl, unsigned char *udh, int udl, unsigned short *ud)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned char *p = base;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (udl == 0) {
|
|
|
|
*p++ = 0; /* no user data */
|
|
|
|
} else {
|
2006-12-21 23:33:44 +00:00
|
|
|
|
2005-04-29 16:13:04 +00:00
|
|
|
int l = 0;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (is7bit(dcs)) { /* 7 bit */
|
|
|
|
if ((l = packsms7(p + 1, udhl, udh, udl, ud)) < 0) {
|
2005-04-29 16:13:04 +00:00
|
|
|
l = 0;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
*p++ = l;
|
|
|
|
p += (l * 7 + 7) / 8;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (is8bit(dcs)) { /* 8 bit */
|
|
|
|
if ((l = packsms8(p + 1, udhl, udh, udl, ud)) < 0) {
|
2005-04-29 16:13:04 +00:00
|
|
|
l = 0;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
*p++ = l;
|
|
|
|
p += l;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else { /* UCS-2 */
|
|
|
|
if ((l = packsms16(p + 1, udhl, udh, udl, ud)) < 0) {
|
2005-04-29 16:13:04 +00:00
|
|
|
l = 0;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
*p++ = l;
|
|
|
|
p += l;
|
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
return p - base;
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2004-12-11 22:36:27 +00:00
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief pack a date and return */
|
2006-12-21 23:33:44 +00:00
|
|
|
static void packdate(unsigned char *o, time_t w)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2007-07-18 19:47:20 +00:00
|
|
|
struct ast_tm t;
|
2008-08-10 14:45:25 +00:00
|
|
|
struct timeval topack = { w, 0 };
|
2007-06-28 19:02:31 +00:00
|
|
|
int z;
|
|
|
|
|
2008-08-10 14:45:25 +00:00
|
|
|
ast_localtime(&topack, &t, NULL);
|
2007-11-17 11:08:58 +00:00
|
|
|
#if defined(__FreeBSD__) || defined(__OpenBSD__) || defined( __NetBSD__ ) || defined(__APPLE__) || defined(__CYGWIN__)
|
2007-06-28 19:02:31 +00:00
|
|
|
z = -t.tm_gmtoff / 60 / 15;
|
2004-05-15 22:52:12 +00:00
|
|
|
#else
|
2007-06-28 19:02:31 +00:00
|
|
|
z = timezone / 60 / 15;
|
2004-05-15 22:52:12 +00:00
|
|
|
#endif
|
2007-06-22 19:53:57 +00:00
|
|
|
*o++ = ((t.tm_year % 10) << 4) + (t.tm_year % 100) / 10;
|
|
|
|
*o++ = (((t.tm_mon + 1) % 10) << 4) + (t.tm_mon + 1) / 10;
|
|
|
|
*o++ = ((t.tm_mday % 10) << 4) + t.tm_mday / 10;
|
|
|
|
*o++ = ((t.tm_hour % 10) << 4) + t.tm_hour / 10;
|
|
|
|
*o++ = ((t.tm_min % 10) << 4) + t.tm_min / 10;
|
|
|
|
*o++ = ((t.tm_sec % 10) << 4) + t.tm_sec / 10;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (z < 0) {
|
2005-04-29 16:13:04 +00:00
|
|
|
*o++ = (((-z) % 10) << 4) + (-z) / 10 + 0x08;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
*o++ = ((z % 10) << 4) + z / 10;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief unpack a date and return */
|
2008-03-11 15:13:38 +00:00
|
|
|
static struct timeval unpackdate(unsigned char *i)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2008-03-11 15:13:38 +00:00
|
|
|
struct ast_tm t;
|
|
|
|
|
2005-04-29 16:13:04 +00:00
|
|
|
t.tm_year = 100 + (i[0] & 0xF) * 10 + (i[0] >> 4);
|
|
|
|
t.tm_mon = (i[1] & 0xF) * 10 + (i[1] >> 4) - 1;
|
|
|
|
t.tm_mday = (i[2] & 0xF) * 10 + (i[2] >> 4);
|
|
|
|
t.tm_hour = (i[3] & 0xF) * 10 + (i[3] >> 4);
|
|
|
|
t.tm_min = (i[4] & 0xF) * 10 + (i[4] >> 4);
|
|
|
|
t.tm_sec = (i[5] & 0xF) * 10 + (i[5] >> 4);
|
|
|
|
t.tm_isdst = 0;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (i[6] & 0x08) {
|
2005-04-29 16:13:04 +00:00
|
|
|
t.tm_min += 15 * ((i[6] & 0x7) * 10 + (i[6] >> 4));
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
t.tm_min -= 15 * ((i[6] & 0x7) * 10 + (i[6] >> 4));
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2008-03-11 15:13:38 +00:00
|
|
|
|
2008-03-11 14:37:03 +00:00
|
|
|
return ast_mktime(&t, NULL);
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief unpacks bytes (7 bit encoding) at i, len l septets,
|
2005-04-29 16:13:04 +00:00
|
|
|
and places in udh and ud setting udhl and udl. udh not used
|
|
|
|
if udhi not set */
|
2006-12-21 23:33:44 +00:00
|
|
|
static void unpacksms7(unsigned char *i, unsigned char l, unsigned char *udh, int *udhl, unsigned short *ud, int *udl, char udhi)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned char b = 0, p = 0;
|
|
|
|
unsigned short *o = ud;
|
|
|
|
*udhl = 0;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (udhi && l) { /* header */
|
2005-04-29 16:13:04 +00:00
|
|
|
int h = i[p];
|
|
|
|
*udhl = h;
|
|
|
|
if (h) {
|
|
|
|
b = 1;
|
|
|
|
p++;
|
|
|
|
l--;
|
|
|
|
while (h-- && l) {
|
|
|
|
*udh++ = i[p++];
|
|
|
|
b += 8;
|
|
|
|
while (b >= 7) {
|
|
|
|
b -= 7;
|
|
|
|
l--;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (!l) {
|
2005-04-29 16:13:04 +00:00
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
/* adjust for fill, septets */
|
|
|
|
if (b) {
|
|
|
|
b = 7 - b;
|
|
|
|
l--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
while (l--) {
|
|
|
|
unsigned char v;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (b < 2) {
|
|
|
|
v = ((i[p] >> b) & 0x7F); /* everything in one byte */
|
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
v = ((((i[p] >> b) + (i[p + 1] << (8 - b)))) & 0x7F);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
b += 7;
|
|
|
|
if (b >= 8) {
|
|
|
|
b -= 8;
|
|
|
|
p++;
|
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
/* 0x00A0 is the encoding of ESC (27) in defaultalphabet */
|
2008-10-14 18:58:19 +00:00
|
|
|
if (o > ud && o[-1] == 0x00A0 && escapes[v]) {
|
2005-04-29 16:13:04 +00:00
|
|
|
o[-1] = escapes[v];
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
*o++ = defaultalphabet[v];
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
*udl = (o - ud);
|
2004-12-11 22:36:27 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief unpacks bytes (8 bit encoding) at i, len l septets,
|
2008-04-25 20:20:10 +00:00
|
|
|
* and places in udh and ud setting udhl and udl. udh not used
|
|
|
|
* if udhi not set.
|
|
|
|
*/
|
2006-12-21 23:33:44 +00:00
|
|
|
static void unpacksms8(unsigned char *i, unsigned char l, unsigned char *udh, int *udhl, unsigned short *ud, int *udl, char udhi)
|
2004-12-11 22:36:27 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned short *o = ud;
|
|
|
|
*udhl = 0;
|
|
|
|
if (udhi) {
|
|
|
|
int n = *i;
|
|
|
|
*udhl = n;
|
|
|
|
if (n) {
|
|
|
|
i++;
|
|
|
|
l--;
|
|
|
|
while (l && n) {
|
|
|
|
l--;
|
|
|
|
n--;
|
|
|
|
*udh++ = *i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
while (l--) {
|
|
|
|
*o++ = *i++; /* not to UTF-8 as explicitly 8 bit coding in DCS */
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
*udl = (o - ud);
|
2004-12-11 22:36:27 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief unpacks bytes (16 bit encoding) at i, len l septets,
|
2005-04-29 16:13:04 +00:00
|
|
|
and places in udh and ud setting udhl and udl.
|
|
|
|
udh not used if udhi not set */
|
2006-12-21 23:33:44 +00:00
|
|
|
static void unpacksms16(unsigned char *i, unsigned char l, unsigned char *udh, int *udhl, unsigned short *ud, int *udl, char udhi)
|
2004-12-11 22:36:27 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned short *o = ud;
|
|
|
|
*udhl = 0;
|
|
|
|
if (udhi) {
|
|
|
|
int n = *i;
|
|
|
|
*udhl = n;
|
|
|
|
if (n) {
|
|
|
|
i++;
|
|
|
|
l--;
|
|
|
|
while (l && n) {
|
|
|
|
l--;
|
|
|
|
n--;
|
|
|
|
*udh++ = *i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
while (l--) {
|
|
|
|
int v = *i++;
|
2013-12-16 15:30:18 +00:00
|
|
|
if (l && l--) {
|
2005-04-29 16:13:04 +00:00
|
|
|
v = (v << 8) + *i++;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
*o++ = v;
|
|
|
|
}
|
|
|
|
*udl = (o - ud);
|
2004-12-11 22:36:27 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief general unpack - starts with length byte (octet or septet) and returns number of bytes used, inc length */
|
2006-12-21 23:33:44 +00:00
|
|
|
static int unpacksms(unsigned char dcs, unsigned char *i, unsigned char *udh, int *udhl, unsigned short *ud, int *udl, char udhi)
|
2004-12-11 22:36:27 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
int l = *i++;
|
2007-06-22 19:53:57 +00:00
|
|
|
if (is7bit(dcs)) {
|
|
|
|
unpacksms7(i, l, udh, udhl, ud, udl, udhi);
|
2008-10-14 18:58:19 +00:00
|
|
|
l = (l * 7 + 7) / 8; /* adjust length to return */
|
|
|
|
} else if (is8bit(dcs)) {
|
2007-06-22 19:53:57 +00:00
|
|
|
unpacksms8(i, l, udh, udhl, ud, udl, udhi);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2013-12-16 15:30:18 +00:00
|
|
|
l += l % 2;
|
2007-06-22 19:53:57 +00:00
|
|
|
unpacksms16(i, l, udh, udhl, ud, udl, udhi);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
return l + 1;
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief unpack an address from i, return byte length, unpack to o */
|
2006-12-21 23:33:44 +00:00
|
|
|
static unsigned char unpackaddress(char *o, unsigned char *i)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2008-10-14 18:58:19 +00:00
|
|
|
unsigned char l = i[0], p;
|
|
|
|
if (i[1] == 0x91) {
|
2005-04-29 16:13:04 +00:00
|
|
|
*o++ = '+';
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
for (p = 0; p < l; p++) {
|
2008-10-14 18:58:19 +00:00
|
|
|
if (p & 1) {
|
2005-04-29 16:13:04 +00:00
|
|
|
*o++ = (i[2 + p / 2] >> 4) + '0';
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
*o++ = (i[2 + p / 2] & 0xF) + '0';
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
*o = 0;
|
|
|
|
return (l + 5) / 2;
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief store an address at o, and return number of bytes used */
|
2006-12-21 23:33:44 +00:00
|
|
|
static unsigned char packaddress(unsigned char *o, char *i)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned char p = 2;
|
2008-10-14 18:58:19 +00:00
|
|
|
o[0] = 0; /* number of bytes */
|
|
|
|
if (*i == '+') { /* record as bit 0 in byte 1 */
|
2005-04-29 16:13:04 +00:00
|
|
|
i++;
|
|
|
|
o[1] = 0x91;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
o[1] = 0x81;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
for ( ; *i ; i++) {
|
2008-10-14 18:58:19 +00:00
|
|
|
if (!isdigit(*i)) { /* ignore non-digits */
|
2006-12-21 23:33:44 +00:00
|
|
|
continue;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (o[0] & 1) {
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p++] |= ((*i & 0xF) << 4);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2006-12-21 23:33:44 +00:00
|
|
|
o[p] = (*i & 0xF);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
o[0]++;
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
if (o[0] & 1) {
|
|
|
|
o[p++] |= 0xF0; /* pad */
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
return p;
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief Log the output, and remove file */
|
2006-12-21 23:33:44 +00:00
|
|
|
static void sms_log(sms_t * h, char status)
|
2005-04-29 16:13:04 +00:00
|
|
|
{
|
2006-12-21 23:33:44 +00:00
|
|
|
int o;
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
if (*h->oa == '\0' && *h->da == '\0') {
|
2006-12-21 23:33:44 +00:00
|
|
|
return;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
o = open(log_file, O_CREAT | O_APPEND | O_WRONLY, AST_FILE_MODE);
|
2006-12-21 23:33:44 +00:00
|
|
|
if (o >= 0) {
|
|
|
|
char line[1000], mrs[3] = "", *p;
|
|
|
|
char buf[30];
|
|
|
|
unsigned char n;
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->mr >= 0) {
|
2014-12-17 10:23:32 +00:00
|
|
|
snprintf(mrs, sizeof(mrs), "%02hhX", (unsigned char)h->mr);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
snprintf(line, sizeof(line), "%s %c%c%c%s %s %s %s ",
|
|
|
|
isodate(time(NULL), buf, sizeof(buf)),
|
2006-12-21 23:33:44 +00:00
|
|
|
status, h->rx ? 'I' : 'O', h->smsc ? 'S' : 'M', mrs, h->queue,
|
|
|
|
S_OR(h->oa, "-"), S_OR(h->da, "-") );
|
2007-06-22 19:53:57 +00:00
|
|
|
p = line + strlen(line);
|
2006-12-21 23:33:44 +00:00
|
|
|
for (n = 0; n < h->udl; n++) {
|
|
|
|
if (h->ud[n] == '\\') {
|
|
|
|
*p++ = '\\';
|
|
|
|
*p++ = '\\';
|
|
|
|
} else if (h->ud[n] == '\n') {
|
|
|
|
*p++ = '\\';
|
|
|
|
*p++ = 'n';
|
|
|
|
} else if (h->ud[n] == '\r') {
|
|
|
|
*p++ = '\\';
|
|
|
|
*p++ = 'r';
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (h->ud[n] < 32 || h->ud[n] == 127) {
|
2006-12-21 23:33:44 +00:00
|
|
|
*p++ = 191;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2006-12-21 23:33:44 +00:00
|
|
|
*p++ = h->ud[n];
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
*p++ = '\n';
|
|
|
|
*p = 0;
|
2008-11-02 18:52:13 +00:00
|
|
|
if (write(o, line, strlen(line)) < 0) {
|
|
|
|
ast_log(LOG_WARNING, "write() failed: %s\n", strerror(errno));
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
close(o);
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
*h->oa = *h->da = h->udl = 0;
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief parse and delete a file */
|
2006-12-21 23:33:44 +00:00
|
|
|
static void sms_readfile(sms_t * h, char *fn)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
char line[1000];
|
|
|
|
FILE *s;
|
2008-10-14 18:58:19 +00:00
|
|
|
char dcsset = 0; /* if DSC set */
|
2009-05-02 19:02:22 +00:00
|
|
|
ast_log(LOG_NOTICE, "Sending %s\n", fn);
|
2005-04-29 16:13:04 +00:00
|
|
|
h->rx = h->udl = *h->oa = *h->da = h->pid = h->srr = h->udhi = h->rp = h->vp = h->udhl = 0;
|
|
|
|
h->mr = -1;
|
2008-10-14 18:58:19 +00:00
|
|
|
h->dcs = 0xF1; /* normal messages class 1 */
|
2007-09-12 21:25:57 +00:00
|
|
|
h->scts = ast_tvnow();
|
2007-06-22 19:53:57 +00:00
|
|
|
s = fopen(fn, "r");
|
2006-12-19 23:56:08 +00:00
|
|
|
if (s) {
|
2008-10-14 18:58:19 +00:00
|
|
|
if (unlink(fn)) { /* concurrent access, we lost */
|
2007-06-22 19:53:57 +00:00
|
|
|
fclose(s);
|
2005-04-29 16:13:04 +00:00
|
|
|
return;
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
while (fgets (line, sizeof(line), s)) { /* process line in file */
|
2006-07-07 16:01:36 +00:00
|
|
|
char *p;
|
2006-08-29 17:31:15 +00:00
|
|
|
void *pp = &p;
|
2005-04-29 16:13:04 +00:00
|
|
|
for (p = line; *p && *p != '\n' && *p != '\r'; p++);
|
2008-10-14 18:58:19 +00:00
|
|
|
*p = 0; /* strip eoln */
|
2005-04-29 16:13:04 +00:00
|
|
|
p = line;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (!*p || *p == ';') {
|
|
|
|
continue; /* blank line or comment, ignore */
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
while (isalnum(*p)) {
|
2005-04-29 16:13:04 +00:00
|
|
|
*p = tolower (*p);
|
|
|
|
p++;
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
while (isspace (*p)) {
|
2005-04-29 16:13:04 +00:00
|
|
|
*p++ = 0;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-19 23:56:08 +00:00
|
|
|
if (*p == '=') {
|
2005-04-29 16:13:04 +00:00
|
|
|
*p++ = 0;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (!strcmp(line, "ud")) { /* parse message (UTF-8) */
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned char o = 0;
|
2008-10-14 18:58:19 +00:00
|
|
|
memcpy(h->udtxt, p, SMSLEN); /* for protocol 2 */
|
|
|
|
while (*p && o < SMSLEN) {
|
2006-08-29 17:31:15 +00:00
|
|
|
h->ud[o++] = utf8decode(pp);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
h->udl = o;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (*p) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "UD too long in %s\n", fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-19 23:56:08 +00:00
|
|
|
} else {
|
2008-10-14 18:58:19 +00:00
|
|
|
while (isspace (*p)) {
|
2005-04-29 16:13:04 +00:00
|
|
|
p++;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (!strcmp(line, "oa") && strlen(p) < sizeof(h->oa)) {
|
2005-04-29 16:13:04 +00:00
|
|
|
numcpy (h->oa, p);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (!strcmp(line, "da") && strlen(p) < sizeof(h->oa)) {
|
2005-04-29 16:13:04 +00:00
|
|
|
numcpy (h->da, p);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (!strcmp(line, "pid")) {
|
2007-06-22 19:53:57 +00:00
|
|
|
h->pid = atoi(p);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (!strcmp(line, "dcs")) {
|
2007-06-22 19:53:57 +00:00
|
|
|
h->dcs = atoi(p);
|
2005-04-29 16:13:04 +00:00
|
|
|
dcsset = 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (!strcmp(line, "mr")) {
|
2007-06-22 19:53:57 +00:00
|
|
|
h->mr = atoi(p);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (!strcmp(line, "srr")) {
|
2007-06-22 19:53:57 +00:00
|
|
|
h->srr = (atoi(p) ? 1 : 0);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (!strcmp(line, "vp")) {
|
2007-06-22 19:53:57 +00:00
|
|
|
h->vp = atoi(p);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (!strcmp(line, "rp")) {
|
2007-06-22 19:53:57 +00:00
|
|
|
h->rp = (atoi(p) ? 1 : 0);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (!strcmp(line, "scts")) { /* get date/time */
|
|
|
|
int Y, m, d, H, M, S;
|
|
|
|
/* XXX Why aren't we using ast_strptime here? */
|
2009-08-10 19:20:57 +00:00
|
|
|
if (sscanf(p, "%4d-%2d-%2dT%2d:%2d:%2d", &Y, &m, &d, &H, &M, &S) == 6) {
|
2007-09-12 21:25:57 +00:00
|
|
|
struct ast_tm t = { 0, };
|
2005-04-29 16:13:04 +00:00
|
|
|
t.tm_year = Y - 1900;
|
|
|
|
t.tm_mon = m - 1;
|
|
|
|
t.tm_mday = d;
|
|
|
|
t.tm_hour = H;
|
|
|
|
t.tm_min = M;
|
|
|
|
t.tm_sec = S;
|
|
|
|
t.tm_isdst = -1;
|
2007-09-12 21:25:57 +00:00
|
|
|
h->scts = ast_mktime(&t, NULL);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->scts.tv_sec == 0) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Bad date/timein %s: %s", fn, p);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Cannot parse in %s: %s=%si\n", fn, line, p);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (*p == '#') { /* raw hex format */
|
2005-04-29 16:13:04 +00:00
|
|
|
*p++ = 0;
|
2006-12-19 23:56:08 +00:00
|
|
|
if (*p == '#') {
|
2005-04-29 16:13:04 +00:00
|
|
|
p++;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (!strcmp(line, "ud")) { /* user data */
|
2005-04-29 16:13:04 +00:00
|
|
|
int o = 0;
|
2006-12-19 23:56:08 +00:00
|
|
|
while (*p && o < SMSLEN) {
|
2007-06-22 19:53:57 +00:00
|
|
|
if (isxdigit(*p) && isxdigit(p[1]) && isxdigit(p[2]) && isxdigit(p[3])) {
|
2005-04-29 16:13:04 +00:00
|
|
|
h->ud[o++] =
|
2007-06-22 19:53:57 +00:00
|
|
|
(((isalpha(*p) ? 9 : 0) + (*p & 0xF)) << 12) +
|
|
|
|
(((isalpha(p[1]) ? 9 : 0) + (p[1] & 0xF)) << 8) +
|
|
|
|
(((isalpha(p[2]) ? 9 : 0) + (p[2] & 0xF)) << 4) + ((isalpha(p[3]) ? 9 : 0) + (p[3] & 0xF));
|
2005-04-29 16:13:04 +00:00
|
|
|
p += 4;
|
|
|
|
} else
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
h->udl = o;
|
|
|
|
if (*p)
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "UD too long / invalid UCS-2 hex in %s\n", fn);
|
2005-04-29 16:13:04 +00:00
|
|
|
} else
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Only ud can use ## format, %s\n", fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (!strcmp(line, "ud")) { /* user data */
|
2005-04-29 16:13:04 +00:00
|
|
|
int o = 0;
|
2006-12-19 23:56:08 +00:00
|
|
|
while (*p && o < SMSLEN) {
|
2007-06-22 19:53:57 +00:00
|
|
|
if (isxdigit(*p) && isxdigit(p[1])) {
|
|
|
|
h->ud[o++] = (((isalpha(*p) ? 9 : 0) + (*p & 0xF)) << 4) + ((isalpha(p[1]) ? 9 : 0) + (p[1] & 0xF));
|
2005-04-29 16:13:04 +00:00
|
|
|
p += 2;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
h->udl = o;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (*p) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "UD too long / invalid UCS-1 hex in %s\n", fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
} else if (!strcmp(line, "udh")) { /* user data header */
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned char o = 0;
|
|
|
|
h->udhi = 1;
|
2006-12-19 23:56:08 +00:00
|
|
|
while (*p && o < SMSLEN) {
|
2007-06-22 19:53:57 +00:00
|
|
|
if (isxdigit(*p) && isxdigit(p[1])) {
|
|
|
|
h->udh[o] = (((isalpha(*p) ? 9 : 0) + (*p & 0xF)) << 4) + ((isalpha(p[1]) ? 9 : 0) + (p[1] & 0xF));
|
2005-04-29 16:13:04 +00:00
|
|
|
o++;
|
|
|
|
p += 2;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
h->udhl = o;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (*p) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "UDH too long / invalid hex in %s\n", fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
} else {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Only ud and udh can use # format, %s\n", fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
} else {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Cannot parse in %s: %s\n", fn, line);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
fclose(s);
|
|
|
|
if (!dcsset && packsms7(0, h->udhl, h->udh, h->udl, h->ud) < 0) {
|
|
|
|
if (packsms8(0, h->udhl, h->udh, h->udl, h->ud) < 0) {
|
2008-10-14 18:58:19 +00:00
|
|
|
if (packsms16(0, h->udhl, h->udh, h->udl, h->ud) < 0) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Invalid UTF-8 message even for UCS-2 (%s)\n", fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
|
|
|
h->dcs = 0x08; /* default to 16 bit */
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Sending in 16 bit format(%s)\n", fn);
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2006-12-19 23:56:08 +00:00
|
|
|
} else {
|
2008-10-14 18:58:19 +00:00
|
|
|
h->dcs = 0xF5; /* default to 8 bit */
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Sending in 8 bit format(%s)\n", fn);
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
if (is7bit(h->dcs) && packsms7(0, h->udhl, h->udh, h->udl, h->ud) < 0) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Invalid 7 bit GSM data %s\n", fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (is8bit(h->dcs) && packsms8(0, h->udhl, h->udh, h->udl, h->ud) < 0) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Invalid 8 bit data %s\n", fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (is16bit(h->dcs) && packsms16(0, h->udhl, h->udh, h->udl, h->ud) < 0) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Invalid 16 bit data %s\n", fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief white a received text message to a file */
|
2006-12-21 23:33:44 +00:00
|
|
|
static void sms_writefile(sms_t * h)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
char fn[200] = "", fn2[200] = "";
|
2006-12-21 22:15:03 +00:00
|
|
|
char buf[30];
|
2005-04-29 16:13:04 +00:00
|
|
|
FILE *o;
|
2006-12-21 22:15:03 +00:00
|
|
|
|
2008-10-08 19:08:32 +00:00
|
|
|
if (ast_tvzero(h->scts)) {
|
|
|
|
h->scts = ast_tvnow();
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
snprintf(fn, sizeof(fn), "%s/sms/%s", ast_config_AST_SPOOL_DIR, h->smsc ? h->rx ? "morx" : "mttx" : h->rx ? "mtrx" : "motx");
|
2008-10-14 18:58:19 +00:00
|
|
|
ast_mkdir(fn, 0777); /* ensure it exists */
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_copy_string(fn2, fn, sizeof(fn2));
|
2014-05-09 22:49:26 +00:00
|
|
|
snprintf(fn2 + strlen(fn2), sizeof(fn2) - strlen(fn2), "/%s.%s-%u", h->queue, isodate(h->scts.tv_sec, buf, sizeof(buf)), seq++);
|
2007-06-22 19:53:57 +00:00
|
|
|
snprintf(fn + strlen(fn), sizeof(fn) - strlen(fn), "/.%s", fn2 + strlen(fn) + 1);
|
2008-10-14 18:58:19 +00:00
|
|
|
if ((o = fopen(fn, "w")) == NULL) {
|
2006-12-21 23:33:44 +00:00
|
|
|
return;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
if (*h->oa) {
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "oa=%s\n", h->oa);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (*h->da) {
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "da=%s\n", h->da);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
if (h->udhi) {
|
|
|
|
unsigned int p;
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "udh#");
|
2008-10-14 18:58:19 +00:00
|
|
|
for (p = 0; p < h->udhl; p++) {
|
2014-12-17 10:23:32 +00:00
|
|
|
fprintf(o, "%02hhX", (unsigned char)h->udh[p]);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "\n");
|
2006-12-21 23:33:44 +00:00
|
|
|
}
|
|
|
|
if (h->udl) {
|
|
|
|
unsigned int p;
|
|
|
|
for (p = 0; p < h->udl && h->ud[p] >= ' '; p++);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (p < h->udl) {
|
|
|
|
fputc(';', o); /* cannot use ud=, but include as a comment for human readable */
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "ud=");
|
2006-12-21 23:33:44 +00:00
|
|
|
for (p = 0; p < h->udl; p++) {
|
|
|
|
unsigned short v = h->ud[p];
|
2008-10-14 18:58:19 +00:00
|
|
|
if (v < 32) {
|
2007-06-22 19:53:57 +00:00
|
|
|
fputc(191, o);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (v < 0x80) {
|
2007-06-22 19:53:57 +00:00
|
|
|
fputc(v, o);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (v < 0x800) {
|
2007-06-22 19:53:57 +00:00
|
|
|
fputc(0xC0 + (v >> 6), o);
|
|
|
|
fputc(0x80 + (v & 0x3F), o);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2007-06-22 19:53:57 +00:00
|
|
|
fputc(0xE0 + (v >> 12), o);
|
|
|
|
fputc(0x80 + ((v >> 6) & 0x3F), o);
|
|
|
|
fputc(0x80 + (v & 0x3F), o);
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "\n");
|
2006-12-21 23:33:44 +00:00
|
|
|
for (p = 0; p < h->udl && h->ud[p] >= ' '; p++);
|
|
|
|
if (p < h->udl) {
|
|
|
|
for (p = 0; p < h->udl && h->ud[p] < 0x100; p++);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (p == h->udl) { /* can write in ucs-1 hex */
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "ud#");
|
2008-10-14 18:58:19 +00:00
|
|
|
for (p = 0; p < h->udl; p++) {
|
2014-12-17 10:23:32 +00:00
|
|
|
fprintf(o, "%02hhX", (unsigned char)h->ud[p]);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "\n");
|
2008-10-14 18:58:19 +00:00
|
|
|
} else { /* write in UCS-2 */
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "ud##");
|
2008-10-14 18:58:19 +00:00
|
|
|
for (p = 0; p < h->udl; p++) {
|
2014-05-09 22:49:26 +00:00
|
|
|
fprintf(o, "%04X", (unsigned)h->ud[p]);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "\n");
|
2006-12-21 23:33:44 +00:00
|
|
|
}
|
2006-12-21 22:15:03 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2007-09-12 21:25:57 +00:00
|
|
|
if (h->scts.tv_sec) {
|
2008-08-10 14:45:25 +00:00
|
|
|
char datebuf[30];
|
|
|
|
fprintf(o, "scts=%s\n", isodate(h->scts.tv_sec, datebuf, sizeof(datebuf)));
|
2006-12-21 23:33:44 +00:00
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->pid) {
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "pid=%d\n", h->pid);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (h->dcs != 0xF1) {
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "dcs=%d\n", h->dcs);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (h->vp) {
|
2014-05-09 22:49:26 +00:00
|
|
|
fprintf(o, "vp=%u\n", h->vp);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (h->srr) {
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "srr=1\n");
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (h->mr >= 0) {
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "mr=%d\n", h->mr);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (h->rp) {
|
2007-06-22 19:53:57 +00:00
|
|
|
fprintf(o, "rp=1\n");
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
fclose(o);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (rename(fn, fn2)) {
|
2007-06-22 19:53:57 +00:00
|
|
|
unlink(fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2009-05-02 19:02:22 +00:00
|
|
|
ast_log(LOG_NOTICE, "Received to %s\n", fn2);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief read dir skipping dot files... */
|
2007-06-22 19:53:57 +00:00
|
|
|
static struct dirent *readdirqueue(DIR *d, char *queue)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2006-12-21 23:33:44 +00:00
|
|
|
struct dirent *f;
|
|
|
|
do {
|
2007-06-22 19:53:57 +00:00
|
|
|
f = readdir(d);
|
|
|
|
} while (f && (*f->d_name == '.' || strncmp(f->d_name, queue, strlen(queue)) || f->d_name[strlen(queue)] != '.'));
|
2006-12-21 23:33:44 +00:00
|
|
|
return f;
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief handle the incoming message */
|
2005-04-29 16:13:04 +00:00
|
|
|
static unsigned char sms_handleincoming (sms_t * h)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned char p = 3;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->smsc) { /* SMSC */
|
|
|
|
if ((h->imsg[2] & 3) == 1) { /* SMS-SUBMIT */
|
2005-04-29 16:13:04 +00:00
|
|
|
h->udhl = h->udl = 0;
|
|
|
|
h->vp = 0;
|
|
|
|
h->srr = ((h->imsg[2] & 0x20) ? 1 : 0);
|
|
|
|
h->udhi = ((h->imsg[2] & 0x40) ? 1 : 0);
|
|
|
|
h->rp = ((h->imsg[2] & 0x80) ? 1 : 0);
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_copy_string(h->oa, h->cli, sizeof(h->oa));
|
2007-09-12 21:25:57 +00:00
|
|
|
h->scts = ast_tvnow();
|
2005-04-29 16:13:04 +00:00
|
|
|
h->mr = h->imsg[p++];
|
2007-06-22 19:53:57 +00:00
|
|
|
p += unpackaddress(h->da, h->imsg + p);
|
2005-04-29 16:13:04 +00:00
|
|
|
h->pid = h->imsg[p++];
|
|
|
|
h->dcs = h->imsg[p++];
|
2008-10-14 18:58:19 +00:00
|
|
|
if ((h->imsg[2] & 0x18) == 0x10) { /* relative VP */
|
|
|
|
if (h->imsg[p] < 144) {
|
2005-04-29 16:13:04 +00:00
|
|
|
h->vp = (h->imsg[p] + 1) * 5;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (h->imsg[p] < 168) {
|
2005-04-29 16:13:04 +00:00
|
|
|
h->vp = 720 + (h->imsg[p] - 143) * 30;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (h->imsg[p] < 197) {
|
2005-04-29 16:13:04 +00:00
|
|
|
h->vp = (h->imsg[p] - 166) * 1440;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
h->vp = (h->imsg[p] - 192) * 10080;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
p++;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (h->imsg[2] & 0x18) {
|
|
|
|
p += 7; /* ignore enhanced / absolute VP */
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
p += unpacksms(h->dcs, h->imsg + p, h->udh, &h->udhl, h->ud, &h->udl, h->udhi);
|
2008-10-14 18:58:19 +00:00
|
|
|
h->rx = 1; /* received message */
|
|
|
|
sms_writefile(h); /* write the file */
|
2005-04-29 16:13:04 +00:00
|
|
|
if (p != h->imsg[1] + 2) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Mismatch receive unpacking %d/%d\n", p, h->imsg[1] + 2);
|
2005-04-29 16:13:04 +00:00
|
|
|
return 0xFF; /* duh! */
|
|
|
|
}
|
|
|
|
} else {
|
2014-12-17 10:23:32 +00:00
|
|
|
ast_log(LOG_WARNING, "Unknown message type %02hhX\n", h->imsg[2]);
|
2005-04-29 16:13:04 +00:00
|
|
|
return 0xFF;
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
} else { /* client */
|
|
|
|
if (!(h->imsg[2] & 3)) { /* SMS-DELIVER */
|
2005-04-29 16:13:04 +00:00
|
|
|
*h->da = h->srr = h->rp = h->vp = h->udhi = h->udhl = h->udl = 0;
|
|
|
|
h->srr = ((h->imsg[2] & 0x20) ? 1 : 0);
|
|
|
|
h->udhi = ((h->imsg[2] & 0x40) ? 1 : 0);
|
|
|
|
h->rp = ((h->imsg[2] & 0x80) ? 1 : 0);
|
|
|
|
h->mr = -1;
|
2007-06-22 19:53:57 +00:00
|
|
|
p += unpackaddress(h->oa, h->imsg + p);
|
2005-04-29 16:13:04 +00:00
|
|
|
h->pid = h->imsg[p++];
|
|
|
|
h->dcs = h->imsg[p++];
|
2008-03-11 15:13:38 +00:00
|
|
|
h->scts = unpackdate(h->imsg + p);
|
2005-04-29 16:13:04 +00:00
|
|
|
p += 7;
|
2007-06-22 19:53:57 +00:00
|
|
|
p += unpacksms(h->dcs, h->imsg + p, h->udh, &h->udhl, h->ud, &h->udl, h->udhi);
|
2008-10-14 18:58:19 +00:00
|
|
|
h->rx = 1; /* received message */
|
|
|
|
sms_writefile(h); /* write the file */
|
2005-04-29 16:13:04 +00:00
|
|
|
if (p != h->imsg[1] + 2) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Mismatch receive unpacking %d/%d\n", p, h->imsg[1] + 2);
|
2008-10-14 18:58:19 +00:00
|
|
|
return 0xFF; /* duh! */
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
} else {
|
2014-12-17 10:23:32 +00:00
|
|
|
ast_log(LOG_WARNING, "Unknown message type %02hhX\n", h->imsg[2]);
|
2005-04-29 16:13:04 +00:00
|
|
|
return 0xFF;
|
|
|
|
}
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
return 0; /* no error */
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2004-12-14 23:36:30 +00:00
|
|
|
#ifdef SOLARIS
|
|
|
|
#define NAME_MAX 1024
|
|
|
|
#endif
|
|
|
|
|
2006-12-21 16:50:26 +00:00
|
|
|
/*!
|
|
|
|
* Add data to a protocol 2 message.
|
|
|
|
* Use the length field (h->omsg[1]) as a pointer to the next free position.
|
|
|
|
*/
|
2007-06-22 19:53:57 +00:00
|
|
|
static void adddata_proto2(sms_t *h, unsigned char msg, char *data, int size)
|
2006-12-21 16:50:26 +00:00
|
|
|
{
|
2008-10-14 18:58:19 +00:00
|
|
|
int x = h->omsg[1] + 2; /* Get current position */
|
|
|
|
if (x == 2) {
|
|
|
|
x += 2; /* First: skip Payload length (set later) */
|
|
|
|
}
|
|
|
|
h->omsg[x++] = msg; /* Message code */
|
|
|
|
h->omsg[x++] = (unsigned char)size; /* Data size Low */
|
|
|
|
h->omsg[x++] = 0; /* Data size Hi */
|
|
|
|
for (; size > 0 ; size--) {
|
2006-12-21 16:50:26 +00:00
|
|
|
h->omsg[x++] = *data++;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
h->omsg[1] = x - 2; /* Frame size */
|
|
|
|
h->omsg[2] = x - 4; /* Payload length (Lo) */
|
|
|
|
h->omsg[3] = 0; /* Payload length (Hi) */
|
2006-12-21 16:50:26 +00:00
|
|
|
}
|
|
|
|
|
2007-06-22 19:53:57 +00:00
|
|
|
static void putdummydata_proto2(sms_t *h)
|
2006-12-21 16:50:26 +00:00
|
|
|
{
|
2008-10-14 18:58:19 +00:00
|
|
|
adddata_proto2(h, 0x10, "\0", 1); /* Media Identifier > SMS */
|
|
|
|
adddata_proto2(h, 0x11, "\0\0\0\0\0\0", 6); /* Firmware version */
|
|
|
|
adddata_proto2(h, 0x12, "\2\0\4", 3); /* SMS provider ID */
|
|
|
|
adddata_proto2(h, 0x13, h->udtxt, h->udl); /* Body */
|
2006-12-21 16:50:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void sms_compose2(sms_t *h, int more)
|
|
|
|
{
|
2007-07-18 19:47:20 +00:00
|
|
|
struct ast_tm tm;
|
2008-08-10 14:45:25 +00:00
|
|
|
struct timeval now = h->scts;
|
2006-12-21 16:50:26 +00:00
|
|
|
char stm[9];
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[0] = 0x00; /* set later... */
|
2006-12-21 16:50:26 +00:00
|
|
|
h->omsg[1] = 0;
|
2007-06-22 19:53:57 +00:00
|
|
|
putdummydata_proto2(h);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->smsc) { /* deliver */
|
|
|
|
h->omsg[0] = 0x11; /* SMS_DELIVERY */
|
2007-06-22 19:53:57 +00:00
|
|
|
/* Required: 10 11 12 13 14 15 17 (seems they must be ordered!) */
|
2008-08-10 14:45:25 +00:00
|
|
|
ast_localtime(&now, &tm, NULL);
|
2008-10-14 18:58:19 +00:00
|
|
|
sprintf(stm, "%02d%02d%02d%02d", tm.tm_mon + 1, tm.tm_mday, tm.tm_hour, tm.tm_min); /* Date mmddHHMM */
|
|
|
|
adddata_proto2(h, 0x14, stm, 8); /* Date */
|
|
|
|
if (*h->oa == 0) {
|
2007-06-22 19:53:57 +00:00
|
|
|
strcpy(h->oa, "00000000");
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
adddata_proto2(h, 0x15, h->oa, strlen(h->oa)); /* Originator */
|
2008-10-14 18:58:19 +00:00
|
|
|
adddata_proto2(h, 0x17, "\1", 1); /* Calling Terminal ID */
|
|
|
|
} else { /* submit */
|
|
|
|
h->omsg[0] = 0x10; /* SMS_SUBMIT */
|
2007-06-22 19:53:57 +00:00
|
|
|
/* Required: 10 11 12 13 17 18 1B 1C (seems they must be ordered!) */
|
2008-10-14 18:58:19 +00:00
|
|
|
adddata_proto2(h, 0x17, "\1", 1); /* Calling Terminal ID */
|
|
|
|
if (*h->da == 0) {
|
2007-06-22 19:53:57 +00:00
|
|
|
strcpy(h->da, "00000000");
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
adddata_proto2(h, 0x18, h->da, strlen(h->da)); /* Originator */
|
|
|
|
adddata_proto2(h, 0x1B, "\1", 1); /* Called Terminal ID */
|
|
|
|
adddata_proto2(h, 0x1C, "\0\0\0", 3); /* Notification */
|
2006-12-21 16:50:26 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-06-22 19:53:57 +00:00
|
|
|
static void putdummydata_proto2(sms_t *h);
|
2006-12-21 16:50:26 +00:00
|
|
|
|
2006-12-21 23:33:44 +00:00
|
|
|
#define MAX_DEBUG_LEN 300
|
|
|
|
static char *sms_hexdump(unsigned char buf[], int size, char *s /* destination */)
|
2006-12-21 16:50:26 +00:00
|
|
|
{
|
|
|
|
char *p;
|
|
|
|
int f;
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
for (p = s, f = 0; f < size && f < MAX_DEBUG_LEN; f++, p += 3) {
|
2014-12-17 10:23:32 +00:00
|
|
|
sprintf(p, "%02hhX ", (unsigned char)buf[f]);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 16:50:26 +00:00
|
|
|
return(s);
|
|
|
|
}
|
2006-12-21 23:33:44 +00:00
|
|
|
|
2006-12-21 16:50:26 +00:00
|
|
|
|
|
|
|
/*! \brief sms_handleincoming_proto2: handle the incoming message */
|
2007-06-22 19:53:57 +00:00
|
|
|
static int sms_handleincoming_proto2(sms_t *h)
|
2006-12-21 16:50:26 +00:00
|
|
|
{
|
2007-06-22 19:53:57 +00:00
|
|
|
int f, i, sz = 0;
|
2006-12-21 16:50:26 +00:00
|
|
|
int msg, msgsz;
|
2007-07-18 19:47:20 +00:00
|
|
|
struct ast_tm tm;
|
2008-08-10 14:45:25 +00:00
|
|
|
struct timeval now = { 0, 0 };
|
2006-12-21 23:33:44 +00:00
|
|
|
char debug_buf[MAX_DEBUG_LEN * 3 + 1];
|
2006-12-21 16:50:26 +00:00
|
|
|
|
2007-06-22 19:53:57 +00:00
|
|
|
sz = h->imsg[1] + 2;
|
2007-07-26 15:49:18 +00:00
|
|
|
/* ast_verb(3, "SMS-P2 Frame: %s\n", sms_hexdump(h->imsg, sz, debug_buf)); */
|
2006-12-21 16:50:26 +00:00
|
|
|
|
|
|
|
/* Parse message body (called payload) */
|
2008-08-10 14:45:25 +00:00
|
|
|
now = h->scts = ast_tvnow();
|
2007-06-22 19:53:57 +00:00
|
|
|
for (f = 4; f < sz; ) {
|
|
|
|
msg = h->imsg[f++];
|
|
|
|
msgsz = h->imsg[f++];
|
|
|
|
msgsz += (h->imsg[f++] * 256);
|
|
|
|
switch (msg) {
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x13: /* Body */
|
2014-05-09 22:49:26 +00:00
|
|
|
ast_verb(3, "SMS-P2 Body#%02X=[%.*s]\n", (unsigned)msg, msgsz, &h->imsg[f]);
|
Fix a variety of potential buffer overflows
* chan_mobile: Fixed an overrun where the cind_state buffer (an integer array
of size 16) would be overrun due to improper bounds checking. At worst, the
buffer can be overrun by a total of 48 bytes (assuming 4-byte integers),
which would still leave it within the allocated memory of struct hfp. This
would corrupt other elements in that struct but not necessarily cause any
further issues.
* app_sms: The array imsg is of size 250, while the array (ud) that the data
is copied into is of size 160. If the size of the inbound message is
greater then 160, up to 90 bytes could be overrun in ud. This would corrupt
the user data header (array udh) adjacent to ud.
* chan_unistim: A number of invalid memmoves are corrected. These would move
data (which may or may not be valid) into the ends of these buffers.
* asterisk: ast_console_toggle_loglevel does not check that the console log
level being set is less then or equal to the allowed log levels of 32.
* format_pref: In ast_codec_pref_prepend, if any occurrence of the specified
codec is not found, the value used to index into the array pref->order
would be one greater then the maximum size of the array.
* jitterbuf: If the element being placed into the jitter buffer lands in the
last available slot in the jitter history buffer, the insertion sort attempts
to move the last entry in the buffer into one slot past the maximum length
of the buffer. Note that this occurred for both the min and max jitter
history buffers.
* tdd: If a read from fsk_serial returns a character that is greater then 32,
an attempt to read past one of the statically defined arrays containing the
values that character maps to would occur.
* localtime: struct ast_time and tm are not the same size - ast_time is larger,
although it contains the elements of tm within it in the same layout. Hence,
when using memcpy to copy the contents of tm into ast_time, the size of tm
should be used, as opposed to the size of ast_time.
* extconf: this treats ast_timing's minmask array as if it had a length of 48,
when it has defined the size of the array as 24. pbx.h defines minmask as
having a size of 48.
(issue ASTERISK-19668)
Reported by: Matt Jordan
........
Merged revisions 362485 from http://svn.asterisk.org/svn/asterisk/branches/1.8
........
Merged revisions 362496 from http://svn.asterisk.org/svn/asterisk/branches/10
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@362497 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2012-04-19 02:40:55 +00:00
|
|
|
if (msgsz >= sizeof(h->ud)) {
|
|
|
|
msgsz = sizeof(h->ud) - 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
for (i = 0; i < msgsz; i++) {
|
2007-06-22 19:53:57 +00:00
|
|
|
h->ud[i] = h->imsg[f + i];
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 16:50:26 +00:00
|
|
|
h->udl = msgsz;
|
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x14: /* Date SCTS */
|
2008-08-10 14:45:25 +00:00
|
|
|
now = h->scts = ast_tvnow();
|
|
|
|
ast_localtime(&now, &tm, NULL);
|
2007-06-22 19:53:57 +00:00
|
|
|
tm.tm_mon = ( (h->imsg[f] * 10) + h->imsg[f + 1] ) - 1;
|
|
|
|
tm.tm_mday = ( (h->imsg[f + 2] * 10) + h->imsg[f + 3] );
|
|
|
|
tm.tm_hour = ( (h->imsg[f + 4] * 10) + h->imsg[f + 5] );
|
|
|
|
tm.tm_min = ( (h->imsg[f + 6] * 10) + h->imsg[f + 7] );
|
|
|
|
tm.tm_sec = 0;
|
2007-07-18 19:47:20 +00:00
|
|
|
h->scts = ast_mktime(&tm, NULL);
|
2014-05-09 22:49:26 +00:00
|
|
|
ast_verb(3, "SMS-P2 Date#%02X=%02d/%02d %02d:%02d\n", (unsigned)msg, tm.tm_mday, tm.tm_mon + 1, tm.tm_hour, tm.tm_min);
|
2006-12-21 16:50:26 +00:00
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x15: /* Calling line (from SMSC) */
|
|
|
|
if (msgsz >= 20) {
|
2007-06-22 19:53:57 +00:00
|
|
|
msgsz = 20 - 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2014-05-09 22:49:26 +00:00
|
|
|
ast_verb(3, "SMS-P2 Origin#%02X=[%.*s]\n", (unsigned)msg, msgsz, &h->imsg[f]);
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_copy_string(h->oa, (char *)(&h->imsg[f]), msgsz + 1);
|
2006-12-21 16:50:26 +00:00
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x18: /* Destination(from TE/phone) */
|
|
|
|
if (msgsz >= 20) {
|
2007-06-22 19:53:57 +00:00
|
|
|
msgsz = 20 - 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2014-05-09 22:49:26 +00:00
|
|
|
ast_verb(3, "SMS-P2 Destination#%02X=[%.*s]\n", (unsigned)msg, msgsz, &h->imsg[f]);
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_copy_string(h->da, (char *)(&h->imsg[f]), msgsz + 1);
|
2006-12-21 16:50:26 +00:00
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x1C: /* Notify */
|
2014-05-09 22:49:26 +00:00
|
|
|
ast_verb(3, "SMS-P2 Notify#%02X=%s\n", (unsigned)msg, sms_hexdump(&h->imsg[f], 3, debug_buf));
|
2006-12-21 16:50:26 +00:00
|
|
|
break;
|
|
|
|
default:
|
2014-05-09 22:49:26 +00:00
|
|
|
ast_verb(3, "SMS-P2 Par#%02X [%d]: %s\n", (unsigned)msg, msgsz, sms_hexdump(&h->imsg[f], msgsz, debug_buf));
|
2006-12-21 16:50:26 +00:00
|
|
|
break;
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
f+=msgsz; /* Skip to next */
|
2006-12-21 16:50:26 +00:00
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
h->rx = 1; /* received message */
|
|
|
|
sms_writefile(h); /* write the file */
|
|
|
|
return 0; /* no error */
|
2006-12-21 16:50:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
static void smssend(sms_t *h, char *c)
|
|
|
|
{
|
|
|
|
int f, x;
|
2007-06-22 19:53:57 +00:00
|
|
|
for (f = 0; f < strlen(c); f++) {
|
|
|
|
sscanf(&c[f*3], "%x", &x);
|
2006-12-21 16:50:26 +00:00
|
|
|
h->omsg[f] = x;
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_messagetx(h);
|
2006-12-21 16:50:26 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static void sms_nextoutgoing (sms_t *h);
|
|
|
|
|
|
|
|
static void sms_messagerx2(sms_t * h)
|
|
|
|
{
|
|
|
|
int p = h->imsg[0] & DLL_SMS_MASK ; /* mask the high bit */
|
|
|
|
int cause;
|
|
|
|
|
|
|
|
#define DLL2_ACK(h) ((h->framenumber & 1) ? DLL2_SMS_ACK1: DLL2_SMS_ACK1)
|
|
|
|
switch (p) {
|
2008-10-14 18:58:19 +00:00
|
|
|
case DLL2_SMS_EST: /* Protocol 2: Connection ready (fake): send message */
|
2006-12-21 16:50:26 +00:00
|
|
|
sms_nextoutgoing (h);
|
2007-06-22 19:53:57 +00:00
|
|
|
/* smssend(h,"11 29 27 00 10 01 00 00 11 06 00 00 00 00 00 00 00 12 03 00 02 00 04 13 01 00 41 14 08 00 30 39 31 35 30 02 30 02 15 02 00 39 30 "); */
|
2006-12-21 16:50:26 +00:00
|
|
|
break;
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
case DLL2_SMS_INFO_MO: /* transport SMS_SUBMIT */
|
|
|
|
case DLL2_SMS_INFO_MT: /* transport SMS_DELIVERY */
|
2006-12-21 16:50:26 +00:00
|
|
|
cause = sms_handleincoming_proto2(h);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (!cause) { /* ACK */
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_log(h, 'Y');
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 16:50:26 +00:00
|
|
|
h->omsg[0] = DLL2_ACK(h);
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[1] = 0x06; /* msg len */
|
|
|
|
h->omsg[2] = 0x04; /* payload len */
|
|
|
|
h->omsg[3] = 0x00; /* payload len */
|
|
|
|
h->omsg[4] = 0x1f; /* Response type */
|
|
|
|
h->omsg[5] = 0x01; /* parameter len */
|
|
|
|
h->omsg[6] = 0x00; /* parameter len */
|
|
|
|
h->omsg[7] = cause; /* CONFIRM or error */
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_messagetx(h);
|
2006-12-21 16:50:26 +00:00
|
|
|
break;
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
case DLL2_SMS_NACK: /* Protocol 2: SMS_NAK */
|
|
|
|
h->omsg[0] = DLL2_SMS_REL; /* SMS_REL */
|
|
|
|
h->omsg[1] = 0x00; /* msg len */
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_messagetx(h);
|
2006-12-21 16:50:26 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
case DLL2_SMS_ACK0:
|
|
|
|
case DLL2_SMS_ACK1:
|
|
|
|
/* SMS_ACK also transport SMS_SUBMIT or SMS_DELIVERY */
|
2007-06-22 19:53:57 +00:00
|
|
|
if ( (h->omsg[0] & DLL_SMS_MASK) == DLL2_SMS_REL) {
|
2006-12-21 16:50:26 +00:00
|
|
|
/* a response to our Release, just hangup */
|
2008-10-14 18:58:19 +00:00
|
|
|
h->hangup = 1; /* hangup */
|
2006-12-21 16:50:26 +00:00
|
|
|
} else {
|
|
|
|
/* XXX depending on what we are.. */
|
2012-04-06 18:19:03 +00:00
|
|
|
ast_log(LOG_NOTICE, "SMS_SUBMIT or SMS_DELIVERY\n");
|
2006-12-21 16:50:26 +00:00
|
|
|
sms_nextoutgoing (h);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
case DLL2_SMS_REL: /* Protocol 2: SMS_REL (hangup req) */
|
2006-12-21 16:50:26 +00:00
|
|
|
h->omsg[0] = DLL2_ACK(h);
|
|
|
|
h->omsg[1] = 0;
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_messagetx(h);
|
2006-12-21 16:50:26 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-12-20 00:13:23 +00:00
|
|
|
/*! \brief compose a message for protocol 1 */
|
|
|
|
static void sms_compose1(sms_t *h, int more)
|
|
|
|
{
|
2008-10-14 18:58:19 +00:00
|
|
|
unsigned int p = 2; /* next byte to write. Skip type and len */
|
2006-12-20 00:13:23 +00:00
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[0] = 0x91; /* SMS_DATA */
|
|
|
|
if (h->smsc) { /* deliver */
|
2006-12-20 00:13:23 +00:00
|
|
|
h->omsg[p++] = (more ? 4 : 0) + ((h->udhl > 0) ? 0x40 : 0);
|
2007-06-22 19:53:57 +00:00
|
|
|
p += packaddress(h->omsg + p, h->oa);
|
2006-12-20 00:13:23 +00:00
|
|
|
h->omsg[p++] = h->pid;
|
|
|
|
h->omsg[p++] = h->dcs;
|
2007-09-12 21:25:57 +00:00
|
|
|
packdate(h->omsg + p, h->scts.tv_sec);
|
2006-12-20 00:13:23 +00:00
|
|
|
p += 7;
|
2007-06-22 19:53:57 +00:00
|
|
|
p += packsms(h->dcs, h->omsg + p, h->udhl, h->udh, h->udl, h->ud);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else { /* submit */
|
2006-12-20 00:13:23 +00:00
|
|
|
h->omsg[p++] =
|
|
|
|
0x01 + (more ? 4 : 0) + (h->srr ? 0x20 : 0) + (h->rp ? 0x80 : 0) + (h->vp ? 0x10 : 0) + (h->udhi ? 0x40 : 0);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->mr < 0) {
|
2006-12-20 00:13:23 +00:00
|
|
|
h->mr = message_ref++;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-20 00:13:23 +00:00
|
|
|
h->omsg[p++] = h->mr;
|
2007-06-22 19:53:57 +00:00
|
|
|
p += packaddress(h->omsg + p, h->da);
|
2006-12-20 00:13:23 +00:00
|
|
|
h->omsg[p++] = h->pid;
|
|
|
|
h->omsg[p++] = h->dcs;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->vp) { /* relative VP */
|
|
|
|
if (h->vp < 720) {
|
2006-12-20 00:13:23 +00:00
|
|
|
h->omsg[p++] = (h->vp + 4) / 5 - 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (h->vp < 1440) {
|
2006-12-20 00:13:23 +00:00
|
|
|
h->omsg[p++] = (h->vp - 720 + 29) / 30 + 143;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (h->vp < 43200) {
|
2006-12-20 00:13:23 +00:00
|
|
|
h->omsg[p++] = (h->vp + 1439) / 1440 + 166;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (h->vp < 635040) {
|
2006-12-20 00:13:23 +00:00
|
|
|
h->omsg[p++] = (h->vp + 10079) / 10080 + 192;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
|
|
|
h->omsg[p++] = 255; /* max */
|
|
|
|
}
|
2006-12-20 00:13:23 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
p += packsms(h->dcs, h->omsg + p, h->udhl, h->udh, h->udl, h->ud);
|
2006-12-20 00:13:23 +00:00
|
|
|
}
|
|
|
|
h->omsg[1] = p - 2;
|
|
|
|
}
|
|
|
|
|
2006-01-20 00:18:42 +00:00
|
|
|
/*! \brief find and fill in next message, or send a REL if none waiting */
|
2005-04-29 16:13:04 +00:00
|
|
|
static void sms_nextoutgoing (sms_t * h)
|
2007-06-22 19:53:57 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
char fn[100 + NAME_MAX] = "";
|
|
|
|
DIR *d;
|
|
|
|
char more = 0;
|
2006-12-19 23:56:08 +00:00
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
*h->da = *h->oa = '\0'; /* clear destinations */
|
|
|
|
h->rx = 0; /* outgoing message */
|
2007-06-22 19:53:57 +00:00
|
|
|
snprintf(fn, sizeof(fn), "%s/sms/%s", ast_config_AST_SPOOL_DIR, h->smsc ? "mttx" : "motx");
|
2008-10-14 18:58:19 +00:00
|
|
|
ast_mkdir(fn, 0777); /* ensure it exists */
|
2007-06-22 19:53:57 +00:00
|
|
|
d = opendir(fn);
|
2005-04-29 16:13:04 +00:00
|
|
|
if (d) {
|
2007-06-22 19:53:57 +00:00
|
|
|
struct dirent *f = readdirqueue(d, h->queue);
|
2005-04-29 16:13:04 +00:00
|
|
|
if (f) {
|
2007-06-22 19:53:57 +00:00
|
|
|
snprintf(fn + strlen(fn), sizeof(fn) - strlen(fn), "/%s", f->d_name);
|
|
|
|
sms_readfile(h, fn);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (readdirqueue(d, h->queue)) {
|
|
|
|
more = 1; /* more to send */
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
closedir(d);
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
if (*h->da || *h->oa) { /* message to send */
|
|
|
|
if (h->protocol == 2) {
|
2006-12-21 16:50:26 +00:00
|
|
|
sms_compose2(h, more);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_compose1(h, more);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
} else { /* no message */
|
2007-06-22 19:53:57 +00:00
|
|
|
if (h->protocol == 2) {
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[0] = 0x17; /* SMS_REL */
|
2006-12-21 16:50:26 +00:00
|
|
|
h->omsg[1] = 0;
|
|
|
|
} else {
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[0] = 0x94; /* SMS_REL */
|
2006-12-21 16:50:26 +00:00
|
|
|
h->omsg[1] = 0;
|
2014-04-19 01:31:27 +00:00
|
|
|
h->sent_rel = 1;
|
2006-12-21 16:50:26 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_messagetx(h);
|
2004-12-11 22:36:27 +00:00
|
|
|
}
|
|
|
|
|
2006-12-21 16:50:26 +00:00
|
|
|
#define DIR_RX 1
|
|
|
|
#define DIR_TX 2
|
|
|
|
static void sms_debug (int dir, sms_t *h)
|
2004-12-11 22:36:27 +00:00
|
|
|
{
|
2006-12-21 16:50:26 +00:00
|
|
|
char txt[259 * 3 + 1];
|
2008-10-14 18:58:19 +00:00
|
|
|
char *p = txt; /* always long enough */
|
2006-12-21 16:50:26 +00:00
|
|
|
unsigned char *msg = (dir == DIR_RX) ? h->imsg : h->omsg;
|
|
|
|
int n = (dir == DIR_RX) ? h->ibytep : msg[1] + 2;
|
|
|
|
int q = 0;
|
2005-04-29 16:13:04 +00:00
|
|
|
while (q < n && q < 30) {
|
2014-12-17 10:23:32 +00:00
|
|
|
sprintf(p, " %02hhX", msg[q++]);
|
2005-04-29 16:13:04 +00:00
|
|
|
p += 3;
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
if (q < n) {
|
2007-06-22 19:53:57 +00:00
|
|
|
sprintf(p, "...");
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2007-07-26 15:49:18 +00:00
|
|
|
ast_verb(3, "SMS %s%s\n", dir == DIR_RX ? "RX" : "TX", txt);
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-12-21 16:50:26 +00:00
|
|
|
|
2005-04-29 16:13:04 +00:00
|
|
|
static void sms_messagerx(sms_t * h)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2006-12-21 16:50:26 +00:00
|
|
|
int cause;
|
|
|
|
|
|
|
|
sms_debug (DIR_RX, h);
|
|
|
|
if (h->protocol == 2) {
|
|
|
|
sms_messagerx2(h);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/* parse incoming message for Protocol 1 */
|
|
|
|
switch (h->imsg[0]) {
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x91: /* SMS_DATA */
|
2007-06-22 19:53:57 +00:00
|
|
|
cause = sms_handleincoming (h);
|
|
|
|
if (!cause) {
|
|
|
|
sms_log(h, 'Y');
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[0] = 0x95; /* SMS_ACK */
|
2007-06-22 19:53:57 +00:00
|
|
|
h->omsg[1] = 0x02;
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[2] = 0x00; /* deliver report */
|
|
|
|
h->omsg[3] = 0x00; /* no parameters */
|
|
|
|
} else { /* NACK */
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_log(h, 'N');
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[0] = 0x96; /* SMS_NACK */
|
2007-06-22 19:53:57 +00:00
|
|
|
h->omsg[1] = 3;
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[2] = 0; /* delivery report */
|
|
|
|
h->omsg[3] = cause; /* cause */
|
|
|
|
h->omsg[4] = 0; /* no parameters */
|
2007-06-22 19:53:57 +00:00
|
|
|
}
|
|
|
|
sms_messagetx(h);
|
|
|
|
break;
|
2006-12-21 16:50:26 +00:00
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x92: /* SMS_ERROR */
|
2005-04-29 16:13:04 +00:00
|
|
|
h->err = 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
sms_messagetx(h); /* send whatever we sent again */
|
2005-04-29 16:13:04 +00:00
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x93: /* SMS_EST */
|
2005-04-29 16:13:04 +00:00
|
|
|
sms_nextoutgoing (h);
|
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x94: /* SMS_REL */
|
|
|
|
h->hangup = 1; /* hangup */
|
2005-04-29 16:13:04 +00:00
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x95: /* SMS_ACK */
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_log(h, 'Y');
|
2005-04-29 16:13:04 +00:00
|
|
|
sms_nextoutgoing (h);
|
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
case 0x96: /* SMS_NACK */
|
2005-04-29 16:13:04 +00:00
|
|
|
h->err = 1;
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_log(h, 'N');
|
2005-04-29 16:13:04 +00:00
|
|
|
sms_nextoutgoing (h);
|
|
|
|
break;
|
2008-10-14 18:58:19 +00:00
|
|
|
default: /* Unknown */
|
|
|
|
h->omsg[0] = 0x92; /* SMS_ERROR */
|
2005-04-29 16:13:04 +00:00
|
|
|
h->omsg[1] = 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[2] = 3; /* unknown message type */
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_messagetx(h);
|
2005-04-29 16:13:04 +00:00
|
|
|
break;
|
|
|
|
}
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2005-04-29 16:13:04 +00:00
|
|
|
static void sms_messagetx(sms_t * h)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned char c = 0, p;
|
2008-10-14 18:58:19 +00:00
|
|
|
int len = h->omsg[1] + 2; /* total message length excluding checksum */
|
2006-12-19 21:29:55 +00:00
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
for (p = 0; p < len; p++) { /* compute checksum */
|
2005-04-29 16:13:04 +00:00
|
|
|
c += h->omsg[p];
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
h->omsg[len] = 0 - c; /* actually, (256 - (c & 0fxx)) & 0xff) */
|
2006-12-21 16:50:26 +00:00
|
|
|
sms_debug(DIR_TX, h);
|
2008-10-14 18:58:19 +00:00
|
|
|
h->framenumber++; /* Proto 2 */
|
2005-04-29 16:13:04 +00:00
|
|
|
h->obytep = 0;
|
|
|
|
h->obitp = 0;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->protocol == 2) { /* Proto 2: */
|
|
|
|
h->oseizure = 300; /* 300bits (or more ?) */
|
|
|
|
h->obyte = 0; /* Seizure starts with space (0) */
|
|
|
|
if (h->omsg[0] == 0x7F) {
|
|
|
|
h->opause = 8 * h->opause_0; /* initial message delay */
|
|
|
|
} else {
|
|
|
|
h->opause = 400;
|
|
|
|
}
|
|
|
|
} else { /* Proto 1: */
|
|
|
|
h->oseizure = 0; /* No seizure */
|
|
|
|
h->obyte = 1; /* send mark ('1') at the beginning */
|
|
|
|
/* Change the initial message delay. BT requires 300ms,
|
|
|
|
* but for others this might be way too much and the phone
|
|
|
|
* could time out. XXX make it configurable.
|
|
|
|
*/
|
|
|
|
if (h->omsg[0] == 0x93) {
|
|
|
|
h->opause = 8 * h->opause_0; /* initial message delay */
|
|
|
|
} else {
|
|
|
|
h->opause = 200;
|
|
|
|
}
|
2006-12-21 16:50:26 +00:00
|
|
|
}
|
2006-12-19 21:29:55 +00:00
|
|
|
/* Note - setting osync triggers the generator */
|
2008-10-14 18:58:19 +00:00
|
|
|
h->osync = OSYNC_BITS; /* 80 sync bits */
|
|
|
|
h->obyten = len + 1; /* bytes to send (including checksum) */
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-12-21 19:52:18 +00:00
|
|
|
/*!
|
|
|
|
* outgoing data are produced by this generator function, that reads from
|
|
|
|
* the descriptor whether it has data to send and which ones.
|
|
|
|
*/
|
2006-12-21 23:33:44 +00:00
|
|
|
static int sms_generate(struct ast_channel *chan, void *data, int len, int samples)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
struct ast_frame f = { 0 };
|
2006-03-30 06:07:04 +00:00
|
|
|
#define MAXSAMPLES (800)
|
2006-12-19 23:56:08 +00:00
|
|
|
output_t *buf;
|
2005-04-29 16:13:04 +00:00
|
|
|
sms_t *h = data;
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
int i, res;
|
2004-12-11 22:36:27 +00:00
|
|
|
|
2006-03-30 06:07:04 +00:00
|
|
|
if (samples > MAXSAMPLES) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_WARNING, "Only doing %d samples (%d requested)\n",
|
2006-03-30 06:07:04 +00:00
|
|
|
MAXSAMPLES, samples);
|
|
|
|
samples = MAXSAMPLES;
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2006-12-19 23:56:08 +00:00
|
|
|
len = samples * sizeof(*buf) + AST_FRIENDLY_OFFSET;
|
2012-07-31 20:21:43 +00:00
|
|
|
buf = ast_alloca(len);
|
2006-03-30 06:07:04 +00:00
|
|
|
|
2005-04-29 16:13:04 +00:00
|
|
|
f.frametype = AST_FRAME_VOICE;
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
f.subclass.format = __OUT_FMT;
|
2006-12-19 23:56:08 +00:00
|
|
|
f.datalen = samples * sizeof(*buf);
|
2005-04-29 16:13:04 +00:00
|
|
|
f.offset = AST_FRIENDLY_OFFSET;
|
|
|
|
f.mallocd = 0;
|
2008-05-22 16:29:54 +00:00
|
|
|
f.data.ptr = buf;
|
2005-04-29 16:13:04 +00:00
|
|
|
f.samples = samples;
|
|
|
|
f.src = "app_sms";
|
|
|
|
/* create a buffer containing the digital sms pattern */
|
|
|
|
for (i = 0; i < samples; i++) {
|
2008-10-14 18:58:19 +00:00
|
|
|
buf[i] = wave_out[0]; /* default is silence */
|
2006-12-19 23:56:08 +00:00
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->opause) {
|
2005-04-29 16:13:04 +00:00
|
|
|
h->opause--;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (h->obyten || h->osync) { /* sending data */
|
2006-12-19 23:56:08 +00:00
|
|
|
buf[i] = wave_out[h->ophase];
|
2008-10-14 18:58:19 +00:00
|
|
|
h->ophase += (h->obyte & 1) ? 13 : 21; /* compute next phase */
|
2006-12-19 23:56:08 +00:00
|
|
|
if (h->ophase >= 80)
|
2005-04-29 16:13:04 +00:00
|
|
|
h->ophase -= 80;
|
2008-10-14 18:58:19 +00:00
|
|
|
if ((h->ophasep += 12) >= 80) { /* time to send the next bit */
|
2005-04-29 16:13:04 +00:00
|
|
|
h->ophasep -= 80;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->oseizure > 0) { /* sending channel seizure (proto 2) */
|
2006-12-21 16:50:26 +00:00
|
|
|
h->oseizure--;
|
2008-10-14 18:58:19 +00:00
|
|
|
h->obyte ^= 1; /* toggle low bit */
|
2006-12-21 16:50:26 +00:00
|
|
|
} else if (h->osync) {
|
2008-10-14 18:58:19 +00:00
|
|
|
h->obyte = 1; /* send mark as sync bit */
|
|
|
|
h->osync--; /* sending sync bits */
|
2006-12-21 16:50:26 +00:00
|
|
|
if (h->osync == 0 && h->protocol == 2 && h->omsg[0] == DLL2_SMS_EST) {
|
2008-10-14 18:58:19 +00:00
|
|
|
h->obytep = h->obyten = 0; /* we are done */
|
2006-12-21 16:50:26 +00:00
|
|
|
}
|
2006-12-19 23:56:08 +00:00
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
h->obitp++;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->obitp == 1) {
|
|
|
|
h->obyte = 0; /* start bit; */
|
|
|
|
} else if (h->obitp == 2) {
|
2005-04-29 16:13:04 +00:00
|
|
|
h->obyte = h->omsg[h->obytep];
|
2008-10-14 18:58:19 +00:00
|
|
|
} else if (h->obitp == 10) {
|
2005-04-29 16:13:04 +00:00
|
|
|
h->obyte = 1; /* stop bit */
|
|
|
|
h->obitp = 0;
|
|
|
|
h->obytep++;
|
|
|
|
if (h->obytep == h->obyten) {
|
|
|
|
h->obytep = h->obyten = 0; /* sent */
|
|
|
|
h->osync = 10; /* trailing marks */
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2006-12-19 23:56:08 +00:00
|
|
|
h->obyte >>= 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
res = ast_write(chan, &f);
|
|
|
|
ast_frfree(&f);
|
|
|
|
if (res < 0) {
|
2012-01-09 22:15:50 +00:00
|
|
|
ast_log(LOG_WARNING, "Failed to write frame to '%s': %s\n", ast_channel_name(chan), strerror(errno));
|
2005-04-29 16:13:04 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
return 0;
|
2006-03-30 06:07:04 +00:00
|
|
|
#undef MAXSAMPLES
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-12-21 19:52:18 +00:00
|
|
|
/*!
|
|
|
|
* Just return the pointer to the descriptor that we received.
|
|
|
|
*/
|
2007-06-22 19:53:57 +00:00
|
|
|
static void *sms_alloc(struct ast_channel *chan, void *sms_t_ptr)
|
2006-12-21 19:52:18 +00:00
|
|
|
{
|
|
|
|
return sms_t_ptr;
|
|
|
|
}
|
|
|
|
|
2007-06-22 19:53:57 +00:00
|
|
|
static void sms_release(struct ast_channel *chan, void *data)
|
2006-12-21 19:52:18 +00:00
|
|
|
{
|
|
|
|
return; /* nothing to do here. */
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct ast_generator smsgen = {
|
|
|
|
.alloc = sms_alloc,
|
|
|
|
.release = sms_release,
|
|
|
|
.generate = sms_generate,
|
|
|
|
};
|
|
|
|
|
2006-12-19 23:56:08 +00:00
|
|
|
/*!
|
|
|
|
* Process an incoming frame, trying to detect the carrier and
|
|
|
|
* decode the message. The two frequencies are 1300 and 2100 Hz.
|
|
|
|
* The decoder detects the amplitude of the signal over the last
|
|
|
|
* few samples, filtering the absolute values with a lowpass filter.
|
|
|
|
* If the magnitude (h->imag) is large enough, multiply the signal
|
|
|
|
* by the two carriers, and compute the amplitudes m0 and m1.
|
|
|
|
* Record the current sample as '0' or '1' depending on which one is greater.
|
|
|
|
* The last 3 bits are stored in h->ibith, with the count of '1'
|
|
|
|
* bits in h->ibitt.
|
|
|
|
* XXX the rest is to be determined.
|
|
|
|
*/
|
2006-12-21 18:35:22 +00:00
|
|
|
static void sms_process(sms_t * h, int samples, signed short *data)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2006-12-21 18:35:22 +00:00
|
|
|
int bit;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ignore incoming audio while a packet is being transmitted,
|
|
|
|
* the protocol is half-duplex.
|
|
|
|
* Unfortunately this means that if the outbound and incoming
|
|
|
|
* transmission overlap (which is an error condition anyways),
|
|
|
|
* we may miss some data and this makes debugging harder.
|
2006-12-21 16:50:26 +00:00
|
|
|
*/
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->obyten || h->osync) {
|
2006-12-21 18:35:22 +00:00
|
|
|
return;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 18:35:22 +00:00
|
|
|
for ( ; samples-- ; data++) {
|
2005-04-29 16:13:04 +00:00
|
|
|
unsigned long long m0, m1;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (abs(*data) > h->imag) {
|
2007-06-22 19:53:57 +00:00
|
|
|
h->imag = abs(*data);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2005-04-29 16:13:04 +00:00
|
|
|
h->imag = h->imag * 7 / 8;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (h->imag <= 500) { /* below [arbitrary] threahold: lost carrier */
|
|
|
|
if (h->idle++ == 80000) { /* nothing happening */
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_NOTICE, "No data, hanging up\n");
|
2005-04-29 16:13:04 +00:00
|
|
|
h->hangup = 1;
|
|
|
|
h->err = 1;
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->ierr) { /* error */
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_NOTICE, "Error %d, hanging up\n", h->ierr);
|
2006-12-19 23:56:08 +00:00
|
|
|
/* Protocol 1 */
|
2005-04-29 16:13:04 +00:00
|
|
|
h->err = 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
h->omsg[0] = 0x92; /* error */
|
2005-04-29 16:13:04 +00:00
|
|
|
h->omsg[1] = 1;
|
|
|
|
h->omsg[2] = h->ierr;
|
2008-10-14 18:58:19 +00:00
|
|
|
sms_messagetx(h); /* send error */
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
h->ierr = h->ibitn = h->ibytep = h->ibytec = 0;
|
2006-12-21 18:35:22 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
h->idle = 0;
|
|
|
|
|
|
|
|
/* multiply signal by the two carriers. */
|
|
|
|
h->ims0 = (h->ims0 * 6 + *data * wave[h->ips0]) / 7;
|
|
|
|
h->imc0 = (h->imc0 * 6 + *data * wave[h->ipc0]) / 7;
|
|
|
|
h->ims1 = (h->ims1 * 6 + *data * wave[h->ips1]) / 7;
|
|
|
|
h->imc1 = (h->imc1 * 6 + *data * wave[h->ipc1]) / 7;
|
|
|
|
/* compute the amplitudes */
|
|
|
|
m0 = h->ims0 * h->ims0 + h->imc0 * h->imc0;
|
|
|
|
m1 = h->ims1 * h->ims1 + h->imc1 * h->imc1;
|
|
|
|
|
|
|
|
/* advance the sin/cos pointers */
|
2008-10-14 18:58:19 +00:00
|
|
|
if ((h->ips0 += 21) >= 80) {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->ips0 -= 80;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if ((h->ipc0 += 21) >= 80) {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->ipc0 -= 80;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if ((h->ips1 += 13) >= 80) {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->ips1 -= 80;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if ((h->ipc1 += 13) >= 80) {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->ipc1 -= 80;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 18:35:22 +00:00
|
|
|
|
|
|
|
/* set new bit to 1 or 0 depending on which value is stronger */
|
|
|
|
h->ibith <<= 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (m1 > m0) {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->ibith |= 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (h->ibith & 8) {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->ibitt--;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (h->ibith & 1) {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->ibitt++;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 18:35:22 +00:00
|
|
|
bit = ((h->ibitt > 1) ? 1 : 0);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (bit != h->ibitl) {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->ibitc = 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->ibitc++;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 18:35:22 +00:00
|
|
|
h->ibitl = bit;
|
|
|
|
if (!h->ibitn && h->ibitc == 4 && !bit) {
|
|
|
|
h->ibitn = 1;
|
|
|
|
h->iphasep = 0;
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
if (bit && h->ibitc == 200) { /* sync, restart message */
|
2009-07-30 16:07:05 +00:00
|
|
|
/* Protocol 2: empty connection ready (I am master) */
|
2007-06-22 19:53:57 +00:00
|
|
|
if (h->framenumber < 0 && h->ibytec >= 160 && !memcmp(h->imsg, "UUUUUUUUUUUUUUUUUUUU", 20)) {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->framenumber = 1;
|
2007-07-26 15:49:18 +00:00
|
|
|
ast_verb(3, "SMS protocol 2 detected\n");
|
2006-12-21 18:35:22 +00:00
|
|
|
h->protocol = 2;
|
2008-10-14 18:58:19 +00:00
|
|
|
h->imsg[0] = 0xff; /* special message (fake) */
|
2006-12-21 18:35:22 +00:00
|
|
|
h->imsg[1] = h->imsg[2] = 0x00;
|
|
|
|
h->ierr = h->ibitn = h->ibytep = h->ibytec = 0;
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_messagerx(h);
|
2006-12-21 18:35:22 +00:00
|
|
|
}
|
|
|
|
h->ierr = h->ibitn = h->ibytep = h->ibytec = 0;
|
|
|
|
}
|
|
|
|
if (h->ibitn) {
|
|
|
|
h->iphasep += 12;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->iphasep >= 80) { /* next bit */
|
2006-12-21 18:35:22 +00:00
|
|
|
h->iphasep -= 80;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h->ibitn++ == 9) { /* end of byte */
|
|
|
|
if (!bit) { /* bad stop bit */
|
2014-04-19 01:31:27 +00:00
|
|
|
if (h->sent_rel) {
|
|
|
|
h->hangup = 1;
|
|
|
|
} else {
|
|
|
|
ast_log(LOG_NOTICE, "Bad stop bit\n");
|
|
|
|
h->ierr = 0xFF; /* unknown error */
|
|
|
|
}
|
2006-12-21 18:35:22 +00:00
|
|
|
} else {
|
2007-06-22 19:53:57 +00:00
|
|
|
if (h->ibytep < sizeof(h->imsg)) {
|
2006-12-21 18:35:22 +00:00
|
|
|
h->imsg[h->ibytep] = h->ibytev;
|
|
|
|
h->ibytec += h->ibytev;
|
|
|
|
h->ibytep++;
|
2007-06-22 19:53:57 +00:00
|
|
|
} else if (h->ibytep == sizeof(h->imsg)) {
|
2012-04-06 18:19:03 +00:00
|
|
|
ast_log(LOG_NOTICE, "msg too large\n");
|
2008-10-14 18:58:19 +00:00
|
|
|
h->ierr = 2; /* bad message length */
|
2006-12-21 18:35:22 +00:00
|
|
|
}
|
|
|
|
if (h->ibytep > 1 && h->ibytep == 3 + h->imsg[1] && !h->ierr) {
|
2008-10-14 18:58:19 +00:00
|
|
|
if (!h->ibytec) {
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_messagerx(h);
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2012-04-06 18:19:03 +00:00
|
|
|
ast_log(LOG_NOTICE, "bad checksum\n");
|
2008-10-14 18:58:19 +00:00
|
|
|
h->ierr = 1; /* bad checksum */
|
2006-12-21 18:35:22 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
h->ibitn = 0;
|
|
|
|
}
|
|
|
|
h->ibytev = (h->ibytev >> 1) + (bit ? 0x80 : 0);
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
}
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-12-21 22:03:54 +00:00
|
|
|
/*
|
|
|
|
* Standard argument parsing:
|
|
|
|
* - one enum for the flags we recognise,
|
|
|
|
* - one enum for argument indexes
|
|
|
|
* - AST_APP_OPTIONS() to drive the parsing routine
|
|
|
|
* - in the function, AST_DECLARE_APP_ARGS(...) for the arguments.
|
|
|
|
*/
|
2009-06-15 19:10:10 +00:00
|
|
|
enum sms_flags {
|
2008-10-14 18:58:19 +00:00
|
|
|
OPTION_BE_SMSC = (1 << 0), /* act as sms center */
|
|
|
|
OPTION_ANSWER = (1 << 1), /* answer on incoming calls */
|
|
|
|
OPTION_TWO = (1 << 2), /* Use Protocol Two */
|
|
|
|
OPTION_PAUSE = (1 << 3), /* pause before sending data, in ms */
|
|
|
|
OPTION_SRR = (1 << 4), /* set srr */
|
|
|
|
OPTION_DCS = (1 << 5), /* set dcs */
|
2009-06-15 19:10:10 +00:00
|
|
|
};
|
2006-12-21 22:03:54 +00:00
|
|
|
|
2009-06-15 19:10:10 +00:00
|
|
|
enum sms_opt_args {
|
2006-12-21 22:03:54 +00:00
|
|
|
OPTION_ARG_PAUSE = 0,
|
|
|
|
OPTION_ARG_ARRAY_SIZE
|
2009-06-15 19:10:10 +00:00
|
|
|
};
|
2006-12-21 22:03:54 +00:00
|
|
|
|
|
|
|
AST_APP_OPTIONS(sms_options, {
|
|
|
|
AST_APP_OPTION('s', OPTION_BE_SMSC),
|
|
|
|
AST_APP_OPTION('a', OPTION_ANSWER),
|
|
|
|
AST_APP_OPTION('t', OPTION_TWO),
|
|
|
|
AST_APP_OPTION('r', OPTION_SRR),
|
|
|
|
AST_APP_OPTION('o', OPTION_DCS),
|
|
|
|
AST_APP_OPTION_ARG('p', OPTION_PAUSE, OPTION_ARG_PAUSE),
|
|
|
|
} );
|
|
|
|
|
2009-05-21 21:13:09 +00:00
|
|
|
static int sms_exec(struct ast_channel *chan, const char *data)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2005-04-29 16:13:04 +00:00
|
|
|
int res = -1;
|
|
|
|
sms_t h = { 0 };
|
2006-12-21 22:03:54 +00:00
|
|
|
/* argument parsing support */
|
2014-04-19 01:31:27 +00:00
|
|
|
struct ast_flags flags = { 0 };
|
2008-10-01 15:44:06 +00:00
|
|
|
char *parse, *sms_opts[OPTION_ARG_ARRAY_SIZE] = { 0, };
|
2006-12-21 22:03:54 +00:00
|
|
|
char *p;
|
|
|
|
AST_DECLARE_APP_ARGS(sms_args,
|
2007-06-22 19:53:57 +00:00
|
|
|
AST_APP_ARG(queue);
|
|
|
|
AST_APP_ARG(options);
|
2006-12-21 22:03:54 +00:00
|
|
|
AST_APP_ARG(addr);
|
|
|
|
AST_APP_ARG(body);
|
2007-06-22 19:53:57 +00:00
|
|
|
);
|
2006-12-21 22:03:54 +00:00
|
|
|
|
2005-04-29 16:13:04 +00:00
|
|
|
if (!data) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_ERROR, "Requires queue name at least\n");
|
2005-04-29 16:13:04 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
parse = ast_strdupa(data); /* create a local copy */
|
2006-12-21 22:03:54 +00:00
|
|
|
AST_STANDARD_APP_ARGS(sms_args, parse);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (sms_args.argc > 1) {
|
2008-08-10 14:45:25 +00:00
|
|
|
ast_app_parse_options(sms_options, &flags, sms_opts, sms_args.options);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 22:03:54 +00:00
|
|
|
|
2014-05-09 22:49:26 +00:00
|
|
|
ast_verb(1, "sms argc %u queue <%s> opts <%s> addr <%s> body <%s>\n",
|
2006-12-21 22:03:54 +00:00
|
|
|
sms_args.argc, S_OR(sms_args.queue, ""),
|
|
|
|
S_OR(sms_args.options, ""),
|
|
|
|
S_OR(sms_args.addr, ""),
|
|
|
|
S_OR(sms_args.body, "") );
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
h.ipc0 = h.ipc1 = 20; /* phase for cosine */
|
|
|
|
h.dcs = 0xF1; /* default */
|
2006-12-21 18:54:17 +00:00
|
|
|
|
2010-07-14 15:48:36 +00:00
|
|
|
ast_copy_string(h.cli,
|
2012-02-29 16:52:47 +00:00
|
|
|
S_COR(ast_channel_caller(chan)->id.number.valid, ast_channel_caller(chan)->id.number.str, ""),
|
2010-07-14 15:48:36 +00:00
|
|
|
sizeof(h.cli));
|
2005-04-29 16:13:04 +00:00
|
|
|
|
2006-12-21 22:03:54 +00:00
|
|
|
if (ast_strlen_zero(sms_args.queue)) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_ERROR, "Requires queue name\n");
|
2006-12-21 22:03:54 +00:00
|
|
|
goto done;
|
2006-12-21 18:54:17 +00:00
|
|
|
}
|
2006-12-21 22:03:54 +00:00
|
|
|
if (strlen(sms_args.queue) >= sizeof(h.queue)) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_ERROR, "Queue name too long\n");
|
2006-12-21 22:03:54 +00:00
|
|
|
goto done;
|
2006-12-21 18:54:17 +00:00
|
|
|
}
|
2006-12-21 22:03:54 +00:00
|
|
|
ast_copy_string(h.queue, sms_args.queue, sizeof(h.queue));
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
for (p = h.queue; *p; p++) {
|
|
|
|
if (!isalnum(*p)) {
|
|
|
|
*p = '-'; /* make very safe for filenames */
|
|
|
|
}
|
|
|
|
}
|
2006-12-21 18:54:17 +00:00
|
|
|
|
2008-08-10 14:45:25 +00:00
|
|
|
h.smsc = ast_test_flag(&flags, OPTION_BE_SMSC);
|
|
|
|
h.protocol = ast_test_flag(&flags, OPTION_TWO) ? 2 : 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
if (!ast_strlen_zero(sms_opts[OPTION_ARG_PAUSE])) {
|
2006-12-21 22:03:54 +00:00
|
|
|
h.opause_0 = atoi(sms_opts[OPTION_ARG_PAUSE]);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (h.opause_0 < 25 || h.opause_0 > 2000) {
|
|
|
|
h.opause_0 = 300; /* default 300ms */
|
|
|
|
}
|
2007-07-26 15:49:18 +00:00
|
|
|
ast_verb(1, "initial delay %dms\n", h.opause_0);
|
2006-12-21 22:03:54 +00:00
|
|
|
|
|
|
|
|
|
|
|
/* the following apply if there is an arg3/4 and apply to the created message file */
|
2008-10-14 18:58:19 +00:00
|
|
|
if (ast_test_flag(&flags, OPTION_SRR)) {
|
2006-12-21 22:03:54 +00:00
|
|
|
h.srr = 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
|
|
|
if (ast_test_flag(&flags, OPTION_DCS)) {
|
2006-12-21 22:03:54 +00:00
|
|
|
h.dcs = 1;
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2006-12-21 22:03:54 +00:00
|
|
|
#if 0
|
2006-12-21 18:54:17 +00:00
|
|
|
case '1':
|
|
|
|
case '2':
|
|
|
|
case '3':
|
|
|
|
case '4':
|
|
|
|
case '5':
|
|
|
|
case '6':
|
2008-10-14 18:58:19 +00:00
|
|
|
case '7': /* set the pid for saved local message */
|
2006-12-21 18:54:17 +00:00
|
|
|
h.pid = 0x40 + (*d & 0xF);
|
|
|
|
break;
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2006-12-21 22:03:54 +00:00
|
|
|
#endif
|
|
|
|
if (sms_args.argc > 2) {
|
|
|
|
unsigned char *up;
|
|
|
|
|
2006-12-21 18:54:17 +00:00
|
|
|
/* submitting a message, not taking call. */
|
|
|
|
/* deprecated, use smsq instead */
|
2007-09-12 21:25:57 +00:00
|
|
|
h.scts = ast_tvnow();
|
2007-06-22 19:53:57 +00:00
|
|
|
if (ast_strlen_zero(sms_args.addr) || strlen(sms_args.addr) >= sizeof(h.oa)) {
|
|
|
|
ast_log(LOG_ERROR, "Address too long %s\n", sms_args.addr);
|
2006-12-21 22:03:54 +00:00
|
|
|
goto done;
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
if (h.smsc) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_copy_string(h.oa, sms_args.addr, sizeof(h.oa));
|
2008-10-14 18:58:19 +00:00
|
|
|
} else {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_copy_string(h.da, sms_args.addr, sizeof(h.da));
|
|
|
|
ast_copy_string(h.oa, h.cli, sizeof(h.oa));
|
2006-12-21 22:03:54 +00:00
|
|
|
}
|
2006-12-21 18:54:17 +00:00
|
|
|
h.udl = 0;
|
2006-12-21 22:03:54 +00:00
|
|
|
if (ast_strlen_zero(sms_args.body)) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_ERROR, "Missing body for %s\n", sms_args.addr);
|
2006-12-21 22:03:54 +00:00
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
up = (unsigned char *)sms_args.body;
|
2008-10-14 18:58:19 +00:00
|
|
|
while (*up && h.udl < SMSLEN) {
|
2006-12-21 22:03:54 +00:00
|
|
|
h.ud[h.udl++] = utf8decode(&up);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
if (is7bit(h.dcs) && packsms7(0, h.udhl, h.udh, h.udl, h.ud) < 0) {
|
|
|
|
ast_log(LOG_WARNING, "Invalid 7 bit GSM data\n");
|
2006-12-21 22:03:54 +00:00
|
|
|
goto done;
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
if (is8bit(h.dcs) && packsms8(0, h.udhl, h.udh, h.udl, h.ud) < 0) {
|
|
|
|
ast_log(LOG_WARNING, "Invalid 8 bit data\n");
|
2006-12-21 22:03:54 +00:00
|
|
|
goto done;
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
if (is16bit(h.dcs) && packsms16(0, h.udhl, h.udh, h.udl, h.ud) < 0) {
|
|
|
|
ast_log(LOG_WARNING, "Invalid 16 bit data\n");
|
2006-12-21 22:03:54 +00:00
|
|
|
goto done;
|
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
h.rx = 0; /* sent message */
|
2006-12-21 18:54:17 +00:00
|
|
|
h.mr = -1;
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_writefile(&h);
|
2006-12-21 22:03:54 +00:00
|
|
|
res = h.err;
|
|
|
|
goto done;
|
2006-12-21 18:54:17 +00:00
|
|
|
}
|
2008-10-16 22:44:05 +00:00
|
|
|
|
2012-02-20 23:43:27 +00:00
|
|
|
if (ast_channel_state(chan) != AST_STATE_UP) { /* make sure channel is answered before any TX */
|
2008-10-16 22:44:05 +00:00
|
|
|
ast_answer(chan);
|
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
|
2008-08-10 14:45:25 +00:00
|
|
|
if (ast_test_flag(&flags, OPTION_ANSWER)) {
|
2008-10-14 18:58:19 +00:00
|
|
|
h.framenumber = 1; /* Proto 2 */
|
2006-12-21 18:54:17 +00:00
|
|
|
/* set up SMS_EST initial message */
|
|
|
|
if (h.protocol == 2) {
|
|
|
|
h.omsg[0] = DLL2_SMS_EST;
|
|
|
|
h.omsg[1] = 0;
|
|
|
|
} else {
|
|
|
|
h.omsg[0] = DLL1_SMS_EST | DLL1_SMS_COMPLETE;
|
|
|
|
h.omsg[1] = 0;
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
sms_messagetx(&h);
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
res = ast_set_write_format(chan, __OUT_FMT);
|
2008-10-14 18:58:19 +00:00
|
|
|
if (res >= 0) {
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
res = ast_set_read_format(chan, ast_format_slin);
|
2008-10-14 18:58:19 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
if (res < 0) {
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_log(LOG_ERROR, "Unable to set to linear mode, giving up\n");
|
2006-12-21 22:03:54 +00:00
|
|
|
goto done;
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
|
2007-06-22 19:53:57 +00:00
|
|
|
if ( (res = ast_activate_generator(chan, &smsgen, &h)) < 0) {
|
2012-01-09 22:15:50 +00:00
|
|
|
ast_log(LOG_ERROR, "Failed to activate generator on '%s'\n", ast_channel_name(chan));
|
2006-12-21 22:03:54 +00:00
|
|
|
goto done;
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Do our thing here */
|
2006-12-19 21:29:55 +00:00
|
|
|
for (;;) {
|
2006-12-21 22:03:54 +00:00
|
|
|
struct ast_frame *f;
|
2006-12-19 21:29:55 +00:00
|
|
|
int i = ast_waitfor(chan, -1);
|
|
|
|
if (i < 0) {
|
|
|
|
ast_log(LOG_NOTICE, "waitfor failed\n");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (h.hangup) {
|
|
|
|
ast_log(LOG_NOTICE, "channel hangup\n");
|
|
|
|
break;
|
|
|
|
}
|
2007-06-22 19:53:57 +00:00
|
|
|
f = ast_read(chan);
|
2006-12-19 23:56:08 +00:00
|
|
|
if (!f) {
|
|
|
|
ast_log(LOG_NOTICE, "ast_read failed\n");
|
2005-04-29 16:13:04 +00:00
|
|
|
break;
|
2006-12-19 23:56:08 +00:00
|
|
|
}
|
2005-04-29 16:13:04 +00:00
|
|
|
if (f->frametype == AST_FRAME_VOICE) {
|
2008-05-22 16:29:54 +00:00
|
|
|
sms_process(&h, f->samples, f->data.ptr);
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
|
|
|
|
2007-06-22 19:53:57 +00:00
|
|
|
ast_frfree(f);
|
2005-04-29 16:13:04 +00:00
|
|
|
}
|
2008-10-14 18:58:19 +00:00
|
|
|
res = h.err; /* XXX */
|
2005-04-29 16:13:04 +00:00
|
|
|
|
2010-09-30 15:40:10 +00:00
|
|
|
/*
|
|
|
|
* The SMS generator data is on the stack. We _MUST_ make sure the generator
|
|
|
|
* is stopped before returning from this function.
|
|
|
|
*/
|
|
|
|
ast_deactivate_generator(chan);
|
|
|
|
|
2008-10-14 18:58:19 +00:00
|
|
|
sms_log(&h, '?'); /* log incomplete message */
|
2006-12-21 22:03:54 +00:00
|
|
|
done:
|
|
|
|
return (res);
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
static int unload_module(void)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2007-07-16 13:35:20 +00:00
|
|
|
return ast_unregister_application(app);
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
static int load_module(void)
|
2004-04-28 20:43:06 +00:00
|
|
|
{
|
2004-12-11 22:36:27 +00:00
|
|
|
#ifdef OUTALAW
|
2006-12-21 22:15:03 +00:00
|
|
|
int p;
|
2008-10-14 18:58:19 +00:00
|
|
|
for (p = 0; p < 80; p++) {
|
|
|
|
wavea[p] = AST_LIN2A(wave[p]);
|
|
|
|
}
|
2004-12-11 22:36:27 +00:00
|
|
|
#endif
|
2007-06-22 19:53:57 +00:00
|
|
|
snprintf(log_file, sizeof(log_file), "%s/sms", ast_config_AST_LOG_DIR);
|
2008-12-07 22:43:46 +00:00
|
|
|
return ast_register_application_xml(app, sms_exec);
|
2004-04-28 20:43:06 +00:00
|
|
|
}
|
|
|
|
|
2014-07-25 16:47:17 +00:00
|
|
|
AST_MODULE_INFO_STANDARD_EXTENDED(ASTERISK_GPL_KEY, "SMS/PSTN handler");
|
|
|
|
|