@@ -106,7 +106,6 @@ typedef struct relation
106
106
static int vector_size; // size of vector
107
107
static int next_count; // number of partitions of the transition relation
108
108
static rel_t *next; // each partition of the transition relation
109
- static int has_actions = 0 ;
110
109
111
110
#define Abort (...) { fprintf (stderr, __VA_ARGS__); fprintf (stderr, " Abort at line %d!\n " , __LINE__); exit (-1 ); }
112
111
@@ -233,12 +232,14 @@ TASK_2(MDD, strip_actions, MDD, dd, MDD, meta)
233
232
if (dd == lddmc_false) return lddmc_false;
234
233
if (dd == lddmc_true) {
235
234
// now meta must be end...
235
+ #ifndef NDEBUG
236
236
if (meta != lddmc_true) {
237
237
const mddnode_t nmeta = LDD_GETNODE (meta);
238
238
const uint32_t vmeta = mddnode_getvalue (nmeta);
239
239
// printf("Vmeta is %d\n", (int)vmeta);
240
240
assert (vmeta == (uint32_t )-1 );
241
241
}
242
+ #endif
242
243
return lddmc_true;
243
244
}
244
245
@@ -358,7 +359,9 @@ ldd_rel_to_meddly(const MDD dd, const MDD meta, expert_forest *F, const int leve
358
359
return (int )result;
359
360
}
360
361
362
+ #ifndef NDEBUG
361
363
const mddnode_t n = LDD_GETNODE (dd);
364
+ #endif
362
365
363
366
const mddnode_t nmeta = LDD_GETNODE (meta);
364
367
const uint32_t vmeta = mddnode_getvalue (nmeta);
@@ -501,6 +504,7 @@ VOID_TASK_0(gc_end)
501
504
printf (" Garbage collection done\n " );
502
505
}
503
506
507
+ #if 0
504
508
static void
505
509
print_matrix(size_t size, MDD meta)
506
510
{
@@ -527,6 +531,7 @@ print_matrix(size_t size, MDD meta)
527
531
print_matrix(size-1, lddmc_follow(meta, val));
528
532
}
529
533
}
534
+ #endif
530
535
531
536
void run ()
532
537
{
0 commit comments