Skip to content
Snippets Groups Projects
spinlock.c 2.49 KiB
Newer Older
rsc's avatar
rsc committed
// Mutual exclusion spin locks.

#include "types.h"
#include "defs.h"
rsc's avatar
rsc committed
#include "param.h"
#include "mmu.h"
rtm's avatar
rtm committed
#include "proc.h"
#include "spinlock.h"
initlock(struct spinlock *lk, char *name)
  lk->name = name;
  lk->locked = 0;
Russ Cox's avatar
Russ Cox committed
  lk->cpu = 0;
rsc's avatar
rsc committed
// Acquire the lock.
// Loops (spins) until the lock is acquired.
rtm's avatar
rtm committed
// Holding a lock for a long time may cause
// other CPUs to waste time spinning to acquire it.
acquire(struct spinlock *lk)
  pushcli(); // disable interrupts to avoid deadlock.
  if(holding(lk))
    panic("acquire");
rsc's avatar
rsc committed

rsc's avatar
 
rsc committed
  // The xchg is atomic.
  // It also serializes, so that reads after acquire are not
  // reordered before it. 
  while(xchg(&lk->locked, 1) != 0)
rsc's avatar
rsc committed

rsc's avatar
rsc committed
  // Record info about lock acquisition for debugging.
Russ Cox's avatar
Russ Cox committed
  lk->cpu = cpu;
  getcallerpcs(&lk, lk->pcs);
rsc's avatar
rsc committed
// Release the lock.
release(struct spinlock *lk)
  if(!holding(lk))
    panic("release");
rsc's avatar
rsc committed

  lk->pcs[0] = 0;
Russ Cox's avatar
Russ Cox committed
  lk->cpu = 0;
rsc's avatar
rsc committed

rsc's avatar
 
rsc committed
  // The xchg serializes, so that reads before release are 
  // not reordered after it.  The 1996 PentiumPro manual (Volume 3,
  // 7.2) says reads can be carried out speculatively and in
  // any order, which implies we need to serialize here.
  // But the 2007 Intel 64 Architecture Memory Ordering White
  // Paper says that Intel 64 and IA-32 will not move a load
  // after a store. So lock->locked = 0 would work here.
  // The xchg being asm volatile ensures gcc emits it after
  // the above assignments (and after the critical section).
  xchg(&lk->locked, 0);
rsc's avatar
 
rsc committed

  popcli();
rtm's avatar
rtm committed
}

// Record the current call stack in pcs[] by following the %ebp chain.
void
getcallerpcs(void *v, uint pcs[])
{
  uint *ebp;
  int i;
  
  ebp = (uint*)v - 2;
  for(i = 0; i < 10; i++){
Russ Cox's avatar
Russ Cox committed
    if(ebp == 0 || ebp < (uint*)0x100000 || ebp == (uint*)0xffffffff)
      break;
    pcs[i] = ebp[1];     // saved %eip
    ebp = (uint*)ebp[0]; // saved %ebp
  }
  for(; i < 10; i++)
    pcs[i] = 0;
}

// Check whether this cpu is holding the lock.
int
holding(struct spinlock *lock)
{
Russ Cox's avatar
Russ Cox committed
  return lock->locked && lock->cpu == cpu;
rsc's avatar
 
rsc committed

rsc's avatar
 
rsc committed
// Pushcli/popcli are like cli/sti except that they are matched:
// it takes two popcli to undo two pushcli.  Also, if interrupts
// are off, then pushcli, popcli leaves them off.
rsc's avatar
 
rsc committed

void
pushcli(void)
rsc's avatar
 
rsc committed
{
rsc's avatar
 
rsc committed
  int eflags;
  
  eflags = readeflags();
rsc's avatar
 
rsc committed
  cli();
Russ Cox's avatar
Russ Cox committed
  if(cpu->ncli++ == 0)
    cpu->intena = eflags & FL_IF;
rsc's avatar
 
rsc committed
}

void
popcli(void)
rsc's avatar
 
rsc committed
{
  if(readeflags()&FL_IF)
    panic("popcli - interruptible");
Russ Cox's avatar
Russ Cox committed
  if(--cpu->ncli < 0)
    panic("popcli");
Russ Cox's avatar
Russ Cox committed
  if(cpu->ncli == 0 && cpu->intena)
rsc's avatar
 
rsc committed
    sti();
}