CN109375947B - Method and system for executing change to software - Google Patents

Method and system for executing change to software Download PDF

Info

Publication number
CN109375947B
CN109375947B CN201811275802.8A CN201811275802A CN109375947B CN 109375947 B CN109375947 B CN 109375947B CN 201811275802 A CN201811275802 A CN 201811275802A CN 109375947 B CN109375947 B CN 109375947B
Authority
CN
China
Prior art keywords
change command
change
command
executing
agent
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.)
Active
Application number
CN201811275802.8A
Other languages
Chinese (zh)
Other versions
CN109375947A (en
Inventor
苑贵全
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Yanhun Network Technology Co ltd
Original Assignee
Hangzhou Yanhun Network Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hangzhou Yanhun Network Technology Co ltd filed Critical Hangzhou Yanhun Network Technology Co ltd
Priority to CN201811275802.8A priority Critical patent/CN109375947B/en
Publication of CN109375947A publication Critical patent/CN109375947A/en
Application granted granted Critical
Publication of CN109375947B publication Critical patent/CN109375947B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/70Software maintenance or management
    • G06F8/71Version control; Configuration management

Abstract

The application discloses a method and a system for executing change to software, wherein the method for executing change to software specifically comprises the following steps: receiving a change command; analyzing the change command, and determining an execution agent corresponding to the change command; executing the agent decomposition change command, perfecting the information and obtaining an instruction tree; creating a task flow corresponding to the instruction tree; and executing the task flow to finish the execution change of the software. The method and the system for executing the change on the software can automatically and quickly execute the change command without manual change, and improve the execution time and the safety of the change command.

Description

Method and system for executing change to software
Technical Field
The present application relates to the field of computers, and in particular, to a method of performing changes to software and a system thereof.
Background
In the prior art, a software facility includes components such as an application program, an operating system, a driver, and the like, or an application server and a database on which one or more components depend. When an administrator wants to make changes to a software facility, if the changes are made using an automated tool, the increase of changes made to the software facility is increased, and in another case, when a change command is executed, expert intervention is usually relied on, but there is interdependency between the components in the software, and any expert cannot understand the details thereof, so that it takes time and experience to simply rely on manual execution of the change command, and also increases the possibility of errors.
Disclosure of Invention
The application provides a method and a system for executing change to software, wherein the method for executing change to software specifically comprises the following steps: receiving a change command; analyzing the change command, and determining an execution agent corresponding to the change command; executing the agent decomposition change command, perfecting the information and obtaining an instruction tree; creating a task flow corresponding to the instruction tree; and executing the task flow to complete the change of the software.
As above, the change command includes data information of the object, type, and environment that is requested to be changed.
As above, the execution agent includes data parameters, the data parameters include change information to be executed, and each data parameter corresponds to data information in the change command one to one.
As above, if the data parameters of the executing agent correspond to the data information in the change command one by one, it is determined that the executing agent is the executing agent required by the change command; if not, the search is continued.
The method comprises the steps of analyzing the change command, judging whether the change command is effective, stopping the analysis if the change command is ineffective, and sending a command ineffective signal.
As above, wherein each data parameter in the executing agent includes a decomposer, the decomposer uniquely decomposes the change command.
As above, each data parameter includes a sub-decoding and a decomposition keyword, and the sub-decoding and the decomposition keyword are combined to form a decomposition symbol.
A system for performing changes to software includes a command receiving unit, a command analyzing unit, a command decomposing unit, a task flow creating unit, and an executing unit; the command receiving unit is used for receiving a change command; the command analysis unit is connected with the command receiving unit and used for analyzing the change command, obtaining the data information of the change command and obtaining the execution agent; the command decomposition unit is connected with the command analysis unit and used for decomposing the change command by executing the agent and obtaining an instruction tree; the task flow creating unit is connected with the command decomposing unit and used for creating a task flow corresponding to the instruction tree; the execution unit is connected with the task flow creating unit and used for executing the change command according to the created task flow.
The command decomposition unit comprises a storage module and a calling module; the storage module is used for storing the searched execution agent in the execution queue; the calling module is connected with the storage module and used for calling the execution agent stored in the execution queue and decomposing the change command.
As above, the command analysis unit includes a data parameter comparison module and an execution agent search module; the data parameter comparison module is used for comparing the data information of the change command with the data parameters of the execution agent and searching the execution agent corresponding to the change command through the connected execution agent searching module.
The application has the following beneficial effects:
(1) the method and the system for executing the change on the software can automatically and quickly execute the change command without manual change, and improve the execution time and the safety of the change command.
(2) The method and the system for executing the change to the software can quickly identify whether the change command is effective or not, provide an analysis result if the change command is ineffective, and avoid repeated sending of the ineffective change command.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art according to the drawings.
FIG. 1 is a flow diagram of a method for performing changes to software provided in accordance with an embodiment of the present application;
FIG. 2 is a schematic diagram of an instruction tree structure provided according to an embodiment of the present application;
FIG. 3 is a schematic diagram of the internal structure of a system for executing changes in software according to an embodiment of the present application;
FIG. 4 is a sub-block diagram of a system for performing changes in software provided in accordance with an embodiment of the present application;
fig. 5 is a schematic diagram of another sub-module of a system for performing changes in software according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application are clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The present application is a method of performing changes to software and a system thereof. According to the method and the device, when a user or an administrator requests to change the software facility, the change command can be automatically and quickly executed without manual change, and the execution time and the safety of the change command are improved.
Fig. 1 is a flowchart illustrating a method for performing changes to software according to the present application.
Step S110: a change command is received.
Specifically, the change command includes various data information such as an object, a type, an environment, and other data information that is requested to be changed.
Step S120: the change command is analyzed to determine an execution agent corresponding to the change command.
Illustratively, the execution agent is a program or process that is pre-designed and that the computer is capable of executing. The change order can be decomposed into a plurality of sub-change commands.
Further, the execution agent includes data parameters, the data parameters include change information to be executed, and each data parameter corresponds to the data information in the change command one by one.
Illustratively, if the data information included in the change command change1 is change _ target (change target), change _ target (change type), and change _ environment (change environment); the data parameters included in the execution agent Resolve1 are RE _ change _ target (executed change target), RE _ change _ target (executed change type), and RE _ change _ environment, change _ target and RE _ change _ target are in a corresponding relationship, that is, the data information included in the change command needs to be consistent with all the information in the execution agent to determine that the execution agent is the execution agent required by the change command, and if there is one piece of information that does not correspond, the search is continued.
Further, whether the change command is invalid or not is judged, if the change command is invalid when the change command is analyzed, the analysis is stopped, a command invalid signal is sent, and the system is prompted to resend the change command.
And further, the invalid change command can be subjected to error analysis, whether the change command carries data information or not is judged, if the change command carries the data information, the data information is subjected to one-to-one investigation analysis, if one of the data information is invalid, the whole change command is possibly invalid, finally, an error result of the change command is obtained, and the error result is sent to the system, so that the system is prevented from sending the wrong change command again.
If the change command is judged not to carry data information, the conclusion that the change command is invalid is directly obtained without reanalyzing the reason.
Step S130: and executing the agent decomposition change command, perfecting the information and obtaining the instruction tree.
Preferably, the found execution agent is stored in an execution queue, and the execution agent stored in the execution queue is invoked by an execution engine in the computer to resolve the change command.
Specifically, each parameter in the execution agent includes a resolution character of a resolution change command, and illustratively, one or more data parameters in RE _ change _ target, and RE _ change _ environment of the execution agent Resolve1 include a partial decoding and/or a resolution keyword, respectively. The decomposition code and the decomposition key included in the plurality of data parameters form the entire decomposer.
Preferably, the decomposition code is an integer capable of decomposing the change command, different integers correspond to different change programs, the change programs referred to herein are programs that can be provided by the prior art, and the number corresponding to the change program can be preset by the system, for example, the number "2" corresponds to the name replacement in all change targets.
Preferably, each data parameter includes a sub-decoding, and as another embodiment, each data parameter includes a different sub-decoding. And adding the sub-component decoding to finally obtain the sub-component decoding.
Illustratively, the decomposed key words consist of the key words plus "[ ]", e.g., delete [ Drive: ] [ Path ], representing the location and name of the deleted file or set of files.
Through the above-mentioned sub-decoding and the decomposition key word combination, the decomposer of the unique decomposition change command is finally obtained, the decomposer is also the program code which can be executed by the computer, and each decomposer represents different program codes.
Illustratively, if the decomposer is "2: delete [ Drive: ] [ Path ] ", the change command is decomposed into a plurality of sub-change commands according to the program code corresponding to the decomposer.
It is noted that when a change command is broken into multiple subcommands, the subcommands should also contain the same type of data information as the change command.
As another embodiment, when the change command is very complex, the decomposed sub-change commands can be decomposed continuously, so that each sub-change command is finally an easily realized program, and the change command is finally realized in multiple steps.
As shown in fig. 2, for the instruction tree structure diagram provided by the present application, the sub command is decomposed into a plurality of sub change commands, such as sub change command 1, sub change command 2, and sub change command 3, further, the information is completed for each sub change command, data information such as a change target, a change type, and a change environment is generated, and an instruction tree of each change command is formed. It can be appreciated that the change command can be broken down into multiple sub-change commands, not limited to three.
Step S140: and creating a task flow corresponding to the instruction tree.
Specifically, a task flow corresponding to the instruction tree is automatically created according to the instruction tree of fig. 2, the task flow being a program code that a computer can execute a change command.
In one case, the execution is performed in order of the sub change commands, and in the other case, if there is a priority in the sub change commands or the data parameters, the execution is performed in order of the priority. Preferably, the priority of the sub change command is always greater than the priority of the data parameters, e.g. sub change command 2 has priority, the data parameters in sub change command 3 also have priority, and the sub change command is executed preferentially depending on the priority of the sub change command always being greater than the priority of the data parameters.
Preferably, the priority of the sub change command is set by a worker and can be changed.
Step S150: and executing the task flow to finish the execution change of the software.
And executing the change commands according to the created task flow in a certain sequence.
Fig. 3 is a system for executing a change command according to an embodiment of the present application.
As shown in fig. 3, a command receiving unit 301, a command analyzing unit 302, a command decomposing unit 303, a task flow creating unit 304, and an executing unit 305 are included.
As shown in fig. 4, the command analysis unit 302 includes a data parameter comparison module 401 and an execution agent lookup module 402. Preferably, the system further comprises a command judging module, an invalid signal sending module and an error analyzing module.
As shown in fig. 5, the command decomposition unit 303 includes a storage module 501 and a calling module 502.
The command receiving unit 301 is configured to receive a change command;
the command analysis unit 302 is connected to the command receiving unit 301, and configured to analyze the change command to obtain data information of the change command, where the data parameter comparison module 401 is configured to compare the data information of the change command with the data parameter of the execution agent, and search the execution agent corresponding to the change command through the execution agent search module 402 connected thereto.
Preferably, the system further comprises a command judgment module, wherein the command judgment module is used for judging whether the analyzed change command is valid, if the analyzed change command is invalid, the invalid signal sending module is called to send an invalid signal, and meanwhile, the error analysis module is called to perform error analysis on the invalid change command.
The command parsing unit 303 is connected to the command analysis unit 302 for parsing the change command by executing the agent and obtaining the instruction tree.
Further, the storage module 501 is configured to store the found execution agent in the execution queue; the calling module 502 is connected to the storage module 501 for calling the execution agent stored in the execution queue to decompose the change command.
The task flow creation unit 304 is connected to the command decomposition unit 303, and is configured to create a task flow corresponding to the instruction tree.
The execution unit 305 is connected to the task flow creation unit 304 for executing the change command according to the created task flow.
The application has the following beneficial effects:
(1) the method and the system for executing the change on the software can automatically and quickly execute the change command without manual change, and improve the execution time and the safety of the change command.
(2) The method and the system for executing the change to the software can quickly identify whether the change command is effective or not, provide an analysis result if the change command is ineffective, and avoid repeated sending of the ineffective change command.
Although the present application has been described with reference to examples, which are intended to be illustrative only and not to be limiting of the application, changes, additions and/or deletions may be made to the embodiments without departing from the scope of the application.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (10)

1. A method for executing changes to software, comprising the steps of:
receiving a change command;
analyzing the change command, and determining an execution agent corresponding to the change command;
executing the agent decomposition change command, perfecting the information and obtaining an instruction tree;
creating a task flow corresponding to the instruction tree;
executing the task flow, and executing the change command according to the specified sequence to complete the change of the software;
analyzing data information in the change command, and if the data information contained in the change command needs to be consistent with all information in the execution agent, determining that the execution agent is the execution agent needed by the change command;
decomposing the change command into a plurality of sub change commands, wherein each sub change command contains the same type of data information in the change command;
executing the agent to decompose the change command to form a plurality of sub-change commands, perfecting information for each sub-change command, generating data information such as change targets, change types and change environments, and forming an instruction tree of each change command;
if the sub-change command or the data parameter has priority, the sub-change command or the data parameter is executed in sequence according to the priority order; wherein the priority of the sub change command is always greater than the priority of the data parameter.
2. A method of performing changes to software as defined in claim 1, wherein the change command includes data information of the object, type, environment that requested the change.
3. The method of performing changes to software of claim 2, wherein the execution agent includes data parameters including information of changes to be performed, each data parameter corresponding one-to-one to the data information in the change command.
4. The method of claim 3, wherein if the data parameters of the executing agent correspond to the data information in the change command one to one, determining that the executing agent is the executing agent required by the change command; if not, the search is continued.
5. The method of performing changes to software of claim 1, further comprising determining whether the change command is valid when analyzing the change command, stopping the analysis if the change command is invalid, and sending a command invalidation signal.
6. A method for performing changes to software as defined in claim 3, wherein each data parameter in the execution agent includes a decomposer that uniquely decomposes the change command.
7. The method of performing changes to software of claim 6 wherein each data parameter includes a partial decode and a decomposed key, the partial decode and decomposed key combining to form a decomposer.
8. A system for executing changes to software includes a command receiving unit, a command analyzing unit, a command decomposing unit, a task flow creating unit, and an executing unit;
the command receiving unit is used for receiving a change command;
the command analysis unit is connected with the command receiving unit and used for analyzing the change command, obtaining the data information of the change command and obtaining the execution agent;
the command decomposition unit is connected with the command analysis unit and used for decomposing the change command by executing the agent and obtaining an instruction tree;
the task flow creating unit is connected with the command decomposing unit and used for creating a task flow corresponding to the instruction tree;
the execution unit is connected with the task flow creating unit and used for executing the change command according to the created task flow;
the command analysis unit analyzes data information in the change command, and if the data information contained in the change command needs to be consistent with all information in the execution agent, the execution agent is determined to be the execution agent needed by the change command;
wherein the command decomposition unit decomposes the change command into a plurality of sub-change commands each of which includes data information of the same type as the change command;
in the command decomposition unit, executing the agent decomposition change command to form a plurality of sub change commands, perfecting information for each sub change command, generating data information such as change targets, change types and change environments, and forming an instruction tree of each change command;
in the execution unit, if the sub-change command or the data parameter has a priority, the sub-change command or the data parameter is sequentially executed according to the priority order; wherein the priority of the sub change command is always greater than the priority of the data parameter.
9. The system for performing changes to software of claim 8, wherein the command decomposition unit comprises a storage module, a calling module;
the storage module is used for storing the searched execution agent in the execution queue;
the calling module is connected with the storage module and used for calling the execution agent stored in the execution queue and decomposing the change command.
10. The system for performing changes to software of claim 8, wherein the command analysis unit comprises a data parameter comparison module and an execute proxy lookup module;
the data parameter comparison module is used for comparing the data information of the change command with the data parameters of the execution agent and searching the execution agent corresponding to the change command through the connected execution agent searching module.
CN201811275802.8A 2018-10-30 2018-10-30 Method and system for executing change to software Active CN109375947B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811275802.8A CN109375947B (en) 2018-10-30 2018-10-30 Method and system for executing change to software

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811275802.8A CN109375947B (en) 2018-10-30 2018-10-30 Method and system for executing change to software

Publications (2)

Publication Number Publication Date
CN109375947A CN109375947A (en) 2019-02-22
CN109375947B true CN109375947B (en) 2021-04-20

Family

ID=65390415

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811275802.8A Active CN109375947B (en) 2018-10-30 2018-10-30 Method and system for executing change to software

Country Status (1)

Country Link
CN (1) CN109375947B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102171650A (en) * 2008-11-24 2011-08-31 英特尔公司 Systems, methods, and apparatuses to decompose a sequential program into multiple threads, execute said threads, and reconstruct the sequential execution
CN104423969A (en) * 2013-08-29 2015-03-18 国际商业机器公司 System and method for transparently enabling software applications with adaptive user interfaces
CN105229616A (en) * 2013-06-27 2016-01-06 英特尔公司 The pattern of tracking processing apparatus in instruction tracing system
CN105260223A (en) * 2015-10-27 2016-01-20 中国电子科技集团公司第四十一研究所 Method for defining, analyzing, executing and testing SCPI (standard commands for programmable instruments)
CN106789339A (en) * 2017-01-19 2017-05-31 北京仿真中心 A kind of distributed cloud emulation mode and system based on lightweight virtualization architecture

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102171650A (en) * 2008-11-24 2011-08-31 英特尔公司 Systems, methods, and apparatuses to decompose a sequential program into multiple threads, execute said threads, and reconstruct the sequential execution
CN105229616A (en) * 2013-06-27 2016-01-06 英特尔公司 The pattern of tracking processing apparatus in instruction tracing system
CN104423969A (en) * 2013-08-29 2015-03-18 国际商业机器公司 System and method for transparently enabling software applications with adaptive user interfaces
CN105260223A (en) * 2015-10-27 2016-01-20 中国电子科技集团公司第四十一研究所 Method for defining, analyzing, executing and testing SCPI (standard commands for programmable instruments)
CN106789339A (en) * 2017-01-19 2017-05-31 北京仿真中心 A kind of distributed cloud emulation mode and system based on lightweight virtualization architecture

Also Published As

Publication number Publication date
CN109375947A (en) 2019-02-22

Similar Documents

Publication Publication Date Title
US8996471B2 (en) Method and apparatus for providing help content corresponding to the occurrence of an event within a computer
CN112765023B (en) Test case generation method and device
CN108416199B (en) User permission control method and device of application and server
US10496818B2 (en) Systems and methods for software security scanning employing a scan quality index
CN111026670B (en) Test case generation method, test case generation device and storage medium
CN111597550A (en) Log information analysis method and related device
CN111930489B (en) Task scheduling method, device, equipment and storage medium
US8230406B2 (en) Compiler option consistency checking during incremental hardware design language compilation
CN116088846A (en) Processing method, related device and equipment for continuous integrated code format
US20170344461A1 (en) Automated exception resolution during a software development session based on previous exception encounters
CN109375947B (en) Method and system for executing change to software
CN113901083A (en) Heterogeneous data source operation resource analysis positioning method and equipment based on multiple analyzers
EP3014470A1 (en) Modifying an analytic flow
CN113760491A (en) Task scheduling system, method, equipment and storage medium
CN110717315B (en) System data batch modification method and device, storage medium and electronic equipment
CN111026531A (en) Task repeated sending processing method and device, computer equipment and storage medium
CN111416857A (en) Client crash processing method, device, system, equipment and storage medium
CN110990179A (en) Task processing method, device and equipment
CN111400128B (en) Log management method and device, computer equipment and storage medium
CN112328506B (en) Web end code detection system
CN114281688A (en) Codeless or low-code automatic case management method and device
CN113296786A (en) Data processing method and device, electronic equipment and storage medium
CN112069031A (en) Abnormal query method, device, equipment and computer readable storage medium
CN109471675B (en) Method and system for changing hardware
US7185318B1 (en) Method, system and computer program for comparing a first specification with a second specification

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
CB02 Change of applicant information

Address after: 075000, No. three, B District, 04 East Zone, Chahar Century Square, Hebei, Zhangjiakou

Applicant after: Zhangjiakou dachengyuan science and Technology Service Co.,Ltd.

Address before: 075000, No. three, B District, 04 East Zone, Chahar Century Square, Hebei, Zhangjiakou

Applicant before: ZHANGJIAKOU HAOYANG TECHNOLOGY Co.,Ltd.

CB02 Change of applicant information
TA01 Transfer of patent application right

Effective date of registration: 20201111

Address after: 101300 Beijing Shunyi District Airport Street, No. 1 Anhua Street, 1st Building, 1st Floor, No. 2159

Applicant after: BEIJING LONGPU INTELLIGENT TECHNOLOGY Co.,Ltd.

Address before: 075000, No. three, B District, 04 East Zone, Chahar Century Square, Hebei, Zhangjiakou

Applicant before: Zhangjiakou dachengyuan science and Technology Service Co.,Ltd.

TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20210402

Address after: 310051 Room 101, 1st floor, building F, No.3 Weiye Road, Puyan street, Binjiang District, Hangzhou City, Zhejiang Province

Applicant after: Hangzhou yanhun Network Technology Co.,Ltd.

Address before: 101300 Beijing Shunyi District Airport Street, No. 1 Anhua Street, 1st Building, 1st Floor, No. 2159

Applicant before: BEIJING LONGPU INTELLIGENT TECHNOLOGY Co.,Ltd.

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant