2007-07-18 01:37:05 +00:00
|
|
|
#ifndef _XEN_EVENTS_H
|
|
|
|
|
#define _XEN_EVENTS_H
|
|
|
|
|
|
2007-07-18 01:37:06 +00:00
|
|
|
#include <linux/interrupt.h>
|
|
|
|
|
|
|
|
|
|
#include <xen/interface/event_channel.h>
|
|
|
|
|
#include <asm/xen/hypercall.h>
|
2008-04-02 17:53:56 +00:00
|
|
|
#include <asm/xen/events.h>
|
2007-07-18 01:37:05 +00:00
|
|
|
|
2007-07-18 01:37:06 +00:00
|
|
|
int bind_evtchn_to_irq(unsigned int evtchn);
|
2007-07-18 01:37:05 +00:00
|
|
|
int bind_evtchn_to_irqhandler(unsigned int evtchn,
|
2007-07-18 01:37:06 +00:00
|
|
|
irq_handler_t handler,
|
2007-07-18 01:37:05 +00:00
|
|
|
unsigned long irqflags, const char *devname,
|
|
|
|
|
void *dev_id);
|
|
|
|
|
int bind_virq_to_irqhandler(unsigned int virq, unsigned int cpu,
|
2007-07-18 01:37:06 +00:00
|
|
|
irq_handler_t handler,
|
|
|
|
|
unsigned long irqflags, const char *devname,
|
|
|
|
|
void *dev_id);
|
|
|
|
|
int bind_ipi_to_irqhandler(enum ipi_vector ipi,
|
|
|
|
|
unsigned int cpu,
|
|
|
|
|
irq_handler_t handler,
|
|
|
|
|
unsigned long irqflags,
|
|
|
|
|
const char *devname,
|
|
|
|
|
void *dev_id);
|
2007-07-18 01:37:05 +00:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Common unbind function for all event sources. Takes IRQ to unbind from.
|
|
|
|
|
* Automatically closes the underlying event channel (even for bindings
|
|
|
|
|
* made with bind_evtchn_to_irqhandler()).
|
|
|
|
|
*/
|
|
|
|
|
void unbind_from_irqhandler(unsigned int irq, void *dev_id);
|
|
|
|
|
|
2007-07-18 01:37:06 +00:00
|
|
|
void xen_send_IPI_one(unsigned int cpu, enum ipi_vector vector);
|
2008-04-02 17:53:57 +00:00
|
|
|
int resend_irq_on_evtchn(unsigned int irq);
|
2008-05-26 22:31:23 +00:00
|
|
|
void rebind_evtchn_irq(int evtchn, int irq);
|
2007-07-18 01:37:06 +00:00
|
|
|
|
2007-07-18 01:37:05 +00:00
|
|
|
static inline void notify_remote_via_evtchn(int port)
|
|
|
|
|
{
|
|
|
|
|
struct evtchn_send send = { .port = port };
|
|
|
|
|
(void)HYPERVISOR_event_channel_op(EVTCHNOP_send, &send);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
extern void notify_remote_via_irq(int irq);
|
2008-05-26 22:31:27 +00:00
|
|
|
|
|
|
|
|
extern void xen_irq_resume(void);
|
|
|
|
|
|
xen: implement Xen-specific spinlocks
The standard ticket spinlocks are very expensive in a virtual
environment, because their performance depends on Xen's scheduler
giving vcpus time in the order that they're supposed to take the
spinlock.
This implements a Xen-specific spinlock, which should be much more
efficient.
The fast-path is essentially the old Linux-x86 locks, using a single
lock byte. The locker decrements the byte; if the result is 0, then
they have the lock. If the lock is negative, then locker must spin
until the lock is positive again.
When there's contention, the locker spin for 2^16[*] iterations waiting
to get the lock. If it fails to get the lock in that time, it adds
itself to the contention count in the lock and blocks on a per-cpu
event channel.
When unlocking the spinlock, the locker looks to see if there's anyone
blocked waiting for the lock by checking for a non-zero waiter count.
If there's a waiter, it traverses the per-cpu "lock_spinners"
variable, which contains which lock each CPU is waiting on. It picks
one CPU waiting on the lock and sends it an event to wake it up.
This allows efficient fast-path spinlock operation, while allowing
spinning vcpus to give up their processor time while waiting for a
contended lock.
[*] 2^16 iterations is threshold at which 98% locks have been taken
according to Thomas Friebel's Xen Summit talk "Preventing Guests from
Spinning Around". Therefore, we'd expect the lock and unlock slow
paths will only be entered 2% of the time.
Signed-off-by: Jeremy Fitzhardinge <jeremy.fitzhardinge@citrix.com>
Cc: Jens Axboe <axboe@kernel.dk>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Christoph Lameter <clameter@linux-foundation.org>
Cc: Petr Tesarik <ptesarik@suse.cz>
Cc: Virtualization <virtualization@lists.linux-foundation.org>
Cc: Xen devel <xen-devel@lists.xensource.com>
Cc: Thomas Friebel <thomas.friebel@amd.com>
Cc: Nick Piggin <nickpiggin@yahoo.com.au>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-07-07 19:07:53 +00:00
|
|
|
/* Clear an irq's pending state, in preparation for polling on it */
|
|
|
|
|
void xen_clear_irq_pending(int irq);
|
2008-08-21 00:02:18 +00:00
|
|
|
void xen_set_irq_pending(int irq);
|
|
|
|
|
bool xen_test_irq_pending(int irq);
|
xen: implement Xen-specific spinlocks
The standard ticket spinlocks are very expensive in a virtual
environment, because their performance depends on Xen's scheduler
giving vcpus time in the order that they're supposed to take the
spinlock.
This implements a Xen-specific spinlock, which should be much more
efficient.
The fast-path is essentially the old Linux-x86 locks, using a single
lock byte. The locker decrements the byte; if the result is 0, then
they have the lock. If the lock is negative, then locker must spin
until the lock is positive again.
When there's contention, the locker spin for 2^16[*] iterations waiting
to get the lock. If it fails to get the lock in that time, it adds
itself to the contention count in the lock and blocks on a per-cpu
event channel.
When unlocking the spinlock, the locker looks to see if there's anyone
blocked waiting for the lock by checking for a non-zero waiter count.
If there's a waiter, it traverses the per-cpu "lock_spinners"
variable, which contains which lock each CPU is waiting on. It picks
one CPU waiting on the lock and sends it an event to wake it up.
This allows efficient fast-path spinlock operation, while allowing
spinning vcpus to give up their processor time while waiting for a
contended lock.
[*] 2^16 iterations is threshold at which 98% locks have been taken
according to Thomas Friebel's Xen Summit talk "Preventing Guests from
Spinning Around". Therefore, we'd expect the lock and unlock slow
paths will only be entered 2% of the time.
Signed-off-by: Jeremy Fitzhardinge <jeremy.fitzhardinge@citrix.com>
Cc: Jens Axboe <axboe@kernel.dk>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Christoph Lameter <clameter@linux-foundation.org>
Cc: Petr Tesarik <ptesarik@suse.cz>
Cc: Virtualization <virtualization@lists.linux-foundation.org>
Cc: Xen devel <xen-devel@lists.xensource.com>
Cc: Thomas Friebel <thomas.friebel@amd.com>
Cc: Nick Piggin <nickpiggin@yahoo.com.au>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-07-07 19:07:53 +00:00
|
|
|
|
|
|
|
|
/* Poll waiting for an irq to become pending. In the usual case, the
|
|
|
|
|
irq will be disabled so it won't deliver an interrupt. */
|
|
|
|
|
void xen_poll_irq(int irq);
|
|
|
|
|
|
2009-11-05 21:33:09 +00:00
|
|
|
/* Poll waiting for an irq to become pending with a timeout. In the usual case,
|
|
|
|
|
* the irq will be disabled so it won't deliver an interrupt. */
|
|
|
|
|
void xen_poll_irq_timeout(int irq, u64 timeout);
|
|
|
|
|
|
2009-02-07 03:20:31 +00:00
|
|
|
/* Determine the IRQ which is bound to an event channel */
|
|
|
|
|
unsigned irq_from_evtchn(unsigned int evtchn);
|
|
|
|
|
|
2010-05-14 11:40:51 +00:00
|
|
|
/* Xen HVM evtchn vector callback */
|
|
|
|
|
extern void xen_hvm_callback_vector(void);
|
|
|
|
|
extern int xen_have_vector_callback;
|
|
|
|
|
int xen_set_callback_via(uint64_t via);
|
|
|
|
|
void xen_evtchn_do_upcall(struct pt_regs *regs);
|
|
|
|
|
void xen_hvm_evtchn_do_upcall(void);
|
|
|
|
|
|
2010-10-01 16:20:09 +00:00
|
|
|
/* Allocate an irq for a physical interrupt, given a gsi. "Legacy"
|
|
|
|
|
* GSIs are identity mapped; others are dynamically allocated as
|
|
|
|
|
* usual. */
|
2010-10-04 17:43:27 +00:00
|
|
|
int xen_allocate_pirq(unsigned gsi, int shareable, char *name);
|
2010-10-01 16:20:09 +00:00
|
|
|
|
|
|
|
|
/* Return vector allocated to pirq */
|
|
|
|
|
int xen_vector_from_irq(unsigned pirq);
|
|
|
|
|
|
|
|
|
|
/* Return gsi allocated to pirq */
|
|
|
|
|
int xen_gsi_from_irq(unsigned pirq);
|
|
|
|
|
|
2007-07-18 01:37:05 +00:00
|
|
|
#endif /* _XEN_EVENTS_H */
|
