File: provisiontool

package info (click to toggle)
ofono 2.18-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 12,064 kB
  • sloc: ansic: 224,979; sh: 5,012; python: 4,040; makefile: 956
file content (729 lines) | stat: -rwxr-xr-x 23,049 bytes parent folder | download | duplicates (2)
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
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
#!/usr/bin/python3
#
# oFono - Open Source Telephony
# Copyright (C) 2023  Cruise, LLC
#
# SPDX-License-Identifier: GPL-2.0-only
import xml.etree.ElementTree as ET
import sys
import json
import bisect
from argparse import ArgumentParser, FileType
from pathlib import Path
import random
import struct
import ctypes

class ProviderInfo:
    sort_order_map = { v : pos for pos, v in
                      enumerate( ['name',
                                  'apn',
                                  'type',
                                  'protocol',
                                  'mmsc',
                                  'mmsproxy',
                                  'authentication',
                                  'username',
                                  'password',
                                  'tags'] ) }

    @classmethod
    def rawimport(cls, entry):
        if 'name' not in entry:
            raise SystemExit('No name for entry: ' + str(entry))

        info = ProviderInfo(entry['name'])

        for networkid in entry.get('ids', []):
            if not info.add_id(networkid):
                raise SystemExit('Invalid network id: ' + str(networkid))

        if 'spn' in entry:
            if not info.set_spn(entry['spn']):
                raise SystemExit('Invalid spn: ' + str(spn))

        for apn in entry.get('apns', []):
            if not info.add_context(apn):
                raise SystemExit('Invalid apn: ' + str(apn))

        if not info.is_valid():
            raise SystemExit('Invalid entry: ' + str(entry))

        return info

    def __init__(self, name):
        self.context_list = []
        self.mccmnc_list = []
        self.name = name
        self.spn = None

    @staticmethod
    def is_valid_id(id_string, expected_lengths):
        """
        Check if the identifier string is valid.

        Parameters:
        - id_string: The id string to check.
        - expected_lengths (tuple): A tuple representing the valid range of
          lengths.

        Returns:
        - bool: True if the MCC string is valid, False otherwise.
        """
        if not id_string.isdigit():
            return False

        if len(id_string) not in expected_lengths:
            return False

        if int(id_string) == 0:
            return False

        return True

    def add_mccmnc(self, mcc, mnc):
        if not self.is_valid_id(mcc, (3,)) or not self.is_valid_id(mnc, (2, 3)):
            return False

        bisect.insort(self.mccmnc_list, mcc + mnc)
        return True

    def add_id(self, mccmnc):
        if not self.is_valid_id(mccmnc, (5,6)):
            return False

        if int(mccmnc[:3]) == 0 or int(mccmnc[3:]) == 0:
            return False

        bisect.insort(self.mccmnc_list, mccmnc)
        return True

    def set_spn(self, spn):
        if len(spn) == 0 or len(spn) > 254:
            return False

        self.spn = spn
        return True

    def add_context(self, info):
        info = dict(sorted(info.items(),
                      key = lambda pair: self.sort_order_map[pair[0]]))
        self.context_list.append(info)

        return True

    def is_valid(self):
        return len(self.context_list) and len(self.mccmnc_list)

    def __str__(self):
        s = 'Provider \'' + self.name + '\''

        if (self.spn != None):
            s += ' [SPN:\'' + self.spn + '\']'

        s+= ' ' + str(self.mccmnc_list) + '\n'

        for context in self.context_list:
            s += '\t' + str(context) + '\n'

        return s

