CN117009240A - Code analysis method, system, device, electronic equipment and storage medium - Google Patents
Code analysis method, system, device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN117009240A CN117009240A CN202311052848.4A CN202311052848A CN117009240A CN 117009240 A CN117009240 A CN 117009240A CN 202311052848 A CN202311052848 A CN 202311052848A CN 117009240 A CN117009240 A CN 117009240A
- Authority
- CN
- China
- Prior art keywords
- data
- change
- code
- call link
- analyzed
- 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.)
- Pending
Links
- 238000004458 analytical method Methods 0.000 title claims abstract description 146
- 230000008859 change Effects 0.000 claims abstract description 230
- 238000000034 method Methods 0.000 claims description 64
- 238000002347 injection Methods 0.000 claims description 9
- 239000007924 injection Substances 0.000 claims description 9
- 238000004590 computer program Methods 0.000 claims description 8
- 238000012216 screening Methods 0.000 claims description 6
- 230000000977 initiatory effect Effects 0.000 claims 1
- 230000006870 function Effects 0.000 abstract description 18
- 238000012795 verification Methods 0.000 description 17
- 238000010586 diagram Methods 0.000 description 12
- 230000008569 process Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 238000013507 mapping Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 230000001419 dependent effect Effects 0.000 description 2
- 238000010438 heat treatment Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 239000008186 active pharmaceutical agent Substances 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
- G06F11/3672—Test management
- G06F11/3692—Test management for test results analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
- G06F11/3672—Test management
- G06F11/3688—Test management for test execution, e.g. scheduling of test suites
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The embodiment of the application provides a code analysis method, a system, a device, electronic equipment and a storage medium, which relate to the technical field of computers, and are used for acquiring submitted record data of data to be analyzed by determining call link data of basic code data, determining change call link data corresponding to the data to be analyzed based on the submitted record data of the data to be analyzed and the call link data, carrying out hierarchical analysis on the change call link data based on the call link data to obtain a change result of the data to be analyzed, and displaying the change result; according to the embodiment of the application, the change condition of the data to be analyzed relative to the basic code data can be accurately positioned in time through link analysis, the submitted record data submitted each time can be rapidly positioned through hierarchical analysis, the influence on the related product functions of the current application basic code data is improved, the accuracy of the code change analysis result is improved, and meanwhile, the efficiency of code analysis is improved.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a code analysis method, a system, an apparatus, an electronic device, and a storage medium.
Background
In the updating iteration of the financial product, since the same basic code is commonly used by a plurality of products, when the code of any product is updated and iterated, the basic code can be changed, and other non-updated products using the basic code can be used. Therefore, when the code of the product is updated and iterated, code modification analysis is needed to be carried out according to the product of the code updating and iterating, and the related influence surface is evaluated.
The existing code modification analysis method is usually carried out by manually evaluating the code analysis tool, however, when the existing code analysis tool is used for a financial system integrating large-scale products, the analysis accuracy is limited, and different code analysis tools corresponding to all code types are needed to be adopted for code analysis respectively, so that time and labor are wasted, and because the code analysis method is carried out manually, time and energy are wasted, the workload of developers and testers is increased, and the efficiency of code analysis is influenced.
Disclosure of Invention
In view of the above problems, embodiments of the present application provide a code analysis method, system, apparatus, electronic device, and storage medium, so as to improve the problems of limited accuracy and low efficiency of code modification analysis results in the related art.
According to an aspect of an embodiment of the present application, there is provided a code analysis method including:
determining calling link data of basic code data;
acquiring submitting record data of data to be analyzed, and determining change call link data corresponding to the data to be analyzed based on the submitting record data of the data to be analyzed and the call link data;
and carrying out hierarchical analysis on the change call link data based on the call link data to obtain a change result of the data to be analyzed, and displaying the change result.
According to an aspect of an embodiment of the present application, there is provided a code analysis system including a server and a code server;
the server is used for determining call link data of basic code data, accessing the code server, acquiring submitted record data of data to be analyzed, determining change call link data corresponding to the data to be analyzed based on the submitted record data of the data to be analyzed and the call link data, carrying out hierarchical analysis on the change call link data based on the call link data, obtaining a change result of the data to be analyzed, and displaying the change result.
According to an aspect of an embodiment of the present application, there is provided a code analysis apparatus including:
the link generation module is used for determining calling link data of the basic code data;
the branch analysis module is used for acquiring the submitted record data of the data to be analyzed, and determining the change call link data corresponding to the data to be analyzed based on the submitted record data of the data to be analyzed and the call link data;
and the change analysis module is used for carrying out hierarchical analysis on the change call link data based on the call link data to obtain a change result of the data to be analyzed and displaying the change result.
According to an aspect of an embodiment of the present application, there is provided an electronic device including a memory and a processor; the memory stores a computer program, and the processor is configured to execute the computer program in the memory to perform the operations in the code analysis method.
According to an aspect of an embodiment of the present application, there is provided a storage medium storing a plurality of instructions adapted to be loaded by a processor to perform the steps in the above-described code analysis method.
The embodiment of the application provides a code analysis method, a system, a device, electronic equipment and a storage medium, which relate to the technical field of computers and are used for determining calling link data of basic code data; acquiring submitting record data of data to be analyzed, and determining change calling link data corresponding to the data to be analyzed based on the submitting record data of the data to be analyzed and the calling link data; performing hierarchical analysis on the change call link data based on the call link data to obtain a change result of the data to be analyzed, and displaying the change result; according to the embodiment of the application, the link analysis is carried out on the basic codes and the submitted record data of the data to be analyzed, so that the change condition of the data to be analyzed relative to the basic code data can be timely and accurately positioned, the submitted record data submitted each time can be rapidly positioned through the hierarchical analysis, and the influence on the related product functions of the current application basic code data is judged, so that whether functional regression is needed or not is judged, the accuracy of a code change analysis result is improved, and the efficiency of code analysis is improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application. It is evident that the drawings in the following description are only some embodiments of the present application and that other drawings may be obtained from these drawings without inventive effort for a person of ordinary skill in the art.
FIG. 1 is a schematic diagram of a code analysis system according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a server provided in an embodiment of the present application;
FIG. 3 is a flow chart of a code analysis method according to an embodiment of the present application;
FIG. 4 is a flow chart of a hierarchical analysis method according to an embodiment of the present application;
fig. 5 is a flowchart of a method for acquiring call link data according to an embodiment of the present application;
FIG. 6 is a schematic diagram of a call linked list provided by an embodiment of the present application;
FIG. 7 is a flowchart of a method for acquiring commit record data according to an embodiment of the present application;
FIG. 8 is a flowchart of a method for determining change call link data according to an embodiment of the present application;
FIG. 9 is a block diagram of a code analysis apparatus provided by an embodiment of the present application;
fig. 10 is a schematic structural diagram of an electronic device suitable for implementing an embodiment of the present application.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the application. One skilled in the relevant art will recognize, however, that the application may be practiced without one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known methods, devices, implementations, or operations are not shown or described in detail to avoid obscuring aspects of the application.
The block diagrams depicted in the figures are merely functional entities and do not necessarily correspond to physically separate entities. That is, the functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The flow diagrams depicted in the figures are exemplary only, and do not necessarily include all of the elements and operations/steps, nor must they be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the order of actual execution may be changed according to actual situations.
It should be noted that: references herein to "a plurality" means two or more. "and/or" describes an association relationship of an association object, meaning that there may be three relationships, e.g., a and/or B may represent: a exists alone, A and B exist together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship.
Referring to fig. 1, fig. 1 is a schematic diagram of a code analysis system architecture according to an embodiment of the present application, where the code analysis system includes a server and a code server.
The server may be an independent server or a server cluster formed by a plurality of servers. The service end includes, but is not limited to, an application server, a hardware server, a virtual server, a cloud server, and the like.
The code server is used for storing the code file, wherein the code server can be an independent server or a server cluster formed by a plurality of servers. In some embodiments, the code server may be provided at the server side; in some embodiments, the code server may be disposed in another server different from the server, and interact with the server through a network.
Illustratively, taking the code server as an example, the code server is disposed in another server different from the server, a communication connection is established between the server and the code server through a network.
When the code analysis system shown in fig. 1 performs code analysis, a server determines call link data of basic code data, accesses a code server, acquires submitted record data of data to be analyzed, determines change call link data corresponding to the data to be analyzed based on the submitted record data of the data to be analyzed and the call link data, performs hierarchical analysis on the change call link data based on the call link data, and obtains a change result display change result of the data to be analyzed.
Alternatively, the network may be any type of wired or wireless network, or a combination thereof. By way of example only, the network may include a wired network, a wireless network, a fiber optic network, a telecommunications network, an intranet, the Internet, a local area network (Local Area Network, LAN), a wide area network (Wide Area Network, WAN), a wireless local area network (Wireless Local Area Networks, WLAN), a metropolitan area network (Metropolitan Area Network, MAN), a wide area network (Wide Area Network, WAN), a public switched telephone network (Public Switched Telephone Network, PSTN), a Bluetooth network, a ZigBee network, a near field communication (Near Field Communication, NFC) network, or the like, or any combination thereof.
In some implementations, as shown in fig. 2, fig. 2 is a schematic structural diagram of a service end provided by an embodiment of the present application, where the service end includes a front end, an infrastructure application service layer, and an infrastructure core service layer. The front end is realized based on a micro front end framework of VUEjs, operates in a Java virtual machine, and interacts with an infrastructure application service layer (am-application) to acquire back end data for displaying a change result; the method comprises the steps that an infrastructure application service layer is implemented based on a Java Spring boot open source framework, runs in a Java virtual machine, interacts with an infrastructure core service layer (am-core) to obtain a link analysis result, and selects data to return to a front end for display according to request requirements; the base framework core service layer is realized based on a Java Spring boot open source framework, operates in a Java virtual machine, analyzes link change data according to calling link data of basic code data and submitting record data of data to be analyzed, and returns a change result to the upper base framework application service layer.
Specifically, the code analysis method includes the steps of:
(1) The user acquires a request through a front-end trigger code;
(2) The method comprises the steps that an infrastructure application service layer responds to a code acquisition request sent by a front end, accesses a code server, acquires an image file corresponding to the code acquisition request, compiles the image file to obtain basic code data, and initiates a link generation request to an infrastructure core service layer based on the basic code data;
(3) The basic framework core service layer responds to a link generation request and generates calling link data based on basic code data; the calling link data represents the calling relation of the nodes contained in the basic code data;
(4) The method comprises the steps that an infrastructure application service layer accesses a code server, obtains submitted record data of data to be analyzed, and transmits the submitted record data to an infrastructure core service layer;
(5) The basic framework core service layer determines change call link data corresponding to the data to be analyzed based on the submitted record data and call link data of the data to be analyzed; and carrying out hierarchical analysis on the change call link data based on the call link data to obtain a change result of the data to be analyzed, and transmitting the change result to an infrastructure application service layer.
(6) The infrastructure application service layer renders based on the change result, generates a change result display view, and sends the change result display view to the front end.
(7) The front end displays a change result display view.
According to the code analysis system provided by the embodiment of the application, through carrying out link analysis on the basic codes and the submitted record data of the data to be analyzed, the change condition of the data to be analyzed relative to the basic code data can be timely and accurately positioned, and through hierarchical analysis, the submitted record data submitted each time can be rapidly positioned, and the influence on the function of the related product applying the basic code data at present can be rapidly positioned, so that whether functional regression is needed is judged, the accuracy of a code change analysis result is improved, and meanwhile, the efficiency of code analysis is improved.
Based on the code analysis system provided in fig. 1 and the service end provided in fig. 2, the embodiment of the application provides a code analysis method, which may be executed by the service end in fig. 1 and fig. 2, or may be executed by an electronic device having a data processing capability, which is not limited in detail. Specifically, the code analysis method provided in the embodiment of the present application at least includes steps 210 to 230, and is described in detail as follows:
at step 210, call link data for the base code data is determined.
The basic code data represents the main branch code data of the item updated and iterated in the service system, and it can be understood that each item in the service system is added with functional points on the basis of the main branch code data to form the code data of each item. The business system may be an educational system, a financial system, or the like.
And calling the calling relation of the nodes contained in the link data basic code data.
In some embodiments, the call link data of the base code data may be directly obtained.
Optionally, a code analysis task to be analyzed may be determined, the basic code data is obtained from the code server based on the task identifier corresponding to the code analysis task, and the call link data of the basic code data. It can be understood that the code server stores service code data of the service system, wherein the service code data comprises a plurality of task identifiers, basic code data corresponding to each task identifier, and calling link data of the basic code data.
In some embodiments, the call link data of the base code data may be obtained by performing link analysis on the base code data.
Optionally, a code analysis task to be analyzed can be determined, basic code data is obtained from the code server based on a task identifier corresponding to the code analysis task, and link analysis is performed based on the basic code data to obtain calling link data of the basic code data. Illustratively, the basic code data may be subjected to link analysis according to a code parsing tool to obtain call link data of the basic code data. The code analysis tool can be a java callgraph, items corresponding to the basic code data and the tool are arranged on the same-level catalog, the basic code data is analyzed through a specified command, and after the analysis is completed, the code analysis tool generates calling link data according to the data of the data packet. The calling link relation data characterizes the calling relation of the node contained in the basic code data, and the composition content of the calling link data can include but is not limited to: class, method, constant, call link, etc., the call link data contains multiple branches, each branch comprising multiple nodes, each branch characterizing an interface call path.
Step 220, obtaining the submitted record data of the data to be analyzed, and determining the change call link data corresponding to the data to be analyzed based on the submitted record data of the data to be analyzed and the call link data.
The data to be analyzed can be branch code data of a code analysis task to be analyzed, and it is understood that the data to be analyzed is code data formed by taking basic code data as a main branch code to add a function.
The submitted record data is used for representing changes of the data to be analyzed and comprises submitted time, submitted person, submitted code data and submitted code file, wherein the submitted code data represents that a certain section of code data of the data to be analyzed is updated, the improved code file represents that class files and dependent files of the data to be analyzed are updated, and the updating comprises, but is not limited to, adding operation, deleting operation, replacing operation and the like.
The change call link data includes at least one call path in which data to be analyzed is updated with respect to the base code data.
In some embodiments, the submitted record data of the data to be analyzed may be obtained from the code server according to the code analysis task to be analyzed.
In some embodiments, code analysis may be performed by submitting record data of data to be analyzed and calling link data by a code analysis tool, to determine change calling link data corresponding to the data to be analyzed. Code analysis tools include, but are not limited to, ANTLR, sonarQube, tree-sitter, javalang, javaParser, eclipse AstParser, etc.
In some embodiments, the submitted record data of the data to be analyzed and the call link data may be compared, a change node in the data to be analyzed is determined, and link analysis is performed based on the change node, so as to obtain change call link data corresponding to the data to be analyzed. The change node is used for representing a node of which the main code data in the data to be analyzed is inconsistent with the basic code data.
Step 230, performing hierarchical analysis on the change call link data based on the call link data to obtain a change result of the data to be analyzed, and displaying the change result.
In some embodiments, the change call link data may be hierarchically analyzed based on the call link data, so as to obtain a call interface corresponding to the change call link data and interface information corresponding to the call interface, obtain a change result of the data to be analyzed according to the interface information, and display the change result. The interface information characterizes front-end interface information which can be obtained after calling the calling interface and running codes, wherein the front-end interface information comprises all contents displayed by the front-end interface.
The change result characterizes the influence on the business system after the data to be analyzed is changed, and the influence comprises the influence of all contents of the front-end interface.
The hierarchy analysis is used for determining interface information corresponding to a calling path in the calling link data. The interface information comprises marked information corresponding to each calling interface and interface information corresponding to each calling interface. The interface information comprises whether the interface is a new call interface or an old call interface, and the interface information corresponding to each call interface is front-end interface information which can be obtained after the call interface is called and codes are run, wherein the front-end interface information comprises all contents displayed by the front-end interface. The new calling interface characterizes a calling interface newly added with data to be analyzed, and the old calling interface characterizes an unchanged calling interface.
In some embodiments, the change call link data may be subjected to hierarchical analysis to obtain an interface file corresponding to the change call link data, interface information corresponding to the change call link data is determined according to the interface file corresponding to the change call link data, and a call interface corresponding to the change call link data and interface information corresponding to the call interface are obtained based on the interface information.
Optionally, the change call link data includes a data name corresponding to the changed data, and further includes a mapping relationship between the data name and the call link, and the electronic device may recursively trace back to the call link data according to the mapping relationship to obtain an interface file corresponding to the change call link data. The mapping relation between the data name and the call link means that the change link related to the data name can be found in the call link data according to the data name, and the change code related to the data name can be found according to the link. The recursive backtracking is a logic algorithm, through the method, an interface file corresponding to the changed call link data can be found in the call link data, and the interface file found currently is a path of the call interface.
Optionally, after the electronic device obtains the interface file, the electronic device statically scans the interface file, obtains the content of the interface file according to the address of the current interface file, and determines interface information corresponding to the change call link data according to the content of the interface file. The interface information comprises marked information corresponding to each calling interface and interface information corresponding to each calling interface.
For example, the interface file may be processed to output the interface file in the target format; interface information corresponding to the change call link data is determined according to the interface file, specifically, the interface information corresponding to the change call link data is marked according to the interface file in the target format and the characteristic information. After the electronic device obtains the interface file corresponding to the change call link data, the electronic device processes the interface file and outputs the interface file in the target format. In the embodiment of the application, the interface file in the target format can be in the format of an API interface document, and can also be in the format of other types of interface documents. According to the interface file of the target format and the interface information corresponding to the feature information mark change call link data, the method specifically comprises the following steps: and regarding the change call link data as a change branch, wherein the call link data also comprises a main branch, and the electronic equipment marks all interfaces according to the characteristic information corresponding to the change call link data and the interface file.
Illustratively, processing the interface file, outputting the interface file in the target format, includes: splicing the data contained in the interface file with the data corresponding to the interface file stored in the database to obtain an interface file in a target format; and outputting the interface file in the target format. The electronic device may have incomplete condition according to the interface information in the data acquired by the interface file, for example, a part of the data is in the database, a part of the data is in the acquired interface file, and the formats are not uniform. Therefore, after the interface file is obtained, the interface information needs to be spliced by combining the data of the interface file and the data of the database, and the interface file in the target format is output.
In some embodiments, link data may be invoked, each change call link in the change call link data is hierarchically analyzed, a top level call node of each change call link is determined, a call interface is determined based on the top level call node of the change call link, and a change result of the data to be analyzed is determined based on the call result.
Specifically, as shown in fig. 4, fig. 4 is a flow chart of a hierarchical analysis method according to an embodiment of the present application, where the hierarchical analysis method includes steps 231 to 234:
and 231, performing hierarchical analysis on each change call link in the change call link data according to the call link data, and determining a top layer call node of each change call link.
The top-level calling node refers to a head node for changing a path where a calling link is located in calling link data.
In some embodiments, call link data and each change call link in change call link data may be compared, a path in which the change call link in call link data is located is determined, hierarchical analysis is performed on the path, a head node of the path is obtained, and the head node of the path is determined to be a top call node of the change call link.
Step 232, determining a call interface corresponding to the top layer call node of each change call link based on preset interface configuration data.
The preset interface configuration data comprises a plurality of calling interfaces and calling nodes corresponding to the calling interfaces.
In some embodiments, for the top-level stripe node of each change call link, the preset interface configuration data may be queried according to the top-level call node of the change call link, so as to obtain a call interface corresponding to the top-level call node of the change call link.
Step 233, determining application points corresponding to the calling interfaces based on preset product configuration data.
The preset product configuration data comprise a plurality of application points and interface clusters corresponding to the application points, and each interface cluster comprises at least one calling interface.
The application point is used for characterizing service functions provided by the service system, including but not limited to a query function, a write function, a read function, and the like.
In some embodiments, the target interface cluster where the calling interface is located may be determined according to the preset product configuration data queried by the calling interface, and the application point corresponding to the target interface cluster is determined as the application point corresponding to the calling interface.
And step 234, obtaining a change result according to the application points corresponding to the calling interfaces.
In some embodiments, application points corresponding to the call interfaces may be summarized, and an influence of data to be analyzed on the service system may be determined, so as to obtain a change result.
In some embodiments, after obtaining the change result of the data to be analyzed, rendering may be performed according to the change result, and a change result display view may be generated and displayed at the front end.
In some embodiments, after obtaining the change result of the data to be analyzed, an impact report may be generated according to the change result, and the impact report may be displayed.
According to the code analysis method provided by the embodiment of the application, through carrying out link analysis on the basic codes and the submitted record data of the data to be analyzed, the change condition of the data to be analyzed relative to the basic code data can be accurately positioned in time, and through hierarchical analysis, the submitted record data submitted each time can be quickly positioned, and the influence on the function of the related product applying the basic code data at present can be quickly positioned, so that whether functional regression is needed is judged, the accuracy of the code change analysis result is improved, and the efficiency of code analysis is improved.
In some embodiments, a code server may be accessed to obtain an image file, the image file is compiled to obtain basic code data, and the basic code data is subjected to link analysis to obtain call link data. Wherein the image file may be a compressed file containing the basic code data.
Specifically, as shown in fig. 5, fig. 5 is a flowchart of a method for acquiring call link data according to an embodiment of the present application, where the method for acquiring call link data includes steps 211 to 213:
step 211, responding to the code acquisition request, sending an access request to the code server, and acquiring an image file corresponding to the code acquisition request.
The image file may be a compressed packet containing backbone code data of the business system.
In some implementations, the front end displays a code analysis page, upon which the user triggers a code acquisition request.
In some embodiments, as shown in fig. 2, the infrastructure application service layer responds to the code acquisition request, and sends an access request to the code server to acquire an image file corresponding to the code acquisition request.
In some embodiments, to ensure data security, the infrastructure application service layer sends an access request to the code server based on file information and verification information of the image file to be acquired, the code server acquires the access request, verifies the service end based on the verification information carried in the access information, and when the verification passes, acquires the corresponding image file based on the file information carried in the access request, and returns the image file to the infrastructure application service layer.
Optionally, the verification information includes a verification code and a user identifier, the infrastructure application service layer determines a reference verification code corresponding to the user identifier, compares the reference verification code with the verification code, determines that verification is not passed if the reference verification code is inconsistent with the verification code, obtains authority information corresponding to the user identifier based on the user identifier if the reference verification code is consistent with the verification code, determines reference authority information corresponding to the file information, compares the authority information corresponding to the user identifier with the reference authority information, determines that verification is passed if the authority information corresponding to the user identifier is matched with the reference authority information, and determines that verification is passed if the authority information corresponding to the user identifier is not matched with the reference authority information. It is determined that the verification is not passed.
In some embodiments, after obtaining the image file corresponding to the code obtaining request, the infrastructure application service layer obtains a preset deposit address, and writes the image file corresponding to the code obtaining request into the preset deposit address in the service end.
And step 212, decompressing the image file to obtain the basic code data.
In some embodiments, the infrastructure application service layer reads an image file from a preset storage address, decompresses the image file to obtain an initial basic code, compiles the initial basic code to obtain a basic code, and compresses the basic code to obtain basic code data.
In step 213, call link data is generated based on the basic code data.
The calling link data characterizes the calling relation of the nodes contained in the basic code data.
In some embodiments, the basic code data may be subjected to link analysis according to step S210 described above, to generate call link data.
In some embodiments, the infrastructure application service layer transmits a storage address of the basic code data and a link analysis request to the infrastructure core service layer, and the infrastructure core service layer responds to the link analysis request, reads the basic code data based on the storage address of the basic code data, analyzes the basic code data to obtain class information in the basic code data, and performs link analysis based on the class information to obtain call link data. The class information includes, but is not limited to, inheritance and implementation class information, class method call information, class attribute information and the like.
Specifically, the analysis method of the call link includes steps a1 to a3:
and a1, analyzing the basic code data to obtain class files in the basic code data.
And a2, analyzing the class files in the basic code data to obtain class information of various files.
And a3, determining calling information among various files based on class information of the various files.
The calling information is used for representing calling relations among nodes corresponding to the class files.
In some embodiments, the calling relationship between the nodes corresponding to the various files can be determined according to the class method information, the class method calling information and the class attribute information in the class information of the class files, and the calling information between the various files is determined based on the calling relationship between the nodes corresponding to the various files.
And a4, establishing a call linked list based on call information among various files, and generating call link data.
In some embodiments, the nodes corresponding to the various files may be ordered based on call information between the various files, the preamble node and the subsequent node of each node are determined, the forward pointer and the backward pointer of each node are set based on the preamble node and the subsequent node of each node, a call linked list is established, the class file corresponding to the node is written into the data bit of the node, and call link data is generated. The front-end node of the head node is empty, the rear-end node of the tail node is empty, and it is understood that the front-end pointer of the head node is empty, the rear-end pointer points to the second node, the front-end pointer of the tail node points to the penultimate node, and the rear-end pointer of the tail node is empty. Exemplary, as shown in fig. 6, fig. 6 is a schematic diagram of a call linked list provided by an embodiment of the present application, where a subsequent pointer of a forward node points to a data bit of a subsequent node, and a forward pointer of a subsequent node points to a data bit of a forward node.
In some embodiments, the code server stores the submitted record data of the branch codes submitted by the service system at different times, and in order to determine the influence of the update of the branch codes on the service system, the code server can be accessed to obtain the submitted record data of the data to be analyzed.
Specifically, as shown in fig. 7, fig. 7 is a flowchart of a method for acquiring commit record data according to an embodiment of the present application, where the method for acquiring commit record data includes steps 221 to 223:
in step 221, code identification information and time information of the data to be analyzed carried by the code analysis request are determined in response to the code analysis request.
In some embodiments, after determining the basic code data, determining a branch code taking the basic code data as a main code in the service system based on the basic code data, displaying code identification information of each branch code in a front-end page view, determining a selected target branch code and time information by a front-end in response to a branch code selection operation input by a user based on the front-end page view, sending a code analysis request to an infrastructure application service layer based on the code identification information of the target branch code and the time information, and determining code identification information and time information of data to be analyzed carried by the code analysis request by the infrastructure application service layer in response to the code analysis request.
Step 222, accessing the code server, and obtaining the initial submission records corresponding to the code identification information and the submission time corresponding to each initial submission record.
In some embodiments, the infrastructure application service layer accesses the code server and obtains initial commit records corresponding to the code identification information and commit times corresponding to the initial commit records.
Optionally, the infrastructure application service layer sends the access request to the code server, the code server verifies the access request, and if the verification passes, the access of the infrastructure application service layer is received, and the infrastructure application service layer pulls initial commit records corresponding to the substitution code identification information and commit time corresponding to each initial commit record from the code server.
Step 223, determining the target initial commit record with the commit time meeting the time information as the commit record data of the data to be analyzed based on the commit time corresponding to each initial commit record.
In some embodiments, if the commit time is within the time range corresponding to the time information, it is determined that the commit time satisfies the time information, and if the commit time is not within the time range corresponding to the time information, it is determined that the commit time does not satisfy the time information.
In some embodiments, after determining the call link data and the commit record data, the change record data may be determined according to the call link data and the commit record data, and the link analysis may be performed according to the change record data, to determine the change call link data corresponding to the data to be analyzed. Specifically, as shown in fig. 8, fig. 8 is a flowchart of a method for determining change call link data according to an embodiment of the present application, where the method for determining change call link data includes steps 224 to 227:
step 224, analyzing the submitted record data of the data to be analyzed, and determining the target change file with the shortest time from the current time of the submitted time of the change file in the submitted record data.
In some embodiments, the infrastructure application service layer transmits the commit record data of the data to be analyzed to the infrastructure core service layer, and the infrastructure core service layer analyzes the commit record data of the data to be analyzed to determine a target change file with a shortest commit time from the current time of the change file in the commit record data.
Optionally, the infrastructure core service layer analyzes each commit record in the commit record data, determines a commit time corresponding to each commit record, a committed change file, a change register and the like, and determines a commit file with the shortest commit time of the change file from the current time as a target commit file according to the commit time corresponding to each commit record.
And 225, analyzing the target change file to determine change record data of the data to be analyzed.
The change record data comprises a changed class address, a class method and a change grade.
In step 226, the change record data is compared with the call link data, and the change node corresponding to the change record data and the change call link where the change node is located are determined.
In some embodiments, the change record data and the call link data may be compared, a change node corresponding to the change record data is determined, and a change call link where the change node is located is determined according to the call link data.
In some embodiments, since there is a change point between the change log data and the call link data that cannot be clearly identified by static analysis, in the change point identification, it is necessary to identify a node that cannot be statically analyzed, and for the node that cannot be statically analyzed, probability prediction is performed by a class method or a class address, and a change node is determined from the nodes in the call link data based on the probability. Specifically, the method for identifying the change node includes steps b1 to b3:
and b1, comparing the changed class address and class method in the change record data with the call link data, and determining whether the call link data corresponds to the changed class address and class method or not.
And b2, if the node corresponding to the changed class address and class method exists in the call link data, determining the node as a changed node, and determining a change call link where the changed node is located according to the call link data.
And b3, if the node corresponding to the changed class address and class method does not exist in the call link data, screening the node in the call link data according to the changed class address and class method, determining the changed node, and determining a change call link where the changed node is located according to the call link data.
In some embodiments, step b3 comprises:
if the node corresponding to the changed class address and class method does not exist in the call link data, the class name and the injection point name corresponding to the changed class address and class method are used.
And screening the nodes in the call link data based on the class names and the injection point names, and determining candidate nodes matched with the class names and the injection point names in the nodes in the call link data and the probability of each candidate node.
And determining the candidate node with the probability larger than the preset probability threshold as a change node, and determining a change call link where the change node is positioned according to call link data.
Step 227, summarizing the change call links to obtain change call link data.
In some embodiments, after obtaining the change call link data, the change call link data may be hierarchically analyzed according to the step 230 to obtain a change result of the data to be analyzed, and the change result may be displayed.
In some embodiments, after obtaining the change call link data, the change call link data may be subjected to hierarchical analysis according to the hierarchical analysis method provided in fig. 4, to obtain a change result of the data to be analyzed, and the change result is displayed.
According to the code analysis method provided by the embodiment of the application, through carrying out link analysis on the basic codes and the submitted record data of the data to be analyzed, the change condition of the data to be analyzed relative to the basic code data can be accurately positioned in time, and through hierarchical analysis, the submitted record data submitted each time can be quickly positioned, and the influence on the function of the related product applying the basic code data at present can be quickly positioned, so that whether functional regression is needed is judged, the accuracy of the code change analysis result is improved, and the efficiency of code analysis is improved.
In order to better implement the code analysis method provided by the embodiment of the present application, based on the code analysis method, the code analysis device provided by the embodiment of the present application is disposed at a server side in the code analysis system shown in fig. 1, as shown in fig. 9, fig. 9 is a schematic structural diagram of the code analysis device provided by the embodiment of the present application, where the code analysis device includes:
A link generation module 901, configured to determine call link data of basic code data;
the branch analysis module 902 is configured to obtain submitted record data of data to be analyzed, and determine change call link data corresponding to the data to be analyzed based on the submitted record data of the data to be analyzed and the call link data;
the change analysis module 903 is configured to perform hierarchical analysis on the change call link data based on the call link data, obtain a change result of the data to be analyzed, and display the change result.
In some implementations, a branch analysis module 902 is used to:
analyzing the submitted record data of the data to be analyzed, and determining a target change file with the shortest submitting time distance from the current time of the change file in the submitted record data;
analyzing the target change file, and determining change record data of the data to be analyzed, wherein the change record data comprises a changed class address, a class method and a change grade;
comparing the change record data with the call link data, and determining a change node corresponding to the change record data and a change call link where the change node is located;
and summarizing each change call link to obtain change call link data.
In some implementations, a branch analysis module 902 is used to:
comparing the changed class address and class method in the change record data with the call link data, and determining whether the call link data corresponds to the changed class address and class method or not;
if the call link data contains the node corresponding to the changed class address and class method, the node is determined to be a changed node, and a change call link where the changed node is located is determined according to the call link data;
if the node corresponding to the changed class address and class method does not exist in the call link data, the node in the call link data is screened according to the changed class address and class method, the changed node is determined, and a change call link where the changed node is located is determined according to the call link data.
In some implementations, a branch analysis module 902 is used to:
according to the changed class address, the class name corresponding to the class method and the injection point name;
screening nodes in the call link data based on the class names and the injection point names, and determining candidate nodes matched with the class names and the injection point names in the nodes in the call link data and the probability of each candidate node;
And determining the candidate nodes with the probability larger than a preset probability threshold as change nodes.
In some implementations, a branch analysis module 902 is used to:
responding to the code analysis request, and determining code identification information and time information of data to be analyzed carried by the code analysis request;
accessing a code server, and acquiring initial submission records corresponding to code identification information and submission time corresponding to each initial submission record;
and determining the target initial commit record of which the commit time meets the time information as commit record data of the data to be analyzed based on the commit time corresponding to each initial commit record.
In some embodiments, the change resolution module 903 is configured to:
according to the call link data, carrying out hierarchical analysis on each change call link in the change call link data, and determining a top layer call node of each change call link;
determining a calling interface corresponding to a top layer calling node of each change calling link based on preset interface configuration data; the preset interface configuration data comprises a plurality of calling interfaces and calling nodes corresponding to the calling interfaces;
determining application points corresponding to each calling interface based on preset product configuration data; the preset product configuration data comprises a plurality of application points and at least one calling interface corresponding to each application point;
And obtaining a change result according to the application points corresponding to the calling interfaces.
In some embodiments, the code analysis apparatus includes:
the trunk code analysis module 904 is configured to respond to a code acquisition request, send an access request to a code server, and acquire an image file corresponding to the code acquisition request; and decompressing the image file to obtain the basic code data.
The link generation module 901 is used for generating calling link data according to basic code data; the call link data characterizes the call relationship of the nodes contained in the basic code data.
In some embodiments, the link generation module 901 is configured to:
analyzing the basic code data to obtain class files in the basic code data;
analyzing the class files in the basic code data to obtain class information of various files;
determining calling information among various files based on class information of the various files;
and establishing a call linked list based on call information among various files to generate call link data.
According to the code analysis device provided by the embodiment of the application, through carrying out link analysis on the basic codes and the submitted record data of the data to be analyzed, the change condition of the data to be analyzed relative to the basic code data can be timely and accurately positioned, and through hierarchical analysis, the submitted record data submitted each time can be rapidly positioned, and the influence on the function of the related product applying the basic code data at present can be rapidly positioned, so that whether functional regression is needed is judged, the accuracy of a code change analysis result is improved, and meanwhile, the efficiency of code analysis is improved.
The embodiment of the application also provides an electronic device, as shown in fig. 10, which shows a schematic structural diagram of the electronic device according to the embodiment of the application, specifically:
the electronic device may include one or more processing cores 'processors 1001, one or more computer-readable storage media's memory 1002, a power supply 1003, and an input unit 1004, among other components. It will be appreciated by those skilled in the art that the electronic device structure shown in fig. 10 is not limiting of the electronic device and may include more or fewer components than shown, or may combine certain components, or a different arrangement of components. Wherein:
the processor 1001 is a control center of the electronic device, connects various parts of the entire electronic device using various interfaces and lines, and performs various functions of the electronic device and processes data by running or executing software programs and/or modules stored in the memory 1002 and calling data stored in the memory 1002, thereby performing overall monitoring of the electronic device. Optionally, the processor 1001 may include one or more processing cores; preferably, the processor 1001 may integrate an application processor and a modem processor, wherein the application processor mainly processes an operating system, a user interface, an application program, and the like, and the modem processor mainly processes wireless communication. It will be appreciated that the modem processor described above may not be integrated into the processor 1001.
The memory 1002 may be used to store software programs and modules, and the processor 1001 executes various functional applications and data processing by executing the software programs and modules stored in the memory 1002. The memory 1002 may mainly include a storage program area that may store an operating system, application programs required for at least one function (such as a sound playing function, an image playing function, etc.), and a storage data area; the storage data area may store data created according to the use of the electronic device, etc. In addition, memory 1002 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device. Accordingly, the memory 1002 may also include a memory controller to provide the processor 1001 with access to the memory 1002.
The electronic device further comprises a power supply 1003 for powering the various components, preferably the power supply 1003 is logically connected to the processor 1001 by a power management system, whereby charging, discharging, and power consumption management functions are performed by the power management system. The power supply 1003 may also include one or more of any of a direct current or alternating current power supply, a recharging system, a power failure detection circuit, a power converter or inverter, a power status indicator, and the like.
The electronic device may also include an input unit 1004, which input unit 1004 may be used to receive input numeric or character information and to generate keyboard, mouse, joystick, optical or trackball signal inputs related to user settings and function control.
Although not shown, the electronic device may further include a display unit or the like, which is not described herein. In particular, in this embodiment, the processor 1001 in the electronic device loads executable files corresponding to the processes of one or more application programs into the memory 1002 according to the following instructions, and the processor 1001 executes the application programs stored in the memory 1002, so as to implement various functions as follows:
determining calling link data of basic code data;
acquiring submitting record data of data to be analyzed, and determining change calling link data corresponding to the data to be analyzed based on the submitting record data of the data to be analyzed and the calling link data;
and carrying out hierarchical analysis on the change call link data based on the call link data to obtain a change result of the data to be analyzed, and displaying the change result.
Those of ordinary skill in the art will appreciate that all or a portion of the steps of the various methods of the above embodiments may be performed by instructions, or by instructions controlling associated hardware, which may be stored in a computer-readable storage medium and loaded and executed by a processor.
To this end, an embodiment of the present application provides a storage medium in which a computer program is stored, the computer program being capable of being loaded by a processor to perform the steps of any of the code analysis methods provided by the embodiments of the present application. For example, the computer program may perform the steps of:
determining calling link data of basic code data;
acquiring submitting record data of data to be analyzed, and determining change calling link data corresponding to the data to be analyzed based on the submitting record data of the data to be analyzed and the calling link data;
and carrying out hierarchical analysis on the change call link data based on the call link data to obtain a change result of the data to be analyzed, and displaying the change result.
The specific implementation of each operation above may be referred to the previous embodiments, and will not be described herein.
Wherein the storage medium may include: read Only Memory (ROM), random access Memory (RAM, random Access Memory), magnetic or optical disk, and the like.
The steps in the control method of any kind of heating machine provided by the embodiment of the present application can be executed by the computer program stored in the storage medium, so that the beneficial effects that can be achieved by the control method of any kind of heating machine provided by the embodiment of the present application can be achieved, and detailed descriptions of the previous embodiments are omitted herein.
The foregoing has described in detail the methods, systems, apparatuses, electronic devices and storage media for code analysis provided by the embodiments of the present application, and specific examples have been applied to illustrate the principles and embodiments of the present application, where the foregoing examples are provided to assist in understanding the methods and core ideas of the present application; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in light of the ideas of the present application, the present description should not be construed as limiting the present application.
Claims (13)
1. A method of code analysis, the method comprising:
determining calling link data of basic code data;
acquiring submitting record data of data to be analyzed, and determining change call link data corresponding to the data to be analyzed based on the submitting record data of the data to be analyzed and the call link data;
and carrying out hierarchical analysis on the change call link data based on the call link data to obtain a change result of the data to be analyzed, and displaying the change result.
2. The method according to claim 1, wherein the determining the change call link data corresponding to the data to be analyzed based on the commit record data of the data to be analyzed and the call link data includes:
Analyzing the submitted record data of the data to be analyzed, and determining a target change file with the shortest submitted time distance from the current time of the change file in the submitted record data;
analyzing the target change file, and determining change record data of the data to be analyzed, wherein the change record data comprises a changed class address, a class method and a change grade;
comparing the change record data with the call link data, and determining a change node corresponding to the change record data and a change call link where the change node is located;
and summarizing each change call link to obtain change call link data.
3. The method of claim 2, wherein the comparing the change log data with the call link data, determining a change node to which the change log data corresponds, and a change call link in which the change node is located, comprises:
comparing the changed class address and class method in the change record data with the call link data, and determining whether the call link data corresponds to the changed class address and class method or not;
If the call link data contains the node corresponding to the changed class address and class method, determining the node as a changed node, and determining a change call link where the changed node is located according to the call link data;
and if the node corresponding to the changed class address and class method does not exist in the call link data, screening the node in the call link data according to the changed class address and class method, determining a changed node, and determining a change call link where the changed node is located according to the call link data.
4. A method according to claim 3, wherein said screening nodes in said call link data according to said changed class address and class method to determine changed nodes comprises:
according to the changed class address, the class name corresponding to the class method and the injection point name;
screening nodes in the call link data based on the class names and the injection point names, and determining candidate nodes matched with the class names and the injection point names in the nodes in the call link data and the probability of each candidate node;
And determining the candidate nodes with the probability larger than a preset probability threshold as change nodes.
5. The method of claim 1, wherein the obtaining of the commit log data of the data to be analyzed comprises:
responding to a code analysis request, and determining code identification information and time information of data to be analyzed carried by the code analysis request;
accessing a code server, and acquiring initial submitting records corresponding to the code identification information and submitting time corresponding to each initial submitting record;
and determining the target initial commit record of which the commit time meets the time information as commit record data of the data to be analyzed based on the commit time corresponding to each initial commit record.
6. The method according to claim 1, wherein the performing, based on the call link data, the hierarchical analysis on the change call link data to obtain the change result of the data to be analyzed includes:
performing hierarchical analysis on each change call link in the change call link data according to the call link data, and determining a top layer call node of each change call link;
determining a calling interface corresponding to a top layer calling node of each change calling link based on preset interface configuration data; the preset interface configuration data comprises a plurality of calling interfaces and calling nodes corresponding to the calling interfaces;
Determining application points corresponding to the calling interfaces based on preset product configuration data; the preset product configuration data comprises a plurality of application points and at least one calling interface corresponding to each application point;
and obtaining a change result according to the application point corresponding to each calling interface.
7. The method according to any one of claims 1 to 6, wherein determining call link data of basic code data includes:
responding to a code acquisition request, sending an access request to a code server, and acquiring an image file corresponding to the code acquisition request;
decompressing the mirror image file to obtain basic code data;
generating call link data based on the basic code data; and the calling link data characterizes the calling relation of the nodes contained in the basic code data.
8. The method of claim 7, wherein generating call link data based on the base code data comprises:
analyzing the basic code data to obtain class files in the basic code data;
analyzing the class files in the basic code data to obtain class information of each class file;
Determining calling information among the class files based on the class information of the class files;
and establishing a call linked list based on call information among the class files to generate call link data.
9. The code analysis system is characterized by comprising a server and a code server;
the server is used for determining call link data of basic code data, accessing the code server, acquiring submitted record data of data to be analyzed, determining change call link data corresponding to the data to be analyzed based on the submitted record data of the data to be analyzed and the call link data, carrying out hierarchical analysis on the change call link data based on the call link data, obtaining a change result of the data to be analyzed, and displaying the change result.
10. The system of claim 9, wherein the server comprises a front end, an infrastructure application service layer, and an infrastructure core service layer;
the front end is used for triggering a code acquisition request to an infrastructure application service layer;
the infrastructure application service layer is used for responding to the code acquisition request, sending an access request to a code server, acquiring an image file corresponding to the code acquisition request, compiling the image file to obtain basic code data, and initiating a link generation request to the infrastructure core service layer based on the basic code data;
The basic framework core service layer is used for responding to the link generation request and generating calling link data based on the basic code data; and the calling link data characterizes the calling relation of the nodes contained in the basic code data.
11. A code analysis apparatus, the apparatus comprising:
the link generation module is used for determining calling link data of the basic code data;
the branch analysis module is used for acquiring the submitted record data of the data to be analyzed, and determining the change call link data corresponding to the data to be analyzed based on the submitted record data of the data to be analyzed and the call link data;
and the change analysis module is used for carrying out hierarchical analysis on the change call link data based on the call link data to obtain a change result of the data to be analyzed and displaying the change result.
12. An electronic device comprising a memory and a processor; the memory stores a computer program, and the processor is configured to execute the computer program in the memory to perform the operations in the code analysis method according to any one of claims 1 to 8.
13. A storage medium storing a plurality of instructions adapted to be loaded by a processor to perform the steps of the code analysis method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311052848.4A CN117009240A (en) | 2023-08-18 | 2023-08-18 | Code analysis method, system, device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311052848.4A CN117009240A (en) | 2023-08-18 | 2023-08-18 | Code analysis method, system, device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117009240A true CN117009240A (en) | 2023-11-07 |
Family
ID=88572670
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311052848.4A Pending CN117009240A (en) | 2023-08-18 | 2023-08-18 | Code analysis method, system, device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117009240A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112199276A (en) * | 2020-09-24 | 2021-01-08 | 建信金融科技有限责任公司 | Alteration detection method and device for microservice architecture, server and storage medium |
| CN112379888A (en) * | 2020-12-02 | 2021-02-19 | 北京皮尔布莱尼软件有限公司 | Code change analysis method |
| CN113268245A (en) * | 2021-05-25 | 2021-08-17 | 北京大米科技有限公司 | Code analysis method, device and storage medium |
| CN114579452A (en) * | 2022-03-07 | 2022-06-03 | 北京有竹居网络技术有限公司 | Interface influence detection method and related equipment |
| CN114816971A (en) * | 2021-01-19 | 2022-07-29 | 腾讯科技（深圳）有限公司 | Data processing method, related equipment and storage medium |
| CN114968817A (en) * | 2022-06-24 | 2022-08-30 | 深圳集智数字科技有限公司 | Method, device, equipment and storage medium for evaluating code change influence range |
| CN115757162A (en) * | 2022-11-25 | 2023-03-07 | 天翼电子商务有限公司 | Efficient test case execution method based on function link |
-
2023
- 2023-08-18 CN CN202311052848.4A patent/CN117009240A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112199276A (en) * | 2020-09-24 | 2021-01-08 | 建信金融科技有限责任公司 | Alteration detection method and device for microservice architecture, server and storage medium |
| CN112379888A (en) * | 2020-12-02 | 2021-02-19 | 北京皮尔布莱尼软件有限公司 | Code change analysis method |
| CN114816971A (en) * | 2021-01-19 | 2022-07-29 | 腾讯科技（深圳）有限公司 | Data processing method, related equipment and storage medium |
| CN113268245A (en) * | 2021-05-25 | 2021-08-17 | 北京大米科技有限公司 | Code analysis method, device and storage medium |
| CN114579452A (en) * | 2022-03-07 | 2022-06-03 | 北京有竹居网络技术有限公司 | Interface influence detection method and related equipment |
| CN114968817A (en) * | 2022-06-24 | 2022-08-30 | 深圳集智数字科技有限公司 | Method, device, equipment and storage medium for evaluating code change influence range |
| CN115757162A (en) * | 2022-11-25 | 2023-03-07 | 天翼电子商务有限公司 | Efficient test case execution method based on function link |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10901709B2 (en) | Partitioning based migration of systems to container and microservice based platforms | |
| Briand et al. | Automating impact analysis and regression test selection based on UML designs | |
| CN108304201B (en) | Object updating method, device and equipment | |
| US7614042B1 (en) | System and method for selecting applicable tests in an automation testing system | |
| CN111722839B (en) | Code generation method and device, electronic equipment and storage medium | |
| US9830376B2 (en) | Language tag management on international data storage | |
| WO2023061874A1 (en) | Checking source code validity at time of code update | |
| EP1383045A2 (en) | Extensible on-demand property system | |
| CN110276074B (en) | Distributed training method, device, equipment and storage medium for natural language processing | |
| US8954376B2 (en) | Detecting transcoding tables in extract-transform-load processes | |
| CN111026634A (en) | Interface automation test system, method, device and storage medium | |
| US20160124795A1 (en) | Evaluation method and apparatus | |
| TW201235943A (en) | Unchanged object management | |
| CN109460268B (en) | Application parameter configuration method, device and system | |
| CN104679500B (en) | Method and device for realizing automatic generation of entity class | |
| CN115576600A (en) | Code change-based difference processing method and device, terminal and storage medium | |
| US11099837B2 (en) | Providing build avoidance without requiring local source code | |
| CN112148343A (en) | Rule issuing method and device and terminal equipment | |
| CN111651196A (en) | Document publishing method, device and server | |
| CN115268879A (en) | Code processing method and device, electronic equipment and storage medium | |
| CN111966382A (en) | Online deployment method and device of machine learning model and related equipment | |
| US20230153081A1 (en) | Methods and systems for correlating source code commitments and model result records during model development | |
| CN117009240A (en) | Code analysis method, system, device, electronic equipment and storage medium | |
| US20230115334A1 (en) | Identifying computer instructions enclosed by macros and conflicting macros at build time | |
| CN112181407B (en) | Service realization processing method, device, system, electronic 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 |