ofono/src/simutil.c

376 lines
7.7 KiB
C
Raw Normal View History

2009-07-09 21:40:58 +00:00
/*
*
* 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
2009-07-11 00:07:23 +00:00
#include <string.h>
2009-07-09 21:40:58 +00:00
#include <glib.h>
2009-07-13 21:12:22 +00:00
#include "driver.h"
2009-07-09 21:40:58 +00:00
#include "simutil.h"
2009-07-11 00:07:23 +00:00
#include "util.h"
2009-07-09 21:40:58 +00:00
2009-07-13 23:30:17 +00:00
struct pnn_operator {
char *longname;
gboolean long_ci;
char *shortname;
gboolean short_ci;
char *info;
};
2009-07-13 21:12:22 +00:00
struct spdi_operator {
char mcc[OFONO_MAX_MCC_LENGTH + 1];
char mnc[OFONO_MAX_MNC_LENGTH + 1];
};
2009-07-13 23:30:17 +00:00
struct opl_operator {
char mcc[OFONO_MAX_MCC_LENGTH + 1];
char mnc[OFONO_MAX_MNC_LENGTH + 1];
guint16 lac_tac_low;
guint16 lac_tac_high;
guint8 id;
};
2009-07-09 21:40:58 +00:00
/* Parse ASN.1 Basic Encoding Rules TLVs per ISO/IEC 7816 */
2009-07-13 23:30:17 +00:00
static const guint8 *ber_tlv_find_by_tag(const guint8 *pdu, guint8 in_tag,
int in_len, int *out_len)
2009-07-09 21:40:58 +00:00
{
guint8 tag;
int len;
const guint8 *end = pdu + in_len;
do {
while (pdu < end && (*pdu == 0x00 || *pdu == 0xff))
pdu ++;
if (pdu == end)
break;
tag = *pdu ++;
if (!(0x1f & ~tag))
while (pdu < end && (*pdu ++ & 0x80));
if (pdu == end)
break;
for (len = 0; pdu + 1 < end && (*pdu & 0x80);
len = (len | (*pdu ++ & 0x7f)) << 7);
if (*pdu & 0x80)
break;
len |= *pdu ++;
if (tag == in_tag && pdu + len <= end) {
if (out_len)
*out_len = len;
return pdu;
}
pdu += len;
} while (pdu < end);
return NULL;
}
2009-07-11 00:07:23 +00:00
2009-07-13 23:30:17 +00:00
static char *sim_network_name_parse(const unsigned char *buffer, int length,
gboolean *add_ci)
2009-07-11 00:07:23 +00:00
{
char *ret = NULL;
unsigned char *endp;
unsigned char dcs;
int i;
gboolean ci = FALSE;
if (length < 1)
return NULL;
dcs = *buffer ++;
length --;
/* "The MS should add the letters for the Country's Initials and a
* separator (e.g. a space)" */
if (is_bit_set(dcs, 4))
ci = TRUE;
switch (dcs & (7 << 4)) {
case 0x00:
endp = memchr(buffer, 0xff, length);
if (endp)
length = endp - buffer;
ret = convert_gsm_to_utf8(buffer, length,
NULL, NULL, 0xff);
break;
case 0x10:
if ((length % 2) == 1) {
if (buffer[length - 1] != 0xff)
return NULL;
length = length - 1;
}
for (i = 0; i < length; i += 2)
if (buffer[i] == 0xff && buffer[i + 1] == 0xff)
break;
ret = g_convert(buffer, length, "UTF-8//TRANSLIT", "UCS-2BE",
NULL, NULL, NULL);
break;
}
if (add_ci)
*add_ci = ci;
return ret;
}
2009-07-13 17:31:23 +00:00
2009-07-13 21:12:22 +00:00
static void parse_mcc_mnc(const guint8 *bcd, char *mcc, char *mnc)
{
static const char digit_lut[] = "0123456789*#abd\0";
2009-07-13 21:12:22 +00:00
guint8 digit;
digit = (bcd[0] >> 0) & 0xf;
*mcc++ = digit_lut[digit];
2009-07-13 21:12:22 +00:00
digit = (bcd[0] >> 4) & 0xf;
*mcc++ = digit_lut[digit];
2009-07-13 21:12:22 +00:00
digit = (bcd[1] >> 0) & 0xf;
*mcc++ = digit_lut[digit];
2009-07-13 21:12:22 +00:00
digit = (bcd[2] >> 0) & 0xf;
*mnc++ = digit_lut[digit];
2009-07-13 21:12:22 +00:00
digit = (bcd[2] >> 4) & 0xf;
*mnc++ = digit_lut[digit];
2009-07-13 21:12:22 +00:00
digit = (bcd[1] >> 4) & 0xf;
*mnc++ = digit_lut[digit];
2009-07-13 21:12:22 +00:00
}
static gint spdi_operator_compare(gconstpointer a, gconstpointer b)
{
const struct spdi_operator *opa = a;
const struct spdi_operator *opb = b;
gint r;
if (r = strcmp(opa->mcc, opb->mcc))
return r;
return strcmp(opa->mnc, opb->mnc);
}
struct sim_spdi *sim_spdi_new(const guint8 *tlv, int length)
{
const guint8 *plmn_list;
struct sim_spdi *spdi;
struct spdi_operator *oper;
int tlv_length;
if (length <= 5)
return NULL;
plmn_list = ber_tlv_find_by_tag(tlv, 0x80, length, &tlv_length);
if (!plmn_list)
return NULL;
spdi = g_new0(struct sim_spdi, 1);
for (tlv_length /= 3; tlv_length--; plmn_list += 3) {
if ((plmn_list[0] & plmn_list[1] & plmn_list[2]) == 0xff)
continue;
oper = g_new0(struct spdi_operator, 1);
parse_mcc_mnc(plmn_list, oper->mcc, oper->mnc);
spdi->operators = g_slist_insert_sorted(spdi->operators, oper,
spdi_operator_compare);
}
return spdi;
}
gboolean sim_spdi_lookup(struct sim_spdi *spdi,
const char *mcc, const char *mnc)
{
struct spdi_operator spdi_op;
g_strlcpy(spdi_op.mcc, mcc, sizeof(spdi_op.mcc));
g_strlcpy(spdi_op.mnc, mnc, sizeof(spdi_op.mnc));
return g_slist_find_custom(spdi->operators, &spdi_op,
spdi_operator_compare) != NULL;
}
void sim_spdi_free(struct sim_spdi *spdi)
{
g_slist_foreach(spdi->operators, (GFunc)g_free, NULL);
g_slist_free(spdi->operators);
g_free(spdi);
}
2009-07-13 23:30:17 +00:00
static void pnn_operator_free(struct pnn_operator *oper)
{
g_free(oper->info);
g_free(oper->shortname);
g_free(oper->longname);
}
struct sim_eons *sim_eons_new(int pnn_records)
{
struct sim_eons *eons = g_new0(struct sim_eons, 1);
eons->pnn_list = g_new0(struct pnn_operator, pnn_records);
eons->pnn_max = pnn_records;
return eons;
}
gboolean sim_eons_pnn_is_empty(struct sim_eons *eons)
{
return !eons->pnn_valid;
}
void sim_eons_add_pnn_record(struct sim_eons *eons, int record,
const guint8 *tlv, int length)
{
const char *name;
int namelength;
gboolean add_ci;
struct pnn_operator *oper = &eons->pnn_list[record-1];
name = ber_tlv_find_by_tag(tlv, 0x43, length, &namelength);
if (!name || !namelength)
return;
oper->longname = sim_network_name_parse(name, namelength,
&oper->long_ci);
name = ber_tlv_find_by_tag(tlv, 0x45, length, &namelength);
if (name && namelength)
oper->shortname = sim_network_name_parse(name, namelength,
&oper->short_ci);
name = ber_tlv_find_by_tag(tlv, 0x80, length, &namelength);
if (name && namelength)
oper->info = sim_string_to_utf8(name, namelength);
eons->pnn_valid = TRUE;
}
static struct opl_operator *opl_operator_alloc(const guint8 *record)
{
struct opl_operator *oper = g_new0(struct opl_operator, 1);
parse_mcc_mnc(record, oper->mcc, oper->mnc);
record += 3;
oper->lac_tac_low = (record[0] << 8) | record[1];
record += 2;
oper->lac_tac_high = (record[0] << 8) | record[1];
record += 2;
oper->id = record[0];
return oper;
}
void sim_eons_add_opl_record(struct sim_eons *eons,
const guint8 *tlv, int length)
{
struct opl_operator *oper;
oper = opl_operator_alloc(tlv);
if (oper->id > eons->pnn_max) {
g_free(oper);
return;
}
eons->opl_list = g_slist_prepend(eons->opl_list, oper);
}
void sim_eons_optimize(struct sim_eons *eons)
{
eons->opl_list = g_slist_reverse(eons->opl_list);
}
void sim_eons_free(struct sim_eons *eons)
{
int i;
for (i = 0; i < eons->pnn_max; i++)
pnn_operator_free(eons->pnn_list + i);
g_free(eons->pnn_list);
g_slist_foreach(eons->opl_list, (GFunc)g_free, NULL);
g_slist_free(eons->opl_list);
g_free(eons);
}
static gint opl_operator_compare(gconstpointer a, gconstpointer b)
{
}
const char *sim_eons_lookup(struct sim_eons *eons,
const char *mcc, const char *mnc, guint16 lac)
{
GSList *l;
const struct opl_operator *opl;
int i;
for (l = eons->opl_list; l; l = l->next) {
opl = l->data;
for (i = 0; i < OFONO_MAX_MCC_LENGTH; i++)
if (mcc[i] != opl->mcc[i] &&
!(opl->mcc[i] == 'd' && mcc[i]))
continue;
for (i = 0; i < OFONO_MAX_MNC_LENGTH; i++)
if (mnc[i] != opl->mnc[i] &&
!(opl->mnc[i] == 'd' && mnc[i]))
continue;
if (opl->lac_tac_low == 0 && opl->lac_tac_high == 0xfffe)
break;
if ((lac >= opl->lac_tac_low) && (lac <= opl->lac_tac_high))
break;
}
if (!l)
return NULL;
opl = l->data;
/* 0 is not a valid record id */
if (opl->id == 0)
return NULL;
return eons->pnn_list[opl->id - 1].longname;
}