Skip to content
Snippets Groups Projects
Commit 256cea87 authored by Andreas Klöckner's avatar Andreas Klöckner
Browse files

Fix pow() code generation for new type system

parent 86292def
No related branches found
No related tags found
No related merge requests found
Pipeline #
...@@ -666,24 +666,24 @@ class LoopyCCodeMapper(RecursiveMapper): ...@@ -666,24 +666,24 @@ class LoopyCCodeMapper(RecursiveMapper):
return base_impl(expr, enclosing_prec, type_context) return base_impl(expr, enclosing_prec, type_context)
tgt_dtype = self.infer_type(expr) tgt_dtype = self.infer_type(expr)
if 'c' == tgt_dtype.kind: if tgt_dtype.is_complex():
if expr.exponent in [2, 3, 4]: if expr.exponent in [2, 3, 4]:
value = expr.base value = expr.base
for i in range(expr.exponent-1): for i in range(expr.exponent-1):
value = value * expr.base value = value * expr.base
return self.rec(value, enclosing_prec, type_context) return self.rec(value, enclosing_prec, type_context)
else: else:
b_complex = 'c' == self.infer_type(expr.base).kind b_complex = self.infer_type(expr.base).is_complex()
e_complex = 'c' == self.infer_type(expr.exponent).kind e_complex = self.infer_type(expr.exponent).is_complex()
if b_complex and not e_complex: if b_complex and not e_complex:
return "%s_powr(%s, %s)" % ( return "%s_powr(%s, %s)" % (
self.complex_type_name(tgt_dtype), self.complex_type_name(tgt_dtype.numpy_dtype),
self.rec(expr.base, PREC_NONE, type_context, tgt_dtype), self.rec(expr.base, PREC_NONE, type_context, tgt_dtype),
self.rec(expr.exponent, PREC_NONE, type_context)) self.rec(expr.exponent, PREC_NONE, type_context))
else: else:
return "%s_pow(%s, %s)" % ( return "%s_pow(%s, %s)" % (
self.complex_type_name(tgt_dtype), self.complex_type_name(tgt_dtype.numpy_dtype),
self.rec(expr.base, PREC_NONE, type_context, tgt_dtype), self.rec(expr.base, PREC_NONE, type_context, tgt_dtype),
self.rec(expr.exponent, PREC_NONE, self.rec(expr.exponent, PREC_NONE,
type_context, tgt_dtype)) type_context, tgt_dtype))
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment