summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAustin Seipp <austin@well-typed.com>2014-07-21 20:38:38 -0500
committerAustin Seipp <austin@well-typed.com>2014-07-28 09:29:17 -0500
commitcf2980cb94a6c30f0f2693af26d1297d8f67f505 (patch)
tree98d0071304a771ecd6c0b678a80132e95fae10f8
parent95378c2af5a2e091dda44302bdd8ebc7c585248d (diff)
downloadhaskell-cf2980cb94a6c30f0f2693af26d1297d8f67f505.tar.gz
rts: detab/dewhitespace WSDeque.h
Signed-off-by: Austin Seipp <austin@well-typed.com>
-rw-r--r--rts/WSDeque.h12
1 files changed, 6 insertions, 6 deletions
diff --git a/rts/WSDeque.h b/rts/WSDeque.h
index 9c62478113..4993d5ac61 100644
--- a/rts/WSDeque.h
+++ b/rts/WSDeque.h
@@ -3,7 +3,7 @@
* (c) The GHC Team, 2009
*
* Work-stealing Deque data structure
- *
+ *
* ---------------------------------------------------------------------------*/
#ifndef WSDEQUE_H
@@ -11,8 +11,8 @@
typedef struct WSDeque_ {
// Size of elements array. Used for modulo calculation: we round up
- // to powers of 2 and use the dyadic log (modulo == bitwise &)
- StgWord size;
+ // to powers of 2 and use the dyadic log (modulo == bitwise &)
+ StgWord size;
StgWord moduloSize; /* bitmask for modulo */
// top, index where multiple readers steal() (protected by a cas)
@@ -24,7 +24,7 @@ typedef struct WSDeque_ {
// both top and bottom are continuously incremented, and used as
// an index modulo the current array size.
-
+
// lower bound on the current top value. This is an internal
// optimisation to avoid unnecessarily accessing the top field
// inside pushBottom
@@ -41,7 +41,7 @@ typedef struct WSDeque_ {
/* INVARIANTS, in this order: reasonable size,
topBound consistent, space pointer, space accessible to us.
-
+
NB. This is safe to use only (a) on a spark pool owned by the
current thread, or (b) when there's only one thread running, or no
stealing going on (e.g. during GC).
@@ -54,7 +54,7 @@ typedef struct WSDeque_ {
ASSERT(*((p)->elements - 1 + ((p)->size)) || 1);
// No: it is possible that top > bottom when using pop()
-// ASSERT((p)->bottom >= (p)->top);
+// ASSERT((p)->bottom >= (p)->top);
// ASSERT((p)->size > (p)->bottom - (p)->top);
/* -----------------------------------------------------------------------------