ftmemsim-valgrind/exp-drd/drd_barrier.c

/*
  This file is part of drd, a data race detector.

  Copyright (C) 2006-2008 Bart Van Assche
  bart.vanassche@gmail.com

  This program is free software; you can redistribute it and/or
  modify it under the terms of the GNU General Public License as
  published by the Free Software Foundation; either version 2 of the
  License, or (at your option) any later version.

  This program is distributed in the hope that it will be useful, but
  WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  General Public License for more details.

  You should have received a copy of the GNU General Public License
  along with this program; if not, write to the Free Software
  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  02111-1307, USA.

  The GNU General Public License is contained in the file COPYING.
*/


#include "drd_barrier.h"
#include "drd_error.h"
#include "drd_suppression.h"
#include "priv_drd_clientreq.h"
#include "pub_tool_errormgr.h"    // VG_(maybe_record_error)()
#include "pub_tool_libcassert.h"  // tl_assert()
#include "pub_tool_libcprint.h"   // VG_(printf)()
#include "pub_tool_machine.h"     // VG_(get_IP)()
#include "pub_tool_mallocfree.h"  // VG_(malloc)(), VG_(free)()
#include "pub_tool_oset.h"
#include "pub_tool_threadstate.h" // VG_(get_running_tid)()


// Type definitions.

/* Information associated with a client-side pthread_barrier_t object. */
struct barrier_info
{
  Addr  barrier;             // Client address of barrier.
  SizeT size;                // Size in bytes of client-side object.
  Word  count;               // Participant count in a barrier wait.
  Word  pre_iteration;       // pthread_barrier_wait() call count modulo two.
  Word  post_iteration;      // pthread_barrier_wait() call count modulo two.
  Word  pre_waiters_left;    // number of waiters left for a complete barrier.
  Word  post_waiters_left;   // number of waiters left for a complete barrier.
  OSet* oset;                // Thread-specific barrier information.
};

/* Information associated with one thread participating in a barrier. */
struct barrier_thread_info
{
  UWord       tid;           // A DrdThreadId
  Word        iteration;     // iteration of last pthread_barrier_wait()
                             // call thread tid participated in.
  VectorClock vc[2];         // vector clocks corresponding to the last two
                             // pthread_barrier() calls by thread tid.
};


// Local variables.

static Bool s_trace_barrier = False;
/* To do: eliminate the upper limit on the number of barriers (4). */
struct barrier_info s_barrier[4];


// Function definitions.

void barrier_set_trace(const Bool trace_barrier)
{
  s_trace_barrier = trace_barrier;
}

/** Initialize the structure *p with the specified thread ID and iteration
 *  information. */
static void barrier_thread_initialize(struct barrier_thread_info* const p,
                                      const DrdThreadId tid,
                                      const Word iteration)
{
  p->tid = tid;
  p->iteration = iteration;
  vc_init(&p->vc[0], 0, 0);
  vc_init(&p->vc[1], 0, 0);
}

/** Deallocate the memory that was allocated in barrier_thread_initialize(). */
static void barrier_thread_destroy(struct barrier_thread_info* const p)
{
  vc_cleanup(&p->vc[0]);
  vc_cleanup(&p->vc[1]);
}

/** Initialize the structure *p with the specified client-side barrier address,
 *  barrier object size and number of participants in each barrier. */
static
void barrier_initialize(struct barrier_info* const p,
                        const Addr barrier,
                        const SizeT size,
                        const Word count)
{
  tl_assert(barrier != 0);
  tl_assert(size > 0);
  tl_assert(count > 0);

  p->barrier           = barrier;
  p->size              = size;
  p->count             = count;
  p->pre_iteration     = 0;
  p->post_iteration    = 0;
  p->pre_waiters_left  = count;
  p->post_waiters_left = count;
  tl_assert(sizeof(((struct barrier_thread_info*)0)->tid) == sizeof(Word));
  tl_assert(sizeof(((struct barrier_thread_info*)0)->tid)
            >= sizeof(DrdThreadId));
  p->oset = VG_(OSetGen_Create)(0, 0, VG_(malloc), VG_(free));
}

/** Deallocate the memory allocated by barrier_initialize() and in p->oset. */
void barrier_destroy(struct barrier_info* const p)
{
  struct barrier_thread_info* q;

  tl_assert(p);

  drd_finish_suppression(p->barrier, p->barrier + p->size);

  VG_(OSetGen_ResetIter)(p->oset);
  for ( ; (q = VG_(OSetGen_Next)(p->oset)) != 0; )
  {
    barrier_thread_destroy(q);
  }
  VG_(OSetGen_Destroy)(p->oset);
  p->barrier           = 0;
  p->size              = 0;
  p->count             = 0;
  p->pre_iteration     = 0;
  p->post_iteration    = 0;
  p->pre_waiters_left  = 0;
  p->post_waiters_left = 0;
}

/** Look up the client-side barrier address barrier in s_barrier[]. If not
 *  found, add it. */
