CN113961405B - State switching instruction verification method and device, electronic equipment and storage medium - Google Patents

Abstract

The disclosure provides a state switching instruction verification method, a state switching instruction verification device, electronic equipment and a storage medium, and relates to the field of artificial intelligence such as artificial intelligence chips and cloud computing, wherein the method comprises the following steps: for any type of state switching instruction, the following processing is executed on each switching object in the tested equipment in parallel: aiming at the state switching instructions which are sent to the switching objects and belong to any type, the state required to be switched by the state switching instructions is compared with the corresponding switched state, the switched state is the state after the switching objects are switched, and if the states are not consistent, error reporting processing is carried out. By applying the scheme disclosed by the disclosure, the verification efficiency can be improved.

Description

State switching instruction verification method, device, electronic equipment and storage medium

technical field

The present disclosure relates to the field of artificial intelligence technology, and in particular to a verification method, device, electronic equipment, and storage medium for state switching instructions in the fields of artificial intelligence chips and cloud computing.

Background technique

Chip systems, such as voice chips, have a large number of state switching instructions, such as reset state switching instructions and clock frequency switching state switching instructions.

At present, for the verification of state switching instructions, it is necessary to analyze and compare all signal lines in the verification platform in sequence, which is inefficient.

Contents of the invention

The disclosure provides a state switching instruction verification method, device, electronic equipment and storage medium.

A method for verifying a state switching instruction, comprising:

For any type of state switching instruction, perform the following processing on each switching object in the device under test in parallel:

For the state switching instruction sent to the switching object belonging to any one of the types, the state to which the state switching instruction is required to switch is compared with the corresponding switched state, and the switched state is the switching object If the state after switching is inconsistent, an error will be reported.

A state switching instruction verification device, comprising: a first processing module and a second processing module;

The first processing module is configured to perform the following processing on each switching object in the device under test in parallel for any type of state switching instruction: Comparing the state to which the state switching instruction requires to switch with the corresponding switched state, the switched state is the switched state of the switching object;

The second processing module is configured to report an error when the state to be switched to is inconsistent with the corresponding switched state.

An electronic device comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

The memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor, so that the at least one processor can perform the method as described above.

A non-transitory computer-readable storage medium storing computer instructions, the computer instructions are used to cause a computer to execute the method as described above.

A computer program product, comprising computer programs/instructions, when executed by a processor, implements the method as described above.

An embodiment in the above disclosure has the following advantages or beneficial effects: For any type of state switching instruction, each switching object in the device under test can be verified in parallel, and each switching object can be processed in parallel in the same way , thereby improving the verification efficiency, etc.

It should be understood that what is described in this section is not intended to identify key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will be readily understood through the following description.

Description of drawings

The accompanying drawings are used to better understand the present solution, and do not constitute a limitation to the present disclosure. in:

FIG. 1 is a flow chart of the first embodiment of the method for verifying state switching instructions described in the present disclosure;

FIG. 2 is a flow chart of the second embodiment of the state switching instruction verification method described in the present disclosure;

FIG. 3 is a schematic diagram of the composition and structure of an embodiment 300 of a state switching instruction verification device described in the present disclosure;

FIG. 4 shows a schematic block diagram of an electronic device 400 that may be used to implement embodiments of the present disclosure.

Detailed ways

Exemplary embodiments of the present disclosure are described below in conjunction with the accompanying drawings, which include various details of the embodiments of the present disclosure to facilitate understanding, and they should be regarded as exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

In addition, it should be understood that the term "and/or" in this article is only an association relationship describing associated objects, which means that there may be three relationships, for example, A and/or B may mean: A exists alone, and A exists at the same time. and B, there are three cases of B alone. In addition, the character "/" in this article generally indicates that the contextual objects are an "or" relationship.

FIG. 1 is a flow chart of a first embodiment of the method for verifying a state switching instruction in the present disclosure. As shown in FIG. 1 , the following specific implementation manners are included.

In step 101, for any type of state switching instruction, the process shown in step 102 is executed in parallel for each switching object in the device under test (DUT, Device UnderTest).

In step 102, for the state switching instruction sent to the switching object belonging to any one of the types, the state to which the state switching instruction is required to switch is compared with the corresponding post-switching state, and the post-switching state is the switching object switching state. If the last state is inconsistent, an error will be reported.

It can be seen that in the scheme described in the above method embodiment, for any type of state switching instruction, each switching object in the device under test can be verified in parallel, and each switching object can be processed in parallel in the same way, Thereby improving the verification efficiency and so on.

Different types of state switching instructions, such as reset state switching instructions and clock frequency switching state switching instructions, etc., can be processed according to the methods described in the present disclosure.

