L2P data caching method and device, readable storage medium and electronic equipment
阅读说明：本技术 L2p数据缓存方法、装置、可读存储介质及电子设备 (L2P data caching method and device, readable storage medium and electronic equipment ) 是由 孙成思 孙日欣 胡伟 于 2021-08-04 设计创作，主要内容包括：本发明公开一种L2P数据缓存方法、装置、可读存储介质及电子设备,接收固态硬盘的随机写请求,所述随机写请求包括L2P数据；将所述L2P数据写入临时L2P存储空间；判断所述临时L2P存储空间中的L2P数据是否达到预设阈值,若是,则将所述临时L2P存储空间中的L2P数据迁移至实际L2P存储空间,若否,则返回执行判断所述临时L2P存储空间中的L2P数据是否达到预设阈值步骤,在随机写场景下,无需对实际L2P存储空间进行频繁地读、更新和写操作,减少对主机写性能的影响,从而保证了主机写性能的同时,避免出现写放大现象。(The invention discloses a method and a device for caching L2P data, a readable storage medium and electronic equipment, wherein the method comprises the steps of receiving a random write request of a solid state disk, wherein the random write request comprises L2P data; writing the L2P data to a temporary L2P storage space; judging whether the L2P data in the temporary L2P storage space reaches a preset threshold value, if so, migrating the L2P data in the temporary L2P storage space to an actual L2P storage space, otherwise, returning to execute the step of judging whether the L2P data in the temporary L2P storage space reaches the preset threshold value, and in a random writing scene, frequently reading, updating and writing the actual L2P storage space are not needed, so that the influence on the writing performance of the host is reduced, and the writing amplification phenomenon is avoided while the writing performance of the host is ensured.)
1. An L2P data caching method, comprising:
receiving a random write request of the solid state disk, wherein the random write request comprises L2P data;
writing the L2P data to a temporary L2P storage space;
and judging whether the L2P data in the temporary L2P storage space reaches a preset threshold value, if so, migrating the L2P data in the temporary L2P storage space to an actual L2P storage space, and if not, returning to execute the step of judging whether the L2P data in the temporary L2P storage space reaches the preset threshold value.
2. The L2P data caching method of claim 1, wherein the receiving a random write request from the solid state disk is preceded by:
receiving a storage space division request;
dividing the storage space of the solid state disk according to a first preset value according to the storage space division request to generate a plurality of sub-storage spaces, and setting corresponding sub-storage space identifiers for each sub-storage space;
the random write request also comprises a sub-storage space identifier corresponding to the L2P data;
the writing the L2P data to temporary L2P storage space comprises:
writing the L2P data to a temporary L2P storage space according to the sub storage space identification;
the migrating the L2P data in the temporary L2P storage space to actual L2P storage space comprises:
migrating the L2P data in the temporary L2P storage space to the actual L2P storage space according to the sub-storage space identification.
3. The L2P data caching method of claim 2, wherein said writing said L2P data into a temporary L2P storage space according to said sub-storage space identification comprises:
requesting a preset cache;
sequentially writing the L2P data into the preset cache;
in the process of sequential writing, judging whether the preset cache is full, if not, sequentially writing the unwritten L2P data into the preset cache, if so, writing the written L2P data in the preset cache into the temporary L2P storage space according to the sub-storage space identifier, and sequentially writing the unwritten L2P data into the preset cache;
returning to the step of sequentially writing the L2P data into the preset cache until the L2P data are all written into the temporary L2P space.
4. The L2P data caching method of claim 2, wherein said temporary L2P storage space comprises a plurality of preset spaces;
the writing the L2P data to the temporary L2P storage space according to the sub-storage space identification comprises:
acquiring a target preset space from the temporary L2P storage space according to the sub storage space identifier;
and writing the L2P data into the target preset space.
5. The L2P data caching method of claim 4, wherein said temporary L2P storage space further comprises a default space ID corresponding to each of said default spaces;
the writing the L2P data into the temporary L2P storage space according to the sub storage space identification further comprises:
acquiring a P2L mapping table corresponding to the temporary L2P storage space;
and updating the sub-storage space identifier and the preset space identifier corresponding to the L2P data to the P2L mapping table.
6. The L2P data caching method of claim 5, wherein said migrating L2P data in said temporary L2P storage space to actual L2P storage space according to said sub-storage space identification comprises:
acquiring an L2P mapping table corresponding to an actual L2P storage space;
reading L2P data corresponding to any identical sub-storage space identifier in the temporary L2P storage space according to the P2L mapping table;
updating the read L2P data corresponding to any identical sub-storage space identifier to the L2P mapping table;
receiving update completion information of the L2P mapping table;
writing the L2P data in the L2P mapping table into the actual L2P storage space according to the update completion information, and returning to execute the step of reading the L2P data corresponding to any same sub-storage space identifier in the temporary L2P storage space according to the P2L mapping table until the L2P data corresponding to each same sub-storage space identifier in the temporary L2P storage space is read.
7. The L2P data caching method according to claim 1, wherein the solid state disk is a DRAMless SSD.
8. An L2P data caching apparatus, comprising:
the request receiving module is used for receiving a random write request of the solid state disk, wherein the random write request comprises L2P data;
a data write module to write the L2P data to a temporary L2P storage space;
and the data migration module is configured to determine whether the L2P data in the temporary L2P storage space reaches a preset threshold, migrate the L2P data in the temporary L2P storage space to the actual L2P storage space if the L2P data in the temporary L2P storage space reaches the preset threshold, and return to the step of determining whether the L2P data in the temporary L2P storage space reaches the preset threshold if the L2P data in the temporary L2P storage space does not reach the preset threshold.
9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of a method for L2P data caching according to any one of claims 1 to 7.
10. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the steps of a method for L2P data caching as claimed in any one of claims 1 to 7 when executing the computer program.
Technical Field
The invention relates to the technical field of data caching, in particular to a method and a device for caching L2P data, a readable storage medium and electronic equipment.
Background
The L2P (Logical To Physical ) mapping data holds address information of user data, and the desired data can be accurately found only by mapping data through L2P.
At present, in mainstream dram less SSD (Solid State Disk without Memory) firmware implementation, a cache design for L2P data is a key ring for ensuring Random write performance. Since a DRAMless SSD itself only includes a small SRAM (Static Random-Access Memory) space, which is about 1MB (megabyte), the SRAM cannot store all L2P information of the entire Memory space (1T Memory space consumes 1G of L2P space), and most of L2P data needs to be stored in a NAND (flash Memory). When the L2P data is needed, the data is read from the NAND into the SRAM and stored in the NAND after use, so that in a random writing scenario, the L2P data may need to be read and written repeatedly, wherein there may be repeated operations on the L2P area of the same block of 4KB (kilobytes), which not only causes the write performance of the host to be degraded, but also causes unnecessary write amplification when the L2P area is frequently read and written.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: provided are a method and a device for caching L2P data, a readable storage medium and an electronic device, which can avoid the phenomenon of write amplification while ensuring the write performance of a host.
In order to solve the technical problems, the invention adopts a technical scheme that:
an L2P data caching method, comprising:
receiving a random write request of the solid state disk, wherein the random write request comprises L2P data;
writing the L2P data to a temporary L2P storage space;
and judging whether the L2P data in the temporary L2P storage space reaches a preset threshold value, if so, migrating the L2P data in the temporary L2P storage space to an actual L2P storage space, and if not, returning to execute the step of judging whether the L2P data in the temporary L2P storage space reaches the preset threshold value.
In order to solve the technical problem, the invention adopts another technical scheme as follows:
an L2P data caching apparatus, comprising:
the request receiving module is used for receiving a random write request of the solid state disk, wherein the random write request comprises L2P data;
a data write module to write the L2P data to a temporary L2P storage space;
and the data migration module is configured to determine whether the L2P data in the temporary L2P storage space reaches a preset threshold, migrate the L2P data in the temporary L2P storage space to the actual L2P storage space if the L2P data in the temporary L2P storage space reaches the preset threshold, and return to the step of determining whether the L2P data in the temporary L2P storage space reaches the preset threshold if the L2P data in the temporary L2P storage space does not reach the preset threshold.
In order to solve the technical problem, the invention adopts another technical scheme as follows:
a computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of a method of L2P data caching as described above.
In order to solve the technical problem, the invention adopts another technical scheme as follows:
an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of a method of L2P data caching as described above when executing the computer program.
The invention has the beneficial effects that: in a random writing scene, unlike the prior art, the L2P data is stored in the actual L2P storage space of the flash memory, and the L2P data needs to be repeatedly read and written, but the L2P data is written in the temporary L2P storage space of the flash memory, when the L2P data in the temporary L2P storage space reaches a preset threshold, the L2P data in the temporary L2P storage space is migrated to the actual L2P storage space, so that frequent read, update and write operations on the actual L2P storage space are not needed, the influence on the write performance of the host is reduced, and the write amplification phenomenon is avoided while the write performance of the host is ensured.
Drawings
FIG. 1 is a flowchart illustrating steps of a method for caching L2P data according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an L2P data caching apparatus according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating an L2P data write to temporary L2P storage space in the L2P data caching method according to an embodiment of the present invention;
fig. 5 is a schematic diagram illustrating a migration process of L2P data from a temporary L2P storage space to an actual L2P storage space in the L2P data caching method according to the embodiment of the present invention.
Detailed Description
In order to explain technical contents, achieved objects, and effects of the present invention in detail, the following description is made with reference to the accompanying drawings in combination with the embodiments.
Referring to fig. 1, an embodiment of the present invention provides a method for caching L2P data, including:
receiving a random write request of the solid state disk, wherein the random write request comprises L2P data;
writing the L2P data to a temporary L2P storage space;
and judging whether the L2P data in the temporary L2P storage space reaches a preset threshold value, if so, migrating the L2P data in the temporary L2P storage space to an actual L2P storage space, and if not, returning to execute the step of judging whether the L2P data in the temporary L2P storage space reaches the preset threshold value.
From the above description, the beneficial effects of the present invention are: in a random writing scene, unlike the prior art, the L2P data is stored in the actual L2P storage space of the flash memory, and the L2P data needs to be repeatedly read and written, but the L2P data is written in the temporary L2P storage space of the flash memory, when the L2P data in the temporary L2P storage space reaches a preset threshold, the L2P data in the temporary L2P storage space is migrated to the actual L2P storage space, so that frequent read, update and write operations on the actual L2P storage space are not needed, the influence on the write performance of the host is reduced, and the write amplification phenomenon is avoided while the write performance of the host is ensured.
Further, the receiving a random write request of the solid state disk includes:
receiving a storage space division request;
dividing the storage space of the solid state disk according to a first preset value according to the storage space division request to generate a plurality of sub-storage spaces, and setting corresponding sub-storage space identifiers for each sub-storage space;
the random write request also comprises a sub-storage space identifier corresponding to the L2P data;
the writing the L2P data to temporary L2P storage space comprises:
writing the L2P data to a temporary L2P storage space according to the sub storage space identification;
the migrating the L2P data in the temporary L2P storage space to actual L2P storage space comprises:
migrating the L2P data in the temporary L2P storage space to the actual L2P storage space according to the sub-storage space identification.
As can be seen from the above description, the storage space is divided into a plurality of sub-storage spaces, which facilitates subsequent data writing and data migration.
Further, the writing the L2P data into the temporary L2P storage space according to the sub-storage space identification comprises:
requesting a preset cache;
sequentially writing the L2P data into the preset cache;
in the process of sequential writing, judging whether the preset cache is full, if not, sequentially writing the unwritten L2P data into the preset cache, if so, writing the written L2P data in the preset cache into the temporary L2P storage space according to the sub-storage space identifier, and sequentially writing the unwritten L2P data into the preset cache;
returning to the step of sequentially writing the L2P data into the preset cache until the L2P data are all written into the temporary L2P space.
It can be known from the above description that the L2P data are sequentially written into the preset cache, and when the preset cache is full, the preset cache is eliminated, that is, the written L2P data in the preset cache is written into the temporary L2P storage space according to the sub-storage space identifier, so that the L2P data are directly written into the temporary L2P storage space in an additional writing manner, and the efficiency of the L2P data cache is improved.
Further, the temporary L2P storage space includes a plurality of preset spaces;
the writing the L2P data to the temporary L2P storage space according to the sub-storage space identification comprises:
acquiring a target preset space from the temporary L2P storage space according to the sub storage space identifier;
and writing the L2P data into the target preset space.
As can be seen from the above description, the temporary L2P storage space has a plurality of preset spaces, and when the L2P data is written into the temporary L2P storage space, a target preset space is obtained according to the sub-storage space identifier, and the L2P data is written into the target preset space, so that the data writing into the temporary L2P storage space is realized.
Further, the temporary L2P storage space further includes a preset space identifier corresponding to each preset space;
the writing the L2P data into the temporary L2P storage space according to the sub storage space identification further comprises:
acquiring a P2L mapping table corresponding to the temporary L2P storage space;
and updating the sub-storage space identifier and the preset space identifier corresponding to the L2P data to the P2L mapping table.
As can be seen from the above description, when writing L2P data into the temporary L2P storage space, the P2L mapping table corresponding to the temporary L2P storage space stores the sub-storage space identifier and the preset space identifier corresponding to each L2P data, so as to facilitate the subsequent data migration using the P2L mapping table.
Further, the migrating the L2P data in the temporary L2P storage space to actual L2P storage space according to the sub-storage space identification comprises:
acquiring an L2P mapping table corresponding to an actual L2P storage space;
reading L2P data corresponding to any identical sub-storage space identifier in the temporary L2P storage space according to the P2L mapping table;
updating the read L2P data corresponding to any identical sub-storage space identifier to the L2P mapping table;
receiving update completion information of the L2P mapping table;
writing the L2P data in the L2P mapping table into the actual L2P storage space according to the update completion information, and returning to execute the step of reading the L2P data corresponding to any same sub-storage space identifier in the temporary L2P storage space according to the P2L mapping table until the L2P data corresponding to each same sub-storage space identifier in the temporary L2P storage space is read.
As can be seen from the above description, during data migration, the P2L mapping table is used to read L2P data corresponding to each identical sub-storage space identifier in the temporary L2P storage space, the L2P data corresponding to the identical sub-storage space identifier read each time is updated to the L2P mapping table, and then the L2P data in the updated L2P mapping table is written into the actual L2P storage space, so that the L2P data belonging to the identical sub-storage space can be read out and migrated to the actual L2P storage space at one time, and the L2P data of each sub-storage space only needs to be written over once, thereby achieving efficient migration of the L2P data.
Further, the solid state disk is a DRAMless SSD.
Referring to fig. 2, another embodiment of the present invention provides an L2P data caching apparatus, including:
the request receiving module is used for receiving a random write request of the solid state disk, wherein the random write request comprises L2P data;
a data write module to write the L2P data to a temporary L2P storage space;
and the data migration module is configured to determine whether the L2P data in the temporary L2P storage space reaches a preset threshold, migrate the L2P data in the temporary L2P storage space to the actual L2P storage space if the L2P data in the temporary L2P storage space reaches the preset threshold, and return to the step of determining whether the L2P data in the temporary L2P storage space reaches the preset threshold if the L2P data in the temporary L2P storage space does not reach the preset threshold.
Another embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the steps of the above-mentioned L2P data caching method.
Referring to fig. 3, another embodiment of the present invention provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and running on the processor, wherein the processor executes the computer program to implement the steps of the L2P data caching method.
The above L2P data caching method, apparatus, readable storage medium, and electronic device of the present invention can be applied to an L2P data cache of a DRAMless SSD (Dynamic Random Access Memory solid state disk), and the following description is provided by specific embodiments:
example one
Referring to fig. 1 and 4, a method for caching L2P data in the present embodiment includes:
s1, receiving a storage space dividing request;
s2, dividing the storage space of the solid state disk according to a first preset value according to the storage space dividing request to generate a plurality of sub-storage spaces, and setting corresponding sub-storage space identifiers for each sub-storage space;
the solid state disk is a DRAMless SSD, the first preset value can be flexibly set according to actual conditions, and in the embodiment, the first preset value is 64 MB;
specifically, the storage space of the DRAMless SSD is divided according to 64MB according to the storage space division request, as shown in fig. 4, a plurality of 64MB spaces are generated, including the 1 st 64MB space, the 2 nd 64MB space, … …, and the nth 64MB space, and a corresponding 64MB space identifier is set for each 64MB space;
s3, receiving a random write request of the solid state disk, wherein the random write request comprises L2P data and a sub storage space identifier corresponding to the L2P data;
s4, writing the L2P data into a temporary L2P storage space;
specifically, the L2P data is written into the temporary L2P storage space according to the sub-storage space identifier, as shown in fig. 4, the temporary L2P Nand in fig. 4 is the temporary L2P storage space;
s5, judging whether the L2P data in the temporary L2P storage space reach a preset threshold value, if so, migrating the L2P data in the temporary L2P storage space to an actual L2P storage space, and if not, returning to execute the step of judging whether the L2P data in the temporary L2P storage space reach the preset threshold value;
the migrating the L2P data in the temporary L2P storage space to actual L2P storage space comprises:
migrating the L2P data in the temporary L2P storage space to the actual L2P storage space according to the sub-storage space identification.
Example two
Referring to fig. 1, 4-5, the present embodiment further defines how to write the L2P data into the temporary L2P storage space based on the first embodiment, specifically:
the S4 specifically includes:
requesting a preset cache;
sequentially writing the L2P data into the preset cache;
in the process of sequential writing, judging whether the preset cache is full, if not, sequentially writing the unwritten L2P data into the preset cache, if so, writing the written L2P data in the preset cache into the temporary L2P storage space according to the sub-storage space identifier, and sequentially writing the unwritten L2P data into the preset cache;
returning to the step of performing the sequential writing of the L2P data into the preset cache until all the L2P data have been written into the temporary L2P space;
the temporary L2P storage space comprises a plurality of preset spaces and preset space identifiers corresponding to the preset spaces;
acquiring a target preset space from the temporary L2P storage space according to the sub storage space identifier;
writing the L2P data into the target preset space;
the writing the L2P data into the temporary L2P storage space according to the sub storage space identification further comprises:
acquiring a P2L mapping table corresponding to the temporary L2P storage space;
updating the sub-storage space identifier and the preset space identifier corresponding to the L2P data to the P2L mapping table;
in this embodiment, the preset space is a 4KB space, the preset space identifier is a 4KB space identifier, and the preset cache is a 4KB cache;
specifically, a 4KB cache is requested, such as 4K write in fig. 4, L2P data is sequentially written into the 4KB cache, and when the data is sequentially written, it is determined whether the 4KB cache is full, if not, the unwritten L2P data is sequentially written into the 4KB cache, and if so, the 4KB cache is eliminated, that is, a target 4KB space is obtained from the temporary L2P storage space according to 64MB space identifier, as shown in fig. 4;
writing the written L2P data in the 4KB cache into the target 4KB space, and sequentially writing the unwritten L2P data into the 4KB cache;
the step of sequentially writing the L2P data into the 4KB cache is performed back until all L2P data have been written into the temporary L2P storage space, as shown in fig. 5, where the temporary L2P Nand in fig. 5 is the temporary L2P storage space;
each time the written L2P data in the 4KB cache is written into the target 4KB space, the P2L table corresponding to the temporary L2P storage space is also obtained, as shown in fig. 5;
as shown in fig. 4, the 64MB space id and the 4KB space id corresponding to the L2P data are updated to the P2L table, that is, the P2L table stores the 64MB space id and the 4KB space id corresponding to each L2P data, so as to facilitate subsequent data migration.
EXAMPLE III
Referring to fig. 1 and 5, the present embodiment further defines how to implement data migration based on the first embodiment, and specifically includes:
in the S5, migrating the L2P data in the temporary L2P storage space to the actual L2P storage space according to the sub storage space identifier includes:
acquiring an L2P mapping table corresponding to an actual L2P storage space;
reading L2P data corresponding to any identical sub-storage space identifier in the temporary L2P storage space according to the P2L mapping table;
updating the read L2P data corresponding to any identical sub-storage space identifier to the L2P mapping table;
receiving update completion information of the L2P mapping table;
writing the L2P data in the L2P mapping table into the actual L2P storage space according to the update completion information, and returning to execute the step of reading the L2P data corresponding to any same sub-storage space identifier in the temporary L2P storage space according to the P2L mapping table until the L2P data corresponding to each same sub-storage space identifier in the temporary L2P storage space is read;
specifically, an L2P table corresponding to an actual L2P storage space is obtained, and L2P data corresponding to any identical 64MB space identifier in the temporary L2P storage space is read according to the P2L table, as shown in fig. 5, the actual L2P Nand in fig. 5 is the actual L2P storage space;
updating the read L2P data corresponding to any same 64MB space identification to an L2P table;
receiving update completion information of the L2P table, writing L2P data in the L2P table into an actual L2P storage space according to the update completion information, and returning to execute the step of reading L2P data corresponding to any same 64MB space identifier in the temporary L2P storage space according to the P2L table until the L2P data corresponding to each same 64MB space identifier in the temporary L2P storage space is read;
that is to say, in the migration process of the L2P data, the L2P data belonging to the same 64MB space is read out at one time, and then the L2P data of each 64MB space only needs to be overwritten once, so that the efficient migration of the L2P data is realized.
Example four
Referring to fig. 2, an L2P data caching apparatus includes:
the request receiving module is used for receiving a random write request of the solid state disk, wherein the random write request comprises L2P data;
a data write module to write the L2P data to a temporary L2P storage space;
and the data migration module is configured to determine whether the L2P data in the temporary L2P storage space reaches a preset threshold, migrate the L2P data in the temporary L2P storage space to the actual L2P storage space if the L2P data in the temporary L2P storage space reaches the preset threshold, and return to the step of determining whether the L2P data in the temporary L2P storage space reaches the preset threshold if the L2P data in the temporary L2P storage space does not reach the preset threshold.
EXAMPLE five
A computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, can implement the steps of the L2P data caching method in the first embodiment, the second embodiment, or the third embodiment.
EXAMPLE six
Referring to fig. 3, an electronic device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement the steps of the L2P data caching method in the first embodiment, the second embodiment, or the third embodiment.
In summary, according to the L2P data caching method, apparatus, readable storage medium, and electronic device provided by the present invention, the storage space of the solid state disk is divided according to the first preset value according to the storage space division request, so as to generate a plurality of sub storage spaces, and a corresponding sub storage space identifier is set for each sub storage space, and the L2P data is written into the temporary L2P storage space according to the sub storage space identifier corresponding to the L2P data, when the L2P data in the temporary L2P storage space reaches the preset threshold, the L2P data in the temporary L2P storage space is migrated to the actual L2P storage space according to the sub storage space identifier, only the L2P data needs to be stored into the temporary L2P storage space, and frequent read, update, and write operations on the actual L2P storage space are not needed, so as to reduce the influence on the write performance of the host; in the migration process of the L2P data, acquiring an L2P mapping table corresponding to an actual L2P storage space, reading L2P data corresponding to any identical sub-storage space identifier in the temporary L2P storage space according to a P2L mapping table, updating the L2P data corresponding to any identical read sub-storage space identifier to an L2P mapping table, writing L2P data in an L2P mapping table into an actual L2P storage space according to the received update completion information, and returning to perform the step of reading L2P data corresponding to any identical sub-storage space identifier in a temporary L2P storage space according to a P2L mapping table until L2P data corresponding to each identical sub-storage space identifier in the temporary L2P storage space is read, so as to read L2P data belonging to the identical sub-storage space to the actual L2P storage space at one time, wherein L2P data of each sub-storage space only needs to be written once, and the L2P data is efficiently migrated, therefore, the write amplification phenomenon is avoided while the write performance of the host is ensured.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.
In the above embodiments provided in the present application, it should be understood that the disclosed method, apparatus, computer-readable storage medium, and electronic device may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical division, and other divisions may be realized in practice, for example, a plurality of components or modules may be combined or integrated into another apparatus, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or components or modules, and may be in an electrical, mechanical or other form.
The components described as separate parts may or may not be physically separate, and parts displayed as components may or may not be physical modules, may be located in one place, or may be distributed on a plurality of network modules. Some or all of the components can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional modules in the embodiments of the present invention may be integrated into one processing module, or each component may exist alone physically, or two or more modules are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.
The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
It should be noted that, for the sake of simplicity, the above-mentioned method embodiments are described as a series of acts or combinations, but those skilled in the art should understand that the present invention is not limited by the described order of acts, as some steps may be performed in other orders or simultaneously according to the present invention. Further, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred and that no acts or modules are necessarily required of the invention.
In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.