search for: thisstate

Dear R and odfWeave users, I am looking for a way to automate generation of many reports using odfWeave. All reports would use the same input ODT file, the only difference would be in the name of the dataset which will be analyzed in any particular report. Right now, the name of the dataset is hardcoded in the first code chuck in the input file: <<01 get data, echo=TRUE>> station =

Hi all, I have found what I think it is a bug in DFAPacketizer::ReadTable. When finding NextStateInTable to cache all transitions belonging to a state into CachedTable, ReadTable does not check bounds: unsigned ThisState = DFAStateEntryTable[state]; | unsigned NextStateInTable = DFAStateEntryTable[state+1]; which makes NextStateInTable get a random value when state == <last state in table>. Behaviour changes depending on gcc version / platform / ..., but in some cases might lead to segmentation faults. I ha...

...4:48 AM, Carlos Sánchez de La Lama wrote: > > Hi all, > > I have found what I think it is a bug in DFAPacketizer::ReadTable. > > When finding NextStateInTable to cache all transitions belonging to a > state into CachedTable, ReadTable does not check bounds: > > unsigned ThisState = > DFAStateEntryTable[state]; > | > unsigned NextStateInTable = DFAStateEntryTable[state+1]; > > which makes NextStateInTable get a random value when state == <last state > in table>. Behaviour changes depending on gcc version / platform / ..., but > in some cases might...

.../2012 4:48 AM, Carlos Sánchez de La Lama wrote: > Hi all, > > I have found what I think it is a bug in DFAPacketizer::ReadTable. > > When finding NextStateInTable to cache all transitions belonging to a > state into CachedTable, ReadTable does not check bounds: > > unsigned ThisState = DFAStateEntryTable[state]; | > unsigned NextStateInTable = DFAStateEntryTable[state+1]; > > which makes NextStateInTable get a random value when state == <last > state in table>. Behaviour changes depending on gcc version / platform > / ..., but in some cases might lead to...

...;> Hi all, >> >> I have found what I think it is a bug in DFAPacketizer::ReadTable. >> >> When finding NextStateInTable to cache all transitions belonging >> to a state into CachedTable, ReadTable does not check bounds: >> >> unsigned ThisState = DFAStateEntryTable[state]; | >> unsigned NextStateInTable = DFAStateEntryTable[state+1]; >> >> which makes NextStateInTable get a random value when state == >> <last state in table>. Behaviour changes depending on gcc version >> / platform / ......

...te: >> >> Hi all, >> >> I have found what I think it is a bug in DFAPacketizer::ReadTable. >> >> When finding NextStateInTable to cache all transitions belonging to a >> state into CachedTable, ReadTable does not check bounds: >> >> unsigned ThisState = >> DFAStateEntryTable[state]; >> | >> unsigned NextStateInTable = DFAStateEntryTable[state+1]; >> >> which makes NextStateInTable get a random value when state == <last >> state in table>. Behaviour changes depending on gcc version / platform / >>...

...Jun 20, 2013 at 6:14 AM, Boris Boesler <baembel at gmx.de> wrote: > Hi! > > I want to write a LLVM back-end for a bit addressing target architecture. > > http://llvm.org/docs/GetElementPtr.html#i-m-writing-a-backend-for-a-target-which-needs-custom-lowering-for-gep-how-do-i-do-thisstates quite clearly that some additional work must be done for this sort > of architecture. Is this still true? Is there a project/branch to make it > more flexible? Support for any memory addressing? > > I had a short look at SelectionDAGBuilder::visitGetElementPtr(const User > &I)...

Hi! I want to write a LLVM back-end for a bit addressing target architecture. http://llvm.org/docs/GetElementPtr.html#i-m-writing-a-backend-for-a-target-which-needs-custom-lowering-for-gep-how-do-i-do-this states quite clearly that some additional work must be done for this sort of architecture. Is this still true? Is there a project/branch to make it more flexible? Support for any memory

...l, >>> >>> I have found what I think it is a bug in DFAPacketizer::ReadTable. >>> >>> When finding NextStateInTable to cache all transitions belonging to a >>> state into CachedTable, ReadTable does not check bounds: >>> >>> unsigned ThisState = >>> DFAStateEntryTable[state]; >>> | >>> unsigned NextStateInTable = DFAStateEntryTable[state+1]; >>> >>> which makes NextStateInTable get a random value when state == <last >>> state in table>. Behaviour changes depending on gcc versi...