static
struct barrier_info*
barrier_get_or_allocate(const Addr barrier, const SizeT size, const Word count)
{
  int i;

  for (i = 0; i < sizeof(s_barrier)/sizeof(s_barrier[0]); i++)
  {
    if (s_barrier[i].barrier == barrier)
    {
      tl_assert(s_barrier[i].size == size);
      return &s_barrier[i];
    }
  }
  for (i = 0; i < sizeof(s_barrier)/sizeof(s_barrier[0]); i++)
  {
    if (s_barrier[i].barrier == 0)
    {
      barrier_initialize(&s_barrier[i], barrier, size, count);
      drd_start_suppression(barrier, barrier + size, "barrier");
      return &s_barrier[i];
    }
  }
  tl_assert(0);
  return 0;
}

/** Initialize a barrier with client address barrier, client size size, and
 *  where count threads participate in each barrier. */
struct barrier_info*
barrier_init(const Addr barrier, const SizeT size, const Word count)
{
  tl_assert(barrier_get(barrier) == 0);
  return barrier_get_or_allocate(barrier, size, count);
}

/** Look up the address of the information associated with the client-side
 *  barrier object. */
struct barrier_info* barrier_get(const Addr barrier)
{
  int i;
  for (i = 0; i < sizeof(s_barrier)/sizeof(s_barrier[0]); i++)
    if (s_barrier[i].barrier == barrier)
      return &s_barrier[i];
  return 0;
}

void barrier_pre_wait(const DrdThreadId tid, const Addr barrier)
{
  struct barrier_info* p;
  struct barrier_thread_info* q;
  const UWord word_tid = tid;

  p = barrier_get(barrier);
  tl_assert(p);

  if (s_trace_barrier)
  {
    VG_(message)(Vg_DebugMsg,
                 "[%d] barrier_pre_wait(%p) iteration %d",
                 tid, barrier, p->pre_iteration);
  }

  q = VG_(OSetGen_Lookup)(p->oset, &word_tid);
  if (q == 0)
  {
    q = VG_(OSetGen_AllocNode)(p->oset, sizeof(*q));
    barrier_thread_initialize(q, tid, p->pre_iteration);
    VG_(OSetGen_Insert)(p->oset, q);
    tl_assert(VG_(OSetGen_Lookup)(p->oset, &word_tid) == q);
  }
  vc_assign(&q->vc[p->pre_iteration], &thread_get_segment(tid)->vc);
  tl_assert(q->vc[p->pre_iteration].size > 0);

  if (--p->pre_waiters_left <= 0)
  {
    p->pre_iteration    = 1 - p->pre_iteration;
    p->pre_waiters_left = p->count;
  }
}

void barrier_post_wait(const DrdThreadId tid, const Addr barrier,
                       const Bool waited)
{
  struct barrier_info* const p = barrier_get(barrier);

  tl_assert(p);

  if (s_trace_barrier)
  {
    VG_(message)(Vg_DebugMsg, "[%d] barrier_post_wait(%p) iteration %d",
                 tid, barrier, p->post_iteration);
  }

  if (waited)
  {
    const UWord word_tid = tid;
    struct barrier_thread_info* q;
    struct barrier_thread_info* r;

    q = VG_(OSetGen_Lookup)(p->oset, &word_tid);
    tl_assert(q);
    VG_(OSetGen_ResetIter)(p->oset);
    for ( ; (r = VG_(OSetGen_Next)(p->oset)) != 0; )
    {
      if (r != q)
      {
        if (s_trace_barrier)
        {
          VG_(message)(Vg_DebugMsg,
                       "[%d] barrier_post_wait: combining vc of thread %d, "
                       "iteration %d",
                       tid, r->tid, p->post_iteration);
          vc_print(&thread_get_segment(tid)->vc);
          VG_(printf)(", ");
          vc_print(&r->vc[p->post_iteration]);
          VG_(printf)(" -> ");
        }
        thread_combine_vc2(tid, &r->vc[p->post_iteration]);
        if (s_trace_barrier)
        {
          vc_print(&thread_get_segment(tid)->vc);
          VG_(printf)("\n");
        }
      }
    }

    thread_new_segment(tid);

    if (--p->post_waiters_left <= 0)
    {
      p->post_iteration    = 1 - p->post_iteration;
      p->post_waiters_left = p->count;
    }
  }
}

/** Call this function when thread tid stops to exist. */
void barrier_thread_delete(const DrdThreadId tid)
{
  int i;

  for (i = 0; i < sizeof(s_barrier)/sizeof(s_barrier[0]); i++)
  {
    struct barrier_info* const p = &s_barrier[i];
    if (p->barrier)
    {
      struct barrier_thread_info* q;
      const UWord word_tid = tid;
      q = VG_(OSetGen_Remove)(p->oset, &word_tid);
      barrier_thread_destroy(q);
      VG_(OSetGen_FreeNode)(p->oset, q);
    }
  }
}

void barrier_stop_using_mem(const Addr a1, const Addr a2)
{
  unsigned i;
  for (i = 0; i < sizeof(s_barrier)/sizeof(s_barrier[0]); i++)
  {
    if (a1 <= s_barrier[i].barrier && s_barrier[i].barrier < a2)
    {
      tl_assert(s_barrier[i].barrier + s_barrier[i].size <= a2);
      barrier_destroy(&s_barrier[i]);
    }
  }
}