xv6 Rev5

Feb 19 20:50 2011 README Page 1
Feb 19 20:50 2011 table of contents Page 1
xv6 is a re-implementation of Dennis Ritchies and Ken Thompsons Unix

Version 6 (v6). xv6 loosely follows the structure and style of v6,
but is implemented for a modern x86-based multiprocessor using ANSI C.
The numbers to the left of the file names in the table are sheet numbers.
The source code has been printed in a double column format with fifty
lines per column, giving one hundred lines per sheet (or page).
Thus there is a convenient relationship between line numbers and sheet numbers.
ACKNOWLEDGMENTS
xv6 is inspired by John Lionss Commentary on UNIX 6th Edition (Peer
to Peer Communications; ISBN: 1-57398-013-7; 1st edition (June 14,
2000)). See also http://pdos.csail.mit.edu/6.828/2007/v6.html, which
provides pointers to on-line resources for v6.
xv6 borrows code from the following sources:
JOS (asm.h, elf.h, mmu.h, bootasm.S, ide.c, console.c, and others)
Plan 9 (bootother.S, mp.h, mp.c, lapic.c)
FreeBSD (ioapic.c)
NetBSD (console.c)
The following people made contributions:
Russ Cox (context switching, locking)
Cliff Frey (MP)
Xiao Yu (MP)
Nickolai Zeldovich
Austin Clements
In addition, we are grateful for the patches contributed by Greg
Price, Yandong Mao, and Hitoshi Mitake.
The code in the files that constitute xv6 is
Copyright 2006-2007 Frans Kaashoek, Robert Morris, and Russ Cox.
ERROR REPORTS
# basic headers
01 types.h
01 param.h
02 defs.h
04 x86.h
06 asm.h
07 mmu.h
09 elf.h
# system calls
29 traps.h
30 vectors.pl
30 trapasm.S
31 trap.c
32 syscall.h
33 syscall.c
34 sysproc.c
# startup
10 bootasm.S
11 bootother.S
12 bootmain.c
13 main.c
# file system
35 buf.h
36 fcntl.h
36 stat.h
37 fs.h
37 file.h
38 ide.c
40 bio.c
41 fs.c
49 file.c
50 sysfile.c
55 exec.c
# locks
15 spinlock.h
15 spinlock.c
# processes
17 proc.h
18 proc.c
23 swtch.S
24 kalloc.c
25 data.S
25 vm.c
# string operations
57 string.c
# low-level hardware
59 mp.h
60 mp.c
62 lapic.c
64 ioapic.c
65 picirq.c
66 kbd.h
67 kbd.c
68 console.c
71 timer.c
72 uart.c
73 multiboot.S
# user-level
74 initcode.S
74 usys.S
75 init.c
75 sh.c
# pipes
56 pipe.c
If you spot errors or have suggestions for improvement, please send

email to Frans Kaashoek and Robert Morris (kaashoek,rtm@csail.mit.edu).
BUILDING AND RUNNING XV6
To build xv6 on an x86 ELF machine (like Linux or FreeBSD), run "make".
On non-x86 or non-ELF machines (like OS X, even on x86), you will
need to install a cross-compiler gcc suite capable of producing x86 ELF
binaries. See http://pdos.csail.mit.edu/6.828/2007/tools.html.
Then run "make TOOLPREFIX=i386-jos-elf-".
To run xv6, you can use Bochs or QEMU, both PC simulators.
Bochs makes debugging easier, but QEMU is much faster.
To run in Bochs, run "make bochs" and then type "c" at the bochs prompt.
To run in QEMU, run "make qemu".
To create a typeset version of the code, run "make xv6.pdf". This
requires the "mpage" utility. See http://www.mesa.nl/pub/mpage/.
The source listing is preceded by a cross-reference that lists every defined

constant, struct, global variable, and function in xv6. Each entry gives,
on the same line as the name, the line number (or, in a few cases, numbers)
where the name is defined. Successive lines in an entry list the line
numbers where the name is used. For example, this entry:
swtch 2358
0317 2128 2166 2357 2358
indicates that swtch is defined on line 2358 and is mentioned on five lines
on sheets 03, 21, and 23.
Feb 19 20:50 2011 cross-references Page 1

acquire 1573
0320 1573 1577
2058 2117 2174
2266 2279 2465
3522 3542 3907
4129 4357 4390
4454 4464 4925
5663 5684 5705
7058 7106
allocproc 1855
1855 1907 1960
allocuvm 2777
0367 1937 2777
5552
alltraps 3056
3009 3017 3030
3056
ALT 6610
6610 6638 6640
argfd 5063
5063 5106 5121
5156
argint 3344
0338 3344 3358
3506 3520 5068
5358 5409 5410
argptr 3354
0339 3354 5121
5483
argstr 3371
0340 3371 5168
5395 5408 5423
BACK 7561
7561 7674 7820
backcmd 7596 7814
7596 7609 7675
7942 8055 8090
BACKSPACE 6950
6950 6967 6994
balloc 4204
4204 4225 4517
BBLOCK 3741
3741 4213 4239
B_BUSY 3559
3559 3958 4076
4091 4116 4126
B_DIRTY 3561
3561 3887 3916
3979 4118
bfree 4230
1860
2218
2480
3965
4410
4941
6860
2023
2233
3166
4070
4439
4956
7016
2791 5542
3035 3055
5133 5144
3374 3481
5121 5133
5457
5133 5156
5258 5358
5457
8089
7814 7816
7026 7032
4525 4529
4077 4088
4138
3921 3960
4230 4562 4572

bget 4066
4066 4096 4106
binit 4039
0210 1363 4039
bmap 4510
4510 4536 4619
bootmain 1216
1068 1216
bootothers 1402
1307 1370 1402
BPB 3738
3738 3741 4212
bread 4102
0211 4102 4182
4239 4311 4332
4568 4619 4669
brelse 4124
0212 4124 4127
4219 4223 4246
4341 4425 4532
4673 4733 4737
BSIZE 3708
3708 3718 3732
4619 4620 4621
4669 4670 4671
4724
buf 3550
0200 0211 0212
2920 2923 2932
3554 3555 3556
3828 3875 3904
3959 4027 4031
4053 4065 4068
4114 4124 4169
4207 4232 4305
4513 4557 4605
6828 6840 6843
7024 7038 7068
7684 7687 7688
7715 7716 7719
7725
B_VALID 3560
3560 3920 3960
bwrite 4114
0213 4114 4117
4245 4316 4340
bzero 4189
4189 4236
C 6631 7009

4575
4669 4722
4214 4240
4193 4213
4417 4526
4722
4184 4196
4317 4320
4574 4622
3738 4194
4665 4666
4721 4722
0213
2934
3810
3954
4035
4101
4180
4329
4655
6846
7101
7689
7720
0253
3550
3825
3956
4041
4104
4191
4404
4715
7003
7108
7703
7721
3979 4107
4195 4218
4530 4672
6631 6679 6704

6707 6708 6710
7022 7029 7040
CAPSLOCK 6612
6612 6645 6786
cgaputc 6955
6955 6998
cli 0517
0517 0519 1015
6906 6989
cmd 7565
7565 7577 7586
7593 7598 7602
7618 7623 7631
7651 7675 7677
7757 7758 7759
7764 7766 7768
7771 7772 7773
7776 7779 7780
7785 7786 7787
7800 7801 7803
7807 7808 7809
7814 7816 7818
7821 7822 7912
7915 7917 7921
7931 7934 7937
7946 7948 7950
7958 7960 7963
7978 7981 7985
8008 8012 8013
8022 8028 8037
8045 8051 8052
8066 8072 8073
8090 8091 8094
COM1 7213
7213 7223 7226
7229 7230 7231
7241 7257 7259
CONSOLE 3790
3790 7121 7122
consoleinit 7116
0216 1358 7116
consoleintr 7012
0218 6798 7012
consoleread 7051
7051 7122
consolewrite 7101
7101 7121
consputc 6986
6815 6846 6866
6705 6706
7009 7019
7069
1129 1660
7587
7606
7637
7752
7760
7769
7774
7782
7788
7805
7810
7819
7913
7924
7939
7953
7964
8000
8016
8038
8061
8078
7592
7615
7641
7755
7763
7770
7775
7784
7789
7806
7813
7820
7914
7930
7942
7955
7975
8003
8021
8044
8064
8084
7227 7228
7234 7240
7267 7269
7275
6884 6887
6891 6892 6986 7026

7039 7108
context 1760
0201 0317 1713 1760
1888 1889 1890 1891
2166 2328
copyout 2918
0375 2918 5562 5573
copyuvm 2853
0372 1964 2853 2864
cprintf 6852
0217 1355 1387 2326
2332 2791 3190 3203
3433 6119 6139 6253
6462 6852 6908 6909
6913
cpu 1711
0256 1355 1387 1389
1506 1565 1586 1608
1661 1662 1670 1672
1721 1725 1736 2128
2165 2166 2167 2575
2594 2725 2726 2727
3165 3190 3191 3203
3208 3210 6012 6013
6908
cpunum 6301
0269 1382 1384 1416
6301 6473 6482
CR0_PE 0727 1010 1124
0727 1046 1138
CR0_PG 0737
0737 2708
create 5301
2604 2613 5301 5321
5338 5361 5395 5411
CRTPORT 6951
6951 6960 6961 6962
6978 6979 6980 6981
CTL 6609
6609 6635 6639 6785
data 2523
0405 0407 0408 0421
0427 0429 0442 0446
2522 2523 2558 2678
3021 3039 3557 3889
4183 4194 4216 4217
4244 4312 4333 4418
4569 4621 4671 4723
4731 5613 5694 5716
7032
1779
2128
2866
2330
3208
6311
6910
1406
1646
1711
2159
2588
2728
3204
6311
2581
5334
6963
0423
2521
2679
3917
4242
4527
4724
6430

6437 6441 6444
6769 6772 6774
6783 6784 6785
deallocuvm 2805
0368 1940 2792
devsw 3783
3783 3788 4608
4660 4907 7121
dinode 3722
3722 3732 4306
4333 4405 4418
dirent 3746
3746 4716 4723
5205 5254
dirlink 4752
0234 4752 4767
5333 5337 5338
dirlookup 4712
0235 4712 4719
5270 5311
DIRSIZ 3744
3744 3748 4705
4829 4891 5165
DPL_USER 0777
0777 1914 1915
3122 3218 3227
E0ESC 6616
6616 6770 6774
6780
elfhdr 0955
0955 1218 1223
ELF_MAGIC 0952
0952 1229 5527
ELF_PROG_LOAD 0986
0986 5538
EOI 6213
6213 6285 6325
ERROR 6234
6234 6278
ESR 6216
6216 6281 6282
exec 5509
0222 5473 5509
7530 7626 7627
EXEC 7557
7557 7622 7759
execcmd 7569 7753
7569 7610 7623
8021 8027 8028
exit 2004
6762 6767
6775 6779
2805 2836
4610 4658
7122
4312 4330
4724 4755
4775 5184
4759 4874
4772 4828
5255 5305
2584 2585
6775 6777
5514
7468 7529
8065
7753 7755
8056 8066
0302 2004 2040

3219 3228 3466
7461 7526 7531
7635 7680 7728
fdalloc 5082
5082 5108 5373
fetchint 3316
0341 3316 3346
fetchstr 3328
0342 3328 3376
file 3750
0202 0225 0226
0230 0231 0287
4171 4904 4910
4926 4938 4939
4976 5002 5022
5066 5082 5103
5142 5153 5355
5621 6810 7208
7634 7764 7772
filealloc 4921
0225 4921 5373
fileclose 4952
0226 2015 4952
5375 5491 5492
filedup 4939
0227 1979 4939
fileinit 4914
0228 1364 4914
fileread 5002
0229 5002 5017
filestat 4976
0230 4976 5158
filewrite 5022
0231 5022 5037
FL_IF 0710
0710 1662 1668
6308
fork 1954
0303 1954 3460
7525 7743 7745
fork1 7739
7600 7642 7654
7724 7739
forkret 2183
1816 1891 2183
freevm 2830
0369 2071 2830
5589 5595
gatedesc 0901

3155 3159
7415 7418
7616 7625
7735
5488
5464
5470
0227
1782
4920
4952
5057
5117
5480
7578
7972
0229
3750
4923
4954
5063
5129
5606
7633
5627
4958 5147
5654 5656
4943 5110
5123
5135
1918 2163
7460 7523
7661 7676
2835 2877
0464 0467 0901

getcallerpcs 1626
0321 1587 1626
getcmd 7684
7684 7715
gettoken 7856
7856 7941 7945
7971 8007 8011
growproc 1931
0304 1931 3509
havedisk1 3827
3827 3864 3962
holding 1644
0322 1576 1604
ialloc 4302
0236 4302 4322
IBLOCK 3735
3735 4311 4332
I_BUSY 3777
3777 4411 4413
4457 4459
ICRHI 6227
6227 6288 6356
ICRLO 6217
6217 6289 6290
6369
ID 6210
6210 6246 6316
IDE_BSY 3812
3812 3836
IDE_CMD_READ 3817
3817 3891
IDE_CMD_WRITE 3818
3818 3888
IDE_DF 3814
3814 3838
IDE_DRDY 3813
3813 3836
IDE_ERR 3815
3815 3838
ideinit 3851
0251 1366 3851
ideintr 3902
0252 3174 3902
idelock 3824
3824 3855 3907
3965 3980 3983
iderw 3954
0253 3954 3959
4108 4119
3110
2328 6911
7957 7970
8033
1644 2157
5320 5321
4417
4436 4440
6368
6357 6359
3909 3928
3961 3963
idestart 3875
3828 3875 3878
idewait 3832
3832 3858 3880
idtinit 3128
0351 1388 3128
idup 4388
0237 1980 4388
iget 4353
4294 4318 4353
4859
iinit 4289
0238 1365 4289
ilock 4402
0239 4402 4408
4979 5011 5031
5193 5262 5274
5323 5366 5425
7083 7110
inb 0403
0403 1026 1034
3863 6154 6764
6963 7234 7240
7267 7269
initlock 1561
0323 1561 1824
3855 4043 4291
7118 7119
inituvm 2739
0370 1911 2739
inode 3763
0203 0234 0235
0239 0240 0241
0245 0246 0247
0371 1783 2753
3784 3785 4174
4301 4327 4352
4387 4388 4402
4474 4510 4554
4652 4711 4712
4853 4856 4888
5202 5253 5300
5393 5403 5421
7101
INPUT_BUF 7000
7000 7003 7024
7040 7068
insl 0412
0412 0414 1273
INT_DISABLED 6419
3926 3975
3916
4861
4373 4734
4428
5172
5309
5521
4864
5183
5313
7063
1254 3836
6767 6961
7241 7257
2427 3124
4916 5635
2744
0236
0242
0248
3756
4285
4355
4434
4585
4752
4895
5304
5515
0237
0243
0249
3763
4294
4361
4452
4602
4756
5166
5356
7051
7036 7038
3917

6419 6467
ioapic 6427
6107 6129 6130
6436 6437 6443
IOAPIC 6408
6408 6458
ioapicenable 6473
0256 3857 6473
ioapicid 6016
0257 6016 6130
6462
ioapicinit 6451
0258 1357 6451
ioapicread 6434
6434 6459 6460
ioapicwrite 6441
6441 6467 6468
IO_PIC1 6507
6507 6520 6535
6552 6562 6576
IO_PIC2 6508
6508 6521 6536
6567 6570 6579
IO_RTC 6335
6335 6348 6349
IO_TIMER1 7159
7159 7168 7178
IPB 3732
3732 3735 3741
4418
iput 4452
0240 2020 4452
4760 4882 4971
IRQ_COM1 2983
2983 3184 7242
IRQ_ERROR 2985
2985 6278
IRQ_IDE 2984
2984 3173 3177
IRQ_KBD 2982
2982 3180 7125
IRQ_SLAVE 6510
6510 6514 6552
IRQ_SPURIOUS 2986
2986 3189 6258
IRQ_TIMER 2981
2981 3164 3223
isdirempty 5202
5202 5209 5278
ismp 6014
6424 6427
6444 6458
7126 7243
6147 6461
6462
6481 6482
6544 6547
6577
6565 6566
6580
7179
4312 4333
4458 4477
5189 5431
7243
3856 3857
7126
6567
6265 7180
0277 1367 6014

6140 6143 6455
itrunc 4554
4174 4461 4554
iunlock 4434
0241 4434 4437
4981 5014 5034
5430 7056 7105
iunlockput 4474
0242 4474 4866
5174 5185 5188
5271 5279 5280
5312 5316 5340
5397 5413 5427
iupdate 4327
0243 4327 4463
5178 5195 5289
5331
I_VALID 3778
3778 4416 4426
jmpkstack 1326
1309 1322 1326
kalloc 2476
0261 1330 1332
2476 2613 2690
2868 5629
KBDATAP 6604
6604 6767
kbdgetc 6756
6756 6798
kbdintr 6796
0266 3181 6796
KBS_DIB 6603
6603 6765
KBSTATP 6602
6602 6764
KEY_DEL 6628
6628 6669 6691
KEY_DN 6622
6622 6665 6687
KEY_END 6620
6620 6668 6690
KEY_HOME 6619
6619 6668 6690
KEY_INS 6627
6627 6669 6691
KEY_LF 6623
6623 6667 6689
KEY_PGDN 6626
6626 6666 6688

6112 6120
6475
4476 4871
5179 5379
4875
5196
5291
5368
5547
4878
5266
5295
5376
5597
4580 4678
5294 5327
4455
1332 1335
1422 1873
2745 2789
6715
6711
6714
6714
6715
6713
6712
KEY_PGUP 6625
6625 6666 6688
KEY_RT 6624
6624 6667 6689
KEY_UP 6621
6621 6665 6687
kfree 2455
0262 1965 2069
2460 2819 2820
5652 5673
kill 2275
0305 2275 3209
kinit 2423
0263 1321 2423
KSTACKSIZE 0151
0151 1423 1877
kvmalloc 2565
0363 1360 2565
lapiceoi 6322
0271 3171 3175
3192 6322
lapicinit 6251
0272 1319 1384
lapicstartap 6340
0273 1426 6340
lapicw 6243
6243 6258 6264
6269 6270 6275
6282 6285 6288
6325 6356 6357
6369
lcr0 0551
0551 2709
lcr3 0573
0573 2717 2732
lgdt 0453
0453 0461 1044
7344
lidt 0467
0467 0475 3130
LINT0 6232
6232 6269
LINT1 6233
6233 6270
LIST 7560
7560 7640 7807
listcmd 7590 7801
7590 7611 7641
7946 8057 8084
loadgs 0493
6712
6713
6711
2430 2455
2839 2841
3483 7467
2728
3182 3186
6251 6253
6265
6278
6289
6359
6266
6281
6294
6368
1136 2590
8083
7801 7803
0493 2591
loaduvm 2753
0371 2753 2759
ltr 0479
0479 0481 2729
mainc 1353
1310 1334 1353
mappages 2629
2629 2695 2747
MAXARG 0161
0161 5453 5513
MAXARGS 7563
7563 7571 7572
MAXFILE 3719
3719 4665 4666
memcmp 5761
0329 5761 6043
memmove 5777
0330 1413 2748
4183 4339 4424
4829 4831 5777
memset 5754
0331 1890 1913
2692 2746 2795
5284 5460 5754
7758 7769 7785
microdelay 6331
0274 6331 6358
7258
min 4173
4173 4620 4670
mp 5902
5902 6007 6036
6044 6055 6060
6068 6069 6080
6087 6094 6104
mpbcpu 6019
0278 1319 1382
MPBUS 5952
5952 6133
mpconf 5913
5913 6079 6082
mpconfig 6080
6080 6110
mpinit 6101
0279 1318 6101
mpioapic 5939
5939 6107 6129
MPIOAPIC 5953
5953 6128
2762 5544
2796 2871
5558
8040
6088
2870 2932
4621 4671
5804 6973
2463
4194
6975
7806
2616
4314
7687
7819
6360 6370
6042
6064
6083
6110
6043
6065
6085
6150
6019
6087 6105
6119 6139
6131
MPIOINTR 5954
5954 6134
MPLINTR 5955
5955 6135
mpmain 1380
1308 1373 1380 1424
mpproc 5928
5928 6106 6117 6126
MPPROC 5951
5951 6116
mpsearch 6056
6056 6085
mpsearch1 6037
6037 6064 6068 6071
multiboot_entry 7343
7337 7342 7343
multiboot_header 7327
7326 7327 7333 7334
namecmp 4703
0244 4703 4728 5265
namei 4889
0245 1923 4889 5170
5423 5519
nameiparent 4896
0246 4854 4869 4881
5181 5260 5307
namex 4854
4854 4892 4898
NBUF 0155
0155 4031 4053
ncpu 6015
1355 1415 1726 3857
6118 6119 6123 6124
6145
NCPU 0152
0152 1725 6012
NDEV 0157
0157 4608 4658 4907
NDIRECT 3717
3717 3719 3728 3774
4520 4524 4525 4560
4568 4575 4576
NELEM 0378
0378 2322 2694 3430
nextpid 1815
1815 1869
NFILE 0154
0154 4910 4926
NINDIRECT 3718
3718 3719 4522 4570
2796 2871
panic 6901 7732
0219 1332 1335
1669 1671 1910
2158 2160 2162
2209 2460 2641
2759 2762 2819
2866 3205 3878
3963 4096 4117
4243 4322 4373
4437 4458 4536
4775 4943 4958
5209 5277 5286
5338 6901 6908
7653 7732 7745
8006 8010 8036
panicked 6817
6817 6914 6988
parseblock 8001
8001 8006 8025
parsecmd 7918
7602 7725 7918
parseexec 8017
7914 7955 8017
parseline 7935
7912 7924 7935
parsepipe 7951
7913 7939 7951
parseredirs 7964
7964 8012 8031
PCINT 6231
6231 6275
pde_t 0103
0103 0365 0366
0369 0370 0371
1773 2560 2604
2684 2687 2690
2777 2805 2830
2855 2902 2918
PDX 0809
0809 2609
PDXSHIFT 0830
0809 0815 0830
peek 7901
7901 7925 7940
7969 8005 8009
PGROUNDDOWN 0833
0833 2634 2635
PGROUNDUP 0832
0832 2428 2787
5364
4896
6015
6125
4515
4567
5462
NINODE 0156
0156 4285 4361
NO 6606
6606 6652 6655
6659 6660 6662
6679 6680 6681
6702 6703 6705
6708
NOFILE 0153
0153 1782 1977
5086
NPDENTRIES 0823
0823 2837
NPROC 0150
0150 1810 1861
2118 2257 2280
NSEGS 1708
1708 1715
nulterminate 8052
7915 7930 8052
8080 8085 8086
NUMLOCK 6613
6613 6646
O_CREATE 3603
3603 5360 7978
O_RDONLY 3600
3600 5367 7975
O_RDWR 3602
3602 5385 7514
outb 0421
0421 1031 1039
1266 1267 1268
3870 3881 3882
3885 3886 3888
6154 6348 6349
6535 6536 6544
6562 6565 6566
6576 6577 6579
6962 6978 6979
7177 7178 7179
7227 7228 7229
7259
outsl 0433
0433 0435 3889
outw 0427
0427 1074 1076
O_WRONLY 3601
3601 5384 5385
PADDR 0820
0820 2620 2717
6657
6674
6682
6706
6658
6677
6684
6707
2013 5070
2029 2062
2319
8073 8079
8091
7981
7516 7707
1264
1269
3883
3891
6520
6547
6567
6580
6980
7223
7230
1265
3861
3884
6153
6521
6552
6570
6960
6981
7226
7231
1170 1172
7978 7981
2732 2747
1577
2010
2164
2731
2835
3959
4127
4408
4719
5017
5321
7601
7928
8041
1605
2040
2206
2744
2864
3961
4225
4428
4767
5037
5334
7620
7972
7946 8008
7958
8042
0367
0372
2606
2739
2852
5517
0368
0375
2629
2753
2853
7944 7956
8024 8032
2925
2813 5551
PGSIZE 0826
0826 0832 0833
1919 2429 2459
2645 2646 2692
2747 2758 2760
2788 2795 2796
2870 2871 2929
PHYSTOP 0160
0160 2429 2459
picenable 6525
0283 3856 6525
7242
picinit 6532
0284 1356 6532
picsetmask 6517
6517 6527 6583
pinit 1822
0306 1361 1822
pipe 5611
0204 0288 0289
4969 5009 5029
5629 5635 5639
5680 5701 7463
PIPE 7559
7559 7650 7786
pipealloc 5621
0287 5485 5621
pipeclose 5661
0288 4969 5661
pipecmd 7584 7780
7584 7612 7651
7958 8058 8078
piperead 5701
0289 5009 5701
PIPESIZE 5609
5609 5613 5686
pipewrite 5680
0290 5029 5680
popcli 1666
0326 1621 1666
2733
printint 6825
6825 6874 6878
proc 1771
0205 0301 0341
1304 1557 1722
1777 1805 1810
1857 1861 1904
1940 1943 1944
1970 1971 1972
1333
2463
2743
2764
2814
2935
1912
2616
2746
2767
2862
5552
2679
7125 7180
0290
5611
5643
7652
3755
5623
5661
7653
8077
7780 7782
5694 5716
1669 1671
0342
1737
1813
1935
1957
1978
0373
1771
1854
1937
1964
1979

1980 1984 2006
2015 2016 2020
2029 2030 2038
2063 2083 2089
2125 2128 2133
2175 2205 2223
2255 2257 2277
2319 2555 2595
3104 3154 3156
3209 3210 3212
3227 3304 3316
3360 3376 3429
3435 3455 3489
3806 4167 4861
5087 5088 5146
5464 5470 5490
5583 5584 5585
5588 5604 5687
6106 6117 6118
6812 7061 7210
procdump 2304
0307 2304 7020
proghdr 0974
0974 1219 1233
PTE_ADDR 0847
0847 2611 2763
2867 2911
PTE_P 0836
0836 2610 2620
2816 2838 2865
pte_t 0849
0849 2603 2607
2632 2756 2807
PTE_U 0838
0838 2620 2747
2909
PTE_W 0837
0837 2620 2677
2747 2796 2871
PTX 0812
0812 2622
PTXSHIFT 0829
0812 0815 0829
pushcli 1655
0325 1575 1655
rcr0 0557
0557 2707
rcr2 0565
0565 3204 3211
readeflags 0485
2009
2021
2055
2110
2161
2224
2280
2722
3158
3218
3328
3431
3508
5055
5431
5503
5586
5707
6119
2014
2026
2062
2118
2166
2228
2315
2728
3201
3223
3346
3434
3525
5070
5432
5580
5587
6010
6122
5516
2817 2839
2640 2642
2907
2611 2613
2856 2904
2796 2871
2679 2680
2724
0485 1659 1668

readi 4602
0247 2768 4602
5208 5209 5525
readsb 4178
4178 4211 4238
readsect 1260
1260 1295
readseg 1279
1213 1226 1237
REDIR 7558
7558 7630 7770
redircmd 7575 7764
7575 7613 7631
7975 7978 7981
REG_ID 6410
6410 6460
REG_TABLE 6412
6412 6467 6468
REG_VER 6411
6411 6459
release 1602
0324 1602 1605
2077 2084 2135
2219 2232 2268
2469 2484 3169
3544 3909 3928
4092 4141 4364
4414 4442 4460
4933 4945 4960
5675 5688 5697
6898 7048 7062
ROOTDEV 0158
0158 4859
ROOTINO 3707
3707 4859
run 2410
2311 2410 2411
2466 2478
runcmd 7606
7606 7620 7637
7659 7666 7677
RUNNING 1768
1768 2127 2161
safestrcpy 5832
0332 1922 1984
sched 2153
0309 2039 2153
2162 2164 2176
scheduler 2108

