search for: inequalitygraph

Displaying 10 results from an estimated 10 matches for "inequalitygraph".

2007 Jul 27
2
[LLVMdev] Couple of changes (2005 and other toolchain related)
...(677): could be 'bool `anonymous-namespace'::operator <(const llvm::Value *,const `anonymous-namespace'::ValueRanges::ScopedRange &)' [found using argument- dependent lookup] while trying to match the argument list '(const unsigned int, `anonymous-namespace'::InequalityGraph::Edge)' c:\libraries\llvm-2.0\lib\transforms\scalar\predicatesimplifier.cpp(295) : see reference to function template instantiation '_FwdIt std::lower_bound<`anonymous-namespace'::InequalityGraph::Node::iterator,unsigned int>(_FwdIt,_FwdIt,const _Ty &)' being com...
2008 May 25
3
[LLVMdev] A quick update on FreeBSD support
...edBy(Top)) { > - if (NI->To == n1) { > - assert((NI->LV & EQ_BIT) && "Node inequal to > itself."); > + Node *N = IG.node(n); > + for (unsigned Size = N->size(), i = 0; i < Size; ++i) { > + InequalityGraph::Edge *E = &(*N)[i]; > + if (E->Subtree->DominatedBy(Top)) { > + if (E->To == n1) { > + assert((E->LV & EQ_BIT) && "Node inequal to > itself."); > continue; > } > -...
2008 May 25
0
[LLVMdev] A quick update on FreeBSD support
...if (NI->Subtree->DominatedBy(Top)) { - if (NI->To == n1) { - assert((NI->LV & EQ_BIT) && "Node inequal to itself."); + Node *N = IG.node(n); + for (unsigned Size = N->size(), i = 0; i < Size; ++i) { + InequalityGraph::Edge *E = &(*N)[i]; + if (E->Subtree->DominatedBy(Top)) { + if (E->To == n1) { + assert((E->LV & EQ_BIT) && "Node inequal to itself."); continue; } - if (Remove.count(NI->...
2007 Jul 27
0
[LLVMdev] Couple of changes (2005 and other toolchain related)
...677) : could be 'bool `anonymous-namespace'::operator <(const llvm::Value *,const `anonymous-namespace'::ValueRanges::ScopedRange &)' [found using argument- dependent lookup] while trying to match the argument list '(const unsigned int, `anonymous-namespace'::InequalityGraph::Edge)' c:\libraries\llvm-2.0\lib\transforms\scalar\predicatesimplifier.cpp(295) : see reference to function template instantiation '_FwdIt std::lower_bound<`anonymous-namespace'::InequalityGraph::Node::iterator, unsigned int>(_FwdIt,_FwdIt,const _Ty &)' being co...
2008 May 26
0
[LLVMdev] A quick update on FreeBSD support
...get overwritten. -bw > ... > gmake[3]: Entering directory `/nfs/llvm/obj/powerpc/lib/Transforms/ > Scalar' > llvm[3]: Compiling PredicateSimplifier.cpp for Debug build > /nfs/llvm/src/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp: In > constructor '<unnamed>::InequalityGraph::Edge::Edge()': > /nfs/llvm/src/llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp:607: > warning: format '%p' expects type 'void*', but argument 2 has type > '<unnamed>::InequalityGraph::Edge*' > llvm[3]: Building Debug Archive Library libLLVMScalarOpt...
2008 May 24
5
[LLVMdev] A quick update on FreeBSD support
.../ tools/opt/opt.cpp:431 (gdb) frame 5 #5 0x01c3d134 in makeEqual (this=0x7fffd550, V1=0x2009730, V2=0x2006624) at /nfs/llvm/src/llvm/lib/Transforms/Scalar/ PredicateSimplifier.cpp:1614 1614 IG.node(n1)->update(NI->To, NI->LV, Top); (gdb) p NI $1 = ((anonymous namespace)::InequalityGraph::Edge *) 0x2036390 (gdb) p /x *NI $2 = {To = 0x5a5a5a5a, LV = 0x5a5a5a5a, Subtree = 0x5a5a5a5a} (gdb) p NE $3 = ((anonymous namespace)::InequalityGraph::Edge *) 0x203639c (gdb) p /x *NE $4 = {To = 0x5a5a5a5a, LV = 0x5a5a5a5a, Subtree = 0x5a5a5a5a} Both NI and NE are defined by the for loop: 1603...
2008 May 24
0
[LLVMdev] A quick update on FreeBSD support
On May 24, 2008, at 11:43 AM, Marcel Moolenaar wrote: > All, > > So far I've tried LLVM on amd64, i386, ia64 and powerpc under FreeBSD > and aside for ia64, things look pretty good for a first try. There > are 2 unexpected failures for PowerPC, which appear to be caused by > uninitialized memory. I'm still working on a fix for that (need to > brush up on my C++
2008 May 26
2
[LLVMdev] use after free [was: A quick update on FreeBSD support]
...(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 0x00000008013e1e84 in memset () from /lib/libc.so.7 #1 0x000000080136ecd1 in malloc_usa...
2008 May 24
2
[LLVMdev] A quick update on FreeBSD support
All, So far I've tried LLVM on amd64, i386, ia64 and powerpc under FreeBSD and aside for ia64, things look pretty good for a first try. There are 2 unexpected failures for PowerPC, which appear to be caused by uninitialized memory. I'm still working on a fix for that (need to brush up on my C++ skills). [sidenote: In FreeBSD -current, the memory allocator initializes memory with 0xa5
2008 May 26
0
[LLVMdev] use after free [was: A quick update on FreeBSD support]
...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 0x00000008013e1e84 in memset () f...