CN113157979B - Method, system and medium for constructing kernel module relation graph based on dummy module node - Google Patents

Abstract

The application discloses a method, a system and a medium for constructing a kernel module relation diagram based on a dummy module node, wherein the method comprises the steps of inputting a kernel module set M; establishing a module node for each kernel module in the kernel module set M to obtain a kernel module node set { N } _m N, where N _m Representing an mth kernel module; introducing a dummy module node; extracting kernel module node set { N } _m And establishing a reference relation between the kernel modules in the graph database based on the symbol corresponding relation between the in function and the out function, establishing the reference relation between the kernel modules based on the External data and the Export data, and recording nodes without the reference relation through dummy module nodes. The application supports the on-demand expansion and reduction of the function call relationship diagram of the kernel module and the data sharing relationship diagram of the kernel module, and has the advantages of quick and efficient reconstruction.

Description

A method and system for constructing a kernel module relationship graph based on dumb module nodes and medium

Technical field

The invention relates to the technical field of version compatibility assurance during operating system kernel and kernel module upgrades, and specifically relates to a method, system and medium for constructing a kernel module relationship graph based on dumb module nodes.

Background technique

In the application process of information systems, there are problems such as the upgrading of the operating system kernel, which leads to a heavy workload and high complexity in the migration of peripheral hardware and upper-layer applications. The main reason is that the upgrade brings about changes in kernel functions and data structures. When the kernel module After the functions and data in the function are changed, other operating system components that call the function will be affected and may fail to execute or execute abnormally. The above situation is a kernel module compatibility issue. Solving kernel module compatibility issues requires accurately clarifying the impact of function and data changes. Since kernel modules form an intricate relationship graph based on function calls and data structure sharing, the prerequisite for accurately calculating the compatibility impact of kernel module changes is to be able to describe the relationship between kernel module sets.

From an implementation perspective, the kernel consists of functions and data, and functions contain program codes that implement functions. In order to reduce the complexity of a single function implementation, a large function is often split into multiple function implementations, and the main function calls these functions to complete complex functions. A function is often split into multiple functions and encapsulated in multiple kernel modules. Therefore function calls and data sharing across modules are very common.

Functions and data exist in the form of symbols in the kernel. According to different functions, the functions in the kernel module include two categories. One is the kernel function function, which is called in function (InFun) in this article. It is a function whose implementation body is in the kernel module. It may be called by other kernel modules. ; One is the kernel call function, called out function (CallFun) in this article, which is a function that is implemented in other kernel modules and called by functions in this module. According to different scopes, the data in the kernel module is divided into local data, global data and external data. Local data is private data in this kernel module and will not be perceived by external modules. It is not within the scope of this article; global data is the basis. The data defined in the module and shared and used by multiple modules is called Export data in this article; the external data is the data defined in the external module used in this module, and is called External data in this article.

There are a large number of function calling relationships and data sharing relationships between kernel modules. In order to accurately describe the above relationship set, it becomes the primary task to construct the module relationship diagram through the function calls and data sharing relationships between modules. What is particularly noteworthy is that when the kernel is upgraded, the increase or decrease in kernel modules and the increase or decrease in kernel functions will cause changes in the kernel module diagram and need to be rebuilt. However, how to specifically implement the above requirements for the construction of module relationship diagrams is still a key technical issue that needs to be solved urgently.

Contents of the invention

Technical problems to be solved by the present invention: In view of the above-mentioned problems of the prior art, a method, system and medium for constructing a kernel module relationship graph based on dumb module nodes are provided. The present invention supports the kernel module function call relationship graph by introducing dumb module nodes. The on-demand expansion and reduction of the kernel module data sharing relationship graph has the advantage of fast and efficient reconstruction. When the present invention constructs a kernel module dependency directed graph based on the function call relationship between the kernel and the kernel module, when the kernel module assembly occurs When changes occur, it is supported to build a changed module dependency graph based on the old version of the kernel module dependency graph by adding or subtracting kernel modules, functions, and shared data symbols to improve the construction efficiency of the module dependency graph.