2163 6308
4766 5012
5536
4309
1279
8071
7764 7766
8059 8072
6481 6482
1864
2177
2286
3526
3983
4380
4469
4966
5708
7082
1870
2186
2290
3531
4078
4392
4929
5672
5719
7109
2416 2457
7643 7645
7725
2311 3223
5580 5832
2158 2160
2225
0308 1390 1713 2108 2128

0324 0354 1501 1558
2166
1573 1602 1644 1806
SCROLLLOCK 6614
2203 2408 2415 3107
6614 6647
3809 3824 4026 4030
SECTSIZE 1211
4284 4905 4909 5607
1211 1273 1286 1289 1294
6808 6820 7002 7206
SEG 0768
STACK 7318
0768 2582 2583 2584 2585
7361 7377
2588
STA_R 0669 0784
SEG16 0772
0669 0784 1084 1179
0772 2725
2584 7370
SEG_ASM 0660
start 1014 1128 7407
0660 1084 1085 1179 1180
1013 1014 1067 1127
7370 7371
1163 1166 7406 7407
segdesc 0751
stat 3654
0450 0453 0751 0768 0772
0207 0230 0248 3654
1715
4585 4976 5053 5154
seginit 2573
stati 4585
0362 1320 1383 2573
0248 4585 4980
SEG_KCODE 1007 1121 1702 3050 7320 STA_W 0668 0783
1053 1150 1702 2582 3121
0668 0783 1085 1180
3122 7345
2585 2588 7371
SEG_KCPU 1704 3052
STA_X 0665 0780
1704 2588 2591 3068
0665 0780 1084 1179
SEG_KDATA 1008 1122 1703 3051 7321
2584 7370
1058 1154 1703 2583 2727
sti 0523
3065 7352
0523 0525 1673 2114
SEG_NULLASM 0654
stosb 0442
0654 1083 1178 7369
0442 0444 1239 5756
SEG_TSS 1707
strlen 5851
1707 2725 2726 2729
0333 5560 5562 5851
SEG_UCODE 1705
7923
1705 1914 2584
strncmp 5808
SEG_UDATA 1706
0334 4705 5808
1706 1915 2585
strncpy 5818
SETGATE 0921
0335 4772 5818
0921 3121 3122
STS_IG32 0798
setupkvm 2685
0798 0927
0365 1909 2567 2685 2860
STS_T32A 0795
5530
0795 2725
SHIFT 6608
STS_TG32 0799
6608 6636 6637 6785
0799 0927
skipelem 4815
sum 6025
4815 4863
6025 6027 6029 6031
sleep 2203
6043 6092
0310 2089 2203 2206 2209
superblock 3711
2309 3529 3980 4081 4412
3711 4178 4208 4233
5692 5711 7066 7479
SVR 6214
spinlock 1501
6214 6258
0206 0310 0320 0322 0323
switchkvm 2715
1561
1809
3112
4168
5612
2582
1128
4165
7503
2583
2582
7719
6032
4307
0374 2129 2706 2715

sys_link 5163
switchuvm 2722
3388 3410 5163
0373 1944 2126 2722 2731
SYS_link 3264
5588
3264 3410
swtch 2358
sys_mkdir 5390
0317 2128 2166 2357 2358
3389 3411 5390
syscall 3425
SYS_mkdir 3265
0343 3157 3306 3425
3265 3411
SYSCALL 7453 7460 7461 7462 7463 74 sys_mknod 5401
7460 7461 7462 7463 7464
3390 3412 5401
7465 7466 7467 7468 7469
SYS_mknod 3261
7470 7471 7472 7473 7474
3261 3412
7475 7476 7477 7478 7479
sys_open 5351
7480
3391 3413 5351
sys_chdir 5418
SYS_open 3260
3379 3401 5418
3260 3413
SYS_chdir 3266
sys_pipe 5477
3266 3401
3392 3414 5477
sys_close 5139
SYS_pipe 3254
3380 3402 5139
3254 3414
SYS_close 3257
sys_read 5115
3257 3402
3393 3415 5115
sys_dup 5101
SYS_read 3256
3381 3403 5101
3256 3415
SYS_dup 3267
sys_sbrk 3501
3267 3403
3394 3416 3501
sys_exec 5451
SYS_sbrk 3269
3382 3404 5451
3269 3416
SYS_exec 3259
sys_sleep 3515
3259 3404 7411
3395 3417 3515
sys_exit 3464
SYS_sleep 3270
3383 3405 3464
3270 3417
SYS_exit 3252
sys_unlink 5251
3252 3405 7416
3396 3418 5251
sys_fork 3458
SYS_unlink 3262
3384 3406 3458
3262 3418
SYS_fork 3251
sys_uptime 3538
3251 3406
3399 3421 3538
sys_fstat 5151
SYS_uptime 3271
3385 3407 5151
3271 3421
SYS_fstat 3263
sys_wait 3471
3263 3407
3397 3419 3471
sys_getpid 3487
SYS_wait 3253
3386 3408 3487
3253 3419
SYS_getpid 3268
sys_write 5127
3268 3408
3398 3420 5127
sys_kill 3477
SYS_write 3255
3387 3409 3477
3255 3420
SYS_kill 3258
taskstate 0851
3258 3409
0851 1714
TDCR 6238
6238 6264
T_DEV 3652
3652 4607 4657
T_DIR 3650
3650 4718 4865
5287 5329 5367
T_FILE 3651
3651 5314 5361
ticks 3113
0352 3113 3167
3524 3529 3543
tickslock 3112
0354 3112 3124
3522 3526 3529
3544
TICR 6236
6236 6266
TIMER 6228
6228 6265
TIMER_16BIT 7171
7171 7177
TIMER_DIV 7166
7166 7178 7179
TIMER_FREQ 7165
7165 7166
timerinit 7174
0346 1368 7174
TIMER_MODE 7168
7168 7177
TIMER_RATEGEN 7170
7170 7177
TIMER_SEL0 7169
7169 7177
T_IRQ0 2979
2979 3164 3173
3184 3188 3189
6265 6278 6467
6566
TPR 6212
6212 6294
trap 3151
3002 3004 3074
3205 3208
trapframe 0602
0602 1778 1881
trapret 3079
5411
5173 5278
5395 5426
3168 3523
3166 3169
3531 3542
3177 3180
3223 6258
6481 6547
3151 3203
3151
1817 1886 3078

T_SYSCALL 2976
2976 3122 3153
7457
tvinit 3116
0353 1362 3116
uart 7215
7215 7236 7255
uartgetc 7263
7263 7275
uartinit 7218
0357 1359 7218
uartintr 7273
0358 3185 7273
uartputc 7251
0359 6995 6997
userinit 1902
0311 1369 1902
USERTOP 0159
0159 2677 2782
uva2ka 2902
0366 2902 2926
VER 6211
6211 6274
vmenable 2702
0364 1386 2702
wait 2053
0312 2053 3473
7644 7670 7671
waitdisk 1251
1251 1263 1272
wakeup 2264
0313 2264 3168
4441 4466 5666
5696 5718 7042
wakeup1 2253
1819 2026 2033
walkpgdir 2604
2604 2637 2761
2906
writei 4652
0249 4652 4774
5286
xchg 0529
0529 1389 1582
yield 2172
0314 2172 3224
3079
7412 7417
7265
7247 7251
1910
2836
7462 7533
7726
3922 4139
5669 5691
2253 2267
2815 2863
5032 5285
1619
Feb 19 20:50 2011 xv6/types.h Page 1
Feb 19 20:50 2011 xv6/param.h Page 1
0100
0101
0102
0103
0104
0105
0106
0107
0108
0109
0110
0111
0112
0113
0114
0115
0116
0117
0118
0119
0120
0121
0122
0123
0124
0125
0126
0127
0128
0129
0130
0131
0132
0133
0134
0135
0136
0137
0138
0139
0140
0141
0142
0143
0144
0145
0146
0147
0148
0149
0150
0151
0152
0153
0154
0155
0156
0157
0158
0159
0160
0161
0162
0163
0164
0165
0166
0167
0168
0169
0170
0171
0172
0173
0174
0175
0176
0177
0178
0179
0180
0181
0182
0183
0184
0185
0186
0187
0188
0189
0190
0191
0192
0193
0194
0195
0196
0197
0198
0199
typedef
typedef
typedef
typedef
Sheet 01
unsigned int uint;

unsigned short ushort;
unsigned char uchar;
uint pde_t;
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
Sheet 01
NPROC
64 // maximum number of processes
KSTACKSIZE 4096 // size of per-process kernel stack
NCPU
8 // maximum number of CPUs
NOFILE
16 // open files per process
NFILE
100 // open files per system
NBUF
10 // size of disk block cache
NINODE
50 // maximum number of active i-nodes
NDEV
10 // maximum major device number
ROOTDEV
1 // device number of file system root disk
USERTOP 0xA0000 // end of user address space
PHYSTOP 0x1000000 // use phys mem up to here as free pool
MAXARG
32 // max exec arguments
Feb 19 20:50 2011 xv6/defs.h Page 1
0200
0201
0202
0203
0204
0205
0206
0207
0208
0209
0210
0211
0212
0213
0214
0215
0216
0217
0218
0219
0220
0221
0222
0223
0224
0225
0226
0227
0228
0229
0230
0231
0232
0233
0234
0235
0236
0237
0238
0239
0240
0241
0242
0243
0244
0245
0246
0247
0248
0249
0250
0251
0252
0253
0254
0255
0256
0257
0258
0259
0260
0261
0262
0263
0264
0265
0266
0267
0268
0269
0270
0271
0272
0273
0274
0275
0276
0277
0278
0279
0280
0281
0282
0283
0284
0285
0286
0287
0288
0289
0290
0291
0292
0293
0294
0295
0296
0297
0298
0299
struct
struct
struct
struct
struct
struct
struct
struct
buf;
context;
file;
inode;
pipe;
proc;
spinlock;
stat;
// bio.c
void
struct buf*
void
void
binit(void);
bread(uint, uint);
brelse(struct buf*);
bwrite(struct buf*);
// console.c
void
void
void
void
consoleinit(void);
cprintf(char*, ...);
consoleintr(int(*)(void));
panic(char*) __attribute__((noreturn));
// exec.c
int
exec(char*, char**);
// file.c
struct file*
void
struct file*
void
int
int
int
filealloc(void);
fileclose(struct file*);
filedup(struct file*);
fileinit(void);
fileread(struct file*, char*, int n);
filestat(struct file*, struct stat*);
filewrite(struct file*, char*, int n);
// fs.c
int
struct inode*
struct inode*
struct inode*
void
void
void
void
void
void
int
struct inode*
struct inode*
int
void
int
Sheet 02
dirlink(struct inode*, char*, uint);

dirlookup(struct inode*, char*, uint*);
ialloc(uint, short);
idup(struct inode*);
iinit(void);
ilock(struct inode*);
iput(struct inode*);
iunlock(struct inode*);
iunlockput(struct inode*);
iupdate(struct inode*);
namecmp(const char*, const char*);
namei(char*);
nameiparent(char*, char*);
readi(struct inode*, char*, uint, uint);
stati(struct inode*, struct stat*);
writei(struct inode*, char*, uint, uint);
// ide.c
void
void
void
ideinit(void);
ideintr(void);
iderw(struct buf*);
// ioapic.c
void
extern uchar
void
ioapicenable(int irq, int cpu);

ioapicid;
ioapicinit(void);
// kalloc.c
char*
void
void
kalloc(void);
kfree(char*);
kinit(void);
// kbd.c
void
kbdintr(void);
// lapic.c
int
extern volatile
void
void
void
void
cpunum(void);
uint*
lapic;
lapiceoi(void);
lapicinit(int);
lapicstartap(uchar, uint);
microdelay(int);
// mp.c
extern int
int
void
void
ismp;
mpbcpu(void);
mpinit(void);
mpstartthem(void);
// picirq.c
void
void
picenable(int);
picinit(void);
// pipe.c
int
void
int
int
pipealloc(struct file**, struct file**);

pipeclose(struct pipe*, int);
piperead(struct pipe*, char*, int);
pipewrite(struct pipe*, char*, int);
Sheet 02
0300
0301
0302
0303
0304
0305
0306
0307
0308
0309
0310
0311
0312
0313
0314
0315
0316
0317
0318
0319
0320
0321
0322
0323
0324
0325
0326
0327
0328
0329
0330
0331
0332
0333
0334
0335
0336
0337
0338
0339
0340
0341
0342
0343
0344
0345
0346
0347
0348
0349
0350
0351
0352
0353
0354
0355
0356
0357
0358
0359
0360
0361
0362
0363
0364
0365
0366
0367
0368
0369
0370
0371
0372
0373
0374
0375
0376
0377
0378
0379
0380
0381
0382
0383
0384
0385
0386
0387
0388
0389
0390
0391
0392
0393
0394
0395
0396
0397
0398
0399
// proc.c
struct proc*
void
int
int
int
void
void
void
void
void
void
int
void
void
copyproc(struct proc*);
exit(void);
fork(void);
growproc(int);
kill(int);
pinit(void);
procdump(void);
scheduler(void) __attribute__((noreturn));
sched(void);
sleep(void*, struct spinlock*);
userinit(void);
wait(void);
wakeup(void*);
yield(void);
// swtch.S
void
swtch(struct context**, struct context*);
// spinlock.c
void
void
int
void
void
void
void
acquire(struct spinlock*);
getcallerpcs(void*, uint*);
holding(struct spinlock*);
initlock(struct spinlock*, char*);
release(struct spinlock*);
pushcli(void);
popcli(void);
// string.c
int
void*
void*
char*
int
int
char*
memcmp(const void*, const void*, uint);

memmove(void*, const void*, uint);
memset(void*, int, uint);
safestrcpy(char*, const char*, int);
strlen(const char*);
strncmp(const char*, const char*, uint);
strncpy(char*, const char*, int);
// syscall.c
int
int
int
int
int
void
argint(int, int*);
argptr(int, char**, int);
argstr(int, char**);
fetchint(struct proc*, uint, int*);
fetchstr(struct proc*, uint, char**);
syscall(void);
// timer.c
void
timerinit(void);
Sheet 03
// trap.c
void
idtinit(void);
extern uint
ticks;
void
tvinit(void);
extern struct spinlock tickslock;
// uart.c
void
void
void
uartinit(void);
uartintr(void);
uartputc(int);
// vm.c
void
void
void
pde_t*
char*
int
int
void
void
int
pde_t*
void
void
int
seginit(void);
kvmalloc(void);
vmenable(void);
setupkvm(void);
uva2ka(pde_t*, char*);
allocuvm(pde_t*, uint, uint);
deallocuvm(pde_t*, uint, uint);
freevm(pde_t*);
inituvm(pde_t*, char*, uint);
loaduvm(pde_t*, char*, struct inode*, uint, uint);
copyuvm(pde_t*, uint);
switchuvm(struct proc*);
switchkvm(void);
copyout(pde_t*, uint, void*, uint);
// number of elements in fixed-size array

#define NELEM(x) (sizeof(x)/sizeof((x)[0]))
Sheet 03
Feb 19 20:50 2011 xv6/x86.h Page 1
Feb 19 20:50 2011 xv6/x86.h Page 2
0400
0401
0402
0403
0404
0405
0406
0407
0408
0409
0410
0411
0412
0413
0414
0415
0416
0417
0418
0419
0420
0421
0422
0423
0424
0425
0426
0427
0428
0429
0430
0431
0432
0433
0434
0435
0436
0437
0438
0439
0440
0441
0442
0443
0444
0445
0446
0447
0448
0449
0450
0451
0452
0453
0454
0455
0456
0457
0458
0459
0460
0461
0462
0463
0464
0465
0466
0467
0468
0469
0470
0471
0472
0473
0474
0475
0476
0477
0478
0479
0480
0481
0482
0483
0484
0485
0486
0487
0488
0489
0490
0491
0492
0493
0494
0495
0496
0497
0498
0499
// Routines to let C code use special x86 instructions.

static inline uchar
inb(ushort port)
{
uchar data;
asm volatile("in %1,%0" : "=a" (data) : "d" (port));
return data;
}
static inline void
insl(int port, void *addr, int cnt)
{
asm volatile("cld; rep insl" :
"=D" (addr), "=c" (cnt) :
"d" (port), "0" (addr), "1" (cnt) :
"memory", "cc");
}
static inline void
outb(ushort port, uchar data)
{
asm volatile("out %0,%1" : : "a" (data), "d" (port));
}
static inline void
outw(ushort port, ushort data)
{
asm volatile("out %0,%1" : : "a" (data), "d" (port));
}
static inline void
outsl(int port, const void *addr, int cnt)
{
asm volatile("cld; rep outsl" :
"=S" (addr), "=c" (cnt) :
"d" (port), "0" (addr), "1" (cnt) :
"cc");
}
static inline void
stosb(void *addr, int data, int cnt)
{
asm volatile("cld; rep stosb" :
"=D" (addr), "=c" (cnt) :
"0" (addr), "1" (cnt), "a" (data) :
"memory", "cc");
}
Sheet 04
struct segdesc;
static inline void
lgdt(struct segdesc *p, int size)
{
volatile ushort pd[3];
pd[0] = size-1;
pd[1] = (uint)p;
pd[2] = (uint)p >> 16;
asm volatile("lgdt (%0)" : : "r" (pd));
}
struct gatedesc;
static inline void
lidt(struct gatedesc *p, int size)
{
volatile ushort pd[3];
pd[0] = size-1;
pd[1] = (uint)p;
pd[2] = (uint)p >> 16;
asm volatile("lidt (%0)" : : "r" (pd));
}
static inline void
ltr(ushort sel)
{
asm volatile("ltr %0" : : "r" (sel));
}
static inline uint
readeflags(void)
{
uint eflags;
asm volatile("pushfl; popl %0" : "=r" (eflags));
return eflags;
}
static inline void
loadgs(ushort v)
{
asm volatile("movw %0, %%gs" : : "r" (v));
}
Sheet 04
Feb 19 20:50 2011 xv6/x86.h Page 3
Feb 19 20:50 2011 xv6/x86.h Page 4
0500
0501
0502
0503
0504
0505
0506
0507
0508
0509
0510
0511
0512
0513
0514
0515
0516
0517
0518
0519
0520
0521
0522
0523
0524
0525
0526
0527
0528
0529
0530
0531
0532
0533
0534
0535
0536
0537
0538
0539
0540
0541
0542
0543
0544
0545
0546
0547
0548
0549
0550
0551
0552
0553
0554
0555
0556
0557
0558
0559
0560
0561
0562
0563
0564
0565
0566
0567
0568
0569
0570
0571
0572
0573
0574
0575
0576
0577
0578
0579
0580
0581
0582
0583
0584
0585
0586
0587
0588
0589
0590
0591
0592
0593
0594
0595
0596
0597
0598
0599
static inline uint

rebp(void)
{
uint val;
asm volatile("movl %%ebp,%0" : "=r" (val));
return val;
}
static inline uint
resp(void)
{
uint val;
asm volatile("movl %%esp,%0" : "=r" (val));
return val;
}
static inline void
cli(void)
{
asm volatile("cli");
}
static inline void
sti(void)
{
asm volatile("sti");
}
static inline uint
xchg(volatile uint *addr, uint newval)
{
uint result;
// The + in "+m" denotes a read-modify-write operand.
asm volatile("lock; xchgl %0, %1" :
"+m" (*addr), "=a" (result) :
"1" (newval) :
"cc");
return result;
}
Sheet 05
static inline void

lcr0(uint val)
{
asm volatile("movl %0,%%cr0" : : "r" (val));
}
static inline uint
rcr0(void)
{
uint val;
asm volatile("movl %%cr0,%0" : "=r" (val));
return val;
}
static inline uint
rcr2(void)
{
uint val;
return val;
}
static inline void
lcr3(uint val)
{
asm volatile("movl %0,%%cr3" : : "r" (val));
}
static inline uint
rcr3(void)
{
uint val;
return val;
}
Sheet 05
Feb 19 20:50 2011 xv6/x86.h Page 5
Feb 19 20:50 2011 xv6/asm.h Page 1
0600
0601
0602
0603
0604
0605
0606
0607
0608
0609
0610
0611
0612
0613
0614
0615
0616
0617
0618
0619
0620
0621
0622
0623
0624
0625
0626
0627
0628
0629
0630
0631
0632
0633
0634
0635
0636
0637
0638
0639
0640
0641
0642
0643
0644
0645
0646
0647
0648
0649
0650
0651
0652
0653
0654
0655
0656
0657
0658
0659
0660
0661
0662
0663
0664
0665
0666
0667
0668
0669
0670
0671
0672
0673
0674
0675
0676
0677
0678
0679
0680
0681
0682
0683
0684
0685
0686
0687
0688
0689
0690
0691
0692
0693
0694
0695
0696
0697
0698
0699
// Layout of the trap frame built on the stack by the

// hardware and by trapasm.S, and passed to trap().
struct trapframe {
// registers as pushed by pusha
uint edi;
uint esi;
uint ebp;
uint oesp;
// useless & ignored
uint ebx;
uint edx;
uint ecx;
uint eax;
// rest of trap frame
ushort gs;
ushort padding1;
ushort fs;
ushort padding2;
ushort es;
ushort padding3;
ushort ds;
ushort padding4;
uint trapno;
// below here defined by x86 hardware
uint err;
uint eip;
ushort cs;
ushort padding5;
uint eflags;
// below here only when crossing rings, such as from user to kernel
uint esp;
ushort ss;
ushort padding6;
};
Sheet 06
//
// assembler macros to create x86 segments
//
#define SEG_NULLASM
.word 0, 0;
.byte 0, 0, 0, 0
\
\
// The 0xC0 means the limit is in 4096-byte units

// and (for executable segments) 32-bit mode.
#define SEG_ASM(type,base,lim)
.word (((lim) >> 12) & 0xffff), ((base) & 0xffff);
.byte (((base) >> 16) & 0xff), (0x90 | (type)),
(0xC0 | (((lim) >> 28) & 0xf)), (((base) >> 24)
#define
#define
#define
#define
#define
#define
Sheet 06
STA_X
STA_E
STA_C
STA_W
STA_R
STA_A
0x8
0x4
0x4
0x2
0x2
0x1
//
//
//
//
//
//
\
\
\
& 0xff)
Executable segment
Expand down (non-executable segments)
Conforming code segment (executable only)
Writeable (non-executable segments)
Readable (executable segments)
Accessed
Feb 19 20:50 2011 xv6/mmu.h Page 1
Feb 19 20:50 2011 xv6/mmu.h Page 2
0700
0701
0702
0703
0704
0705
0706
0707
0708
0709
0710
0711
0712
0713
0714
0715
0716
0717
0718
0719
0720
0721
0722
0723
0724
0725
0726
0727
0728
0729
0730
0731
0732
0733
0734
0735
0736
0737
0738
0739
0740
0741
0742
0743
0744
0745
0746
0747
0748
0749
0750
0751
0752
0753
0754
0755
0756
0757
0758
0759
0760
0761
0762
0763
0764
0765
0766
0767
0768
0769
0770
0771
0772
0773
0774
0775
0776
0777
0778
0779
0780
0781
0782
0783
0784
0785
0786
0787
0788
0789
0790
0791
0792
0793
0794
0795
0796
0797
0798
0799
// This file contains definitions for the

// x86 memory management unit (MMU).
// Eflags register
#define FL_CF
#define FL_PF
#define FL_AF
#define FL_ZF
#define FL_SF
#define FL_TF
#define FL_IF
#define FL_DF
#define FL_OF
#define FL_IOPL_MASK
#define FL_IOPL_0
#define FL_IOPL_1
#define FL_IOPL_2
#define FL_IOPL_3
#define FL_NT
#define FL_RF
#define FL_VM
#define FL_AC
#define FL_VIF
#define FL_VIP
#define FL_ID
0x00000001
0x00000004
0x00000010
0x00000040
0x00000080
0x00000100
0x00000200
0x00000400
0x00000800
0x00003000
0x00000000
0x00001000
0x00002000
0x00003000
0x00004000
0x00010000
0x00020000
0x00040000
0x00080000
0x00100000
0x00200000
// Control Register flags

#define CR0_PE
0x00000001
#define CR0_MP
0x00000002
#define CR0_EM
0x00000004
#define CR0_TS
0x00000008
#define CR0_ET
0x00000010
#define CR0_NE
0x00000020
#define CR0_WP
0x00010000
#define CR0_AM
0x00040000
#define CR0_NW
0x20000000
#define CR0_CD
0x40000000
#define CR0_PG
0x80000000
Sheet 07
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
Carry Flag
Parity Flag
Auxiliary carry Flag
Zero Flag
Sign Flag
Trap Flag
Interrupt Enable
Direction Flag
Overflow Flag
I/O Privilege Level bitmask
IOPL == 0
IOPL == 1
IOPL == 2
IOPL == 3
Nested Task
Resume Flag
Virtual 8086 mode
Alignment Check
Virtual Interrupt Flag
Virtual Interrupt Pending
ID flag
//
//
//
//
//
//
//
//
//
//
//
Protection Enable
Monitor coProcessor
Emulation
Task Switched
Extension Type
Numeric Errror
Write Protect
Alignment Mask
Not Writethrough
Cache Disable
Paging
// Segment Descriptor
struct segdesc {
uint lim_15_0 : 16;
uint base_15_0 : 16;
uint type : 4;
uint s : 1;
uint dpl : 2;
uint p : 1;
uint lim_19_16 : 4;
uint avl : 1;
uint rsv1 : 1;
uint db : 1;
uint g : 1;
};
//
//
//
//
//
//
//
//
//
//
//
//
//
Low bits of segment limit

Low bits of segment base address
Middle bits of segment base address
Segment type (see STS_ constants)
0 = system, 1 = application
Descriptor Privilege Level
Present
High bits of segment limit
Unused (available for software use)
Reserved
0 = 16-bit segment, 1 = 32-bit segment
Granularity: limit scaled by 4K when set
High bits of segment base address
// Normal segment
#define SEG(type, base, lim, dpl) (struct segdesc)
{ ((lim) >> 12) & 0xffff, (uint)(base) & 0xffff,
((uint)(base) >> 16) & 0xff, type, 1, dpl, 1,
(uint)(lim) >> 28, 0, 0, 1, 1, (uint)(base) >> 24 }
#define SEG16(type, base, lim, dpl) (struct segdesc)
{ (lim) & 0xffff, (uint)(base) & 0xffff,
((uint)(base) >> 16) & 0xff, type, 1, dpl, 1,
(uint)(lim) >> 16, 0, 0, 1, 0, (uint)(base) >> 24 }
#define DPL_USER
0x3
\
\
\
\
\
\
// User DPL
// Application segment type

#define STA_X
0x8
#define STA_E
0x4
#define STA_C
0x4
#define STA_W
0x2
#define STA_R
0x2
#define STA_A
0x1
bits
// Executable segment
// Expand down (non-executable segments)
// Conforming code segment (executable only)
// Writeable (non-executable segments)
// Readable (executable segments)
// Accessed
// System segment type bits

