- Jul 10, 2017
-
-
Matt Wala authored
-
- Jul 09, 2017
-
-
Matt Wala authored
-
- Jul 08, 2017
-
-
Matt Wala authored
This function does trivial things, but it's there to solve the problem that the reduction neutral element getters are not allowed to store dtypes (#80). The function mangler demands that a function knows its type based on its arguments. For the neutral element getters, this is impossible because they take zero arguments. The simplest fix I can think of is to change a call to neutral_element() to a call to make_tuple(). Currently, the tuple code doesn't work yet due to pickling issues. I think the root cause is somewhere in __hackily_ensure_multi_argument_functions_are_scoped_private().
-
- May 23, 2017
- May 21, 2017
-
-
Matt Wala authored
-
- May 20, 2017
-
-
Matt Wala authored
array prefixes as they are aded to the set. Closes #25 on gitlab Depends on inducer/pytools!2 on gitlab
-
- Apr 08, 2017
-
-
Matt Wala authored
type. Now, the argument to a reduction can be either a scalar or a tuple.
-
Matt Wala authored
-
Matt Wala authored
-
Matt Wala authored
-
Matt Wala authored
-
Matt Wala authored
either a tuple, reduction, or a substitution invocation). Also, rewrite the reduction mapping code to rely on recursive calls map_tuple(). This cleans up a lot of reduction mapping code substantially.
-
- Apr 07, 2017
- Mar 21, 2017
-
-
Andreas Klöckner authored
-
- Mar 15, 2017
-
-
Nick Curtis authored
-
- Feb 24, 2017
-
-
Andreas Klöckner authored
-
- Feb 17, 2017
- Feb 15, 2017
-
-
Andreas Klöckner authored
-
- Feb 06, 2017
-
-
Matt Wala authored
-
Matt Wala authored
-
Andreas Klöckner authored
-
- Jan 30, 2017
-
-
Nick Curtis authored
-
Nick Curtis authored
-
Nick Curtis authored
-
- Jan 24, 2017
-
-
Matt Wala authored
This adds a tool for computing the iname nest efficiently, for printing. Closes #5
-
- Jan 22, 2017
-
-
Matt Wala authored
-
- Jan 20, 2017
-
-
Andreas Klöckner authored
-
- Dec 23, 2016
-
-
Matt Wala authored
-
- Dec 22, 2016
-
-
Matt Wala authored
-
Matt Wala authored
dependencies, and also to treat loops more carefully. * Dependencies are now tracked based on a list of active potential sources, and the active set is narrowed by filtering through readers/writers * Stricter handling of dependencies within loops by not assuming that loops are nonempty * Changes the barrier insertion algorithm to act in two stages: first, barriers are recursively inserted into loops, then they are inserted at the outermost level. This is mostly meant to simplify the code. * See also #18 on gitlab
-
- Dec 21, 2016
-
-
Matt Wala authored
-
Andreas Klöckner authored
-
- Dec 16, 2016