1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
/*
* MONA
* Copyright (C) 1997-2002 BRICS.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
* USA.
*/
#include <stdio.h>
#include "bdd_dump.h"
void bddReverseMarks(bdd_manager *bddm, bdd_ptr p)
{
if ((signed) bdd_mark(bddm, p) < 0) {
bdd_set_mark(bddm, p, ~bdd_mark(bddm, p));
if (!bdd_is_leaf(bddm, p)) {
bddReverseMarks(bddm, bdd_else(bddm, p));
bddReverseMarks(bddm, bdd_then(bddm, p));
}
}
}
void bddDumpNode(bdd_manager *bddm, bdd_ptr p)
{
if ((signed) bdd_mark(bddm, p) >= 0) {
bdd_set_mark(bddm, p, ~bdd_mark(bddm, p));
if (!bdd_is_leaf(bddm, p)) {
printf("%-3u: idx=%-3u lo=%-3u hi=%-3u\n",
p,
bdd_ifindex(bddm, p),
bdd_else(bddm, p),
bdd_then(bddm, p));
bddDumpNode(bddm, bdd_else(bddm, p));
bddDumpNode(bddm, bdd_then(bddm, p));
}
else
printf("%-3u: state=%-3u\n", p, bdd_leaf_value(bddm, p));
}
}
void bddDump(bdd_manager *bddm)
{
int i;
printf("\nBDD DUMP:\n");
for (i = 0; i < bdd_roots_length(bddm); i++)
bddDumpNode(bddm, BDD_ROOT(bddm, i));
printf("END\n\n");
for (i = 0; i < bdd_roots_length(bddm); i++)
bddReverseMarks(bddm, BDD_ROOT(bddm, i));
}
|
