Data caching method and electronic equipment

Abstract

The invention discloses a data caching method and electronic equipment. The data caching method comprises the following steps: establishing an annular linked list based on N memory blocks, wherein N is an integer greater than or equal to 2, the storage capacity of N memory blocks contained in the annular linked list is greater than the storage capacity of other memory blocks in the electronic equipment; and executing data writing and / or data reading processing based on the annular linked list, at least comprising one of the following processing modes: during data writing, if the memory block corresponding to the annular linked list is fully written, selecting an idle memory block from an idle list as a newly added memory block in the annular linked list, and writing data in the newly added memory block, and when data are read, taking out a first memory block from the at least one fully-written memory block corresponding to the annular linked list, and reading data from the first memory block. Therefore, the dynamic expansion of the annular linked list is realized, the frequency of releasing the memory blocks is reduced, and the performance of data caching is improved.

Description

technical field [0001] The present disclosure relates to the technical field of communications, and in particular to a data buffering method and electronic equipment. Background technique [0002] When transferring data between different software function modules in the same software system, a data cache module or a message queue needs to be used. The data cache module can not only cache data, but also for asynchronous data cache, can make the two modules almost independent of each other, and can achieve efficient decoupling and isolation. [0003] At present, the commonly used data cache is RingBuffer with fixed length and logical end-to-end connection. The bottom layer is generally implemented by array or linked list data structure. Such an implementation has the problem that the length of the array cannot be dynamically expanded, or the storage capacity of the memory block requested when using the linked list is small, requiring frequent application and release of memory...

AI Technical Summary

Problems solved by technology

This implementation method has the problem that the length of the array cannot be dynamically expanded, or the storage capacity of the memory block requested when using the linked list is small, and frequent application and release of memory blocks is required, resulting in low data storage performance.

Images