This is the fifth part of the Kernel booting process
series. We saw transition to the 64-bit mode in the previous part and we will continue from this point in this part. We will see the last steps before we jump to the kernel code as preparation for kernel decompression, relocation and directly kernel decompression. So... let's start to dive in the kernel code again.
We stopped right before the jump on the 64-bit
entry point - startup_64
which is located in the arch/x86/boot/compressed/head_64.S source code file. We already saw the jump to the startup_64
in the startup_32
:
pushl $__KERNEL_CS
leal startup_64(%ebp), %eax
...
...
...
pushl %eax
...
...
...
lret
in the previous part. Since we loaded the new Global Descriptor Table
and there was CPU transition in other mode (64-bit
mode in our case), we can see the setup of the data segments:
.code64
.org 0x200
ENTRY(startup_64)
xorl %eax, %eax
movl %eax, %ds
movl %eax, %es
movl %eax, %ss
movl %eax, %fs
movl %eax, %gs
in the beginning of the startup_64
. All segment registers besides cs
register now reseted as we joined into the long mode
.
The next step is computation of difference between where the kernel was compiled and where it was loaded:
#ifdef CONFIG_RELOCATABLE
leaq startup_32(%rip), %rbp
movl BP_kernel_alignment(%rsi), %eax
decl %eax
addq %rax, %rbp
notq %rax
andq %rax, %rbp
cmpq $LOAD_PHYSICAL_ADDR, %rbp
jge 1f
#endif
movq $LOAD_PHYSICAL_ADDR, %rbp
1:
movl BP_init_size(%rsi), %ebx
subl $_end, %ebx
addq %rbp, %rbx
The rbp
contains the decompressed kernel start address and after this code executes rbx
register will contain address to relocate the kernel code for decompression. We already saw code like this in the startup_32
( you can read about it in the previous part - Calculate relocation address), but we need to do this calculation again because the bootloader can use 64-bit boot protocol and startup_32
just will not be executed in this case.
In the next step we can see setup of the stack pointer, resetting of the flags register and setup GDT
again because of in a case of 64-bit
protocol 32-bit
code segment can be omitted by bootloader:
leaq boot_stack_end(%rbx), %rsp
leaq gdt(%rip), %rax
movq %rax, gdt64+2(%rip)
lgdt gdt64(%rip)
pushq $0
popfq
If you look at the Linux kernel source code after lgdt gdt64(%rip)
instruction, you will see that there is some additional code. This code builds trampoline to enable 5-level pagging if need. We will consider only 4-level paging in this books, so this code will be omitted.
As you can see above, the rbx
register contains the start address of the kernel decompressor code and we just put this address with boot_stack_end
offset to the rsp
register which represents pointer to the top of the stack. After this step, the stack will be correct. You can find definition of the boot_stack_end
in the end of arch/x86/boot/compressed/head_64.S assembly source code file:
.bss
.balign 4
boot_heap:
.fill BOOT_HEAP_SIZE, 1, 0
boot_stack:
.fill BOOT_STACK_SIZE, 1, 0
boot_stack_end:
It located in the end of the .bss
section, right before the .pgtable
. If you will look into arch/x86/boot/compressed/vmlinux.lds.S linker script, you will find Definition of the .bss
and .pgtable
there.
As we set the stack, now we can copy the compressed kernel to the address that we got above, when we calculated the relocation address of the decompressed kernel. Before details, let's look at this assembly code:
pushq %rsi
leaq (_bss-8)(%rip), %rsi
leaq (_bss-8)(%rbx), %rdi
movq $_bss, %rcx
shrq $3, %rcx
std
rep movsq
cld
popq %rsi
First of all we push rsi
to the stack. We need preserve the value of rsi
, because this register now stores a pointer to the boot_params
which is real mode structure that contains booting related data (you must remember this structure, we filled it in the start of kernel setup). In the end of this code we'll restore the pointer to the boot_params
into rsi
again.
The next two leaq
instructions calculates effective addresses of the rip
and rbx
with _bss - 8
offset and put it to the rsi
and rdi
. Why do we calculate these addresses? Actually the compressed kernel image is located between this copying code (from startup_32
to the current code) and the decompression code. You can verify this by looking at the linker script - arch/x86/boot/compressed/vmlinux.lds.S:
. = 0;
.head.text : {
_head = . ;
HEAD_TEXT
_ehead = . ;
}
.rodata..compressed : {
*(.rodata..compressed)
}
.text : {
_text = .; /* Text */
*(.text)
*(.text.*)
_etext = . ;
}
Note that .head.text
section contains startup_32
. You may remember it from the previous part:
__HEAD
.code32
ENTRY(startup_32)
...
...
...
The .text
section contains decompression code:
.text
relocated:
...
...
...
/*
* Do the decompression, and jump to the new kernel..
*/
...
And .rodata..compressed
contains the compressed kernel image. So rsi
will contain the absolute address of _bss - 8
, and rdi
will contain the relocation relative address of _bss - 8
. As we store these addresses in registers, we put the address of _bss
in the rcx
register. As you can see in the vmlinux.lds.S
linker script, it's located at the end of all sections with the setup/kernel code. Now we can start to copy data from rsi
to rdi
, 8
bytes at the time, with the movsq
instruction.
Note that there is an std
instruction before data copying: it sets the DF
flag, which means that rsi
and rdi
will be decremented. In other words, we will copy the bytes backwards. At the end, we clear the DF
flag with the cld
instruction, and restore boot_params
structure to rsi
.
Now we have the address of the .text
section address after relocation, and we can jump to it:
leaq relocated(%rbx), %rax
jmp *%rax
In the previous paragraph we saw that the .text
section starts with the relocated
label. The first thing it does is clearing the bss
section with:
xorl %eax, %eax
leaq _bss(%rip), %rdi
leaq _ebss(%rip), %rcx
subq %rdi, %rcx
shrq $3, %rcx
rep stosq
We need to initialize the .bss
section, because we'll soon jump to C code. Here we just clear eax
, put the address of _bss
in rdi
and _ebss
in rcx
, and fill it with zeros with the rep stosq
instruction.
At the end, we can see the call to the extract_kernel
function:
pushq %rsi
movq %rsi, %rdi
leaq boot_heap(%rip), %rsi
leaq input_data(%rip), %rdx
movl $z_input_len, %ecx
movq %rbp, %r8
movq $z_output_len, %r9
call extract_kernel
popq %rsi
Again we set rdi
to a pointer to the boot_params
structure and preserve it on the stack. In the same time we set rsi
to point to the area which should be used for kernel uncompression. The last step is preparation of the extract_kernel
parameters and call of this function which will uncompres the kernel. The extract_kernel
function is defined in the arch/x86/boot/compressed/misc.c source code file and takes six arguments:
rmode
- pointer to the boot_params structure which is filled by bootloader or during early kernel initialization;heap
- pointer to theboot_heap
which represents start address of the early boot heap;input_data
- pointer to the start of the compressed kernel or in other words pointer to thearch/x86/boot/compressed/vmlinux.bin.bz2
;input_len
- size of the compressed kernel;output
- start address of the future decompressed kernel;output_len
- size of decompressed kernel;
All arguments will be passed through the registers according to System V Application Binary Interface. We've finished all preparation and can now look at the kernel decompression.
As we saw in previous paragraph, the extract_kernel
function is defined in the arch/x86/boot/compressed/misc.c source code file and takes six arguments. This function starts with the video/console initialization that we already saw in the previous parts. We need to do this again because we don't know if we started in real mode or a bootloader was used, or whether the bootloader used the 32
or 64-bit
boot protocol.
After the first initialization steps, we store pointers to the start of the free memory and to the end of it:
free_mem_ptr = heap;
free_mem_end_ptr = heap + BOOT_HEAP_SIZE;
where the heap
is the second parameter of the extract_kernel
function which we got in the arch/x86/boot/compressed/head_64.S:
leaq boot_heap(%rip), %rsi
As you saw above, the boot_heap
is defined as:
boot_heap:
.fill BOOT_HEAP_SIZE, 1, 0
where the BOOT_HEAP_SIZE
is macro which expands to 0x10000
(0x400000
in a case of bzip2
kernel) and represents the size of the heap.
After heap pointers initialization, the next step is the call of the choose_random_location
function from arch/x86/boot/compressed/kaslr.c source code file. As we can guess from the function name, it chooses the memory location where the kernel image will be decompressed. It may look weird that we need to find or even choose
location where to decompress the compressed kernel image, but the Linux kernel supports kASLR which allows decompression of the kernel into a random address, for security reasons.
We will not consider randomization of the Linux kernel load address in this part, but will do it in the next part.
Now let's back to misc.c. After getting the address for the kernel image, there need to be some checks to be sure that the retrieved random address is correctly aligned and address is not wrong:
if ((unsigned long)output & (MIN_KERNEL_ALIGN - 1))
error("Destination physical address inappropriately aligned");
if (virt_addr & (MIN_KERNEL_ALIGN - 1))
error("Destination virtual address inappropriately aligned");
if (heap > 0x3fffffffffffUL)
error("Destination address too large");
if (virt_addr + max(output_len, kernel_total_size) > KERNEL_IMAGE_SIZE)
error("Destination virtual address is beyond the kernel mapping area");
if ((unsigned long)output != LOAD_PHYSICAL_ADDR)
error("Destination address does not match LOAD_PHYSICAL_ADDR");
if (virt_addr != LOAD_PHYSICAL_ADDR)
error("Destination virtual address changed when not relocatable");
After all these checks we will see the familiar message:
Decompressing Linux...
and call the __decompress
function:
__decompress(input_data, input_len, NULL, NULL, output, output_len, NULL, error);
which will decompress the kernel. The implementation of the __decompress
function depends on what decompression algorithm was chosen during kernel compilation:
#ifdef CONFIG_KERNEL_GZIP
#include "../../../../lib/decompress_inflate.c"
#endif
#ifdef CONFIG_KERNEL_BZIP2
#include "../../../../lib/decompress_bunzip2.c"
#endif
#ifdef CONFIG_KERNEL_LZMA
#include "../../../../lib/decompress_unlzma.c"
#endif
#ifdef CONFIG_KERNEL_XZ
#include "../../../../lib/decompress_unxz.c"
#endif
#ifdef CONFIG_KERNEL_LZO
#include "../../../../lib/decompress_unlzo.c"
#endif
#ifdef CONFIG_KERNEL_LZ4
#include "../../../../lib/decompress_unlz4.c"
#endif
After kernel is decompressed, the last two functions are parse_elf
and handle_relocations
. The main point of these functions is to move the uncompressed kernel image to the correct memory place. The fact is that the decompression will decompress in-place, and we still need to move kernel to the correct address. As we already know, the kernel image is an ELF executable, so the main goal of the parse_elf
function is to move loadable segments to the correct address. We can see loadable segments in the output of the readelf
program:
readelf -l vmlinux
Elf file type is EXEC (Executable file)
Entry point 0x1000000
There are 5 program headers, starting at offset 64
Program Headers:
Type Offset VirtAddr PhysAddr
FileSiz MemSiz Flags Align
LOAD 0x0000000000200000 0xffffffff81000000 0x0000000001000000
0x0000000000893000 0x0000000000893000 R E 200000
LOAD 0x0000000000a93000 0xffffffff81893000 0x0000000001893000
0x000000000016d000 0x000000000016d000 RW 200000
LOAD 0x0000000000c00000 0x0000000000000000 0x0000000001a00000
0x00000000000152d8 0x00000000000152d8 RW 200000
LOAD 0x0000000000c16000 0xffffffff81a16000 0x0000000001a16000
0x0000000000138000 0x000000000029b000 RWE 200000
The goal of the parse_elf
function is to load these segments to the output
address we got from the choose_random_location
function. This function starts with checking the ELF signature:
Elf64_Ehdr ehdr;
Elf64_Phdr *phdrs, *phdr;
memcpy(&ehdr, output, sizeof(ehdr));
if (ehdr.e_ident[EI_MAG0] != ELFMAG0 ||
ehdr.e_ident[EI_MAG1] != ELFMAG1 ||
ehdr.e_ident[EI_MAG2] != ELFMAG2 ||
ehdr.e_ident[EI_MAG3] != ELFMAG3) {
error("Kernel is not a valid ELF file");
return;
}
and if it's not valid, it prints an error message and halts. If we got a valid ELF
file, we go through all program headers from the given ELF
file and copy all loadable segments with correct 2 megabytes aligned address to the output buffer:
for (i = 0; i < ehdr.e_phnum; i++) {
phdr = &phdrs[i];
switch (phdr->p_type) {
case PT_LOAD:
#ifdef CONFIG_X86_64
if ((phdr->p_align % 0x200000) != 0)
error("Alignment of LOAD segment isn't multiple of 2MB");
#endif
#ifdef CONFIG_RELOCATABLE
dest = output;
dest += (phdr->p_paddr - LOAD_PHYSICAL_ADDR);
#else
dest = (void *)(phdr->p_paddr);
#endif
memmove(dest, output + phdr->p_offset, phdr->p_filesz);
break;
default:
break;
}
}
That's all.
From this moment, all loadable segments are in the correct place.
The next step after the parse_elf
function is the call of the handle_relocations
function. Implementation of this function depends on the CONFIG_X86_NEED_RELOCS
kernel configuration option and if it is enabled, this function adjusts addresses in the kernel image, and is called only if the CONFIG_RANDOMIZE_BASE
configuration option was enabled during kernel configuration. Implementation of the handle_relocations
function is easy enough. This function subtracts value of the LOAD_PHYSICAL_ADDR
from the value of the base load address of the kernel and thus we obtain the difference between where the kernel was linked to load and where it was actually loaded. After this we can perform kernel relocation as we know actual address where the kernel was loaded, its address where it was linked to run and relocation table which is in the end of the kernel image.
After the kernel is relocated, we return back from the extract_kernel
to arch/x86/boot/compressed/head_64.S.
The address of the kernel will be in the rax
register and we jump to it:
jmp *%rax
That's all. Now we are in the kernel!
This is the end of the fifth part about linux kernel booting process. We will not see posts about kernel booting anymore (maybe updates to this and previous posts), but there will be many posts about other kernel internals.
Next chapter will describe more advanced details about linux kernel booting process, like a load address randomization and etc.
If you have any questions or suggestions write me a comment or ping me in twitter.
Please note that English is not my first language, And I am really sorry for any inconvenience. If you find any mistakes please send me PR to linux-insides.