SUPPORTCHAIN_LISTBDD(3)

💖 SUPPORTCHAIN_LISTBDD 💖 (that's a section 3 manual page, bestie)

okay so before we even get into it — this little cutie lives in the BDD functions corner of the man pages, and it's part of something way bigger. let me set the scene first.

---

🌍 ORIGIN 🌍

This software belongs to the ALLIANCE CAD SYSTEM developed by the ASIM team at LIP6 laboratory of Université Pierre et Marie CURIE, in Paris, France. ✨ (yes, the Paris. iconic behavior.)

• Web : http://asim.lip6.fr/recherche/alliance/
• E-mail : alliance-users@asim.lip6.fr

---

🎀 NAME 🎀

supportChain_listBdd — returns a chained list of nodes that are used in a given BDD. fr fr that's the whole job. she's a list-maker. 💅

---

✨ SYNOPSIS ✨

#include "logmmm.h"
chain_list *supportChain_listBdd(pBdd)
pNode pBdd;

---

🦋 PARAMETER 🦋

• pBdd — a BDD. that's it, that's the vibe. she takes one BDD and she's happy. 🌸

---

💜 DESCRIPTION 💜

supportChain_listBdd() creates a chained list in which all the nodes of pBdd are represented. like, every single one. no node left behind, periodt. 👑

---

🌈 EXAMPLE 🌈

okay bestie here's the actual code, copying it exactly because I do NOT play with syntax:

#include "mutnnn.h"      /* mbk utilities */
#include "logmmm.h"
pNode nodeA,nodeB,nodeC;
pNode res;
chain_list *pt;

initializeBdd(SMALL_BDD);
nodeA = createNodeTermBdd(3);
nodeB = createNodeTermBdd(3);
nodeC = createNodeTermBdd(4);
pt = NULL;
pt = addListBdd(pt,nodeA);
pt = addListBdd(pt,nodeB);
pt = addListBdd(pt,nodeC);
res = applyBdd(OR,pt);
pt = supportChain_listBdd(res);

while (pt)
   {
   printf("--- ");
   displayBdd((pNode) pt->DATA,0);    /* displays the node */
   pt = pt->NEXT;
   }
/* it will display

--- @nodeA   index = 2  LOW = ZERO    HIGH = ONE
--- @inter   index = 3  LOW = @nodeA  HIGH = ONE
--- @res     index = 4  LOW = @inter  HIGH = ONE
*/

destroyBdd(1);

so you build your nodes, you addListBdd them onto a list, you applyBdd(OR,pt) that thing, then supportChain_listBdd(res) hands you back the chain and you walk it with pt = pt->NEXT printing each pt->DATA. and the output? literally the output above, exactly as written. no cap. 🔥

---

👀 SEE ALSO 👀

log(1), bdd(1), numberNodeBdd(3), addListBdd(3), notBdd(3), constraintBdd(3), composeBdd(3), displayBdd(3), createNodeTermBdd(3).

go read those too, they're all part of the same friend group. 🫶

---

💀 BUG REPORT 💀

This tool is under development at the ASIM department of the LIP6 laboratory.

We need your feedback to improve documentation and tools.

not me asking you to actually send feedback... please do, they're literally asking, and the docs will get better because of you. main character move. 💖

---

and that's the whole page, babe. 💅 this one came from ASIM/LIP6, dated October 1, 1997 — a vintage queen, honestly. take care of her and she'll hand you a perfectly chained list of BDD nodes every single time. 🎀🦋💖