In order to solve the above technical problems, the technical solution adopted by the present invention is:

A method for constructing a kernel module relationship graph based on dumb module nodes, including:

1) Enter the kernel module set M;

2) Establish a module node for each kernel module in the kernel module set M, and obtain the kernel module node set {N _m }, where N _m represents the m-th kernel module; introduce dumb module nodes;

3) Extract the in function and out function of each kernel module in the kernel module node set {N _m } to obtain the in function table and out function table; according to the symbols between any in function and out function in the in function table and out function table The correspondence relationship establishes the reference relationship between kernel modules in the graph database, and establishes the reference relationship between the dumb module node and the corresponding kernel module when the correspondence relationship between the in function and the out function cannot be established, and obtains the function call relationship graph G _Fdep ; Establish External data tables and Export data tables based on the External data and Export data in the kernel module node set {N _m }, and establish reference relationships between kernel modules in the graph database based on the symbolic correspondence between External data and Export data. And for the situation where the correspondence between External data and Export data cannot be established, the reference relationship between the dumb module node and the corresponding kernel module is established, and the data sharing relationship graph G _Ddep is obtained;

4) Combine the function call relationship graph G _Fdep and the data sharing relationship graph G _Ddep to form the kernel module dependency graph G _M .

Optionally, the dummy module nodes introduced in step 2) include undiscovered nodes and unused nodes. The undiscovered nodes are used to store all function symbols that have not yet been defined. The unused nodes are used to store all function symbols that have not yet been defined. Stores function symbols that have not yet been referenced.

Optionally, in step 3), a reference relationship between kernel modules is established in the graph database based on the symbolic correspondence between any in function and out function in the in function table and out function table, and the in function and out function cannot be established. In the case of function correspondence, the steps to establish the reference relationship between the dumb module node and the corresponding kernel module include: first, traverse each out function in the out function table as the current out function, and search for the corresponding out function in the in function table for the current out function. in function, if the corresponding in function is found, a reference relationship between the kernel module corresponding to the current out function and the kernel module corresponding to the found in function is established in the graph database; otherwise, a reference relationship between the kernel module corresponding to the current out function and the kernel module corresponding to the found in function is established in the graph database. The kernel module has not yet discovered the reference relationship between nodes; then, check whether there is an unmatched in function in the in function table. If there is an unmatched in function, create a kernel corresponding to the in function in the graph database. The reference relationship between modules and nodes is not yet used, thus obtaining the function call relationship graph G _Fdep .

Optionally, in step 3), establish a reference relationship between kernel modules in the graph database based on the symbolic correspondence between External data and Export data, and establish a dumb module node if the correspondence between External data and Export data cannot be established. The steps to establish a reference relationship with the corresponding kernel module include: first, traverse each External data in the External data table as the current External data, and search for the corresponding Export data in the Export data table for the current External data. If the corresponding Export is found data, then establish a reference relationship between the kernel module corresponding to the current External data and the kernel module corresponding to the found Export data in the graph database; otherwise, establish a reference relationship between the kernel module corresponding to the current External data and the yet-to-be-discovered node in the graph database. Reference relationship; then, check whether there is unmatched Export data in the Export data table. If there is unmatched Export data, establish a relationship between the kernel module corresponding to the Export data and the unused nodes in the graph database. Reference relationship, get the data sharing relationship graph G _Ddep .

Optionally, step 4) also includes the step of updating the kernel module dependency graph G _M when a new kernel module is added:

A1) Enter the newly added kernel module m and the kernel module dependency graph G _M to be updated;

A2) Establish module node n _m for kernel module m, and add module node n _m to the module node set {N _M } of the kernel module dependency graph G _M to be updated;

A3) Update the function call relationship graph G _Fdep according to the in function and out function _of the module node n _m , obtain the updated function call relationship graph G Fdep, and update the data sharing relationship graph G _Ddep according to the Export data and External data of the module node n _m , get the updated data sharing relationship diagram G _Ddep ;

A4) The updated function call relationship graph G _Fdep and the updated data sharing relationship graph G _Ddep constitute the updated kernel module dependency relationship graph G _M .

