def _map(arguments, _return, functors, **kwargs):
fn, args = (arguments[0], arguments[1:])
instantiate = hasattr(fn, 'type')
functors.add(str(fn))
arity = len(args)
transformed = T.Monotype('transformed%s' % arity)
if instantiate:
dependent_list = [fn] + [C.type_from_name(x) for x in args]
else:
dependent_list = [C.type_from_name(x) for x in arguments]
type = BT.DependentType(transformed, dependent_list)
typedef = B.CTypedef(type, C.type_from_name(_return))
typedecl = B.CTypeDecl(C.type_from_name(_return), _return)
#XXX I need to compute the type of the result of the transform function
# This information is hard to find, so for now I'm just using the type
# of the first argument to map.
# This precludes the use of transforms which have a different output type
# than their inputs, and needs to be fixed
result_type = B.CTypename(B.CNamespace(C.type_from_name(args[0]),
S.Name('value_type')))
if instantiate:
xform_args = [B.CConstructor(arguments[0], [])] + arguments[1:]
else:
xform_args = arguments
apply_node = B.CConstructor(B.TemplateInst(S.Name('transform'),
[result_type]),
xform_args)
# XXX This won't allow us to return a map from a sequential function
cbind = B.CBind(typedecl, apply_node)
return [typedef, cbind]
def _gather(arguments, _return, functors, **kwargs):
(source, indices) = arguments
type = BT.DependentType(T.Monotype('gathered'), [C.type_from_name(source),
C.type_from_name(indices)])
typedef = B.CTypedef(type, C.type_from_name(_return))
typedecl = B.CTypeDecl(C.type_from_name(_return), _return)
apply_node = B.CConstructor(S.Name('gather'),
[source, indices])
# XXX This won't allow us to return a gather from a sequential function
cbind = B.CBind(typedecl, apply_node)
return [typedef, cbind]
def _sum(arguments, _return, functors, **kwargs):
#Instantiates either a sequential or block-wise sum
apply_node = B.CConstructor(B.CNamespace(str(kwargs['context']),
S.Name('sum')),
arguments)
if _return.id != C.anonymousReturnValue.id:
result_type = B.CTypename(B.CNamespace(C.type_from_name(arguments[0]),
S.Name('value_type')))
typedecl = B.CTypeDecl(result_type, _return)
cbind = B.CBind(typedecl, apply_node)
else:
cbind = B.CBind(_return, apply_node)
return cbind
def _reduce(arguments, _return, functors, **kwargs):
#Instantiates either a sequential or block-wise reduction
fn, data, prefix = arguments
instantiate = hasattr(fn, 'type')
functors.add(str(fn))
if instantiate:
fn = B.CConstructor(fn, [])
apply_node = B.CConstructor(B.CNamespace(str(kwargs['context']),
S.Name('reduce')),
(fn, data, prefix))
if _return.id != C.anonymousReturnValue.id:
result_type = B.CTypename(B.CNamespace(C.type_from_name(arguments[0]),
S.Name('value_type')))
typedecl = B.CTypeDecl(result_type, _return)
cbind = B.CBind(typedecl, apply_node)
else:
cbind = B.CBind(_return, apply_node)
return cbind