class MobileBroadbandProviderInfo:
    usage_to_type = { 'internet' : ['internet'],
                        'mms' : ['mms'],
                        'wap' : ['wap'],
                        'mms-internet-hipri' : ['internet', 'mms'],
                        'mms-internet-hipri-fota' : ['internet','mms'],
                     }
    @classmethod
    def type_from_usage(cls, usage):
        return cls.usage_to_type[usage]

    def __init__(self, xml_path):
        self.tree = ET.parse(xml_path)

    def parse(self, xml_path):
        providers = []

        try:
            tree = ET.parse(xml_path)
            root = tree.getroot()

            for provider in root.findall('.//provider'):
                name = provider.find('name')
                if name is None or not name.text:
                    continue;

                info = ProviderInfo(name.text)

                for networkid in provider.findall('gsm/network-id'):
                    info.add_mccmnc(networkid.get('mcc'), networkid.get('mnc'))

                for apn in provider.findall('gsm/apn'):
                    context = {}

                    context['apn'] = apn.get('value')
                    if context['apn'] == None:
                        continue

                    # Usage is missing for some APNs, skip such contexts for now
                    usage = apn.find('usage')
                    if usage is None or usage.get('type') is None:
                        continue;

                    context['type'] = self.type_from_usage(usage.get('type'))
                    if context['type'] == None:
                        sys.stderr.write("Unable to convert type: %s\n" %
                                            usage.get('type'))
                        continue

                    if 'mms' in context['type']:
                        mmsc = apn.find('mmsc')

                        # Ignore MMS contexts with no MMSC since it is needed
                        # to send messages
                        if mmsc is None or not mmsc.text:
                            continue

                        context['mmsc'] = mmsc.text

                        mmsproxy = apn.find('mmsproxy')
                        if mmsproxy is not None and mmsproxy.text:
                            context['mmsproxy'] = mmsproxy.text

                    username = apn.find('username')
                    if username is not None and username.text:
                        context['username'] = username.text

                    password = apn.find('password')
                    if password is not None and password.text:
                        context['password'] = password.text

                    authentication = apn.find('authentication')
                    if authentication is not None:
                        context['authentication'] = authentication.get('method')

                    context_name = apn.find('name')
                    if context_name != None:
                        context['name'] = context_name.text

                    info.add_context(context)

                if info.is_valid():
                    providers.append(info)

        except ET.ParseError as e:
            print("Error parsing XML: " + e)

        return providers

class ProvisionContext(ctypes.LittleEndianStructure):
    _pack_ = 1
    _fields_ = [
        ('type', ctypes.c_uint32),
        ('protocol', ctypes.c_uint32),
        ('authentication', ctypes.c_uint32),
        ('reserved', ctypes.c_uint32),
        ('name_offset', ctypes.c_uint64),
        ('apn_offset', ctypes.c_uint64),
        ('username_offset', ctypes.c_uint64),
        ('password_offset', ctypes.c_uint64),
        ('mmsproxy_offset', ctypes.c_uint64),
        ('mmsc_offset', ctypes.c_uint64),
        ('tags_offset', ctypes.c_uint64),
    ]

    authentication_dict = { 'chap' : 0, 'pap' : 1, 'none' : 2 }
    protocol_dict = { 'ipv4' : 0, 'ipv6' : 1, 'ipv4v6' : 2 }
    attrs = ['name', 'apn', 'username', 'password', 'mmsproxy', 'mmsc', 'tags']

    @classmethod
    def type_to_context_type(cls, types):
        r = 0

        for t in types:
            if t == 'internet':
                r |= 0x0001
            elif t == 'mms':
                r |= 0x0002
            elif t == 'wap':
                r |= 0x0004
            elif t == 'ims':
                r |= 0x0008
            elif t == 'supl':
                r |= 0x0010
            elif t == 'ia':
                r |= 0x0020

        return r

    def __init__(self, apn, strings):
        self.type = self.type_to_context_type(apn['type'])
        self.protocol = self.protocol_dict[apn.get('protocol', 'ipv4v6')]
        self.authentication = self.authentication_dict[apn.get('authentication',
                                                               'chap')]

        for s in self.attrs:
            offset = strings.add_string(apn.get(s, None))
            setattr(self, s + '_offset', offset)

class ProvisionData(ctypes.LittleEndianStructure):
    _pack_ = 1
    _fields_ = [
        ('spn_offset', ctypes.c_uint64),
        ('context_offset', ctypes.c_uint64)
    ]

    def __init__(self, spn, offset, strings):
        self.spn_offset = strings.add_string(spn)
        self.context_offset = offset