Optionally, step A3) includes: updating the in function of the module node n _m to the in function table of the module node set {N _M }, and updating the out function of the module node n _m to the module node set {N _M }. in the out function table; establish a corresponding relationship between the out function of module node n _m and the in function symbol in the in function table of {N _M }, and establish a reference relationship between modules in the graph database; if the in function of module node n _m is temporarily No corresponding out function is found in the node, and a reference relationship is established between the module node n _m and the kernel module corresponding to the out function in the node that has not yet been discovered; if the module node n _m has an unmatched in function in the in function set, then in Establish a reference relationship between the kernel module corresponding to the unmatched in function and the unused node in the graph database, and obtain the updated function call relationship graph G _Fdep ; update the Export data of module node n _m to the module node set { In the Export data table of N _M }, update the External data of module node n _m to the External data table of module node set {N _M }; establish the External data of module node n _m and the Export data table of {N _M } Export data symbol correspondence relationship, establish a reference relationship between modules in the graph database; if the Export data of module node n _m has corresponding External data in the yet-to-be-discovered node, it is the External data in module node n _m and the yet-to-be-discovered node. The corresponding kernel module establishes a reference relationship; if the module node n _m has unmatched Export data in the Export data set, a reference between the kernel module corresponding to the unmatched Export data and the unused node is established in the graph database. relationship, and obtain the updated data sharing relationship graph G _Ddep .

Optionally, step 4) also includes the step of updating the kernel module dependency graph G _M when the kernel module is deleted:

B1) Enter the kernel module m to be deleted and the kernel module dependency graph G _M to be updated;

B2) Delete the module node n _m corresponding to the kernel module m from the module node set {N _M } of the kernel module dependency graph G _M to be updated;

B3) Update the function call relationship graph G _Fdep according to the in function and out function _of module node n _m , obtain the updated function call relationship graph G Fdep, and update the data sharing relationship graph G _Ddep according to the Export data and External data of module node n _m , get the updated data sharing relationship diagram G _Ddep ;

B4) The updated function call relationship graph G _Fdep and the updated data sharing relationship graph G _Ddep constitute the updated kernel module dependency relationship graph G _M .

Optionally, step B3) includes: removing the in function of the module node n _m from the in function table of the module node set {N _M }, and removing the out function of the module node n _m from the module node set {N _M }. Removed from the out function table; for the in function contained in the corresponding module node n _m in the unused node, if the in function is not used, it is directly deleted from the unused node, otherwise for the in function that uses the in function For any other kernel module j, modify the reference relationship between kernel module j and module node n _m in the graph database to the reference relationship between kernel module j and no nodes yet found, and obtain the updated function call relationship graph G _Fdep ; Remove the Export data of module node n _m from the Export data table of module node set {N _M }, and remove the External data of module node n _m from the External data table of module node set {N _M }; for The Export data contained in the corresponding module node n _m in the unused node is not used yet. If the Export data is not used, it is directly deleted from the unused node. Otherwise, for any other kernel module j that uses the Export data, in the figure In the database, the reference relationship between kernel module j and module node n _m is modified to the reference relationship between kernel module j and undiscovered nodes, and the updated data sharing relationship graph G _Ddep is obtained.

In addition, the present invention also provides a system for building a kernel module relationship graph based on dumb module nodes, including a microprocessor and a memory connected to each other, and the microprocessor is programmed or configured to execute the kernel module based on dumb module nodes. Steps of the relationship diagram construction method.

In addition, the present invention also provides a computer-readable storage medium in which a computer program programmed or configured to execute the method for constructing a kernel module relationship graph based on dumb module nodes is stored in the computer-readable storage medium.