#define STS_T16A
0x1
#define STS_LDT
0x2
#define STS_T16B
0x3
#define STS_CG16
0x4
#define STS_TG
0x5
#define STS_IG16
0x6
#define STS_TG16
0x7
#define STS_T32A
0x9
#define STS_T32B
0xB
#define STS_CG32
0xC
#define STS_IG32
0xE
#define STS_TG32
0xF
//
//
//
//
//
//
//
//
//
//
//
//
Sheet 07
Available 16-bit
Local Descriptor
Busy 16-bit TSS
16-bit Call Gate
Task Gate / Coum
16-bit Interrupt
16-bit Trap Gate
Available 32-bit
Busy 32-bit TSS
32-bit Call Gate
32-bit Interrupt
32-bit Trap Gate
TSS
Table
Transmitions
Gate
TSS
Gate
Feb 19 20:50 2011 xv6/mmu.h Page 3

0800
0801
0802
0803
0804
0805
0806
0807
0808
0809
0810
0811
0812
0813
0814
0815
0816
0817
0818
0819
0820
0821
0822
0823
0824
0825
0826
0827
0828
0829
0830
0831
0832
0833
0834
0835
0836
0837
0838
0839
0840
0841
0842
0843
0844
0845
0846
0847
0848
0849
//
//
//
//
//
//
//
Feb 19 20:50 2011 xv6/mmu.h Page 4
0850 // Task state segment format

0851 struct taskstate {
+--------10------+-------10-------+---------12----------+
0852 uint link;
// Old ts selector
| Page Directory | Page Table | Offset within Page |
0853 uint esp0;
// Stack pointers and segment selectors
|
Index
|
Index
|
|
0854 ushort ss0;
// after an increase in privilege level
+----------------+----------------+---------------------+
0855 ushort padding1;
\--- PDX(la) --/ \--- PTX(la) --/
0856 uint *esp1;
0857 ushort ss1;
// page directory index
#define PDX(la)
(((uint)(la) >> PDXSHIFT) & 0x3FF)
0859 uint *esp2;
0860 ushort ss2;
// page table index
#define PTX(la)
(((uint)(la) >> PTXSHIFT) & 0x3FF)
0862 void *cr3;
// Page directory base
0863 uint *eip;
// Saved state from last task switch
// construct linear address from indexes and offset
0864 uint eflags;
#define PGADDR(d, t, o)
((uint)((d) << PDXSHIFT | (t) << PTXSHIFT | (o))) 0865 uint eax;
// More saved state (registers)
0866 uint ecx;
// turn a kernel linear address into a physical address.
0867 uint edx;
// all of the kernel data structures have linear and
0868 uint ebx;
// physical addresses that are equal.
0869 uint *esp;
#define PADDR(a)
((uint)(a))
0870 uint *ebp;
0871 uint esi;
// Page directory and page table constants.
0872 uint edi;
#define NPDENTRIES 1024
// page directory entries per page directory
0873 ushort es;
// Even more saved state (segment selectors)
#define NPTENTRIES 1024
// page table entries per page table
0875 ushort cs;
#define PGSIZE
4096
// bytes mapped by a page
#define PGSHIFT
12
// log2(PGSIZE)
0877 ushort ss;
#define PTXSHIFT 12
// offset of PTX in a linear address
0879 ushort ds;
#define PDXSHIFT 22
// offset of PDX in a linear address
0881 ushort fs;
#define PGROUNDUP(sz) (((sz)+PGSIZE-1) & ~(PGSIZE-1))
#define PGROUNDDOWN(a) ((char*)((((unsigned int)(a)) & ~(PGSIZE-1))))
0883 ushort gs;
// Page table/directory entry flags.
0885 ushort ldt;
#define PTE_P
0x001 // Present
#define PTE_W
0x002 // Writeable
0887 ushort t;
// Trap on task switch
#define PTE_U
0x004 // User
0888 ushort iomb;
// I/O map base address
#define PTE_PWT
0x008 // Write-Through
0889 };
#define PTE_PCD
0x010 // Cache-Disable
0890
#define PTE_A
0x020 // Accessed
0891
#define PTE_D
0x040 // Dirty
0892
#define PTE_PS
0x080 // Page Size
0893
#define PTE_MBZ
0x180 // Bits must be zero
0894
0895
// Address in page table or page directory entry
0896
#define PTE_ADDR(pte)
((uint)(pte) & ~0xFFF)
0897
0898
typedef uint pte_t;
0899
Sheet 08
A linear address la has a three-part structure as follows:
Sheet 08
Feb 19 20:50 2011 xv6/mmu.h Page 5
Feb 19 20:50 2011 xv6/elf.h Page 1
0900
0901
0902
0903
0904
0905
0906
0907
0908
0909
0910
0911
0912
0913
0914
0915
0916
0917
0918
0919
0920
0921
0922
0923
0924
0925
0926
0927
0928
0929
0930
0931
0932
0933
0934
0935
0936
0937
0938
0939
0940
0941
0942
0943
0944
0945
0946
0947
0948
0949
0950
0951
0952
0953
0954
0955
0956
0957
0958
0959
0960
0961
0962
0963
0964
0965
0966
0967
0968
0969
0970
0971
0972
0973
0974
0975
0976
0977
0978
0979
0980
0981
0982
0983
0984
0985
0986
0987
0988
0989
0990
0991
0992
0993
0994
0995
0996
0997
0998
0999
// Gate descriptors for

struct gatedesc {
uint off_15_0 : 16;
uint cs : 16;
uint args : 5;
uint rsv1 : 3;
uint type : 4;
uint s : 1;
uint dpl : 2;
uint p : 1;
uint off_31_16 : 16;
};
interrupts and traps

//
//
//
//
//
//
//
//
//
low 16 bits of offset in segment

code segment selector
# args, 0 for interrupt/trap gates
reserved(should be zero I guess)
type(STS_{TG,IG32,TG32})
must be 0 (system)
descriptor(meaning new) privilege level
Present
high bits of offset in segment
// Set up a normal interrupt/trap gate descriptor.

// - istrap: 1 for a trap (= exception) gate, 0 for an interrupt gate.
// interrupt gate clears FL_IF, trap gate leaves FL_IF alone
// - sel: Code segment selector for interrupt/trap handler
// - off: Offset in code segment for interrupt/trap handler
// - dpl: Descriptor Privilege Level //
the privilege level required for software to invoke
//
this interrupt/trap gate explicitly using an int instruction.
#define SETGATE(gate, istrap, sel, off, d)
\
{
\
(gate).off_15_0 = (uint)(off) & 0xffff;
\
(gate).cs = (sel);
\
(gate).args = 0;
\
(gate).rsv1 = 0;
\
(gate).type = (istrap) ? STS_TG32 : STS_IG32;
\
(gate).s = 0;
\
(gate).dpl = (d);
\
(gate).p = 1;
\
(gate).off_31_16 = (uint)(off) >> 16;
\
}
Sheet 09
// Format of an ELF executable file

#define ELF_MAGIC 0x464C457FU // "\x7FELF" in little endian
// File header
struct elfhdr {
uint magic; // must equal ELF_MAGIC
uchar elf[12];
ushort type;
ushort machine;
uint version;
uint entry;
uint phoff;
uint shoff;
uint flags;
ushort ehsize;
ushort phentsize;
ushort phnum;
ushort shentsize;
ushort shnum;
ushort shstrndx;
};
// Program section header
struct proghdr {
uint type;
uint offset;
uint va;
uint pa;
uint filesz;
uint memsz;
uint flags;
uint align;
};
// Values for Proghdr type
#define ELF_PROG_LOAD
// Flag
#define
#define
#define
Sheet 09
bits for Proghdr flags

ELF_PROG_FLAG_EXEC
1
ELF_PROG_FLAG_WRITE
2
ELF_PROG_FLAG_READ
4
Feb 19 20:50 2011 xv6/bootasm.S Page 1
Feb 19 20:50 2011 xv6/bootasm.S Page 2
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
#include "asm.h"
#
#
#
#
Start the first CPU: switch to 32-bit protected mode, jump into C.
The BIOS loads this code from the first sector of the hard disk into
memory at physical address 0x7c00 and starts executing in real mode
with %cs=0 %ip=7c00.
#define SEG_KCODE 1 // kernel code

#define SEG_KDATA 2 // kernel data+stack
#define CR0_PE
1 // protected mode enable bit
.code16
.globl start
start:
cli
# Assemble for 16-bit mode

# BIOS enabled interrupts ; disable
# Set up the important data segment registers (DS, ES, SS).

xorw
%ax,%ax
# Segment number zero
movw
%ax,%ds
# -> Data Segment
movw
%ax,%es
# -> Extra Segment
movw
%ax,%ss
# -> Stack Segment
# Physical address line A20 is tied to zero so that the first PCs
# with 2 MB would run software that assumed 1 MB. Undo that.
seta20.1:
inb
$0x64,%al
# Wait for not busy
testb $0x2,%al
jnz
seta20.1
movb
outb
$0xd1,%al
%al,$0x64
seta20.2:
inb
$0x64,%al
testb $0x2,%al
jnz
seta20.2
movb
outb
$0xdf,%al
%al,$0x60
# 0xd1 -> port 0x64
# Wait for not busy
# 0xdf -> port 0x60
# Switch from real to protected mode. Use a bootstrap GDT that makes
# virtual addresses map dierctly to physical addresses so that the
# effective memory map doesnt change during the transition.
lgdt
gdtdesc
movl
%cr0, %eax
orl
$CR0_PE, %eax
movl
%eax, %cr0
Sheet 10
# Complete transition to 32-bit protected mode by using long jmp

# to reload %cs and %eip. The segment registers are set up with no
# translation, so that the mapping is still the identity mapping.
ljmp
$(SEG_KCODE<<3), $start32
.code32 # Tell assembler to generate 32-bit code now.
start32:
# Set up the protected-mode data segment registers
movw
$(SEG_KDATA<<3), %ax
# Our data segment selector
movw
%ax, %ds
# -> DS: Data Segment
movw
%ax, %es
# -> ES: Extra Segment
movw
%ax, %ss
# -> SS: Stack Segment
movw
$0, %ax
# Zero segments not ready for use
movw
%ax, %fs
# -> FS
movw
%ax, %gs
# -> GS
# Set up the stack pointer and call into C.
movl
$start, %esp
call
bootmain
# If bootmain returns (it shouldnt), trigger a Bochs
# breakpoint if running under Bochs, then loop.
movw
$0x8a00, %ax
# 0x8a00 -> port 0x8a00
movw
%ax, %dx
outw
%ax, %dx
movw
$0x8ae0, %ax
# 0x8ae0 -> port 0x8a00
outw
%ax, %dx
spin:
jmp
spin
# Bootstrap GDT
.p2align 2
gdt:
SEG_NULLASM
SEG_ASM(STA_X|STA_R, 0x0, 0xffffffff)
SEG_ASM(STA_W, 0x0, 0xffffffff)
gdtdesc:
.word (gdtdesc - gdt - 1)
.long gdt
Sheet 10
# force 4 byte alignment

# null seg
# code seg
# data seg
# sizeof(gdt) - 1
# address gdt
Feb 19 20:50 2011 xv6/bootother.S Page 1
Feb 19 20:50 2011 xv6/bootother.S Page 2
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
#include "asm.h"
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
Each non-boot CPU ("AP") is started up in response to a STARTUP

IPI from the boot CPU. Section B.4.2 of the Multi-Processor
Specification says that the AP will start in real mode with CS:IP
set to XY00:0000, where XY is an 8-bit value sent with the
STARTUP. Thus this code must start at a 4096-byte boundary.
Because this code sets DS to zero, it must sit
at an address in the low 2^16 bytes.
Bootothers (in main.c) sends the STARTUPs one at a time.
It copies this code (start) at 0x7000.
It puts the address of a newly allocated per-core stack in start-4,
and the address of the place to jump to (mpmain) in start-8.
This code is identical to bootasm.S except:
- it does not need to enable A20
- it uses the address at start-4 for the %esp
- it jumps to the address at start-8 instead of calling bootmain
#define SEG_KCODE 1
#define SEG_KDATA 2
#define CR0_PE
.code16
.globl start
start:
cli
xorw
movw
movw
movw
%ax,%ax
%ax,%ds
%ax,%es
%ax,%ss
lgdt
movl
orl
movl
gdtdesc
%cr0, %eax
$CR0_PE, %eax
%eax, %cr0
Sheet 11
ljmp
.code32
start32:
movw
movw
movw
movw
movw
movw
movw
$(SEG_KCODE<<3), $start32
%ax, %ds
%ax, %es
%ax, %ss
$0, %ax
%ax, %fs
%ax, %gs
# switch to the stack allocated by bootothers()

movl
start-4, %esp
# call mpmain()
call
*(start-8)
movw
movw
outw
movw
outw
spin:
jmp
$0x8a00, %ax
%ax, %dx
%ax, %dx
$0x8ae0, %ax
%ax, %dx
spin
.p2align 2
gdt:
SEG_NULLASM
gdtdesc:
.long gdt
Sheet 11
Feb 19 20:50 2011 xv6/bootmain.c Page 1
Feb 19 20:50 2011 xv6/bootmain.c Page 2
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
//
//
//
//
//
//
Boot loader.
Part of the boot sector, along with bootasm.S, which calls bootmain().
bootasm.S has put the processor into protected 32-bit mode.
bootmain() loads an ELF kernel image from the disk starting at
sector 1 and then jumps to the kernel entry routine.
#include "types.h"
#include "elf.h"
#include "x86.h"
#define SECTSIZE 512
void readseg(uchar*, uint, uint);
void
bootmain(void)
{
struct elfhdr *elf;
struct proghdr *ph, *eph;
void (*entry)(void);
uchar* va;
elf = (struct elfhdr*)0x10000; // scratch space
// Read 1st page off disk
readseg((uchar*)elf, 4096, 0);
// Is this an ELF executable?
if(elf->magic != ELF_MAGIC)
return; // let bootasm.S handle error
// Load each program segment (ignores ph flags).
ph = (struct proghdr*)((uchar*)elf + elf->phoff);
eph = ph + elf->phnum;
for(; ph < eph; ph++){
va = (uchar*)ph->va;
readseg(va, ph->filesz, ph->offset);
if(ph->memsz > ph->filesz)
stosb(va + ph->filesz, 0, ph->memsz - ph->filesz);
}
// Call the entry point from the ELF header.
// Does not return!
entry = (void(*)(void))(elf->entry);
entry();
}
Sheet 12
void
waitdisk(void)
{
// Wait for disk ready.
while((inb(0x1F7) & 0xC0) != 0x40)
;
}
// Read a single sector at offset into dst.
void
readsect(void *dst, uint offset)
{
// Issue command.
waitdisk();
outb(0x1F2, 1); // count = 1
outb(0x1F3, offset);
outb(0x1F4, offset >> 8);
outb(0x1F5, offset >> 16);
outb(0x1F6, (offset >> 24) | 0xE0);
outb(0x1F7, 0x20); // cmd 0x20 - read sectors
// Read data.
waitdisk();
insl(0x1F0, dst, SECTSIZE/4);
}
// Read count bytes at offset from kernel into virtual address va.
// Might copy more than asked.
void
readseg(uchar* va, uint count, uint offset)
{
uchar* eva;
eva = va + count;
// Round down to sector boundary.
va -= offset % SECTSIZE;
// Translate from bytes to sectors; kernel starts at sector 1.
offset = (offset / SECTSIZE) + 1;
// If this is too slow, we could read lots of sectors at a time.
// Wed write more to memory than asked, but it doesnt matter -// we load in increasing order.
for(; va < eva; va += SECTSIZE, offset++)
readsect(va, offset);
}
Sheet 12
Feb 19 20:50 2011 xv6/main.c Page 1
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"mmu.h"
"proc.h"
"x86.h"
static void bootothers(void);

static void mpmain(void);
void jmpkstack(void) __attribute__((noreturn));
void mainc(void);
// Bootstrap processor starts running C code here.
// Allocate a real stack and switch to it, first
// doing some setup required for memory allocator to work.
int
main(void)
{
mpinit();
// collect info about this machine
lapicinit(mpbcpu());
seginit();
// set up segments
kinit();
// initialize memory allocator
jmpkstack();
// call mainc() on a properly-allocated stack
}
void
jmpkstack(void)
{
char *kstack, *top;
kstack = kalloc();
if(kstack == 0)
panic("jmpkstack kalloc");
top = kstack + PGSIZE;
asm volatile("movl %0,%%esp; call mainc" : : "r" (top));
panic("jmpkstack");
}
Sheet 13
// Set up hardware and software.

// Runs only on the boostrap processor.
void
mainc(void)
{
cprintf("\ncpu%d: starting xv6\n\n", cpu->id);
picinit();
// interrupt controller
ioapicinit();
// another interrupt controller
consoleinit(); // I/O devices & their interrupts
uartinit();
// serial port
kvmalloc();
// initialize the kernel page table
pinit();
// process table
tvinit();
// trap vectors
binit();
// buffer cache
fileinit();
// file table
iinit();
// inode cache
ideinit();
// disk
if(!ismp)
timerinit(); // uniprocessor timer
userinit();
// first user process
bootothers();
// start other processors
// Finish setting up this processor in mpmain.
mpmain();
}
// Common CPU setup code.
// Bootstrap CPU comes here from mainc().
// Other CPUs jump here from bootother.S.
static void
mpmain(void)
{
if(cpunum() != mpbcpu()){
seginit();
lapicinit(cpunum());
}
vmenable();
// turn on paging
cprintf("cpu%d: starting\n", cpu->id);
idtinit();
// load idt register
xchg(&cpu->booted, 1); // tell bootothers() were up
scheduler();
// start running processes
}
Sheet 13
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450 // Blank page.

1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
// Start the non-boot processors.

static void
bootothers(void)
{
extern uchar _binary_bootother_start[], _binary_bootother_size[];
uchar *code;
struct cpu *c;
char *stack;
// Write bootstrap code to unused memory at 0x7000.
// The linker has placed the image of bootother.S in
// _binary_bootother_start.
code = (uchar*)0x7000;
memmove(code, _binary_bootother_start, (uint)_binary_bootother_size);
for(c = cpus; c < cpus+ncpu; c++){
if(c == cpus+cpunum()) // Weve started already.
continue;
// Tell bootother.S what stack to use and the address of mpmain;
// it expects to find these two addresses stored just before
// its first instruction.
stack = kalloc();
*(void**)(code-4) = stack + KSTACKSIZE;
*(void**)(code-8) = mpmain;
lapicstartap(c->id, (uint)code);
// Wait for cpu to finish mpmain()
while(c->booted == 0)
;
}
}
Sheet 14
Sheet 14
Feb 19 20:50 2011 xv6/spinlock.h Page 1
Feb 19 20:50 2011 xv6/spinlock.c Page 1
1500 // Mutual exclusion

1501 struct spinlock {
1502 uint locked;
1503
1504 // For debugging:
1505 char *name;
1506 struct cpu *cpu;
1507 uint pcs[10];
1508
1509 };
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
Sheet 15
lock.
// Is the lock held?
//
//
//
//
Name of lock.
The cpu holding the lock.
The call stack (an array of program counters)
that locked the lock.
// Mutual exclusion spin locks.

#include
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"x86.h"
"mmu.h"
"proc.h"
"spinlock.h"
void
initlock(struct spinlock *lk, char *name)
{
lk->name = name;
lk->locked = 0;
lk->cpu = 0;
}
// Acquire the lock.
// Loops (spins) until the lock is acquired.
// Holding a lock for a long time may cause
// other CPUs to waste time spinning to acquire it.
void
acquire(struct spinlock *lk)
{
pushcli(); // disable interrupts to avoid deadlock.
if(holding(lk))
panic("acquire");
// The xchg is atomic.
// It also serializes, so that reads after acquire are not
// reordered before it.
while(xchg(&lk->locked, 1) != 0)
;
// Record info about lock acquisition for debugging.
lk->cpu = cpu;
getcallerpcs(&lk, lk->pcs);
}
Sheet 15
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
// Release the lock.

void
release(struct spinlock *lk)
{
if(!holding(lk))
panic("release");
lk->pcs[0] = 0;
lk->cpu = 0;
// The xchg serializes, so that reads before release are
// not reordered after it. The 1996 PentiumPro manual (Volume 3,
// 7.2) says reads can be carried out speculatively and in
// any order, which implies we need to serialize here.
// But the 2007 Intel 64 Architecture Memory Ordering White
// Paper says that Intel 64 and IA-32 will not move a load
// after a store. So lock->locked = 0 would work here.
// The xchg being asm volatile ensures gcc emits it after
// the above assignments (and after the critical section).
xchg(&lk->locked, 0);
popcli();
}
// Record the current call stack in pcs[] by following the %ebp chain.
void
getcallerpcs(void *v, uint pcs[])
{
uint *ebp;
int i;
ebp = (uint*)v - 2;
for(i = 0; i < 10; i++){
if(ebp == 0 || ebp < (uint*)0x100000 || ebp == (uint*)0xffffffff)
break;
pcs[i] = ebp[1];
// saved %eip
ebp = (uint*)ebp[0]; // saved %ebp
}
for(; i < 10; i++)
pcs[i] = 0;
}
// Check whether this cpu is holding the lock.
int
holding(struct spinlock *lock)
{
return lock->locked && lock->cpu == cpu;
}
Sheet 16
// Pushcli/popcli are like cli/sti except that they are matched:

// it takes two popcli to undo two pushcli. Also, if interrupts
// are off, then pushcli, popcli leaves them off.
void
pushcli(void)
{
int eflags;
eflags = readeflags();
cli();
if(cpu->ncli++ == 0)
cpu->intena = eflags & FL_IF;
}
void
popcli(void)
{
if(readeflags()&FL_IF)
panic("popcli - interruptible");
if(--cpu->ncli < 0)
panic("popcli");
if(cpu->ncli == 0 && cpu->intena)
sti();
}
Sheet 16
Feb 19 20:50 2011 xv6/proc.h Page 1
Feb 19 20:50 2011 xv6/proc.h Page 2
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
// Segments in proc->gdt.
// Also known to bootasm.S and trapasm.S
#define SEG_KCPU 3 // kernel per-cpu data
#define SEG_UCODE 4 // user code
#define SEG_UDATA 5 // user data+stack
#define SEG_TSS 6 // this processs task state
#define NSEGS
7
// Per-CPU state
struct cpu {
uchar id;
struct context *scheduler;
struct taskstate ts;
struct segdesc gdt[NSEGS];
volatile uint booted;
int ncli;
int intena;
//
//
//
//
//
//
//
Local APIC ID; index into cpus[] below

swtch() here to enter scheduler
Used by x86 to find stack for interrupt
x86 global descriptor table
Has the CPU started?
Depth of pushcli nesting.
Were interrupts enabled before pushcli?
// Cpu-local storage variables; see below

struct cpu *cpu;
struct proc *proc;
// The currently-running process.
};
extern struct cpu cpus[NCPU];
extern int ncpu;
// Per-CPU variables, holding pointers to the
// current cpu and to the current process.
// The asm suffix tells gcc to use "%gs:0" to refer to cpu
// and "%gs:4" to refer to proc. seginit sets up the
// %gs segment register so that %gs refers to the memory
// holding those two variables in the local cpus struct cpu.
// This is similar to how thread-local variables are implemented
// in thread libraries such as Linux pthreads.
extern struct cpu *cpu asm("%gs:0");
// &cpus[cpunum()]
extern struct proc *proc asm("%gs:4");
// cpus[cpunum()].proc
Sheet 17
// Saved registers for kernel context switches.

// Dont need to save all the segment registers (%cs, etc),
// because they are constant across kernel contexts.
// Dont need to save %eax, %ecx, %edx, because the
// x86 convention is that the caller has saved them.
// Contexts are stored at the bottom of the stack they
// describe; the stack pointer is the address of the context.
// The layout of the context matches the layout of the stack in swtch.S
// at the "Switch stacks" comment. Switch doesnt save eip explicitly,
// but it is on the stack and allocproc() manipulates it.
struct context {
uint edi;
uint esi;
uint ebx;
uint ebp;
uint eip;
};
enum procstate { UNUSED, EMBRYO, SLEEPING, RUNNABLE, RUNNING, ZOMBIE };
// Per-process state
struct proc {
uint sz;
pde_t* pgdir;
char *kstack;
enum procstate state;
volatile int pid;
struct proc *parent;
struct trapframe *tf;
struct context *context;
void *chan;
int killed;
struct file *ofile[NOFILE];
struct inode *cwd;
char name[16];
};
//
//
//
//
//
//
//
//
//
//
//
//
//
Size of process memory (bytes)

Page table
Bottom of kernel stack for this process
Process state
Process ID
Parent process
Trap frame for current syscall
swtch() here to run process
If non-zero, sleeping on chan
If non-zero, have been killed
Open files
Current directory
Process name (debugging)
// Process memory is laid out contiguously, low addresses first:

// text
// original data and bss
// fixed-size stack
// expandable heap
Sheet 17
Feb 19 20:50 2011 xv6/proc.c Page 1
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
#include
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"mmu.h"
"x86.h"
"proc.h"
"spinlock.h"
struct {
struct spinlock lock;
struct proc proc[NPROC];
} ptable;
static struct proc *initproc;
int nextpid = 1;
extern void forkret(void);
extern void trapret(void);
static void wakeup1(void *chan);
void
pinit(void)
{
initlock(&ptable.lock, "ptable");
}
Sheet 18
// Look in the process table for an UNUSED proc.

// If found, change state to EMBRYO and initialize
// state required to run in the kernel.
// Otherwise return 0.
static struct proc*
allocproc(void)
{
struct proc *p;
char *sp;
acquire(&ptable.lock);
for(p = ptable.proc; p < &ptable.proc[NPROC]; p++)
if(p->state == UNUSED)
goto found;
release(&ptable.lock);
return 0;
found:
p->state = EMBRYO;
p->pid = nextpid++;
// Allocate kernel stack if possible.
if((p->kstack = kalloc()) == 0){
p->state = UNUSED;
return 0;
}
sp = p->kstack + KSTACKSIZE;
// Leave room for trap frame.
sp -= sizeof *p->tf;
p->tf = (struct trapframe*)sp;
// Set up new context to start executing at forkret,
// which returns to trapret.
sp -= 4;
*(uint*)sp = (uint)trapret;
sp -= sizeof *p->context;
p->context = (struct context*)sp;
memset(p->context, 0, sizeof *p->context);
p->context->eip = (uint)forkret;
return p;
}
Sheet 18
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
// Set up first user process.

void
userinit(void)
{
struct proc *p;
extern char _binary_initcode_start[], _binary_initcode_size[];
p = allocproc();
initproc = p;
if((p->pgdir = setupkvm()) == 0)
panic("userinit: out of memory?");
inituvm(p->pgdir, _binary_initcode_start, (int)_binary_initcode_size);
p->sz = PGSIZE;
memset(p->tf, 0, sizeof(*p->tf));
p->tf->cs = (SEG_UCODE << 3) | DPL_USER;
p->tf->ds = (SEG_UDATA << 3) | DPL_USER;
p->tf->es = p->tf->ds;
p->tf->ss = p->tf->ds;
p->tf->eflags = FL_IF;
p->tf->esp = PGSIZE;
p->tf->eip = 0; // beginning of initcode.S
safestrcpy(p->name, "initcode", sizeof(p->name));
p->cwd = namei("/");
p->state = RUNNABLE;
}
// Grow current processs memory by n bytes.
// Return 0 on success, -1 on failure.
int
growproc(int n)
{
uint sz;
sz = proc->sz;
if(n > 0){
if((sz = allocuvm(proc->pgdir, sz, sz + n)) == 0)
return -1;
} else if(n < 0){
if((sz = deallocuvm(proc->pgdir, sz, sz + n)) == 0)
return -1;
}
proc->sz = sz;
switchuvm(proc);
return 0;
}
Sheet 19
// Create a new process copying p as the parent.