Taking the reset state switching command as an example, the switching object in the device under test can be a signal line, that is, the reset signal line independently controlled in the system. Display processing, that is, for any state switching instruction issued to the switching object and belonging to the reset category, the state to which the state switching instruction is required to switch is compared with the corresponding switched state, and if they are inconsistent, error processing can be performed.

In an embodiment of the present disclosure, for any state switching instruction sent to the switching object, the state to be switched to can be compared with the current state of the switching object, and if they are consistent, the state switching instruction for the state switching instruction can be terminated. For processing, if they are inconsistent, the state to be switched to can be further compared with the corresponding switched state.

If the state to be switched to is consistent with the current state of the switching object, it means that the current state is the state to be switched to, so that the processing of the state switching command can be directly ended, and subsequent processing procedures can be omitted, reducing resources and time consumption etc.

In an embodiment of the present disclosure, for each type of state switching instruction, a desired current state array can also be constructed respectively, in which the number of elements is equal to the number of switching objects, each element corresponds to a different switching object, and is used to record the corresponding The state of the switching object; correspondingly, the state of the switching object recorded in the expected current state array can be obtained as the current state of the switching object. In addition, if the state to be switched to is inconsistent with the current state of the switching object, you can also use the required switching The state update to expects the state of the toggle object as recorded in the current state array.

In one embodiment of the present disclosure, for each type of state switching instruction, an array of expected state after switching and an array of actual state after switching can also be constructed respectively. The number of elements in each array is equal to the number of switching objects, and each element in the same array They correspond to different switching objects, and the elements in each array are respectively a queue. Correspondingly, if the state to be switched to is inconsistent with the current state of the switching object, the state to be switched to can be added to the desired state after switching In the queue corresponding to the switching object in the array, in addition, the state change of the switching object can be collected, and the state after each change is added to the queue corresponding to the switching object in the actual switching state array, and further, after switching according to expectations The queues corresponding to the switching objects in the state array and the queues corresponding to the switching objects in the actual state array after switching respectively determine the switching states corresponding to the states to be switched to.

That is to say, preferably, for each type of state switching instruction, three arrays can be respectively constructed, which are respectively an array of expected current state, an array of expected state after switching and an array of actual state after switching.

Among them, the expected switched state array is used to store the state that the state switching instruction requires to switch to, and is compared with the corresponding state in the actual switched state array as the expected value, and the number of elements in the expected switched state array is equal to the number of switching objects, Each element corresponds to a different switching object, and the elements in each array are respectively a queue.

The actual switched state array is used to store the switched state of the switched object, the number of elements in it is equal to the number of switched objects, and each element corresponds to a different switched object, and the elements in each array are respectively a queue.

The expected current state array is used to store the expected current state of the switching object, and the number of elements therein is equal to the number of switching objects, each element corresponds to a different switching object, and is used to record the state of the corresponding switching object.

In the initial state, each queue in the expected state array after switching and the actual state array after switching is empty, and the initial value of each element in the expected current state array is the power-on initialization state of each switching object in the device under test.

For any state switching instruction issued to the switching object, the state of the switching object recorded in the expected current state array can be obtained first, as the current state of the switching object, and then the state that the state switching instruction requires to switch to can be compared with the current state of the switching object If they are consistent, the processing of the state switching instruction can be ended directly. If they are not consistent, the state of the switching object recorded in the expected current state array can be updated by using the state required to switch to, that is, the recorded switching object The state is updated to the state required to switch to, and the state required to be switched can be added to the queue corresponding to the switching object in the expected switching state array, that is, added to the end of the queue. In addition, the state change of the switching object can be collected in real time, and The state after each change can be added to the queue corresponding to the switching object in the actual switching state array, that is, when the state of the switching object changes each time, the changed state can be added to the actual switching state array In the queue corresponding to the switching object, the change may be caused by the execution of the corresponding state switching instruction, or may be caused by other reasons, for example, the switching object has switched by itself by mistake.

With the help of the above-mentioned arrays, the different states required can be recorded conveniently and accurately, thus laying a good foundation for subsequent processing. Moreover, in the expected state array after switching and the actual state array after switching, the same Switching the state corresponding to the object is stored to ensure that the state stored first will not be overwritten when it is not processed. In addition, the above-mentioned array method can be used to achieve flexible expansion. For example, if it is necessary to increase the number of state switching instructions of the same type, only It is only necessary to increase the dimension (number of elements) of each array. If it is necessary to increase the category of state switching instructions, it is only necessary to increase the corresponding array, which is very flexible and convenient.

As mentioned above, for any state switching instruction sent to the switching object, the state to which the state switching instruction requires to switch can be compared with the corresponding switched state. In an embodiment of the present disclosure, the switched states corresponding to the states to be switched to can be determined respectively according to the queue corresponding to the switching object in the expected switched state array and the queue corresponding to the switching object in the actual switched state array.

