[linux kernel] how does the linux kernel mount the root file system

How does the linux kernel finally mount the root file system 1, Past life and present life In kernel_ Kernel will be called in init thread function_ init_ Freeable() function, in the kernel_init_ Prepare will be called in the freeable function_ The namespace () function mounts the root file system. [it's a long way to go, mounting begins!! ...

Added by markc1 on Thu, 27 Jan 2022 13:11:45 +0200

Deep understanding of computer systems CSAPP_TshLab

TshLab Start date: 22.1.20 Operating system: linux Debugging tool: linux terminal Preknowledge tshlab means tiny shell lab In this chapter of EOF (Chapter 8), you must see 8.6. The author knocked down all the running source codes in it. For convenience, please refer to the following two links: source code,csapp. Use of H Be sure to read th ...

Added by stanleyg on Thu, 27 Jan 2022 13:02:25 +0200

Detailed interpretation: C language to achieve three pieces of chess

catalog: 1, Explain 2, Multi file creation 3, Design ideas 4, Code implementation 5, Overall code 6, Summary The following is the main body 1, Explain With the gradual deepening of our learning of C language, we can realize some simple games. This paper will introduce the C language to realize the three piece chess game. Through thi ...

Added by sevenmenkes on Thu, 27 Jan 2022 12:19:50 +0200

Pointer usage

As we know, adding & before a variable is the address of the variable, and * is the address of the variable. *Represents the address. int* a = new int[10]; // It means that the system allocates a continuous piece of memory to store int data, and a is the starting address of this piece of memory. *a = 10;// It means that the data in the fi ...

Added by dbradbury on Thu, 27 Jan 2022 10:32:49 +0200

C language implements the insertion, deletion and search of binary sort tree (detailed illustration)

1 definition of binary sort tree: If its left subtree is not empty, the value of all nodes on the left subtree is less than that of its root node If its right subtree is not empty, the value of all nodes on the right subtree is greater than that of its root node The left and right subtrees of the root node are binary sort trees (bina ...

Added by mubashir on Thu, 27 Jan 2022 08:41:51 +0200

Zero foundation introduction C language lesson 6

Lesson 6: Elementary pointer catalogue Lesson 6: Elementary pointer 1.1. What is the pointer? 1.2 pointer and pointer type 1.3. Wild pointer 1.4 pointer operation and pointer operation 1.5 pointer and array and variable length array (VLA) 1.6 secondary pointer 1.7 pointer array 1.8 pointer compatibility 1.1 what is the pointer? A p ...

Added by simjay on Thu, 27 Jan 2022 01:38:26 +0200

C language implementation of address book management system - dynamic memory allocation type

catalogue 1, Address book function requirement analysis: 2, File schema analysis: 3, Code, presented in modules: 3.1 main function: 3.2 # menu function: 3.3. Declaration part of enumeration type: 3.4 initialization of address book: 3.5. Add the contact information part of the address book: 3.6 ― part displaying contact information: 3. ...

Added by Spiz on Thu, 27 Jan 2022 00:15:37 +0200

Matrix problem in C language

I Matrix multiplication 1. Theorem: The multiplication of two matrices can be defined only when the number of columns of the first matrix A is equal to the number of rows of the other matrix B. If a is m × N matrix and B are n × p matrices whose product C is an M × p matrix.     For example:  2. thinking 1. i and ...

Added by Rigo on Wed, 26 Jan 2022 19:44:25 +0200

[C Advanced] bit segment - enumeration - Union

catalogue 1. Bit segment       1.1. What is a bit segment       1.2. Memory allocation of bit segment       1.3 cross platform problem of location section       1.4 application of bit segment 2. Enumeration       2.1 definition of enumeration type       2.2 advantages of enumeration       2.3 use of enumeration 3. United       3.1 de ...

Added by zszucs on Wed, 26 Jan 2022 15:42:09 +0200

[C language] Pointer advanced fifth station, function pointer

Pointer advanced fifth stop 🚏: Function pointer Click on my home page to review the contents of the first four stations~ 1 function pointer Functions also have their own addresses. Function name / & function name is the address of the function 1.1 basic form stay Array pointer In our study, we learned int arr[5]; int (*p ...

Added by Rdam on Wed, 26 Jan 2022 14:30:06 +0200