2005-10-10 08:50:37 -04:00
|
|
|
/*
|
|
|
|
* Spin and read/write lock operations.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2001-2004 Paul Mackerras <paulus@au.ibm.com>, IBM
|
|
|
|
* Copyright (C) 2001 Anton Blanchard <anton@au.ibm.com>, IBM
|
|
|
|
* Copyright (C) 2002 Dave Engebretsen <engebret@us.ibm.com>, IBM
|
|
|
|
* Rework to support virtual processors
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/stringify.h>
|
2005-10-30 21:57:01 -05:00
|
|
|
#include <linux/smp.h>
|
2005-10-10 08:50:37 -04:00
|
|
|
|
|
|
|
/* waiting for a spinlock... */
|
|
|
|
#if defined(CONFIG_PPC_SPLPAR) || defined(CONFIG_PPC_ISERIES)
|
|
|
|
#include <asm/hvcall.h>
|
2005-11-01 00:59:20 -05:00
|
|
|
#include <asm/iseries/hv_call.h>
|
2005-11-06 21:18:13 -05:00
|
|
|
#include <asm/smp.h>
|
2005-10-10 08:50:37 -04:00
|
|
|
|
|
|
|
void __spin_yield(raw_spinlock_t *lock)
|
|
|
|
{
|
|
|
|
unsigned int lock_value, holder_cpu, yield_count;
|
|
|
|
|
|
|
|
lock_value = lock->slock;
|
|
|
|
if (lock_value == 0)
|
|
|
|
return;
|
|
|
|
holder_cpu = lock_value & 0xffff;
|
|
|
|
BUG_ON(holder_cpu >= NR_CPUS);
|
2006-01-12 18:26:42 -05:00
|
|
|
yield_count = lppaca[holder_cpu].yield_count;
|
2005-10-10 08:50:37 -04:00
|
|
|
if ((yield_count & 1) == 0)
|
|
|
|
return; /* virtual cpu is currently running */
|
|
|
|
rmb();
|
|
|
|
if (lock->slock != lock_value)
|
|
|
|
return; /* something has changed */
|
|
|
|
#ifdef CONFIG_PPC_ISERIES
|
|
|
|
HvCall2(HvCallBaseYieldProcessor, HvCall_YieldToProc,
|
|
|
|
((u64)holder_cpu << 32) | yield_count);
|
|
|
|
#else
|
|
|
|
plpar_hcall_norets(H_CONFER, get_hard_smp_processor_id(holder_cpu),
|
|
|
|
yield_count);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Waiting for a read lock or a write lock on a rwlock...
|
|
|
|
* This turns out to be the same for read and write locks, since
|
|
|
|
* we only know the holder if it is write-locked.
|
|
|
|
*/
|
|
|
|
void __rw_yield(raw_rwlock_t *rw)
|
|
|
|
{
|
|
|
|
int lock_value;
|
|
|
|
unsigned int holder_cpu, yield_count;
|
|
|
|
|
|
|
|
lock_value = rw->lock;
|
|
|
|
if (lock_value >= 0)
|
|
|
|
return; /* no write lock at present */
|
|
|
|
holder_cpu = lock_value & 0xffff;
|
|
|
|
BUG_ON(holder_cpu >= NR_CPUS);
|
2006-01-12 18:26:42 -05:00
|
|
|
yield_count = lppaca[holder_cpu].yield_count;
|
2005-10-10 08:50:37 -04:00
|
|
|
if ((yield_count & 1) == 0)
|
|
|
|
return; /* virtual cpu is currently running */
|
|
|
|
rmb();
|
|
|
|
if (rw->lock != lock_value)
|
|
|
|
return; /* something has changed */
|
|
|
|
#ifdef CONFIG_PPC_ISERIES
|
|
|
|
HvCall2(HvCallBaseYieldProcessor, HvCall_YieldToProc,
|
|
|
|
((u64)holder_cpu << 32) | yield_count);
|
|
|
|
#else
|
|
|
|
plpar_hcall_norets(H_CONFER, get_hard_smp_processor_id(holder_cpu),
|
|
|
|
yield_count);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
void __raw_spin_unlock_wait(raw_spinlock_t *lock)
|
|
|
|
{
|
|
|
|
while (lock->slock) {
|
|
|
|
HMT_low();
|
|
|
|
if (SHARED_PROCESSOR)
|
|
|
|
__spin_yield(lock);
|
|
|
|
}
|
|
|
|
HMT_medium();
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(__raw_spin_unlock_wait);
|