sel4-sys 0.0.28

Rust interface to the seL4 kernel
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

#!/usr/bin/env python

#
# Copyright 2014, NICTA
#
# This software may be distributed and modified according to the terms of
# the BSD 2-Clause license. Note that NO WARRANTY is provided.
# See "LICENSE_BSD2.txt" for details.
#
# @TAG(NICTA_BSD)
#

import sys
import os.path
import optparse
import re

## We assume length tp > 0
def parse_type(tps):
    def helper(tps):
        tp   = tps[0]
        rest = tps[1:]

        if tp == 'Word':
            return ('Word', rest[0]), rest[1:]

        elif tp == 'Ptr':
            tp2, rest = helper(rest)
            return ('Ptr', tp2), rest

        elif tp == 'Unit':
            return ('Unit',) , rest
        
        elif tp == 'Array':
            tp2, rest = helper(rest)
            # arrays are Array ... sz
            return ('Array', tp2, rest[0]), rest[1:]        

        else:
            return ('Base', tp), rest

    return helper(tps)[0]

def splitBy(f, xs):
    def fold(acc, v):
        if f(v):
            acc[0].append(acc[1])
            return (acc[0], [])
        else:
            acc[1].append(v)
            return acc

    return (reduce(fold, xs, ([], [])))[0]

def handle_one_struct(s):
    def hdl_fld(f):
        fl, tp = f.split(':')
        return (fl.lstrip(), parse_type(tp.split(' ')))
        
    name = s[0]
    return (name, map(hdl_fld, s[1:]))

def dict_from_list(ls):
    a = {}
    for k, v in ls:
        a[k] = v
        
    return a

def is_base(x):
    return (x[0] == 'Base')

def base_name(x):
    return x[1]

# This assumes that membership is a DAG which is the case in C
# We could memoize, doesn't seem worth it ...
def paths_to_type(mp, f, start):
    def handle_one(fld):
        name, tp = fld
        if f(tp):
            return [([start + '.' + name], tp)]
        elif is_base(tp):
            res = paths_to_type(mp, f, base_name(tp))
            # prepend paths by name (why no Cons in python? grrr)
            map(lambda x: (x[0].insert(0, name)), res)
            return res
        else:
            return []

    # init case
    start_tp = ('Base', start)
    if f(start_tp):
        return [([], start_tp)]
    else:
        res  = map(handle_one, mp[start])    
        return (reduce(lambda x, y: x + y, res))

def build_types(file):
    in_file = open(file, 'r')

    lines = map(lambda x: x.rstrip(), in_file.readlines())

    in_file.close()
    
    grps = splitBy(lambda x: x == '', lines)
    
    # the order information will be important if we want _CL for all types
    sts = dict_from_list(map(handle_one_struct, grps))

    return sts


def print_graph(filename, out_file):
    mp = build_types(filename)

    print >>out_file, 'digraph types {'
    for k, flds in mp.iteritems():
        for fld, tp in flds:
            #if is_base(tp):
            print >> out_file, '\t "%s" -> "%s" [label="%s"]' % \
                               (k, base_name(tp), fld)
    print >>out_file, '}'    
    
## Toplevel

if __name__ == '__main__':
    print_graph('umm_types.txt', sys.stdout)