search for: reversepredicate

Displaying 6 results from an estimated 6 matches for "reversepredicate".

2008 May 26
2
[LLVMdev] use after free [was: A quick update on FreeBSD support]
...ew LWP 100066] [New Thread 0xd040b0 (LWP 100066)] [Switching to Thread 0xd040b0 (LWP 100066)] Breakpoint 3, makeEqual (this=0x7fffffffe110, V1=0xd1c420, V2=0xd3b168) at /nfs/llvm/src/llvm/lib/Transforms/Scalar/ PredicateSimplifier.cpp:1612 1612 IG.node(NI->To)->update(n1, reversePredicate(NI- >LV), Top); (gdb) p NI $28 = ((anonymous namespace)::InequalityGraph::Edge *) 0xd56340 (gdb) watch *0xd56340 Watchpoint 6: *13984576 (gdb) c Continuing. Watchpoint 6: *13984576 Old value = 2 New value = 1515870810 0x00000008013e1e84 in memset () from /lib/libc.so.7 (gdb) bt #0 0x00000008...
2008 May 25
0
[LLVMdev] A quick update on FreeBSD support
...assert((E->LV & EQ_BIT) && "Node inequal to itself."); continue; } - if (Remove.count(NI->To)) + if (Remove.count(E->To)) continue; - IG.node(NI->To)->update(n1, reversePredicate(NI->LV), Top); - IG.node(n1)->update(NI->To, NI->LV, Top); + IG.node(E->To)->update(n1, reversePredicate(E->LV), Top); + E = &(*N)[i]; + Size = N->size(); + IG.node(n1)->update(E->To, E->LV, Top)...
2008 May 26
0
[LLVMdev] use after free [was: A quick update on FreeBSD support]
...040b0 (LWP 100066)] > [Switching to Thread 0xd040b0 (LWP 100066)] > > Breakpoint 3, makeEqual (this=0x7fffffffe110, V1=0xd1c420, V2=0xd3b168) > at /nfs/llvm/src/llvm/lib/Transforms/Scalar/ > PredicateSimplifier.cpp:1612 > 1612 IG.node(NI->To)->update(n1, reversePredicate(NI- > >LV), Top); > (gdb) p NI > $28 = ((anonymous namespace)::InequalityGraph::Edge *) 0xd56340 > (gdb) watch *0xd56340 > Watchpoint 6: *13984576 > (gdb) c > Continuing. > Watchpoint 6: *13984576 > > Old value = 2 > New value = 1515870810 > 0x00000008013e1...
2008 May 25
3
[LLVMdev] A quick update on FreeBSD support
...) && "Node inequal to > itself."); > continue; > } > - if (Remove.count(NI->To)) > + if (Remove.count(E->To)) > continue; > > - IG.node(NI->To)->update(n1, reversePredicate(NI->LV), > Top); > - IG.node(n1)->update(NI->To, NI->LV, Top); > + IG.node(E->To)->update(n1, reversePredicate(E->LV), > Top); > + E = &(*N)[i]; > + Size = N->size(); > + IG.node(n1)-...
2008 May 26
0
[LLVMdev] A quick update on FreeBSD support
On May 25, 2008, at 1:39 PM, Marcel Moolenaar wrote: > On May 25, 2008, at 12:58 AM, Bill Wendling wrote: > >> Could you try this (massively hacky) patch out to see if it fixes >> your >> problem? >> >> > Alas, it didn't fix the problem: > Crumbs. I think that the analysis I told you before wasn't fully correct. I think I mentioned something
2008 May 24
5
[LLVMdev] A quick update on FreeBSD support
On May 24, 2008, at 12:12 PM, Bill Wendling wrote: > Let us know if you would like extra eyes on the two PPC failures. Many > of us have a lot of experience with C++. :-) Do you know where these > allocations are? I don't mind if people help out, so here's some information: FAIL: /nfs/llvm/src/llvm/test/Transforms/PredicateSimplifier/ 2006-11-04-ReplacingZeros.ll Failed with