mirror of
https://github.com/projectacrn/acrn-hypervisor.git
synced 2026-01-04 15:14:27 +00:00
initial import
internal commit: 14ac2bc2299032fa6714d1fefa7cf0987b3e3085 Signed-off-by: Eddie Dong <eddie.dong@intel.com>
This commit is contained in:
234
hypervisor/common/schedule.c
Normal file
234
hypervisor/common/schedule.c
Normal file
@@ -0,0 +1,234 @@
|
||||
/*
|
||||
* Copyright (C) 2018 Intel Corporation. All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* * Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* * Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
* * Neither the name of Intel Corporation nor the names of its
|
||||
* contributors may be used to endorse or promote products derived
|
||||
* from this software without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#include <hv_lib.h>
|
||||
#include <acrn_common.h>
|
||||
#include <hv_arch.h>
|
||||
#include <hv_debug.h>
|
||||
#include <schedule.h>
|
||||
|
||||
struct sched_context {
|
||||
spinlock_t runqueue_lock;
|
||||
struct list_head runqueue;
|
||||
unsigned long need_scheduled;
|
||||
struct vcpu *curr_vcpu;
|
||||
spinlock_t scheduler_lock;
|
||||
};
|
||||
|
||||
static DEFINE_CPU_DATA(struct sched_context, sched_ctx);
|
||||
static unsigned long pcpu_used_bitmap;
|
||||
|
||||
void init_scheduler(void)
|
||||
{
|
||||
int i;
|
||||
|
||||
for (i = 0; i < phy_cpu_num; i++) {
|
||||
spinlock_init(&per_cpu(sched_ctx, i).runqueue_lock);
|
||||
spinlock_init(&per_cpu(sched_ctx, i).scheduler_lock);
|
||||
INIT_LIST_HEAD(&per_cpu(sched_ctx, i).runqueue);
|
||||
per_cpu(sched_ctx, i).need_scheduled = 0;
|
||||
per_cpu(sched_ctx, i).curr_vcpu = NULL;
|
||||
}
|
||||
}
|
||||
|
||||
void get_schedule_lock(int pcpu_id)
|
||||
{
|
||||
spinlock_obtain(&per_cpu(sched_ctx, pcpu_id).scheduler_lock);
|
||||
}
|
||||
|
||||
void release_schedule_lock(int pcpu_id)
|
||||
{
|
||||
spinlock_release(&per_cpu(sched_ctx, pcpu_id).scheduler_lock);
|
||||
}
|
||||
|
||||
int allocate_pcpu(void)
|
||||
{
|
||||
int i;
|
||||
|
||||
for (i = 0; i < phy_cpu_num; i++) {
|
||||
if (bitmap_test_and_set(i, &pcpu_used_bitmap) == 0) {
|
||||
#ifdef CONFIG_EFI_STUB
|
||||
efi_deferred_wakeup_pcpu(i);
|
||||
#endif
|
||||
return i;
|
||||
}
|
||||
}
|
||||
|
||||
return -1;
|
||||
}
|
||||
|
||||
void set_pcpu_used(int pcpu_id)
|
||||
{
|
||||
bitmap_set(pcpu_id, &pcpu_used_bitmap);
|
||||
}
|
||||
|
||||
void free_pcpu(int pcpu_id)
|
||||
{
|
||||
bitmap_clr(pcpu_id, &pcpu_used_bitmap);
|
||||
}
|
||||
|
||||
void add_vcpu_to_runqueue(struct vcpu *vcpu)
|
||||
{
|
||||
int pcpu_id = vcpu->pcpu_id;
|
||||
|
||||
spinlock_obtain(&per_cpu(sched_ctx, pcpu_id).runqueue_lock);
|
||||
if (list_empty(&vcpu->run_list))
|
||||
list_add_tail(&vcpu->run_list,
|
||||
&per_cpu(sched_ctx, pcpu_id).runqueue);
|
||||
spinlock_release(&per_cpu(sched_ctx, pcpu_id).runqueue_lock);
|
||||
}
|
||||
|
||||
void remove_vcpu_from_runqueue(struct vcpu *vcpu)
|
||||
{
|
||||
int pcpu_id = vcpu->pcpu_id;
|
||||
|
||||
spinlock_obtain(&per_cpu(sched_ctx, pcpu_id).runqueue_lock);
|
||||
list_del_init(&vcpu->run_list);
|
||||
spinlock_release(&per_cpu(sched_ctx, pcpu_id).runqueue_lock);
|
||||
}
|
||||
|
||||
static struct vcpu *select_next_vcpu(int pcpu_id)
|
||||
{
|
||||
struct vcpu *vcpu = NULL;
|
||||
|
||||
spinlock_obtain(&per_cpu(sched_ctx, pcpu_id).runqueue_lock);
|
||||
if (!list_empty(&per_cpu(sched_ctx, pcpu_id).runqueue)) {
|
||||
vcpu = get_first_item(&per_cpu(sched_ctx, pcpu_id).runqueue,
|
||||
struct vcpu, run_list);
|
||||
}
|
||||
spinlock_release(&per_cpu(sched_ctx, pcpu_id).runqueue_lock);
|
||||
|
||||
return vcpu;
|
||||
}
|
||||
|
||||
void make_reschedule_request(struct vcpu *vcpu)
|
||||
{
|
||||
bitmap_set(NEED_RESCHEDULED,
|
||||
&per_cpu(sched_ctx, vcpu->pcpu_id).need_scheduled);
|
||||
send_single_ipi(vcpu->pcpu_id, VECTOR_NOTIFY_VCPU);
|
||||
}
|
||||
|
||||
int need_rescheduled(int pcpu_id)
|
||||
{
|
||||
return bitmap_test_and_clear(NEED_RESCHEDULED,
|
||||
&per_cpu(sched_ctx, pcpu_id).need_scheduled);
|
||||
}
|
||||
|
||||
static void context_switch_out(struct vcpu *vcpu)
|
||||
{
|
||||
/* if it's idle thread, no action for switch out */
|
||||
if (vcpu == NULL)
|
||||
return;
|
||||
|
||||
atomic_store_rel_32(&vcpu->running, 0);
|
||||
/* do prev vcpu context switch out */
|
||||
/* For now, we don't need to invalid ept.
|
||||
* But if we have more than one vcpu on one pcpu,
|
||||
* we need add ept invalid operation here.
|
||||
*/
|
||||
}
|
||||
|
||||
static void context_switch_in(struct vcpu *vcpu)
|
||||
{
|
||||
/* update current_vcpu */
|
||||
get_cpu_var(sched_ctx).curr_vcpu = vcpu;
|
||||
|
||||
/* if it's idle thread, no action for switch out */
|
||||
if (vcpu == NULL)
|
||||
return;
|
||||
|
||||
atomic_store_rel_32(&vcpu->running, 1);
|
||||
/* FIXME:
|
||||
* Now, we don't need to load new vcpu VMCS because
|
||||
* we only do switch between vcpu loop and idle loop.
|
||||
* If we have more than one vcpu on on pcpu, need to
|
||||
* add VMCS load operation here.
|
||||
*/
|
||||
}
|
||||
|
||||
void default_idle(void)
|
||||
{
|
||||
int pcpu_id = get_cpu_id();
|
||||
|
||||
while (1) {
|
||||
if (need_rescheduled(pcpu_id))
|
||||
schedule();
|
||||
else
|
||||
__asm __volatile("pause" ::: "memory");
|
||||
}
|
||||
}
|
||||
|
||||
static void switch_to(struct vcpu *curr)
|
||||
{
|
||||
/*
|
||||
* reset stack pointer here. Otherwise, schedule
|
||||
* is recursive call and stack will overflow finally.
|
||||
*/
|
||||
uint64_t cur_sp = (uint64_t)&get_cpu_var(stack)[STACK_SIZE];
|
||||
|
||||
if (curr == NULL) {
|
||||
asm volatile ("movq %1, %%rsp\n"
|
||||
"movq $0, %%rdi\n"
|
||||
"jmp *%0\n"
|
||||
:
|
||||
: "a"(default_idle), "r"(cur_sp)
|
||||
: "memory");
|
||||
} else {
|
||||
asm volatile ("movq %2, %%rsp\n"
|
||||
"movq %0, %%rdi\n"
|
||||
"jmp *%1\n"
|
||||
:
|
||||
: "c"(curr), "a"(vcpu_thread), "r"(cur_sp)
|
||||
: "memory");
|
||||
}
|
||||
}
|
||||
|
||||
void schedule(void)
|
||||
{
|
||||
int pcpu_id = get_cpu_id();
|
||||
struct vcpu *next = NULL;
|
||||
struct vcpu *prev = per_cpu(sched_ctx, pcpu_id).curr_vcpu;
|
||||
|
||||
get_schedule_lock(pcpu_id);
|
||||
next = select_next_vcpu(pcpu_id);
|
||||
|
||||
if (prev == next) {
|
||||
release_schedule_lock(pcpu_id);
|
||||
return;
|
||||
}
|
||||
|
||||
context_switch_out(prev);
|
||||
context_switch_in(next);
|
||||
release_schedule_lock(pcpu_id);
|
||||
|
||||
switch_to(next);
|
||||
|
||||
ASSERT(false, "Shouldn't go here");
|
||||
}
|
||||
Reference in New Issue
Block a user