// Sets up stack to return as if from system call.
// Caller must set state of returned proc to RUNNABLE.
int
fork(void)
{
int i, pid;
struct proc *np;
// Allocate process.
if((np = allocproc()) == 0)
return -1;
// Copy process state from p.
if((np->pgdir = copyuvm(proc->pgdir, proc->sz)) == 0){
kfree(np->kstack);
np->kstack = 0;
np->state = UNUSED;
return -1;
}
np->sz = proc->sz;
np->parent = proc;
*np->tf = *proc->tf;
// Clear %eax so that fork returns 0 in the child.
np->tf->eax = 0;
for(i = 0; i < NOFILE; i++)
if(proc->ofile[i])
np->ofile[i] = filedup(proc->ofile[i]);
np->cwd = idup(proc->cwd);
pid = np->pid;
np->state = RUNNABLE;
safestrcpy(np->name, proc->name, sizeof(proc->name));
return pid;
}
Sheet 19
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
// Exit the current process. Does not return.

// An exited process remains in the zombie state
// until its parent calls wait() to find out it exited.
void
exit(void)
{
struct proc *p;
int fd;
if(proc == initproc)
panic("init exiting");
// Close all open files.
for(fd = 0; fd < NOFILE; fd++){
if(proc->ofile[fd]){
fileclose(proc->ofile[fd]);
proc->ofile[fd] = 0;
}
}
iput(proc->cwd);
proc->cwd = 0;
// Parent might be sleeping in wait().
wakeup1(proc->parent);
// Pass abandoned children to init.
for(p = ptable.proc; p < &ptable.proc[NPROC]; p++){
if(p->parent == proc){
p->parent = initproc;
if(p->state == ZOMBIE)
wakeup1(initproc);
}
}
// Jump into the scheduler, never to return.
proc->state = ZOMBIE;
sched();
panic("zombie exit");
}
Sheet 20
// Wait for a child process to exit and return its pid.

// Return -1 if this process has no children.
int
wait(void)
{
struct proc *p;
int havekids, pid;
for(;;){
// Scan through table looking for zombie children.
havekids = 0;
if(p->parent != proc)
continue;
havekids = 1;
if(p->state == ZOMBIE){
// Found one.
pid = p->pid;
kfree(p->kstack);
p->kstack = 0;
freevm(p->pgdir);
p->state = UNUSED;
p->pid = 0;
p->parent = 0;
p->name[0] = 0;
p->killed = 0;
return pid;
}
}
// No point waiting if we dont have any children.
if(!havekids || proc->killed){
return -1;
}
// Wait for children to exit. (See wakeup1 call in proc_exit.)
sleep(proc, &ptable.lock);
}
}
Sheet 20
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
// Per-CPU process scheduler.

// Each CPU calls scheduler() after setting itself up.
// Scheduler never returns. It loops, doing:
// - choose a process to run
// - swtch to start running that process
// - eventually that process transfers control
//
via swtch back to the scheduler.
void
scheduler(void)
{
struct proc *p;
for(;;){
// Enable interrupts on this processor.
sti();
// Loop over process table looking for process to run.
if(p->state != RUNNABLE)
continue;
// Switch to chosen process. It is the processs job
// to release ptable.lock and then reacquire it
// before jumping back to us.
proc = p;
switchuvm(p);
p->state = RUNNING;
swtch(&cpu->scheduler, proc->context);
switchkvm();
// Process is done running for now.
// It should have changed its p->state before coming back.
proc = 0;
}
}
}
Sheet 21
// Enter scheduler. Must hold only ptable.lock

// and have changed proc->state.
void
sched(void)
{
int intena;
if(!holding(&ptable.lock))
panic("sched ptable.lock");
if(cpu->ncli != 1)
panic("sched locks");
if(proc->state == RUNNING)
panic("sched running");
if(readeflags()&FL_IF)
panic("sched interruptible");
intena = cpu->intena;
swtch(&proc->context, cpu->scheduler);
cpu->intena = intena;
}
// Give up the CPU for one scheduling round.
void
yield(void)
{
proc->state = RUNNABLE;
sched();
}
// A fork childs very first scheduling by scheduler()
// will swtch here. "Return" to user space.
void
forkret(void)
{
// Still holding ptable.lock from scheduler.
// Return to "caller", actually trapret (see allocproc).
}
Sheet 21
Feb 19 20:50 2011 xv6/proc.c Page 10
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
// Atomically release lock and sleep on chan.

// Reacquires lock when awakened.
void
sleep(void *chan, struct spinlock *lk)
{
if(proc == 0)
panic("sleep");
if(lk == 0)
panic("sleep without lk");
// Must acquire ptable.lock in order to
// change p->state and then call sched.
// Once we hold ptable.lock, we can be
// guaranteed that we wont miss any wakeup
// (wakeup runs with ptable.lock locked),
// so its okay to release lk.
if(lk != &ptable.lock){
release(lk);
}
// Go to sleep.
proc->chan = chan;
proc->state = SLEEPING;
sched();
// Tidy up.
proc->chan = 0;
// Reacquire original lock.
if(lk != &ptable.lock){
acquire(lk);
}
}
Sheet 22
// Wake up all processes sleeping on chan.

// The ptable lock must be held.
static void
wakeup1(void *chan)
{
struct proc *p;
for(p = ptable.proc; p < &ptable.proc[NPROC]; p++)
if(p->state == SLEEPING && p->chan == chan)
}
// Wake up all processes sleeping on chan.
void
wakeup(void *chan)
{
wakeup1(chan);
}
// Kill the process with the given pid.
// Process wont exit until it returns
// to user space (see trap in trap.c).
int
kill(int pid)
{
struct proc *p;
if(p->pid == pid){
p->killed = 1;
// Wake process from sleep if necessary.
if(p->state == SLEEPING)
return 0;
}
}
return -1;
}
Sheet 22
Feb 19 20:50 2011 xv6/proc.c Page 11
Feb 19 20:50 2011 xv6/swtch.S Page 1
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
// Print a process listing to console. For debugging.

// Runs when user types ^P on console.
// No lock to avoid wedging a stuck machine further.
void
procdump(void)
{
static char *states[] = {
[UNUSED]
"unused",
[EMBRYO]
"embryo",
[SLEEPING] "sleep ",
[RUNNABLE] "runble",
[RUNNING] "run ",
[ZOMBIE]
"zombie"
};
int i;
struct proc *p;
char *state;
uint pc[10];
if(p->state == UNUSED)
continue;
if(p->state >= 0 && p->state < NELEM(states) && states[p->state])
state = states[p->state];
else
state = "???";
cprintf("%d %s %s", p->pid, state, p->name);
if(p->state == SLEEPING){
getcallerpcs((uint*)p->context->ebp+2, pc);
for(i=0; i<10 && pc[i] != 0; i++)
cprintf(" %p", pc[i]);
}
cprintf("\n");
}
}
Sheet 23
# Context switch
#
# void swtch(struct context **old, struct context *new);
#
# Save current register context in old
# and then load register context from new.
.globl swtch
swtch:
movl 4(%esp), %eax
movl 8(%esp), %edx
# Save old callee-save registers
pushl %ebp
pushl %ebx
pushl %esi
pushl %edi
# Switch stacks
movl %esp, (%eax)
movl %edx, %esp
# Load new callee-save registers
popl %edi
popl %esi
popl %ebx
popl %ebp
ret
Sheet 23
Feb 19 20:50 2011 xv6/kalloc.c Page 1
Feb 19 20:50 2011 xv6/kalloc.c Page 2
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
// Physical memory allocator, intended to allocate

// memory for user processes, kernel stacks, page table pages,
// and pipe buffers. Allocates 4096-byte pages.
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"mmu.h"
"spinlock.h"
struct run {
struct run *next;
};
struct {
struct run *freelist;
} kmem;
extern char end[]; // first address after kernel loaded from ELF file
// Initialize free list of physical pages.
void
kinit(void)
{
char *p;
initlock(&kmem.lock, "kmem");
p = (char*)PGROUNDUP((uint)end);
for(; p + PGSIZE <= (char*)PHYSTOP; p += PGSIZE)
kfree(p);
}
Sheet 24
// Free the page of physical memory pointed at by v,

// which normally should have been returned by a
// call to kalloc(). (The exception is when
// initializing the allocator; see kinit above.)
void
kfree(char *v)
{
struct run *r;
if((uint)v % PGSIZE || v < end || (uint)v >= PHYSTOP)
panic("kfree");
// Fill with junk to catch dangling refs.
memset(v, 1, PGSIZE);
acquire(&kmem.lock);
r = (struct run*)v;
r->next = kmem.freelist;
kmem.freelist = r;
release(&kmem.lock);
}
// Allocate one 4096-byte page of physical memory.
// Returns a pointer that the kernel can use.
// Returns 0 if the memory cannot be allocated.
char*
kalloc(void)
{
struct run *r;
acquire(&kmem.lock);
r = kmem.freelist;
if(r)
kmem.freelist = r->next;
release(&kmem.lock);
return (char*)r;
}
Sheet 24
Feb 19 20:50 2011 xv6/data.S Page 1
Feb 19 20:50 2011 xv6/vm.c Page 1
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
The kernel layout is:

text
rodata
data
bss
Conventionally, Unix linkers provide pseudo-symbols
etext, edata, and end, at the end of the text, data, and bss.
For the kernel mapping, we need the address at the beginning
of the data section, but thats not one of the conventional
symbols, because the convention started before there was a
read-only rodata section between text and data.
To get the address of the data section, we define a symbol
named data and make sure this is the first object passed to
the linker, so that it will be the first symbol in the data section.
Alternative approaches would be to parse our own ELF header
or to write a linker script, but this is simplest.
.data
.globl data
data:
.word 1
Sheet 25
#include
#include
#include
#include
#include
#include
#include
"param.h"
"types.h"
"defs.h"
"x86.h"
"mmu.h"
"proc.h"
"elf.h"
extern char data[]; // defined in data.S

static pde_t *kpgdir; // for use in scheduler()
// Allocate one page table for the machine for the kernel address
// space for scheduler processes.
void
kvmalloc(void)
{
kpgdir = setupkvm();
}
// Set up CPUs kernel segment descriptors.
// Run once at boot time on each CPU.
void
seginit(void)
{
struct cpu *c;
// Map virtual addresses to linear addresses using identity map.
// Cannot share a CODE descriptor for both kernel and user
// because it would have to have DPL_USR, but the CPU forbids
// an interrupt from CPL=0 to DPL=3.
c = &cpus[cpunum()];
c->gdt[SEG_KCODE] = SEG(STA_X|STA_R, 0, 0xffffffff, 0);
c->gdt[SEG_KDATA] = SEG(STA_W, 0, 0xffffffff, 0);
c->gdt[SEG_UCODE] = SEG(STA_X|STA_R, 0, 0xffffffff, DPL_USER);
c->gdt[SEG_UDATA] = SEG(STA_W, 0, 0xffffffff, DPL_USER);
// Map cpu, and curproc
c->gdt[SEG_KCPU] = SEG(STA_W, &c->cpu, 8, 0);
lgdt(c->gdt, sizeof(c->gdt));
loadgs(SEG_KCPU << 3);
// Initialize cpu-local storage.
cpu = c;
proc = 0;
}
Sheet 25
Feb 19 20:50 2011 xv6/vm.c Page 2
Feb 19 20:50 2011 xv6/vm.c Page 3
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
// Return the address of the PTE in page table pgdir

// that corresponds to linear address va. If create!=0,
// create any required page table pages.
static pte_t *
walkpgdir(pde_t *pgdir, const void *va, int create)
{
pde_t *pde;
pte_t *pgtab;
pde = &pgdir[PDX(va)];
if(*pde & PTE_P){
pgtab = (pte_t*)PTE_ADDR(*pde);
} else {
if(!create || (pgtab = (pte_t*)kalloc()) == 0)
return 0;
// Make sure all those PTE_P bits are zero.
memset(pgtab, 0, PGSIZE);
// The permissions here are overly generous, but they can
// be further restricted by the permissions in the page table
// entries, if necessary.
*pde = PADDR(pgtab) | PTE_P | PTE_W | PTE_U;
}
return &pgtab[PTX(va)];
}
// Create PTEs for linear addresses starting at la that refer to
// physical addresses starting at pa. la and size might not
// be page-aligned.
static int
mappages(pde_t *pgdir, void *la, uint size, uint pa, int perm)
{
char *a, *last;
pte_t *pte;
a = PGROUNDDOWN(la);
last = PGROUNDDOWN(la + size - 1);
for(;;){
pte = walkpgdir(pgdir, a, 1);
if(pte == 0)
return -1;
if(*pte & PTE_P)
panic("remap");
*pte = pa | perm | PTE_P;
if(a == last)
break;
a += PGSIZE;
pa += PGSIZE;
}
return 0;
}
Sheet 26
// The mappings from logical to linear are one to one (i.e.,

// segmentation doesnt do anything).
// There is one page table per process, plus one thats used
// when a CPU is not running any process (kpgdir).
// A user process uses the same page table as the kernel; the
// page protection bits prevent it from using anything other
// than its memory.
//
// setupkvm() and exec() set up every page table like this:
// 0..640K
: user memory (text, data, stack, heap)
// 640K..1M
: mapped direct (for IO space)
// 1M..end
: mapped direct (for the kernels text and data)
// end..PHYSTOP
: mapped direct (kernel heap and user pages)
// 0xfe000000..0
: mapped direct (devices such as ioapic)
//
// The kernel allocates memory for its heap and for user memory
// between kernend and the end of physical memory (PHYSTOP).
// The virtual address space of each user program includes the kernel
// (which is inaccessible in user mode). The user program addresses
// range from 0 till 640KB (USERTOP), which where the I/O hole starts
// (both in physical memory and in the kernels virtual address
// space).
static struct kmap {
void *p;
void *e;
int perm;
} kmap[] = {
{(void*)USERTOP,
(void*)0x100000, PTE_W}, // I/O space
{(void*)0x100000, data,
0
}, // kernel text, rodata
{data,
(void*)PHYSTOP, PTE_W}, // kernel data, memory
{(void*)0xFE000000, 0,
PTE_W}, // device mappings
};
// Set up kernel part of a page table.
pde_t*
setupkvm(void)
{
pde_t *pgdir;
struct kmap *k;
if((pgdir = (pde_t*)kalloc()) == 0)
return 0;
memset(pgdir, 0, PGSIZE);
k = kmap;
for(k = kmap; k < &kmap[NELEM(kmap)]; k++)
if(mappages(pgdir, k->p, k->e - k->p, (uint)k->p, k->perm) < 0)
return 0;
return pgdir;
}
Sheet 26
Feb 19 20:50 2011 xv6/vm.c Page 4
Feb 19 20:50 2011 xv6/vm.c Page 5
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
// Turn on paging.
void
vmenable(void)
{
uint cr0;
switchkvm(); // load kpgdir into cr3
cr0 = rcr0();
cr0 |= CR0_PG;
lcr0(cr0);
}
// Switch h/w page table register to the kernel-only page table,
// for when no process is running.
void
switchkvm(void)
{
lcr3(PADDR(kpgdir)); // switch to the kernel page table
}
// Switch TSS and h/w page table to correspond to process p.
void
switchuvm(struct proc *p)
{
pushcli();
cpu->gdt[SEG_TSS] = SEG16(STS_T32A, &cpu->ts, sizeof(cpu->ts)-1, 0);
cpu->gdt[SEG_TSS].s = 0;
cpu->ts.ss0 = SEG_KDATA << 3;
cpu->ts.esp0 = (uint)proc->kstack + KSTACKSIZE;
ltr(SEG_TSS << 3);
if(p->pgdir == 0)
panic("switchuvm: no pgdir");
lcr3(PADDR(p->pgdir)); // switch to new address space
popcli();
}
// Load the initcode into address 0 of pgdir.
// sz must be less than a page.
void
inituvm(pde_t *pgdir, char *init, uint sz)
{
char *mem;
if(sz >= PGSIZE)
panic("inituvm: more than a page");
mem = kalloc();
memset(mem, 0, PGSIZE);
mappages(pgdir, 0, PGSIZE, PADDR(mem), PTE_W|PTE_U);
memmove(mem, init, sz);
}
Sheet 27
// Load a program segment into pgdir. addr must be page-aligned

// and the pages from addr to addr+sz must already be mapped.
int
loaduvm(pde_t *pgdir, char *addr, struct inode *ip, uint offset, uint sz)
{
uint i, pa, n;
pte_t *pte;
if((uint)addr % PGSIZE != 0)
panic("loaduvm: addr must be page aligned");
for(i = 0; i < sz; i += PGSIZE){
if((pte = walkpgdir(pgdir, addr+i, 0)) == 0)
panic("loaduvm: address should exist");
pa = PTE_ADDR(*pte);
if(sz - i < PGSIZE)
n = sz - i;
else
n = PGSIZE;
if(readi(ip, (char*)pa, offset+i, n) != n)
return -1;
}
return 0;
}
// Allocate page tables and physical memory to grow process from oldsz to
// newsz, which need not be page aligned. Returns new size or 0 on error.
int
allocuvm(pde_t *pgdir, uint oldsz, uint newsz)
{
char *mem;
uint a;
if(newsz
return
if(newsz
return
> USERTOP)
0;
< oldsz)
oldsz;
a = PGROUNDUP(oldsz);
for(; a < newsz; a += PGSIZE){
mem = kalloc();
if(mem == 0){
cprintf("allocuvm out of memory\n");
deallocuvm(pgdir, newsz, oldsz);
return 0;
}
memset(mem, 0, PGSIZE);
mappages(pgdir, (char*)a, PGSIZE, PADDR(mem), PTE_W|PTE_U);
}
return newsz;
}
Sheet 27
Feb 19 20:50 2011 xv6/vm.c Page 6
Feb 19 20:50 2011 xv6/vm.c Page 7
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
// Deallocate user pages to bring the process size from oldsz to

// newsz. oldsz and newsz need not be page-aligned, nor does newsz
// need to be less than oldsz. oldsz can be larger than the actual
// process size. Returns the new process size.
int
deallocuvm(pde_t *pgdir, uint oldsz, uint newsz)
{
pte_t *pte;
uint a, pa;
if(newsz >= oldsz)
return oldsz;
a = PGROUNDUP(newsz);
for(; a < oldsz; a += PGSIZE){
pte = walkpgdir(pgdir, (char*)a, 0);
if(pte && (*pte & PTE_P) != 0){
if(pa == 0)
panic("kfree");
kfree((char*)pa);
*pte = 0;
}
}
return newsz;
}
// Free a page table and all the physical memory pages
// in the user part.
void
freevm(pde_t *pgdir)
{
uint i;
if(pgdir == 0)
panic("freevm: no pgdir");
deallocuvm(pgdir, USERTOP, 0);
for(i = 0; i < NPDENTRIES; i++){
if(pgdir[i] & PTE_P)
kfree((char*)PTE_ADDR(pgdir[i]));
}
kfree((char*)pgdir);
}
Sheet 28
// Given a parent processs page table, create a copy

// of it for a child.
pde_t*
copyuvm(pde_t *pgdir, uint sz)
{
pde_t *d;
pte_t *pte;
uint pa, i;
char *mem;
if((d = setupkvm()) == 0)
return 0;
for(i = 0; i < sz; i += PGSIZE){
if((pte = walkpgdir(pgdir, (void*)i, 0)) == 0)
panic("copyuvm: pte should exist");
if(!(*pte & PTE_P))
panic("copyuvm: page not present");
if((mem = kalloc()) == 0)
goto bad;
memmove(mem, (char*)pa, PGSIZE);
if(mappages(d, (void*)i, PGSIZE, PADDR(mem), PTE_W|PTE_U) < 0)
goto bad;
}
return d;
bad:
freevm(d);
return 0;
}
Sheet 28
Feb 19 20:50 2011 xv6/vm.c Page 8
Feb 19 20:50 2011 xv6/traps.h Page 1
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
// Map user virtual address to kernel physical address.

char*
uva2ka(pde_t *pgdir, char *uva)
{
pte_t *pte;
pte = walkpgdir(pgdir, uva, 0);
if((*pte & PTE_P) == 0)
return 0;
if((*pte & PTE_U) == 0)
return 0;
return (char*)PTE_ADDR(*pte);
}
// Copy len bytes from p to user address va in page table pgdir.
// Most useful when pgdir is not the current page table.
// uva2ka ensures this only works for PTE_U pages.
int
copyout(pde_t *pgdir, uint va, void *p, uint len)
{
char *buf, *pa0;
uint n, va0;
buf = (char*)p;
while(len > 0){
va0 = (uint)PGROUNDDOWN(va);
pa0 = uva2ka(pgdir, (char*)va0);
if(pa0 == 0)
return -1;
n = PGSIZE - (va - va0);
if(n > len)
n = len;
memmove(pa0 + (va - va0), buf, n);
len -= n;
buf += n;
va = va0 + PGSIZE;
}
return 0;
}
Sheet 29
// x86 trap and interrupt constants.

// Processor-defined:
#define T_DIVIDE
#define T_DEBUG
#define T_NMI
#define T_BRKPT
#define T_OFLOW
#define T_BOUND
#define T_ILLOP
#define T_DEVICE
#define T_DBLFLT
// #define T_COPROC
#define T_TSS
#define T_SEGNP
#define T_STACK
#define T_GPFLT
#define T_PGFLT
// #define T_RES
#define T_FPERR
#define T_ALIGN
#define T_MCHK
#define T_SIMDERR
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
divide error
debug exception
non-maskable interrupt
breakpoint
overflow
bounds check
illegal opcode
device not available
double fault
reserved (not used since 486)
invalid task switch segment
segment not present
stack exception
general protection fault
page fault
reserved
floating point error
aligment check
machine check
SIMD floating point error
// These are arbitrarily chosen, but with care not to overlap

// processor defined exceptions or interrupt vectors.
#define T_SYSCALL
64
// system call
#define T_DEFAULT
500
// catchall
#define T_IRQ0
32
#define
#define
#define
#define
#define
#define
0
1
4
14
19
31
Sheet 29
IRQ_TIMER
IRQ_KBD
IRQ_COM1
IRQ_IDE
IRQ_ERROR
IRQ_SPURIOUS
// IRQ 0 corresponds to int T_IRQ
Feb 19 20:50 2011 xv6/vectors.pl Page 1
Feb 19 20:50 2011 xv6/trapasm.S Page 1
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
#!/usr/bin/perl -w
#
#
#
#
Generate vectors.S, the trap/interrupt entry points.

There has to be one entry point per interrupt number
since otherwise theres no way for trap() to discover
the interrupt number.
print "# generated by vectors.pl - do not edit\n";

print "# handlers\n";
print ".globl alltraps\n";
for(my $i = 0; $i < 256; $i++){
print ".globl vector$i\n";
print "vector$i:\n";
if(!($i == 8 || ($i >= 10 && $i <= 14) || $i == 17)){
print " pushl \$0\n";
}
print " pushl \$$i\n";
print " jmp alltraps\n";
}
print "\n# vector table\n";
print ".data\n";
print ".globl vectors\n";
print "vectors:\n";
for(my $i = 0; $i < 256; $i++){
print " .long vector$i\n";
}
# sample output:
# # handlers
# .globl alltraps
# .globl vector0
# vector0:
#
pushl $0
#
pushl $0
#
jmp alltraps
# ...
#
# # vector table
# .data
# .globl vectors
# vectors:
#
.long vector0
#
.long vector1
#
.long vector2
# ...
Sheet 30

