Displaying 6 results from an estimated 6 matches for "terminatedstr".
2016 Aug 26
10
[RFC] Interprocedural MIR-level outlining pass
...me for the
suffix tree is the most time consuming part, but I haven't noticed a
difference in compilation time on, say, 12 MB .ll files.
2: To support the suffix tree, we need a "terminated string." This is a
generalized string with an unique terminator character appended to the
end. TerminatedStrings can be built from any type.
The algorithm is then roughly as follows.
1. For each MachineBasicBlock in the program, build a TerminatedString for
that block.
2. Build a suffix tree for that collection of strings.
3. Query the suffix tree for the longest repeated substring and place that
string...
2016 Aug 26
2
[RFC] Interprocedural MIR-level outlining pass
...39;t noticed a
> > difference in compilation time on, say, 12 MB .ll files.
> >
> > 2: To support the suffix tree, we need a "terminated string." This is
> > a
> > generalized string with an unique terminator character appended to
> > the
> > end. TerminatedStrings can be built from any type.
> >
> > The algorithm is then roughly as follows.
> >
> > 1. For each MachineBasicBlock in the program, build a
> > TerminatedString for
> > that block.
> > 2. Build a suffix tree for that collection of strings.
> > 3....
2016 Aug 26
2
[RFC] Interprocedural MIR-level outlining pass
...39;t noticed a
> > difference in compilation time on, say, 12 MB .ll files.
> >
> > 2: To support the suffix tree, we need a "terminated string." This is
> > a
> > generalized string with an unique terminator character appended to
> > the
> > end. TerminatedStrings can be built from any type.
> >
> > The algorithm is then roughly as follows.
> >
> > 1. For each MachineBasicBlock in the program, build a
> > TerminatedString for
> > that block.
> > 2. Build a suffix tree for that collection of strings.
> > 3....
2016 Aug 27
3
[RFC] Interprocedural MIR-level outlining pass
...ralized string with an unique terminator character
> > > > > > appended
> > > > > > to
> > > >
> > >
> >
>
> > > > > > the
> > > >
> > >
> >
>
> > > > > > end. TerminatedStrings can be built from any type.
> > > >
> > >
> >
>
> > > > > >
> > > >
> > >
> >
>
> > > > > > The algorithm is then roughly as follows.
> > > >
> > >
> >
>
>...
2016 Aug 29
2
[RFC] Interprocedural MIR-level outlining pass
...ll files.
>>>> >
>>>> > 2: To support the suffix tree, we need a "terminated string." This is
>>>> > a
>>>> > generalized string with an unique terminator character appended to
>>>> > the
>>>> > end. TerminatedStrings can be built from any type.
>>>> >
>>>> > The algorithm is then roughly as follows.
>>>> >
>>>> > 1. For each MachineBasicBlock in the program, build a
>>>> > TerminatedString for
>>>> > that block.
>&g...
2016 Aug 30
2
[RFC] Interprocedural MIR-level outlining pass
...To support the suffix tree, we need a "terminated string." This
>>>>>> is
>>>>>> > a
>>>>>> > generalized string with an unique terminator character appended to
>>>>>> > the
>>>>>> > end. TerminatedStrings can be built from any type.
>>>>>> >
>>>>>> > The algorithm is then roughly as follows.
>>>>>> >
>>>>>> > 1. For each MachineBasicBlock in the program, build a
>>>>>> > TerminatedString for...