search for: dominatedby

...for (SetVector<unsigned>::iterator I = Remove.begin(), E = Remove.end(); I != E; ++I) { unsigned n = *I; - for (Node::iterator NI = IG.node(n)->begin(), NE = IG.node(n)->end(); - NI != NE; ++NI) { - 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)...

...t;::iterator I = Remove.begin(), E = > Remove.end(); > I != E; ++I) { > unsigned n = *I; > - for (Node::iterator NI = IG.node(n)->begin(), NE = > IG.node(n)->end(); > - NI != NE; ++NI) { > - 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) { > + Ineq...

On Thu, 31 May 2007, Chuck Rose III wrote: > Our project is cross platform and on Windows we use VStudio 2005. > VStudio presents a couple of issues related around it's STL > implementation and also it's non-respect for the no-return semantic of > abort(). Ok. We want the source to be portable, so it's goodness to get these fixes into the main tree. > I've fixed

Hola LLVMers, Our project is cross platform and on Windows we use VStudio 2005. VStudio presents a couple of issues related around it's STL implementation and also it's non-respect for the no-return semantic of abort(). I've fixed it locally, but I'd like to send a patch so I don't have to do this every time I update from the source repository. So.... if I'm

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

...le. In the Edge class (for example) this function will fail to compile in debug. iterator find(unsigned n, ETNode *Subtree) { iterator E = end(); for (iterator I = std::lower_bound(begin(), E, n); I != E && I->To == n; ++I) { if (Subtree->DominatedBy(I->Subtree)) return I; } return E; } The debug paths through VStudio's STL through the std::lower_bound function get to this template: template<class _Ty1, class _Ty2> inline bool __CLRCALL_OR_CDECL _Debug_lt(const _Ty1& _Left, const _Ty2&...