Compared with the existing technology, the present invention has the following advantages: the present invention includes inputting a kernel module set M; establishing a module node for each kernel module in the kernel module set M, and obtaining a kernel module node set {N _m }, where N _m represents the mth kernel module; introduce dumb module nodes; extract the in function and out function of each kernel module in the kernel module node set {N _m } to obtain the in function table and out function table; according to the in function table and out function table The symbolic correspondence between any in function and out function in the graph database establishes the reference relationship between kernel modules, and establishes the reference relationship between the dumb module node and the corresponding kernel module when the correspondence between the in function and the out function cannot be established. Reference relationship, get the function call relationship graph G _Fdep ; establish the External data table and Export data table based on the External data and Export data in the kernel module node set {N _m }, according to the symbolic correspondence between the External data and the Export data in the figure Establish the reference relationship between kernel modules in the database, and establish the reference relationship between the dumb module node and the corresponding kernel module when the correspondence between External data and Export data cannot be established, and obtain the data sharing relationship graph G _Ddep ; the function call relationship The graph G _Fdep and the data sharing relationship graph G _Ddep constitute the kernel module dependency graph G _M . Through the above method, a basic method of modeling and constructing the kernel module relationship graph based on function calling relationships and data sharing is proposed. Moreover, the present invention introduces Dumb module nodes support on-demand expansion and reduction of the kernel module function call relationship graph and the kernel module data sharing relationship graph, and have the advantage of fast and efficient reconstruction. Moreover, when the present invention constructs a kernel module dependency directed graph based on the function calling relationship between the kernel and the kernel module, when the kernel module set changes, it supports adding or subtracting kernel modules, functions and Share data symbols to build the changed module dependency graph, improving the efficiency of module dependency graph construction.

Description of the drawings

Figure 1 is a schematic flowchart of a method for constructing a kernel module dependency graph based on dumb module nodes in an embodiment of the present invention.

Figure 2 is a schematic flowchart of a kernel module dependency graph expansion method based on dumb module nodes in an embodiment of the present invention.

Figure 3 is a schematic flowchart of a kernel module dependency graph reduction method based on dumb module nodes in an embodiment of the present invention.

Detailed ways

As shown in Figure 1, the method for constructing a kernel module relationship diagram based on dumb module nodes in this embodiment includes:

1) Enter the kernel module set M;

2) Establish a module node for each kernel module in the kernel module set M, and obtain the kernel module node set {N _m }, where N _m represents the m-th kernel module; introduce dumb module nodes;

3) Extract the in function and out function of each kernel module in the kernel module node set {N _m } to obtain the in function table and out function table; according to the symbols between any in function and out function in the in function table and out function table The correspondence relationship establishes the reference relationship between kernel modules in the graph database, and establishes the reference relationship between the dumb module node and the corresponding kernel module when the correspondence relationship between the in function and the out function cannot be established, and obtains the function call relationship graph G _Fdep ; Establish External data tables and Export data tables based on the External data and Export data in the kernel module node set {N _m }, and establish reference relationships between kernel modules in the graph database based on the symbolic correspondence between External data and Export data. And for the situation where the correspondence between External data and Export data cannot be established, the reference relationship between the dumb module node and the corresponding kernel module is established, and the data sharing relationship graph G _Ddep is obtained;

4) Combine the function call relationship graph G _Fdep and the data sharing relationship graph G _Ddep to form the kernel module dependency graph G _M .

In this embodiment, the dummy module nodes introduced in step 2) include not yet discovered nodes (notfound_dummy) and not yet used nodes (unused_dummy). The temporarily undiscovered nodes are used to store all undefined function symbols, so The aforementioned unused nodes are used to store function symbols that have not yet been referenced.

In this embodiment, in step 3), a reference relationship between kernel modules is established in the graph database based on the symbolic correspondence between any in function and out function in the in function table and out function table, and the in function and out function cannot be established. The steps for establishing the reference relationship between the dumb module node and the corresponding kernel module include: first, traverse each out function in the out function table as the current out function, and search for the current out function in the in function table The corresponding in function. If the corresponding in function is found, a reference relationship between the kernel module corresponding to the current out function and the kernel module corresponding to the found in function is established in the graph database. Otherwise, a reference relationship between the current out function and the kernel module corresponding to the found in function is established in the graph database. Kernel module, no reference relationship between nodes has been found yet; then, check whether there is an unmatched in function in the in function table. If there is an unmatched in function, create a corresponding in function in the graph database. The reference relationship between the kernel module and the unused nodes is thus obtained, and the function call relationship graph G _Fdep is obtained.

