search for: cachedt

..., ltTransition>, ltState> > stateTransitions; > You should be able to use SmallSet here. Also, this line exceeds 80 > columns. I tried but SmallSet is not iterable. SmallSetPtr could be useful here but it doesn't allow custom sorting. > > > On a related note, is the CachedTable mechanism in DFAPacketizer.h > useful for your architecture? Currently the DFA generator generates > one table for a given architecture. I had originally added the > CachedTable mechanism since for a given compilation and subtarget, the > DFA only uses the subset of the states a...

...hould be able to use SmallSet here. Also, this line exceeds 80 >>> columns. >> >> I tried but SmallSet is not iterable. SmallSetPtr could be useful >> here but it doesn't allow custom sorting. >> >>> >>> >>> On a related note, is the CachedTable mechanism in DFAPacketizer.h >>> useful for your architecture? Currently the DFA generator generates >>> one table for a given architecture. I had originally added the >>> CachedTable mechanism since for a given compilation and subtarget, >>> the DFA only...

...: +void State::AddInsnClass(unsigned InsnClass, Add a top level comment describing the function + std::map<State*, std::set<Transition*, ltTransition>, ltState> stateTransitions; You should be able to use SmallSet here. Also, this line exceeds 80 columns. On a related note, is the CachedTable mechanism in DFAPacketizer.h useful for your architecture? Currently the DFA generator generates one table for a given architecture. I had originally added the CachedTable mechanism since for a given compilation and subtarget, the DFA only uses the subset of the states and transitions. Usin...

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 / ...,...

...stateTransitions; >> You should be able to use SmallSet here. Also, this line exceeds 80 >> columns. > > I tried but SmallSet is not iterable. SmallSetPtr could be useful here > but it doesn't allow custom sorting. > >> >> >> On a related note, is the CachedTable mechanism in DFAPacketizer.h >> useful for your architecture? Currently the DFA generator generates >> one table for a given architecture. I had originally added the >> CachedTable mechanism since for a given compilation and subtarget, >> the DFA only uses the subset...

...here. Also, this line exceeds 80 >>>> columns. >>> >>> I tried but SmallSet is not iterable. SmallSetPtr could be useful >>> here but it doesn't allow custom sorting. >>> >>>> >>>> >>>> On a related note, is the CachedTable mechanism in DFAPacketizer.h >>>> useful for your architecture? Currently the DFA generator generates >>>> one table for a given architecture. I had originally added the >>>> CachedTable mechanism since for a given compilation and subtarget, >>>>...

...llSet here. Also, this line exceeds 80 >>>>> columns. >>>> I tried but SmallSet is not iterable. SmallSetPtr could be useful >>>> here but it doesn't allow custom sorting. >>>> >>>>> >>>>> On a related note, is the CachedTable mechanism in DFAPacketizer.h >>>>> useful for your architecture? Currently the DFA generator generates >>>>> one table for a given architecture. I had originally added the >>>>> CachedTable mechanism since for a given compilation and subtarget, >&...

...ted > by The Linux Foundation > > > > On 12/10/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 depe...

...ine exceeds 80 >>>>>> columns. >>>>> I tried but SmallSet is not iterable. SmallSetPtr could be useful >>>>> here but it doesn't allow custom sorting. >>>>> >>>>>> >>>>>> On a related note, is the CachedTable mechanism in DFAPacketizer.h >>>>>> useful for your architecture? Currently the DFA generator generates >>>>>> one table for a given architecture. I had originally added the >>>>>> CachedTable mechanism since for a given compilation and subt...

...of Code Aurora Forum, hosted by The Linux Foundation On 12/10/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 g...

Hi, I've refactored the DFA generator in TableGen because it takes too much time to build the table of our BE and I'd like to share it. We have 15 functional units and 13 different itineraries which, in the worst case, can produce 13! states. Fortunately, many of those states are reused :-) but it still takes up to 11min to build the entire table. This patch reduces the build time to

...gt; > > On 12/10/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 tabl...

For some reason on my VLIW target DFAPacketizer fails at assert(CachedTable.count(StateTrans) != 0); in the following function: // reserveResources - Reserve the resources occupied by a MCInstrDesc and // change the current state to reflect that change. void DFAPacketizer::reserveResources(const llvm::MCInstrDesc *MID) { unsigned InsnClass = MID->getSchedClass()...

...gt;>>>> columns. >>>>>> I tried but SmallSet is not iterable. SmallSetPtr could be useful >>>>>> here but it doesn't allow custom sorting. >>>>>> >>>>>>> >>>>>>> On a related note, is the CachedTable mechanism in DFAPacketizer.h >>>>>>> useful for your architecture? Currently the DFA generator generates >>>>>>> one table for a given architecture. I had originally added the >>>>>>> CachedTable mechanism since for a given compilat...

...t; >> >> On 12/10/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...

Hi, I'm trying to get the DFAPacketizer to work for my target but with any instruction I get the 'Assertion `CachedTable.count(StateTrans) != 0' failed' error and it crashes out before packeting a single instruction. I have a *GenDFAPacketizer.inc file and my packetizer pass checks that the table is not empty before proceeding. I also have a schedule file with my functional units and itineraries listed....

...racker->reserveResources(); ResourceTracker->reserveResources(); ResourceTracker->reserveResources(); ResourceTracker->reserveResources(); ResourceTracker->reserveResources(); DFAPacketizer.cpp:84: void llvm::DFAPacketizer::reserveResources(const llvm::MCInstrDesc*): Assertion `CachedTable.count(StateTrans) != 0' failed. It seems to not want to worry about the alu's, but it is fine as long as there are any FU of the first row (BITS) available. What is missing? Thanks, Jonas Paulsson -------------- next part -------------- An HTML attachment was scrubbed... URL: <...

...10/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 =...

Hi Sam, On 12/06/2012 15:33, sam wrote: > Hi, > > I'm trying to get the DFAPacketizer to work for my target but with any > instruction I get the > 'Assertion `CachedTable.count(StateTrans) != 0' failed' error and it crashes > out before packeting a single instruction. Do you reserve some resource without verification? Note that reserveResources() should be called iff canReserveResources() is true (the call order is important here) even for the triv...

...racker->reserveResources(); > > ResourceTracker->reserveResources(); > > ResourceTracker->reserveResources(); > > ResourceTracker->reserveResources(); > > DFAPacketizer.cpp:84: void llvm::DFAPacketizer::reserveResources(const > llvm::MCInstrDesc*): Assertion `CachedTable.count(StateTrans) != 0' > failed. > > It seems to not want to worry about the alu's, but it is fine as long > as there are any FU of the first row (BITS) available. > > What is missing? > > Thanks, > > Jonas Paulsson > -------------- next part -------...