class ProvisionNode(ctypes.LittleEndianStructure):
    _pack_ = 1
    _fields_ = [
        ('bit_offsets', ctypes.c_uint64 * 2),
        ('mccmnc', ctypes.c_uint32),
        ('diff', ctypes.c_int32),
        ('provision_data_count', ctypes.c_uint64)
    ]

    style = "bold"
    fmt_connection = '\t"%s/%d" -> "%s/%d"[color="#%06x"];\n'
    fmt_declaration = '\t"%s/%d"[style=%s, color="#%06x"];\n'
    red = 0xff0000
    green = 0x00ff00

    def __init__(self, key, diff):
        self.bit = [None, None]
        self.key = key
        self.diff = diff
        self.entries = {}
        self.node_offset = 0

    def choose(self, key):
        return (key >> (31 - self.diff)) & 1

    def print_graphviz(self, f):
        f.write(self.fmt_declaration % (format(self.key, '032b'),
                                        self.diff, self.style,
                                        random.randint(0, 0x00ffffff)))
        f.write(self.fmt_connection % (format(self.key, '032b'), self.diff,
                                       format(self.bit[0].key, '032b'),
                                       self.bit[0].diff, self.red))
        f.write(self.fmt_connection % (format(self.key, '032b'), self.diff,
                                       format(self.bit[1].key, '032b'),
                                       self.bit[1].diff, self.green))

        if (self.diff < self.bit[0].diff):
            self.bit[0].print_graphviz(f)

        if (self.diff < self.bit[1].diff):
            self.bit[1].print_graphviz(f)

    def __str__(self):
        s = format(self.key, '032b') + '/' + str(self.diff)
        return s

class MccMncTree:
    @staticmethod
    def clz(v):
        count = 32
        while count and v:
            v = v >> 1
            count = count - 1

        return count

    @staticmethod
    def diff(key1, key2):
        xor = key1 ^ key2;
        return MccMncTree.clz(xor)

    def __init__(self):
        self.root = ProvisionNode(key = 0, diff = -1)
        self.root.bit[0] = self.root
        self.root.bit[1] = self.root
        self.n_nodes = 1

    def print_graphviz(self):
        f = open("step%d.dot" % self.n_nodes, "w")
        # Use 'dot -Tx11' to visualize
        f.write('digraph trie {\n')
        self.root.print_graphviz(f)
        f.write('}\n')
        f.close()

    def find_closest(self, key):
        parent = self.root
        child = self.root.bit[0]

        while parent.diff < child.diff:
            parent = child
            child = child.bit[child.choose(key)]

        return child

    def find(self, key):
        found = self.find_closest(key)
        if found.key == key:
            return found

        return None

    def insert(self, key, attr, value):
        node = self.find_closest(key);
        if node.key == key:
            node.entries[attr] = value
            return

        bit = self.diff(node.key, key)
        parent = self.root
        child = self.root.bit[0]

        while (parent.diff < child.diff) and (child.diff < bit):
            parent = child
            child = child.bit[child.choose(key)]

        node = ProvisionNode(key, bit)
        bit = node.choose(key)
        node.bit[bit] = node
        node.bit[not bit] = child

        node.entries[attr] = value

        if parent == self.root:
            self.root.bit[0] = node
        else:
            bit = parent.choose(key)
            parent.bit[bit] = node

        self.n_nodes += 1

    def traverse_recursive(self, node, bit, visitor):
        if node == self.root:
            return

        if node.diff <= bit:
            visitor.visit(node)
            return

        self.traverse_recursive(node.bit[0], node.diff, visitor)
        self.traverse_recursive(node.bit[1], node.diff, visitor)

    def traverse(self, visitor):
        self.traverse_recursive(self.root.bit[0], -1, visitor)

class StringAccumulator:
    def __init__(self):
        self.data = bytearray(b'\x00') # So offsets are never 0 used for NULL
        self.offsets = {}

    def add_string(self, s):
        if s is None:
            return 0

        if s in self.offsets:
            return self.offsets[s]

        offset = len(self.data)
        self.data.extend(s.encode('utf-8'))
        self.data.append(0)
        self.offsets[s] = offset

        return offset

    def get_bytes(self):
        return self.data