In this embodiment, in step 3), a reference relationship between kernel modules is established in the graph database based on the symbolic correspondence between External data and Export data, and a dumb module is established in the case where the correspondence between External data and Export data cannot be established. The steps for the reference relationship between the node and the corresponding kernel module include: first, traverse each External data in the External data table as the current External data, and search for the corresponding Export data in the Export data table for the current External data. If the corresponding To export data, a reference relationship between the kernel module corresponding to the current External data and the kernel module corresponding to the found Export data is established in the graph database. Otherwise, a reference relationship between the kernel module corresponding to the current External data and the node not yet found is established in the graph database. The reference relationship between The reference relationship is obtained, and the data sharing relationship graph G _Ddep is obtained.

As shown in Figure 2, after step 4) of this embodiment, the step of updating the kernel module dependency graph G _M when adding a new kernel module is also included:

A1) Enter the newly added kernel module m and the kernel module dependency graph G _M to be updated;

A2) Establish module node n _m for kernel module m, and add module node n _m to the module node set {N _M } of the kernel module dependency graph G _M to be updated;

A3) Update the function call relationship graph G _Fdep according to the in function and out function _of the module node n _m , obtain the updated function call relationship graph G Fdep, and update the data sharing relationship graph G _Ddep according to the Export data and External data of the module node n _m , get the updated data sharing relationship diagram G _Ddep ;

A4) The updated function call relationship graph G _Fdep and the updated data sharing relationship graph G _Ddep constitute the updated kernel module dependency relationship graph G _M .

In this embodiment, step A3) includes: updating the in function of the module node n _m to the in function table of the module node set {N _M }, and updating the out function of the module node n _m to the module node set {N _M }. _in the _out function table _of The corresponding out function has not yet been found in the node, and a reference relationship is established between the module node n _m and the kernel module corresponding to the out function in the node that has not been found yet; if the module node n _m has an unmatched in function in the in function set, then Establish a reference relationship between the kernel module corresponding to the unmatched in function and the unused node in the graph database, and obtain the updated function call relationship graph G _Fdep ; update the Export data of module node n _m to the module node set In the Export data table of {N _M }, update the External data of the module node n _m to the External data table of the module node set {N _M }; establish the External data of the module node n _m and the Export data table of {N _M } The corresponding relationship between the Export data symbols in the graph database establishes the reference relationship between modules; if the Export data of the module node n _m has corresponding External data in the yet-to-be-discovered node, it is the External data in the module node n _m and the yet-to-be-discovered node. The kernel module corresponding to the data establishes a reference relationship; if the module node n _m has unmatched Export data in the Export data set, then the kernel module corresponding to the unmatched Export data and the unused node are established in the graph database. Reference relationship, get the updated data sharing relationship graph G _Ddep .

As shown in Figure 3, step 4) in this embodiment also includes the step of updating the kernel module dependency graph G _M when deleting the kernel module:

B1) Enter the kernel module m to be deleted and the kernel module dependency graph G _M to be updated;

B2) Delete the module node n _m corresponding to the kernel module m from the module node set {N _M } of the kernel module dependency graph G _M to be updated;

B3) Update the function call relationship graph G _Fdep according to the in function and out function _of module node n _m , obtain the updated function call relationship graph G Fdep, and update the data sharing relationship graph G _Ddep according to the Export data and External data of module node n _m , get the updated data sharing relationship diagram G _Ddep ;

B4) The updated function call relationship graph G _Fdep and the updated data sharing relationship graph G _Ddep constitute the updated kernel module dependency relationship graph G _M .

