Repository navigation
Expand file tree
/
Copy pathtrap.c
More file actions
173 lines (157 loc) · 3.83 KB
/
Copy pathtrap.c
File metadata and controls
173 lines (157 loc) · 3.83 KB
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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
#include "types.h"
#include "defs.h"
#include "param.h"
#include "memlayout.h"
#include "mmu.h"
#include "proc.h"
#include "x86.h"
#include "traps.h"
#include "spinlock.h"
// Interrupt descriptor table (shared by all CPUs).
struct gatedesc idt[256];
extern uint vectors[]; // in vectors.S: array of 256 entry pointers
struct spinlock tickslock;
uint ticks;
void tvinit(void)
{
int i;
for (i = 0; i < 256; i++)
SETGATE(idt[i], 0, SEG_KCODE << 3, vectors[i], 0);
SETGATE(idt[T_SYSCALL], 1, SEG_KCODE << 3, vectors[T_SYSCALL], DPL_USER);
initlock(&tickslock, "time");
}
void idtinit(void)
{
lidt(idt, sizeof(idt));
}
//PAGEBREAK: 41
void trap(struct trapframe *tf)
{
if (tf->trapno == T_SYSCALL)
{
if (myproc()->killed)
exit();
myproc()->tf = tf;
syscall();
if (myproc()->killed)
exit();
return;
}
switch (tf->trapno)
{
case T_IRQ0 + IRQ_TIMER:
if (cpuid() == 0)
{
acquire(&tickslock);
ticks++;
wakeup(&ticks);
release(&tickslock);
}
lapiceoi();
break;
case T_IRQ0 + IRQ_IDE:
ideintr();
lapiceoi();
break;
case T_IRQ0 + IRQ_IDE + 1:
// Bochs generates spurious IDE1 interrupts.
break;
case T_IRQ0 + IRQ_KBD:
kbdintr();
lapiceoi();
break;
case T_IRQ0 + IRQ_COM1:
uartintr();
lapiceoi();
break;
case T_IRQ0 + 7:
case T_IRQ0 + IRQ_SPURIOUS:
cprintf("cpu%d: spurious interrupt at %x:%x\n",
cpuid(), tf->cs, tf->eip);
lapiceoi();
break;
//PAGEBREAK: 13
default:
if (myproc() == 0 || (tf->cs & 3) == 0)
{
// In kernel, it must be our mistake.
cprintf("unexpected trap %d from cpu %d eip %x (cr2=0x%x)\n",
tf->trapno, cpuid(), tf->eip, rcr2());
panic("trap");
}
// In user space, assume process misbehaved.
cprintf("pid %d %s: trap %d err %d on cpu %d "
"eip 0x%x addr 0x%x--kill proc\n",
myproc()->pid, myproc()->name, tf->trapno,
tf->err, cpuid(), tf->eip, rcr2());
myproc()->killed = 1;
}
// Force process exit if it has been killed and is in user space.
// (If it is still executing in the kernel, let it keep running
// until it gets to the regular system call return.)
if (myproc() && myproc()->killed && (tf->cs & 3) == DPL_USER)
exit();
// Force process to give up CPU on clock tick.
// If interrupts were on while locks held, would need to check nlock.
// On each tick, check the remaining time left for current process,
// if zero, yield.
if (myproc() && myproc()->state == RUNNING &&
tf->trapno == T_IRQ0 + IRQ_TIMER)
{
switch (policy)
{
case DEFAULT:
yield();
break;
case ROUND_ROBIN:
if (myproc()->rr_remaining_t == 0)
{
// Reset remainin time back to quantum
myproc()->rr_remaining_t = QUANTUM;
yield();
}
else
{
myproc()->rr_remaining_t--;
}
break;
case PRIORITY:
case INVERSE_PRIORITY:
yield();
break;
case MULTILAYRED_PRIORITY:
switch (myproc()->queue)
{
case 1: // default
case 2: // priority scheduling
case 3: // reverse priority scheduling
yield();
break;
case 4: // round robin scheduling
if (myproc()->rr_remaining_t == 0)
{
// Reset remainin time back to quantum
myproc()->rr_remaining_t = QUANTUM;
yield();
}
else
{
myproc()->rr_remaining_t--;
}
break;
default:
yield();
break;
}
break;
}
}
// Update each process sleeping, runnable, running time
if (tf->trapno == T_IRQ0 + IRQ_TIMER)
{
updateStateDurations();
}
// Check if the process has been killed since we yielded
if (myproc() && myproc()->killed && (tf->cs & 3) == DPL_USER)
exit();
}