In one embodiment of the present disclosure, when the two queues corresponding to the switching object are both non-empty, the two states in the same position in the two queues (for example, both are in the first position in the queue, etc.) can be regarded as one state The first state in the state pair can be used as the switched state corresponding to the second state in the state pair, wherein the first state is the state taken out from the queue corresponding to the switching object in the actual switched state array, The second state is the state taken from the queue corresponding to the switching object in the desired state array after switching.

For example, assume that a switch object corresponds to queue 1 in the expected state array after switching and queue 2 in the actual state array after switching. When both queue 1 and queue 2 are not empty, suppose that queue 1 includes two requirements The states to switch to are state a and state b respectively. Queue 2 includes a state after switching, which is state A. State a and state b correspond to different state switching instructions respectively. Suppose state A is the one corresponding to state a after execution The switched state of the switching object after the state switching instruction, due to the processing delay, etc., the state switching instruction corresponding to the state b has not been executed at this time, correspondingly, only the state A is included in the queue 2, and the execution is not included The state B corresponding to the state switching instruction after the switching object is switched. Since queue 1 and queue 2 are both non-empty, the two states in the same position in the two queues can be taken out as a state pair, and can be taken out A state pair composed of state a and state A, and state A can be used as the switched state corresponding to state a, assuming that state B is added to queue 2 later, then the state pair composed of state b and state B can be further taken out, and can be Let state B be the switched state corresponding to state b.

The two states in the state pair taken out each time can be compared. If they are not consistent, it means that the state switching instruction does not match the state switching execution. Correspondingly, error processing can be performed.

It can be seen that with the above processing method, as long as the two queues corresponding to the switching object are not empty, the state pair can be retrieved and compared without waiting for all state switching instructions to be processed, thereby improving processing efficiency, etc. .

In one embodiment of the present disclosure, when all state switching instructions that need to be sent to the switching object are processed, if no error occurs, it can be determined that the state switching instruction for the switching object has passed the verification.

Assuming that a total of 50 state switching instructions need to be issued to a certain switching object, these 50 state switching instructions can belong to the same category, then when the 50 state switching instructions are all processed, if no error occurs, it can be determined This type of state switching instruction for the switching object passes the verification, and other types of state switching instructions can be processed in the same manner. The sending order of each state switching instruction can be determined according to actual needs.

Assuming that no error occurs when all 50 state switching instructions are processed for the above switching object, then it can be determined that the state switching instruction for the switching object has passed the verification.

In one embodiment of the present disclosure, when all state switching instructions that need to be sent to the switching object are processed, if the queue corresponding to the switching object in the actual switching state array is not empty and the queue corresponding to the switching object in the expected switching state array is If the queue is empty, it can be determined that there is an error that there is no corresponding state switching instruction but the state switching is performed.

For example, for a switching object, 4 (only for example, the actual may be much larger than this) state switching instructions are issued to it in sequence. There are 4 states to be switched to, which are state a, state b, state c and state d respectively. However, in the queue corresponding to the switching object in the actual switching state array, a total of 5 switching states are stored before and after the switching, which are state A, state B, state C, state X, and state D, wherein state A is the state after state switching according to the state switching instruction corresponding to state a, and state B is the state after state switching according to the state switching instruction corresponding to state b State, state C is the state after state switching according to the state switching instruction corresponding to state c, state D is the state after state switching according to the state switching instruction corresponding to state d, and state X is the state switching due to unknown reasons , in this way, four state pairs of state a and state A, state b and state B, state c and state C, state d and state X can be sequentially taken out, among which, for the state pair composed of state d and state X, the Error processing, in addition, there will be a state D left in the state array after the actual switching, that is, the queue corresponding to the switching object in the actual switching state array is not empty and the queue corresponding to the switching object in the expected switching state array is empty, Then it can be determined that there is an error that there is no corresponding state switching instruction but the state switching is performed.

In one embodiment of the present disclosure, when all state switching instructions that need to be sent to the switching object are processed, if the queue corresponding to the switching object in the expected state array after switching is not empty but the queue corresponding to the switching object in the actual switching state array is If the queue is empty, it can be determined that the corresponding state switching error has not been performed according to the state switching instruction.

