CN114064776A - Application program data processing method, system, computer device and storage medium - Google Patents
Application program data processing method, system, computer device and storage medium Download PDFInfo
- Publication number
- CN114064776A CN114064776A CN202111367179.0A CN202111367179A CN114064776A CN 114064776 A CN114064776 A CN 114064776A CN 202111367179 A CN202111367179 A CN 202111367179A CN 114064776 A CN114064776 A CN 114064776A
- Authority
- CN
- China
- Prior art keywords
- linked list
- data
- application program
- current
- thread
- 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 OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/252—Integrating or interfacing systems involving database management systems between a Database Management System and a front-end application
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computing Systems (AREA)
- Stored Programmes (AREA)
Abstract
The embodiment of the application provides an application program data processing method, an application program data processing system, computer equipment and a storage medium. The application program data processing method comprises the following steps: starting an application program, wherein the application program comprises at least two logic channels; creating a thread and driving the thread to be in a waiting state; driving a thread to inquire at least two linked list data according to a received event signal, wherein the at least two linked list data correspond to at least two logic channels one to one; when the target data exists in the current linked list data corresponding to the current logic channel, the application program is informed to call a calling interface to obtain the target data. The embodiment of the application can effectively save resources and improve the working efficiency.
Description
Technical Field
The embodiment of the application relates to the field of data processing, in particular to an application data processing method, an application data processing system, computer equipment and a storage medium.
Background
Currently, for applications using multiple logical channels for data processing, a synchronous polling reception mode is used in the data processing process. The synchronous polling reception mode needs to sequence a plurality of logic channels of an application program and sequentially acquire data in each logic channel, wherein most of the logic channels have no data, and the acquisition result is null, which results in excessive resources and time being wasted on the channels without data, resulting in low reception efficiency and excessive occupied resources, and failing to meet the requirement of most of the application programs for efficiently processing data.
Disclosure of Invention
The technical problem to be solved by the embodiments of the present application is to provide an application data processing method, system, computer device, and storage medium, aiming at the above-mentioned defects in the prior art, in which excessive resources and time are wasted on a channel without data, resulting in low receiving efficiency and excessive occupied resources, and thus failing to meet the requirements of most diagnostic applications.
The technical scheme adopted by the embodiment of the application for solving the technical problem is as follows: there is provided an application data processing method, the method comprising: starting an application program, wherein the application program comprises at least two logic channels; creating a thread and driving the thread to be in a waiting state; driving the thread to inquire at least two linked list data according to the received event signal, wherein the at least two linked list data correspond to the at least two logic channels one to one; and when the target data exists in the current linked list data corresponding to the current logic channel, informing the application program to call a calling interface to acquire the target data.
Wherein the method further comprises: and when the thread is driven to inquire the current linked list data corresponding to the current logical channel, adding a first thread lock to the current linked list data, and when the inquiry of the current linked list data corresponding to the current logical channel is finished, removing the first thread lock.
Wherein the notifying the application program to call a calling interface to obtain the target data further comprises: and when the application program calls the calling interface to acquire the target data, adding a second thread lock to an interface function of the calling interface, and after the application program acquires the target data, removing the second thread lock.
Wherein the method further comprises: and calling the calling interface to sequentially acquire the linked list data corresponding to each of the at least two logic channels.
Wherein the method further comprises: acquiring a received data mode matched with the application program requirement, and executing the step of creating the thread to acquire target data according to the asynchronous notification mode if the received data mode is the asynchronous notification mode; if the data receiving mode is a synchronous polling mode, executing the step of calling the calling interface to sequentially acquire linked list data corresponding to each of the at least two logic channels to acquire target data according to the synchronous polling mode; and if the data receiving mode is a simultaneous receiving mode, executing the steps of creating the thread and acquiring the target data according to the simultaneous receiving mode, and simultaneously executing the step of calling the calling interface to sequentially acquire the linked list data corresponding to each of the at least two logic channels to acquire the target data.
The calling interface is called to sequentially acquire linked list data corresponding to each of the at least two logic channels, and the method specifically includes: if the current linked list data corresponding to the current logic channel is not empty, copying the current linked list data to return data, and deleting a linked list buffer area where the current linked list data is located; and if the current linked list data corresponding to the current logical channel is empty, returning a result of empty.
Wherein after notifying the application program to call a calling interface to obtain the target data, the method further comprises: and copying the target data to return data, and deleting a link table buffer area where the current link table data corresponding to the target data is located.
The technical scheme adopted by the embodiment of the application for solving the technical problem is as follows: an application data processing system comprising the following modules: the starting module is used for starting an application program, and the application program comprises at least two logic channels; the thread module is used for creating a thread and driving the thread to be in a waiting state; the query module is used for driving the thread to query at least two linked list data according to the received event signal, and the at least two linked list data correspond to the at least two logic channels one to one; and the calling module is used for informing the application program to call a calling interface to acquire the target data when the target data exists in the current linked list data corresponding to the current logic channel.
The technical scheme adopted by the embodiment of the application for solving the technical problem is as follows: there is provided a computer device comprising a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to perform the steps of the method as described above.
The technical scheme adopted by the embodiment of the application for solving the technical problem is as follows: there is provided a storage medium storing a computer program which, when executed by a processor, causes the processor to perform the steps of the method as described above.
Compared with the prior art, the method and the device have the advantages that the target data in the at least two linked lists in the linked list buffer area are obtained through the at least two logic channels of the application program, if the linked lists do not have data, the logic channels exist, much time is not consumed when the target data exist in each linked list or not is detected, the response can be rapidly carried out on event signals, the application program can call the API interface to obtain the target data only aiming at the linked lists with the target data, the resource consumption is reduced, and the working efficiency is improved.
Drawings
Embodiments of the present application will be further described with reference to the accompanying drawings and embodiments, in which:
fig. 1 is a schematic flowchart of a first embodiment of an application data processing method provided in an embodiment of the present application;
fig. 2 is a schematic flowchart of a second embodiment of an application data processing method according to an embodiment of the present application;
fig. 3 is a schematic flowchart of a third embodiment of an application data processing method according to an embodiment of the present application;
FIG. 4 is a schematic structural diagram of an embodiment of a multi-channel data receiving system provided by an embodiment of the present application;
FIG. 5 is a schematic block diagram of an embodiment of a computer device provided in an embodiment of the present application;
fig. 6 is a schematic structural diagram of an embodiment of a storage medium provided in an embodiment of the present application.
Detailed Description
Preferred embodiments of the present invention will now be described in detail with reference to the accompanying drawings.
Referring to fig. 1, fig. 1 is a flowchart illustrating a method for processing application data according to a first embodiment of the present application. The application program data processing method provided by the embodiment of the application program and the electronic equipment are provided with the application program, and the electronic equipment can be a computer, a Personal Computer (PC), a mobile terminal, a personal digital assistant and other electronic equipment with logic calculation and processing functions. The electronic device is configured with applications having multiple logical channels, such as diagnostic applications. The application program needs to read data from a chain table buffer area, the chain table buffer area comprises a chain table array formed by a plurality of chain tables, and the chain tables are arranged according to a plurality of channels and are in one-to-one correspondence with the channels of the application program. At least one linked list with data stored exists in the plurality of linked lists, and the application program can obtain the data in the linked lists by calling the API.
The application program data processing method provided by the embodiment of the application program comprises the following steps:
s101: and starting an application program, wherein the application program comprises at least two logic channels.
Specifically, the user may start the application program by clicking the application icon, or may wake up the application program by other means, such as voice wake-up, input wake-up, and the like. In the present embodiment, the application includes a diagnosis application or an application for other purposes, such as an image display application or a search application. The application program comprises at least two logic channels, the logic channels are channels which meet logic conditions and are in a connected state, each logic channel can be used for inquiring the linked list data, and each logic channel can inquire one linked list data at a time.
S102: and creating a thread and driving the thread to be in a waiting state.
In one particular implementation scenario, a thread is created in an application. Taking the Diagnostic application as an example, when the Diagnostic application uses the D-PDU (Diagnostic Protocol Data Unit) Protocol, a thread is created in the D-PDU Diagnostic API. The D-PDU diagnostic protocol supports both asynchronous and synchronous reception modes. The thread is driven to be in a waiting state, and when a notification that data can be received is received, an application program can be immediately notified to acquire the receivable data from the chain table buffer. In this implementation scenario, the thread is always in a state of waiting for receiving the event signal, and does not occupy the resources of the CPU.
S103: and driving the thread to inquire at least two linked list data according to the received event signal, wherein the at least two linked list data correspond to the at least two logic channels one to one.
In a specific implementation scenario, when an event signal is received in a thread, a driver thread sequentially queries a plurality of linked lists corresponding to a plurality of channels. For example, if the application is a diagnostic API, an event signal is immediately generated if data is received from an ECU (Electronic Control Unit). And when the event signal is received in the thread, the driving thread sequentially inquires a plurality of linked lists corresponding to the channels. In one implementation scenario, the plurality of linked lists are sorted or the plurality of channels are sorted, and the plurality of linked lists are sequentially queried according to the sorting.
S104: when the target data exist in the current linked list corresponding to the current channel, the application program is informed to call a calling interface to acquire the target data.
In a specific implementation scenario, when target data exists in a current linked list corresponding to a current channel, an application program is notified to call a call interface to acquire the target data. For example, the application includes A, B, C three logical channels, and linked lists a, b, and c correspond to A, B, C three logical channels, respectively. And if the linked list a corresponding to the logic channel A has the target data, sending a notification to the application program, wherein the notification comprises a channel identifier and/or a linked list identifier, so that the application program can acquire the target data in the linked list a according to the channel identifier or the linked list identifier.
In an implementation scenario, when it is found that no target data exists in the current linked list corresponding to the current logical channel, a next linked list corresponding to a next logical channel of the current logical channel is queried. For example, a linked list B corresponding to the logical channel B is detected, and if no data exists in the linked list B, a linked list C corresponding to a next channel C of the logical channel B is detected. If the linked list c has the target data, as described above, a notification is sent to the application program, where the notification includes the channel identifier and/or the linked list identifier, so that the application program can obtain the target data in the linked list c according to the channel identifier or the linked list identifier. If the linked list c does not have the target data, detecting whether a linked list of the undetected logical channel exists, and if the linked list of the undetected logical channel does not exist, ending the operation.
In the implementation scenario, when the target data exists in the current linked list corresponding to the current logical channel, the callback function is executed, a notification is sent to the application program, and after the application program receives the notification, the application program calls the API according to the notification to acquire the target data in the current linked list.
In some specific embodiments, when the driver thread queries the current linked list corresponding to the current logical channel, a first thread lock is added to the linked list data of the current linked list. By applying the first thread lock, the data processing abnormity caused by the fact that other threads access the data of the linked list at the same time during multi-thread processing can be prevented. And when the query of the current linked list corresponding to the current logical channel is finished, releasing the first thread lock to restore the initial state. For example, in the above scenario, when querying the linked list a, the first thread lock is added to the data of the linked list a, and when querying the linked list a is finished, the first thread lock is released. And when the query of the linked list b is finished, removing the first thread lock. And when the linked list c is queried, adding a first thread lock to the data of the linked list c, and when the query of the linked list c is finished, removing the first thread lock.
In some specific implementation scenarios, when the application calls the calling interface to obtain the target data, a second thread lock is added to the interface function of the calling interface. By applying the second thread lock, other threads can be prevented from calling the interface function during multi-thread processing, and data processing exception can be prevented. And after the application program acquires the target data, the second thread lock is released so as to restore the initial state of the interface function of the calling interface. For example, in the above scenario, when the application calls the API to obtain the target data in the linked list a, the second thread lock is added to the interface function of the calling interface, and when the data of the linked list a is completely obtained, the second thread lock is released. And when the application program calls the API to acquire the target data in the linked list c, adding a second thread lock to the interface function of the calling interface, and when the acquisition of the data of the linked list c is finished, removing the second thread lock.
In a specific implementation scenario, it is determined whether the query of the plurality of linked lists is completed, and if the query of the plurality of linked lists is not completed, the step S104 is continuously executed to query at least one linked list behind the current linked list until the query of the plurality of linked lists is completed. For example, after detecting the chain table C of the channel C, if there are multiple channels such as E, F, G … and their corresponding chain tables e, f, and g … after the channel C, it is sequentially detected whether there is target data in the chain tables e, f, and g … according to the above steps. And if no linked list of other channels is not detected after the channel C, ending the process.
As can be seen from the above description, in this embodiment, the target data in the at least two linked lists in the linked list buffer area is obtained by using the at least two logic channels of the application program, if there is no data in the linked lists, then there are multiple logic channels, and it does not consume much time to detect whether there is target data in each linked list, and can quickly respond to the event signal, so that the application program can call the API interface only for the linked list with target data to obtain the target data, thereby reducing resource consumption and improving work efficiency.
Referring to fig. 2, fig. 2 is a flowchart illustrating a data processing method for an application according to a second embodiment of the present application. The application program data processing method provided by the embodiment of the application program comprises the following steps:
s201: and starting an application program, wherein the application program comprises at least two logic channels.
S202: and creating a thread and driving the thread to be in a waiting state.
In a specific implementation scenario, steps S201 to S202 are substantially the same as steps S101 to S102 of the first embodiment of the application data processing method provided in this embodiment, and are not described herein again.
S203: and calling a calling interface according to the received event signal to sequentially acquire linked list data corresponding to each of the at least two logic channels.
In a specific implementation scenario, when an event signal is received, an API interface is cyclically called in an application program to sequentially obtain linked list data of a linked list corresponding to each logical channel. The multiple channels of the application program can be sequenced, and the linked list data of the linked list corresponding to each channel is sequentially acquired according to the sequencing of the channels. For example, the application includes A, B, C channels, and the linked lists a, b, and c correspond to A, B, C channels. The ordering of the three channels is A, B, C. And sequentially acquiring linked list data of the linked lists a, b and c according to the sequence.
S204: if the current linked list data corresponding to the current logic channel is not empty, copying the current linked list data to return data, and deleting a linked list buffer area where the current linked list data is located; and if the current linked list data corresponding to the current logical channel is empty, returning a result of empty.
In a specific implementation scenario, if the current linked list data corresponding to the current logical channel is not null, it indicates that the current linked list includes the target data, copies the linked list data to the return data, and deletes the linked list buffer where the linked list data is located. For example, the linked list a stores target data, that is, the linked list data of the linked list a includes the target data, the linked list data of the linked list a is copied to the return data, and the linked list buffer area where the linked list data of the linked list a is located is deleted.
In other implementation scenarios, if the linked list data corresponding to the logical channel is empty, the returned result is empty. For example, if the linked list b does not store the target data, the linked list data of the linked list b is empty, and the return result is empty.
In other implementation scenarios, the link buffer may be deleted uniformly after all the link data are acquired. Or deleting the chain table buffer area where the chain table is located after each chain table data is acquired.
In other implementation scenarios, it is determined whether the linked list data of the plurality of linked lists are all acquired, and if the linked list data are not acquired, step S201 is continuously executed to acquire the linked list data of at least one linked list behind the current linked list until the linked list data of the plurality of linked lists are acquired. For example, after the link data of the link C of the channel C is obtained, if there are multiple channels such as E, F, G … and their corresponding links e, f, and g … behind the channel C, the link data in the links e, f, and g … are obtained in sequence according to the above steps. And if the linked list data of the linked lists of other channels are not acquired after the channel C, ending the operation.
As can be seen from the above description, in this embodiment, the application program calls the call interface to sequentially obtain the linked list data of the linked list corresponding to each channel, the operation is simple and easy to implement, the complexity of the program operation can be effectively reduced, and the error occurrence probability is reduced.
Referring to fig. 3, fig. 3 is a flowchart illustrating a data processing method for an application according to a third embodiment of the present application. The application program data processing method provided by the embodiment of the application program comprises the following steps:
s301: an application is started, the application comprising at least two logical channels.
S302: and creating a thread and driving the thread to be in a waiting state.
In a specific implementation scenario, steps S301 to S302 are substantially the same as steps S101 to S102 of the first embodiment of the application data processing method provided in this embodiment, and are not described herein again.
S303: acquiring a received data pattern matching the application program requirement, executing step S304 if the received data pattern is an asynchronous notification pattern, executing step S307 if the received data pattern is a synchronous polling pattern, and executing steps S304 and S307 simultaneously if the received data pattern is a simultaneous reception pattern.
In a specific implementation scenario, application requirements are obtained, and a received data pattern matching the application requirements is obtained. For example, if the current demand is a fast response, the received data mode is an asynchronous notification mode, if the current demand is to reduce the operation complexity, the received data mode is a synchronous polling mode, and if the current demand is to consider both the fast response and the low complexity, the received data mode is a simultaneous reception mode.
S304: driving a thread to inquire at least two linked list data according to the received event signal, wherein the at least two linked list data correspond to at least two logic channels one to one
S305: when the target data exists in the current linked list data corresponding to the current logic channel, the application program is informed to call a calling interface to obtain the target data.
In a specific implementation scenario, steps S304 to S305 are substantially the same as steps S103 to S104 in the first embodiment of the application data processing method provided in this embodiment, and are not described herein again.
S306: and copying the target data to the returned data, and deleting the chain table buffer area where the current chain table corresponding to the target data is located.
In a specific implementation scenario, the target data is copied to the return data, and the link buffer area where the current link table corresponding to the target data is located is deleted. For example, the linked list a has target data, the target data of the linked list a is copied to the return data, and the linked list buffer corresponding to the linked list a is deleted.
In other implementation scenarios, the link buffer may be deleted uniformly after all the link data of the link are acquired. Or deleting the chain table buffer area where the chain table is located after each chain table data of one chain table is obtained.
S307: and calling a calling interface to sequentially acquire linked list data corresponding to each of at least two logic channels.
S308: if the current linked list data corresponding to the current logic channel is not empty, copying the current linked list data to return data, and deleting a linked list buffer area where the current linked list data is located; and if the current linked list data corresponding to the current logical channel is empty, returning a result of empty.
In a specific implementation scenario, steps S307 to S308 are substantially the same as steps S201 to S202 in the second embodiment of the application data processing method provided in this embodiment, and are not described herein again.
As can be seen from the above description, in this embodiment, one or two of the receiving method for executing the asynchronous notification and the receiving method for executing the synchronous polling are selected according to the data-fetching mode instruction of the user, and the two receiving methods can be executed simultaneously, where both modes are to directly read data in the same link-table buffer area, and do not need to copy data, so that not only can the processing efficiency be improved, but also the data processing steps can be simplified, and different requirements of the user can be met.
It should be understood that although the various steps in the flowcharts of fig. 1-3 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 1-3 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternating with other steps or at least some of the sub-steps or stages of other steps.
Referring to fig. 4, fig. 4 is a schematic structural diagram of an embodiment of a multi-channel data receiving system according to the present application. The channel data receiving system 10 includes an initiating module 11, a thread module 12, a query module 13, and a call module 14.
The starting module 11 is used for starting an application program, and the application program comprises at least two logical channels. The thread module 12 is used to create a thread and drive the thread to a wait state. The query module 13 is configured to query at least two linked list data according to the received event signal driving thread, where the at least two linked list data correspond to the at least two logic channels one to one. The calling module 14 is configured to notify the application program to call a calling interface to obtain the target data when the target data exists in the current linked list data corresponding to the current logical channel.
The query module 13 is further configured to add a first thread lock to the current linked list data when the driver thread queries the current linked list data corresponding to the current logical channel, and remove the first thread lock when the query of the current linked list data corresponding to the current logical channel is completed.
The calling module 14 is further configured to add a second thread lock to the interface function of the calling interface when the application calls the calling interface to obtain the target data, and remove the second thread lock after the application obtains the target data.
The calling module 14 is further configured to call a calling interface to sequentially obtain linked list data corresponding to each of the at least two logic channels.
The thread module 12 is further configured to acquire a received data mode matching the application program requirement, and if the received data mode is an asynchronous notification mode, execute a step of creating a thread to acquire target data according to the asynchronous notification mode; if the data receiving mode is a synchronous polling mode, executing a step of calling a calling interface to sequentially acquire linked list data corresponding to each of at least two logic channels to acquire target data according to the synchronous polling mode; and if the data receiving mode is the simultaneous receiving mode, executing the steps of creating the thread and acquiring the target data according to the simultaneous receiving mode, and simultaneously executing the step of calling the calling interface to sequentially acquire the linked list data corresponding to each of the at least two logic channels to acquire the target data.
The calling module 14 is further configured to copy the current linked list data to the return data and delete the linked list buffer area where the current linked list data is located if the current linked list data corresponding to the current logical channel is not empty; and if the current linked list data corresponding to the current logical channel is empty, returning a result of empty.
The calling module 14 is further configured to copy the target data into the return data, and delete the link buffer where the current link data corresponding to the target data is located.
As can be seen from the above description, in this embodiment, the target data in at least two linked lists in the linked list buffer area is obtained by using at least two logic channels of the application program, if there is no data in the linked lists, there are multiple logic channels, and it does not consume much time to detect whether there is target data in each linked list, and can quickly respond to the event signal, so that the application program can call the API interface to obtain target data only for the linked lists with target data, reduce resource consumption, and improve work efficiency, and can call the calling interface to obtain linked list data of the linked list corresponding to each channel in sequence, which is simple and easy to implement in operation, and can execute two receiving methods simultaneously, both of which are to directly read data in the same linked list buffer area, and do not need to copy data, thus improving processing efficiency and simplifying data processing steps, and different requirements of users are met.
Referring to fig. 5, fig. 5 is a schematic structural diagram of an embodiment of a computer device according to the present application. The computer device 20 comprises a processor 21, a memory 22. The processor 21 is coupled to a memory 22. The memory 22 has stored therein a computer program which is executed by the processor 21 in operation to implement the method as shown in fig. 1-3. The detailed methods can be referred to above and are not described herein.
Referring to fig. 6, fig. 6 is a schematic structural diagram of an embodiment of a storage medium according to the present application. The storage medium 30 stores at least one computer program 31, and the computer program 31 is used for being executed by a processor to implement the method shown in fig. 1-3, and the detailed method can be referred to above and is not described herein again. In one embodiment, the computer readable storage medium 30 may be a memory chip in a terminal, a hard disk, or other readable and writable storage tool such as a removable hard disk, a flash disk, an optical disk, or the like, and may also be a server or the like.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware related to instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, databases, or other media used in the embodiments provided herein may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above embodiments only express a few implementation modes of the embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the claims. It should be noted that, for those skilled in the art, variations and modifications can be made without departing from the concept of the embodiments of the present application, and these embodiments are within the scope of the present application. Therefore, the protection scope of the embodiments of the present application shall be subject to the appended claims.
Claims (10)
1. A method for processing application data, the method comprising:
starting an application program, wherein the application program comprises at least two logic channels;
creating a thread and driving the thread to be in a waiting state;
driving the thread to inquire at least two linked list data according to the received event signal, wherein the at least two linked list data correspond to the at least two logic channels one to one;
and when the target data exists in the current linked list data corresponding to the current logic channel, informing the application program to call a calling interface to acquire the target data.
2. The method of claim 1, further comprising:
and when the thread is driven to inquire the current linked list data corresponding to the current logical channel, adding a first thread lock to the current linked list data, and when the inquiry of the current linked list data corresponding to the current logical channel is finished, removing the first thread lock.
3. The method of claim 1, wherein notifying the application program to call a calling interface to obtain the target data further comprises:
and when the application program calls the calling interface to acquire the target data, adding a second thread lock to an interface function of the calling interface, and after the application program acquires the target data, removing the second thread lock.
4. The method of claim 1, further comprising:
and calling the calling interface to sequentially acquire the linked list data corresponding to each of the at least two logic channels.
5. The method of claim 4, further comprising:
acquiring a received data mode matched with the application program requirement, and executing the step of creating the thread to acquire target data according to the asynchronous notification mode if the received data mode is the asynchronous notification mode;
if the data receiving mode is a synchronous polling mode, executing the step of calling the calling interface to sequentially acquire linked list data corresponding to each of the at least two logic channels to acquire target data according to the synchronous polling mode;
and if the data receiving mode is a simultaneous receiving mode, executing the steps of creating the thread and acquiring the target data according to the simultaneous receiving mode, and simultaneously executing the step of calling the calling interface to sequentially acquire the linked list data corresponding to each of the at least two logic channels to acquire the target data.
6. The method according to claim 4, wherein the invoking the invocation interface sequentially obtains linked list data corresponding to each of the at least two logical channels, specifically comprising:
if the current linked list data corresponding to the current logic channel is not empty, copying the current linked list data to return data, and deleting a linked list buffer area where the current linked list data is located;
and if the current linked list data corresponding to the current logical channel is empty, returning a result of empty.
7. The method of claim 1, wherein after said notifying the application call invocation interface to obtain the target data, the method further comprises:
and copying the target data to return data, and deleting a link table buffer area where the current link table data corresponding to the target data is located.
8. An application data processing system, comprising the following modules:
the starting module is used for starting an application program, and the application program comprises at least two logic channels;
the thread module is used for creating a thread and driving the thread to be in a waiting state;
the query module is used for driving the thread to query at least two linked list data according to the received event signal, and the at least two linked list data correspond to the at least two logic channels one to one;
and the calling module is used for informing the application program to call a calling interface to acquire the target data when the target data exists in the current linked list data corresponding to the current logic channel.
9. A computer device comprising a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform the steps of the method of any one of claims 1 to 7.
10. A storage medium, in which a computer program is stored which, when being executed by a processor, causes the processor to carry out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111367179.0A CN114064776A (en) | 2021-11-18 | 2021-11-18 | Application program data processing method, system, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111367179.0A CN114064776A (en) | 2021-11-18 | 2021-11-18 | Application program data processing method, system, computer device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114064776A true CN114064776A (en) | 2022-02-18 |
Family
ID=80278963
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111367179.0A Pending CN114064776A (en) | 2021-11-18 | 2021-11-18 | Application program data processing method, system, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114064776A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN120216120A (en) * | 2025-02-27 | 2025-06-27 | 广州致远电子股份有限公司 | Thread signal processing method, device, equipment and storage medium for embedded system |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1518312A (en) * | 2003-01-17 | 2004-08-04 | ��Ϊ��������˾ | Methods for multi-channel data processing |
| US20050234936A1 (en) * | 2004-04-14 | 2005-10-20 | Microsoft Corporation | Asynchronous database API |
| CN101309194A (en) * | 2008-06-02 | 2008-11-19 | 杭州华三通信技术有限公司 | SPI4.2 bus bridging implementing method and SPI4.2 bus bridging device |
| CN101534303A (en) * | 2009-04-20 | 2009-09-16 | 华为技术有限公司 | Method, device and single board for sending data |
| US20130024875A1 (en) * | 2011-07-22 | 2013-01-24 | Yilin Wang | Event System And Methods For Using Same |
| CN103701712A (en) * | 2013-12-03 | 2014-04-02 | 中国电子科技集团公司第三十研究所 | Method for binding plural E1 lines and realizing logic channel separation |
| CN108536121A (en) * | 2018-03-16 | 2018-09-14 | 深圳市道通科技股份有限公司 | Method for building up, device and the vehicle communication interface VCI of logical channel |
| CN109783254A (en) * | 2019-01-02 | 2019-05-21 | 深圳壹账通智能科技有限公司 | Asynchronism callback method, apparatus, computer equipment and storage medium |
| CN110515706A (en) * | 2019-08-16 | 2019-11-29 | 苏州浪潮智能科技有限公司 | A kind of request processing method, device, equipment and readable storage medium storing program for executing |
| CN111338999A (en) * | 2020-02-20 | 2020-06-26 | 南京芯驰半导体科技有限公司 | DMA system and data transmission method |
| CN111722944A (en) * | 2020-06-15 | 2020-09-29 | 哈工大机器人（合肥）国际创新研究院 | NIO-based AIRT-ROS communication method and system |
| US20210029219A1 (en) * | 2019-07-24 | 2021-01-28 | EMC IP Holding Company LLC | Data storage system with processor scheduling using distributed peek-poller threads |
| CN112927392A (en) * | 2021-01-19 | 2021-06-08 | 深圳市元征科技股份有限公司 | Communication method, vehicle communication interface device and readable storage medium |
-
2021
- 2021-11-18 CN CN202111367179.0A patent/CN114064776A/en active Pending
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1518312A (en) * | 2003-01-17 | 2004-08-04 | ��Ϊ��������˾ | Methods for multi-channel data processing |
| US20050234936A1 (en) * | 2004-04-14 | 2005-10-20 | Microsoft Corporation | Asynchronous database API |
| CN101309194A (en) * | 2008-06-02 | 2008-11-19 | 杭州华三通信技术有限公司 | SPI4.2 bus bridging implementing method and SPI4.2 bus bridging device |
| CN101534303A (en) * | 2009-04-20 | 2009-09-16 | 华为技术有限公司 | Method, device and single board for sending data |
| US20130024875A1 (en) * | 2011-07-22 | 2013-01-24 | Yilin Wang | Event System And Methods For Using Same |
| CN103701712A (en) * | 2013-12-03 | 2014-04-02 | 中国电子科技集团公司第三十研究所 | Method for binding plural E1 lines and realizing logic channel separation |
| CN108536121A (en) * | 2018-03-16 | 2018-09-14 | 深圳市道通科技股份有限公司 | Method for building up, device and the vehicle communication interface VCI of logical channel |
| CN109783254A (en) * | 2019-01-02 | 2019-05-21 | 深圳壹账通智能科技有限公司 | Asynchronism callback method, apparatus, computer equipment and storage medium |
| US20210029219A1 (en) * | 2019-07-24 | 2021-01-28 | EMC IP Holding Company LLC | Data storage system with processor scheduling using distributed peek-poller threads |
| CN110515706A (en) * | 2019-08-16 | 2019-11-29 | 苏州浪潮智能科技有限公司 | A kind of request processing method, device, equipment and readable storage medium storing program for executing |
| CN111338999A (en) * | 2020-02-20 | 2020-06-26 | 南京芯驰半导体科技有限公司 | DMA system and data transmission method |
| CN111722944A (en) * | 2020-06-15 | 2020-09-29 | 哈工大机器人（合肥）国际创新研究院 | NIO-based AIRT-ROS communication method and system |
| CN112927392A (en) * | 2021-01-19 | 2021-06-08 | 深圳市元征科技股份有限公司 | Communication method, vehicle communication interface device and readable storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 施咏月 等: "基于事件驱动的实验室管理软件数据处理方案", 医学信息学杂志, 16 November 2021 (2021-11-16), pages 1 - 6 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN120216120A (en) * | 2025-02-27 | 2025-06-27 | 广州致远电子股份有限公司 | Thread signal processing method, device, equipment and storage medium for embedded system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108536526B (en) | Resource management method and device based on programmable hardware | |
| CN107832100B (en) | APK plug-in loading method and terminal thereof | |
| CN110427386B (en) | Data processing method, device and computer storage medium | |
| CN111258565B (en) | Mini-program generation method, system, server and storage medium | |
| CN108512930B (en) | Shared file management method, device, server and storage medium | |
| CN115525631A (en) | Database data migration method, device, equipment and storage medium | |
| CN105045637A (en) | Application start method and terminal | |
| CN112818021B (en) | Data request processing method, device, computer equipment and storage medium | |
| CN110597393A (en) | A motor vibration control method, device and computer-readable storage medium | |
| CN111190727B (en) | Asynchronous memory destructor method and device, computer equipment and storage medium | |
| CN112764897B (en) | Task request processing method, device and system and computer readable storage medium | |
| EP3783484B1 (en) | Data processing method and computer device | |
| CN114064776A (en) | Application program data processing method, system, computer device and storage medium | |
| CN110852603A (en) | High-throughput wind control data processing method, device, equipment and storage medium | |
| CN114817107B (en) | PCIE equipment switching system, method and device, computer equipment and storage medium | |
| CN110995817B (en) | Request callback method and device and client equipment | |
| WO2023125359A1 (en) | Task processing method and apparatus | |
| CN114154044B (en) | Message pushing method and device, computer equipment and storage medium | |
| CN116319797A (en) | Scheduling method and device of cloud storage cluster, computer equipment and storage medium | |
| CN112732808A (en) | Data processing method, device, equipment and storage medium | |
| WO2025200670A1 (en) | Load balancing-based data processing system and method, device, and medium | |
| CN105630690A (en) | Big data processing method and device for heterogeneous hardware | |
| KR100594187B1 (en) | Timer driving method in intelligent network switching system under Unix system environment with thread call processing structure | |
| CN115168760B (en) | Data query methods, devices and storage media | |
| CN117687806A (en) | Deadlock processing method, electronic device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |