On 04/23/2013 07:21 PM, Tim Shen wrote:
I've made a proposal under the guide of application. Is it detailed
and realistic?
Out of curiosity, do you plan to use a Thompson automaton where
possible, or just NFAs throughout?
--
Florian Weimer / Red Hat Product Security Team
I'm very interested in implementing a NFA->DFA module(does that mean a
Thompson automaton?) so that the exponential searching algorithm can
be reduced to a linear state transition(though the states may be
potentially exponential) loop. I can't understand how some language
dare use a search algo as
On 04/24/2013 12:45 PM, Tim Shen wrote:
I'm very interested in implementing a NFA->DFA module(does that mean a
Thompson automaton?) so that the exponential searching algorithm can
be reduced to a linear state transition(though the states may be
potentially exponential) loop. I can't understand ho
Hmm...So finally we need partially compiled NFA(Because DFA is a
special NFA, so can be embeded in an NFA)? That's worth trying.
Anyway, I don't know much about it. Maybe I should read others code or
just wirte a prototype first, if my proposal's accepted by GCC :)
On Wed, Apr 24, 2013 at 6:56 PM,
On Wed, Apr 24, 2013 at 5:25 AM, Nathan Ridge wrote:
>> Here's a simple program:
>>
>> #include
>> #include
>>
>> int main()
>> {
>> std::vector vec;
>> count(vec.begin(), vec.end(), 0); // shouldn't this be std::count ?
>> }
>>
>> The above compiles successfully, but I think it shouldn't. I exp
On 23/04/13 17:19, Florian Weimer wrote:
> On 04/23/2013 04:45 PM, Andreas Krebbel wrote:
>> I was not able to reproduce the problem with head GCC. But I couldn't
>> find anything which addresses the problem either. So I assume that a
>> different situation before the scheduling pass hides the pro
On Wed, Apr 24, 2013 at 3:25 PM, Andreas Krebbel
wrote:
> On 23/04/13 17:19, Florian Weimer wrote:
>> On 04/23/2013 04:45 PM, Andreas Krebbel wrote:
>>> I was not able to reproduce the problem with head GCC. But I couldn't
>>> find anything which addresses the problem either. So I assume that a
>
If this e-mail is not appropriate for either DL, then apologies in
advance.
I've used GCC for many years on and off and have always liked it. But
today I couldn't help but smile while using it. Here's what I saw:
main.cpp: In function 'int main(int, char**)':
main.cpp:130:29: er
On Tue, 2013-04-23 at 15:24 -0600, Jeff Law wrote:
> Well, you have to copy the blocks, adjust the edges and rewrite the SSA
> graph. I'd use duplicate_block to help.
>
> You really want to look at tree-ssa-threadupdate.c. There's a nice big
> block comment which gives the high level view of
On 04/24/2013 11:38 AM, Steve Ellcey wrote:
I think I understand the high level work, it is mapping that hight level
description to the low level calls that I am having trouble with. Lets
say I have basic blocks A, B, and C, and edges from A to B and B to C.
There may also be other edges leadin
I am attempting to submit a patch for the gcc documentation (see
http://gcc.gnu.org/ml/gcc-help/2013-04/msg00193.html). I am told that I
need to submit one of these two forms. Please send me copies so I can
select one and submit it.
dw
On Wed, 2013-04-24 at 14:31 -0600, Jeff Law wrote:
> On 04/24/2013 11:38 AM, Steve Ellcey wrote:
> Just do duplicate_block (B, NULL, NULL)
>
> Then I'd remove the switch statement and the outgoing edges from B'
> except the edge B'->C.
>
> Then I'd fixup the PHIs in C. That's update_destinatio
On Wed, 2013-04-24 at 15:54 -0700, Steve Ellcey wrote:
>
> /* Copy the basic block that is the destination block of orig_edge, then
>modify/replace the edge in orig_edge->src basic block with a new edge
>that goes to the new block. Fix up any PHI nodes that may need to be
>updated.
On 04/24/2013 04:54 PM, Steve Ellcey wrote:
I am still having trouble with this and with figuring out how to
straighten out my PHI nodes. I have decided to try a slightly different
tack and see if I could create a routine that would do a generic basic
block copy, handling all the needed bookkee
14 matches
Mail list logo