For example, for a switching object, four state switching instructions are issued to it in sequence. Correspondingly, a total of 4 states to be switched to are stored in the queue corresponding to the switching object in the expected state array after switching, which are state a, state b, state c, and state d, but in the queue corresponding to the switching object in the actual switching state array, a total of 3 switching states are stored before and after, which are state A, state B, and state D respectively. Among them, state A It is the state after state switching according to the state switching instruction corresponding to state a, state B is the state after state switching according to the state switching instruction corresponding to state b, and state D is the state after switching according to the state switching instruction corresponding to state d In this way, three state pairs of state a and state A, state b and state B, state c and state D can be taken out in sequence. Among them, for the state pair composed of state c and state D, error processing will be performed. In addition, It is expected that there will be a state d left in the state array after switching, that is, the queue corresponding to the switching object in the expected switching state array is not empty but the queue corresponding to the switching object in the actual switching state array is empty, then it can be determined that there is a The error of not performing the corresponding state switching according to the state switching instruction, as above, is not performing the corresponding state switching according to the state switching instruction corresponding to state c.

Through the above processing, it can be seen that when all the state switching instructions that need to be sent to the switching object are processed, the error type can be determined by checking whether the expected switching state array and the actual switching state array are empty, so as to enrich Verification results are provided, and more available information is provided for verifiers.

Based on the above introduction, FIG. 2 is a flow chart of a second embodiment of the method for verifying a state switching instruction in the present disclosure. As shown in FIG. 2 , the following specific implementation manners are included.

In step 201, for any type of state switching instruction, respectively construct the expected switching state array, the actual switching state array and the expected current state array, the number of elements in each array is equal to the number of switching objects in the device under test, Each element in the same array corresponds to a different switching object, and the elements in the expected switching state array and the actual switching state array are respectively a queue.

In the initial state, each queue in the expected state array after switching and the actual state array after switching is empty, and the initial value of each element in the expected current state array can be the power-on initialization state of each switching object in the device under test.

In step 202, for each switching object in the device under test, processing is performed in parallel in the manner shown in steps 203-209.

In step 203 , for any state switching instruction of the category currently issued to the switching object, the state of the switching object recorded in the expected current state array is obtained as the current state of the switching object.

In step 204, it is determined whether the state required to be switched by the state switching instruction is consistent with the current state of the switching object, if yes, execute step 203, otherwise, execute step 205.

If the state to be switched to is consistent with the current state of the switching object, then step 203 can be executed to continue processing the next state switching instruction.

In step 205, update the state of the switching object recorded in the expected current state array with the state that requires switching to, and add the state that requires switching to the queue corresponding to the switching object in the expected switching state array, and then perform the steps 203 and step 207.

In addition to updating the state of the switching object recorded in the expected current state array and adding the state to be switched to to the queue corresponding to the switching object in the expected switching state array, the state switching instruction can also be executed, and then the steps can be executed 203 , the next state switching instruction can be continued to be processed, and step 207 can be executed when the condition is met.

In step 206, the state change of the switching object is collected, and the state after each change is respectively added to the queue corresponding to the switching object in the actual switched state array, and then step 207 can be executed.

In step 207, when the two queues corresponding to the switching object are not empty, the two states in the same position in the two queues are taken out as a state pair, and the first state in the state pair is taken as the state pair The switched state corresponding to the second state of , the first state is taken from the queue corresponding to the switched object in the actual switched state array, and the second state is taken from the queue corresponding to the switched object in the expected switched state array state.

In step 208, the two states in each state pair extracted are compared respectively, and if they are inconsistent, an error is reported.

If they are consistent, no processing is required.

In step 209, when all state switching instructions that need to be sent to the switching object are processed, if no error occurs, it is determined that the state switching instruction for the switching object has passed the verification.

Further, when all state switching instructions that need to be sent to the switching object are processed, if the queue corresponding to the switching object in the actual switching state array is not empty and the queue corresponding to the switching object in the expected switching state array is empty, you can It is determined that there is an error that there is no corresponding state switching instruction but the state switching is performed.

When all state switching instructions that need to be sent to the switching object are processed, if the queue corresponding to the switching object in the expected state array after switching is not empty but the queue corresponding to the switching object in the actual switching state array is empty, it can be determined that a The corresponding state switching error is not performed according to the state switching instruction.

It should be noted that, for the foregoing method embodiments, for the sake of simple description, they are expressed as a series of action combinations, but those skilled in the art should know that the present disclosure is not limited by the described action sequence, because Certain steps may be performed in other orders or simultaneously in accordance with the present disclosure. Secondly, those skilled in the art should also know that the embodiments described in the specification belong to preferred embodiments, and the actions and modules involved are not necessarily required by the present disclosure. In addition, for parts not described in detail in a certain embodiment, reference may be made to relevant descriptions in other embodiments.

