Wrapped DRD_() macro around all vector clock function names.

git-svn-id: svn://svn.valgrind.org/valgrind/trunk@9159 a5019735-40e9-0310-863c-91ae7b9d1cf9
diff --git a/drd/drd_thread.c b/drd/drd_thread.c
index 42f2144..2523d7b 100644
--- a/drd/drd_thread.c
+++ b/drd/drd_thread.c
@@ -257,8 +257,8 @@
     {
       VG_(snprintf)(msg + VG_(strlen)(msg), msg_size - VG_(strlen)(msg),
                     ", new vc: ");
-      vc_snprint(msg + VG_(strlen)(msg), msg_size - VG_(strlen)(msg),
-                 thread_get_vc(drd_joiner));
+      DRD_(vc_snprint)(msg + VG_(strlen)(msg), msg_size - VG_(strlen)(msg),
+                       thread_get_vc(drd_joiner));
     }
     VG_(message)(Vg_DebugMsg, "%s", msg);
     VG_(free)(msg);
@@ -568,9 +568,9 @@
     if (latest_sg)
     {
       if (first)
-        vc_assign(vc, &latest_sg->vc);
+        DRD_(vc_assign)(vc, &latest_sg->vc);
       else
-        vc_min(vc, &latest_sg->vc);
+        DRD_(vc_min)(vc, &latest_sg->vc);
       first = False;
     }
   }
@@ -589,9 +589,9 @@
     if (latest_sg)
     {
       if (first)
-        vc_assign(vc, &latest_sg->vc);
+        DRD_(vc_assign)(vc, &latest_sg->vc);
       else
-        vc_combine(vc, &latest_sg->vc);
+        DRD_(vc_combine)(vc, &latest_sg->vc);
       first = False;
     }
   }
@@ -609,25 +609,25 @@
 
   s_discard_ordered_segments_count++;
 
-  vc_init(&thread_vc_min, 0, 0);
+  DRD_(vc_init)(&thread_vc_min, 0, 0);
   thread_compute_minimum_vc(&thread_vc_min);
   if (sg_get_trace())
   {
     char msg[256];
     VectorClock thread_vc_max;
 
-    vc_init(&thread_vc_max, 0, 0);
+    DRD_(vc_init)(&thread_vc_max, 0, 0);
     thread_compute_maximum_vc(&thread_vc_max);
     VG_(snprintf)(msg, sizeof(msg),
                   "Discarding ordered segments -- min vc is ");
-    vc_snprint(msg + VG_(strlen)(msg), sizeof(msg) - VG_(strlen)(msg),
-               &thread_vc_min);
+    DRD_(vc_snprint)(msg + VG_(strlen)(msg), sizeof(msg) - VG_(strlen)(msg),
+                     &thread_vc_min);
     VG_(snprintf)(msg + VG_(strlen)(msg), sizeof(msg) - VG_(strlen)(msg),
                   ", max vc is ");
-    vc_snprint(msg + VG_(strlen)(msg), sizeof(msg) - VG_(strlen)(msg),
-               &thread_vc_max);
+    DRD_(vc_snprint)(msg + VG_(strlen)(msg), sizeof(msg) - VG_(strlen)(msg),
+                     &thread_vc_max);
     VG_(message)(Vg_UserMsg, "%s", msg);
-    vc_cleanup(&thread_vc_max);
+    DRD_(vc_cleanup)(&thread_vc_max);
   }
 
   for (i = 0; i < sizeof(s_threadinfo) / sizeof(s_threadinfo[0]); i++)
@@ -635,13 +635,13 @@
     Segment* sg;
     Segment* sg_next;
     for (sg = s_threadinfo[i].first;
-         sg && (sg_next = sg->next) && vc_lte(&sg->vc, &thread_vc_min);
+         sg && (sg_next = sg->next) && DRD_(vc_lte)(&sg->vc, &thread_vc_min);
          sg = sg_next)
     {
       thread_discard_segment(i, sg);
     }
   }
-  vc_cleanup(&thread_vc_min);
+  DRD_(vc_cleanup)(&thread_vc_min);
 }
 
 /** Merge all segments that may be merged without triggering false positives
@@ -690,7 +690,7 @@
  *  @param new_sg Pointer to the most recent segment of thread tid.
  */
 static Bool conflict_set_update_needed(const DrdThreadId tid,
-                                     const Segment* const new_sg)
+                                       const Segment* const new_sg)
 {
 #if 0
   unsigned i;
@@ -721,19 +721,19 @@
       /* If the expression below evaluates to false, this expression will */
       /* also evaluate to false for all subsequent iterations. So stop    */
       /* iterating.                                                       */
-      if (vc_lte(&q->vc, &old_sg->vc))
+      if (DRD_(vc_lte)(&q->vc, &old_sg->vc))
         break;
       /* If the vector clock of the 2nd the last segment is not ordered   */
       /* to the vector clock of segment q, and the last segment is, ask   */
       /* the caller to update the conflict set.                             */
-      if (! vc_lte(&old_sg->vc, &q->vc))
+      if (! DRD_(vc_lte)(&old_sg->vc, &q->vc))
       {
         return True;
       }
       /* If the vector clock of the last segment is not ordered to the    */
       /* vector clock of segment q, ask the caller to update the conflict   */
       /* set.                                                             */
-      if (! vc_lte(&q->vc, &new_sg->vc) && ! vc_lte(&new_sg->vc, &q->vc))
+      if (! DRD_(vc_lte)(&q->vc, &new_sg->vc) && ! DRD_(vc_lte)(&new_sg->vc, &q->vc))
       {
         return True;
       }
@@ -785,7 +785,7 @@
             && joinee != DRD_INVALID_THREADID);
   tl_assert(s_threadinfo[joiner].last);
   tl_assert(s_threadinfo[joinee].last);
