alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

[buddy] * src/bddop.c (apply_rec, appquant_rec): Improve caching by

Browse source 
reordering operands of commutative operators.
This commit is contained in:
Alexandre Duret-Lutz 2011-06-10 18:39:28 +02:00
parent c42d55e6b1
commit fb3edb47e0
2 changed files with 121 additions and 16 deletions
Download patch file Download diff file Expand all files Collapse all files

5
buddy/ChangeLog
View file

@ -1,3 +1,8 @@
2011-06-10 Alexandre Duret-Lutz <adl@lrde.epita.fr>
* src/bddop.c (apply_rec, appquant_rec): Improve caching by
reordering operands of commutative operators.
2011-06-09 Alexandre Duret-Lutz <adl@lrde.epita.fr> 2011-06-09 Alexandre Duret-Lutz <adl@lrde.epita.fr>
Remove some valgrind warnings about uninitialized memory when Remove some valgrind warnings about uninitialized memory when

132
buddy/src/bddop.c
View file

@ -570,36 +570,76 @@ static BDD apply_rec(BDD l, BDD r)
case bddop_and: case bddop_and:
if (l == r) if (l == r)
return l; return l;
if (ISZERO(l) || ISZERO(r)) /* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
if (ISZERO(l) /* || ISZERO(r) */)
return 0; return 0;
if (ISONE(l)) if (ISONE(l))
return r; return r;
if (ISONE(r)) /* if (ISONE(r))
return l; return l; */
break; break;
case bddop_or: case bddop_or:
if (l == r) if (l == r)
return l; return l;
/* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
if (ISONE(l) || ISONE(r)) if (ISONE(l) || ISONE(r))
return 1; return 1;
if (ISZERO(l)) if (ISZERO(l))
return r; return r;
if (ISZERO(r)) /* if (ISZERO(r))
return l; return l; */
break; break;
case bddop_xor: case bddop_xor:
if (l == r) if (l == r)
return 0; return 0;
/* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
if (ISZERO(l)) if (ISZERO(l))
return r; return r;
if (ISZERO(r)) /* if (ISZERO(r))
return l; return l; */
break; break;
case bddop_nand: case bddop_nand:
if (ISZERO(l) || ISZERO(r)) /* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
if (ISZERO(l) /* || ISZERO(r) */)
return 1; return 1;
break; break;
case bddop_nor: case bddop_nor:
/* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
if (ISONE(l) || ISONE(r)) if (ISONE(l) || ISONE(r))
return 0; return 0;
break; break;
@ -611,6 +651,16 @@ static BDD apply_rec(BDD l, BDD r)
if (ISONE(r)) if (ISONE(r))
return 1; return 1;
break; break;
case bddop_biimp:
/* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
break;
} }
if (ISCONST(l) && ISCONST(r)) if (ISCONST(l) && ISCONST(r))
@ -2083,40 +2133,90 @@ static int appquant_rec(int l, int r)
switch (appexop) switch (appexop)
{ {
case bddop_and: case bddop_and:
if (l == 0 || r == 0) /* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
if (l == 0 /* || r == 0 */)
return 0; return 0;
if (l == r) if (l == r)
return quant_rec(l); return quant_rec(l);
if (l == 1) if (l == 1)
return quant_rec(r); return quant_rec(r);
if (r == 1) /* if (r == 1)
return quant_rec(l); return quant_rec(l); */
break; break;
case bddop_or: case bddop_or:
if (l == 1 || r == 1) if (l == 1 || r == 1)
return 1; return 1;
if (l == r) if (l == r)
return quant_rec(l); return quant_rec(l);
/* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
if (l == 0) if (l == 0)
return quant_rec(r); return quant_rec(r);
if (r == 0) /* if (r == 0)
return quant_rec(l); return quant_rec(l); */
break; break;
case bddop_xor: case bddop_xor:
if (l == r) if (l == r)
return 0; return 0;
/* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
if (l == 0) if (l == 0)
return quant_rec(r); return quant_rec(r);
if (r == 0) /* if (r == 0)
return quant_rec(l); return quant_rec(l); */
break; break;
case bddop_nand: case bddop_nand:
if (l == 0 || r == 0) /* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
if (l == 0 /* || r == 0 */)
return 1; return 1;
break; break;
case bddop_nor: case bddop_nor:
if (l == 1 || r == 1) if (l == 1 || r == 1)
return 0; return 0;
/* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
break;
case bddop_biimp:
/* The operation is commutative, so lets
order the arguments to favor cache hits. */
if (l > r)
{
BDD tmp = l;
l = r;
r = tmp;
}
break; break;
} }