class ProvisionDatabase(ctypes.LittleEndianStructure):
    _pack_ = 1
    _fields_ = [
        ('version', ctypes.c_uint64),
        ('file_size', ctypes.c_uint64),
        ('header_size', ctypes.c_uint64),
        ('node_struct_size', ctypes.c_uint64),
        ('provision_data_struct_size', ctypes.c_uint64),
        ('context_struct_size', ctypes.c_uint64),
        ('nodes_offset', ctypes.c_uint64),
        ('nodes_size', ctypes.c_uint64),
        ('contexts_offset', ctypes.c_uint64),
        ('contexts_size', ctypes.c_uint64),
        ('strings_offset', ctypes.c_uint64),
        ('strings_size', ctypes.c_uint64)
    ]

    class CalculateNodeOffsetVisitor:
        def __init__(self):
            self.current_offset = 0
        def visit(self, node):
            node.node_offset = self.current_offset

            # Node data is followed by at least one ProvisionData object, with
            # the only exception being root, which has no data by definition
            self.current_offset += ctypes.sizeof(ProvisionNode)
            self.current_offset += (ctypes.sizeof(ProvisionData) *
                                    len(node.entries))

    class SerializeVisitor:
        def __init__(self, buffer):
            self.buffer = buffer

        def visit(self, node):
            # Node doesn't quite fit the C structure definition, so do this
            # manually by using struct.pack
            self.buffer.extend(struct.pack('<QQIiQ',
                                           node.bit[0].node_offset,
                                           node.bit[1].node_offset,
                                           node.key, node.diff,
                                           len(node.entries)))

            for spn in sorted(node.entries):
                pd = node.entries[spn]
                self.buffer.extend(bytes(pd))

    def __init__(self, provider_infos):
        self.strings = StringAccumulator()
        self.contexts = bytearray()
        self.tree = MccMncTree()

        for info in provider_infos:
            pd = ProvisionData(info.spn, len(self.contexts), self.strings)

            self.contexts.extend(struct.pack('<Q', len(info.context_list)))

            for context in info.context_list:
                self.contexts.extend(bytes(ProvisionContext(context,
                                                            self.strings)))

            for mccmnc in info.mccmnc_list:
                # Sort None spns as '' so they're first in the list when
                # the SerializeVisitor sorts the entries dict
                spn = info.spn if info.spn is not None else ''

                # 2 and 3 byte MNCs are treated differently, even if evaluate
                # to the same integer.  For example, 02 and 002 are different
                # MNCs.  In practice this doesn't actually happen except on
                # test networks, but account for this possibility by using the
                # upper 10 bits for the MCC, followed by a single bit which
                # signifies whether a 3 byte MNC is used, followed by 10 bits
                # of the MNC
                key = int(mccmnc[:3]) << 11 | int(mccmnc[3:])
                if len(mccmnc[3:]) == 3:
                    key |= 1 << 10

                self.tree.insert(key, spn, pd)

        visitor = self.CalculateNodeOffsetVisitor()
        visitor.visit(self.tree.root)
        self.tree.traverse(visitor)

        self.version = 2
        self.header_size = ctypes.sizeof(ProvisionDatabase)
        self.file_size = self.header_size
        self.node_struct_size = ctypes.sizeof(ProvisionNode)
        self.provision_data_struct_size = ctypes.sizeof(ProvisionData)
        self.context_struct_size = ctypes.sizeof(ProvisionContext)
        self.nodes_offset = self.header_size
        self.nodes_size = visitor.current_offset
        self.file_size += self.nodes_size
        self.contexts_offset = self.nodes_offset + self.nodes_size
        self.contexts_size = len(self.contexts)
        self.file_size += self.contexts_size
        self.strings_offset = self.contexts_offset + self.contexts_size
        self.strings_size = len(self.strings.get_bytes())
        self.file_size += self.strings_size

    def serialize(self):
        buffer = bytearray()
        buffer.extend(bytes(self))

        visitor = self.SerializeVisitor(buffer)
        visitor.visit(self.tree.root)
        self.tree.traverse(visitor)

        buffer.extend(self.contexts)
        buffer.extend(self.strings.get_bytes())

        return buffer

class ProviderInfoJSONEncoder(json.JSONEncoder):
    def default(self, obj):
        if isinstance(obj, ProviderInfo):
            asdict = { 'name' : obj.name, 'ids' : obj.mccmnc_list }

            if (obj.spn != None):
                asdict['spn'] = obj.spn

            asdict.update({'apns' : obj.context_list})
            return asdict

        return json.JSONEncoder.default(self, obj)

def mbpi_convert(args):
    xml_path = '/usr/share/mobile-broadband-provider-info/serviceproviders.xml'
    mbpi = MobileBroadbandProviderInfo(xml_path)
    provider_infos = mbpi.parse(xml_path)

    try:
        if args.outfile is None:
            out = sys.stdout
        else:
            out = args.outfile.open('w', encoding='utf-8')

        with out as outfile:
            json.dump(provider_infos, outfile, ensure_ascii=False, indent=2,
                      cls=ProviderInfoJSONEncoder)
    except ValueError as e:
        raise SystemExit(e)