-  vc_combine(&s_threadinfo[joiner].last->vc, &s_threadinfo[joinee].last->vc);
+  DRD_(vc_combine)(&s_threadinfo[joiner].last->vc, &s_threadinfo[joinee].last->vc);
   thread_discard_ordered_segments();
 
   if (joiner == s_drd_running_tid)
@@ -804,7 +804,7 @@
             && tid != DRD_INVALID_THREADID);
   tl_assert(s_threadinfo[tid].last);
   tl_assert(vc);
-  vc_combine(&s_threadinfo[tid].last->vc, vc);
+  DRD_(vc_combine)(&s_threadinfo[tid].last->vc, vc);
   thread_compute_conflict_set(&s_conflict_set, tid);
   thread_discard_ordered_segments();
   s_conflict_set_combine_vc_count++;
@@ -940,9 +940,9 @@
         // decreasing vector clocks, if q->vc <= p->vc, then 
         // q->next->vc <= p->vc will also hold. Hence, break out of the
         // loop once this condition is met.
-        if (vc_lte(&q->vc, &p->vc))
+        if (DRD_(vc_lte)(&q->vc, &p->vc))
           break;
-        if (! vc_lte(&p->vc, &q->vc))
+        if (! DRD_(vc_lte)(&p->vc, &q->vc))
         {
           if (bm_has_conflict_with(q->bm, addr, addr + size, access_type))
           {
@@ -1030,9 +1030,9 @@
     VG_(snprintf)(msg, sizeof(msg),
                   "computing conflict set for thread %d/%d with vc ",
                   DrdThreadIdToVgThreadId(tid), tid);
-    vc_snprint(msg + VG_(strlen)(msg),
-               sizeof(msg) - VG_(strlen)(msg),
-               &s_threadinfo[tid].last->vc);
+    DRD_(vc_snprint)(msg + VG_(strlen)(msg),
+                     sizeof(msg) - VG_(strlen)(msg),
+                     &s_threadinfo[tid].last->vc);
     VG_(message)(Vg_UserMsg, "%s", msg);
   }
 
@@ -1047,9 +1047,9 @@
       VG_(snprintf)(msg, sizeof(msg),
                     "conflict set: thread [%d] at vc ",
                     tid);
-      vc_snprint(msg + VG_(strlen)(msg),
-                 sizeof(msg) - VG_(strlen)(msg),
-                 &p->vc);
+      DRD_(vc_snprint)(msg + VG_(strlen)(msg),
+                       sizeof(msg) - VG_(strlen)(msg),
+                       &p->vc);
       VG_(message)(Vg_UserMsg, "%s", msg);
     }
 
@@ -1060,16 +1060,16 @@
         const Segment* q;
         for (q = s_threadinfo[j].last; q; q = q->prev)
         {
-          if (! vc_lte(&q->vc, &p->vc) && ! vc_lte(&p->vc, &q->vc))
+          if (! DRD_(vc_lte)(&q->vc, &p->vc) && ! DRD_(vc_lte)(&p->vc, &q->vc))
           {
             if (s_trace_conflict_set)
             {
               char msg[256];
               VG_(snprintf)(msg, sizeof(msg),
                             "conflict set: [%d] merging segment ", j);
-              vc_snprint(msg + VG_(strlen)(msg),
-                         sizeof(msg) - VG_(strlen)(msg),
-                         &q->vc);
+              DRD_(vc_snprint)(msg + VG_(strlen)(msg),
+                               sizeof(msg) - VG_(strlen)(msg),
+                               &q->vc);
               VG_(message)(Vg_UserMsg, "%s", msg);
             }
             bm_merge2(*conflict_set, q->bm);
@@ -1081,9 +1081,9 @@
               char msg[256];
               VG_(snprintf)(msg, sizeof(msg),
                             "conflict set: [%d] ignoring segment ", j);
-              vc_snprint(msg + VG_(strlen)(msg),
-                         sizeof(msg) - VG_(strlen)(msg),
-                         &q->vc);
+              DRD_(vc_snprint)(msg + VG_(strlen)(msg),
+                               sizeof(msg) - VG_(strlen)(msg),
+                               &q->vc);
               VG_(message)(Vg_UserMsg, "%s", msg);
             }
           }