commit bedfd237fbdc80d0c917cfcb85a94b5561c92633
author bart <bart@a5019735-40e9-0310-863c-91ae7b9d1cf9> Thu Mar 26 19:07:15 2009 +0000
committer bart <bart@a5019735-40e9-0310-863c-91ae7b9d1cf9> Thu Mar 26 19:07:15 2009 +0000
tree ca3765f5de096ac686cb53fa0bc47585b031c373
parent cd7bfdf7393ca23803c4097b540e214b3aca01c4

- Reindented code such that it uses three spaces for indentation instead
  of two. The indentation of the DRD source code is now consistent with
  the other Valgrind source files.
- Added emacs mode line with indentation settings.


git-svn-id: svn://svn.valgrind.org/valgrind/trunk@9496 a5019735-40e9-0310-863c-91ae7b9d1cf9

drd/drd_vc.h

diff --git a/drd/drd_vc.h b/drd/drd_vc.h
index a97c531..c7f1fb1 100644
--- a/drd/drd_vc.h
+++ b/drd/drd_vc.h
@@ -1,3 +1,4 @@
+/* -*- mode: C; c-basic-offset: 3; -*- */
 /*
   This file is part of drd, a thread error detector.
 
@@ -52,15 +53,15 @@
 /** Vector clock element. */
 typedef struct
 {
-  DrdThreadId threadid;
-  UInt        count;
+   DrdThreadId threadid;
+   UInt        count;
 } VCElem;
 
 typedef struct
 {
-  unsigned capacity; /**< number of elements allocated for array vc. */
-  unsigned size;     /**< number of elements used of array vc. */
-  VCElem*  vc;       /**< vector clock elements. */
+   unsigned capacity; /**< number of elements allocated for array vc. */
+   unsigned size;     /**< number of elements used of array vc. */
+   VCElem*  vc;       /**< vector clock elements. */
 } VectorClock;
 
 
@@ -99,26 +100,26 @@
 static __inline__
 Bool DRD_(vc_lte)(const VectorClock* const vc1, const VectorClock* const vc2)
 {
-  unsigned i;
-  unsigned j = 0;
+   unsigned i;
+   unsigned j = 0;
 
-  for (i = 0; i < vc1->size; i++)
-  {
-    while (j < vc2->size && vc2->vc[j].threadid < vc1->vc[i].threadid)
-    {
-      j++;
-    }
-    if (j >= vc2->size || vc2->vc[j].threadid > vc1->vc[i].threadid)
-      return False;
+   for (i = 0; i < vc1->size; i++)
+   {
+      while (j < vc2->size && vc2->vc[j].threadid < vc1->vc[i].threadid)
+      {
+         j++;
+      }
+      if (j >= vc2->size || vc2->vc[j].threadid > vc1->vc[i].threadid)
+         return False;
 #ifdef ENABLE_DRD_CONSISTENCY_CHECKS
-    /* This assert statement has been commented out because of performance */
-    /* reasons.*/
-    tl_assert(j < vc2->size && vc2->vc[j].threadid == vc1->vc[i].threadid);
+      /* This assert statement has been commented out because of performance */
+      /* reasons.*/
+      tl_assert(j < vc2->size && vc2->vc[j].threadid == vc1->vc[i].threadid);
 #endif
-    if (vc1->vc[i].count > vc2->vc[j].count)
-      return False;
-  }
-  return True;
+      if (vc1->vc[i].count > vc2->vc[j].count)
+         return False;
+   }
+   return True;
 }