/usr/lib/python2.7/dist-packages/vamos/rsf2model/BoolRewriter.py is in undertaker 1.6-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | """rsf2model - extracts presence implications from kconfig dumps"""
# Copyright (C) 2011 Christian Dietrich <christian.dietrich@informatik.uni-erlangen.de>
# Copyright (C) 2012 Manuel Zerpies <manuel.f.zerpies@ww.stud.uni-erlangen.de>
# Copyright (C) 2014 Stefan Hengelein <stefan.hengelein@fau.de>
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# 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, see <http://www.gnu.org/licenses/>.
#
from vamos.rsf2model import tools
from vamos.rsf2model.BoolParser import BoolParser
from vamos.rsf2model.helper import tree_change, BoolRewriterException
class BoolRewriter(tools.UnicodeMixin):
ELEMENT = "in"
def __init__(self, rsf, expr, eval_to_module = True):
tools.UnicodeMixin.__init__(self)
self.expr = BoolParser(expr).to_bool()
if type(self.expr) == str or self.expr[0] == BoolParser.NOT:
self.expr = [BoolParser.AND, self.expr]
self.rsf = rsf
self.eval_to_module = eval_to_module
def rewrite_not(self):
self.expr = tree_change(self.__rewrite_not, self.expr)
return self.expr
def __rewrite_not(self, tree):
if tree[0] == BoolParser.NOT and type(tree[1]) == list:
tree = tree[1]
if tree[0] == BoolParser.AND:
tree = [BoolParser.OR] + [[BoolParser.NOT, x] for x in tree[1:]]
return tree_change(self.__rewrite_not, tree)
elif tree[0] == BoolParser.OR:
tree = [BoolParser.AND] + [[BoolParser.NOT, x] for x in tree[1:]]
return tree_change(self.__rewrite_not, tree)
elif tree[0] == BoolParser.NOT:
return tree_change(self.__rewrite_not, tree[1])
elif tree[0] == BoolParser.EQUAL:
tree[0] = BoolParser.NEQUAL
return tree
elif tree[0] == BoolParser.NEQUAL:
tree[0] = BoolParser.EQUAL
return tree
def rewrite_tristate(self):
self.expr = tree_change(self.__rewrite_tristate, self.expr)
return self.expr
def __rewrite_tristate(self, tree):
#pylint: disable=R0912
def tristate_not(symbol):
if symbol in self.rsf.options() and self.rsf.options()[symbol].tristate():
if self.eval_to_module:
return [BoolParser.NEQUAL, symbol, "y"]
else:
return [BoolParser.EQUAL, symbol, "n"]
return [BoolParser.NOT, symbol]
def tristate(symbol):
if symbol in self.rsf.options() and self.rsf.options()[symbol].tristate():
if self.eval_to_module:
return [BoolParser.NEQUAL, symbol, "n"]
else:
return [BoolParser.EQUAL, symbol, "y"]
return symbol
if tree[0] in [BoolParser.AND, BoolParser.OR]:
for i in range(1, len(tree)):
if type(tree[i]) == list:
if tree[i][0] == BoolParser.NOT:
tree[i] = tristate_not(tree[i][1])
else:
tree[i] = tree_change(self.__rewrite_tristate, tree[i])
else:
tree[i] = tristate(tree[i])
return tree
def rewrite_choice(self):
"""Removes all CHOICE_ items"""
def __recr(tree):
tree = [x for x in tree if not(type(x) == str and x.startswith("CHOICE_"))]
if len(tree) == 1:
return []
return tree
self.expr = tree_change(__recr, self.expr)
return self.expr
def rewrite_symbol(self):
self.expr = tree_change(self.__rewrite_symbol, self.expr)
return self.expr
def __rewrite_symbol(self, tree):
def to_symbol(tree):
if type(tree) in [list, tuple]:
return tree_change(self.__rewrite_symbol, tree)
if tree == "m":
if self.eval_to_module:
# m is true, if the expression can evaluate to module
return tools.new_free_item()
else:
#otherwise it is false, because expr = y is needed
a = tools.new_free_item()
return [BoolParser.AND, a,
[BoolParser.NOT, a]]
return self.rsf.symbol(tree)
if tree[0] in [BoolParser.NOT, BoolParser.AND, BoolParser.OR]:
return [tree[0]] + map(to_symbol, tree[1:])
elif tree[0] == BoolParser.EQUAL:
return self.__rewrite_symbol_equal(tree)
elif tree[0] == BoolParser.NEQUAL:
return self.__rewrite_symbol_nequal(tree)
def __rewrite_symbol_equal(self,tree):
left = tree[1]
right = tree[2]
left_y = self.rsf.symbol(left)
left_m = self.rsf.symbol_module(left)
right_y = self.rsf.symbol(right)
right_m = self.rsf.symbol_module(right)
if left.lower() in ["y", "n", "m"]:
right, left = left, right
if left.lower() in ["y", "n", "m"]:
raise BoolRewriterException("compare literal with literal")
if right == "y":
return left_y
elif right == "m":
return left_m
elif right == "n":
return [BoolParser.AND,
[BoolParser.NOT, left_m],
[BoolParser.NOT, left_y]]
else:
# Symbol == Symbol
return [BoolParser.OR,
[BoolParser.AND, left_y, right_y], # Either both y
[BoolParser.AND, left_m, right_m], # Or both
[BoolParser.AND, # Or everything disabled
[BoolParser.NOT, left_y], [BoolParser.NOT, right_y],
[BoolParser.NOT, left_m], [BoolParser.NOT, right_m]]]
def __rewrite_symbol_nequal(self,tree):
left = tree[1]
right = tree[2]
left_y = self.rsf.symbol(left)
left_m = self.rsf.symbol_module(left)
right_y = self.rsf.symbol(right)
right_m = self.rsf.symbol_module(right)
if left.lower() in ["y", "n", "m"]:
right, left = left, right
if left.lower() in ["y", "n", "m"]:
raise BoolRewriterException("compare literal with literal")
if right == "y":
return [BoolParser.NOT, left_y]
elif right == "m":
return [BoolParser.NOT, left_m]
elif right == "n":
return [BoolParser.OR, left_m, left_y]
else:
return [BoolParser.OR,
[BoolParser.AND, left_y, [BoolParser.NOT, right_y]],
[BoolParser.AND, left_m, [BoolParser.NOT, right_m]],
[BoolParser.AND, [BoolParser.NOT, left_y], right_y],
[BoolParser.AND, [BoolParser.NOT, left_m], right_m]]
def dump(self):
def __concat(tree):
if not type(tree) in [list, tuple]:
return tree
if tree[0] == BoolParser.NOT:
return "!" + tree[1]
elements = []
for e in tree[1:]:
elements.append(__concat(e))
cat = " && "
if tree[0] == BoolParser.OR:
cat = " || "
if len(elements) == 1:
return cat.join(elements)
return "(" + cat.join(elements) + ")"
if self.expr == []:
return ""
return __concat(self.expr)
def rewrite(self):
self.rewrite_not()
self.rewrite_choice()
self.rewrite_tristate()
self.rewrite_symbol()
return self
def __unicode__(self):
return self.dump()
|