Displaying 3 results from an estimated 3 matches for "is_base".
Did you mean:
es_base
2015 Feb 05
5
[LLVMdev] RFC: Recursive inlining
...and conquer algorithms. Quicksort, FFT butterflies, etc.
3. Traversing a data structure, where the recursion is simply to get to
the leaves which is where all the fun stuff happens.
Points 2 and 3 both share a trait that they're dividing/fanning out at each
step:
void ex3(i) {
if (is_base(i)) {
f();
return;
}
g(i);
ex3(i / 2);
ex3(i / 2 + 1);
}
The access pattern of such a function is not linear. It is a pre-order walk
of a (binary, in this case) tree. As such we can't use the two-loop
transform above, but would have to form one loop...
2015 Feb 05
5
[LLVMdev] RFC: Recursive inlining
...a structure, where the recursion is simply to get
> > to the leaves which is where all the fun stuff happens.
> >
> >
> > Points 2 and 3 both share a trait that they're dividing/fanning out
> > at each step:
> >
> >
> > void ex3(i) {
> > if (is_base(i)) {
> > f();
> > return;
> > }
> > g(i);
> > ex3(i / 2);
> > ex3(i / 2 + 1);
> > }
> >
> >
> > The access pattern of such a function is not linear. It is a
> > pre-order walk of a (binary, in this case) tree. As such we can't
&...
2015 Feb 18
5
[LLVMdev] RFC: Recursive inlining
...a structure, where the recursion is simply to get
> > to the leaves which is where all the fun stuff happens.
> >
> >
> > Points 2 and 3 both share a trait that they're dividing/fanning out
> > at each step:
> >
> >
> > void ex3(i) {
> > if (is_base(i)) {
> > f();
> > return;
> > }
> > g(i);
> > ex3(i / 2);
> > ex3(i / 2 + 1);
> > }
> >
> >
> > The access pattern of such a function is not linear. It is a
> > pre-order walk of a (binary, in this case) tree. As such we can't
&...