def generate(args):
    try:
        json_dict = json.load(args.infile)
    except ValueError as e:
        raise SystemExit(e)

    provider_infos = []

    for entry in json_dict:
        info = ProviderInfo.rawimport(entry)
        provider_infos.append(info)

    db = ProvisionDatabase(provider_infos)
    with args.outfile.open('wb') as outfile:
        outfile.write(db.serialize())

def selftest(args):
    tree = MccMncTree()

    # Generate random key this many times and insert it into the tree
    # There will be some collisions, so count the number of items inserted
    # Then run the lookup and make sure the same number of items can be found
    times = 100000
    for i in range(0, times):
        key = random.randint(10000, 999999)
        tree.insert(key, None, None)

    n_inserted = tree.n_nodes
    print("Created a tree with %d nodes (1 root)" % n_inserted)

    n_found = 0
    expected_keys = []

    for i in range(10000, 1000000):
        if tree.find(i):
            n_found += 1
            expected_keys.append(i)

    expected_keys = sorted(expected_keys)

    print("Found %d nodes (not including root)" % n_found)
    assert n_found == n_inserted - 1

    class GetKeysVisitor:
        def __init__(self):
            self.keys = []

        def visit(self, node):
            self.keys.append(node.key)

    visitor = GetKeysVisitor()
    tree.traverse(visitor)
    assert visitor.keys == expected_keys

    sample_json = """[
    {
      "name": "Operator XYZ",
      "ids": [
        "99955", "99956", "99901", "99902"
      ],
      "apns": [
        {
          "name": "Internet",
          "apn": "internet",
          "type": [
            "internet"
          ],
          "authentication": "none",
          "protocol": "ipv4"
        },
        {
          "name": "IMS+MMS",
          "apn": "imsmms",
          "type": [
            "ims", "mms"
          ],
          "mmsc": "foobar.mmsc:80",
          "mmsproxy": "mms.proxy.net",
          "authentication": "pap",
          "protocol": "ipv6"
        }
      ]
    },
    {
      "name": "Operator ZYX",
      "ids": [
        "99998", "99999", "99901", "99902"
      ],
      "spn": "ZYX",
      "apns": [
        {
          "name": "ZYX",
          "apn": "zyx",
          "type": [
            "internet"
          ],
          "authentication": "none",
          "protocol": "ipv4"
        }
      ]
    }
    ]"""
    try:
        json_dict = json.loads(sample_json)
    except ValueError as e:
        raise SystemExit(e)

    provider_infos = []

    for entry in json_dict:
        info = ProviderInfo.rawimport(entry)
        provider_infos.append(info)

    db = ProvisionDatabase(provider_infos)
    expected_strings = bytearray(b'\x00Internet\x00internet\x00IMS+MMS\x00' +
                b'imsmms\x00mms.proxy.net\x00foobar.mmsc:80\x00ZYX\x00zyx\x00')
    assert(expected_strings == db.strings.get_bytes())

    with open('sample.db', 'wb') as outfile:
        outfile.write(db.serialize())

if __name__ == "__main__":
    parser = ArgumentParser(description='Parse command line arguments')
    subparsers = parser.add_subparsers(title='subcommands', dest='command')

    # mbpi-convert command
    mbpi_convert_parser = subparsers.add_parser('mbpi-convert',
                        help='Convert mobile-broadband-provider-info database')
    mbpi_convert_parser.add_argument('--outfile', type=Path, default=None,
                        help='Output file path', required=False,)
    mbpi_convert_parser.set_defaults(func=mbpi_convert)

    # generate command
    generate_parser = subparsers.add_parser('generate',
                                            help='Generate binary provider db')
    generate_parser.add_argument('--outfile', type=Path, default='provision.db',
                                 help='Output file path', required=False)
    generate_parser.add_argument('--infile', type=FileType(encoding='utf-8'),
                                 help='Input JSON db', default=sys.stdin)
    generate_parser.set_defaults(func=generate)

    # selftest command
    selftest_parser = subparsers.add_parser('selftest',
                        help='Run self-tests')
    selftest_parser.set_defaults(func=selftest)

    args = parser.parse_args()
    if hasattr(args, 'func'):
        args.func(args)
    else:
        parser.print_help()