#define SEG_KCPU 3 // kernel per-cpu data
# vectors.S sends all traps here.
.globl alltraps
alltraps:
# Build trap frame.
pushl %ds
pushl %es
pushl %fs
pushl %gs
pushal
# Set up data and per-cpu segments.
movw $(SEG_KDATA<<3), %ax
movw %ax, %ds
movw %ax, %es
movw $(SEG_KCPU<<3), %ax
movw %ax, %fs
movw %ax, %gs
# Call trap(tf), where tf=%esp
pushl %esp
call trap
addl $4, %esp
# Return falls through to trapret...
.globl trapret
trapret:
popal
popl %gs
popl %fs
popl %es
popl %ds
addl $0x8, %esp # trapno and errcode
iret
Sheet 30
Feb 19 20:50 2011 xv6/trap.c Page 1
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150 void
3151 trap(struct trapframe *tf)
3152 {
3153 if(tf->trapno == T_SYSCALL){
3154
if(proc->killed)
3155
exit();
3156
proc->tf = tf;
3157
syscall();
3158
if(proc->killed)
3159
exit();
3160
return;
3161 }
3162
3163 switch(tf->trapno){
3164 case T_IRQ0 + IRQ_TIMER:
3165
if(cpu->id == 0){
3166
acquire(&tickslock);
3167
ticks++;
3168
wakeup(&ticks);
3169
release(&tickslock);
3170
}
3171
lapiceoi();
3172
break;
3173 case T_IRQ0 + IRQ_IDE:
3174
ideintr();
3175
lapiceoi();
3176
break;
3177 case T_IRQ0 + IRQ_IDE+1:
3178
// Bochs generates spurious IDE1 interrupts.
3179
break;
3180 case T_IRQ0 + IRQ_KBD:
3181
kbdintr();
3182
lapiceoi();
3183
break;
3184 case T_IRQ0 + IRQ_COM1:
3185
uartintr();
3186
lapiceoi();
3187
break;
3188 case T_IRQ0 + 7:
3189 case T_IRQ0 + IRQ_SPURIOUS:
3190
cprintf("cpu%d: spurious interrupt at %x:%x\n",
3191
cpu->id, tf->cs, tf->eip);
3192
lapiceoi();
3193
break;
3194
3195
3196
3197
3198
3199
#include
#include
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"mmu.h"
"proc.h"
"x86.h"
"traps.h"
"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));
}
Sheet 31
Sheet 31
Feb 19 20:50 2011 xv6/syscall.h Page 1
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229 }
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
default:
if(proc == 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, cpu->id, 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",
proc->pid, proc->name, tf->trapno, tf->err, cpu->id, tf->eip,
rcr2());
proc->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(proc && proc->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.
if(proc && proc->state == RUNNING && tf->trapno == T_IRQ0+IRQ_TIMER)
yield();
// Check if the process has been killed since we yielded
if(proc && proc->killed && (tf->cs&3) == DPL_USER)
exit();
Sheet 32
// System call numbers

#define SYS_fork
1
#define SYS_exit
2
#define SYS_wait
3
#define SYS_pipe
4
#define SYS_write 5
#define SYS_read
6
#define SYS_close 7
#define SYS_kill
8
#define SYS_exec
9
#define SYS_open 10
#define SYS_mknod 11
#define SYS_unlink 12
#define SYS_fstat 13
#define SYS_link 14
#define SYS_mkdir 15
#define SYS_chdir 16
#define SYS_dup
17
#define SYS_getpid 18
#define SYS_sbrk 19
#define SYS_sleep 20
#define SYS_uptime 21
Sheet 32
Feb 19 20:50 2011 xv6/syscall.c Page 1
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
#include
#include
#include
#include
#include
#include
#include
//
//
//
//
//
"types.h"
"defs.h"
"param.h"
"mmu.h"
"proc.h"
"x86.h"
"syscall.h"
User code makes a system call with INT T_SYSCALL.

System call number in %eax.
Arguments on the stack, from the user call to the C
library system call function. The saved user %esp points
to a saved program counter, and then the first argument.
// Fetch the int at addr from process p.

int
fetchint(struct proc *p, uint addr, int *ip)
{
if(addr >= p->sz || addr+4 > p->sz)
return -1;
*ip = *(int*)(addr);
return 0;
}
// Fetch the nul-terminated string at addr from process p.
// Doesnt actually copy the string - just sets *pp to point at it.
// Returns length of string, not including nul.
int
fetchstr(struct proc *p, uint addr, char **pp)
{
char *s, *ep;
if(addr >= p->sz)
return -1;
*pp = (char*)addr;
ep = (char*)p->sz;
for(s = *pp; s < ep; s++)
if(*s == 0)
return s - *pp;
return -1;
}
// Fetch the nth 32-bit system call argument.
int
argint(int n, int *ip)
{
return fetchint(proc, proc->tf->esp + 4 + 4*n, ip);
}
Sheet 33
// Fetch the nth word-sized system call argument as a pointer

// to a block of memory of size n bytes. Check that the pointer
// lies within the process address space.
int
argptr(int n, char **pp, int size)
{
int i;
if(argint(n, &i) < 0)
return -1;
if((uint)i >= proc->sz || (uint)i+size >= proc->sz)
return -1;
*pp = (char*)i;
return 0;
}
// Fetch the nth word-sized system call argument as a string pointer.
// Check that the pointer is valid and the string is nul-terminated.
// (There is no shared writable memory, so the string cant change
// between this check and being used by the kernel.)
int
argstr(int n, char **pp)
{
int addr;
if(argint(n, &addr) < 0)
return -1;
return fetchstr(proc, addr, pp);
}
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
extern
Sheet 33
int
int
int
int
int
int
int
int
int
int
int
int
int
int
int
int
int
int
int
int
int
sys_chdir(void);
sys_close(void);
sys_dup(void);
sys_exec(void);
sys_exit(void);
sys_fork(void);
sys_fstat(void);
sys_getpid(void);
sys_kill(void);
sys_link(void);
sys_mkdir(void);
sys_mknod(void);
sys_open(void);
sys_pipe(void);
sys_read(void);
sys_sbrk(void);
sys_sleep(void);
sys_unlink(void);
sys_wait(void);
sys_write(void);
sys_uptime(void);
Feb 19 20:50 2011 xv6/sysproc.c Page 1
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
static int (*syscalls[])(void) = {

[SYS_chdir] sys_chdir,
[SYS_close] sys_close,
[SYS_dup]
sys_dup,
[SYS_exec]
sys_exec,
[SYS_exit]
sys_exit,
[SYS_fork]
sys_fork,
[SYS_fstat] sys_fstat,
[SYS_getpid] sys_getpid,
[SYS_kill]
sys_kill,
[SYS_link]
sys_link,
[SYS_mkdir] sys_mkdir,
[SYS_mknod] sys_mknod,
[SYS_open]
sys_open,
[SYS_pipe]
sys_pipe,
[SYS_read]
sys_read,
[SYS_sbrk]
sys_sbrk,
[SYS_sleep] sys_sleep,
[SYS_unlink] sys_unlink,
[SYS_wait]
sys_wait,
[SYS_write] sys_write,
[SYS_uptime] sys_uptime,
};
void
syscall(void)
{
int num;
num = proc->tf->eax;
if(num >= 0 && num < NELEM(syscalls) && syscalls[num])
proc->tf->eax = syscalls[num]();
else {
cprintf("%d %s: unknown sys call %d\n",
proc->pid, proc->name, num);
proc->tf->eax = -1;
}
}
Sheet 34
#include
#include
#include
#include
#include
#include
"types.h"
"x86.h"
"defs.h"
"param.h"
"mmu.h"
"proc.h"
int
sys_fork(void)
{
return fork();
}
int
sys_exit(void)
{
exit();
return 0; // not reached
}
int
sys_wait(void)
{
return wait();
}
int
sys_kill(void)
{
int pid;
if(argint(0, &pid) < 0)
return -1;
return kill(pid);
}
int
sys_getpid(void)
{
return proc->pid;
}
Sheet 34
Feb 19 20:50 2011 xv6/sysproc.c Page 2
Feb 19 20:50 2011 xv6/buf.h Page 1
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
int
sys_sbrk(void)
{
int addr;
int n;
if(argint(0, &n) < 0)
return -1;
addr = proc->sz;
if(growproc(n) < 0)
return -1;
return addr;
}
int
sys_sleep(void)
{
int n;
uint ticks0;
if(argint(0, &n) < 0)
return -1;
ticks0 = ticks;
while(ticks - ticks0 < n){
if(proc->killed){
return -1;
}
sleep(&ticks, &tickslock);
}
return 0;
}
// return how many clock tick interrupts have occurred
// since boot.
int
sys_uptime(void)
{
uint xticks;
xticks = ticks;
return xticks;
}
Sheet 35
struct buf {
int flags;
uint dev;
uint sector;
struct buf *prev; // LRU cache list
struct buf *next;
struct buf *qnext; // disk queue
uchar data[512];
};
#define B_BUSY 0x1 // buffer is locked by some process
#define B_VALID 0x2 // buffer has been read from disk
#define B_DIRTY 0x4 // buffer needs to be written to disk
Sheet 35
Feb 19 20:50 2011 xv6/fcntl.h Page 1
Feb 19 20:50 2011 xv6/stat.h Page 1
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
#define
#define
#define
#define
Sheet 36
O_RDONLY
O_WRONLY
O_RDWR
O_CREATE
0x000
0x001
0x002
0x200
#define T_DIR 1
#define T_FILE 2
#define T_DEV 3
struct stat {
short type;
int dev;
uint ino;
short nlink;
uint size;
};
Sheet 36
//
//
//
//
//
// Directory
// File
// Special device
Type of file
Device number
Inode number on device
Number of links to file
Size of file in bytes
Feb 19 20:50 2011 xv6/fs.h Page 1
Feb 19 20:50 2011 xv6/file.h Page 1
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
// On-disk file system format.

// Both the kernel and user programs use this header file.
// Block 0 is unused.
// Block 1 is super block.
// Inodes start at block 2.
#define ROOTINO 1 // root i-number
#define BSIZE 512 // block size
// File system super
struct superblock {
uint size;
uint nblocks;
uint ninodes;
};
block
// Size of file system image (blocks)
// Number of data blocks
// Number of inodes.
#define NDIRECT 12
#define NINDIRECT (BSIZE / sizeof(uint))
#define MAXFILE (NDIRECT + NINDIRECT)
// On-disk inode structure
struct dinode {
short type;
//
short major;
//
short minor;
//
short nlink;
//
uint size;
//
uint addrs[NDIRECT+1];
};
File type
Major device number (T_DEV only)
Minor device number (T_DEV only)
Number of links to inode in file system
Size of file (bytes)
// Data block addresses
// Inodes per block.

#define IPB
(BSIZE / sizeof(struct dinode))
// Block containing inode i
#define IBLOCK(i)
((i) / IPB + 2)
// Bitmap bits per block
#define BPB
(BSIZE*8)
// Block containing bit for block b
#define BBLOCK(b, ninodes) (b/BPB + (ninodes)/IPB + 3)
// Directory is a file containing a sequence of dirent structures.
#define DIRSIZ 14
struct dirent {
ushort inum;
char name[DIRSIZ];
};
Sheet 37
struct file {
enum { FD_NONE, FD_PIPE, FD_INODE } type;
int ref; // reference count
char readable;
char writable;
struct pipe *pipe;
struct inode *ip;
uint off;
};
// in-core file system types
struct inode {
uint dev;
uint inum;
int ref;
int flags;
//
//
//
//
Device number
Inode number
Reference count
I_BUSY, I_VALID
short type;
// copy of disk inode
short major;
short minor;
short nlink;
uint size;
uint addrs[NDIRECT+1];
};
#define I_BUSY 0x1
#define I_VALID 0x2
// device implementations
struct devsw {
int (*read)(struct inode*, char*, int);
int (*write)(struct inode*, char*, int);
};
extern struct devsw devsw[];
#define CONSOLE 1
Sheet 37
Feb 19 20:50 2011 xv6/ide.c Page 1
Feb 19 20:50 2011 xv6/ide.c Page 2
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
// Simple PIO-based (non-DMA) IDE driver code.

#include
#include
#include
#include
#include
#include
#include
#include
#include
#define
#define
#define
#define
"types.h"
"defs.h"
"param.h"
"mmu.h"
"proc.h"
"x86.h"
"traps.h"
"spinlock.h"
"buf.h"
IDE_BSY
IDE_DRDY
IDE_DF
IDE_ERR
0x80
0x40
0x20
0x01
#define IDE_CMD_READ 0x20

#define IDE_CMD_WRITE 0x30
// idequeue points to the buf now being read/written to the disk.
// idequeue->qnext points to the next buf to be processed.
// You must hold idelock while manipulating queue.
static struct spinlock idelock;
static struct buf *idequeue;
static int havedisk1;
static void idestart(struct buf*);
// Wait for IDE disk to become ready.
static int
idewait(int checkerr)
{
int r;
while(((r = inb(0x1f7)) & (IDE_BSY|IDE_DRDY)) != IDE_DRDY)
;
if(checkerr && (r & (IDE_DF|IDE_ERR)) != 0)
return -1;
return 0;
}
Sheet 38
void
ideinit(void)
{
int i;
initlock(&idelock, "ide");
picenable(IRQ_IDE);
ioapicenable(IRQ_IDE, ncpu - 1);
idewait(0);
// Check if disk 1 is present
outb(0x1f6, 0xe0 | (1<<4));
for(i=0; i<1000; i++){
if(inb(0x1f7) != 0){
havedisk1 = 1;
break;
}
}
// Switch back to disk 0.
outb(0x1f6, 0xe0 | (0<<4));
}
// Start the request for b. Caller must hold idelock.
static void
idestart(struct buf *b)
{
if(b == 0)
panic("idestart");
idewait(0);
outb(0x3f6, 0); // generate interrupt
outb(0x1f2, 1); // number of sectors
outb(0x1f3, b->sector & 0xff);
outb(0x1f4, (b->sector >> 8) & 0xff);
outb(0x1f5, (b->sector >> 16) & 0xff);
outb(0x1f6, 0xe0 | ((b->dev&1)<<4) | ((b->sector>>24)&0x0f));
if(b->flags & B_DIRTY){
outb(0x1f7, IDE_CMD_WRITE);
outsl(0x1f0, b->data, 512/4);
} else {
outb(0x1f7, IDE_CMD_READ);
}
}
Sheet 38
Feb 19 20:50 2011 xv6/ide.c Page 3
Feb 19 20:50 2011 xv6/ide.c Page 4
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
// Interrupt handler.
void
ideintr(void)
{
struct buf *b;
// Take first buffer off queue.
acquire(&idelock);
if((b = idequeue) == 0){
release(&idelock);
// cprintf("spurious IDE interrupt\n");
return;
}
idequeue = b->qnext;
// Read data if needed.
if(!(b->flags & B_DIRTY) && idewait(1) >= 0)
insl(0x1f0, b->data, 512/4);
// Wake process waiting for this buf.
b->flags |= B_VALID;
b->flags &= ~B_DIRTY;
wakeup(b);
// Start disk on next buf in queue.
if(idequeue != 0)
idestart(idequeue);
release(&idelock);
}
Sheet 39
// Sync buf with disk.

// If B_DIRTY is set, write buf to disk, clear B_DIRTY, set B_VALID.
// Else if B_VALID is not set, read buf from disk, set B_VALID.
void
iderw(struct buf *b)
{
struct buf **pp;
if(!(b->flags & B_BUSY))
panic("iderw: buf not busy");
if((b->flags & (B_VALID|B_DIRTY)) == B_VALID)
panic("iderw: nothing to do");
if(b->dev != 0 && !havedisk1)
panic("iderw: ide disk 1 not present");
acquire(&idelock);
// Append b to idequeue.
b->qnext = 0;
for(pp=&idequeue; *pp; pp=&(*pp)->qnext)
;
*pp = b;
// Start disk if necessary.
if(idequeue == b)
idestart(b);
// Wait for request to finish.
// Assuming will not sleep too long: ignore proc->killed.
while((b->flags & (B_VALID|B_DIRTY)) != B_VALID){
sleep(b, &idelock);
}
release(&idelock);
}
Sheet 39
Feb 19 20:50 2011 xv6/bio.c Page 1
Feb 19 20:50 2011 xv6/bio.c Page 2
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
Buffer cache.
The buffer cache is a linked list of buf structures holding
cached copies of disk block contents. Caching disk blocks
in memory reduces the number of disk reads and also provides
a synchronization point for disk blocks used by multiple processes.
Interface:
* To get a buffer for a particular disk block, call bread.
* After changing buffer data, call bwrite to flush it to disk.
* When done with the buffer, call brelse.
* Do not use the buffer after calling brelse.
* Only one process at a time can use a buffer,
so do not keep them longer than necessary.
The implementation uses three state flags internally:
* B_BUSY: the block has been returned from bread
and has not been passed back to brelse.
* B_VALID: the buffer data has been initialized
with the associated disk block contents.
* B_DIRTY: the buffer data has been modified
and needs to be written to disk.
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"spinlock.h"
"buf.h"
struct {
struct buf buf[NBUF];
// Linked list of all buffers, through prev/next.
// head.next is most recently used.
struct buf head;
} bcache;
void
binit(void)
{
struct buf *b;
initlock(&bcache.lock, "bcache");
Sheet 40
// Create linked list of buffers

bcache.head.prev = &bcache.head;
bcache.head.next = &bcache.head;
for(b = bcache.buf; b < bcache.buf+NBUF; b++){
b->next = bcache.head.next;
b->prev = &bcache.head;
b->dev = -1;
bcache.head.next->prev = b;
bcache.head.next = b;
}
}
// Look through buffer cache for sector on device dev.
// If not found, allocate fresh block.
// In either case, return locked buffer.
static struct buf*
bget(uint dev, uint sector)
{
struct buf *b;
acquire(&bcache.lock);
loop:
// Try for cached block.
for(b = bcache.head.next; b != &bcache.head; b = b->next){
if(b->dev == dev && b->sector == sector){
if(!(b->flags & B_BUSY)){
b->flags |= B_BUSY;
release(&bcache.lock);
return b;
}
sleep(b, &bcache.lock);
goto loop;
}
}
// Allocate fresh block.
for(b = bcache.head.prev; b != &bcache.head; b = b->prev){
if((b->flags & B_BUSY) == 0){
b->dev = dev;
b->sector = sector;
b->flags = B_BUSY;
return b;
}
}
panic("bget: no buffers");
}
Sheet 40
Feb 19 20:50 2011 xv6/bio.c Page 3
Feb 19 20:50 2011 xv6/fs.c Page 1
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
// Return a B_BUSY buf with the contents of the indicated disk sector.
struct buf*
bread(uint dev, uint sector)
{
struct buf *b;
b = bget(dev, sector);
if(!(b->flags & B_VALID))
iderw(b);
return b;
}
// Write bs contents to disk. Must be locked.
void
bwrite(struct buf *b)
{
if((b->flags & B_BUSY) == 0)
panic("bwrite");
b->flags |= B_DIRTY;
iderw(b);
}
// Release the buffer b.
void
brelse(struct buf *b)
{
if((b->flags & B_BUSY) == 0)
panic("brelse");
acquire(&bcache.lock);
b->next->prev = b->prev;
b->prev->next = b->next;
b->next = bcache.head.next;
b->prev = &bcache.head;
bcache.head.next->prev = b;
bcache.head.next = b;
b->flags &= ~B_BUSY;
wakeup(b);
}
Sheet 41
//
//
//
//
//
//
//
//
//
//
//
File system implementation. Four layers:

+ Blocks: allocator for raw disk blocks.
+ Files: inode allocator, reading, writing, metadata.
+ Directories: inode with special contents (list of other inodes!)
+ Names: paths like /usr/rtm/xv6/fs.c for convenient naming.
Disk layout is: superblock, inodes, block in-use bitmap, data blocks.
This file contains the low-level file system manipulation
routines. The (higher-level) system call implementations
are in sysfile.c.
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"stat.h"
"mmu.h"
"proc.h"
"spinlock.h"
"buf.h"
"fs.h"
"file.h"
#define min(a, b) ((a) < (b) ? (a) : (b))

static void itrunc(struct inode*);
// Read the super block.
static void
readsb(int dev, struct superblock *sb)
{
struct buf *bp;
bp = bread(dev, 1);
memmove(sb, bp->data, sizeof(*sb));
brelse(bp);
}
// Zero a block.
static void
bzero(int dev, int bno)
{
struct buf *bp;
bp = bread(dev, bno);
memset(bp->data, 0, BSIZE);
bwrite(bp);
brelse(bp);
}
Sheet 41
Feb 19 20:50 2011 xv6/fs.c Page 2
Feb 19 20:50 2011 xv6/fs.c Page 3
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
// Blocks.
// Allocate a disk block.
static uint
balloc(uint dev)
{
int b, bi, m;
struct buf *bp;
struct superblock sb;
bp = 0;
readsb(dev, &sb);
for(b = 0; b < sb.size; b += BPB){
bp = bread(dev, BBLOCK(b, sb.ninodes));
for(bi = 0; bi < BPB; bi++){
m = 1 << (bi % 8);
if((bp->data[bi/8] & m) == 0){ // Is block free?
bp->data[bi/8] |= m; // Mark block in use on disk.
bwrite(bp);
brelse(bp);
return b + bi;
}
}
brelse(bp);
}
panic("balloc: out of blocks");
}
// Free a disk block.
static void
bfree(int dev, uint b)
{
struct buf *bp;
int bi, m;
bzero(dev, b);
readsb(dev, &sb);
bp = bread(dev, BBLOCK(b, sb.ninodes));
bi = b % BPB;
m = 1 << (bi % 8);
if((bp->data[bi/8] & m) == 0)
panic("freeing free block");
bp->data[bi/8] &= ~m; // Mark block free on disk.
bwrite(bp);
brelse(bp);
}
Sheet 42
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
//
Inodes.
An inode is a single, unnamed file in the file system.
The inode disk structure holds metadata (the type, device numbers,
and data size) along with a list of blocks where the associated
data can be found.
The inodes are laid out sequentially on disk immediately after
the superblock. The kernel keeps a cache of the in-use
on-disk structures to provide a place for synchronizing access
to inodes shared between multiple processes.
ip->ref counts the number of pointer references to this cached
inode; references are typically kept in struct file and in proc->cwd.
When ip->ref falls to zero, the inode is no longer cached.
It is an error to use an inode without holding a reference to it.
Processes are only allowed to read and write inode
metadata and contents when holding the inodes lock,
represented by the I_BUSY flag in the in-memory copy.
Because inode locks are held during disk accesses,
they are implemented using a flag rather than with
spin locks. Callers are responsible for locking
inodes before passing them to routines in this file; leaving
this responsibility with the caller makes it possible for them
to create arbitrarily-sized atomic operations.
To give maximum control over locking to the callers,
the routines in this file that return inode pointers
return pointers to *unlocked* inodes. It is the callers
responsibility to lock them before using them. A non-zero
ip->ref keeps these unlocked inodes in the cache.
struct {
struct inode inode[NINODE];
} icache;
void
iinit(void)
{
initlock(&icache.lock, "icache");
}
static struct inode* iget(uint dev, uint inum);
Sheet 42
Feb 19 20:50 2011 xv6/fs.c Page 4
Feb 19 20:50 2011 xv6/fs.c Page 5
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
// Allocate a new inode with the given type on device dev.

struct inode*
ialloc(uint dev, short type)
{
int inum;
struct buf *bp;
struct dinode *dip;
readsb(dev, &sb);
for(inum = 1; inum < sb.ninodes; inum++){ // loop over inode blocks
bp = bread(dev, IBLOCK(inum));
dip = (struct dinode*)bp->data + inum%IPB;
if(dip->type == 0){ // a free inode
memset(dip, 0, sizeof(*dip));
dip->type = type;
bwrite(bp); // mark it allocated on the disk
brelse(bp);
return iget(dev, inum);
}
brelse(bp);
}
panic("ialloc: no inodes");
}
// Copy inode, which has changed, from memory to disk.
void
iupdate(struct inode *ip)
{
struct buf *bp;
struct dinode *dip;
bp = bread(ip->dev, IBLOCK(ip->inum));
dip = (struct dinode*)bp->data + ip->inum%IPB;
dip->type = ip->type;
dip->major = ip->major;
dip->minor = ip->minor;
dip->nlink = ip->nlink;
dip->size = ip->size;
memmove(dip->addrs, ip->addrs, sizeof(ip->addrs));
bwrite(bp);
brelse(bp);
}
Sheet 43
// Find the inode with number inum on device dev

// and return the in-memory copy.
static struct inode*
iget(uint dev, uint inum)
{
struct inode *ip, *empty;
acquire(&icache.lock);
// Try for cached inode.
empty = 0;
for(ip = &icache.inode[0]; ip < &icache.inode[NINODE]; ip++){
if(ip->ref > 0 && ip->dev == dev && ip->inum == inum){
ip->ref++;
release(&icache.lock);
return ip;
}
if(empty == 0 && ip->ref == 0)
// Remember empty slot.
empty = ip;
}
// Allocate fresh inode.
if(empty == 0)
panic("iget: no inodes");
ip = empty;
ip->dev = dev;
ip->inum = inum;
ip->ref = 1;
ip->flags = 0;
return ip;
}
// Increment reference count for ip.
// Returns ip to enable ip = idup(ip1) idiom.
struct inode*
idup(struct inode *ip)
{
ip->ref++;
return ip;
}
Sheet 43
Feb 19 20:50 2011 xv6/fs.c Page 6
Feb 19 20:50 2011 xv6/fs.c Page 7
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
// Lock the given inode.

void
ilock(struct inode *ip)
{
struct buf *bp;
struct dinode *dip;
if(ip == 0 || ip->ref < 1)
panic("ilock");
while(ip->flags & I_BUSY)
sleep(ip, &icache.lock);
ip->flags |= I_BUSY;
if(!(ip->flags & I_VALID)){
bp = bread(ip->dev, IBLOCK(ip->inum));
dip = (struct dinode*)bp->data + ip->inum%IPB;
ip->type = dip->type;
ip->major = dip->major;
ip->minor = dip->minor;
ip->nlink = dip->nlink;
ip->size = dip->size;
memmove(ip->addrs, dip->addrs, sizeof(ip->addrs));
brelse(bp);
ip->flags |= I_VALID;
if(ip->type == 0)
panic("ilock: no type");
}
}
// Unlock the given inode.
void
iunlock(struct inode *ip)
{
if(ip == 0 || !(ip->flags & I_BUSY) || ip->ref < 1)
panic("iunlock");
ip->flags &= ~I_BUSY;
wakeup(ip);
}
Sheet 44
// Caller holds reference to unlocked ip. Drop reference.

void
iput(struct inode *ip)
{
if(ip->ref == 1 && (ip->flags & I_VALID) && ip->nlink == 0){
// inode is no longer used: truncate and free inode.
if(ip->flags & I_BUSY)
panic("iput busy");
ip->flags |= I_BUSY;
itrunc(ip);
ip->type = 0;
iupdate(ip);
ip->flags = 0;
wakeup(ip);
}
ip->ref--;
}
// Common idiom: unlock, then put.
void
iunlockput(struct inode *ip)
{
iunlock(ip);
iput(ip);
}
Sheet 44
Feb 19 20:50 2011 xv6/fs.c Page 8
Feb 19 20:50 2011 xv6/fs.c Page 9
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
//
//
//
//
//
//
Inode contents
The contents (data) associated with each inode is stored
in a sequence of blocks on the disk. The first NDIRECT blocks
are listed in ip->addrs[]. The next NINDIRECT blocks are
listed in the block ip->addrs[NDIRECT].
// Return the disk block address of the nth block in inode ip.
// If there is no such block, bmap allocates one.
static uint
bmap(struct inode *ip, uint bn)
{
uint addr, *a;
struct buf *bp;
if(bn < NDIRECT){
if((addr = ip->addrs[bn]) == 0)
ip->addrs[bn] = addr = balloc(ip->dev);
return addr;
}
bn -= NDIRECT;
if(bn < NINDIRECT){
// Load indirect block, allocating if necessary.
if((addr = ip->addrs[NDIRECT]) == 0)
ip->addrs[NDIRECT] = addr = balloc(ip->dev);
bp = bread(ip->dev, addr);
a = (uint*)bp->data;
if((addr = a[bn]) == 0){
a[bn] = addr = balloc(ip->dev);
bwrite(bp);
}
brelse(bp);
return addr;
}
panic("bmap: out of range");
}
Sheet 45
// Truncate inode (discard contents).

// Only called after the last dirent referring
// to this inode has been erased on disk.
static void
itrunc(struct inode *ip)
{
int i, j;
struct buf *bp;
uint *a;
for(i = 0; i < NDIRECT; i++){
if(ip->addrs[i]){
bfree(ip->dev, ip->addrs[i]);
ip->addrs[i] = 0;
}
}
if(ip->addrs[NDIRECT]){
bp = bread(ip->dev, ip->addrs[NDIRECT]);
a = (uint*)bp->data;
for(j = 0; j < NINDIRECT; j++){
if(a[j])
bfree(ip->dev, a[j]);
}
brelse(bp);
bfree(ip->dev, ip->addrs[NDIRECT]);
ip->addrs[NDIRECT] = 0;
}
ip->size = 0;
iupdate(ip);
}
// Copy stat information from inode.
void
stati(struct inode *ip, struct stat *st)
{
st->dev = ip->dev;
st->ino = ip->inum;
st->type = ip->type;
st->nlink = ip->nlink;
st->size = ip->size;
}
Sheet 45
Feb 19 20:50 2011 xv6/fs.c Page 10
Feb 19 20:50 2011 xv6/fs.c Page 11
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
// Read data from inode.

int
readi(struct inode *ip, char *dst, uint off, uint n)
{
uint tot, m;
struct buf *bp;
if(ip->type == T_DEV){
if(ip->major < 0 || ip->major >= NDEV || !devsw[ip->major].read)
return -1;
return devsw[ip->major].read(ip, dst, n);
}
if(off > ip->size || off + n < off)
return -1;
if(off + n > ip->size)
n = ip->size - off;
for(tot=0; tot<n; tot+=m, off+=m, dst+=m){
bp = bread(ip->dev, bmap(ip, off/BSIZE));
m = min(n - tot, BSIZE - off%BSIZE);
memmove(dst, bp->data + off%BSIZE, m);
brelse(bp);
}
return n;
}
Sheet 46
// Write data to inode.

int
writei(struct inode *ip, char *src, uint off, uint n)
{
uint tot, m;
struct buf *bp;
if(ip->type == T_DEV){
if(ip->major < 0 || ip->major >= NDEV || !devsw[ip->major].write)
return -1;
return devsw[ip->major].write(ip, src, n);
}
if(off > ip->size || off + n < off)
return -1;
if(off + n > MAXFILE*BSIZE)
n = MAXFILE*BSIZE - off;
for(tot=0; tot<n; tot+=m, off+=m, src+=m){
bp = bread(ip->dev, bmap(ip, off/BSIZE));
m = min(n - tot, BSIZE - off%BSIZE);
memmove(bp->data + off%BSIZE, src, m);
bwrite(bp);
brelse(bp);
}
if(n > 0 && off > ip->size){
ip->size = off;
iupdate(ip);
}
return n;
}
Sheet 46
Feb 19 20:50 2011 xv6/fs.c Page 12
Feb 19 20:50 2011 xv6/fs.c Page 13
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
// Directories
int
namecmp(const char *s, const char *t)
{
return strncmp(s, t, DIRSIZ);
}
// Look for a directory entry in a directory.
// If found, set *poff to byte offset of entry.
// Caller must have already locked dp.
struct inode*
dirlookup(struct inode *dp, char *name, uint *poff)
{
uint off, inum;
struct buf *bp;
struct dirent *de;
if(dp->type != T_DIR)
panic("dirlookup not DIR");
for(off = 0; off < dp->size; off += BSIZE){
bp = bread(dp->dev, bmap(dp, off / BSIZE));
for(de = (struct dirent*)bp->data;
de < (struct dirent*)(bp->data + BSIZE);
de++){
if(de->inum == 0)
continue;
if(namecmp(name, de->name) == 0){
// entry matches path element
if(poff)
*poff = off + (uchar*)de - bp->data;
inum = de->inum;
brelse(bp);
return iget(dp->dev, inum);
}
}
brelse(bp);
}
return 0;
}
Sheet 47
// Write a new directory entry (name, inum) into the directory dp.
int
dirlink(struct inode *dp, char *name, uint inum)
{
int off;
struct dirent de;
struct inode *ip;
// Check that name is not present.
if((ip = dirlookup(dp, name, 0)) != 0){
iput(ip);
return -1;
}
// Look for an empty dirent.
for(off = 0; off < dp->size; off += sizeof(de)){
if(readi(dp, (char*)&de, off, sizeof(de)) != sizeof(de))
panic("dirlink read");
if(de.inum == 0)
break;
}
strncpy(de.name, name, DIRSIZ);
de.inum = inum;
if(writei(dp, (char*)&de, off, sizeof(de)) != sizeof(de))
panic("dirlink");
return 0;
}
Sheet 47
Feb 19 20:50 2011 xv6/fs.c Page 14
Feb 19 20:50 2011 xv6/fs.c Page 15
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
// Paths
// Copy the next path element from path into name.
// Return a pointer to the element following the copied one.
// The returned path has no leading slashes,
// so the caller can check *path==\0 to see if the name is the last one.
// If no name to remove, return 0.
//
// Examples:
// skipelem("a/bb/c", name) = "bb/c", setting name = "a"
// skipelem("///a//bb", name) = "bb", setting name = "a"
// skipelem("a", name) = "", setting name = "a"
// skipelem("", name) = skipelem("////", name) = 0
//
static char*
skipelem(char *path, char *name)
{
char *s;
int len;
while(*path == /)
path++;
if(*path == 0)
return 0;
s = path;
while(*path != / && *path != 0)
path++;
len = path - s;
if(len >= DIRSIZ)
memmove(name, s, DIRSIZ);
else {
memmove(name, s, len);
name[len] = 0;
}
while(*path == /)
path++;
return path;
}
Sheet 48
// Look up and return the inode for a path name.

// If parent != 0, return the inode for the parent and copy the final
// path element into name, which must have room for DIRSIZ bytes.
namex(char *path, int nameiparent, char *name)
{
struct inode *ip, *next;
if(*path == /)
ip = iget(ROOTDEV, ROOTINO);
else
ip = idup(proc->cwd);
while((path = skipelem(path, name)) != 0){
ilock(ip);
if(ip->type != T_DIR){
iunlockput(ip);
return 0;
}
if(nameiparent && *path == \0){
// Stop one level early.
iunlock(ip);
return ip;
}
if((next = dirlookup(ip, name, 0)) == 0){
iunlockput(ip);
return 0;
}
iunlockput(ip);
ip = next;
}
if(nameiparent){
iput(ip);
return 0;
}
return ip;
}
struct inode*
namei(char *path)
{
char name[DIRSIZ];
return namex(path, 0, name);
}
struct inode*
nameiparent(char *path, char *name)
{
return namex(path, 1, name);
}
Sheet 48
Feb 19 20:50 2011 xv6/file.c Page 1
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"fs.h"
"file.h"
"spinlock.h"
struct devsw devsw[NDEV];

struct {
struct file file[NFILE];
} ftable;
void
fileinit(void)
{
initlock(&ftable.lock, "ftable");
}
// Allocate a file structure.
struct file*
filealloc(void)
{
struct file *f;
acquire(&ftable.lock);
for(f = ftable.file; f < ftable.file + NFILE; f++){
if(f->ref == 0){
f->ref = 1;
release(&ftable.lock);
return f;
}
}
return 0;
}
// Increment ref count for file f.
struct file*
filedup(struct file *f)
{
if(f->ref < 1)
panic("filedup");
f->ref++;
return f;
}
Sheet 49
// Close file f. (Decrement ref count, close when reaches 0.)

void
fileclose(struct file *f)
{
struct file ff;
if(f->ref < 1)
panic("fileclose");
if(--f->ref > 0){
return;
}
ff = *f;
f->ref = 0;
f->type = FD_NONE;
if(ff.type == FD_PIPE)
pipeclose(ff.pipe, ff.writable);
else if(ff.type == FD_INODE)
iput(ff.ip);
}
// Get metadata about file f.
int
filestat(struct file *f, struct stat *st)
{
if(f->type == FD_INODE){
ilock(f->ip);
stati(f->ip, st);
iunlock(f->ip);
return 0;
}
return -1;
}
Sheet 49
Feb 19 20:50 2011 xv6/sysfile.c Page 1
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
// Read from file f. Addr is kernel address.

int
fileread(struct file *f, char *addr, int n)
{
int r;
if(f->readable == 0)
return -1;
if(f->type == FD_PIPE)
return piperead(f->pipe, addr, n);
ilock(f->ip);
if((r = readi(f->ip, addr, f->off, n)) > 0)
f->off += r;
iunlock(f->ip);
return r;
}
panic("fileread");
}
// Write to file f. Addr is kernel address.
int
filewrite(struct file *f, char *addr, int n)
{
int r;
if(f->writable == 0)
return -1;
if(f->type == FD_PIPE)
return pipewrite(f->pipe, addr, n);
ilock(f->ip);
if((r = writei(f->ip, addr, f->off, n)) > 0)
f->off += r;
iunlock(f->ip);
return r;
}
panic("filewrite");
}
Sheet 50
#include
#include
#include
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"stat.h"
"mmu.h"
"proc.h"
"fs.h"
"file.h"
"fcntl.h"
// Fetch the nth word-sized system call argument as a file descriptor