In a word, adopting the scheme described in the disclosed method embodiment can realize centralized management of state switching instructions, process-based execution, batch operation, etc., and supports multiple sending of the same instruction, and can meet the needs of various projects, and has universal applicability In addition, flexible expansion can be realized. For example, if you need to increase the number of state switching instructions of the same type, you only need to increase the dimensions of each array. If you need to increase the type of state switching instructions, you only need to increase the corresponding array. It is very flexible and convenient. .

The above is the introduction of the method embodiments, and the solution of the present disclosure will be further described through the device embodiments below.

FIG. 3 is a schematic diagram of the composition and structure of an embodiment 300 of a state switching instruction verification device in the present disclosure. As shown in FIG. 3 , it includes: a first processing module 301 and a second processing module 302 .

The first processing module 301 is configured to perform the following processing on each switching object in the device under test in parallel for any type of state switching instruction: for any state switching instruction sent to the switching object and belonging to the state switching instruction, change the state The switching instruction requires the switching state to be compared with the corresponding switching state, and the switching state is the switching state of the switching object.

The second processing module 302 is configured to report an error when the state to be switched to is inconsistent with the corresponding state after switching.

In the scheme described in the above-mentioned device embodiment, for any type of state switching instruction, each switching object in the device under test can be verified in parallel, that is, each switching object can be processed in parallel in the same way, thereby improving verification efficiency etc.

In an embodiment of the present disclosure, for any state switching instruction issued to the switching object, the first processing module 301 can also compare the state to be switched to with the current state of the switching object. If the processing of the state switching instruction is inconsistent, the state to be switched to can be further compared with the corresponding state after switching.

If the state to be switched to is consistent with the current state of the switching object, it means that the current state is the state to be switched to, so that the processing of the state switching instruction can be ended directly.

In an embodiment of the present disclosure, for each type of state switching instruction, the first processing module 301 can also separately construct an array of expected current states, in which the number of elements is equal to the number of switching objects, and each element corresponds to a different switching object, respectively It is used to record the state of the corresponding switching object; correspondingly, the state of the switching object recorded in the expected current state array can be obtained as the current state of the switching object. In addition, if the state to be switched to is inconsistent with the current state of the switching object, The state of the switching object recorded in the desired current state array can also be updated with the state to which switching is required.

In an embodiment of the present disclosure, for each type of state switching instruction, the first processing module 301 can also separately construct the expected switching state array and the actual switching state array, and the number of elements in each array is equal to the number of switching objects, the same Each element in the array corresponds to a different switching object, and the elements in each array are respectively a queue. Correspondingly, if the state to be switched to is inconsistent with the current state of the switching object, the state to be switched to can be added to In the queue corresponding to the switching object in the expected switching state array, in addition, the state change of the switching object can be collected, and the state after each change is added to the queue corresponding to the switching object in the actual switching state array. Further, According to the queue corresponding to the switching object in the expected switching state array and the queue corresponding to the switching object in the actual switching state array, the switching state corresponding to each required switching state can be determined respectively.

That is to say, preferably, for each type of state switching instruction, three arrays can be respectively constructed, which are respectively an array of expected current state, an array of expected state after switching and an array of actual state after switching.

Among them, the expected switched state array is used to store the state that the state switching instruction requires to switch to, and is compared with the corresponding state in the actual switched state array as the expected value, and the number of elements in the expected switched state array is equal to the number of switching objects, Each element corresponds to a different switching object, and the elements in each array are respectively a queue.

The actual switched state array is used to store the switched state of the switched object, the number of elements in it is equal to the number of switched objects, and each element corresponds to a different switched object, and the elements in each array are respectively a queue.

The expected current state array is used to store the expected current state of the switching object, and the number of elements therein is equal to the number of switching objects, each element corresponds to a different switching object, and is used to record the state of the corresponding switching object.

In the initial state, each queue in the expected state array after switching and the actual state array after switching is empty, and the initial value of each element in the expected current state array is the power-on initialization state of each switching object in the device under test.

For any state switching instruction issued to the switching object, the state of the switching object recorded in the expected current state array can be obtained first, as the current state of the switching object, and then the state that the state switching instruction requires to switch to can be compared with the current state of the switching object If they are consistent, the processing of the state switching instruction can be ended directly. If they are not consistent, the state of the switching object recorded in the expected current state array can be updated by using the state required to switch to, that is, the recorded switching object The state is updated to the state required to switch to, and the state required to be switched can be added to the queue corresponding to the switching object in the expected switching state array, that is, added to the end of the queue. In addition, the state change of the switching object can be collected in real time, and The state after each change can be added to the queue corresponding to the switching object in the actual switching state array, that is, when the state of the switching object changes each time, the changed state can be added to the actual switching state array In the queue corresponding to the switching object, the change may be caused by the execution of the corresponding state switching instruction, or may be caused by other reasons, for example, the switching object has switched by itself by mistake.

