Lines Matching refs:keys
56 options = [n for n in instructions.keys() if (n[0] == '*') == is_fma]
131 keys = set()
134 keys |= find_context_keys_expr(test)
139 keys |= find_context_keys_expr(val)
141 return keys
152 def compile_derived_inner(expr, keys):
158 args = [compile_derived_inner(arg, keys) for arg in expr[1:]]
165 return "ctx[{}]".format(keys.index(expr))
167 def compile_derived(expr, keys):
168 return eval('lambda ctx, ordering: ' + compile_derived_inner(expr, keys))
180 def evaluate_forward(keys, derivf, testf, ctx, ordering):
196 def evaluate_forwards(keys, derivf, testf, mod_vals, ordered):
198 return [[evaluate_forward(keys, derivf, testf, i, order) for i in itertools.product(*mod_vals)] for order in orderings]
205 def invert_lut(value_size, forward, derived, mod_map, keys, mod_vals):
237 # Find the keys and impose an order
241 keys = sorted(list(key_set))
244 testf = compile_derived(test, keys)
245 derivf = [[compile_derived(expr, keys) for expr in v] for (_, v) in derived]
246 mod_vals = [mod_map[k][1] for k in keys]
247 forward = evaluate_forwards(keys, derivf, testf, mod_vals, ordered)
251 backwards = [invert_lut(value_size, f, derived, mod_map, keys, mod_vals) for f in forward]
259 for j, key in enumerate(keys):