Mercurial > lcfOS

comparison python/ppci/codegen/graph.py @ 337:b00219172a42

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Added cool lm3s811 qemu project
author Windel Bouwman
date Thu, 20 Feb 2014 20:04:52 +0100
parents e9fe6988497c
children
comparison
equal deleted inserted replaced
336:d1ecc493384e 337:b00219172a42
7 def __init__(self): 7 def __init__(self):
8 self.nodes = set() 8 self.nodes = set()
9 self.edges = set() 9 self.edges = set()
10 self.adj_map = {} 10 self.adj_map = {}
11 11
12 def addNode(self, n): 12 def add_node(self, n):
13 self.nodes.add(n) 13 self.nodes.add(n)
14 if n not in self.adj_map: 14 if n not in self.adj_map:
15 self.adj_map[n] = set() 15 self.adj_map[n] = set()
16 16
17 def delNode(self, n): 17 def delNode(self, n):
75 self.suc_map[n].add(m) 75 self.suc_map[n].add(m)
76 self.pre_map[m].add(n) 76 self.pre_map[m].add(n)
77 self.adj_map[n].add(m) 77 self.adj_map[n].add(m)
78 self.adj_map[m].add(n) 78 self.adj_map[m].add(n)
79 79
80 def addNode(self, n): 80 def add_node(self, n):
81 super().addNode(n) 81 super().add_node(n)
82 if n not in self.suc_map: 82 if n not in self.suc_map:
83 self.suc_map[n] = set() 83 self.suc_map[n] = set()
84 if n not in self.pre_map: 84 if n not in self.pre_map:
85 self.pre_map[n] = set() 85 self.pre_map[n] = set()
86 86
100 return self.g.successors(self) 100 return self.g.successors(self)
101 101
102 @property 102 @property
103 def Pred(self): 103 def Pred(self):
104 return self.g.predecessors(self) 104 return self.g.predecessors(self)
105
106 def __gt__(self, other):
107 return self in other.Succ