blob: 28f70debd88a68e446c491857348ff36968a517c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
// IBM_PROLOG_BEGIN_TAG
// This is an automatically generated prolog.
//
// $Source: src/kernel/scheduler.C $
//
// IBM CONFIDENTIAL
//
// COPYRIGHT International Business Machines Corp. 2010 - 2011
//
// p1
//
// Object Code Only (OCO) source materials
// Licensed Internal Code Source Materials
// IBM HostBoot Licensed Internal Code
//
// The source code for this program is not published or other-
// wise divested of its trade secrets, irrespective of what has
// been deposited with the U.S. Copyright Office.
//
// Origin: 30
//
// IBM_PROLOG_END
#include <kernel/task.H>
#include <kernel/scheduler.H>
#include <kernel/taskmgr.H>
#include <kernel/cpu.H>
#include <kernel/cpumgr.H>
#include <kernel/console.H>
#include <kernel/timemgr.H>
#include <util/lockfree/atomic_construct.H>
void Scheduler::addTask(task_t* t)
{
if (t->cpu->idle_task != t)
{
// If task is pinned to this CPU, add to the per-CPU queue.
if (0 != t->affinity_pinned)
{
// Allocate a per-CPU queue if this is the first pinning to CPU.
Util::Lockfree::atomic_construct(
reinterpret_cast<Runqueue_t**>(&t->cpu->scheduler_extra));
// Insert into queue.
static_cast<Runqueue_t*>(t->cpu->scheduler_extra)->insert(t);
}
// Not pinned, add to global run-queue.
else
{
iv_taskList.insert(t);
}
}
}
void Scheduler::addTaskMasterCPU(task_t* t)
{
if (t->cpu->idle_task != t)
{
cpu_t* master = CpuManager::getMasterCPU();
// Allocate a per-CPU queue if this is the first pinning to CPU.
Util::Lockfree::atomic_construct(
reinterpret_cast<Runqueue_t**>(&master->scheduler_extra));
// Insert into queue.
static_cast<Runqueue_t*>(master->scheduler_extra)->insert(t);
}
}
void Scheduler::returnRunnable()
{
this->addTask(TaskManager::getCurrentTask());
}
void Scheduler::setNextRunnable()
{
task_t* t = NULL;
cpu_t* cpu = CpuManager::getCurrentCPU();
CpuManager::executePeriodics(cpu);
// Check for ready task in local run-queue, if it exists.
if (NULL != cpu->scheduler_extra)
{
t = static_cast<Runqueue_t*>(cpu->scheduler_extra)->remove();
}
// Check for ready task in global run-queue.
if (NULL == t)
{
t = iv_taskList.remove();
}
// Choose idle task if no other ready task is available.
if (NULL == t)
{
t = cpu->idle_task;
// TODO: Set short decrementer.
setDEC(TimeManager::getTimeSliceCount());
}
else // Set normal timeslice to decrementer.
{
setDEC(TimeManager::getTimeSliceCount());
}
TaskManager::setCurrentTask(t);
}
|