// and return both the descriptor and the corresponding struct file.
static int
argfd(int n, int *pfd, struct file **pf)
{
int fd;
struct file *f;
if(argint(n, &fd) < 0)
return -1;
if(fd < 0 || fd >= NOFILE || (f=proc->ofile[fd]) == 0)
return -1;
if(pfd)
*pfd = fd;
if(pf)
*pf = f;
return 0;
}
// Allocate a file descriptor for the given file.
// Takes over file reference from caller on success.
static int
fdalloc(struct file *f)
{
int fd;
for(fd = 0; fd < NOFILE; fd++){
if(proc->ofile[fd] == 0){
proc->ofile[fd] = f;
return fd;
}
}
return -1;
}
Sheet 50
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
int
sys_dup(void)
{
struct file *f;
int fd;
if(argfd(0, 0, &f) < 0)
return -1;
if((fd=fdalloc(f)) < 0)
return -1;
filedup(f);
return fd;
}
int
sys_read(void)
{
struct file *f;
int n;
char *p;
if(argfd(0, 0, &f) < 0 || argint(2, &n) < 0 || argptr(1, &p, n) < 0)
return -1;
return fileread(f, p, n);
}
int
sys_write(void)
{
struct file *f;
int n;
char *p;
if(argfd(0, 0, &f) < 0 || argint(2, &n) < 0 || argptr(1, &p, n) < 0)
return -1;
return filewrite(f, p, n);
}
int
sys_close(void)
{
int fd;
struct file *f;
if(argfd(0, &fd, &f) < 0)
return -1;
proc->ofile[fd] = 0;
fileclose(f);
return 0;
}
Sheet 51
int
sys_fstat(void)
{
struct file *f;
struct stat *st;
if(argfd(0, 0, &f) < 0 || argptr(1, (void*)&st, sizeof(*st)) < 0)
return -1;
return filestat(f, st);
}
// Create the path new as a link to the same inode as old.
int
sys_link(void)
{
char name[DIRSIZ], *new, *old;
struct inode *dp, *ip;
if(argstr(0, &old) < 0 || argstr(1, &new) < 0)
return -1;
if((ip = namei(old)) == 0)
return -1;
ilock(ip);
if(ip->type == T_DIR){
iunlockput(ip);
return -1;
}
ip->nlink++;
iupdate(ip);
iunlock(ip);
if((dp = nameiparent(new, name)) == 0)
goto bad;
ilock(dp);
if(dp->dev != ip->dev || dirlink(dp, name, ip->inum) < 0){
iunlockput(dp);
goto bad;
}
iunlockput(dp);
iput(ip);
return 0;
bad:
ilock(ip);
ip->nlink--;
iupdate(ip);
iunlockput(ip);
return -1;
}
Sheet 51
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
// Is the directory dp empty except for "." and ".." ?

static int
isdirempty(struct inode *dp)
{
int off;
struct dirent de;
for(off=2*sizeof(de); off<dp->size; off+=sizeof(de)){
if(readi(dp, (char*)&de, off, sizeof(de)) != sizeof(de))
panic("isdirempty: readi");
if(de.inum != 0)
return 0;
}
return 1;
}
Sheet 52
int
sys_unlink(void)
{
struct inode *ip, *dp;
struct dirent de;
char name[DIRSIZ], *path;
uint off;
if(argstr(0, &path) < 0)
return -1;
if((dp = nameiparent(path, name)) == 0)
return -1;
ilock(dp);
// Cannot unlink "." or "..".
if(namecmp(name, ".") == 0 || namecmp(name, "..") == 0){
iunlockput(dp);
return -1;
}
if((ip = dirlookup(dp, name, &off)) == 0){
iunlockput(dp);
return -1;
}
ilock(ip);
if(ip->nlink < 1)
panic("unlink: nlink < 1");
if(ip->type == T_DIR && !isdirempty(ip)){
iunlockput(ip);
iunlockput(dp);
return -1;
}
memset(&de, 0, sizeof(de));
if(writei(dp, (char*)&de, off, sizeof(de)) != sizeof(de))
panic("unlink: writei");
if(ip->type == T_DIR){
dp->nlink--;
iupdate(dp);
}
iunlockput(dp);
ip->nlink--;
iupdate(ip);
iunlockput(ip);
return 0;
}
Sheet 52
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399

create(char *path, short type, short major, short minor)
{
uint off;
struct inode *ip, *dp;
char name[DIRSIZ];
if((dp = nameiparent(path, name)) == 0)
return 0;
ilock(dp);
if((ip = dirlookup(dp, name, &off)) != 0){
iunlockput(dp);
ilock(ip);
if(type == T_FILE && ip->type == T_FILE)
return ip;
iunlockput(ip);
return 0;
}
if((ip = ialloc(dp->dev, type)) == 0)
panic("create: ialloc");
ilock(ip);
ip->major = major;
ip->minor = minor;
ip->nlink = 1;
iupdate(ip);
if(type == T_DIR){ // Create . and .. entries.
dp->nlink++; // for ".."
iupdate(dp);
// No ip->nlink++ for ".": avoid cyclic ref count.
if(dirlink(ip, ".", ip->inum) < 0 || dirlink(ip, "..", dp->inum) < 0)
panic("create dots");
}
if(dirlink(dp, name, ip->inum) < 0)
panic("create: dirlink");
iunlockput(dp);
return ip;
}
Sheet 53
int
sys_open(void)
{
char *path;
int fd, omode;
struct file *f;
struct inode *ip;
if(argstr(0, &path) < 0 || argint(1, &omode) < 0)
return -1;
if(omode & O_CREATE){
if((ip = create(path, T_FILE, 0, 0)) == 0)
return -1;
} else {
if((ip = namei(path)) == 0)
return -1;
ilock(ip);
if(ip->type == T_DIR && omode != O_RDONLY){
iunlockput(ip);
return -1;
}
}
if((f = filealloc()) == 0 || (fd = fdalloc(f)) < 0){
if(f)
fileclose(f);
iunlockput(ip);
return -1;
}
iunlock(ip);
f->type = FD_INODE;
f->ip = ip;
f->off = 0;
f->readable = !(omode & O_WRONLY);
f->writable = (omode & O_WRONLY) || (omode & O_RDWR);
return fd;
}
int
sys_mkdir(void)
{
char *path;
struct inode *ip;
if(argstr(0, &path) < 0 || (ip = create(path, T_DIR, 0, 0)) == 0)
return -1;
iunlockput(ip);
return 0;
}
Sheet 53
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
int
sys_mknod(void)
{
struct inode *ip;
char *path;
int len;
int major, minor;
if((len=argstr(0, &path)) < 0 ||
argint(1, &major) < 0 ||
argint(2, &minor) < 0 ||
(ip = create(path, T_DEV, major, minor)) == 0)
return -1;
iunlockput(ip);
return 0;
}
int
sys_chdir(void)
{
char *path;
struct inode *ip;
if(argstr(0, &path) < 0 || (ip = namei(path)) == 0)
return -1;
ilock(ip);
if(ip->type != T_DIR){
iunlockput(ip);
return -1;
}
iunlock(ip);
iput(proc->cwd);
proc->cwd = ip;
return 0;
}
Sheet 54
int
sys_exec(void)
{
char *path, *argv[MAXARG];
int i;
uint uargv, uarg;
if(argstr(0, &path) < 0 || argint(1, (int*)&uargv) < 0){
return -1;
}
memset(argv, 0, sizeof(argv));
for(i=0;; i++){
if(i >= NELEM(argv))
return -1;
if(fetchint(proc, uargv+4*i, (int*)&uarg) < 0)
return -1;
if(uarg == 0){
argv[i] = 0;
break;
}
if(fetchstr(proc, uarg, &argv[i]) < 0)
return -1;
}
return exec(path, argv);
}
int
sys_pipe(void)
{
int *fd;
struct file *rf, *wf;
int fd0, fd1;
if(argptr(0, (void*)&fd, 2*sizeof(fd[0])) < 0)
return -1;
if(pipealloc(&rf, &wf) < 0)
return -1;
fd0 = -1;
if((fd0 = fdalloc(rf)) < 0 || (fd1 = fdalloc(wf)) < 0){
if(fd0 >= 0)
proc->ofile[fd0] = 0;
fileclose(rf);
fileclose(wf);
return -1;
}
fd[0] = fd0;
fd[1] = fd1;
return 0;
}
Sheet 54
Feb 19 20:50 2011 xv6/exec.c Page 1
Feb 19 20:50 2011 xv6/exec.c Page 2
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550 // Allocate a one-page stack at the next page boundary

5551 sz = PGROUNDUP(sz);
5552 if((sz = allocuvm(pgdir, sz, sz + PGSIZE)) == 0)
5553
goto bad;
5554
5555 // Push argument strings, prepare rest of stack in ustack.
5556 sp = sz;
5557 for(argc = 0; argv[argc]; argc++) {
5558
if(argc >= MAXARG)
5559
goto bad;
5560
sp -= strlen(argv[argc]) + 1;
5561
sp &= ~3;
5562
if(copyout(pgdir, sp, argv[argc], strlen(argv[argc]) + 1) < 0)
5563
goto bad;
5564
ustack[3+argc] = sp;
5565 }
5566 ustack[3+argc] = 0;
5567
5568 ustack[0] = 0xffffffff; // fake return PC
5569 ustack[1] = argc;
5570 ustack[2] = sp - (argc+1)*4; // argv pointer
5571
5572 sp -= (3+argc+1) * 4;
5573 if(copyout(pgdir, sp, ustack, (3+argc+1)*4) < 0)
5574
goto bad;
5575
5576 // Save program name for debugging.
5577 for(last=s=path; *s; s++)
5578
if(*s == /)
5579
last = s+1;
5580 safestrcpy(proc->name, last, sizeof(proc->name));
5581
5582 // Commit to the user image.
5583 oldpgdir = proc->pgdir;
5584 proc->pgdir = pgdir;
5585 proc->sz = sz;
5586 proc->tf->eip = elf.entry; // main
5587 proc->tf->esp = sp;
5588 switchuvm(proc);
5589 freevm(oldpgdir);
5590
5591 return 0;
5592
5593 bad:
5594 if(pgdir)
5595
freevm(pgdir);
5596 if(ip)
5597
iunlockput(ip);
5598 return -1;
5599 }
#include
#include
#include
#include
#include
#include
#include
"types.h"
"param.h"
"mmu.h"
"proc.h"
"defs.h"
"x86.h"
"elf.h"
int
exec(char *path, char **argv)
{
char *s, *last;
int i, off;
uint argc, sz, sp, ustack[3+MAXARG+1];
struct elfhdr elf;
struct inode *ip;
struct proghdr ph;
pde_t *pgdir, *oldpgdir;
if((ip = namei(path)) == 0)
return -1;
ilock(ip);
pgdir = 0;
// Check ELF header
if(readi(ip, (char*)&elf, 0, sizeof(elf)) < sizeof(elf))
goto bad;
if(elf.magic != ELF_MAGIC)
goto bad;
if((pgdir = setupkvm()) == 0)
goto bad;
// Load program into memory.
sz = 0;
for(i=0, off=elf.phoff; i<elf.phnum; i++, off+=sizeof(ph)){
if(readi(ip, (char*)&ph, off, sizeof(ph)) != sizeof(ph))
goto bad;
if(ph.type != ELF_PROG_LOAD)
continue;
if(ph.memsz < ph.filesz)
goto bad;
if((sz = allocuvm(pgdir, sz, ph.va + ph.memsz)) == 0)
goto bad;
if(loaduvm(pgdir, (char*)ph.va, ip, ph.offset, ph.filesz) < 0)
goto bad;
}
iunlockput(ip);
ip = 0;
Sheet 55
Sheet 55
Feb 19 20:50 2011 xv6/pipe.c Page 1
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
#include
#include
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"mmu.h"
"proc.h"
"fs.h"
"file.h"
"spinlock.h"
#define PIPESIZE 512

struct pipe {
char data[PIPESIZE];
uint nread;
// number of bytes read
uint nwrite;
// number of bytes written
int readopen; // read fd is still open
int writeopen; // write fd is still open
};
int
pipealloc(struct file **f0, struct file **f1)
{
struct pipe *p;
p = 0;
*f0 = *f1 = 0;
if((*f0 = filealloc()) == 0 || (*f1 = filealloc()) == 0)
goto bad;
if((p = (struct pipe*)kalloc()) == 0)
goto bad;
p->readopen = 1;
p->writeopen = 1;
p->nwrite = 0;
p->nread = 0;
initlock(&p->lock, "pipe");
(*f0)->type = FD_PIPE;
(*f0)->readable = 1;
(*f0)->writable = 0;
(*f0)->pipe = p;
(*f1)->type = FD_PIPE;
(*f1)->readable = 0;
(*f1)->writable = 1;
(*f1)->pipe = p;
return 0;
Sheet 56
bad:
if(p)
kfree((char*)p);
if(*f0)
fileclose(*f0);
if(*f1)
fileclose(*f1);
return -1;
}
void
pipeclose(struct pipe *p, int writable)
{
acquire(&p->lock);
if(writable){
p->writeopen = 0;
wakeup(&p->nread);
} else {
p->readopen = 0;
wakeup(&p->nwrite);
}
if(p->readopen == 0 && p->writeopen == 0){
release(&p->lock);
kfree((char*)p);
} else
release(&p->lock);
}
int
pipewrite(struct pipe *p, char *addr, int n)
{
int i;
acquire(&p->lock);
for(i = 0; i < n; i++){
while(p->nwrite == p->nread + PIPESIZE){
if(p->readopen == 0 || proc->killed){
release(&p->lock);
return -1;
}
wakeup(&p->nread);
sleep(&p->nwrite, &p->lock);
}
p->data[p->nwrite++ % PIPESIZE] = addr[i];
}
wakeup(&p->nread);
release(&p->lock);
return n;
}
Sheet 56
Feb 19 20:50 2011 xv6/string.c Page 1
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
int
piperead(struct pipe *p, char *addr, int n)
{
int i;
acquire(&p->lock);
while(p->nread == p->nwrite && p->writeopen){
if(proc->killed){
release(&p->lock);
return -1;
}
sleep(&p->nread, &p->lock);
}
for(i = 0; i < n; i++){
if(p->nread == p->nwrite)
break;
addr[i] = p->data[p->nread++ % PIPESIZE];
}
wakeup(&p->nwrite);
release(&p->lock);
return i;
}
Sheet 57
#include "types.h"
#include "x86.h"
void*
memset(void *dst, int c, uint n)
{
stosb(dst, c, n);
return dst;
}
int
memcmp(const void *v1, const void *v2, uint n)
{
const uchar *s1, *s2;
s1 = v1;
s2 = v2;
while(n-- > 0){
if(*s1 != *s2)
return *s1 - *s2;
s1++, s2++;
}
return 0;
}
void*
memmove(void *dst, const void *src, uint n)
{
const char *s;
char *d;
s = src;
d = dst;
if(s < d && s + n > d){
s += n;
d += n;
while(n-- > 0)
*--d = *--s;
} else
while(n-- > 0)
*d++ = *s++;
return dst;
}
Sheet 57
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
// memcpy exists to placate GCC. Use memmove.

void*
memcpy(void *dst, const void *src, uint n)
{
return memmove(dst, src, n);
}
int
strncmp(const char *p, const char *q, uint n)
{
while(n > 0 && *p && *p == *q)
n--, p++, q++;
if(n == 0)
return 0;
return (uchar)*p - (uchar)*q;
}
char*
strncpy(char *s, const char *t, int n)
{
char *os;
os = s;
while(n-- > 0 && (*s++ = *t++) != 0)
;
while(n-- > 0)
*s++ = 0;
return os;
}
// Like strncpy but guaranteed to NUL-terminate.
char*
safestrcpy(char *s, const char *t, int n)
{
char *os;
os = s;
if(n <= 0)
return os;
while(--n > 0 && (*s++ = *t++) != 0)
;
*s = 0;
return os;
}
Sheet 58
int
strlen(const char *s)
{
int n;
for(n = 0; s[n]; n++)
;
return n;
}
Sheet 58
Feb 19 20:50 2011 xv6/mp.h Page 1
Feb 19 20:50 2011 xv6/mp.h Page 2
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
// See MultiProcessor Specification Version 1.[14]

struct mp {
uchar signature[4];
void *physaddr;
uchar length;
uchar specrev;
uchar checksum;
uchar type;
uchar imcrp;
uchar reserved[3];
};
// floating pointer
// "_MP_"
// phys addr of MP config table
// 1
// [14]
// all bytes must add up to 0
// MP system config type
struct mpconf {
uchar signature[4];
ushort length;
uchar version;
uchar checksum;
uchar product[20];
uint *oemtable;
ushort oemlength;
ushort entry;
uint *lapicaddr;
ushort xlength;
uchar xchecksum;
uchar reserved;
};
// configuration table header

// "PCMP"
// total table length
// [14]
// all bytes must add up to 0
// product id
// OEM table pointer
// OEM table length
// entry count
// address of local APIC
// extended table length
// extended table checksum
struct mpproc {
// processor table entry
uchar type;
// entry type (0)
uchar apicid;
// local APIC id
uchar version;
// local APIC verison
uchar flags;
// CPU flags
#define MPBOOT 0x02
// This proc is the bootstrap processor.
uchar signature[4];
// CPU signature
uint feature;
// feature flags from CPUID instruction
uchar reserved[8];
};
struct mpioapic {
uchar type;
uchar apicno;
uchar version;
uchar flags;
uint *addr;
};
Sheet 59
// I/O APIC table entry

// entry type (2)
// I/O APIC id
// I/O APIC version
// I/O APIC flags
// I/O APIC address
// Table entry types

#define MPPROC
0x00
#define MPBUS
0x01
#define MPIOAPIC 0x02
#define MPIOINTR 0x03
#define MPLINTR 0x04
Sheet 59
//
//
//
//
//
One
One
One
One
One
per
per
per
per
per
processor
bus
I/O APIC
bus interrupt source
system interrupt source
Feb 19 20:50 2011 xv6/mp.c Page 1
Feb 19 20:50 2011 xv6/mp.c Page 2
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
// Multiprocessor bootstrap.
// Search memory for MP description structures.
// http://developer.intel.com/design/pentium/datashts/24201606.pdf
#include
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"mp.h"
"x86.h"
"mmu.h"
"proc.h"
struct cpu cpus[NCPU];

static struct cpu *bcpu;
int ismp;
int ncpu;
uchar ioapicid;
int
mpbcpu(void)
{
return bcpu-cpus;
}
static uchar
sum(uchar *addr, int len)
{
int i, sum;
sum = 0;
for(i=0; i<len; i++)
sum += addr[i];
return sum;
}
// Look for an MP structure in the len bytes at addr.
static struct mp*
mpsearch1(uchar *addr, int len)
{
uchar *e, *p;
e = addr+len;
for(p = addr; p < e; p += sizeof(struct mp))
if(memcmp(p, "_MP_", 4) == 0 && sum(p, sizeof(struct mp)) == 0)
return (struct mp*)p;
return 0;
}
Sheet 60
// Search for the MP Floating Pointer Structure, which according to the

// spec is in one of the following three locations:
// 1) in the first KB of the EBDA;
// 2) in the last KB of system base memory;
// 3) in the BIOS ROM between 0xE0000 and 0xFFFFF.
static struct mp*
mpsearch(void)
{
uchar *bda;
uint p;
struct mp *mp;
bda = (uchar*)0x400;
if((p = ((bda[0x0F]<<8)|bda[0x0E]) << 4)){
if((mp = mpsearch1((uchar*)p, 1024)))
return mp;
} else {
p = ((bda[0x14]<<8)|bda[0x13])*1024;
if((mp = mpsearch1((uchar*)p-1024, 1024)))
return mp;
}
return mpsearch1((uchar*)0xF0000, 0x10000);
}
// Search for an MP configuration table. For now,
// dont accept the default configurations (physaddr == 0).
// Check for correct signature, calculate the checksum and,
// if correct, check the version.
// To do: check extended table checksum.
static struct mpconf*
mpconfig(struct mp **pmp)
{
struct mpconf *conf;
struct mp *mp;
if((mp = mpsearch()) == 0 || mp->physaddr == 0)
return 0;
conf = (struct mpconf*)mp->physaddr;
if(memcmp(conf, "PCMP", 4) != 0)
return 0;
if(conf->version != 1 && conf->version != 4)
return 0;
if(sum((uchar*)conf, conf->length) != 0)
return 0;
*pmp = mp;
return conf;
}
Sheet 60
Feb 19 20:50 2011 xv6/mp.c Page 3
Feb 19 20:50 2011 xv6/mp.c Page 4
6100 void
6101 mpinit(void)
6102 {
6103 uchar *p, *e;
6104 struct mp *mp;
6105 struct mpconf *conf;
6106 struct mpproc *proc;
6107 struct mpioapic *ioapic;
6108
6109 bcpu = &cpus[0];
6110 if((conf = mpconfig(&mp)) == 0)
6111
return;
6112 ismp = 1;
6113 lapic = (uint*)conf->lapicaddr;
6114 for(p=(uchar*)(conf+1), e=(uchar*)conf+conf->length; p<e; ){
6115
switch(*p){
6116
case MPPROC:
6117
proc = (struct mpproc*)p;
6118
if(ncpu != proc->apicid){
6119
cprintf("mpinit: ncpu=%d apicid=%d\n", ncpu, proc->apicid);
6120
ismp = 0;
6121
}
6122
if(proc->flags & MPBOOT)
6123
bcpu = &cpus[ncpu];
6124
cpus[ncpu].id = ncpu;
6125
ncpu++;
6126
p += sizeof(struct mpproc);
6127
continue;
6128
case MPIOAPIC:
6129
ioapic = (struct mpioapic*)p;
6130
ioapicid = ioapic->apicno;
6131
p += sizeof(struct mpioapic);
6132
continue;
6133
case MPBUS:
6134
case MPIOINTR:
6135
case MPLINTR:
6136
p += 8;
6137
continue;
6138
default:
6139
cprintf("mpinit: unknown config type %x\n", *p);
6140
ismp = 0;
6141
}
6142 }
6143 if(!ismp){
6144
// Didnt like what we found; fall back to no MP.
6145
ncpu = 1;
6146
lapic = 0;
6147
ioapicid = 0;
6148
return;
6149 }
6150 if(mp->imcrp){
6151
// Bochs doesnt support IMCR, so this doesnt run on Bochs.
6152
// But it would on real hardware.
6153
outb(0x22, 0x70); // Select IMCR
6154
outb(0x23, inb(0x23) | 1); // Mask external interrupts.
6155 }
6156 }
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
Sheet 61
Sheet 61
Feb 19 20:50 2011 xv6/lapic.c Page 1
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
// The local APIC manages internal (non-I/O) interrupts.

// See Chapter 8 & Appendix C of Intel processor manual volume 3.
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"traps.h"
"mmu.h"
"x86.h"
// Local APIC registers, divided by 4 for use as uint[] indices.

#define ID
(0x0020/4) // ID
#define VER
(0x0030/4) // Version
#define TPR
(0x0080/4) // Task Priority
#define EOI
(0x00B0/4) // EOI
#define SVR
(0x00F0/4) // Spurious Interrupt Vector
#define ENABLE
0x00000100 // Unit Enable
#define ESR
(0x0280/4) // Error Status
#define ICRLO (0x0300/4) // Interrupt Command
#define INIT
0x00000500 // INIT/RESET
#define STARTUP
0x00000600 // Startup IPI
#define DELIVS
0x00001000 // Delivery status
#define ASSERT
0x00004000 // Assert interrupt (vs deassert)
#define DEASSERT 0x00000000
#define LEVEL
0x00008000 // Level triggered
#define BCAST
0x00080000 // Send to all APICs, including self.
#define BUSY
0x00001000
#define FIXED
0x00000000
#define ICRHI (0x0310/4) // Interrupt Command [63:32]
#define TIMER (0x0320/4) // Local Vector Table 0 (TIMER)
#define X1
0x0000000B // divide counts by 1
#define PERIODIC 0x00020000 // Periodic
#define PCINT (0x0340/4) // Performance Counter LVT
#define LINT0 (0x0350/4) // Local Vector Table 1 (LINT0)
#define LINT1 (0x0360/4) // Local Vector Table 2 (LINT1)
#define ERROR (0x0370/4) // Local Vector Table 3 (ERROR)
#define MASKED
0x00010000 // Interrupt masked
#define TICR
(0x0380/4) // Timer Initial Count
#define TCCR
(0x0390/4) // Timer Current Count
#define TDCR
(0x03E0/4) // Timer Divide Configuration
volatile uint *lapic; // Initialized in mp.c
static void
lapicw(int index, int value)
{
lapic[index] = value;
lapic[ID]; // wait for write to finish, by reading
}
Sheet 62
void
lapicinit(int c)
{
cprintf("lapicinit: %d 0x%x\n", c, lapic);
if(!lapic)
return;
// Enable local APIC; set spurious interrupt vector.
lapicw(SVR, ENABLE | (T_IRQ0 + IRQ_SPURIOUS));
// The timer repeatedly counts down at bus frequency
// from lapic[TICR] and then issues an interrupt.
// If xv6 cared more about precise timekeeping,
// TICR would be calibrated using an external time source.
lapicw(TDCR, X1);
lapicw(TIMER, PERIODIC | (T_IRQ0 + IRQ_TIMER));
lapicw(TICR, 10000000);
// Disable logical interrupt lines.
lapicw(LINT0, MASKED);
lapicw(LINT1, MASKED);
// Disable performance counter overflow interrupts
// on machines that provide that interrupt entry.
if(((lapic[VER]>>16) & 0xFF) >= 4)
lapicw(PCINT, MASKED);
// Map error interrupt to IRQ_ERROR.
lapicw(ERROR, T_IRQ0 + IRQ_ERROR);
// Clear error status register (requires back-to-back writes).
lapicw(ESR, 0);
lapicw(ESR, 0);
// Ack any outstanding interrupts.
lapicw(EOI, 0);
// Send an Init Level De-Assert to synchronise arbitration IDs.
lapicw(ICRHI, 0);
lapicw(ICRLO, BCAST | INIT | LEVEL);
while(lapic[ICRLO] & DELIVS)
;
// Enable interrupts on the APIC (but not on the processor).
lapicw(TPR, 0);
}
Sheet 62
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372 }
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
int
cpunum(void)
{
// Cannot call cpu when interrupts are enabled:
// result not guaranteed to last long enough to be used!
// Would prefer to panic but even printing is chancy here:
// almost everything, including cprintf and panic, calls cpu,
// often indirectly through acquire and release.
if(readeflags()&FL_IF){
static int n;
if(n++ == 0)
cprintf("cpu called from %x with interrupts enabled\n",
__builtin_return_address(0));
}
if(lapic)
return lapic[ID]>>24;
return 0;
}
// Acknowledge interrupt.
void
lapiceoi(void)
{
if(lapic)
lapicw(EOI, 0);
}
// Spin for a given number of microseconds.
// On real hardware would want to tune this dynamically.
void
microdelay(int us)
{
}
#define IO_RTC 0x70
// Start additional processor running bootstrap code at addr.
// See Appendix B of MultiProcessor Specification.
void
lapicstartap(uchar apicid, uint addr)
{
int i;
ushort *wrv;
// "The BSP must initialize CMOS shutdown code to 0AH
// and the warm reset vector (DWORD based at 40:67) to point at
// the AP startup code prior to the [universal startup algorithm]."
outb(IO_RTC, 0xF); // offset 0xF is shutdown code
outb(IO_RTC+1, 0x0A);
Sheet 63
wrv = (ushort*)(0x40<<4 | 0x67); // Warm reset vector

wrv[0] = 0;
wrv[1] = addr >> 4;
// "Universal startup algorithm."
// Send INIT (level-triggered) interrupt to reset other CPU.
lapicw(ICRHI, apicid<<24);
lapicw(ICRLO, INIT | LEVEL | ASSERT);
microdelay(200);
lapicw(ICRLO, INIT | LEVEL);
microdelay(100);
// should be 10ms, but too slow in Bochs!
// Send startup IPI (twice!) to enter bootstrap code.
// Regular hardware is supposed to only accept a STARTUP
// when it is in the halted state due to an INIT. So the second
// should be ignored, but it is part of the official Intel algorithm.
// Bochs complains about the second one. Too bad for Bochs.
for(i = 0; i < 2; i++){
lapicw(ICRHI, apicid<<24);
lapicw(ICRLO, STARTUP | (addr>>12));
microdelay(200);
}
Sheet 63
Feb 19 20:50 2011 xv6/ioapic.c Page 1
Feb 19 20:50 2011 xv6/ioapic.c Page 2
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
// The I/O APIC manages hardware interrupts for an SMP system.

// http://www.intel.com/design/chipsets/datashts/29056601.pdf
// See also picirq.c.
#include "types.h"
#include "defs.h"
#include "traps.h"
#define IOAPIC 0xFEC00000
// Default physical address of IO APIC
#define REG_ID
0x00 // Register index: ID
#define REG_VER
0x01 // Register index: version
#define REG_TABLE 0x10 // Redirection table base
// The redirection table starts at REG_TABLE and uses
// two registers to configure each interrupt.
// The first (low) register in a pair contains configuration bits.
// The second (high) register contains a bitmask telling which
// CPUs can serve that interrupt.
#define INT_DISABLED 0x00010000 // Interrupt disabled
#define INT_LEVEL
0x00008000 // Level-triggered (vs edge-)
#define INT_ACTIVELOW 0x00002000 // Active low (vs high)
#define INT_LOGICAL
0x00000800 // Destination is CPU id (vs APIC ID)
volatile struct ioapic *ioapic;
// IO APIC MMIO structure: write reg, then read or write data.
struct ioapic {
uint reg;
uint pad[3];
uint data;
};
static uint
ioapicread(int reg)
{
ioapic->reg = reg;
return ioapic->data;
}
static void
ioapicwrite(int reg, uint data)
{
ioapic->reg = reg;
ioapic->data = data;
}
Sheet 64
void
ioapicinit(void)
{
int i, id, maxintr;
if(!ismp)
return;
ioapic = (volatile struct ioapic*)IOAPIC;
maxintr = (ioapicread(REG_VER) >> 16) & 0xFF;
id = ioapicread(REG_ID) >> 24;
if(id != ioapicid)
cprintf("ioapicinit: id isnt equal to ioapicid; not a MP\n");
// Mark all interrupts edge-triggered, active high, disabled,
// and not routed to any CPUs.
for(i = 0; i <= maxintr; i++){
ioapicwrite(REG_TABLE+2*i, INT_DISABLED | (T_IRQ0 + i));
ioapicwrite(REG_TABLE+2*i+1, 0);
}
}
void
ioapicenable(int irq, int cpunum)
{
if(!ismp)
return;
// Mark interrupt edge-triggered, active high,
// enabled, and routed to the given cpunum,
// which happens to be that cpus APIC ID.
ioapicwrite(REG_TABLE+2*irq, T_IRQ0 + irq);
ioapicwrite(REG_TABLE+2*irq+1, cpunum << 24);
}
Sheet 64
Feb 19 20:50 2011 xv6/picirq.c Page 1
Feb 19 20:50 2011 xv6/picirq.c Page 2
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
6578
6579
6580
6581
6582
6583
6584 }
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
// Intel 8259A programmable interrupt controllers.

