CN112817986A - Data structure repairing method and device suitable for Linux production environment - Google Patents
Data structure repairing method and device suitable for Linux production environment Download PDFInfo
- Publication number
- CN112817986A CN112817986A CN202110218365.1A CN202110218365A CN112817986A CN 112817986 A CN112817986 A CN 112817986A CN 202110218365 A CN202110218365 A CN 202110218365A CN 112817986 A CN112817986 A CN 112817986A
- Authority
- CN
- China
- Prior art keywords
- data structure
- instruction
- linux
- data
- caches
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24552—Database cache management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Memory System Of A Hierarchy Structure (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention provides a data structure repairing method and a data structure repairing device suitable for a Linux production environment, which comprise the following steps of: establishing an interaction channel between a kernel space and a Linux user space, wherein the Linux user space sends and/or establishes instructions to the kernel space based on the interaction channel; traversing data structures at kernel space based on instructions, acquiring each data structure, then calling a previously registered callback function as a parameter, and determining a specific processing mode of each data structure based on the callback function; and processing the data structure based on the specific processing mode. According to the technical scheme provided by the invention, under the condition that the production environment is still running, the basic data structure of the system is traversed in a mode of inserting an extensible correction module, the problem data structure is found out, and the valuable information is corrected or derived to assist workers in repairing the system.
Description
Technical Field
The invention relates to technologies, in particular to a data structure repairing method and device suitable for a Linux production environment.
Background
In recent years, cloud computing technology is rapidly developed, and many industries successively transfer services to virtual machines (virtual machines) or containers (containers) of a cloud platform, and a cloud platform provider must be responsible for reliability, stability and security of a client service virtual machine. The characteristics are often closely related to the infrastructure of the cloud platform, namely the operating system, the operating system provides rich hardware architecture, memory, process, network, storage and virtualization support, and in the continuous evolution, some bugs or errors are inevitable in the huge system, a Linux kernel community or a related Linux distribution developer can quickly identify problems and put forward repair patches under general conditions, the aim of solving the problems is achieved for general users, but the requirements cannot be met for cloud platform suppliers, the system needs to be restarted after the patches are put on, and the system needs to be avoided as much as possible for the cloud platform with huge traffic. Currently, there is no effective mechanism for repairing errors in the Linux production environment without restarting the machine.
Disclosure of Invention
The embodiment of the invention provides a data structure repairing method and device suitable for a Linux production environment, which can repair errors in the Linux production environment on the premise of not restarting a machine.
In a first aspect of the embodiments of the present invention, a data structure repairing method applicable to a Linux production environment is provided, including:
establishing an interaction channel between a kernel space and a Linux user space, wherein the Linux user space sends and/or establishes instructions to the kernel space based on the interaction channel;
traversing data structures at kernel space based on instructions, acquiring each data structure, then calling a previously registered callback function as a parameter, and determining a specific processing mode of each data structure based on the callback function;
and processing the data structure based on the specific processing mode.
Optionally, in a possible implementation manner of the first aspect, the method further includes:
and inquiring the registered and/or established instruction based on the interaction channel.
Optionally, in a possible implementation manner of the first aspect, the instruction-based traversal of the data structure at the kernel space includes:
registering an instruction in advance, wherein the instruction comprises traversal data information which is set corresponding to a problem to be processed;
and performing repair processing after traversing the corresponding kernel data based on the instruction.
Optionally, in a possible implementation manner of the first aspect, the processing the data structure based on the specific processing manner includes:
and acquiring the caches of which the consumption is 0 in all the caches and the cgroup to which the caches belong is deleted, and calling a callback function to cancel.
In a second aspect of the embodiments of the present invention, a data structure repairing apparatus suitable for a Linux production environment is provided, including:
the main interaction module is used for establishing an interaction channel between the kernel space and a Linux user space, and the Linux user space sends and/or establishes instructions to the kernel space based on the interaction channel;
the command calling module is used for traversing the data structures at the kernel space based on the instruction, calling a previously registered callback function as a parameter after each data structure is obtained, and determining the specific processing mode of each data structure based on the callback function;
and the processing module is used for processing the data structure based on the specific processing mode.
Optionally, in a possible implementation manner of the second aspect, the system further includes an application layer tool module, configured to query registered and/or established instructions based on the interaction channel.
Optionally, in one possible implementation manner of the second aspect, the instruction-based traversal of the data structure at the kernel space includes:
registering an instruction in advance, wherein the instruction comprises traversal data information which is set corresponding to a problem to be processed;
and performing repair processing after traversing the corresponding kernel data based on the instruction.
Optionally, in a possible implementation manner of the second aspect, the processing the data structure based on the specific processing manner includes:
and acquiring the caches of which the consumption is 0 in all the caches and the cgroup to which the caches belong is deleted, and calling a callback function to cancel.
A third aspect of the present invention provides an electronic apparatus, comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to cause the at least one processor to perform the method provided in any one of the first aspect.
A fourth aspect of the embodiments of the present invention provides a readable storage medium, in which a computer program is stored, and the computer program is used for implementing the method according to the first aspect of the present invention and various possible designs of the first aspect of the present invention when the computer program is executed by a processor.
According to the data structure repairing method and device suitable for the Linux production environment, under the condition that the production environment is still running, the basic data structure of the system is traversed in a mode of inserting the extensible correction module, the problem data structure is found out, and valuable information is corrected or exported.
Drawings
FIG. 1 is a schematic diagram of a first scenario of a prior art scenario 1;
FIG. 2 is a diagram of a second scenario of scenario 1 in the prior art;
FIG. 3 is a schematic diagram of a first case of scenario 2 in the prior art;
FIG. 4 is a schematic diagram of a first embodiment of a data structure repair apparatus suitable for use in a Linux production environment;
FIG. 5 is a schematic diagram of a first embodiment of a data structure repair method suitable for use in a Linux production environment;
fig. 6 is a schematic diagram of a second embodiment of a data structure repair apparatus suitable for use in a Linux production environment.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein.
It should be understood that, in various embodiments of the present invention, the sequence numbers of the processes do not mean the execution sequence, and the execution sequence of the processes should be determined by the functions and the internal logic of the processes, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
It should be understood that in the present application, "comprising" and "having" and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be understood that, in the present invention, "a plurality" means two or more. "and/or" is merely an association describing an associated object, meaning that three relationships may exist, for example, and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "comprises A, B and C" and "comprises A, B, C" means that all three of A, B, C comprise, "comprises A, B or C" means that one of A, B, C comprises, "comprises A, B and/or C" means that any 1 or any 2 or 3 of A, B, C comprises.
It should be understood that in the present invention, "B corresponding to a", "a corresponds to B", or "B corresponds to a" means that B is associated with a, and B can be determined from a. Determining B from a does not mean determining B from a alone, but may be determined from a and/or other information. And the matching of A and B means that the similarity of A and B is greater than or equal to a preset threshold value.
As used herein, "if" may be interpreted as "at … …" or "when … …" or "in response to a determination" or "in response to a detection", depending on the context.
The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Explanation and explanation of related words:
container: resource isolation techniques for specific processes or library files;
cgroup-Linux: the realization of the resource isolation technology is the background technology of the container;
memory leak: memory leak, the used memory is not released or loses the release path;
slub cache-Linux: the cache mechanism is used for realizing the rapid allocation and release of the data structure memory;
page cache-Linux: file system cache, using memory page as cache to increase io efficiency;
free page: unallocated memory free pages;
live scheduling-Linux: kernel dynamic correction technology, which allows a machine not to be restarted to correct kernel codes;
debuggfs: a virtual file system for kernel debugging;
user space-Linux: a user-mode address space;
kernel space-Linux: kernel mode address space.
The invention provides a data structure repairing device suitable for a Linux production environment, which is suitable for the following two scenes including but not limited to the following scenes encountered in the production environment.
Scene 1: container (resource isolation technique for a particular process or library file) causes a memory leak condition in case of abnormal shutdown.
The method includes the steps that resource isolation among containers is achieved by the containers through a cgroup technology of Linux kernel, cgroups are hierarchical structures and have a parent-child relationship, a program uses a sub cache in the cgroup and can inherit the parent-child relationship, as shown in FIG. 1, the cgroup, cgroup A and cgorup B are provided, A and B are root sub cgroups, created sub caches are added to a kmem _ cache array of a root slot cache data structure and are added to a slot _ caches global string, and the string is connected with the slot caches of the whole system.
Considering the release flow of the sub cache under the cgroup, as shown in fig. 2, when a normal container is closed, all processes under the container are ended, all memories are released, a mem _ cgroup _ css _ offline function is called in the process, the sub cache under the cgroup is released through a kmejcache _ shock function, and if the usage amount of the sub cache is 0, the memmcg _ kmem _ destroy _ cache is called to cancel. Under an abnormal condition, for example, some of the slub caches are still in use, and the usage amount of the slub caches cannot return to zero, the slub caches cannot be cancelled, but the cgroup does not exist, and the slub caches always remain on the system, so that memory leakage is formed.
Scene 2: page _ lock due to storage device problems
The Linux file system uses a page cache mechanism to load file contents into a memory, if different applications read the same file, the file can be read out from the page cache directly, so that frequent access to a bottom layer storage device is avoided to achieve an acceleration effect, as shown in fig. 3, the applications initiate a read operation, if the file does not have the page cache, a free page can be obtained first, and a lock _ page function is called to lock the page (namely, the PG _ locked function is set), so as to ensure that the page is not changed or recycled, and also represent that data is not read into the page from a disk really, so that access is prohibited. Then submit the io request (submit _ bio) to the block device layer, the block device layer will merge and sort the io request in the most efficient way (io schedule), and then the device driver will actually read the storage device. After reading is completed, the device initiates an interrupt to the CPU, enters an io completion call stack (bio _ endio), and then unlock _ page unlocks the page, which represents that the page has been read, and other operations can be performed. It can be seen from the io flow that lock _ page is initiated by an interrupt on a call chain of an application, and is an asynchronous mechanism, if a storage device has a problem (a bad disk, and a storage network is unstable) and cannot complete reading, it may happen that a page is always in a lock state, and at this time, if other processes want to operate on the page, for example, uninstall a file system, the page may be blocked because the page cannot be always locked, which is also an indication of the problem.
The invention provides a repairing mode for the two situations, which comprises the following steps:
and in the scene 1, traversing the slab caches under all cgroups, finding out that the used amount is 0 and the cgroup to which the cgroup belongs is deleted, and calling memcg _ kmem _ hierarchy _ cache to logout.
And in the scene 2, traversing the page wait table, finding the process data structure in a waiting state, and finding out which storage device belongs to from the waiting locked page for subsequently troubleshooting the storage device problem.
The 2 scenarios have a common phenomenon that a problematic data structure needs to be found out from a huge number of basic data structures. Linux typically manages these underlying data structures in a serial or array fashion, and useful information can be derived from traversing these data structures, identifying problematic data structures, modifying them, or otherwise deriving useful information. We implement this idea in an extensible modular architecture, which includes objects to traverse, ways to traverse, and operations on objects to traverse, as shown in fig. 4, which consists of four parts and demonstrates how to apply the above two scenarios.
The main debug module takes debug fs (debug FS, as the name implies, which is a virtual file system for kernel debugging, and kernel developers exchange data with user space through the debug fs) as a pipeline for interacting with user space (Linux user-mode address space), allows the command module to register command, and also allows the debug script to inquire or issue command instructions
And 2, the command module is a specific implementation of traversing the data structures and is used as a parameter to call a callback function registered by the action module after each data structure is obtained so as to determine a specific processing mode of each data structure. The command module itself will register as a command to the main debug module, and one command may have multiple options, for example, option 1 of the command of scene one is to traverse all the slab caches, option2 is to traverse only the slab caches under the cgroup, and only option 1 of the command of scene two is the iter page wait table.
And 3, the action module realizes a specific processing mode of each data structure in the traversal process, for example, a scene is corresponding to each slab cache, the corresponding action is the slab caches which are found out and have the usage of 0 and the cgroup of which is deleted, and a logout function is called to logout. And in the second scenario, the page wait table needs to be traversed, the page of the lock is found from the process data structure in the waiting state, and the storage device to which the page belongs is deduced from the page.
And 4, a debug script and an application layer tool, wherein the debug script can be used for inquiring the registered command or issuing the command.
By using the framework, we can clearly decouple the normal controller, the module body, the traversal method and the operation behavior, and conveniently extend, and can also provide only a few specific modules for solving specific problems, for example, solving the problem of the first scene only needs to provide the debug.ko, iter _ slab.ko, iter _ slab _ action.ko and user-mode debug _ script.sh scripts of fig. 4, other modules irrelevant to this problem do not need to be provided, after loading the ko modules, the command is issued by using the debug _ script.sh, for example, to eliminate the memory leakage problem of the first scene, the command is issued by using the debug _ script.sh [ cmd2, option2], the command is called to traverse all the cgroup slabs, and the corresponding action is used to judge whether the usage of the transmitted slap is 0, and whether the call of the child slap exists or not, if the cancel function exists. Therefore, after the whole system is traversed, the leaked memory can be released, and the production environment can be recovered to a normal use state.
The method provided by the invention needs to be fully verified before running in a production environment so as to avoid the situation that the environment is more unstable due to operation, and the command module and the action module need to be unloaded after the environment is repaired so as to avoid false triggering.
The invention provides a data structure repairing method suitable for a Linux production environment, and a flow chart shown in fig. 5 comprises the following steps:
step S10, establishing an interaction channel with a Linux user mode address space (user space), and sending and/or establishing an instruction to the Linux user mode address space (user space) based on the interaction channel;
step S20, traversing the data structures in the kernel space based on the instruction, acquiring each data structure, calling a callback function registered by a previous action module as a parameter, and determining the specific processing mode of each data structure based on the callback function;
and step S30, processing the data structure based on the specific processing mode.
Step S40, based on the interaction channel, querying the registered and/or established command (command).
In step S20, the method includes:
s201, registering an instruction in advance, wherein the instruction comprises traversal data information which is set corresponding to a problem to be processed; the data information and the corresponding target problems comprise related data of the slub cache and related data of the page cache in the scene 1 and the scene 2.
And S202, performing repair processing after traversing the corresponding kernel data based on the instruction.
In step S30, the method includes:
s301, processing the data structure based on the specific processing manner includes:
s302, obtaining the caches with the usage of 0 and deleted cgroup in all the caches, and calling a callback function to logout.
The present invention further provides a data structure repairing apparatus suitable for Linux production environment, as shown in fig. 6, including:
a main interaction module (main debug module) for establishing an interaction channel between a kernel space and a Linux user space (user space), wherein the Linux user space sends and/or establishes an instruction (command) to the kernel space based on the interaction channel;
a command call module (command module) for traversing the data structures in the kernel space based on the instruction, obtaining each data structure and then calling a callback function previously registered in the action module as a parameter, and determining the specific processing mode of each data structure based on the callback function;
and the processing module (action module) is used for processing the data structure based on the specific processing mode.
Further, the system also comprises an application layer tool module (debug script) used for inquiring the registered and/or established instruction based on the interaction channel.
Further, the instruction-based traversal of the data structure at the kernel space comprises:
registering an instruction in advance, wherein the instruction comprises traversal data information which is set corresponding to a problem to be processed;
and performing repair processing after traversing the corresponding kernel data based on the instruction.
Further, processing the data structure based on the specific processing manner includes:
and acquiring the caches of which the consumption is 0 in all the caches and the cgroup to which the caches belong is deleted, and calling a callback function to cancel.
The readable storage medium may be a computer storage medium or a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, a readable storage medium is coupled to the processor such that the processor can read information from, and write information to, the readable storage medium. Of course, the readable storage medium may also be an integral part of the processor. The processor and the readable storage medium may reside in an Application Specific Integrated Circuits (ASIC). Additionally, the ASIC may reside in user equipment. Of course, the processor and the readable storage medium may also reside as discrete components in a communication device. The readable storage medium may be a read-only memory (ROM), a random-access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
The present invention also provides a program product comprising execution instructions stored in a readable storage medium. The at least one processor of the device may read the execution instructions from the readable storage medium, and the execution of the execution instructions by the at least one processor causes the device to implement the methods provided by the various embodiments described above.
In the above embodiments of the terminal or the server, it should be understood that the Processor may be a Central Processing Unit (CPU), other general-purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (10)
1. A data structure repairing method suitable for a Linux production environment is characterized by comprising the following steps:
establishing an interaction channel between a kernel space and a Linux user space, wherein the Linux user space sends and/or establishes instructions to the kernel space based on the interaction channel;
traversing data structures at kernel space based on instructions, acquiring each data structure, then calling a previously registered callback function as a parameter, and determining a specific processing mode of each data structure based on the callback function;
and processing the data structure based on the specific processing mode.
2. The data structure repair method according to claim 1,
further comprising:
and inquiring the registered and/or established instruction based on the interaction channel.
3. The data structure repair method according to claim 1,
the instruction-based traversal of the data structure at the kernel space comprises:
registering an instruction in advance, wherein the instruction comprises traversal data information which is set corresponding to a problem to be processed;
and performing repair processing after traversing the corresponding kernel data based on the instruction.
4. The data structure repair method according to claim 1,
processing the data structure based on the specific processing mode comprises:
and acquiring the caches of which the consumption is 0 in all the caches and the cgroup to which the caches belong is deleted, and calling a callback function to cancel.
5. A data structure repair device suitable for a Linux production environment is characterized by comprising:
the main interaction module is used for establishing an interaction channel between the kernel space and a Linux user space, and the Linux user space sends and/or establishes instructions to the kernel space based on the interaction channel;
the command calling module is used for traversing the data structures at the kernel space based on the instruction, calling a previously registered callback function as a parameter after each data structure is obtained, and determining the specific processing mode of each data structure based on the callback function;
and the processing module is used for processing the data structure based on the specific processing mode.
6. The data structure repair apparatus according to claim 5,
the system also comprises an application layer tool module which is used for inquiring the registered and/or established instruction based on the interaction channel.
7. The data structure repair apparatus according to claim 5,
the instruction-based traversal of the data structure at the kernel space comprises:
registering an instruction in advance, wherein the instruction comprises traversal data information which is set corresponding to a problem to be processed;
and performing repair processing after traversing the corresponding kernel data based on the instruction.
8. The data structure repair apparatus according to claim 5,
processing the data structure based on the specific processing mode comprises:
and acquiring the caches of which the consumption is 0 in all the caches and the cgroup to which the caches belong is deleted, and calling a callback function to cancel.
9. An electronic device, characterized in that the electronic device comprises: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores a computer program executable by the at least one processor, the computer program being executable by the at least one processor to cause the at least one processor to perform the method of any one of claims 1-4.
10. A readable storage medium, in which a computer program is stored which, when being executed by a processor, is adapted to carry out the method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110218365.1A CN112817986B (en) | 2021-02-26 | 2021-02-26 | Data structure repairing method and device suitable for Linux production environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110218365.1A CN112817986B (en) | 2021-02-26 | 2021-02-26 | Data structure repairing method and device suitable for Linux production environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112817986A true CN112817986A (en) | 2021-05-18 |
| CN112817986B CN112817986B (en) | 2022-03-22 |
Family
ID=75864088
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110218365.1A Active CN112817986B (en) | 2021-02-26 | 2021-02-26 | Data structure repairing method and device suitable for Linux production environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112817986B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102567068A (en) * | 2011-12-13 | 2012-07-11 | 曙光信息产业(北京)有限公司 | System and method for handling kernel mmap call failure |
| US20150096028A1 (en) * | 2012-04-11 | 2015-04-02 | Joint Stock Company "Info TeCS" | Method of Detecting Malware in an Operating System Kernel |
| CN107194245A (en) * | 2017-05-12 | 2017-09-22 | 南京大学 | A kind of funcall remodeling method isolated for linux kernel page table |
| CN109491759A (en) * | 2018-10-26 | 2019-03-19 | 深圳康佳电子科技有限公司 | Process debugged method, device and computer equipment based on Virtual File System |
| CN109660535A (en) * | 2018-12-17 | 2019-04-19 | 郑州云海信息技术有限公司 | The treating method and apparatus of data in linux system |
| CN110110522A (en) * | 2016-05-24 | 2019-08-09 | 百度在线网络技术（北京）有限公司 | Kernel restorative procedure and device |
| CN111221642A (en) * | 2018-11-23 | 2020-06-02 | 珠海格力电器股份有限公司 | Data processing method and device, storage medium and terminal |
| CN111552608A (en) * | 2020-04-09 | 2020-08-18 | 烽火通信科技股份有限公司 | Drive memory monitoring method and system |
| CN112231007A (en) * | 2020-11-06 | 2021-01-15 | 中国人民解放军国防科技大学 | Device driving method based on user mode and kernel mode driving cooperative processing framework |
-
2021
- 2021-02-26 CN CN202110218365.1A patent/CN112817986B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102567068A (en) * | 2011-12-13 | 2012-07-11 | 曙光信息产业(北京)有限公司 | System and method for handling kernel mmap call failure |
| US20150096028A1 (en) * | 2012-04-11 | 2015-04-02 | Joint Stock Company "Info TeCS" | Method of Detecting Malware in an Operating System Kernel |
| CN110110522A (en) * | 2016-05-24 | 2019-08-09 | 百度在线网络技术（北京）有限公司 | Kernel restorative procedure and device |
| CN107194245A (en) * | 2017-05-12 | 2017-09-22 | 南京大学 | A kind of funcall remodeling method isolated for linux kernel page table |
| CN109491759A (en) * | 2018-10-26 | 2019-03-19 | 深圳康佳电子科技有限公司 | Process debugged method, device and computer equipment based on Virtual File System |
| CN111221642A (en) * | 2018-11-23 | 2020-06-02 | 珠海格力电器股份有限公司 | Data processing method and device, storage medium and terminal |
| CN109660535A (en) * | 2018-12-17 | 2019-04-19 | 郑州云海信息技术有限公司 | The treating method and apparatus of data in linux system |
| CN111552608A (en) * | 2020-04-09 | 2020-08-18 | 烽火通信科技股份有限公司 | Drive memory monitoring method and system |
| CN112231007A (en) * | 2020-11-06 | 2021-01-15 | 中国人民解放军国防科技大学 | Device driving method based on user mode and kernel mode driving cooperative processing framework |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112817986B (en) | 2022-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4436036B2 (en) | Information processing apparatus, trace processing method, program, and recording medium | |
| KR100306456B1 (en) | Method for rebooting an operating system | |
| US20200183795A1 (en) | Method and apparatus for processing information | |
| CN103493021B (en) | Method and system for fault monitoring and reparation | |
| US9213562B2 (en) | Garbage collection safepoint system using non-blocking asynchronous I/O call to copy data when the garbage collection safepoint is not in progress or is completed | |
| CN101271409A (en) | Live migration of a logical partition, method and product thereof | |
| US11645068B2 (en) | Method for implementing function jump, apparatus, and computer storage medium | |
| JP2010061230A (en) | Information processor and information processing method | |
| JPH02502678A (en) | Multiprocessing methods and configurations | |
| CN111679852B (en) | Detection method and device for conflict dependency library | |
| CN110716845A (en) | Method for reading log information of Android system | |
| CN109582542B (en) | Method for dumping core of embedded system | |
| KR102254159B1 (en) | Method for detecting real-time error in operating system kernel memory | |
| US7269722B1 (en) | Preview of UNIX boot process from multi-user level | |
| CN112817986B (en) | Data structure repairing method and device suitable for Linux production environment | |
| CN116880877A (en) | Virtual machine enhancement tool upgrading method and device, computer equipment and storage medium | |
| US8689206B2 (en) | Isolating operating system in-memory modules using error injection | |
| CN116795576A (en) | Log printing-based device driver debugging method and device and electronic device | |
| WO2023016485A1 (en) | Method for acquiring function call information, and apparatus, electronic device and medium | |
| CN116339908A (en) | Virtual machine starting method, device, computer equipment and storage medium | |
| CN115421960A (en) | UE memory fault recovery method, device, electronic equipment and medium | |
| CN112130900B (en) | User information management method, system, equipment and medium for BMC | |
| JP7492839B2 (en) | Configuration management device, configuration management method, and configuration management program | |
| CN115269136A (en) | Heterogeneous multi-core platform partition operating system safety scheduling method and system | |
| CN115033337A (en) | Virtual machine memory migration method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |