Displaying 3 results from an estimated 3 matches for "eq_bit".
Did you mean:
ebit
2008 May 25
0
[LLVMdev] A quick update on FreeBSD support
...!= 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)[i];
+ if (E->Subtree->DominatedBy(Top)) {
+ if (E->To == n1)...
2008 May 25
3
[LLVMdev] A quick update on FreeBSD support
...igned 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)[i];
> + if (E->Subtree->DominatedBy(Top)) {
> +...
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