In this embodiment, step B3) includes: removing the in function of the module node n _m from the in function table of the module node set {N _M }, and removing the out function of the module node n _m from the module node set {N _M } Removed from the out function table; for the in function contained in the corresponding module node n _m in the unused node, if the in function is not used, delete it directly from the unused node, otherwise use the in function For any other kernel module j, modify the reference relationship between kernel module j and module node n _m in the graph database to the reference relationship between kernel module j and no nodes yet found, and obtain the updated function call relationship graph G _Fdep ; Remove the Export data of module node n _m from the Export data table of module node set {N _M }, and remove the External data of module node n _m from the External data table of module node set {N _M }; For the Export data contained in the corresponding module node n _m in the unused node, if the Export data is not used, it is directly deleted from the unused node. Otherwise, for any other kernel module j that uses the Export data, in In the graph database, the reference relationship between kernel module j and module node n _m is modified to the reference relationship between kernel module j and undiscovered nodes, and the updated data sharing relationship graph G _Ddep is obtained.

To sum up, kernel modules form an intricate relationship graph based on function calls and data structure sharing. In this embodiment, the kernel module is used as a node in the graph. If kernel module A calls any kernel function in kernel module B, then a directed edge is connected between A and B, where A is the starting node of the edge. , B is the terminal node of the edge, which indicates that kernel module A depends on kernel module B due to function calls. Perform the above operations on all modules in the same kernel version to obtain the kernel module function dependency graph G _Fdep . In this patent, the kernel module is used as a node in the graph. If kernel modules A and B share the global data defined in B, then a directed edge is connected between A and B, where A is the starting node of the edge. B is the terminal node of the edge, which indicates that kernel module A depends on kernel module B due to shared data. Perform the above operations on all modules in the same kernel version, and the kernel module data sharing relationship diagram G _Ddep will be obtained. The function call relationship graph G _Fdep and the data sharing relationship graph G _Ddep together constitute the kernel module relationship graph ( _GM ). Therefore, the kernel module relationship graph ( _GM ) includes the structure of two relationship graphs, G _Ddep and G _Fdep . According to the requirements of actual use, the construction process of the relationship diagrams G _Ddep and G _Fdep includes three types of processes: initialization, module addition and deletion, and module deletion. Through the above method, this embodiment proposes a basic method of constructing a kernel module relationship graph model based on function calling relationships and data sharing. Moreover, the present invention supports kernel module function calling relationship graphs and kernel module data sharing by introducing dumb module nodes. The on-demand expansion and contraction of the relationship diagram has the advantage of fast and efficient reconstruction. Moreover, when building a kernel module dependency directed graph based on the function call relationship between the kernel and kernel modules, when the kernel module set changes, it is supported to add or remove kernel modules, functions and shared data based on the old version of the kernel module dependency graph. Symbols are used to construct the changed module dependency graph to improve the efficiency of module dependency graph construction.

In addition, this embodiment also provides a system for constructing a kernel module relationship graph based on dumb module nodes, including a microprocessor and a memory connected to each other. The microprocessor is programmed or configured to execute the aforementioned kernel module based on dumb module nodes. Steps of the relationship diagram construction method.

In addition, this embodiment also provides a computer-readable storage medium that stores a computer program programmed or configured to execute the aforementioned method for constructing a kernel module relationship graph based on dummy module nodes.

Those skilled in the art will understand that embodiments of the present application may be provided as methods, systems, or computer program products. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment that combines software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-readable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein. This application refers to flowcharts of methods, devices (systems), and computer program products according to embodiments of the application and/or instructions executed by a processor for implementing a process or processes in the flowchart and/or a block diagram. A device for the functions specified in a box or boxes. These computer program instructions may also be stored in a computer-readable memory that causes a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction means, the instructions The device implements the functions specified in a process or processes of the flowchart and/or a block or blocks of the block diagram. These computer program instructions may also be loaded onto a computer or other programmable data processing device, causing a series of operating steps to be performed on the computer or other programmable device to produce computer-implemented processing, thereby executing on the computer or other programmable device. Instructions provide steps for implementing the functions specified in a process or processes of a flowchart diagram and/or a block or blocks of a block diagram.

The above are only preferred embodiments of the present invention. The protection scope of the present invention is not limited to the above-mentioned embodiments. All technical solutions that fall under the idea of the present invention belong to the protection scope of the present invention. It should be pointed out that for those of ordinary skill in the art, several improvements and modifications may be made without departing from the principles of the present invention, and these improvements and modifications should also be regarded as the protection scope of the present invention.

