[WIP] Add a first implementation of an FMA node
- Add a node 'FusedMultiplyAdd' to loopy.symbolic
- Implement handlers all over the place
- In textual language, have a function fma(a,b,c) which is translated to the node
- Throw away the node in favor of sum/product in ExpressionToCExpressionMapper
Still TODO:
-
Implement type inference (only a dummy so far) -
Implement statistics handler -
Write tests