#include "types.h"
#include "x86.h"
#include "traps.h"
// I/O Addresses of the two programmable interrupt controllers
#define IO_PIC1
0x20
// Master (IRQs 0-7)
#define IO_PIC2
0xA0
// Slave (IRQs 8-15)
#define IRQ_SLAVE
// IRQ at which slave connects to master
// Current IRQ mask.

// Initial IRQ mask has interrupt 2 enabled (for slave 8259A).
static ushort irqmask = 0xFFFF & ~(1<<IRQ_SLAVE);
static void
picsetmask(ushort mask)
{
irqmask = mask;
outb(IO_PIC1+1, mask);
outb(IO_PIC2+1, mask >> 8);
}
void
picenable(int irq)
{
picsetmask(irqmask & ~(1<<irq));
}
// Initialize the 8259A interrupt controllers.
void
picinit(void)
{
// mask all interrupts
outb(IO_PIC1+1, 0xFF);
outb(IO_PIC2+1, 0xFF);
// Set up master (8259A-1)
// ICW1: 0001g0hi
//
g: 0 = edge triggering, 1 = level triggering
//
h: 0 = cascaded PICs, 1 = master only
//
i: 0 = no ICW4, 1 = ICW4 required
outb(IO_PIC1, 0x11);
// ICW2: Vector offset
outb(IO_PIC1+1, T_IRQ0);
Sheet 65
// ICW3: (master PIC) bit mask of IR lines connected to slaves

//
(slave PIC) 3-bit # of slaves connection to master
outb(IO_PIC1+1, 1<<IRQ_SLAVE);
// ICW4: 000nbmap
//
n: 1 = special fully nested mode
//
b: 1 = buffered mode
//
m: 0 = slave PIC, 1 = master PIC
//
(ignored when b is 0, as the master/slave role
//
can be hardwired).
//
a: 1 = Automatic EOI mode
//
p: 0 = MCS-80/85 mode, 1 = intel x86 mode
outb(IO_PIC1+1, 0x3);
// Set up slave (8259A-2)
// ICW1
outb(IO_PIC2+1, T_IRQ0 + 8);
// ICW2
outb(IO_PIC2+1, IRQ_SLAVE);
// ICW3
// NB Automatic EOI mode doesnt tend to work on the slave.
// Linux source code says its "to be investigated".
outb(IO_PIC2+1, 0x3);
// ICW4
// OCW3: 0ef01prs
// ef: 0x = NOP, 10 = clear specific mask, 11 = set specific mask
//
p: 0 = no polling, 1 = polling mode
// rs: 0x = NOP, 10 = read IRR, 11 = read ISR
// clear specific mask
outb(IO_PIC1, 0x0a);
// read IRR by default
outb(IO_PIC2, 0x0a);
if(irqmask != 0xFFFF)
picsetmask(irqmask);
Sheet 65
// OCW3
// OCW3
Feb 19 20:50 2011 xv6/kbd.h Page 1
Feb 19 20:50 2011 xv6/kbd.h Page 2
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
// PC keyboard interface constants

#define KBSTATP
#define KBS_DIB
#define KBDATAP
0x64
0x01
0x60
#define NO
#define SHIFT
#define CTL
#define ALT
(1<<0)
(1<<1)
(1<<2)
#define CAPSLOCK
#define NUMLOCK
#define SCROLLLOCK
(1<<3)
(1<<4)
(1<<5)
#define E0ESC
(1<<6)
// Special keycodes
#define KEY_HOME
#define KEY_END
#define KEY_UP
#define KEY_DN
#define KEY_LF
#define KEY_RT
#define KEY_PGUP
#define KEY_PGDN
#define KEY_INS
#define KEY_DEL
0xE0
0xE1
0xE2
0xE3
0xE4
0xE5
0xE6
0xE7
0xE8
0xE9
// C(A) == Control-A
#define C(x) (x - @)
static uchar shiftcode[256] =
{
[0x1D] CTL,
[0x2A] SHIFT,
[0x36] SHIFT,
[0x38] ALT,
[0x9D] CTL,
[0xB8] ALT
};
static uchar togglecode[256] =
{
[0x3A] CAPSLOCK,
[0x45] NUMLOCK,
[0x46] SCROLLLOCK
};
Sheet 66
// kbd controller status port(I)

// kbd data in buffer
// kbd data port(I)
static uchar normalmap[256] =

{
NO, 0x1B, 1, 2, 3, 4,
7, 8, 9, 0, -, =,
q, w, e, r, t, y,
o, p, [, ], \n, NO,
d, f, g, h, j, k,
\, , NO, \\, z, x,
b, n, m, ,, ., /,
NO, , NO, NO, NO, NO,
NO, NO, NO, NO, NO, NO,
8, 9, -, 4, 5, 6,
2, 3, 0, ., NO, NO,
[0x9C] \n,
// KP_Enter
[0xB5] /,
// KP_Div
[0xC8] KEY_UP,
[0xD0] KEY_DN,
[0xC9] KEY_PGUP, [0xD1] KEY_PGDN,
[0xCB] KEY_LF,
[0xCD] KEY_RT,
[0x97] KEY_HOME, [0xCF] KEY_END,
[0xD2] KEY_INS, [0xD3] KEY_DEL
};
static uchar shiftmap[256] =
{
NO, 033, !, @, #, $,
&, *, (, ), _, +,
Q, W, E, R, T, Y,
O, P, {, }, \n, NO,
D, F, G, H, J, K,
", ~, NO, |, Z, X,
B, N, M, <, >, ?,
NO, , NO, NO, NO, NO,
NO, NO, NO, NO, NO, NO,
8, 9, -, 4, 5, 6,
2, 3, 0, ., NO, NO,
[0x9C] \n,
// KP_Enter
[0xB5] /,
// KP_Div
[0xC8] KEY_UP,
[0xD0] KEY_DN,
[0xC9] KEY_PGUP, [0xD1] KEY_PGDN,
[0xCB] KEY_LF,
[0xCD] KEY_RT,
[0x97] KEY_HOME, [0xCF] KEY_END,
[0xD2] KEY_INS, [0xD3] KEY_DEL
};
Sheet 66
5,
\b,
u,
a,
l,
c,
NO,
NO,
NO,
+,
NO,
6,
\t,
i,
s,
;,
v,
*,
NO,
7,
1,
NO,
// 0x00
%,
\b,
U,
A,
L,
C,
NO,
NO,
NO,
+,
NO,
^,
\t,
I,
S,
:,
V,
*,
NO,
7,
1,
NO,
// 0x00
// 0x10
// 0x20
// 0x30
// 0x40
// 0x50
// 0x10
// 0x20
// 0x30
// 0x40
// 0x50
Feb 19 20:50 2011 xv6/kbd.h Page 3
Feb 19 20:50 2011 xv6/kbd.c Page 1
6700 static uchar ctlmap[256] =

6701 {
6702 NO,
NO,
NO,
NO,
6703 NO,
NO,
NO,
NO,
6704 C(Q), C(W), C(E), C(R),
6705 C(O), C(P), NO,
NO,
6706 C(D), C(F), C(G), C(H),
6707 NO,
NO,
NO,
C(\\),
6708 C(B), C(N), C(M), NO,
6709 [0x9C] \r,
// KP_Enter
6710 [0xB5] C(/),
// KP_Div
6711 [0xC8] KEY_UP,
[0xD0] KEY_DN,
6712 [0xC9] KEY_PGUP, [0xD1] KEY_PGDN,
6713 [0xCB] KEY_LF,
[0xCD] KEY_RT,
6714 [0x97] KEY_HOME, [0xCF] KEY_END,
6715 [0xD2] KEY_INS, [0xD3] KEY_DEL
6716 };
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
Sheet 67
NO,
NO,
C(T),
\r,
C(J),
C(Z),
NO,
NO,
NO,
C(Y),
NO,
C(K),
C(X),
C(/),
NO,
NO,
C(U),
C(A),
C(L),
C(C),
NO,
NO,
NO,
C(I),
C(S),
NO,
C(V),
NO,
#include
#include
#include
#include
"types.h"
"x86.h"
"defs.h"
"kbd.h"
int
kbdgetc(void)
{
static uint shift;
static uchar *charcode[4] = {
normalmap, shiftmap, ctlmap, ctlmap
};
uint st, data, c;
st = inb(KBSTATP);
if((st & KBS_DIB) == 0)
return -1;
data = inb(KBDATAP);
if(data == 0xE0){
shift |= E0ESC;
return 0;
} else if(data & 0x80){
// Key released
data = (shift & E0ESC ? data : data & 0x7F);
shift &= ~(shiftcode[data] | E0ESC);
return 0;
} else if(shift & E0ESC){
// Last character was an E0 escape; or with 0x80
data |= 0x80;
shift &= ~E0ESC;
}
shift |= shiftcode[data];
shift ^= togglecode[data];
c = charcode[shift & (CTL | SHIFT)][data];
if(shift & CAPSLOCK){
if(a <= c && c <= z)
c += A - a;
else if(A <= c && c <= Z)
c += a - A;
}
return c;
}
void
kbdintr(void)
{
consoleintr(kbdgetc);
}
Sheet 67
Feb 19 20:50 2011 xv6/console.c Page 1
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
6816
6817
6818
6819
6820
6821
6822
6823
6824
6825
6826
6827
6828
6829
6830
6831
6832
6833
6834
6835
6836
6837
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848
6849
6850
6851
6852
6853
6854
6855
6856
6857
6858
6859
6860
6861
6862
6863
6864
6865
6866
6867
6868
6869
6870
6871
6872
6873
6874
6875
6876
6877
6878
6879
6880
6881
6882
6883
6884
6885
6886
6887
6888
6889
6890
6891
6892
6893
6894
6895
6896
6897
6898
6899
// Console input and output.

// Input is from the keyboard or serial port.
// Output is written to the screen and serial port.
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"traps.h"
"spinlock.h"
"fs.h"
"file.h"
"mmu.h"
"proc.h"
"x86.h"
static void consputc(int);

static int panicked = 0;
static struct {
int locking;
} cons;
static void
printint(int xx, int base, int sgn)
{
static char digits[] = "0123456789abcdef";
char buf[16];
int i, neg;
uint x;
if(sgn && (neg = xx < 0)){
neg = 1;
x = -xx;
} else
x = xx;
i = 0;
do{
buf[i++] = digits[x % base];
}while((x /= base) != 0);
if(neg)
buf[i++] = -;
while(--i >= 0)
consputc(buf[i]);
}
Sheet 68
// Print to the console. only understands %d, %x, %p, %s.

void
cprintf(char *fmt, ...)
{
int i, c, state, locking;
uint *argp;
char *s;
locking = cons.locking;
if(locking)
acquire(&cons.lock);
argp = (uint*)(void*)(&fmt + 1);
state = 0;
for(i = 0; (c = fmt[i] & 0xff) != 0; i++){
if(c != %){
consputc(c);
continue;
}
c = fmt[++i] & 0xff;
if(c == 0)
break;
switch(c){
case d:
printint(*argp++, 10, 1);
break;
case x:
case p:
printint(*argp++, 16, 0);
break;
case s:
if((s = (char*)*argp++) == 0)
s = "(null)";
for(; *s; s++)
consputc(*s);
break;
case %:
consputc(%);
break;
default:
// Print unknown % sequence to draw attention.
consputc(%);
consputc(c);
break;
}
}
if(locking)
release(&cons.lock);
}
Sheet 68
6900
6901
6902
6903
6904
6905
6906
6907
6908
6909
6910
6911
6912
6913
6914
6915
6916
6917
6918
6919
6920
6921
6922
6923
6924
6925
6926
6927
6928
6929
6930
6931
6932
6933
6934
6935
6936
6937
6938
6939
6940
6941
6942
6943
6944
6945
6946
6947
6948
6949
6950
6951
6952
6953
6954
6955
6956
6957
6958
6959
6960
6961
6962
6963
6964
6965
6966
6967
6968
6969
6970
6971
6972
6973
6974
6975
6976
6977
6978
6979
6980
6981
6982
6983
6984
6985
6986
6987
6988
6989
6990
6991
6992
6993
6994
6995
6996
6997
6998
6999
void
panic(char *s)
{
int i;
uint pcs[10];
cli();
cons.locking = 0;
cprintf("cpu%d: panic: ", cpu->id);
cprintf(s);
cprintf("\n");
getcallerpcs(&s, pcs);
for(i=0; i<10; i++)
cprintf(" %p", pcs[i]);
panicked = 1; // freeze other CPU
for(;;)
;
}
Sheet 69
#define BACKSPACE 0x100

#define CRTPORT 0x3d4
static ushort *crt = (ushort*)0xb8000; // CGA memory
static void
cgaputc(int c)
{
int pos;
// Cursor position: col + 80*row.
outb(CRTPORT, 14);
pos = inb(CRTPORT+1) << 8;
outb(CRTPORT, 15);
pos |= inb(CRTPORT+1);
if(c == \n)
pos += 80 - pos%80;
else if(c == BACKSPACE){
if(pos > 0) --pos;
} else
crt[pos++] = (c&0xff) | 0x0700; // black on white
if((pos/80) >= 24){ // Scroll up.
memmove(crt, crt+80, sizeof(crt[0])*23*80);
pos -= 80;
memset(crt+pos, 0, sizeof(crt[0])*(24*80 - pos));
}
outb(CRTPORT, 14);
outb(CRTPORT+1, pos>>8);
outb(CRTPORT, 15);
outb(CRTPORT+1, pos);
crt[pos] = | 0x0700;
}
void
consputc(int c)
{
if(panicked){
cli();
for(;;)
;
}
if(c == BACKSPACE){
uartputc(\b); uartputc( ); uartputc(\b);
} else
uartputc(c);
cgaputc(c);
}
Sheet 69
7000
7001
7002
7003
7004
7005
7006
7007
7008
7009
7010
7011
7012
7013
7014
7015
7016
7017
7018
7019
7020
7021
7022
7023
7024
7025
7026
7027
7028
7029
7030
7031
7032
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042
7043
7044
7045
7046
7047
7048
7049
7050
7051
7052
7053
7054
7055
7056
7057
7058
7059
7060
7061
7062
7063
7064
7065
7066
7067
7068
7069
7070
7071
7072
7073
7074
7075
7076
7077
7078
7079
7080
7081
7082
7083
7084
7085
7086
7087
7088
7089
7090
7091
7092
7093
7094
7095
7096
7097
7098
7099
#define INPUT_BUF 128

struct {
char buf[INPUT_BUF];
uint r; // Read index
uint w; // Write index
uint e; // Edit index
} input;
#define C(x) ((x)-@) // Control-x
void
consoleintr(int (*getc)(void))
{
int c;
acquire(&input.lock);
while((c = getc()) >= 0){
switch(c){
case C(P): // Process listing.
procdump();
break;
case C(U): // Kill line.
while(input.e != input.w &&
input.buf[(input.e-1) % INPUT_BUF] != \n){
input.e--;
consputc(BACKSPACE);
}
break;
case C(H): case \x7f: // Backspace
if(input.e != input.w){
input.e--;
consputc(BACKSPACE);
}
break;
default:
if(c != 0 && input.e-input.r < INPUT_BUF){
c = (c == \r) ? \n : c;
input.buf[input.e++ % INPUT_BUF] = c;
consputc(c);
if(c == \n || c == C(D) || input.e == input.r+INPUT_BUF){
input.w = input.e;
wakeup(&input.r);
}
}
break;
}
}
release(&input.lock);
}
Sheet 70
int
consoleread(struct inode *ip, char *dst, int n)
{
uint target;
int c;
iunlock(ip);
target = n;
acquire(&input.lock);
while(n > 0){
while(input.r == input.w){
if(proc->killed){
ilock(ip);
return -1;
}
sleep(&input.r, &input.lock);
}
c = input.buf[input.r++ % INPUT_BUF];
if(c == C(D)){ // EOF
if(n < target){
// Save ^D for next time, to make sure
// caller gets a 0-byte result.
input.r--;
}
break;
}
*dst++ = c;
--n;
if(c == \n)
break;
}
ilock(ip);
return target - n;
}
Sheet 70
Feb 19 20:50 2011 xv6/timer.c Page 1
7100
7101
7102
7103
7104
7105
7106
7107
7108
7109
7110
7111
7112
7113
7114
7115
7116
7117
7118
7119
7120
7121
7122
7123
7124
7125
7126
7127
7128
7129
7130
7131
7132
7133
7134
7135
7136
7137
7138
7139
7140
7141
7142
7143
7144
7145
7146
7147
7148
7149
7150
7151
7152
7153
7154
7155
7156
7157
7158
7159
7160
7161
7162
7163
7164
7165
7166
7167
7168
7169
7170
7171
7172
7173
7174
7175
7176
7177
7178
7179
7180
7181
7182
7183
7184
7185
7186
7187
7188
7189
7190
7191
7192
7193
7194
7195
7196
7197
7198
7199
int
consolewrite(struct inode *ip, char *buf, int n)
{
int i;
iunlock(ip);
acquire(&cons.lock);
for(i = 0; i < n; i++)
consputc(buf[i] & 0xff);
release(&cons.lock);
ilock(ip);
return n;
}
void
consoleinit(void)
{
initlock(&cons.lock, "console");
initlock(&input.lock, "input");
devsw[CONSOLE].write = consolewrite;
devsw[CONSOLE].read = consoleread;
cons.locking = 1;
picenable(IRQ_KBD);
ioapicenable(IRQ_KBD, 0);
}
Sheet 71
// Intel 8253/8254/82C54 Programmable Interval Timer (PIT).

// Only used on uniprocessors;
// SMP machines use the local APIC timer.
#include
#include
#include
#include
"types.h"
"defs.h"
"traps.h"
"x86.h"
#define IO_TIMER1
0x040
// 8253 Timer #1
// Frequency of all three count-down timers;

// (TIMER_FREQ/freq) is the appropriate count
// to generate a frequency of freq Hz.
#define TIMER_FREQ
#define TIMER_DIV(x)
1193182
((TIMER_FREQ+(x)/2)/(x))
#define
#define
#define
#define
(IO_TIMER1
0x00
//
0x04
//
0x30
//
TIMER_MODE
TIMER_SEL0
TIMER_RATEGEN
TIMER_16BIT
+ 3) // timer mode port

select counter 0
mode 2, rate generator
r/w counter 16 bits, LSB first
void
timerinit(void)
{
// Interrupt 100 times/sec.
outb(TIMER_MODE, TIMER_SEL0 | TIMER_RATEGEN | TIMER_16BIT);
outb(IO_TIMER1, TIMER_DIV(100) % 256);
outb(IO_TIMER1, TIMER_DIV(100) / 256);
picenable(IRQ_TIMER);
}
Sheet 71
Feb 19 20:50 2011 xv6/uart.c Page 1
Feb 19 20:50 2011 xv6/uart.c Page 2
7200
7201
7202
7203
7204
7205
7206
7207
7208
7209
7210
7211
7212
7213
7214
7215
7216
7217
7218
7219
7220
7221
7222
7223
7224
7225
7226
7227
7228
7229
7230
7231
7232
7233
7234
7235
7236
7237
7238
7239
7240
7241
7242
7243
7244
7245
7246
7247
7248
7249
7250
7251
7252
7253
7254
7255
7256
7257
7258
7259
7260
7261
7262
7263
7264
7265
7266
7267
7268
7269
7270
7271
7272
7273
7274
7275
7276
7277
7278
7279
7280
7281
7282
7283
7284
7285
7286
7287
7288
7289
7290
7291
7292
7293
7294
7295
7296
7297
7298
7299
// Intel 8250 serial port (UART).

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
"types.h"
"defs.h"
"param.h"
"traps.h"
"spinlock.h"
"fs.h"
"file.h"
"mmu.h"
"proc.h"
"x86.h"
#define COM1
static int uart;
0x3f8
// is there a uart?
void
uartinit(void)
{
char *p;
// Turn off the FIFO
outb(COM1+2, 0);
// 9600 baud, 8 data bits, 1 stop bit, parity off.
outb(COM1+3, 0x80);
// Unlock divisor
outb(COM1+0, 115200/9600);
outb(COM1+1, 0);
outb(COM1+3, 0x03);
// Lock divisor, 8 data bits.
outb(COM1+4, 0);
outb(COM1+1, 0x01);
// Enable receive interrupts.
// If status is 0xFF, no serial port.
if(inb(COM1+5) == 0xFF)
return;
uart = 1;
// Acknowledge pre-existing interrupt conditions;
// enable interrupts.
inb(COM1+2);
inb(COM1+0);
picenable(IRQ_COM1);
ioapicenable(IRQ_COM1, 0);
// Announce that were here.
for(p="xv6...\n"; *p; p++)
uartputc(*p);
}
Sheet 72
void
uartputc(int c)
{
int i;
if(!uart)
return;
for(i = 0; i < 128 && !(inb(COM1+5) & 0x20); i++)
microdelay(10);
outb(COM1+0, c);
}
static int
uartgetc(void)
{
if(!uart)
return -1;
if(!(inb(COM1+5) & 0x01))
return -1;
return inb(COM1+0);
}
void
uartintr(void)
{
consoleintr(uartgetc);
}
Sheet 72
Feb 19 20:50 2011 xv6/multiboot.S Page 1
Feb 19 20:50 2011 xv6/multiboot.S Page 2
7300
7301
7302
7303
7304
7305
7306
7307
7308
7309
7310
7311
7312
7313
7314
7315
7316
7317
7318
7319
7320
7321
7322
7323
7324
7325
7326
7327
7328
7329
7330
7331
7332
7333
7334
7335
7336
7337
7338
7339
7340
7341
7342
7343
7344
7345
7346
7347
7348
7349
7350
7351
7352
7353
7354
7355
7356
7357
7358
7359
7360
7361
7362
7363
7364
7365
7366
7367
7368
7369
7370
7371
7372
7373
7374
7375
7376
7377
7378
7379
7380
7381
7382
7383
7384
7385
7386
7387
7388
7389
7390
7391
7392
7393
7394
7395
7396
7397
7398
7399
#
#
#
#
#
#
#
#
#
#
#
#
#
#
#
Multiboot header, for multiboot boot loaders like GNU Grub.

http://www.gnu.org/software/grub/manual/multiboot/multiboot.html
Using GRUB 2, you can boot xv6 from a file stored in a
Linux file system by copying kernel or kernelmemfs to /boot
and then adding this menu entry:
menuentry "xv6" {
insmod ext2
set root=(hd0,msdos1)
set kernel=/boot/kernel
echo "Loading ${kernel}..."
multiboot ${kernel} ${kernel}
boot
}
#include "asm.h"
#define STACK 4096
# Multiboot header. Data to direct multiboot loader.
.p2align 2
.text
.globl multiboot_header
multiboot_header:
#define magic 0x1badb002
#define flags (1<<16 | 1<<0)
.long magic
.long flags
.long (-magic-flags)
.long multiboot_header # beginning of image
.long multiboot_header
.long edata
.long end
.long multiboot_entry
# Multiboot entry point. Machine is mostly set up.
# Configure the GDT to match the environment that our usual
# boot loader - bootasm.S - sets up.
.globl multiboot_entry
multiboot_entry:
lgdt gdtdesc
ljmp $(SEG_KCODE<<3), $mbstart32
Sheet 73
mbstart32:
# Set up the protected-mode data segment registers
movw
# Our data segment selector
movw
%ax, %ds
# -> DS: Data Segment
movw
%ax, %es
# -> ES: Extra Segment
movw
%ax, %ss
# -> SS: Stack Segment
movw
$0, %ax
# Zero segments not ready for use
movw
%ax, %fs
# -> FS
movw
%ax, %gs
# -> GS
# Set up the stack pointer and call into C.
movl $(stack + STACK), %esp
call main
spin:
jmp spin
# Bootstrap GDT
.p2align 2
gdt:
SEG_NULLASM
gdtdesc:
.long gdt
.comm stack, STACK
Sheet 73
# force 4 byte alignment

# null seg
# code seg
# data seg
# sizeof(gdt) - 1
# address gdt
Feb 19 20:50 2011 xv6/initcode.S Page 1
Feb 19 20:50 2011 xv6/usys.S Page 1
7400
7401
7402
7403
7404
7405
7406
7407
7408
7409
7410
7411
7412
7413
7414
7415
7416
7417
7418
7419
7420
7421
7422
7423
7424
7425
7426
7427
7428
7429
7430
7431
7432
7433
7434
7435
7436
7437
7438
7439
7440
7441
7442
7443
7444
7445
7446
7447
7448
7449
7450
7451
7452
7453
7454
7455
7456
7457
7458
7459
7460
7461
7462
7463
7464
7465
7466
7467
7468
7469
7470
7471
7472
7473
7474
7475
7476
7477
7478
7479
7480
7481
7482
7483
7484
7485
7486
7487
7488
7489
7490
7491
7492
7493
7494
7495
7496
7497
7498
7499
# Initial process execs /init.

#include "syscall.h"
#include "traps.h"
# exec(init, argv)
.globl start
start:
pushl $argv
pushl $init
pushl $0 // where caller pc would be
movl $SYS_exec, %eax
int $T_SYSCALL
# for(;;) exit();
exit:
movl $SYS_exit, %eax
int $T_SYSCALL
jmp exit
# char init[] = "/init\0";
init:
.string "/init\0"
# char *argv[] = { init, 0 };
.p2align 2
argv:
.long init
.long 0
Sheet 74
#include "syscall.h"
#include "traps.h"
#define SYSCALL(name) \
.globl name; \
name: \
movl $SYS_ ## name, %eax; \
int $T_SYSCALL; \
ret
SYSCALL(fork)
SYSCALL(exit)
SYSCALL(wait)
SYSCALL(pipe)
SYSCALL(read)
SYSCALL(write)
SYSCALL(close)
SYSCALL(kill)
SYSCALL(exec)
SYSCALL(open)
SYSCALL(mknod)
SYSCALL(unlink)
SYSCALL(fstat)
SYSCALL(link)
SYSCALL(mkdir)
SYSCALL(chdir)
SYSCALL(dup)
SYSCALL(getpid)
SYSCALL(sbrk)
SYSCALL(sleep)
SYSCALL(uptime)
Sheet 74
Feb 19 20:50 2011 xv6/init.c Page 1
Feb 19 20:50 2011 xv6/sh.c Page 1
7500
7501
7502
7503
7504
7505
7506
7507
7508
7509
7510
7511
7512
7513
7514
7515
7516
7517
7518
7519
7520
7521
7522
7523
7524
7525
7526
7527
7528
7529
7530
7531
7532
7533
7534
7535
7536
7537
7538
7539
7540
7541
7542
7543
7544
7545
7546
7547
7548
7549
7550
7551
7552
7553
7554
7555
7556
7557
7558
7559
7560
7561
7562
7563
7564
7565
7566
7567
7568
7569
7570
7571
7572
7573
7574
7575
7576
7577
7578
7579
7580
7581
7582
7583
7584
7585
7586
7587
7588
7589
7590
7591
7592
7593
7594
7595
7596
7597
7598
7599
// init: The initial user-level program

#include
#include
#include
#include
"types.h"
"stat.h"
"user.h"
"fcntl.h"
char *argv[] = { "sh", 0 };

int
main(void)
{
int pid, wpid;
if(open("console", O_RDWR) < 0){
mknod("console", 1, 1);
open("console", O_RDWR);
}
dup(0); // stdout
dup(0); // stderr
for(;;){
printf(1, "init: starting sh\n");
pid = fork();
if(pid < 0){
printf(1, "init: fork failed\n");
exit();
}
if(pid == 0){
exec("sh", argv);
printf(1, "init: exec sh failed\n");
exit();
}
while((wpid=wait()) >= 0 && wpid != pid)
printf(1, "zombie!\n");
}
}
Sheet 75
// Shell.
#include "types.h"
#include "user.h"
#include "fcntl.h"
// Parsed command representation
#define EXEC 1
#define REDIR 2
#define PIPE 3
#define LIST 4
#define BACK 5
#define MAXARGS 10
struct cmd {
int type;
};
struct execcmd {
int type;
char *argv[MAXARGS];
char *eargv[MAXARGS];
};
struct redircmd {
int type;
struct cmd *cmd;
char *file;
char *efile;
int mode;
int fd;
};
struct pipecmd {
int type;
struct cmd *left;
struct cmd *right;
};
struct listcmd {
int type;
struct cmd *left;
struct cmd *right;
};
struct backcmd {
int type;
struct cmd *cmd;
};
Sheet 75
Feb 19 20:50 2011 xv6/sh.c Page 2
Feb 19 20:50 2011 xv6/sh.c Page 3
7600
7601
7602
7603
7604
7605
7606
7607
7608
7609
7610
7611
7612
7613
7614
7615
7616
7617
7618
7619
7620
7621
7622
7623
7624
7625
7626
7627
7628
7629
7630
7631
7632
7633
7634
7635
7636
7637
7638
7639
7640
7641
7642
7643
7644
7645
7646
7647
7648
7649
7650
7651
7652
7653
7654
7655
7656
7657
7658
7659
7660
7661
7662
7663
7664
7665
7666
7667
7668
7669
7670
7671
7672
7673
7674
7675
7676
7677
7678
7679
7680
7681
7682
7683
7684
7685
7686
7687
7688
7689
7690
7691
7692
7693
7694
7695
7696
7697
7698
7699
int fork1(void); // Fork but panics on failure.

void panic(char*);
struct cmd *parsecmd(char*);
// Execute cmd. Never returns.
void
runcmd(struct cmd *cmd)
{
int p[2];
struct backcmd *bcmd;
struct execcmd *ecmd;
struct listcmd *lcmd;
struct pipecmd *pcmd;
struct redircmd *rcmd;
if(cmd == 0)
exit();
switch(cmd->type){
default:
panic("runcmd");
case EXEC:
ecmd = (struct execcmd*)cmd;
if(ecmd->argv[0] == 0)
exit();
exec(ecmd->argv[0], ecmd->argv);
printf(2, "exec %s failed\n", ecmd->argv[0]);
break;
case REDIR:
rcmd = (struct redircmd*)cmd;
close(rcmd->fd);
if(open(rcmd->file, rcmd->mode) < 0){
printf(2, "open %s failed\n", rcmd->file);
exit();
}
runcmd(rcmd->cmd);
break;
case LIST:
lcmd = (struct listcmd*)cmd;
if(fork1() == 0)
runcmd(lcmd->left);
wait();
runcmd(lcmd->right);
break;
Sheet 76
case PIPE:
pcmd = (struct pipecmd*)cmd;
if(pipe(p) < 0)
panic("pipe");
if(fork1() == 0){
close(1);
dup(p[1]);
close(p[0]);
close(p[1]);
runcmd(pcmd->left);
}
if(fork1() == 0){
close(0);
dup(p[0]);
close(p[0]);
close(p[1]);
runcmd(pcmd->right);
}
close(p[0]);
close(p[1]);
wait();
wait();
break;
case BACK:
bcmd = (struct backcmd*)cmd;
if(fork1() == 0)
runcmd(bcmd->cmd);
break;
}
exit();
}
int
getcmd(char *buf, int nbuf)
{
printf(2, "$ ");
memset(buf, 0, nbuf);
gets(buf, nbuf);
if(buf[0] == 0) // EOF
return -1;
return 0;
}
Sheet 76
Feb 19 20:50 2011 xv6/sh.c Page 4
Feb 19 20:50 2011 xv6/sh.c Page 5
7700
7701
7702
7703
7704
7705
7706
7707
7708
7709
7710
7711
7712
7713
7714
7715
7716
7717
7718
7719
7720
7721
7722
7723
7724
7725
7726
7727
7728
7729
7730
7731
7732
7733
7734
7735
7736
7737
7738
7739
7740
7741
7742
7743
7744
7745
7746
7747
7748
7749
7750
7751
7752
7753
7754
7755
7756
7757
7758
7759
7760
7761
7762
7763
7764
7765
7766
7767
7768
7769
7770
7771
7772
7773
7774
7775
7776
7777
7778
7779
7780
7781
7782
7783
7784
7785
7786
7787
7788
7789
7790
7791
7792
7793
7794
7795
7796
7797
7798
7799
int
main(void)
{
static char buf[100];
int fd;
// Assumes three file descriptors open.
while((fd = open("console", O_RDWR)) >= 0){
if(fd >= 3){
close(fd);
break;
}
}
// Read and run input commands.
while(getcmd(buf, sizeof(buf)) >= 0){
if(buf[0] == c && buf[1] == d && buf[2] == ){
// Clumsy but will have to do for now.
// Chdir has no effect on the parent if run in the child.
buf[strlen(buf)-1] = 0; // chop \n
if(chdir(buf+3) < 0)
printf(2, "cannot cd %s\n", buf+3);
continue;
}
if(fork1() == 0)
runcmd(parsecmd(buf));
wait();
}
exit();
}
void
panic(char *s)
{
printf(2, "%s\n", s);
exit();
}
int
fork1(void)
{
int pid;
pid = fork();
if(pid == -1)
panic("fork");
return pid;
}
Sheet 77
// Constructors
struct cmd*
execcmd(void)
{
struct execcmd *cmd;
cmd = malloc(sizeof(*cmd));
memset(cmd, 0, sizeof(*cmd));
cmd->type = EXEC;
return (struct cmd*)cmd;
}
struct cmd*
redircmd(struct cmd *subcmd, char *file, char *efile, int mode, int fd)
{
struct redircmd *cmd;
cmd->type = REDIR;
cmd->cmd = subcmd;
cmd->file = file;
cmd->efile = efile;
cmd->mode = mode;
cmd->fd = fd;
}
struct cmd*
pipecmd(struct cmd *left, struct cmd *right)
{
struct pipecmd *cmd;
cmd->type = PIPE;
cmd->left = left;
cmd->right = right;
}
Sheet 77
Feb 19 20:50 2011 xv6/sh.c Page 6
Feb 19 20:50 2011 xv6/sh.c Page 7
7800
7801
7802
7803
7804
7805
7806
7807
7808
7809
7810
7811
7812
7813
7814
7815
7816
7817
7818
7819
7820
7821
7822
7823
7824
7825
7826
7827
7828
7829
7830
7831
7832
7833
7834
7835
7836
7837
7838
7839
7840
7841
7842
7843
7844
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857
7858
7859
7860
7861
7862
7863
7864
7865
7866
7867
7868
7869
7870
7871
7872
7873
7874
7875
7876
7877
7878
7879
7880
7881
7882
7883
7884
7885
7886
7887
7888
7889
7890
7891
7892
7893
7894
7895
7896
7897
7898
7899
struct cmd*
listcmd(struct cmd *left, struct cmd *right)
{
struct listcmd *cmd;
cmd->type = LIST;
cmd->left = left;
cmd->right = right;
}
struct cmd*
backcmd(struct cmd *subcmd)
{
struct backcmd *cmd;
cmd->type = BACK;
cmd->cmd = subcmd;
}
Sheet 78
// Parsing
char whitespace[] = " \t\r\n\v";
char symbols[] = "<|>&;()";
int
gettoken(char **ps, char *es, char **q, char **eq)
{
char *s;
int ret;
s = *ps;
while(s < es && strchr(whitespace, *s))
s++;
if(q)
*q = s;
ret = *s;
switch(*s){
case 0:
break;
case |:
case (:
case ):
case ;:
case &:
case <:
s++;
break;
case >:
s++;
if(*s == >){
ret = +;
s++;
}
break;
default:
ret = a;
while(s < es && !strchr(whitespace, *s) && !strchr(symbols, *s))
s++;
break;
}
if(eq)
*eq = s;
s++;
*ps = s;
return ret;
}
Sheet 78
Feb 19 20:50 2011 xv6/sh.c Page 8
Feb 19 20:50 2011 xv6/sh.c Page 9
7900
7901
7902
7903
7904
7905
7906
7907
7908
7909
7910
7911
7912
7913
7914
7915
7916
7917
7918
7919
7920
7921
7922
7923
7924
7925
7926
7927
7928
7929
7930
7931
7932
7933
7934
7935
7936
7937
7938
7939
7940
7941
7942
7943
7944
7945
7946
7947
7948
7949
7950
7951
7952
7953
7954
7955
7956
7957
7958
7959
7960
7961
7962
7963
7964
7965
7966
7967
7968
7969
7970
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
int
peek(char **ps, char *es, char *toks)
{
char *s;
s = *ps;
s++;
*ps = s;
return *s && strchr(toks, *s);
}
struct
struct
struct
struct
cmd
cmd
cmd
cmd
*parseline(char**, char*);
*parsepipe(char**, char*);
*parseexec(char**, char*);
*nulterminate(struct cmd*);
struct cmd*
parsecmd(char *s)
{
char *es;
struct cmd *cmd;
es = s + strlen(s);
cmd = parseline(&s, es);
peek(&s, es, "");
if(s != es){
printf(2, "leftovers: %s\n", s);
panic("syntax");
}
nulterminate(cmd);
return cmd;
}
struct cmd*
parseline(char **ps, char *es)
{
struct cmd *cmd;
cmd = parsepipe(ps, es);
while(peek(ps, es, "&")){
gettoken(ps, es, 0, 0);
cmd = backcmd(cmd);
}
if(peek(ps, es, ";")){
cmd = listcmd(cmd, parseline(ps, es));
}
return cmd;
}
Sheet 79
struct cmd*
parsepipe(char **ps, char *es)
{
struct cmd *cmd;
cmd = parseexec(ps, es);
if(peek(ps, es, "|")){
cmd = pipecmd(cmd, parsepipe(ps, es));
}
return cmd;
}
struct cmd*
parseredirs(struct cmd *cmd, char **ps, char *es)
{
int tok;
char *q, *eq;
while(peek(ps, es, "<>")){
tok = gettoken(ps, es, 0, 0);
if(gettoken(ps, es, &q, &eq) != a)
panic("missing file for redirection");
switch(tok){
case <:
cmd = redircmd(cmd, q, eq, O_RDONLY, 0);
break;
case >:
cmd = redircmd(cmd, q, eq, O_WRONLY|O_CREATE, 1);
break;
case +: // >>
cmd = redircmd(cmd, q, eq, O_WRONLY|O_CREATE, 1);
break;
}
}
return cmd;
}
Sheet 79
Feb 19 20:50 2011 xv6/sh.c Page 10
Feb 19 20:50 2011 xv6/sh.c Page 11
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021
8022
8023
8024
8025
8026
8027
8028
8029
8030
8031
8032
8033
8034
8035
8036
8037
8038
8039
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078
8079
8080
8081
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
8096
8097
8098
8099
struct cmd*
parseblock(char **ps, char *es)
{
struct cmd *cmd;
if(!peek(ps, es, "("))
panic("parseblock");
cmd = parseline(ps, es);
if(!peek(ps, es, ")"))
panic("syntax - missing )");
cmd = parseredirs(cmd, ps, es);
return cmd;
}
struct cmd*
parseexec(char **ps, char *es)
{
char *q, *eq;
int tok, argc;
struct execcmd *cmd;
struct cmd *ret;
if(peek(ps, es, "("))
return parseblock(ps, es);
ret = execcmd();
cmd = (struct execcmd*)ret;
argc = 0;
ret = parseredirs(ret, ps, es);
while(!peek(ps, es, "|)&;")){
if((tok=gettoken(ps, es, &q, &eq)) == 0)
break;
if(tok != a)
panic("syntax");
cmd->argv[argc] = q;
cmd->eargv[argc] = eq;
argc++;
if(argc >= MAXARGS)
panic("too many args");
ret = parseredirs(ret, ps, es);
}
cmd->argv[argc] = 0;
cmd->eargv[argc] = 0;
return ret;
}
Sheet 80
// NUL-terminate all the counted strings.

struct cmd*
nulterminate(struct cmd *cmd)
{
int i;
struct backcmd *bcmd;
struct execcmd *ecmd;
struct listcmd *lcmd;
struct pipecmd *pcmd;
struct redircmd *rcmd;
if(cmd == 0)
return 0;
switch(cmd->type){
case EXEC:
ecmd = (struct execcmd*)cmd;
for(i=0; ecmd->argv[i]; i++)
*ecmd->eargv[i] = 0;
break;
case REDIR:
rcmd = (struct redircmd*)cmd;
nulterminate(rcmd->cmd);
*rcmd->efile = 0;
break;
case PIPE:
pcmd = (struct pipecmd*)cmd;
nulterminate(pcmd->left);
nulterminate(pcmd->right);
break;
case LIST:
lcmd = (struct listcmd*)cmd;
nulterminate(lcmd->left);
nulterminate(lcmd->right);
break;
case BACK:
bcmd = (struct backcmd*)cmd;
nulterminate(bcmd->cmd);
break;
}
return cmd;
}
Sheet 80

xv6 Rev5

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

xv6 Rev5

Hochgeladen von

Copyright:

Verfügbare Formate

Feb 19 20:50 2011 README Page 1

Feb 19 20:50 2011 table of contents Page 1

xv6 is a re-implementation of Dennis Ritchies and Ken Thompsons Unix

If you spot errors or have suggestions for improvement, please send

The source listing is preceded by a cross-reference that lists every defined

Feb 19 20:50 2011 cross-references Page 1

4230 4562 4572

Feb 19 20:50 2011 cross-references Page 2

6631 6679 6704

6891 6892 6986 7026

Feb 19 20:50 2011 cross-references Page 3

0302 2004 2040

Feb 19 20:50 2011 cross-references Page 4

0464 0467 0901

Feb 19 20:50 2011 cross-references Page 5

0277 1367 6014

Feb 19 20:50 2011 cross-references Page 6

Feb 19 20:50 2011 cross-references Page 7

Feb 19 20:50 2011 cross-references Page 8

Feb 19 20:50 2011 cross-references Page 9

0485 1659 1668

Feb 19 20:50 2011 cross-references Page 10

0308 1390 1713 2108 2128

Feb 19 20:50 2011 cross-references Page 11

Feb 19 20:50 2011 cross-references Page 12

0374 2129 2706 2715

1817 1886 3078

Feb 19 20:50 2011 xv6/types.h Page 1

Feb 19 20:50 2011 xv6/param.h Page 1

unsigned int uint;

Feb 19 20:50 2011 xv6/defs.h Page 1

Feb 19 20:50 2011 xv6/defs.h Page 2

dirlink(struct inode*, char*, uint);

ioapicenable(int irq, int cpu);

pipealloc(struct file**, struct file**);

Feb 19 20:50 2011 xv6/defs.h Page 3

Feb 19 20:50 2011 xv6/defs.h Page 4

swtch(struct context**, struct context*);

memcmp(const void*, const void*, uint);

// number of elements in fixed-size array

Feb 19 20:50 2011 xv6/x86.h Page 1

Feb 19 20:50 2011 xv6/x86.h Page 2

// Routines to let C code use special x86 instructions.

Feb 19 20:50 2011 xv6/x86.h Page 3

Feb 19 20:50 2011 xv6/x86.h Page 4

static inline uint

static inline void

Feb 19 20:50 2011 xv6/x86.h Page 5

Feb 19 20:50 2011 xv6/asm.h Page 1

// Layout of the trap frame built on the stack by the

// The 0xC0 means the limit is in 4096-byte units

Feb 19 20:50 2011 xv6/mmu.h Page 1

Feb 19 20:50 2011 xv6/mmu.h Page 2

// This file contains definitions for the

// Control Register flags

Low bits of segment limit

// Application segment type

// System segment type bits

Feb 19 20:50 2011 xv6/mmu.h Page 3

Feb 19 20:50 2011 xv6/mmu.h Page 4

0850 // Task state segment format

A linear address la has a three-part structure as follows:

dirlink(struct inode, char, uint);

pipealloc(struct file, struct file);

memcmp(const void, const void, uint);