Linux Kernel Data Structure

Linux kernel data structure-general Linux technology-Linux programming and kernel information. The following is a detailed description. 1) replace a linked list double-chain table with a single-chain table to represent a typical application in which the operating system uses the memory access time in exchange for the cpu cycle.

2) To avoid accessing all elements to access an element in a hash table, Linux uses a hash table to avoid this bad phenomenon. The invention of the scattered list is really great. If a programmer does not use a hash, you are not a real programmer. In Linux, hash is often used for high-speed caching. The disadvantage of High-speed cache is that it is difficult to maintain. If a data structure can be found in the cache, It is very lucky, but if it cannot be found, it is necessary to search for the relevant data structure. If the data exists, then it is necessary to add it to the cache. When a new data structure is added to the cache, the data structure will be eliminated, the reality is that no one who is cruel can guarantee that the one who is eliminated is not required for the next visit.

3) Abstract interfaces mainly use function pointers and some object-oriented design methods and concepts.