Claims (7)

1. A method for constructing a kernel module relationship graph based on dumb module nodes, which is characterized by including: 1) Enter the kernel module set M; 2) Establish a module node for each kernel module in the kernel module set M, and obtain the kernel module node set {N _m }, where N _m represents the m-th kernel module; introduce dumb module nodes; 3) Extract the in function and out function of each kernel module in the kernel module node set {N _m } to obtain the in function table and out function table; according to the symbols between any in function and out function in the in function table and out function table The correspondence relationship establishes the reference relationship between kernel modules in the graph database, and establishes the reference relationship between the dumb module node and the corresponding kernel module when the correspondence relationship between the in function and the out function cannot be established, and obtains the function call relationship graph G _Fdep ; Establish External data tables and Export data tables based on the External data and Export data in the kernel module node set {N _m }, and establish reference relationships between kernel modules in the graph database based on the symbolic correspondence between External data and Export data. And for the situation where the correspondence between External data and Export data cannot be established, the reference relationship between the dumb module node and the corresponding kernel module is established, and the data sharing relationship diagram G _Ddep is obtained; where the in function refers to the kernel function function, and the out function refers to the kernel call Function, Export data refers to global data defined in this module and shared and used by multiple modules; External data refers to external data defined in external modules used in this module; 4) Combine the function call relationship graph G _Fdep and the data sharing relationship graph G _Ddep to form the kernel module dependency graph G _M ; The dumb module nodes introduced in step 2) include undiscovered nodes and unused nodes. The undiscovered nodes are used to store all function symbols that have not yet been defined. The unused nodes are used to store functions that have not yet been defined. Referenced function symbols; in step 3), a reference relationship between kernel modules is established in the graph database based on the symbolic correspondence between any in function and out function in the in function table and out function table, and the in function and out function cannot be established. The steps for establishing the reference relationship between the dumb module node and the corresponding kernel module include: first, traverse each out function in the out function table as the current out function, and search for the current out function in the in function table The corresponding in function. If the corresponding in function is found, a reference relationship between the kernel module corresponding to the current out function and the kernel module corresponding to the found in function is established in the graph database. Otherwise, a reference relationship between the current out function and the kernel module corresponding to the found in function is established in the graph database. Kernel module, no reference relationship between nodes has been found yet; then, check whether there is an unmatched in function in the in function table. If there is an unmatched in function, create a corresponding in function in the graph database. The reference relationship between the kernel module and the unused node is obtained, thereby obtaining the function call relationship graph G _Fdep ; in step 3), the reference between the kernel modules is established in the graph database based on the symbolic correspondence between the External data and the Export data. relationship, and for situations where the corresponding relationship between External data and Export data cannot be established, the steps to establish the reference relationship between the dumb module node and the corresponding kernel module include: first, traverse each External data in the External data table as the current External data, and target The current External data searches for the corresponding Export data in the Export data table. If the corresponding Export data is found, a reference relationship between the kernel module corresponding to the current External data and the kernel module corresponding to the found Export data is established in the graph database. Otherwise, Establish the kernel module corresponding to the current External data in the graph database, and no reference relationship between nodes has been found yet; then, check whether there is unmatched Export data in the Export data table. If there is unmatched Export data, then Establish a reference relationship between the kernel module corresponding to the Export data and the unused nodes in the graph database, and obtain the data sharing relationship graph G _Ddep . 2. The kernel module relationship graph construction method based on dumb module nodes according to claim 1, characterized in that, after step 4), it also includes the step of updating the kernel module dependency graph G _M when adding a new kernel module: A1) Enter the newly added kernel module m and the kernel module dependency graph G _M to be updated; A2) Establish module node n _m for kernel module m, and add module node n _m to the module node set {N _M } of the kernel module dependency graph G _M to be updated; A3) Update the function call relationship graph G _Fdep according to the in function and out function _of module node n _m , obtain the updated function call relationship graph G Fdep, and update the data sharing relationship graph G _Ddep according to the Export data and External data of module node n _m , get the updated data sharing relationship diagram G _Ddep ; A4) The updated function call relationship graph G _Fdep and the updated data sharing relationship graph G _Ddep constitute the updated kernel module dependency relationship graph G _M . 3. The method for constructing a kernel module relationship graph based on dumb module nodes according to claim 2, characterized in that step A3) includes: updating the in function of the module node n _m to the in function of the module node set {N _M } In the table, update the out function of module node n _m to the out function table of module node set {N _M }; establish the corresponding relationship between the out function of module node n _m and the in function symbol in the in function table of {N _M }, Establish a reference relationship between modules in the graph database; if the in function of module node n _m has a corresponding out function in an undiscovered node, establish a reference for the kernel module corresponding to the out function in module node n _m and the undiscovered node. relationship; if module node n _m has an unmatched in function in the in function set, establish a reference relationship between the kernel module corresponding to the unmatched in function and the unused node in the graph database, and obtain the updated Function call graph G _Fdep ; update the Export data of module node n _m to the Export data table of module node set {N _M }, and update the External data of module node n _m to the External data of module node set {N _M }. table; establish a corresponding relationship between the External data of module node n _m and the Export data symbol in the Export data table of {N _M }, and establish a reference relationship between modules in the graph database; if the Export data of module node n _m has not yet been found There is corresponding External data in the node, and a reference relationship is established between the module node n _m and the kernel module corresponding to the External data in the node that has not yet been discovered; if the module node n _m has unmatched Export data in the Export data table, then in the graph database Establish a reference relationship between the kernel module corresponding to the unmatched Export data and the unused node, and obtain the updated data sharing relationship graph G _Ddep . 4. The kernel module relationship graph construction method based on dumb module nodes according to claim 1, characterized in that, after step 4), it also includes the step of updating the kernel module dependency relationship graph G _M when the kernel module is deleted: B1) Enter the kernel module m to be deleted and the kernel module dependency graph G _M to be updated; B2) Delete the module node n _m corresponding to the kernel module m from the module node set {N _M } of the kernel module dependency graph G _M to be updated; B3) Update the function call relationship graph G _Fdep according to the in function and out function _of module node n _m , obtain the updated function call relationship graph G Fdep, and update the data sharing relationship graph G _Ddep according to the Export data and External data of module node n _m , get the updated data sharing relationship diagram G _Ddep ; B4) The updated function call relationship graph G _Fdep and the updated data sharing relationship graph G _Ddep constitute the updated kernel module dependency relationship graph G _M . 5. The kernel module relationship graph construction method based on dumb module nodes according to claim 4, characterized in that step B3) includes: extracting the in function of module node n _m from the in function table of module node set {N _M } Remove from, remove the out function of module node n _m from the out function table of module node set {N _M }; for the in function contained in the corresponding module node n _m in the unused node, if the in function has not been If used, directly delete it from the unused node, otherwise for any other kernel module j that uses the in function, modify the reference relationship between kernel module j and module node n _m in the graph database to kernel module j , the reference relationship between nodes has not been found yet, and the updated function call relationship graph G _Fdep is obtained; the Export data of module node n _m is removed from the Export data table of module node set {N _M }, and module node n is The External data of _m is removed from the External data table of the module node set {N _M }; for the Export data contained in the corresponding module node n _m in the unused node, if the Export data is not used, it is directly removed from the temporary Delete the unused node, otherwise for any other kernel module j that uses the Export data, modify the reference relationship between kernel module j and module node n _m in the graph database to the reference relationship between kernel module j and the node that has not been found yet. Reference relationship, get the updated data sharing relationship graph G _Ddep . 6. A kernel module relationship graph construction system based on dumb module nodes, including an interconnected microprocessor and a memory, characterized in that the microprocessor is programmed or configured to execute any one of claims 1 to 5 The steps of the method for constructing a kernel module relationship graph based on dumb module nodes. 7. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a kernel module relationship diagram that is programmed or configured to execute the dumb module node-based kernel module diagram in any one of claims 1 to 5. A computer program for constructing a method.