In an embodiment of the present disclosure, the first processing module 301 can respectively determine the queues corresponding to the states to be switched to according to the queues corresponding to the switching objects in the expected state array after switching and the queues corresponding to the switching objects in the actual switching state array. state after switching.

In an embodiment of the present disclosure, the first processing module 301 can take out the two states at the same position in the two queues as a state pair when the two queues corresponding to the switching object are not empty, and can take the state The first state in the pair is the switched state corresponding to the second state in the state pair, wherein the first state is the state taken from the queue corresponding to the switching object in the actual switched state array, and the second state is the state taken from the expected switching The state retrieved from the queue corresponding to the toggle object in the post-state array.

The first processing module 301 can compare the two states in the state pair taken out each time. If they are inconsistent, it indicates that the state switching instruction does not match the state switching execution situation. Correspondingly, the second processing module can 302 for error processing.

In an embodiment of the present disclosure, the second processing module 302 may determine that the state switching instruction for the switching object passes the verification if no error occurs when all the state switching instructions that need to be sent to the switching object are processed.

In an embodiment of the present disclosure, the second processing module 302 can process all the state switching instructions that need to be sent to the switching object, if the queue corresponding to the switching object in the actual switching state array is not empty and the expected switching If the queue corresponding to the switching object in the state array is empty, it is determined that there is an error that there is no corresponding state switching instruction but the state switching is performed.

In one embodiment of the present disclosure, the second processing module 302 can process all the state switching instructions that need to be sent to the switching object, if the queue corresponding to the switching object in the desired state array after switching is not empty and the actual switching If the queue corresponding to the switching object in the state array is empty, it is determined that an error has occurred that the corresponding state switching has not been performed according to the state switching instruction.

For the specific working process of the device embodiment shown in FIG. 3 , reference may be made to the relevant descriptions in the foregoing method embodiments.

In a word, adopting the scheme described in the embodiment of the disclosed device can realize centralized management of state switching instructions, process execution and batch operation, etc., and supports the situation of sending the same instruction multiple times, and can meet the needs of various projects, and has universal applicability In addition, flexible expansion can be realized. For example, if you need to increase the number of state switching instructions of the same type, you only need to increase the dimensions of each array. If you need to increase the type of state switching instructions, you only need to increase the corresponding array. It is very flexible and convenient. .

The solution described in the present disclosure can be applied to the field of artificial intelligence, and particularly relates to fields such as artificial intelligence chips and cloud computing. Artificial intelligence is a discipline that studies how to make computers simulate certain human thinking processes and intelligent behaviors (such as learning, reasoning, thinking, planning, etc.). It includes both hardware-level technology and software-level technology. Artificial intelligence hardware technology generally includes such Sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, big data processing and other technologies, artificial intelligence software technology mainly includes computer vision technology, speech recognition technology, natural language processing technology and machine learning/deep learning, big data processing technology, Several major directions such as knowledge graph technology.

In addition, in the technical solution of the disclosure, the collection, storage, use, processing, transmission, provision, and disclosure of user personal information involved are all in compliance with relevant laws and regulations, and do not violate public order and good customs.

According to the embodiments of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium, and a computer program product.

FIG. 4 shows a schematic block diagram of an electronic device 400 that may be used to implement embodiments of the present disclosure. Electronic device is intended to represent various forms of digital computers, such as laptops, desktops, workstations, servers, blade servers, mainframes, and other suitable computers. Electronic devices may also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are by way of example only, and are not intended to limit implementations of the disclosure described and/or claimed herein.

As shown in FIG. 4, the device 400 includes a computing unit 401 that can execute according to a computer program stored in a read-only memory (ROM) 402 or loaded from a storage unit 408 into a random access memory (RAM) 403. Various appropriate actions and treatments. In the RAM 403, various programs and data necessary for the operation of the device 400 can also be stored. The computing unit 401 , ROM 402 and RAM 403 are connected to each other through a bus 404 . An input/output (I/O) interface 405 is also connected to bus 404 .

Multiple components in the device 400 are connected to the I/O interface 405, including: an input unit 406, such as a keyboard, a mouse, etc.; an output unit 407, such as various types of displays, speakers, etc.; a storage unit 408, such as a magnetic disk, an optical disk, etc. ; and a communication unit 409, such as a network card, a modem, a wireless communication transceiver, and the like. The communication unit 409 allows the device 400 to exchange information/data with other devices over a computer network such as the Internet and/or various telecommunication networks.

