Displaying 10 results from an estimated 10 matches for "canaddinsnclass".
2012 Jun 14
5
[LLVMdev] [PATCH] Refactoring the DFA generator
...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 5min, giving a speed-up factor
greater than 2.
It contains small changes:
- Transitions are stored in a set for quicker searches
- canAddInsnClass() API is split in two API's:
- canAddInsnClass() which perform a quick verification about the
possibility of having new states for a given InsnClass
- AddInsnClass() performs the actual computation of possible states.
I've regenerated the DFA table of Hexagon and all seems to be ok....
2012 Jun 14
0
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
...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 5min, giving a speed-up
> factor greater than 2.
>
> It contains small changes:
> - Transitions are stored in a set for quicker searches
> - canAddInsnClass() API is split in two API's:
> - canAddInsnClass() which perform a quick verification about the
> possibility of having new states for a given InsnClass
> - AddInsnClass() performs the actual computation of possible states.
>
> I've regenerated the DFA table of Hexagon a...
2012 Jun 26
4
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
...table. This patch reduces the build time to 5min, giving a
>>>>>> speed-up factor greater than 2.
>>>>>>
>>>>>> It contains small changes:
>>>>>> - Transitions are stored in a set for quicker searches
>>>>>> - canAddInsnClass() API is split in two API's:
>>>>>> - canAddInsnClass() which perform a quick verification about the
>>>>>> possibility of having new states for a given InsnClass
>>>>>> - AddInsnClass() performs the actual computation of possible
>...
2012 Jun 27
0
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
...duces the build time to 5min, giving a
>>>>>>> speed-up factor greater than 2.
>>>>>>>
>>>>>>> It contains small changes:
>>>>>>> - Transitions are stored in a set for quicker searches
>>>>>>> - canAddInsnClass() API is split in two API's:
>>>>>>> - canAddInsnClass() which perform a quick verification about the
>>>>>>> possibility of having new states for a given InsnClass
>>>>>>> - AddInsnClass() performs the actual computation of p...
2012 Jun 18
2
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
...es are reused :-) but it still takes up to 11min to build the
>> entire table. This patch reduces the build time to 5min, giving a
>> speed-up factor greater than 2.
>>
>> It contains small changes:
>> - Transitions are stored in a set for quicker searches
>> - canAddInsnClass() API is split in two API's:
>> - canAddInsnClass() which perform a quick verification about the
>> possibility of having new states for a given InsnClass
>> - AddInsnClass() performs the actual computation of possible states.
>>
>> I've regenerated the DF...
2012 Jun 15
0
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
...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 5min, giving a speed-up
> factor greater than 2.
>
> It contains small changes:
> - Transitions are stored in a set for quicker searches
> - canAddInsnClass() API is split in two API's:
> - canAddInsnClass() which perform a quick verification about the
> possibility of having new states for a given InsnClass
> - AddInsnClass() performs the actual computation of possible states.
>
> I've regenerated the DFA table of Hexagon a...
2012 Jun 25
2
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
...to build the
>>>> entire table. This patch reduces the build time to 5min, giving a
>>>> speed-up factor greater than 2.
>>>>
>>>> It contains small changes:
>>>> - Transitions are stored in a set for quicker searches
>>>> - canAddInsnClass() API is split in two API's:
>>>> - canAddInsnClass() which perform a quick verification about the
>>>> possibility of having new states for a given InsnClass
>>>> - AddInsnClass() performs the actual computation of possible states.
>>>>
>...
2012 Jun 20
0
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
...still takes up to 11min to build the
>>> entire table. This patch reduces the build time to 5min, giving a
>>> speed-up factor greater than 2.
>>>
>>> It contains small changes:
>>> - Transitions are stored in a set for quicker searches
>>> - canAddInsnClass() API is split in two API's:
>>> - canAddInsnClass() which perform a quick verification about the
>>> possibility of having new states for a given InsnClass
>>> - AddInsnClass() performs the actual computation of possible states.
>>>
>>> I'v...
2012 Jun 26
0
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
...>>> entire table. This patch reduces the build time to 5min, giving a
>>>>> speed-up factor greater than 2.
>>>>>
>>>>> It contains small changes:
>>>>> - Transitions are stored in a set for quicker searches
>>>>> - canAddInsnClass() API is split in two API's:
>>>>> - canAddInsnClass() which perform a quick verification about the
>>>>> possibility of having new states for a given InsnClass
>>>>> - AddInsnClass() performs the actual computation of possible
>>>>&g...
2012 Jun 28
3
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
...to 5min, giving a
>>>>>>>> speed-up factor greater than 2.
>>>>>>>>
>>>>>>>> It contains small changes:
>>>>>>>> - Transitions are stored in a set for quicker searches
>>>>>>>> - canAddInsnClass() API is split in two API's:
>>>>>>>> - canAddInsnClass() which perform a quick verification about
>>>>>>>> the
>>>>>>>> possibility of having new states for a given InsnClass
>>>>>>>> - AddIn...