codegen.py 16.2 KB
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
import inspect, collections
from zinc.compil import ast, CompilationError

##
## to be included in the generated source code
##

event = init = addsucc = itersucc = None

def dumpmarking (m) :
    if hasattr(m, "ident") :
        return "[%s] %s" % (m.ident, {p : list(t) for p, t in m.items()})
    else :
        return str({p : list(t) for p, t in m.items()})

def statespace (print_states, print_succs, print_dead) :
    i = init()
    i.ident = 0
    todo = collections.deque([i])
    seen = {i : 0}
    dead = 0
    while todo:
        state = todo.popleft()
        succ = set()
        addsucc(state, succ)
        if not succ :
            dead += 1
        if (print_dead and not succ) or print_states :
            print(dumpmarking(state))
        for s in succ :
            if s in seen :
                s.ident = seen[s]
            else :
                s.ident = seen[s] = len(seen)
                todo.append(s)
            if print_succs :
                print(" >", dumpmarking(s))
    return len(seen), dead

def lts () :
    i = init()
    i.ident = 0
    todo = collections.deque([i])
    seen = {i : 0}
    while todo:
        state = todo.popleft()
        print(dumpmarking(state))
        for trans, mode, sub, add in itersucc(state) :
            succ = state - sub + add
            if succ in seen :
                succ.ident = seen[succ]
            else :
                succ.ident = seen[succ] = len(seen)
                todo.append(succ)
            print("@ %s = %s" % (trans, mode))
            print(" -", dumpmarking(sub))
            print(" +", dumpmarking(add))
            print(" >", dumpmarking(succ))

def main () :
    import argparse
    parser = argparse.ArgumentParser()
    parser.add_argument("-s", dest="size",
                        default=False, action="store_true",
                        help="only print size")
    group = parser.add_mutually_exclusive_group(required=True)
    group.add_argument("-g", dest="mode", action="store_const", const="g",
                       help="print marking graph")
    group.add_argument("-l", dest="mode", action="store_const", const="l",
                       help="print LTS (detailled marking graph)")
    group.add_argument("-m", dest="mode", action="store_const", const="m",
                       help="only print markings")
    group.add_argument("-d", dest="mode", action="store_const", const="d",
                       help="only print deadlocks")
    args = parser.parse_args()
    if args.mode in "gml" and args.size :
        n, _ = statespace(False, False, False)
        print("%s reachable states" % n)
    elif args.mode == "d" and args.size :
        _, n = statespace(False, False, False)
        print("%s deadlocks")
    elif args.mode == "g" :
        statespace(True, True, False)
    elif args.mode in "m" :
        statespace(True, False, False)
    elif args.mode in "d" :
        statespace(False, False, True)
    elif args.mode == "l" :
        lts()

