summaryrefslogtreecommitdiff
path: root/rts/Schedule.c
diff options
context:
space:
mode:
authorSimon Marlow <marlowsd@gmail.com>2010-11-26 14:06:20 +0000
committerSimon Marlow <marlowsd@gmail.com>2010-11-26 14:06:20 +0000
commit42c62ec74a48ca7b450c46e2b8d35faf4e2ae8f7 (patch)
treefb49ad5dda10a06a2ef3802f848a1c2bfa0dd216 /rts/Schedule.c
parent61f93d4611724685c5808bcfd41e3d3e0f3aa94f (diff)
downloadhaskell-42c62ec74a48ca7b450c46e2b8d35faf4e2ae8f7.tar.gz
small tidyup
Diffstat (limited to 'rts/Schedule.c')
-rw-r--r--rts/Schedule.c6
1 files changed, 2 insertions, 4 deletions
diff --git a/rts/Schedule.c b/rts/Schedule.c
index 8e39814873..51f8e758a8 100644
--- a/rts/Schedule.c
+++ b/rts/Schedule.c
@@ -1031,10 +1031,8 @@ scheduleHandleHeapOverflow( Capability *cap, StgTSO *t )
cap->r.rNursery->n_blocks == 1) { // paranoia to prevent infinite loop
// if the nursery has only one block.
- ACQUIRE_SM_LOCK
- bd = allocGroup( blocks );
- RELEASE_SM_LOCK
- cap->r.rNursery->n_blocks += blocks;
+ bd = allocGroup_lock(blocks);
+ cap->r.rNursery->n_blocks += blocks;
// link the new group into the list
bd->link = cap->r.rCurrentNursery;