mirror of git://git.sysmocom.de/ofono
694 lines
17 KiB
C
694 lines
17 KiB
C
/*
|
|
*
|
|
* oFono - Open Source Telephony
|
|
*
|
|
* Copyright (C) 2008-2009 Intel Corporation. All rights reserved.
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License version 2 as
|
|
* published by the Free Software Foundation.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*
|
|
*/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include <config.h>
|
|
#endif
|
|
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <ctype.h>
|
|
|
|
#include <glib.h>
|
|
|
|
#include "util.h"
|
|
|
|
/*
|
|
Name: GSM 03.38 to Unicode
|
|
Unicode version: 3.0
|
|
Table version: 1.1
|
|
Table format: Format A
|
|
Date: 2000 May 30
|
|
Authors: Ken Whistler
|
|
Kent Karlsson
|
|
Markus Kuhn
|
|
|
|
Copyright (c) 2000 Unicode, Inc. All Rights reserved.
|
|
|
|
This file is provided as-is by Unicode, Inc. (The Unicode Consortium).
|
|
No claims are made as to fitness for any particular purpose. No
|
|
warranties of any kind are expressed or implied. The recipient
|
|
agrees to determine applicability of information provided. If this
|
|
file has been provided on optical media by Unicode, Inc., the sole
|
|
remedy for any claim will be exchange of defective media within 90
|
|
days of receipt.
|
|
|
|
Unicode, Inc. hereby grants the right to freely use the information
|
|
supplied in this file in the creation of products supporting the
|
|
Unicode Standard, and to make copies of this file in any form for
|
|
internal or external distribution as long as this notice remains
|
|
attached.
|
|
*/
|
|
|
|
/* GSM to Unicode extension table, for GSM sequences starting with 0x1B */
|
|
static unsigned short gsm_extension[] =
|
|
{
|
|
0x0A, 0x000C, /* See NOTE 3 in 23.038 */
|
|
0x14, 0x005E,
|
|
0x1B, 0x0020, /* See NOTE 1 in 23.038 */
|
|
0x28, 0x007B,
|
|
0x29, 0x007D,
|
|
0x2F, 0x005C,
|
|
0x3C, 0x005B,
|
|
0x3D, 0x007E,
|
|
0x3E, 0x005D,
|
|
0x40, 0x007C,
|
|
0x65, 0x20AC
|
|
};
|
|
|
|
/* Used for conversion of GSM to Unicode */
|
|
static unsigned short gsm_table[] =
|
|
{
|
|
0x0040, 0x00A3, 0x0024, 0x00A5, 0x00E8, 0x00E9, 0x00F9, 0x00EC, /* 0x07 */
|
|
0x00F2, 0x00E7, 0x000A, 0x00D8, 0x00F8, 0x000D, 0x00C5, 0x00E5, /* 0x0F */
|
|
0x0394, 0x005F, 0x03A6, 0x0393, 0x039B, 0x03A9, 0x03A0, 0x03A8, /* 0x17 */
|
|
0x03A3, 0x0398, 0x039E, 0x00A0, 0x00C6, 0x00E6, 0x00DF, 0x00C9, /* 0x1F */
|
|
0x0020, 0x0021, 0x0022, 0x0023, 0x00A4, 0x0025, 0x0026, 0x0027, /* 0x27 */
|
|
0x0028, 0x0029, 0x002A, 0x002B, 0x002C, 0x002D, 0x002E, 0x002F, /* 0x2F */
|
|
0x0030, 0x0031, 0x0032, 0x0033, 0x0034, 0x0035, 0x0036, 0x0037, /* 0x37 */
|
|
0x0038, 0x0039, 0x003A, 0x003B, 0x003C, 0x003D, 0x003E, 0x003F, /* 0x3F */
|
|
0x00A1, 0x0041, 0x0042, 0x0043, 0x0044, 0x0045, 0x0046, 0x0047, /* 0x47 */
|
|
0x0048, 0x0049, 0x004A, 0x004B, 0x004C, 0x004D, 0x004E, 0x004F, /* 0x4F */
|
|
0x0050, 0x0051, 0x0052, 0x0053, 0x0054, 0x0055, 0x0056, 0x0057, /* 0x57 */
|
|
0x0058, 0x0059, 0x005A, 0x00C4, 0x00D6, 0x00D1, 0x00DC, 0x00A7, /* 0x5F */
|
|
0x00BF, 0x0061, 0x0062, 0x0063, 0x0064, 0x0065, 0x0066, 0x0067, /* 0x67 */
|
|
0x0068, 0x0069, 0x006A, 0x006B, 0x006C, 0x006D, 0x006E, 0x006F, /* 0x6F */
|
|
0x0070, 0x0071, 0x0072, 0x0073, 0x0074, 0x0075, 0x0076, 0x0077, /* 0x77 */
|
|
0x0078, 0x0079, 0x007A, 0x00E4, 0x00F6, 0x00F1, 0x00FC, 0x00E0 /* 0x7F */
|
|
};
|
|
|
|
#define GUND 0xFFFF
|
|
|
|
/* 3GPP 27.005 Annex A */
|
|
static unsigned short unicode_256_table[] =
|
|
{
|
|
GUND, GUND, GUND, GUND, GUND, GUND, GUND, GUND, /* 0x07 */
|
|
GUND, GUND, 0x0A, GUND, 0x1B0A, 0x0D, GUND, GUND, /* 0x0F */
|
|
GUND, GUND, GUND, GUND, GUND, GUND, GUND, GUND, /* 0x17 */
|
|
GUND, GUND, GUND, GUND, GUND, GUND, GUND, GUND, /* 0x1F */
|
|
0x20, 0x21, 0x22, 0x23, 0x02, 0x25, 0x26, 0x27, /* 0x27 */
|
|
0x28, 0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F, /* 0x2F */
|
|
0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, /* 0x37 */
|
|
0x38, 0x39, 0x3A, 0x3B, 0x3C, 0x3D, 0x3E, 0x3F, /* 0x3F */
|
|
0x00, 0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, /* 0x47 */
|
|
0x48, 0x49, 0x4A, 0x4B, 0x4C, 0x4D, 0x4E, 0x4F, /* 0x4F */
|
|
0x50, 0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, /* 0x57 */
|
|
0x58, 0x59, 0x5A, 0x1B3C, 0x1B2F, 0x1B3E, 0x1B14, 0x11, /* 0x5F */
|
|
GUND, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67, /* 0x67 */
|
|
0x68, 0x69, 0x6A, 0x6B, 0x6C, 0x6D, 0x6E, 0x6F, /* 0x6F */
|
|
0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77, /* 0x77 */
|
|
0x78, 0x79, 0x7A, 0x1B28, 0x1B40, 0x1B29, 0x1B3D, GUND, /* 0x7F */
|
|
GUND, GUND, GUND, GUND, GUND, GUND, GUND, GUND, /* 0x87 */
|
|
GUND, GUND, GUND, GUND, GUND, GUND, GUND, GUND, /* 0x8F */
|
|
GUND, GUND, GUND, GUND, GUND, GUND, GUND, GUND, /* 0x97 */
|
|
GUND, GUND, GUND, GUND, GUND, GUND, GUND, GUND, /* 0x9F */
|
|
GUND, 0x40, GUND, 0x01, 0x24, 0x03, GUND, 0x5f, /* 0xA7 */
|
|
GUND, GUND, GUND, GUND, GUND, GUND, GUND, GUND, /* 0xAF */
|
|
GUND, GUND, GUND, GUND, GUND, GUND, GUND, GUND, /* 0xB7 */
|
|
GUND, GUND, GUND, GUND, GUND, GUND, GUND, 0x60, /* 0xBF */
|
|
0x41, 0x41, 0x41, 0x41, 0x5B, 0x0E, 0x1C, 0x09, /* 0xC7 */
|
|
0x45, 0x1F, 0x45, 0x45, 0x49, 0x49, 0x49, 0x49, /* 0xCF */
|
|
GUND, 0x5D, 0x4F, 0x4F, 0x4F, 0x4F, 0x5C, GUND, /* 0xD7 */
|
|
0x0B, 0x55, 0x55, 0x55, 0x5E, 0x59, GUND, 0x1E, /* 0xDF */
|
|
0x7F, 0x61, 0x61, 0x61, 0x7B, 0x0F, 0x1D, 0x09, /* 0xE7 */
|
|
0x04, 0x05, 0x65, 0x65, 0x07, 0x69, 0x69, 0x69, /* 0xEF */
|
|
GUND, 0x7D, 0x08, 0x6F, 0x6F, 0x6F, 0x7C, GUND, /* 0xF7 */
|
|
0x0C, 0x06, 0x75, 0x75, 0x7E, 0x79, GUND, 0x79 /* 0xFF */
|
|
};
|
|
|
|
/* Starts at 0x0390 */
|
|
static unsigned short greek_unicode_offset = 0x0390;
|
|
|
|
static unsigned short greek_unicode_table[] =
|
|
{
|
|
GUND, GUND, GUND, 0x13, 0x10, GUND, GUND, GUND, /* 0x07 */
|
|
0x19, GUND, GUND, 0x14, GUND, GUND, 0x1A, GUND, /* 0x0F */
|
|
0x16, GUND, GUND, 0x18, GUND, GUND, 0x12, GUND, /* 0x17 */
|
|
0x17, 0x15, GUND, GUND, GUND, GUND, GUND, GUND, /* 0x1F */
|
|
};
|
|
|
|
#define UTF8_LENGTH(c) \
|
|
((c) < 0x80 ? 1 : \
|
|
((c) < 0x800 ? 2 : 3))
|
|
|
|
static unsigned short gsm_extension_table_lookup(unsigned char k)
|
|
{
|
|
static unsigned int ext_table_len =
|
|
(sizeof(gsm_extension) / sizeof(unsigned short)) >> 1;
|
|
unsigned int i;
|
|
unsigned short *t;
|
|
|
|
for (i = 0, t = gsm_extension; i < ext_table_len; i++) {
|
|
if (t[0] == k)
|
|
return t[1];
|
|
t += 2;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*!
|
|
* Converts text coded using GSM codec into UTF8 encoded text. If len
|
|
* is less than 0, and terminator character is given, the length is
|
|
* computed automatically.
|
|
*
|
|
* Returns newly-allocated UTF8 encoded string or NULL if the conversion
|
|
* could not be performed. Returns the number of bytes read from the
|
|
* GSM encoded string in items_read (if not NULL), not including the
|
|
* terminator character. Returns the number of bytes written into the UTF8
|
|
* encoded string in items_written (if not NULL) not including the terminal
|
|
* '\0' character. The caller is reponsible for freeing the returned value.
|
|
*/
|
|
char *convert_gsm_to_utf8(const unsigned char *text, long len,
|
|
long *items_read, long *items_written,
|
|
unsigned char terminator)
|
|
{
|
|
char *res = NULL;
|
|
char *out;
|
|
long i = 0;
|
|
long res_length;
|
|
|
|
if (len == 0 || (len < 0 && !terminator))
|
|
goto err_out;
|
|
|
|
if (len < 0) {
|
|
i = 0;
|
|
|
|
while (text[i] != terminator)
|
|
i++;
|
|
|
|
len = i;
|
|
}
|
|
|
|
for (i = 0, res_length = 0; i < len; i++) {
|
|
unsigned short c;
|
|
|
|
if (text[i] > 0x7f)
|
|
goto err_out;
|
|
|
|
if (text[i] == 0x1b) {
|
|
++i;
|
|
if (i >= len)
|
|
goto err_out;
|
|
|
|
c = gsm_extension_table_lookup(text[i]);
|
|
|
|
if (c == 0)
|
|
goto err_out;
|
|
} else {
|
|
c = gsm_table[text[i]];
|
|
}
|
|
|
|
res_length += UTF8_LENGTH(c);
|
|
}
|
|
|
|
res = g_malloc(res_length + 1);
|
|
|
|
if (!res)
|
|
goto err_out;
|
|
|
|
out = res;
|
|
|
|
i = 0;
|
|
while (out < res + res_length) {
|
|
unsigned short c;
|
|
|
|
if (text[i] == 0x1b)
|
|
c = gsm_extension_table_lookup(text[++i]);
|
|
else
|
|
c = gsm_table[text[i]];
|
|
|
|
out += g_unichar_to_utf8(c, out);
|
|
|
|
++i;
|
|
}
|
|
|
|
*out = '\0';
|
|
|
|
if (items_written)
|
|
*items_written = out - res;
|
|
|
|
err_out:
|
|
if (items_read)
|
|
*items_read = i;
|
|
|
|
return res;
|
|
}
|
|
|
|
static unsigned short unicode_to_gsm(unsigned short c)
|
|
{
|
|
static int greek_unicode_size = sizeof(greek_unicode_table) /
|
|
sizeof(unsigned short);
|
|
unsigned short converted = GUND;
|
|
|
|
if (c == 0x20AC)
|
|
converted = 0x1B65;
|
|
else if (c < 256)
|
|
converted = unicode_256_table[c];
|
|
else if ((c >= greek_unicode_offset) &&
|
|
(c < (greek_unicode_offset + greek_unicode_size))) {
|
|
converted = greek_unicode_table[c-greek_unicode_offset];
|
|
}
|
|
|
|
return converted;
|
|
}
|
|
|
|
/*!
|
|
* Converts UTF-8 encoded text to GSM alphabet. The result is unpacked,
|
|
* with the 7th bit always 0. If terminator is not 0, a terminator character
|
|
* is appended to the result. This should be in the range 0x80-0xf0
|
|
*
|
|
* Returns the encoded data or NULL if the data could not be encoded. The
|
|
* data must be freed by the caller. If items_read is not NULL, it contains
|
|
* the actual number of bytes read. If items_written is not NULL, contains
|
|
* the number of bytes written.
|
|
*/
|
|
unsigned char *convert_utf8_to_gsm(const char *text, long len,
|
|
long *items_read, long *items_written,
|
|
unsigned char terminator)
|
|
{
|
|
long nchars = 0;
|
|
const char *in;
|
|
unsigned char *out;
|
|
unsigned char *res = NULL;
|
|
long res_len;
|
|
long i;
|
|
|
|
in = text;
|
|
res_len = 0;
|
|
|
|
while ((len < 0 || text + len - in > 0) && *in) {
|
|
long max = len < 0 ? 6 : text + len - in;
|
|
gunichar c = g_utf8_get_char_validated(in, max);
|
|
unsigned short converted = GUND;
|
|
|
|
if (c & 0x80000000)
|
|
goto err_out;
|
|
|
|
if (c > 0xffff)
|
|
goto err_out;
|
|
|
|
converted = unicode_to_gsm(c);
|
|
|
|
if (converted == GUND)
|
|
goto err_out;
|
|
|
|
if (converted & 0x1b00)
|
|
res_len += 2;
|
|
else
|
|
res_len += 1;
|
|
|
|
in = g_utf8_next_char(in);
|
|
nchars += 1;
|
|
}
|
|
|
|
res = g_malloc(res_len + (terminator ? 1 : 0));
|
|
|
|
if (!res)
|
|
goto err_out;
|
|
|
|
in = text;
|
|
out = res;
|
|
for (i = 0; i < nchars; i++) {
|
|
unsigned short converted;
|
|
|
|
gunichar c = g_utf8_get_char(in);
|
|
|
|
converted = unicode_to_gsm(c);
|
|
if (converted & 0x1b00) {
|
|
*out = 0x1b;
|
|
++out;
|
|
}
|
|
|
|
*out = converted;
|
|
++out;
|
|
|
|
in = g_utf8_next_char(in);
|
|
}
|
|
|
|
if (terminator)
|
|
*out = terminator;
|
|
|
|
if (items_written)
|
|
*items_written = out - res;
|
|
|
|
err_out:
|
|
if (items_read)
|
|
*items_read = in - text;
|
|
|
|
return res;
|
|
}
|
|
|
|
/*!
|
|
* Decodes the hex encoded data and converts to a byte array. If terminator
|
|
* is not 0, the terminator character is appended to the end of the result.
|
|
* This might be useful for converting GSM encoded data if the CSCS is set
|
|
* to HEX.
|
|
*
|
|
* Please note that this since GSM does allow embedded null characeters, use
|
|
* of the terminator or the items_writen is encouraged to find the real size
|
|
* of the result.
|
|
*/
|
|
unsigned char *decode_hex_own_buf(const char *in, long len, long *items_written,
|
|
unsigned char terminator,
|
|
unsigned char *buf)
|
|
{
|
|
long i, j;
|
|
char c;
|
|
unsigned char b;
|
|
|
|
if (len < 0)
|
|
len = strlen(in);
|
|
|
|
len &= ~0x1;
|
|
|
|
for (i = 0, j = 0; i < len; i++, j++) {
|
|
c = toupper(in[i]);
|
|
|
|
if (c >= '0' && c <= '9')
|
|
b = c - '0';
|
|
else if (c >= 'A' && c <= 'F')
|
|
b = 10 + c - 'A';
|
|
else
|
|
return NULL;
|
|
|
|
i += 1;
|
|
|
|
c = toupper(in[i]);
|
|
|
|
if (c >= '0' && c <= '9')
|
|
b = b*16 + c - '0';
|
|
else if (c >= 'A' && c <= 'F')
|
|
b = b*16 + 10 + c - 'A';
|
|
else
|
|
return NULL;
|
|
|
|
buf[j] = b;
|
|
}
|
|
|
|
if (terminator)
|
|
buf[j] = terminator;
|
|
|
|
if (items_written)
|
|
*items_written = j;
|
|
|
|
return buf;
|
|
}
|
|
|
|
unsigned char *decode_hex(const char *in, long len, long *items_written,
|
|
unsigned char terminator)
|
|
{
|
|
long i;
|
|
char c;
|
|
unsigned char *buf;
|
|
|
|
if (len < 0)
|
|
len = strlen(in);
|
|
|
|
len &= ~0x1;
|
|
|
|
for (i = 0; i < len; i++) {
|
|
c = toupper(in[i]);
|
|
|
|
if ((c >= '0' && c <= '9') || (c >= 'A' && c <= 'F'))
|
|
continue;
|
|
|
|
return NULL;
|
|
}
|
|
|
|
buf = g_new(unsigned char, (len >> 1) + (terminator ? 1 : 0));
|
|
|
|
return decode_hex_own_buf(in, len, items_written, terminator, buf);
|
|
}
|
|
|
|
/*!
|
|
* Encodes the data using hexadecimal characters. len can be negative,
|
|
* in that case the terminator is used to find the last character. This is
|
|
* useful for handling GSM-encoded strings which allow ASCII NULL character
|
|
* in the stream.
|
|
*/
|
|
char *encode_hex_own_buf(const unsigned char *in, long len,
|
|
unsigned char terminator, char *buf)
|
|
{
|
|
long i, j;
|
|
char c;
|
|
|
|
if (len < 0) {
|
|
i = 0;
|
|
|
|
while (in[i] != terminator)
|
|
i++;
|
|
|
|
len = i;
|
|
}
|
|
|
|
for (i = 0, j = 0; i < len; i++, j++) {
|
|
c = (in[i] >> 4) & 0xf;
|
|
|
|
if (c <= 9)
|
|
buf[j] = '0' + c;
|
|
else
|
|
buf[j] = 'A' + c - 10;
|
|
|
|
j += 1;
|
|
|
|
c = (in[i]) & 0xf;
|
|
|
|
if (c <= 9)
|
|
buf[j] = '0' + c;
|
|
else
|
|
buf[j] = 'A' + c - 10;
|
|
}
|
|
|
|
buf[j] = '\0';
|
|
|
|
return buf;
|
|
}
|
|
|
|
char *encode_hex(const unsigned char *in, long len, unsigned char terminator)
|
|
{
|
|
char *buf;
|
|
int i;
|
|
|
|
if (len < 0) {
|
|
i = 0;
|
|
|
|
while (in[i] != terminator)
|
|
i++;
|
|
|
|
len = i;
|
|
}
|
|
|
|
buf = g_new(char, len * 2 + 1);
|
|
|
|
return encode_hex_own_buf(in, len, terminator, buf);
|
|
}
|
|
|
|
unsigned char *unpack_7bit_own_buf(const unsigned char *in, long len,
|
|
int byte_offset, gboolean ussd,
|
|
long max_to_unpack, long *items_written,
|
|
unsigned char terminator,
|
|
unsigned char *buf)
|
|
{
|
|
unsigned char rest = 0;
|
|
unsigned char *out = buf;
|
|
int bits = 7 - (byte_offset % 7);
|
|
long i;
|
|
|
|
if (len <= 0)
|
|
return NULL;
|
|
|
|
/* In the case of CB, unpack as much as possible */
|
|
if (ussd == TRUE)
|
|
max_to_unpack = len * 8 / 7;
|
|
|
|
for (i = 0; (i < len) && ((out-buf) < max_to_unpack); i++) {
|
|
/* Grab what we have in the current octet */
|
|
*out = (in[i] & ((1 << bits) - 1)) << (7 - bits);
|
|
|
|
/* Append what we have from the previous octet, if any */
|
|
*out |= rest;
|
|
|
|
/* Figure out the remainder */
|
|
rest = (in[i] >> bits) & ((1 << (8-bits)) - 1);
|
|
|
|
/* We have the entire character, here we don't increate
|
|
* out if this is we started at an offset. Instead
|
|
* we effectively populate variable rest */
|
|
if (i != 0 || bits == 7)
|
|
out++;
|
|
|
|
if ((out-buf) == max_to_unpack)
|
|
break;
|
|
|
|
/* We expected only 1 bit from this octet, means there's 7
|
|
* left, take care of them here */
|
|
if (bits == 1) {
|
|
*out = rest;
|
|
out++;
|
|
bits = 7;
|
|
rest = 0;
|
|
} else
|
|
bits = bits - 1;
|
|
}
|
|
|
|
/* According to 23.038 6.1.2.3.1, last paragraph:
|
|
* "If the total number of characters to be sent equals (8n-1)
|
|
* where n=1,2,3 etc. then there are 7 spare bits at the end
|
|
* of the message. To avoid the situation where the receiving
|
|
* entity confuses 7 binary zero pad bits as the @ character,
|
|
* the carriage return or <CR> character shall be used for
|
|
* padding in this situation, just as for Cell Broadcast."
|
|
*
|
|
* "The receiving entity shall remove the final <CR> character where
|
|
* the message ends on an octet boundary with <CR> as the last
|
|
* character.
|
|
*/
|
|
if (ussd && (((out - buf) % 8) == 0) && (*(out-1) == '\r'))
|
|
out = out - 1;
|
|
|
|
if (terminator)
|
|
*out = terminator;
|
|
|
|
if (items_written)
|
|
*items_written = out - buf;
|
|
|
|
return buf;
|
|
}
|
|
|
|
unsigned char *unpack_7bit(const unsigned char *in, long len, int byte_offset,
|
|
gboolean ussd, long max_to_unpack,
|
|
long *items_written, unsigned char terminator)
|
|
{
|
|
unsigned char *buf = g_new(unsigned char,
|
|
len * 8 / 7 + (terminator ? 1 : 0));
|
|
|
|
return unpack_7bit_own_buf(in, len, byte_offset, ussd, max_to_unpack,
|
|
items_written, terminator, buf);
|
|
}
|
|
|
|
unsigned char *pack_7bit_own_buf(const unsigned char *in, long len,
|
|
int byte_offset, gboolean ussd,
|
|
long *items_written,
|
|
unsigned char terminator,
|
|
unsigned char *buf)
|
|
{
|
|
int bits = 7 - (byte_offset % 7);
|
|
unsigned char *out = buf;
|
|
long i;
|
|
long total_bits;
|
|
|
|
if (len == 0 || !items_written)
|
|
return NULL;
|
|
|
|
if (len < 0) {
|
|
i = 0;
|
|
|
|
while (in[i] != terminator)
|
|
i++;
|
|
|
|
len = i;
|
|
}
|
|
|
|
total_bits = len * 7;
|
|
|
|
if (bits != 7) {
|
|
total_bits += bits;
|
|
bits = bits - 1;
|
|
*out = 0;
|
|
}
|
|
|
|
for (i = 0; i < len; i++) {
|
|
if (bits != 7) {
|
|
*out |= (in[i] & ((1 << (7 - bits)) - 1)) <<
|
|
(bits + 1);
|
|
out++;
|
|
}
|
|
|
|
/* This is a no op when bits == 0, lets keep valgrind happy */
|
|
if (bits != 0)
|
|
*out = in[i] >> (7 - bits);
|
|
|
|
if (bits == 0)
|
|
bits = 7;
|
|
else
|
|
bits = bits - 1;
|
|
}
|
|
|
|
/* If <CR> is intended to be the last character and the message
|
|
* (including the wanted <CR>) ends on an octet boundary, then
|
|
* another <CR> must be added together with a padding bit 0. The
|
|
* receiving entity will perform the carriage return function twice,
|
|
* but this will not result in misoperation as the definition of
|
|
* <CR> in clause 6.1.1 is identical to the definition of <CR><CR>.
|
|
*/
|
|
if (ussd && ((total_bits % 8) == 1))
|
|
*out |= '\r' << 1;
|
|
|
|
if (bits != 7)
|
|
out++;
|
|
|
|
if (ussd && ((total_bits % 8) == 0) && (in[len-1] == '\r')) {
|
|
*out = '\r';
|
|
out++;
|
|
}
|
|
|
|
*items_written = out - buf;
|
|
|
|
return buf;
|
|
}
|
|
|
|
unsigned char *pack_7bit(const unsigned char *in, long len, int byte_offset,
|
|
gboolean ussd, long *items_written,
|
|
unsigned char terminator)
|
|
{
|
|
int bits = 7 - (byte_offset % 7);
|
|
long i;
|
|
long total_bits;
|
|
unsigned char *buf;
|
|
|
|
if (len == 0 || !items_written)
|
|
return NULL;
|
|
|
|
if (len < 0) {
|
|
i = 0;
|
|
|
|
while (in[i] != terminator)
|
|
i++;
|
|
|
|
len = i;
|
|
}
|
|
|
|
total_bits = len * 7;
|
|
|
|
if (bits != 7)
|
|
total_bits += bits;
|
|
|
|
/* Round up number of bytes, must append <cr> if true */
|
|
if (ussd && ((total_bits % 8) == 0) && (in[len-1] == '\r'))
|
|
buf = g_new(unsigned char, (total_bits + 14) / 8);
|
|
else
|
|
buf = g_new(unsigned char, (total_bits + 7) / 8);
|
|
|
|
return pack_7bit_own_buf(in, len, byte_offset, ussd, items_written,
|
|
terminator, buf);
|
|
}
|