class CodeGenerator (ast.CodeGenerator) :
    def visit_Module (self, node) :
        self.write("# %s\n\nNET = %r\n" % (self.timestamp(), node.name))
        self.write("import itertools, collections")
        self.children_visit(node.body)
        self.write("\n%s" % inspect.getsource(dumpmarking))
        self.write("\n%s" % inspect.getsource(statespace))
        self.write("\n%s" % inspect.getsource(lts))
        self.write("\n%s" % inspect.getsource(main))
        self.write("\nif __name__ == '__main__':"
                   "\n    main()\n")
    def visit_DefineMarking (self, node) :
        self.fill("from zinc.nets import Marking, mset, dot, hdict")
        self.fill("event = collections.namedtuple('event', "
                  "['trans', 'mode', 'sub', 'add'])\n")
    def visit_DefSuccProc (self, node) :
        self.fill("def ")
        self.visit(node.name)
        self.write(" (%s, %s):" % (node.marking, node.succ))
        with self.indent() :
            if node.name.trans :
                self.fill(repr("successors of %r" % node.name.trans))
            else :
                self.fill(repr("successors for all transitions"))
        self.children_visit(node.body, True)
        self.write("\n")
    def visit_Declare (self, node) :
        pass
    def visit_Assign (self, node) :
        self.fill("%s = " % node.variable)
        self.visit(node.expr)
    def visit_AssignItem (self, node) :
        self.fill("%s = %s" % (node.variable, node.container))
        for p in node.path :
            self.write("[%s]" % p)
    def visit_IfInput (self, node) :
        self.fill("if %s:" % " and ".join("%s(%r)" % (node.marking, p.name)
                                          for p in node.places))
        self.children_visit(node.body, True)
    def visit_IfToken (self, node) :
        self.fill("if %s in %s(%r):" % (node.token, node.marking, node.place.name))
        self.children_visit(node.body, True)
    def visit_IfNoToken (self, node) :
        self.fill("if %s not in %s(%r):" % (node.token, node.marking, node.place.name))
        self.children_visit(node.body, True)
    def visit_IfNoTokenSuchThat (self, node) :
        self.fill("if not any(")
        self.visit(node.guard)
        self.write(" for %s in %s(%r)):"
                   % (node.variable, node.marking, node.place.name))
        self.children_visit(node.body, True)
    def visit_IfPlace (self, node) :
        self.fill("if %s == %s(%r):" % (node.variable, node.marking, node.place.name))
        self.children_visit(node.body, True)
    def visit_IfAllType (self, node) :
        if node.place.type :
            var = node.CTX.names.fresh()
            self.fill("if all(isinstance(%s, %s) for %s in %s):"
                      % (var, node.place.type, var, node.variable))
            self.children_visit(node.body, True)
        else :
            self.children_visit(node.body, False)
    def visit_GetPlace (self, node) :
        self.fill("%s = %s(%r)" % (node.variable, node.marking, node.place.name))
    def visit_ForeachToken (self, node) :
        self.fill("for %s in %s(%r):" % (node.variable, node.marking, node.place.name))
        self.children_visit(node.body, True)
    def visit_Break (self, node) :
        self.fill("break")
    def visit_Expr (self, node) :
        self.write(node.source)
    def visit_TrueConst (self, node) :
        self.write("True")
    def visit_FalseConst (self, node) :
        self.write("False")
    def visit_And (self, node) :
        for i, item in enumerate(node.items) :
            if i > 0 :
                self.write(" and ")
            self.visit(item)
    def visit_Eq (self, node) :
        self.write("(")
        self.visit(node.left)
        self.write(") == (")
        self.visit(node.right)
        self.write(")")
    def visit_If (self, node) :
        self.fill("if ")
        self.visit(node.guard)
        self.write(":")
        self.children_visit(node.body, True)
    def _matchtype (self, var, typ) :
        if typ is None :
            pass
        elif isinstance(typ, tuple) :
            yield True, "isinstance(%s, tuple)" % var
            yield True, "len(%s) == %s" % (var, len(typ))
            for i, sub in enumerate(typ) :
                for cond in self._matchtype("%s[%s]" % (var, i), sub) :
                    yield cond
        elif typ.endswith("()") :
            yield False, "%s(%s)" % (typ[:-2], var)
        else :
            yield False, "isinstance(%s, %s)" % (var, typ)
    def visit_IfType (self, node) :
        match = list(c[1] for c in self._matchtype(node.token, node.place.type))
        if not match :
            self.children_visit(node.body, False)
        else :
            self.fill("if %s:" % " and ".join(match))
            self.children_visit(node.body, True)
    def visit_IfTuple (self, node) :
        match = list(c[1] for c in self._matchtype(node.token, node.place.type)
                     if c[0])
        if not match :
            self.children_visit(node.body, False)
        else :
            self.fill("if %s:" % " and ".join(match))
            self.children_visit(node.body, True)
    def _pattern (self, nest) :
        return "(%s)" % ", ".join(self._pattern(n) if isinstance(n, tuple) else n
                                  for n in nest)
    def _marking (self, var, marking, blame) :
        self.fill("%s = Marking({" % var)
        whole = []
        for i, (place, tokens) in enumerate(marking.items()) :
            if i > 0 :
                self.write(", ")
            self.write("%r: mset([" % place)
            first = True
            for tok in tokens :
                if isinstance(tok, tuple) :
                    if tok[0] == "mset" :
                        whole.append((place, tok[1]))
                    else :
                        raise CompilationError("unsupported type '%s(%s)'" % tok,
                                               blame)
                else :
                    if not first :
                        self.write(", ")
                    first = False
                    if isinstance(tok, ast.Pattern) :
                        self.write(self._pattern(tok.matcher))
                    else :
                        self.write(tok)
            self.write("])")
        self.write("})")
        for place, tokens in whole :
            self.fill("%s[%r].update(%s)" % (var, place, tokens))
    def visit_IfEnoughTokens (self, node) :
        if not hasattr(node.CTX, "subvar") :
            node.CTX.subvar = node.NAMES.fresh(base="sub")
        if not hasattr(node.CTX, "addvar") :
            node.CTX.addvar = node.NAMES.fresh(base="add")
        subtest = False
        if node.test :
            if not hasattr(node.CTX, "testvar") :
                node.CTX.testvar = node.NAMES.fresh(base="test", add=True)
            self._marking(node.CTX.testvar, node.test, node.BLAME)
            self.fill("if %s <= %s:" % (node.CTX.testvar, node.old))
            indent = 1
        elif node.sub :
            subtest = True
            self._marking(node.CTX.subvar, node.sub, node.BLAME)
            self.fill("if %s <= %s:" % (node.CTX.subvar, node.old))
            indent = 1
        else :
            indent = 0
        with self.indent(indent) :
            if node.sub and not subtest :
                self._marking(node.CTX.subvar, node.sub, node.BLAME)
            if node.add :
                self._marking(node.CTX.addvar, node.add, node.BLAME)
            self.children_visit(node.body, False)
    def visit_AddSucc (self, node) :
        if node.sub and node.add :
            self.fill("%s.add(%s - %s + %s)" % (node.succ, node.old,
                                                node.CTX.subvar,
                                                node.CTX.addvar))
        elif node.sub :
            self.fill("%s.add(%s - %s)" % (node.succ, node.old, node.CTX.subvar))
        elif node.add :
            self.fill("%s.add(%s + %s)" % (node.succ, node.old, node.CTX.addvar))
        else :
            self.fill("%s.add(%s.copy())" % (node.succ, node.old))
    def visit_YieldEvent (self, node) :
        mvar = node.NAMES.fresh(base="mode")
        self.fill("%s = hdict({" % mvar)
        for i, v in enumerate(node.CTX.trans.vars()) :
            if i > 0 :
                self.write(", ")
            self.write("%r: %s" % (v, node.CTX.bound[v]))
        self.write("})")
        if node.sub and node.add :
            self.fill("yield event(%r, %s, %s, %s)"
                      % (node.CTX.trans.name, mvar, node.CTX.subvar, node.CTX.addvar))
        elif node.sub :
            self.fill("yield event(%r, %s, %s, Marking())"
                      % (node.CTX.trans.name, mvar, node.CTX.subvar))
        elif node.add :
            self.fill("yield event(%r, %s, Marking(), %s)"
                      % (node.CTX.trans.name, mvar, node.CTX.addvar))
        else :
            self.fill("yield event(%r, %s, Marking(), Marking())"
                      % (node.CTX.trans.name, mvar))
    def visit_DefSuccIter (self, node) :
        self.fill("def ")
        self.visit(node.name)
        self.write(" (%s):" % node.marking)
        with self.indent() :
            if node.name.trans :
                self.fill(repr("successors of %r" % node.name.trans))
                self.children_visit(node.body, False)
            else :
                self.fill("return itertools.chain(")
                last = len(node.body) - 1
                for i, name in enumerate(node.body) :
                    if i > 0 :
                        ######### "return itertools.chain("
                        self.fill("                       ")
                    self.visit(name)
                    self.write("(%s)" % node.marking)
                    if i < last :
                        self.write(",")
                    else :
                        self.write(")")
        self.write("\n")
    def visit_DefSuccFunc (self, node) :
        self.fill("def ")
        self.visit(node.name)
        self.write(" (%s):" % node.marking)
        with self.indent() :
            if node.name.trans :
                self.fill(repr("successors of %r" % node.name.trans))
            else :
                self.fill(repr("successors for all transitions"))
        self.children_visit(node.body, True)
        self.write("\n")
    def visit_InitSucc (self, node) :
        self.fill("%s = set()" % node.name)
    def visit_CallSuccProc (self, node) :
        self.fill()
        self.visit(node.name)
        self.write("(%s, %s)" % (node.marking, node.succ))
    def visit_ReturnSucc (self, node) :
        self.fill("return %s" % node.name)
    def visit_DefInitFunc (self, node) :
        self.fill("def ")
        self.visit(node.name)
        self.write(" ():")
        with self.indent() :
            self.fill(repr("initial marking"))
            self.fill("return Marking({")
            for i, place in enumerate(node.marking) :
                if i > 0 :
                    self.write(", ")
                self.visit(place)
        self.write("})\n")
    def visit_PlaceMarking (self, node) :
        self.write("%r: mset([" % node.place)
        for i, tok in enumerate(node.tokens) :
            if i > 0 :
                self.write(", %s" % tok.source)
            else :
                self.write(tok.source)
        self.write("])")
    def visit_SuccProcTable (self, node) :
        self.fill("# map transitions names to successor procs")
        self.fill("# '' maps to all-transitions proc")
        self.fill("succproc = {")
        for i, (trans, name) in enumerate(sorted(self.succproc.items())) :
            if i == 0 == len(self.succproc) - 1 :
                self.write("%r: %s}" % (trans, name))
            elif i == 0 :
                self.write("%r: %s," % (trans, name))
            elif i == len(self.succproc) - 1 :
                self.fill("            %r: %s}" % (trans, name))
            else :
                self.fill("            %r: %s," % (trans, name))
        self.write("\n")
    def visit_SuccFuncTable (self, node) :
        self.fill("# map transitions names to successor funcs")
        self.fill("# '' maps to all-transitions func")
        self.fill("succfunc = {")
        for i, (trans, name) in enumerate(sorted(self.succfunc.items())) :
            if i == 0 == len(self.succfunc) - 1 :
                self.write("%r: %s}" % (trans, name))
            elif i == 0 :
                self.write("%r: %s," % (trans, name))
            elif i == len(self.succfunc) - 1 :
                self.fill("            %r: %s}" % (trans, name))
            else :
                self.fill("            %r: %s," % (trans, name))
        self.write("\n")
    def visit_SuccIterTable (self, node) :
        self.fill("# map transitions names to successor iterators")
        self.fill("# '' maps to all-transitions iterator")
        self.fill("succiter = {")
        for i, (trans, name) in enumerate(sorted(self.succiter.items())) :
            if i == 0 == len(self.succiter) - 1 :
                self.write("%r: %s}" % (trans, name))
            elif i == 0 :
                self.write("%r: %s," % (trans, name))
            elif i == len(self.succiter) - 1 :
                self.fill("            %r: %s}" % (trans, name))
            else :
                self.fill("            %r: %s," % (trans, name))
        self.write("\n")

if __name__ == "__main__" :
    import io, sys
    from zinc.io.zn import load
    net = load(open(sys.argv[-1]))
    gen = CodeGenerator(io.StringIO())
    gen.visit(net.__ast__())
    print(gen.output.getvalue().rstrip())