X-Git-Url: http://plrg.eecs.uci.edu/git/?p=c11tester.git;a=blobdiff_plain;f=clockvector.cc;h=9820b8f986b8ba93c465674212d2967e1104fd96;hp=6cd943b835b2ec2915b992101549961f622ec4ee;hb=25d73096cfc14c655f94b01bb235cc5efd1d5696;hpb=adf77053d498af32ab4c6764b50d4265bed5996c

diff --git a/clockvector.cc b/clockvector.cc
index 6cd943b8..9820b8f9 100644
--- a/clockvector.cc
+++ b/clockvector.cc
@@ -1,12 +1,13 @@
 #include <cstring>
 #include <stdlib.h>
 
-#include "model.h"
 #include "action.h"
+
 #include "clockvector.h"
 #include "common.h"
 #include "threads-model.h"
 
+
 /**
  * Constructs a new ClockVector, given a parent ClockVector and a first
  * ModelAction. This constructor can assign appropriate default settings if no
@@ -15,14 +16,17 @@
  * same thread or the parent that created this thread)
  * @param act is an action with which to update the ClockVector
  */
-ClockVector::ClockVector(ClockVector *parent, ModelAction *act)
+ClockVector::ClockVector(ClockVector *parent, const ModelAction *act)
 {
-	num_threads = model->get_num_threads();
+	num_threads = act != NULL ? int_to_id(act->get_tid()) + 1 : 0;
+	if (parent && parent->num_threads > num_threads)
+		num_threads = parent->num_threads;
+
 	clock = (modelclock_t *)snapshot_calloc(num_threads, sizeof(int));
 	if (parent)
 		std::memcpy(clock, parent->clock, parent->num_threads * sizeof(modelclock_t));
 
-	if (act)
+	if (act != NULL)
 		clock[id_to_int(act->get_tid())] = act->get_seq_number();
 }
 
@@ -37,21 +41,51 @@ ClockVector::~ClockVector()
  * 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(const ClockVector *cv)
+bool ClockVector::merge(const ClockVector *cv)
 {
 	ASSERT(cv != NULL);
-
+	bool changed = false;
 	if (cv->num_threads > num_threads) {
 		clock = (modelclock_t *)snapshot_realloc(clock, cv->num_threads * sizeof(modelclock_t));
-		for (int i= num_threads; i < cv->num_threads; i++)
+		for (int i = num_threads;i < cv->num_threads;i++)
 			clock[i] = 0;
 		num_threads = cv->num_threads;
 	}
 
 	/* Element-wise maximum */
-	for (int i = 0; i < cv->num_threads; i++)
-		if (cv->clock[i] > clock[i])
+	for (int i = 0;i < cv->num_threads;i++)
+		if (cv->clock[i] > clock[i]) {
+			clock[i] = cv->clock[i];
+			changed = true;
+		}
+
+	return changed;
+}
+
+/**
+ * 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.
+ */
+bool ClockVector::minmerge(const ClockVector *cv)
+{
+	ASSERT(cv != NULL);
+	bool changed = false;
+	if (cv->num_threads > num_threads) {
+		clock = (modelclock_t *)snapshot_realloc(clock, cv->num_threads * sizeof(modelclock_t));
+		for (int i = num_threads;i < cv->num_threads;i++)
+			clock[i] = 0;
+		num_threads = cv->num_threads;
+	}
+
+	/* Element-wise minimum */
+	for (int i = 0;i < cv->num_threads;i++)
+		if (cv->clock[i] < clock[i]) {
 			clock[i] = cv->clock[i];
+			changed = true;
+		}
+
+	return changed;
 }
 
 /**
@@ -89,7 +123,7 @@ modelclock_t ClockVector::getClock(thread_id_t thread) {
 void ClockVector::print() const
 {
 	int i;
-	model_print("CV: (");
-	for (i = 0; i < num_threads; i++)
+	model_print("(");
+	for (i = 0;i < num_threads;i++)
 		model_print("%2u%s", clock[i], (i == num_threads - 1) ? ")\n" : ", ");
 }