X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=clockvector.cc;h=ba5d1f4b2e627a76e41a8e40589b833fc00dd584;hb=HEAD;hp=c86995bc9bbb555cf9e2381d1b7df91036330a46;hpb=15162a2ac08b0a6b06e5319a7424055f4d12e01c;p=c11tester.git diff --git a/clockvector.cc b/clockvector.cc index c86995bc..ba5d1f4b 100644 --- a/clockvector.cc +++ b/clockvector.cc @@ -18,16 +18,16 @@ */ ClockVector::ClockVector(ClockVector *parent, const ModelAction *act) { - ASSERT(act); - num_threads = int_to_id(act->get_tid()) + 1; + 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)); + real_memcpy(clock, parent->clock, parent->num_threads * sizeof(modelclock_t)); - clock[id_to_int(act->get_tid())] = act->get_seq_number(); + if (act != NULL) + clock[id_to_int(act->get_tid())] = act->get_seq_number(); } /** @brief Destructor */ @@ -62,6 +62,32 @@ bool ClockVector::merge(const ClockVector *cv) 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; +} + /** * Check whether this vector's thread has synchronized with another action's * thread. This effectively checks the happens-before relation (or actually,