UPVARBDD(3)
okay so bestie, this is upVarBdd(3) from the BDD functions page β yes, the one about bringing up an index in a BDD. π
π¦ ORIGIN π¦
okay so this software belongs to the ALLIANCE CAD SYSTEM, developed by the ASIM team at the LIP6 laboratory of UniversitΓ© Pierre et Marie CURIE, in Paris, France. π
- Web :
http://asim.lip6.fr/recherche/alliance/ - E-mail :
alliance-users@asim.lip6.fr
β¨ NAME β¨
upVarBdd β brings up an index in a BDD. π
π SYNOPSIS π
#include "logmmm.h"
pNode upVarBdd(pBdd,oldIndex,newIndex)
pNode pBdd;
short oldIndex,newIndex;
π PARAMETERS π
pBddβ the BDD where the index is getting brought up. πoldIndexβ the index to come up.newIndexβ the new index.
πΈ DESCRIPTION πΈ
upVarBdd() constructs a graph obtained by bringing oldIndex up to newIndex. This function is called by the BDDs reordering function. πΈ
π₯ EXAMPLE π₯
here's the whole cute little run, bestie:
#include "mutnnn.h" /* mbk utilities */
#include "logmmm.h"
pNode nodeA,nodeB;
pNode res;
initializeBdd(SMALL_BDD);
nodeA = createNodeTermBdd(3);
nodeB = createNodeTermBdd(3);
res = applyBinBdd(OR,nodeA,nodeB); /* res = (OR a b)
res = upVarBdd(res,2,4);
displayBdd(res,1);
/* it will display
@res INDEX 4 LOW = @nodeB HIGH = ONE
@nodeB INDEX 3 LOW = ZERO HIGH = ONE
*/
destroyBdd(1);
π ERROR π
if you hit this:
"upVarBdd : error - newIndex <= oldIndex"
then the rule is simple: The new index must be higher than the old index. periodt. π
π SEE ALSO π
log(1), bdd(1), applyBdd(3), notBdd(3), constraintBdd(3), composeBdd(3), applyBinBdd(3), addListBdd(3), displayBdd(3), createNodeTermBdd(3). π
π«Ά BUG REPORT π«Ά
This tool is under development at the ASIM department of the LIP6 laboratory. We need your feedback to improve documentation and tools. π«Ά
this cute lil page comes from ASIM/LIP6, dated October 1, 1997, and it's UPVARBDD(3) β mwah, bye bestie! ππ
π¦ where this page comes from
- nixos 26.05: alliance 5.1.1-unstable-2025-02-24
- nixpkgs unstable: alliance 5.1.1-unstable-2025-02-24
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms