CN110659065A - Data processing method and device, electronic equipment and storage medium - Google Patents
Data processing method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN110659065A CN110659065A CN201810716524.9A CN201810716524A CN110659065A CN 110659065 A CN110659065 A CN 110659065A CN 201810716524 A CN201810716524 A CN 201810716524A CN 110659065 A CN110659065 A CN 110659065A
- Authority
- CN
- China
- Prior art keywords
- pointer
- queue
- data
- preset
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/30003—Arrangements for executing specific machine instructions
- G06F9/3004—Arrangements for executing specific machine instructions to perform operations on memory
Abstract
The embodiment of the application provides a data processing method and device, electronic equipment and a storage medium, and belongs to the technical field of computers. The method comprises the following steps: receiving a data operation instruction, wherein the data operation instruction is used for instructing data operation processing on target data of a target type, determining a first pointer corresponding to the target data, the first pointer being a preset general type pointer, calling a preset queue operation function, and performing data operation processing on the target data according to the first pointer and a preset element size corresponding to the target type. By adopting the method and the device, technical personnel do not need to rewrite program codes and establish queues aiming at different types of data, and the labor cost is reduced.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for data processing, an electronic device, and a storage medium.
Background
Currently, in the process of processing data, an electronic device usually stores data to be processed in a queue manner.
When the queue is used for storing data, the electronic device first establishes an array containing a plurality of elements, wherein the array is an array of a specific type to store the data of the type, such as an int type, a float type or a struct structure. The terminal may set pointers to the array, including a head of line pointer and a tail of line pointer. When the electronic equipment receives the service data of the type, the electronic equipment judges whether the queue is full according to a preset queue full judgment rule, if the queue is not full, the service data is used as an element and stored in the array, and the tail pointer of the queue is added with 1. When the electronic device needs to read the service data from the queue, the electronic device reads the service data from the queue according to the address information of the service data needing to be read in the queue, and then adds 1 to the head of queue pointer.
Based on the prior art, the array of the queue is a certain type of data, and when the array is operated, the pointer in the operation function must be the pointer of the type. When the type of the element changes, the array needs to be redefined and the function needs to be reconstructed correspondingly. Therefore, technicians need to rewrite program code to establish queues for storing different types of data, resulting in higher labor costs.
Disclosure of Invention
An object of the embodiments of the present application is to provide a data processing method, an apparatus, an electronic device, and a storage medium, in which technicians do not need to rewrite program codes and establish queues for different types of data, thereby reducing labor cost. The specific technical scheme is as follows:
in a first aspect, a method for data processing is provided, the method comprising:
receiving a data operation instruction, wherein the data operation instruction is used for indicating data operation processing on target data of a target type;
determining a first pointer corresponding to the target data, wherein the first pointer is a pointer of a preset general type;
and calling a preset queue operation function, and performing data operation processing on the target data according to the first pointer and the preset element size corresponding to the target type.
Optionally, when the data operation instruction is a write instruction, the data operation instruction carries target data of a target type to be written;
the determining of the first pointer corresponding to the target data includes:
acquiring target data of the target type to be written, and storing the target data into a preset first storage space;
acquiring a second pointer of the target data in the first storage space;
and converting the second pointer into a first pointer of a preset general pointer type.
Optionally, the invoking a preset queue operation function, and performing data operation processing on the target data according to the first pointer and a preset element size corresponding to the target type includes:
calling a preset queue write function, and reading the target data from the first storage space according to the first pointer and the preset element size corresponding to the target type;
and storing the target data into a second storage space corresponding to the queue, and updating a queue tail pointer of the queue according to a preset pointer updating rule.
Optionally, when the data operation instruction is a read instruction, the determining a first pointer corresponding to the target data includes:
acquiring a first pointer of target data of a target type to be read in a queue, wherein the first pointer is a pointer of a storage space pointed by a head pointer of the queue.
Optionally, the invoking a preset queue operation function, and performing data operation processing on the target data according to the first pointer and a preset element size corresponding to the target type includes:
and calling a preset queue reading function, reading the target data from a second storage space corresponding to the queue according to the first pointer and the preset data size corresponding to the target type, and updating a head pointer of the queue according to a preset pointer updating rule.
Optionally, after the target data is read from the second storage space corresponding to the queue, the method further includes:
and converting the first pointer into a third pointer of the target type, and sending the third pointer to an upper application program so that the upper application program calls the target data through the third pointer.
Optionally, the method further includes:
receiving a queue setting instruction input by a user, wherein the queue setting instruction carries the element size corresponding to the target type and the cache address of the second storage space corresponding to the queue;
and determining a pointer updating rule according to the pointer of the second storage space and the element size, so as to determine a pointer pointed by a queue pointer according to the pointer of the second storage space and the element size when performing data operation processing on the target data, wherein the pointer of the second storage space points to a head address of the second storage space, and the queue pointer comprises a head pointer and a tail pointer.
In a second aspect, an apparatus for data processing is provided, the apparatus comprising:
the first receiving module is used for receiving a data operation instruction, and the data operation instruction is used for indicating data operation processing on target data of a target type;
the first determining module is used for determining a first pointer corresponding to the target data, wherein the first pointer is a pointer of a preset general type;
and the processing module is used for calling a preset queue operation function and carrying out data operation processing on the target data according to the first pointer and the preset element size corresponding to the target type.
Optionally, when the data operation instruction is a write instruction, the data operation instruction carries target data of a target type to be written;
the first determining module is specifically configured to:
acquiring target data of the target type to be written, and storing the target data into a preset first storage space;
acquiring a second pointer of the target data in the first storage space;
and converting the second pointer into a first pointer of a preset general pointer type.
Optionally, the processing module is specifically configured to:
calling a preset queue write function, and reading the target data from the first storage space according to the first pointer and the preset element size corresponding to the target type;
and storing the target data into a second storage space corresponding to the queue, and updating a queue tail pointer of the queue according to a preset pointer updating rule.
Optionally, when the data operation instruction is a read instruction, the first determining module is specifically configured to:
acquiring a first pointer of target data of a target type to be read in a queue, wherein the first pointer is a pointer of a storage space pointed by a head pointer of the queue.
Optionally, the processing module is specifically configured to:
and calling a preset queue reading function, reading the target data from a second storage space corresponding to the queue according to the first pointer and the preset data size corresponding to the target type, and updating a head pointer of the queue according to a preset pointer updating rule.
Optionally, the apparatus further comprises:
and the sending module is used for converting the first pointer into a third pointer of the target type and sending the third pointer to an upper application program so that the upper application program calls the target data through the third pointer.
Optionally, the apparatus further comprises:
a second receiving module, configured to receive a queue setting instruction input by a user, where the queue setting instruction carries an element size corresponding to the target type and a cache address of the second storage space corresponding to the queue;
and a second determining module, configured to determine a pointer update rule according to the pointer of the second storage space and the element size, so as to determine a pointer pointed by a queue pointer according to the pointer of the second storage space and the element size when performing data operation processing on the target data, where the pointer of the second storage space points to a head address of the second storage space, and the queue pointer includes a head pointer and a tail pointer.
In a third aspect, an electronic device is provided, which includes a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of the first aspect when executing the program stored in the memory.
In a fourth aspect, there is provided a machine-readable storage medium storing machine-executable instructions that, when invoked and executed by a processor, cause the processor to: the method steps of the first aspect are implemented.
In a fifth aspect, there is provided a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method steps of the first aspect.
According to the data processing method provided by the embodiment of the application, when the electronic equipment receives a data operation instruction, a first pointer corresponding to target data is determined, the first pointer is a pointer of a preset general type, a preset queue operation function is called, and data operation processing is performed on the target data according to the first pointer and the element size corresponding to the preset target type. Based on the scheme, no matter what type of data stored in the queue is, the data is called by the pointer of the preset general pointer type, so that technical personnel do not need to rewrite program codes and establish the queue aiming at different types of data, and the labor cost is reduced. Of course, it is not necessary for any product or method of the present application to achieve all of the above advantages at the same time.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings 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 of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a data processing method according to an embodiment of the present application;
fig. 2 is a flowchart of an example of a method for data processing according to an embodiment of the present application;
fig. 3 is a flowchart of an example of a method for data processing according to an embodiment of the present application;
fig. 4 is a flowchart of an example of a method for data processing according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be 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 only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The embodiment of the application also provides a data processing method, which is applied to electronic equipment, wherein the electronic equipment can be terminal equipment or a server.
Fig. 1 is a schematic flowchart of a data processing method according to an embodiment of the present application, where the method includes:
The data operation instruction is used for indicating data operation processing on target data of a target type.
In an implementation, a queue set by a user may be stored in the electronic device, and the electronic device may read data from the queue or may write data into the queue. The type of the queue is a preset general type, and correspondingly, the queue pointer of the queue is a preset general pointer type (for example, void type). Through the queue, any type of data can be stored. The electronic device may receive an operation command, which may be a read command or a write command.
In implementation, when the electronic device receives a data operation instruction, the electronic device may determine a first pointer corresponding to target data of a target type to be operated. The first pointer is a preset general type pointer.
For the case of writing data, the first pointer may be obtained by translation. Correspondingly, a pointer conversion algorithm can be prestored in the electronic device, and after the electronic device acquires the first pointer, the electronic device can convert the first pointer into a second pointer of a preset general pointer type through the prestored pointer conversion algorithm so as to operate data. The pointer conversion algorithm may adopt an algorithm in the prior art, and this embodiment is not limited.
For the case of reading data, the electronic device may directly obtain a first pointer of target data of a target type in the queue.
And 103, calling a preset queue operation function, and performing data operation processing on the target data according to the first pointer and the element size corresponding to the preset target type.
In implementation, the electronic device may store a queue operation function in advance, and the queue operation function may include a queue write function and a queue read function. The electronic equipment can call a preset queue operation function, and perform data operation processing on the target data according to the second pointer and the element size corresponding to the preset target type.
The embodiment of the present application further provides a specific process for writing the input into the queue, including the following steps:
step one, target data of a target type to be written are obtained, and the target data are stored in a preset first storage space.
In an implementation, the electronic device may obtain target data of a target type to be written. The specific acquisition mode may be various. For example, the electronic device may obtain target data input by a user, or may receive target data sent by other devices. After the electronic device obtains target data of a target type to be written, the target data is stored in a preset first storage space, and then the target data is written into the queue.
And step two, acquiring a second pointer of the target data in the first storage space.
In implementation, the electronic device may first determine whether the queue is full according to a preset queue full determination rule. For example, the electronic device may record the maximum number of elements that the queue can store, and count the elements already stored in the queue, and the electronic device may determine whether the element count is equal to the maximum number of elements, and if so, determine that the queue is full; if the element count is less than the maximum number of elements, it is determined that the queue is not full. If the queue is full, the electronic device discards the target data; if the queue is not full, the electronic device may obtain a second pointer of the target data in the first memory space.
And step three, converting the second pointer into a first pointer of a preset general pointer type.
In an implementation, the preset general type may be a void type, and the preset general pointer type may be a void type. The electronic device may convert the second pointer to a void type first pointer.
And step four, calling a preset queue write function, and reading target data from the first storage space according to the first pointer and the element size corresponding to the preset target type.
In implementation, the electronic device may call a preset queue write function, and then read, from the first storage space, data of a target size starting from a storage address corresponding to the first pointer as a head address. The target size is the element size corresponding to the preset target type. In this way, the electronic device can read the target data from the first storage space.
And step five, storing the target data into a second storage space of the queue, and updating a queue tail pointer of the queue according to a preset pointer updating rule.
In implementation, after the electronic device reads the target data from the first storage space, the electronic device may store the element data to the queue tail of the queue according to the cache address corresponding to the queue tail pointer, the element size, and the preset general pointer type, and update the queue tail pointer according to the movement rule of the queue pointer. The movement rule may adopt a movement rule in the prior art, and the embodiment of the present application is not limited. It should be noted that the electronic device needs to move the pointer of the storage space pointed by the queue tail pointer, and specifically, the electronic device may determine the pointer pointed by the queue pointer according to the pointer of the second storage space and the size of the element, where the pointer of the second storage space points to the head address of the second storage space. Additionally, the electronic device may also increment the element count of the queue by 1 to complete the enqueue of the target data.
The embodiment of the present application further provides a specific process for reading data from the queue, including the following steps:
step one, receiving a data reading instruction sent by an upper application program.
In implementation, when the upper layer application needs to read data, the interface of the bottom layer driver for reading data information may be called first, and the processing module of the electronic device may receive a data reading instruction sent by the upper layer application program. Then, the processing module of the electronic device judges whether the key queue is empty. For example, the electronic device may count the number of elements already stored in the queue, and the electronic device may determine whether the element count is 0, and if the element count is 0, determine that the queue is empty; if the element count is not 0, then the queue is determined not to be empty. If the queue is empty, the electronic device returns an empty element; if the queue is not empty, the electronic device may obtain a first pointer of target data of a target type to be read in the queue, where the first pointer is a pointer of a storage space pointed by a head pointer of the queue.
And step two, calling a preset queue reading function, reading target data from a second storage space corresponding to the queue according to the first pointer and the data size corresponding to the preset target type, and updating the head pointer of the queue according to a preset pointer updating rule.
In implementation, the electronic device may call a preset queue read function, and then read, from the queue, data of a target size starting to be read from a first address corresponding to the storage address of the first pointer. The target size is the element size corresponding to the preset target type. In this way, the electronic device may read the target data from the queue.
After the electronic device reads the target data from the queue, the head of queue pointer can be updated according to the moving rule of the queue pointer. The movement rule may adopt a movement rule in the prior art, and the embodiment of the present application is not limited. It should be noted that the electronic device needs to move the pointer of the storage space pointed by the head-of-line pointer, and specifically, the electronic device may determine the pointer pointed by the head-of-line pointer according to the size of the element. In addition, the electronic device may also decrement the element count of the queue by 1 to complete dequeuing of the target data.
Optionally, the electronic device may further convert the first pointer into a third pointer of the target type, and send the third pointer to the upper application program, so that the upper application program calls the target data through the third pointer.
Optionally, an embodiment of the present application further provides a processing procedure for configuring a queue by a user, where the specific processing procedure may be as follows: receiving a queue setting instruction input by a user, wherein the queue setting instruction carries the element size corresponding to the target type and the cache address of a second storage space corresponding to the queue; and determining a pointer updating rule according to the pointer and the element size of the second storage space, so that when data operation processing is performed on target data, a pointer pointed by a queue pointer is determined according to the pointer and the element size of the second storage space, wherein the pointer of the second storage space points to the head address of the second storage space, and the queue pointer comprises a queue head pointer and a queue tail pointer.
In implementation, a technician may first define a type of a target storage object (i.e., a target type), such as a structure type, an int type, and the like, so as to determine a size and an element type of each element in a queue, and an element pointer type according to the type of the target storage object, and set the size and the element type in an electronic device. A technician may further define a storage space for storing data, then divide the storage space for storing each element in the storage space according to the size of the element, and obtain a pointer (i.e., a cache address) and a cache size corresponding to the storage space, and in addition, the electronic device may further record the maximum number of elements that can be stored in the storage space. The technician also needs to define a queue to read and write data in the storage space through the queue.
The technician may perform the above-described setting by inputting a setting instruction. The electronic device receives a queue setting instruction input by a user, the queue setting instruction carries an element size corresponding to a target type and a cache address of a second storage space corresponding to a queue, and then the electronic device can determine a pointer updating rule according to a pointer and the element size of the second storage space so as to determine a pointer pointed by a queue pointer according to the pointer and the element size of the second storage space when data operation processing is performed on target data, wherein the pointer of the second storage space points to a head address of the second storage space, and the queue pointer comprises a queue head pointer and a queue tail pointer.
As shown in fig. 2, an example of applying the data processing method provided in the embodiment of the present application to a remote controller key scenario, in which an electronic device may perform data communication with a remote controller, a specific processing procedure includes the following steps:
The remote controller information comprises a key value and a serial number of the remote controller, the remote controller information is data of a structure type, and the corresponding pointer is a pointer of the structure type. During initialization, an association relation between the pointers of the void-type and the pointers of the structure-type of the queue is established.
The event type may include receiving remote control information, reading remote control information, and clearing remote control information, among others. When the event type is that the remote controller information is received, the electronic equipment executes the step 204 '-the step 207'; when the event type is reading the remote controller information, the electronic equipment executes the step 204 'to the step 209'; when the event type is to clear the remote control information, the electronic device performs steps 204 "" to 205 "".
And step 204', receiving the remote controller information sent by the remote controller.
In step 205', it is determined whether the verification of the remote control information is passed.
If the remote controller information is verified, step 206' is executed, and if the remote controller information is not verified, the process is ended.
In step 206', the remote controller information is stored in a preset first storage space.
In step 207', it is determined whether the queue is full.
If the queue is not full, step 207' is performed, and if the queue is full, the process ends.
In step 208', a second pointer of the remote control information in the first storage space is obtained.
The second pointer is a pointer of a structure type.
In step 209', the second pointer is converted to a first pointer of type void.
And step 210', reading the remote controller information from the first storage space according to the first pointer and the size of the preset structure element.
And step 211', writing the remote controller information into the tail of the queue, and updating the tail pointer.
And step 204', receiving a remote controller information reading instruction sent by the upper application program.
Step 205 ", determine if the queue is empty.
If the queue is empty, the process ends, and if the queue is not empty, step 206 "is performed.
Step 206 ", a first pointer of the remote controller information to be read in the queue is obtained.
Wherein, the first pointer is a void type pointer.
And step 207', reading the remote controller information from the queue according to the first pointer and the element size of the preset structure type, and updating the head pointer of the queue.
Step 208 "forces the dequeued void pointer (i.e., the first pointer) to be a pointer of structure type (which may be referred to as the third pointer).
Step 209 "calls the dequeued remote control information via the third pointer.
Step 210 "returns the remote control information to the upper layer application.
Step 204', a clear instruction of the remote control information is received.
Step 205 "', the queue is emptied.
As shown in fig. 3, another data processing method provided in this embodiment of the present application is applied to an example of an on-board key scenario, in which an electronic device may perform data communication with a device equipped with an on-board key, and a specific processing procedure includes the following steps:
in step 301, the electronic device allocates storage resources for the storage queue.
The onboard key information is a key value of an onboard key, the onboard key information is data of an int type, and the corresponding pointer is a pointer of an int type. At initialization, an association relationship between pointers of void × type and pointers of int type of the queue is established.
The event types may include, among others, write data, read data, and empty queues. When the event type is write data, the electronic equipment executes the step 304 '-the step 311'; when the event type is read data, the electronic device executes step 304 'to step 311'; when the event type is to empty the queue, the electronic device performs steps 304 "'to 305"'.
And step 304', when detecting that the IO level of the key corresponding to the on-board key is low level, performing filtering processing.
And step 305', judging whether the key corresponding to the onboard key is effectively triggered.
If the on board key corresponds to a valid trigger, step 306' is executed, and if the on board key corresponds to an invalid trigger, the processing is finished.
And step 306', storing the onboard key information into a preset first storage space.
In step 307', it is determined whether the queue is full.
If the queue is not full, step 307' is performed, and if the queue is full, the process ends.
And 308', acquiring a second pointer of the onboard key information in the first storage space.
Wherein the second pointer is a pointer of int type.
In step 309', the second pointer is converted to a first pointer of type void.
And 310', reading onboard key information from the first storage space according to the first pointer and the size of the preset int element.
And 311', writing the onboard key information into the tail of the queue, and updating a tail pointer.
And step 304', receiving an onboard key information reading instruction sent by the upper application program.
Step 305 ", determine if the queue is empty.
If the queue is empty, processing ends, and if the queue is not empty, step 306 "is performed.
And step 306', acquiring a first pointer of onboard key information to be read in the queue.
Wherein, the first pointer is a void type pointer.
And step 307', reading onboard key information from the queue according to the first pointer and the preset element size of the int type, and updating a head of queue pointer of the queue.
Step 308 "force the dequeued void pointer (i.e., the first pointer) to a pointer of int type (which may be referred to as the third pointer).
Step 309 "calls up the listed onboard key information via the third pointer.
Step 310' returns on-board button information to the upper layer application.
Step 304' ″, the clearing of onboard keystroke information is received.
Step 305 "', empty the queue.
Fig. 4 is an example of a data processing method provided in an embodiment of the present application, and the example takes target data as remote controller information and a target type as a structure type as an example for explanation. The method comprises the following steps:
In implementation, a user may perform a control operation on the remote controller to trigger the remote controller to send a data operation instruction to the electronic device. For example, a user may press a certain key on the remote controller, and the remote controller detects a trigger signal corresponding to the key and then sends a data operation instruction to the preset electronic device. The data operation command may be a read command or a write command. The data operation instruction may carry remote controller information, where the remote controller information includes a key value and a serial number of the remote controller, where the key value is a key value corresponding to the key, and the serial number may be a serial number corresponding to the remote controller. The remote controller information is data of a structure type, and the corresponding pointer is a pointer of the structure type. For example, a user may press an open key of a certain operation model, and the remote controller may send a control message for opening the operation model, where the control message carries remote controller information for instructing the electronic device to store the remote controller information so as to execute corresponding control processing, and thus the control message is a write instruction; the user can also inquire the operation information of the remote controller within a certain period of time, the remote controller can send inquiry information for inquiring the key information, and the inquiry information is used for indicating the electronic equipment to read the remote controller information, so the inquiry information is a reading instruction.
In step 402, the electronic device receives a data manipulation instruction.
The data operation instruction is used for indicating the data operation processing of the remote controller information of the structure type.
In an implementation, a queue for storing remote control information may be provided in the electronic device, and the electronic device may read the remote control information from the queue or may write the remote control information into the queue. The type of the queue is a preset general type, and correspondingly, the queue pointer of the queue is a preset general pointer type (for example, void type). Through the queue, any type of data can be stored. The electronic device can receive an operation instruction, and the data operation instruction can be a reading instruction or a writing instruction.
In step 403, the electronic device determines a first pointer corresponding to the target data.
In implementation, after the electronic device determines the data operation instruction, the electronic device may determine a first pointer corresponding to the remote controller information to be operated. The first pointer is a preset general type pointer.
For the case of writing remote control information, the first pointer may be obtained by conversion. Correspondingly, a pointer conversion algorithm can be prestored in the electronic device, and after the electronic device acquires the first pointer, the electronic device can convert the first pointer into a second pointer of a preset general pointer type through the prestored pointer conversion algorithm so as to operate the remote controller information. The pointer conversion algorithm may adopt an algorithm in the prior art, and this embodiment is not limited.
For the case of reading data, the electronic device may directly obtain the first pointer of the remote controller information in the queue.
And step 404, the electronic device calls a preset queue operation function, and performs data operation processing on the target data according to the first pointer and the element size corresponding to the preset target type.
In implementation, the electronic device may store a queue operation function in advance, and the queue operation function may include a queue write function and a queue read function. The electronic equipment can call a preset queue operation function, and data operation processing is carried out on the remote controller information according to the second pointer and the element size corresponding to the preset structure type.
The embodiment of the application also provides a specific process for writing the information of the remote controller into the queue, which comprises the following steps:
step one, the remote controller sends a writing instruction to the electronic equipment.
The writing instruction carries remote controller information to be written, the remote controller information comprises key values and serial numbers of the remote controller, the remote controller information is data of a structure type, and the corresponding pointer is a pointer of the structure type.
The specific processing procedure of this step can refer to the related explanation of step 401, and is not described here again.
And step two, the electronic equipment receives the writing instruction.
And step three, the electronic equipment stores the target data into a preset first storage space.
In implementation, after receiving a write command, the electronic device may obtain remote control information carried by the write command, where a data type of the remote control information is a structure type. After the electronic equipment acquires the remote controller information to be written, the remote controller information is stored in a preset first storage space and then written into the queue.
And step four, the electronic equipment acquires a second pointer of the target data in the first storage space.
In implementation, the electronic device may first determine whether the queue is full according to a preset queue full determination rule. For example, the electronic device may record the maximum number of elements that the queue can store, and count the elements already stored in the queue, and the electronic device may determine whether the element count is equal to the maximum number of elements, and if so, determine that the queue is full; if the element count is less than the maximum number of elements, it is determined that the queue is not full. If the queue is full, the electronic equipment discards the remote controller information; if the queue is not full, the electronic device may obtain a second pointer of the remote control information in the first memory space. The second pointer is a pointer of a structure type.
And step five, the electronic equipment converts the second pointer into a first pointer of a preset general pointer type.
In an implementation, the preset general type may be a void type, and the preset general pointer type may be a void type. The electronic device may convert the second pointer to a void type first pointer.
And step six, the electronic equipment calls a preset queue write function, and reads target data from the first storage space according to the first pointer and the element size corresponding to the preset target type.
In implementation, the electronic device may call a preset queue write function, and then read, from the first storage space, data of a target size starting from a storage address corresponding to the first pointer as a head address. The target size is the element size corresponding to the preset structure type. In this way, the electronic device can read the remote controller information from the first storage space.
And seventhly, storing the target data into a second storage space of the queue, and updating a queue tail pointer of the queue according to a preset pointer updating rule.
In implementation, after the electronic device reads the remote controller information from the first storage space, the electronic device may store the element data to the queue tail of the queue according to the cache address corresponding to the queue tail pointer, the element size, and the preset general pointer type, and update the queue tail pointer according to the movement rule of the queue pointer. The queue may be a circular queue, and the movement rule may adopt a movement rule of a pointer of a circular queue in the prior art, which is not limited in the embodiment of the present application. It should be noted that the electronic device needs to move the pointer of the storage space pointed by the queue tail pointer, and specifically, the electronic device may determine the pointer pointed by the queue pointer according to the pointer of the second storage space and the size of the element, where the pointer of the second storage space points to the head address of the second storage space. In addition, the electronic device may also add 1 to the element count of the queue to complete the enqueue of the remote control information.
The embodiment of the application also provides a specific process for reading the information of the remote controller from the queue, which comprises the following steps:
step one, the remote controller sends a reading instruction to the electronic equipment.
The reading instruction is used for indicating to read remote controller information, the remote controller information is data of a structure type, and the corresponding pointer is a pointer of the structure type.
And step two, the electronic equipment receives the reading instruction.
In implementation, after the electronic device receives a reading instruction sent by the remote controller, the electronic device determines that the information of the remote controller needs to be read according to the reading instruction. Then, the upper application of the electronic device may call the interface of the bottom driver for reading the data information, and the processing module of the electronic device may receive the data reading instruction sent by the upper application program. Then, the processing module of the electronic device judges whether the key queue is empty. For example, the electronic device may count the number of elements already stored in the queue, and the electronic device may determine whether the element count is 0, and if the element count is 0, determine that the queue is empty; if the element count is not 0, then the queue is determined not to be empty. If the queue is empty, the electronic device returns an empty element; if the queue is not empty, the electronic device may obtain a first pointer of the remote controller information of the structure type to be read in the queue, where the first pointer is a pointer of a storage space pointed by a head pointer of the queue, and the first pointer is a preset general type pointer.
And step three, calling a preset queue reading function, reading target data from a second storage space corresponding to the queue according to the first pointer and the data size corresponding to the preset target type, and updating the head pointer of the queue according to a preset pointer updating rule.
In implementation, the electronic device may call a preset queue read function, and then read, from the queue, data of a target size starting to be read from a first address corresponding to the storage address of the first pointer. The target size is the element size corresponding to the preset structure type. In this way, the electronic device can read the remote control information from the queue.
After the electronic equipment reads the remote controller information from the queue, the queue head pointer can be updated according to the moving rule of the queue pointer. The queue may be a circular queue, and the movement rule may adopt a movement rule of a pointer of a circular queue in the prior art, which is not limited in the embodiment of the present application. It should be noted that the electronic device needs to move the pointer of the storage space pointed by the head-of-line pointer, and specifically, the electronic device may determine the pointer pointed by the head-of-line pointer according to the size of the element. In addition, the electronic device may also decrement the element count of the queue by 1 to complete the dequeuing of the remote control information.
Optionally, the electronic device may further convert the first pointer into a third pointer of the structure type, and send the third pointer to the upper application program, so that the upper application program calls the remote controller information through the third pointer.
Optionally, an embodiment of the present application further provides a processing procedure for configuring a queue by a user, where the specific processing procedure may be as follows: receiving a queue setting instruction input by a user, wherein the queue setting instruction carries the element size corresponding to the target type and the cache address of a second storage space corresponding to the queue; and determining a pointer updating rule according to the pointer and the element size of the second storage space, so that when data operation processing is performed on target data, a pointer pointed by a queue pointer is determined according to the pointer and the element size of the second storage space, wherein the pointer of the second storage space points to the head address of the second storage space, and the queue pointer comprises a queue head pointer and a queue tail pointer.
In implementation, a technician may first define a type (i.e., a structure type) of a target storage object, such as a structure type, an int type, and the like, so as to determine a size and an element type of each element in a queue, and an element pointer type according to the type of the target storage object, and set the size and the element type in an electronic device. A technician may further define a storage space for storing data, then divide the storage space for storing each element in the storage space according to the size of the element, and obtain a pointer (i.e., a cache address) and a cache size corresponding to the storage space, and in addition, the electronic device may further record the maximum number of elements that can be stored in the storage space. The technician also needs to define a queue to read and write data in the storage space through the queue.
The technician may perform the above-described setting by inputting a setting instruction. The electronic device receives a queue setting instruction input by a user, the queue setting instruction carries an element size corresponding to the structure type and a cache address of a second storage space corresponding to the queue, and then the electronic device can determine a pointer updating rule according to a pointer and the element size of the second storage space so as to determine a pointer pointed by a queue pointer according to the pointer and the element size of the second storage space when data operation processing is performed on remote controller information, wherein the pointer of the second storage space points to a head address of the second storage space, and the queue pointer comprises a head pointer and a tail pointer.
In the embodiment of the application, when the electronic device receives a data operation instruction, a first pointer corresponding to target data is determined, the first pointer is a pointer of a preset general type, a preset queue operation function is called, and data operation processing is performed on the target data according to the first pointer and the element size corresponding to the preset target type. Based on the scheme, no matter what type of data stored in the queue is, the data is called by the pointer of the preset general pointer type, so that technical personnel do not need to rewrite program codes and establish the queue aiming at different types of data, and the labor cost is reduced.
Based on the same technical concept, as shown in fig. 5, an embodiment of the present application further provides an apparatus for data processing, where the apparatus includes:
a first receiving module 510, configured to receive a data operation instruction, where the data operation instruction is used to instruct to perform data operation processing on target data of a target type;
a first determining module 520, configured to determine a first pointer corresponding to the target data, where the first pointer is a preset general type pointer;
the processing module 530 is configured to invoke a preset queue operation function, and perform data operation processing on the target data according to the first pointer and the element size corresponding to the preset target type.
Optionally, when the data operation instruction is a write instruction, the data operation instruction carries target data of a target type to be written;
the first determining module 520 is specifically configured to:
acquiring target data of a target type to be written, and storing the target data into a preset first storage space;
acquiring a second pointer of the target data in the first storage space;
and converting the second pointer into a first pointer of a preset general pointer type.
Optionally, the processing module 530 is specifically configured to:
calling a preset queue write function, and reading target data from a first storage space according to a first pointer and the element size corresponding to a preset target type;
and storing the target data into a second storage space corresponding to the queue, and updating a queue tail pointer of the queue according to a preset pointer updating rule.
Optionally, when the data operation instruction is a read instruction, the first determining module 520 is specifically configured to:
and acquiring a first pointer of target data of a target type to be read in the queue, wherein the first pointer is a pointer of a storage space pointed by a head pointer of the queue.
Optionally, the processing module 530 is specifically configured to:
and calling a preset queue reading function, reading target data from a second storage space corresponding to the queue according to the first pointer and the data size corresponding to the preset target type, and updating the head pointer of the queue according to a preset pointer updating rule.
Optionally, as shown in fig. 6, the apparatus further includes:
and the sending module 540 is configured to convert the first pointer into a third pointer of the target type, and send the third pointer to the upper application program, so that the upper application program calls the target data through the third pointer.
Optionally, as shown in fig. 7, the apparatus further includes:
a second receiving module 550, configured to receive a queue setting instruction input by a user, where the queue setting instruction carries an element size corresponding to a target type and a cache address of a second storage space corresponding to a queue;
the second determining module 560 is configured to determine a pointer update rule according to a pointer and an element size of the second storage space, so as to determine a pointer pointed by a queue pointer according to the pointer and the element size of the second storage space when performing data operation processing on the target data, where the pointer of the second storage space points to a head address of the second storage space, and the queue pointer includes a head pointer and a tail pointer.
In the embodiment of the application, when the electronic device receives a data operation instruction, a first pointer corresponding to target data is determined, the first pointer is a pointer of a preset general type, a preset queue operation function is called, and data operation processing is performed on the target data according to the first pointer and the element size corresponding to the preset target type. Based on the scheme, no matter what type of data stored in the queue is, the data is called by the pointer of the preset general pointer type, so that technical personnel do not need to rewrite program codes and establish the queue aiming at different types of data, and the labor cost is reduced.
The embodiment of the present application further provides an electronic device, as shown in fig. 8, which includes a processor 801, a communication interface 802, a memory 803, and a communication bus 804, where the processor 801, the communication interface 802, and the memory 803 complete mutual communication through the communication bus 804,
a memory 803 for storing a computer program;
a processor 801, configured to execute the program stored in the memory 803, so as to enable the electronic device to perform the steps of the method for data processing, the method comprising:
receiving a data operation instruction, wherein the data operation instruction is used for indicating data operation processing on target data of a target type;
determining a first pointer corresponding to the target data, wherein the first pointer is a pointer of a preset general type;
and calling a preset queue operation function, and performing data operation processing on the target data according to the first pointer and the preset element size corresponding to the target type.
Optionally, when the data operation instruction is a write instruction, the data operation instruction carries target data of a target type to be written;
the determining of the first pointer corresponding to the target data includes:
acquiring target data of the target type to be written, and storing the target data into a preset first storage space;
acquiring a second pointer of the target data in the first storage space;
and converting the second pointer into a first pointer of a preset general pointer type.
Optionally, the invoking a preset queue operation function, and performing data operation processing on the target data according to the first pointer and a preset element size corresponding to the target type includes:
calling a preset queue write function, and reading the target data from the first storage space according to the first pointer and the preset element size corresponding to the target type;
and storing the target data into a second storage space corresponding to the queue, and updating a queue tail pointer of the queue according to a preset pointer updating rule.
Optionally, when the data operation instruction is a read instruction, the determining a first pointer corresponding to the target data includes:
acquiring a first pointer of target data of a target type to be read in a queue, wherein the first pointer is a pointer of a storage space pointed by a head pointer of the queue.
Optionally, the invoking a preset queue operation function, and performing data operation processing on the target data according to the first pointer and a preset element size corresponding to the target type includes:
and calling a preset queue reading function, reading the target data from a second storage space corresponding to the queue according to the first pointer and the preset data size corresponding to the target type, and updating a head pointer of the queue according to a preset pointer updating rule.
Optionally, after the target data is read from the second storage space corresponding to the queue, the method further includes:
and converting the first pointer into a third pointer of the target type, and sending the third pointer to an upper application program so that the upper application program calls the target data through the third pointer.
Optionally, the method further includes:
receiving a queue setting instruction input by a user, wherein the queue setting instruction carries the element size corresponding to the target type and the cache address of the second storage space corresponding to the queue;
and determining a pointer updating rule according to the pointer of the second storage space and the element size, so as to determine a pointer pointed by a queue pointer according to the pointer of the second storage space and the element size when performing data operation processing on the target data, wherein the pointer of the second storage space points to a head address of the second storage space, and the queue pointer comprises a head pointer and a tail pointer.
The communication bus mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the electronic equipment and other equipment.
The Memory may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component.
In a further embodiment of the present invention, a computer-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any of the above-mentioned data processing methods.
In a further embodiment, the present invention also provides a computer program product containing instructions which, when run on a computer, cause the computer to perform the method of any of the above embodiments of data processing.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, as for the apparatus embodiment, since it is substantially similar to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only for the preferred embodiment of the present application, and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application are included in the protection scope of the present application.
Claims (16)
1. A method of data processing, the method comprising:
receiving a data operation instruction, wherein the data operation instruction is used for indicating data operation processing on target data of a target type;
determining a first pointer corresponding to the target data, wherein the first pointer is a pointer of a preset general type;
and calling a preset queue operation function, and performing data operation processing on the target data according to the first pointer and the preset element size corresponding to the target type.
2. The method according to claim 1, wherein when the data operation instruction is a write instruction, the data operation instruction carries target data of a target type to be written;
the determining of the first pointer corresponding to the target data includes:
acquiring target data of the target type to be written, and storing the target data into a preset first storage space;
acquiring a second pointer of the target data in the first storage space;
and converting the second pointer into a first pointer of a preset general pointer type.
3. The method according to claim 2, wherein the calling a preset queue operation function, and performing data operation processing on the target data according to the first pointer and a preset element size corresponding to the target type includes:
calling a preset queue write function, and reading the target data from the first storage space according to the first pointer and the preset element size corresponding to the target type;
and storing the target data into a second storage space corresponding to the queue, and updating a queue tail pointer of the queue according to a preset pointer updating rule.
4. The method according to claim 1, wherein when the data operation instruction is a read instruction, the determining a first pointer corresponding to the target data comprises:
acquiring a first pointer of target data of a target type to be read in a queue, wherein the first pointer is a pointer of a storage space pointed by a head pointer of the queue.
5. The method according to claim 4, wherein the calling a preset queue operation function, and performing data operation processing on the target data according to the first pointer and a preset element size corresponding to the target type includes:
and calling a preset queue reading function, reading the target data from a second storage space corresponding to the queue according to the first pointer and the preset data size corresponding to the target type, and updating a head pointer of the queue according to a preset pointer updating rule.
6. The method of claim 5, wherein after the reading the target data from the second storage space corresponding to the queue, the method further comprises:
and converting the first pointer into a third pointer of the target type, and sending the third pointer to an upper application program so that the upper application program calls the target data through the third pointer.
7. The method of claim 1, further comprising:
receiving a queue setting instruction input by a user, wherein the queue setting instruction carries the element size corresponding to the target type and the cache address of the second storage space corresponding to the queue;
and determining a pointer updating rule according to the pointer of the second storage space and the element size, so as to determine a pointer pointed by a queue pointer according to the pointer of the second storage space and the element size when performing data operation processing on the target data, wherein the pointer of the second storage space points to a head address of the second storage space, and the queue pointer comprises a head pointer and a tail pointer.
8. An apparatus for data processing, the apparatus comprising:
the first receiving module is used for receiving a data operation instruction, and the data operation instruction is used for indicating data operation processing on target data of a target type;
the first determining module is used for determining a first pointer corresponding to the target data, wherein the first pointer is a pointer of a preset general type;
and the processing module is used for calling a preset queue operation function and carrying out data operation processing on the target data according to the first pointer and the preset element size corresponding to the target type.
9. The apparatus according to claim 8, wherein when the data operation instruction is a write instruction, the data operation instruction carries target data of a target type to be written;
the first determining module is specifically configured to:
acquiring target data of the target type to be written, and storing the target data into a preset first storage space;
acquiring a second pointer of the target data in the first storage space;
and converting the second pointer into a first pointer of a preset general pointer type.
10. The apparatus of claim 9, wherein the processing module is specifically configured to:
calling a preset queue write function, and reading the target data from the first storage space according to the first pointer and the preset element size corresponding to the target type;
and storing the target data into a second storage space corresponding to the queue, and updating a queue tail pointer of the queue according to a preset pointer updating rule.
11. The apparatus of claim 8, wherein when the data operation instruction is a read instruction, the first determining module is specifically configured to:
acquiring a first pointer of target data of a target type to be read in a queue, wherein the first pointer is a pointer of a storage space pointed by a head pointer of the queue.
12. The apparatus of claim 11, wherein the processing module is specifically configured to:
and calling a preset queue reading function, reading the target data from a second storage space corresponding to the queue according to the first pointer and the preset data size corresponding to the target type, and updating a head pointer of the queue according to a preset pointer updating rule.
13. The apparatus of claim 12, further comprising:
and the sending module is used for converting the first pointer into a third pointer of the target type and sending the third pointer to an upper application program so that the upper application program calls the target data through the third pointer.
14. The apparatus of claim 8, further comprising:
a second receiving module, configured to receive a queue setting instruction input by a user, where the queue setting instruction carries an element size corresponding to the target type and a cache address of the second storage space corresponding to the queue;
and a second determining module, configured to determine a pointer update rule according to the pointer of the second storage space and the element size, so as to determine a pointer pointed by a queue pointer according to the pointer of the second storage space and the element size when performing data operation processing on the target data, where the pointer of the second storage space points to a head address of the second storage space, and the queue pointer includes a head pointer and a tail pointer.
15. An electronic device is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing mutual communication by the memory through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of any of claims 1 to 7 when executing a program stored in the memory.
16. A machine-readable storage medium having stored thereon machine-executable instructions that, when invoked and executed by a processor, cause the processor to: carrying out the method steps of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810716524.9A CN110659065A (en) | 2018-06-29 | 2018-06-29 | Data processing method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810716524.9A CN110659065A (en) | 2018-06-29 | 2018-06-29 | Data processing method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110659065A true CN110659065A (en) | 2020-01-07 |
Family
ID=69027245
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810716524.9A Pending CN110659065A (en) | 2018-06-29 | 2018-06-29 | Data processing method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110659065A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112231003A (en) * | 2020-10-15 | 2021-01-15 | 天津津航计算技术研究所 | CAN equipment management method under VxWorks system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102982009A (en) * | 2012-11-06 | 2013-03-20 | 无锡江南计算技术研究所 | Function processing method and system for many-core processor |
| CN103186585A (en) * | 2011-12-29 | 2013-07-03 | 北京亿阳信通科技有限公司 | Queue processing method and device |
| US20140379999A1 (en) * | 2013-06-21 | 2014-12-25 | Stmicroelectronics (Grenoble 2) Sas | Data queue having an unlimited depth |
| CN104868924A (en) * | 2015-05-07 | 2015-08-26 | 广东电网有限责任公司电力科学研究院 | File compression and decompression methods for Power PC framework novel movement device of Nucleus system |
| CN106325821A (en) * | 2015-07-07 | 2017-01-11 | Tcl集团股份有限公司 | Pointer management method and apparatus |
-
2018
- 2018-06-29 CN CN201810716524.9A patent/CN110659065A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103186585A (en) * | 2011-12-29 | 2013-07-03 | 北京亿阳信通科技有限公司 | Queue processing method and device |
| CN102982009A (en) * | 2012-11-06 | 2013-03-20 | 无锡江南计算技术研究所 | Function processing method and system for many-core processor |
| US20140379999A1 (en) * | 2013-06-21 | 2014-12-25 | Stmicroelectronics (Grenoble 2) Sas | Data queue having an unlimited depth |
| CN104868924A (en) * | 2015-05-07 | 2015-08-26 | 广东电网有限责任公司电力科学研究院 | File compression and decompression methods for Power PC framework novel movement device of Nucleus system |
| CN106325821A (en) * | 2015-07-07 | 2017-01-11 | Tcl集团股份有限公司 | Pointer management method and apparatus |
Non-Patent Citations (2)
| Title |
|---|
| 朱接文: "空指针", 《C语言程序设计教程》 * |
| 李德强: "《https://zhuanlan.zhihu.com/p/36992446》", 18 May 2018 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112231003A (en) * | 2020-10-15 | 2021-01-15 | 天津津航计算技术研究所 | CAN equipment management method under VxWorks system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108733005B (en) | Method and device for controlling linkage of intelligent equipment | |
| CN113641457B (en) | Container creation method, device, apparatus, medium, and program product | |
| CN109995805B (en) | Intelligent robot management method, terminal device and medium | |
| JPS58501065A (en) | Processing equipment for packet voice integrated exchange | |
| CN109002424B (en) | File format conversion method and device, computer equipment and storage medium | |
| CN107391672B (en) | Data reading and writing method and messaging distributed file system | |
| CN110659065A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN112083971B (en) | Component processing method, device and storage medium | |
| CN113141288A (en) | Mailbox message receiving and sending method and device of CAN bus controller | |
| CN110764835B (en) | File configuration method and device for application environment, computer equipment and storage medium | |
| CN110334034B (en) | Mapping table dynamic loading method and device, computer equipment and storage medium | |
| CN111124291A (en) | Data storage processing method and device of distributed storage system and electronic equipment | |
| CN101197959B (en) | Terminal control method, system and equipment | |
| CN107168776B (en) | Event statistical method, device, equipment and storage medium | |
| CN115495406A (en) | Message transmission method, device, equipment and storage medium based on PCIe | |
| CN115525462A (en) | Log storage method and device, electronic equipment and storage medium | |
| CN111433738A (en) | Controller event queue | |
| CN112272135B (en) | Mail sending method, device, equipment and storage medium for storage software | |
| CN108874560B (en) | Method and communication device for communication | |
| KR101668441B1 (en) | Meddleware Interface System and Method for Data Collection of Heterogeneous Devices | |
| CN112925796A (en) | Write consistency control method, device, equipment and storage medium | |
| CN112651212A (en) | Method and terminal for remotely acquiring word stock | |
| CN111151009A (en) | Game data processing method, device and system, electronic equipment and storage medium | |
| CN111104097B (en) | Data writing and reading method and device | |
| CN109597576B (en) | Method, device, readable storage medium and system for improving response speed of NCQ command |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200107 |
|
| RJ01 | Rejection of invention patent application after publication |