Displaying 3 results from an estimated 3 matches for "validtransitions".
2012 Jun 27
0
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
Committed in r159281.
-Anshu
On 6/26/2012 3:04 AM, Ivan Llopard wrote:
> Hi Anshu,
>
> I don't have commit access. It applies correctly on trunk, I've just
> checked it. Could you please commit it?
>
> Ivan
>
> On 26/06/2012 04:44, adasgupt at codeaurora.org wrote:
>> Hi Ivan,
>>
>> Sorry, I should have been more explicit in my last email. The
2012 Jun 26
4
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
Hi Anshu,
I don't have commit access. It applies correctly on trunk, I've just
checked it. Could you please commit it?
Ivan
On 26/06/2012 04:44, adasgupt at codeaurora.org wrote:
> Hi Ivan,
>
> Sorry, I should have been more explicit in my last email. The patch looks
> good to me. Please check that it applies on trunk and go ahead and commit.
>
> Thanks
> -Anshu
2012 Jun 28
3
[LLVMdev] [llvm-commits] [PATCH] Refactoring the DFA generator
...LargestInput)
- LargestInput = T->input;
-
// Add the new transition.
bool Added = stateTransitions[T->from].insert(T).second;
assert(Added && "Cannot have multiple states for the same input");
@@ -353,18 +391,18 @@
// to construct the StateEntry table.
int ValidTransitions = 0;
for (unsigned i = 0; i < states.size(); ++i, ++SI) {
+ assert (((*SI)->stateNum == (int) i) && "Mismatch in state numbers");
StateEntry[i] = ValidTransitions;
- for (unsigned j = 0; j <= LargestInput; ++j) {
- assert (((*SI)->stateNum == (int) i...