X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;ds=sidebyside;f=clockvector.cc;h=062ac4148e6573a4f00f59ccd6b947c5d37259e7;hb=1732a51f04b471f5019377c5860672fc3ada0088;hp=95896ed3a61a7d62b725028b04d7c939245f83a8;hpb=32141451cba1b6f2ba68a443007e25d696e2bb9c;p=model-checker.git
diff --git a/clockvector.cc b/clockvector.cc
index 95896ed..062ac41 100644
--- a/clockvector.cc
+++ b/clockvector.cc
@@ -6,6 +6,7 @@
#include "action.h"
#include "clockvector.h"
#include "common.h"
+#include "threads-model.h"
/**
* Constructs a new ClockVector, given a parent ClockVector and a first
@@ -18,10 +19,9 @@
ClockVector::ClockVector(ClockVector *parent, ModelAction *act)
{
num_threads = model->get_num_threads();
- clock = (int *)MYMALLOC(num_threads * sizeof(int));
- memset(clock, 0, num_threads * sizeof(int));
+ clock = (modelclock_t *)snapshot_calloc(num_threads, sizeof(int));
if (parent)
- std::memcpy(clock, parent->clock, parent->num_threads * sizeof(int));
+ std::memcpy(clock, parent->clock, parent->num_threads * sizeof(modelclock_t));
if (act)
clock[id_to_int(act->get_tid())] = act->get_seq_number();
@@ -30,24 +30,24 @@ ClockVector::ClockVector(ClockVector *parent, ModelAction *act)
/** @brief Destructor */
ClockVector::~ClockVector()
{
- MYFREE(clock);
+ snapshot_free(clock);
}
/**
- * Merge a clock vector into this vector, using a pairwise vector. The
+ * Merge a clock vector into this vector, using a pairwise comparison. The
* resulting vector length will be the maximum length of the two being merged.
* @param cv is the ClockVector being merged into this vector.
*/
-void ClockVector::merge(ClockVector *cv)
+void ClockVector::merge(const ClockVector *cv)
{
- int *clk = clock;
+ modelclock_t *clk = clock;
bool resize = false;
ASSERT(cv != NULL);
if (cv->num_threads > num_threads) {
resize = true;
- clk = (int *)MYMALLOC(cv->num_threads * sizeof(int));
+ clk = (modelclock_t *)snapshot_malloc(cv->num_threads * sizeof(modelclock_t));
}
/* Element-wise maximum */
@@ -58,7 +58,7 @@ void ClockVector::merge(ClockVector *cv)
for (int i = num_threads; i < cv->num_threads; i++)
clk[i] = cv->clock[i];
num_threads = cv->num_threads;
- MYFREE(clock);
+ snapshot_free(clock);
}
clock = clk;
}
@@ -75,7 +75,7 @@ void ClockVector::merge(ClockVector *cv)
* thread, false otherwise. That is, this function returns:
*
act <= cv[act->tid]
*/
-bool ClockVector::synchronized_since(ModelAction *act) const
+bool ClockVector::synchronized_since(const ModelAction *act) const
{
int i = id_to_int(act->get_tid());
@@ -84,11 +84,32 @@ bool ClockVector::synchronized_since(ModelAction *act) const
return false;
}
+bool ClockVector::has_synchronized_with(const ClockVector *cv) const
+{
+ ASSERT(cv);
+ if (cv->num_threads > num_threads)
+ return false;
+ for (int i = 0; i < cv->num_threads; i++)
+ if (cv->clock[i] > clock[i])
+ return false;
+ return true;
+}
+
+/** Gets the clock corresponding to a given thread id from the clock vector. */
+modelclock_t ClockVector::getClock(thread_id_t thread) {
+ int threadid = id_to_int(thread);
+
+ if (threadid < num_threads)
+ return clock[threadid];
+ else
+ return 0;
+}
+
/** @brief Formats and prints this ClockVector's data. */
void ClockVector::print() const
{
int i;
printf("CV: (");
for (i = 0; i < num_threads; i++)
- printf("%2d%s", clock[i], (i == num_threads - 1) ? ")\n" : ", ");
+ printf("%2u%s", clock[i], (i == num_threads - 1) ? ")\n" : ", ");
}