The computing unit 401 may be various general-purpose and/or special-purpose processing components having processing and computing capabilities. Some examples of computing units 401 include, but are not limited to, central processing units (CPUs), graphics processing units (GPUs), various dedicated artificial intelligence (AI) computing chips, various computing units that run machine learning model algorithms, digital signal processing processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 401 executes the various methods and processes described above, such as the methods described in this disclosure. For example, in some embodiments, the methods described in the present disclosure may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as storage unit 408 . In some embodiments, part or all of the computer program may be loaded and/or installed on the device 400 via the ROM 402 and/or the communication unit 409 . When a computer program is loaded into RAM 403 and executed by computing unit 401, one or more steps of the methods described in this disclosure may be performed. Alternatively, in other embodiments, the computing unit 401 may be configured in any other appropriate way (for example, by means of firmware) to execute the methods described in the present disclosure.

Various implementations of the systems and techniques described herein above may be implemented in digital electronic circuitry, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips system (SOC), load programmable logic device (CPLD), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include being implemented in one or more computer programs executable and/or interpretable on a programmable system including at least one programmable processor that The processor, which may be a special purpose or general-purpose programmable processor, may receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device an output device.

Program codes for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special purpose computer, or other programmable data processing devices, so that the program codes, when executed by the processor or controller, make the functions/functions specified in the flow diagrams and/or block diagrams Action is implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media would include one or more wire-based electrical connections, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM or flash memory), fiber optics, compact disk read only memory (CD-ROM), optical storage, magnetic storage, or any suitable combination of the foregoing.

To provide for interaction with the user, the systems and techniques described herein can be implemented on a computer having a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user. ); and a keyboard and pointing device (eg, a mouse or a trackball) through which a user can provide input to the computer. Other kinds of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (eg, visual feedback, auditory feedback, or tactile feedback); and can be in any form (including acoustic input, voice input, or tactile input) to receive input from the user.

