Commit 72d2cf92 authored by Thibault Allançon's avatar Thibault Allançon

WIP: quick test setup deadlock_bitstate

parent 2e0f4ac7
Pipeline #19035 failed with stage
in 35 minutes and 42 seconds
......@@ -165,6 +165,8 @@ namespace spot
cspins_iterator::~cspins_iterator()
{
delete[] cond_;
for (auto& s : successors_)
delete[] s;
successors_.clear();
}
......
......@@ -98,7 +98,7 @@ namespace spot
tm_.start("DFS thread " + std::to_string(tid_));
}
bool push(deadlock_state s)
bool push(deadlock_state& s)
{
auto it = map_.insert(s.st, brick_state_hasher());
if (!it.isnew())
......
......@@ -30,6 +30,7 @@
#include <spot/mc/bloemen_ec.hh>
#include <spot/mc/cndfs.hh>
#include <spot/mc/deadlock.hh>
#include <spot/mc/deadlock_bitstate.hh>
#include <spot/mc/ec.hh>
#include <spot/misc/common.hh>
#include <spot/misc/timer.hh>
......@@ -88,7 +89,7 @@ namespace spot
has_deadlock(kripke_ptr sys)
{
spot::timer_map tm;
using algo_name = spot::swarmed_deadlock<State, Iterator, Hash, Equal>;
using algo_name = spot::swarmed_deadlock_bitstate<State, Iterator, Hash, Equal>;
unsigned nbth = sys->get_threads();
typename algo_name::shared_map map;
......@@ -97,7 +98,7 @@ namespace spot
tm.start("Initialisation");
std::vector<algo_name*> swarmed(nbth);
for (unsigned i = 0; i < nbth; ++i)
swarmed[i] = new algo_name(*sys, map, i, stop);
swarmed[i] = new algo_name(*sys, map, 100000000, i, stop);
tm.stop("Initialisation");
std::mutex iomutex;
......@@ -142,6 +143,8 @@ namespace spot
for (auto& t : threads)
t.join();
tm.stop("Run");
for (unsigned i = 0; i < nbth; ++i)
swarmed[i]->dealloc();
std::vector<deadlock_stats> stats;
bool has_deadlock = false;
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment