1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
|
/*
*
* 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 <string.h>
#include <glib.h>
#include "driver.h"
#include "simutil.h"
#include "util.h"
struct pnn_operator {
char *longname;
gboolean long_ci;
char *shortname;
gboolean short_ci;
char *info;
};
struct spdi_operator {
char mcc[OFONO_MAX_MCC_LENGTH + 1];
char mnc[OFONO_MAX_MNC_LENGTH + 1];
};
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;
};
/* Parse ASN.1 Basic Encoding Rules TLVs per ISO/IEC 7816 */
static const guint8 *ber_tlv_find_by_tag(const guint8 *pdu, guint8 in_tag,
int in_len, int *out_len)
{
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;
}
static char *sim_network_name_parse(const unsigned char *buffer, int length,
gboolean *add_ci)
{
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;
}
static void parse_mcc_mnc(const guint8 *bcd, char *mcc, char *mnc)
{
static const char digit_lut[] = "0123456789*#abd\0";
guint8 digit;
digit = (bcd[0] >> 0) & 0xf;
*mcc++ = digit_lut[digit];
digit = (bcd[0] >> 4) & 0xf;
*mcc++ = digit_lut[digit];
digit = (bcd[1] >> 0) & 0xf;
*mcc++ = digit_lut[digit];
digit = (bcd[2] >> 0) & 0xf;
*mnc++ = digit_lut[digit];
digit = (bcd[2] >> 4) & 0xf;
*mnc++ = digit_lut[digit];
digit = (bcd[1] >> 4) & 0xf;
*mnc++ = digit_lut[digit];
}
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);
}
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;
}
|