The systems and techniques described herein may be implemented on a computing system that includes back-end components (eg, as a data server), or a computing system that includes middleware components (eg, an application server), or a computing system that includes front-end components (eg, a user's computer having a graphical user interface or web browser through which a user may interact with implementations of the systems and techniques described herein), or including such backend components, middleware components, Or any combination of front-end components in a computing system. The components of the system may be interconnected by any form or medium of digital data communication (eg, a communication network). Examples of communication networks include: Local Area Network (LAN), Wide Area Network (WAN) and the Internet.

A computer system may include clients and servers. Clients and servers are generally remote from each other and usually interact through a communication network. The relationship of client and server arises by computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, a server of a distributed system, or a server combined with a blockchain.

It should be understood that steps may be reordered, added or deleted using the various forms of flow shown above. For example, each step described in the present disclosure may be executed in parallel, sequentially, or in a different order, as long as the desired result of the technical solution disclosed in the present disclosure can be achieved, no limitation is imposed herein.

The specific implementation manners described above do not limit the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modifications, equivalent replacements and improvements made within the spirit and principles of the present disclosure shall be included within the protection scope of the present disclosure.

Claims (14)

1. A method for verifying a state switching instruction comprises the following steps:

for any type of state switching instruction, the following processing is executed on each switching object in the tested equipment in parallel:

aiming at the state switching instruction which is sent to the switching object and belongs to any type, comparing the state which is required to be switched by the state switching instruction with the corresponding switched state, wherein the switched state is the state after the switching object is switched, and if the state is not consistent, carrying out error reporting processing; the state switching instruction comprises a reset state switching instruction, and the switching object comprises a signal line;

further comprising: aiming at any type of state switching instruction, an expected switched state array and an actual switched state array are constructed, the number of elements in each array is equal to the number of the switching objects, each element in the same array corresponds to different switching objects respectively, and the elements in each array are a queue respectively;

if the state required to be switched is not consistent with the current state of the switching object, adding the state required to be switched into a queue corresponding to the switching object in the state array after expected switching; collecting state changes of the switching object, and respectively adding the state after each change into a queue corresponding to the switching object in the actual switched state array;

determining the switched state corresponding to each state required to be switched according to the queue corresponding to the switching object in the state array after expected switching and the queue corresponding to the switching object in the state array after actual switching in the following modes: and when both the queues corresponding to the switching object are non-empty, taking out two states at the same position in the two queues as a state pair, and taking a first state in the state pair as the switched state corresponding to a second state in the state pair, wherein the first state is taken out from the queue corresponding to the switching object in the actual switched state array, and the second state is taken out from the queue corresponding to the switching object in the expected switched state array.

2. The method of claim 1, further comprising:

and comparing the state required to be switched with the current state of the switching object, if the state required to be switched is consistent with the current state of the switching object, ending the processing aiming at the state switching instruction, and if the state required to be switched is inconsistent with the current state of the switching object, comparing the state required to be switched with the corresponding switched state.

3. The method of claim 2, further comprising:

aiming at any type of state switching instruction, constructing an expected current state array, wherein the number of elements is equal to the number of switching objects, and each element corresponds to different switching objects and is used for recording the state of the corresponding switching object;

acquiring the state of the switching object recorded in the expected current state array as the current state of the switching object;

and if the state required to be switched to is not consistent with the current state of the switching object, updating the state of the switching object recorded in the expected current state array by using the state required to be switched to.

4. The method of any of claims 1~3, further comprising:

and when all the state switching instructions which need to be sent to the switching object are processed, if no error is reported, determining that the state switching instructions aiming at the switching object pass the verification.

5. The method of claim 1, further comprising:

when all the state switching instructions which need to be sent to the switching object are processed, if the queue corresponding to the switching object in the actual switched state array is not empty and the queue corresponding to the switching object in the expected switched state array is empty, determining that an error that the corresponding state switching instruction does not exist but the state switching is performed occurs.

6. The method of claim 1 or 5, further comprising:

when all state switching instructions which need to be sent to the switching object are processed, if the queue corresponding to the switching object in the state array after the expected switching is not empty and the queue corresponding to the switching object in the state array after the actual switching is empty, determining that an error of not performing corresponding state switching according to the state switching instructions occurs.

7. A state switching instruction validation apparatus comprising: the device comprises a first processing module and a second processing module;

the first processing module is configured to, for any type of state switching instruction, execute the following processing in parallel on each switching object in the device under test: aiming at the state switching instruction which is sent to the switching object and belongs to any type, comparing the state which is required to be switched by the state switching instruction with the corresponding switched state, wherein the switched state is the state after the switching object is switched; the state switching instruction comprises a reset state switching instruction, and the switching object comprises a signal line;

the second processing module is configured to perform error reporting processing when the state required to be switched is inconsistent with the corresponding switched state;

the first processing module is further configured to construct an expected switched state array and an actual switched state array for the state switching instruction of any type, where the number of elements in each array is equal to the number of the switching objects, the elements in the same array correspond to different switching objects, and the elements in each array are a queue; if the state required to be switched is not consistent with the current state of the switching object, adding the state required to be switched into a queue corresponding to the switching object in the state array after expected switching; collecting state changes of the switching object, and respectively adding the state after each change into a queue corresponding to the switching object in the state array after actual switching; determining the switched state corresponding to each state required to be switched according to the queue corresponding to the switching object in the state array after expected switching and the queue corresponding to the switching object in the state array after actual switching in the following modes: and when both the queues corresponding to the switching object are non-empty, taking out two states at the same position in the two queues as a state pair, and taking a first state in the state pair as the switched state corresponding to a second state in the state pair, wherein the first state is taken out from the queue corresponding to the switching object in the actual switched state array, and the second state is taken out from the queue corresponding to the switching object in the expected switched state array.

8. The apparatus of claim 7, wherein,

the first processing module is further configured to compare the state to which the switching request is to be switched with the current state of the switching object, if the state to which the switching request is to be switched is consistent with the current state of the switching object, the processing for the state switching instruction is ended, and if the state to which the switching request is to be switched is not consistent with the current state of the switching object, the state to which the switching request is to be switched is compared with the corresponding switched state.

9. The apparatus of claim 8, wherein,

the first processing module is further configured to construct an expected current state array for the state switching instruction of any type, where the number of elements is equal to the number of the switching objects, and each element corresponds to a different switching object and is used to record the state of the corresponding switching object; acquiring the state of the switching object recorded in the expected current state array as the current state of the switching object; and if the state required to be switched to is not consistent with the current state of the switching object, updating the state of the switching object recorded in the expected current state array by using the state required to be switched to.

10. The apparatus of any one of claims 7~9,

the second processing module is further configured to, when all the state switching instructions that need to be sent to the switching object are processed completely, determine that the state switching instruction for the switching object passes verification if an error is not reported.

11. The apparatus of claim 7, wherein,

the second processing module is further configured to, when all state switching instructions that need to be sent to the switching object are processed, determine that an error occurs in which a corresponding state switching instruction does not exist but state switching is performed if the queue corresponding to the switching object in the state array after actual switching is not empty and the queue corresponding to the switching object in the state array after expected switching is empty.

12. The apparatus of claim 7 or 11,

the second processing module is further configured to, when all state switching instructions that need to be issued to the switching object are processed completely, determine that an error that a corresponding state switching is not performed according to a state switching instruction occurs if a queue corresponding to the switching object in the state array after expected switching is not empty and a queue corresponding to the switching object in the state array after actual switching is empty.

13. An electronic device, comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-6.

14. A non-transitory computer readable storage medium having stored thereon computer instructions for causing a computer to perform the method of any one of claims 1-6.

Images