CN108108307A - A kind of method for processing resource and terminal - Google Patents

Abstract

The embodiment of the invention discloses a kind of method for processing resource and terminal, the above method can include：When transmitting the first data, the first space length of the first data is obtained；First space length and pre-set space length are compared；When the first space length is less than pre-set space length, idling-resource block is traveled through according to pre-set space length, determines the first idling-resource block, the first idling-resource block is more than or equal to pre-set space length；Using the first idling-resource block storage resource is distributed to the first data.

Description

Resource processing method and terminal

technical field

The present invention relates to storage technology in the computer field, in particular to a resource processing method and a terminal.

Background technique

Memory is a memory device used to save information such as programs and data in modern information technology. Computers can store information such as input raw data, computer programs, intermediate results of calculations, and final operating results into memory. Therefore, whether the resources of memory Sufficiency determines the speed of computer processing. In recent years, with the rapid development of the network, the computer has carried more and more calculations and data information, and the resources stored in the memory are fixed and very limited, so for When managing memory resources, some special methods can be adopted to improve the operating efficiency of the memory and reduce the waste of storage space.

At present, the operating system of the terminal can manage the memory in the form of a free block list. As shown in Figure 1, all free blocks in the memory are stored in the form of a free block list. When the memory reclaims resources, the memory searches for a suitable insertion address to insert the reclaimed resource block by traversing the linked list.

However, the existing free block linked list management method produces a large number of space fragments after a large number of allocation and recovery operations. These very small space fragments cannot meet the allocation requirements, but the sum of the fragments in the linked list is greater than the space to be allocated , leading to the problems of excessive space debris and waste of resources.

Contents of the invention

In order to solve the above technical problems, the embodiments of the present invention expect to provide a resource processing method and a terminal, which can reduce space fragments and reduce waste of resources.

Technical scheme of the present invention is realized like this:

An embodiment of the present invention provides a resource processing method, including:

When transmitting the first data, acquire the first space length of the first data;

comparing the first space length with a preset space length;

When the first space length is less than the preset space length, traverse the free resource blocks according to the preset space length to determine a first free resource block, and the first free resource block is greater than or equal to the preset space length ;

Allocating storage resources to the first data by using the first idle resource block.

In the above solution, after comparing the first space length with the preset space length, before using the first free resource block to allocate storage resources to the first data, the method further include:

When the first space length is greater than or equal to the preset space length, traverse the idle resource blocks according to the first space length to determine the first idle resource block, and the first idle resource block is greater than or equal to the preset space length the first space length.

In the above solution, the allocation of storage resources to the first data by using the first free resource block includes:

When the sum of the two preset space lengths is greater than the length of the first free resource block, determine that the first free resource block is a storage resource block for the first data;

When the sum of the two preset space lengths is less than or equal to the length of the first free resource block, determine a resource block to be allocated whose length is the preset space length from the first free resource block, and The resource block to be allocated is a resource block for storing the first data.

In the above solution, the allocation of storage resources to the first data by using the first free resource block includes:

When the sum of the first space length and the preset space length is greater than the length of the first free resource block, determine that the first free resource block is a storage resource block for the first data;

When the sum of the first space length and the preset space length is less than or equal to the length of the first free resource block, determine from the first free resource block a waiting space whose length is the first space length Allocating a resource block, where the resource block to be allocated is a storage resource block for the first data.

In the above solution, the determining the resource block to be allocated whose length is the preset space length from the first free resource block includes:

In the first free resource block, starting from the end address of the first free resource block, read a second free resource block whose length is the preset space length, and the second free resource block belongs to the the first free resource block;

Determining the second idle resource block as the resource block to be allocated.

In the above solution, the determining the resource block to be allocated whose length is the first space length from the first free resource block includes:

In the first free resource block, starting from the end address of the first free resource block, read a third free resource block whose length is the first space length, and the third free resource block belongs to the the first free resource block;

Determining the third idle resource block as the resource block to be allocated.

In the above solution, traversing the idle resource blocks according to the preset space length to determine the first idle resource block includes:

traversing the free resource blocks from the initial free resource block;

comparing the preset space length with a second space length of a current free resource block, where the current free resource block is one of the free resource blocks;

Until it is determined that the current idle resource block whose second space length is greater than the preset space length is the first idle resource block.

In the above solution, after comparing the preset space length with the second space length of the current idle resource block, the method further includes:

When traversing to the end of the free resource block does not determine the first free resource block, end the process of comparing the preset space length with the second space length of the current free resource block and return the determination failure instruction .

In the above solution, after allocating storage resources to the first data by using the first free resource block, the method further includes:

When the transmission of the first data is completed, releasing the first data, and obtaining a storage resource block after releasing the first data, the storage resource block includes first address information;

Traverse the idle resource blocks according to the first address information and preset determination conditions, and determine a fourth idle resource block adjacent to the storage resource block;

Determine the storage resource block and the fourth idle resource block according to the first address information and the second address information, and the fourth idle resource block is one of the idle resource blocks corresponding to the storage resource block. Adjacent idle resource blocks, the second address information is address information of the fourth idle resource block;

When it is determined that the fourth idle resource block is continuous with the storage resource block, combining the fourth idle resource block and the storage resource block into a new fourth idle resource block.

In the above solution, the step of traversing the idle resource blocks according to the first address information and preset determination conditions, and determining the fourth idle resource block adjacent to the storage resource block includes:

traversing the free resource blocks from the initial free resource block;

comparing the first address information with the second address information of the current free resource block;

When it is determined that the second address information is greater than the first address information, and the difference between the second address information and the first address information is the smallest, determine the current idle resource block as the fifth idle resource block, the The fifth idle resource block is the fourth idle resource block right adjacent to the storage resource block;

When it is determined that the second address information is smaller than the first address information, and the difference between the second address information and the first address information is the smallest, determine the current idle resource block as the sixth idle resource block, the The sixth idle resource block is the fourth idle resource block left adjacent to the storage resource block.

In the above solution, after traversing the idle resource blocks according to the first address information and preset determination conditions, and determining the fourth idle resource block adjacent to the storage resource block, the method further includes:

When the current idle resource block is a terminated idle resource block and the second address information is smaller than the first address information, the process of traversing the idle resource block ends.

In the above solution, the storage resource block includes a third space length, and when the fourth free resource block is continuous with the storage resource block, combining the fourth free resource block with the storage resource block forming a new fourth free resource block, including:

When the storage resource block is continuous with the fifth idle resource block, combining the space length of the fifth idle resource block and the third space length into a new space length of the fifth idle resource block, and combining the space length of the fifth idle resource block The first address information is used as the address information of the next free resource block pointed to by the first pointer, and the address information of the next free resource block pointed to by the second pointer is used as the address information of the next free resource block pointed to by the new third pointer The address information of the next free resource block pointed to by the first pointer is the pointer information corresponding to the sixth free resource block, and the address information of the next free resource block pointed to by the second pointer is the storage resource block Corresponding pointer information, where the address information of the next free resource block pointed to by the third pointer is the pointer information corresponding to the fifth free resource block;

When the storage resource block is continuous with the sixth free resource block, combining the space length of the sixth free resource block and the second space length into a new space length of the sixth free resource block.

In the above solution, after the determination of the storage resource block and the fourth idle resource block according to the first address information and the second address information, the method further includes:

When it is determined that the stored free resource block is not continuous with the fifth free resource block and the sixth free resource block, using the first address information as the address of the next free resource block pointed to by the first pointer Address information, using the address information of the next free resource block pointed to by the first pointer as the address information of the next free resource block pointed to by the third pointer.

An embodiment of the present invention provides a terminal, and the terminal includes:

an acquiring unit, configured to acquire a first space length of the first data when transmitting the first data;

a comparison unit, configured to compare the first space length with a preset space length;

A determining unit, configured to traverse idle resource blocks according to the preset space length when the first space length is less than the preset space length, and determine a first idle resource block, where the first idle resource block is greater than or equal to the preset space length the preset space length;

An allocating unit, configured to allocate storage resources to the first data by using the first free resource block.

In the above terminal, the determining unit is further configured to traverse the idle resource blocks according to the first space length and determine the first idle resource block when the first space length is greater than or equal to the preset space length A resource block, the first idle resource block is greater than or equal to the first space length.

In the above terminal, the determining unit is further configured to determine that the first idle resource block is the first idle resource block when the sum of the two preset space lengths is greater than the length of the first idle resource block. A data storage resource block; when the sum of the two preset space lengths is less than or equal to the length of the first free resource block, determine from the first free resource block the length of the preset space length A resource block to be allocated is a resource block for storing the first data.

In the above terminal, the determining unit is further configured to determine the first idle resource block when the sum of the first space length and the preset space length is greater than the length of the first idle resource block storage resource block for the first data; when the sum of the first space length and the preset space length is less than or equal to the length of the first free resource block, select from the first free resource block Determine a resource block to be allocated whose length is the first space length, and the resource block to be allocated is a resource block for storing the first data.

In the above terminal, the terminal further includes: a reading unit;

The reading unit is configured to, in the first free resource block, start from the end address of the first free resource block, and read a second free resource block whose length is the preset space length, the the second idle resource block belongs to the first idle resource block;

The determining unit is further configured to determine the second idle resource block as the resource block to be allocated.

In the above-mentioned terminal, the reading unit is further configured to, in the first free resource block, start from the termination address of the first free resource block, and read the third part whose length is the first space length. an idle resource block, the third idle resource block belongs to the first idle resource block;

The determining unit is further configured to determine the third idle resource block as the resource block to be allocated.

In the above terminal, the terminal further includes: a traversal unit and a comparison unit;

The traversal unit is configured to traverse the idle resource block from the initial idle resource block;

The comparison unit is configured to compare the preset space length with a second space length of a current idle resource block, where the current idle resource block is one of the idle resource blocks;

The determining unit is specifically configured to determine that the current idle resource block whose second space length is greater than the preset space length is the first idle resource block.

In the above terminal, the terminal further includes: an end unit;

The end unit is configured to end comparing the preset space length with the second space length of the current free resource block when the first free resource block is not determined after traversing to the end of the free resource block The process and return to confirm failure instruction.

In the above terminal, the terminal further includes: a determining unit and a combining unit;

The obtaining unit is further configured to release the first data when the transmission of the first data is completed, and obtain a storage resource block that has released the first data, and the storage resource block includes first address information;

The determining unit is further configured to traverse the idle resource blocks according to the first address information and preset determination conditions, and determine a fourth idle resource block adjacent to the storage resource block;

The determination unit is configured to determine the storage resource block and the fourth idle resource block according to the first address information and the second address information, and the fourth idle resource block is one of the idle resource blocks For an idle resource block adjacent to the storage resource block, the second address information is address information of the fourth idle resource block;

The combining unit is configured to combine the fourth idle resource block and the storage resource block into a new fourth idle resource block when it is determined that the fourth idle resource block is continuous with the storage resource block .

In the above terminal, the traversal unit is further configured to traverse the idle resource block from the initial idle resource block;

The comparing unit further compares the first address information with the second address information of the current idle resource block;

The determining unit is further configured to determine the current idle resource block as A fifth idle resource block, where the fifth idle resource block is the fourth idle resource block right adjacent to the storage resource block; when it is determined that the second address information is smaller than the first address information, and the When the difference between the second address information and the first address information is the smallest, determine the current free resource block as the sixth free resource block, and the sixth free resource block is the left adjacent to the storage resource block. A fourth free resource block.

In the above-mentioned terminal, the ending unit is further configured to end traversing the idle resource block when the current idle resource block is a terminated idle resource block and the second address information is smaller than the first address information process.

In the above terminal, the combining unit is specifically configured to combine the space length of the fifth free resource block and the third space length into The space length of the new fifth free resource block, using the first address information as the address information of the next free resource block pointed to by the first pointer, and using the address information of the next free resource block pointed to by the second pointer as the new The address information of the next free resource block pointed to by the third pointer, the address information of the next free resource block pointed to by the first pointer is the pointer information corresponding to the sixth free resource block, and the next free resource block pointed to by the second pointer The address information of a free resource block is the pointer information corresponding to the storage resource block, and the address information of the next free resource block pointed to by the third pointer is the pointer information corresponding to the fifth free resource block; when the storage When the resource block is continuous with the sixth idle resource block, combining the space length of the sixth idle resource block and the second space length into a new space length of the sixth idle resource block.

In the above terminal, the terminal further includes: an updating unit;

The update unit is configured to use the first address information as the first pointer to The address information of the next free resource block pointed to by the first pointer is used as the address information of the next free resource block pointed to by the third pointer.

An embodiment of the present invention provides a resource processing method and a terminal, by acquiring the first space length of the first data when transmitting the first data; comparing the first space length with the preset space length; when the first space length When it is less than the preset space length, traverse the free resource blocks according to the preset space length to determine the first free resource block, the first free resource block is greater than or equal to the preset space length; use the first free resource block to allocate storage resources to the first data. By adopting the above technical implementation scheme, the minimum storage resource can be set when allocating memory resources, so that the allocated idle resource blocks and the remaining idle resource blocks are not smaller than the minimum storage resource, which can reduce space fragmentation and waste of resources.

Description of drawings

FIG. 1 is a schematic diagram of memory allocation and recovery of idle blocks in the prior art;

FIG. 2 is a flow chart 1 of a resource processing method provided by an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of an exemplary free block provided by an embodiment of the present invention;

FIG. 4 is a schematic structural diagram of an exemplary allocated free block provided by an embodiment of the present invention;

FIG. 5 is a schematic diagram 1 of an exemplary allocation of free blocks provided by an embodiment of the present invention;

FIG. 6 is a schematic diagram 2 of an exemplary allocation of free blocks provided by an embodiment of the present invention;

FIG. 7 is a schematic diagram 3 of an exemplary allocation of free blocks provided by an embodiment of the present invention;

FIG. 8 is a second flowchart of a resource processing method provided by an embodiment of the present invention;

FIG. 9 is a schematic diagram 1 of an exemplary allocated free block being reclaimed according to an embodiment of the present invention;

FIG. 10 is a schematic diagram 2 of an exemplary allocated free block being reclaimed according to an embodiment of the present invention;

Fig. 11 is a schematic diagram 3 of an exemplary allocated free block being reclaimed according to an embodiment of the present invention;

FIG. 12 is a third flowchart of a resource processing method provided by an embodiment of the present invention;

FIG. 13 is a fourth flowchart of a resource processing method provided by an embodiment of the present invention;

FIG. 14 is a first structural schematic diagram of a terminal 1 provided by an embodiment of the present invention;

FIG. 15 is a second structural schematic diagram of a terminal 1 provided by an embodiment of the present invention;

FIG. 16 is a third structural schematic diagram of a terminal 1 provided by an embodiment of the present invention;

FIG. 17 is a fourth schematic structural diagram of a terminal 1 provided by an embodiment of the present invention;

FIG. 18 is a fifth structural schematic diagram of a terminal 1 provided by an embodiment of the present invention;

FIG. 19 is a sixth structural schematic diagram of a terminal 1 provided by an embodiment of the present invention;

FIG. 20 is a seventh structural schematic diagram of a terminal 1 provided by an embodiment of the present invention.

Detailed ways

The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the drawings in the embodiments of the present invention.

Embodiment one

An embodiment of the present invention provides a resource processing method, as shown in Figure 2, the method may include:

S101. When transmitting first data, acquire a first space length of the first data.

A resource processing method provided by an embodiment of the present invention is applicable to a scenario in which idle resources in a memory are allocated.

In the embodiment of the present invention, when the terminal transmits the first data, the terminal operating system needs to call idle resources in the memory to store the first data, and at this time, the memory obtains the first space length required by the first data.

In the embodiment of the present invention, the free resource blocks in the memory are stored in the form of a free block linked list, as shown in Figure 3, each free resource block is composed of three parts, namely LEN, Next Addr and Space, wherein , LEN represents the length of the available space of the free resource block, the value of LEN is the sum of the values of Next Addr and Space, Next Addr represents the starting address of the next free resource block, and when the free resource block is the last For a free resource block, the value is NULL, and Space indicates the length that the free resource block can actually allocate.

In the embodiment of the present invention, the length occupied by LEN and Next Addr can be set according to the memory size.

Exemplarily, when the length sum occupied by LEN and Next Addr is set to 2 bytes, a 64K free resource block can be managed; when the length sum occupied by LEN and Next Addr is set to 4 bytes, it can Manage free resource blocks of 4G size.

S102. Compare the first space length with a preset space length.

After the memory acquires the first space length of the first data, it is necessary to determine whether the first space length is smaller than the minimum length set by the memory.

In the embodiment of the present invention, a preset space length is set in the memory. When the memory acquires that the terminal needs to occupy the first space, the memory compares the first space length with the preset space length to determine whether the first space length is greater than or equal to the preset space length. Set the length of the space.

S103. When the first space length is less than the preset space length, traverse the free resource blocks according to the preset space length to determine a first free resource block, where the first free resource block is greater than or equal to the preset space length.

When the result of the comparison between the first space length and the preset space length is that the first space length is smaller than the preset space length, it is necessary to search for a first free resource block greater than or equal to the preset space length among free resource blocks in the memory.

In the embodiment of the present invention, when the first space length is less than the preset space length, it means that the space length required by the terminal is less than the minimum allocated space length preset by the memory. At this time, the memory searches for free resource blocks according to the preset space length A suitable first free resource block.

Further, when the first space length is greater than or equal to the preset space length, it indicates that the first space length satisfies the length of the minimum allocated space of the memory. At this time, the memory searches for a first free resource block greater than or equal to the first space length from the free resource blocks. resource blocks.

It can be understood that by comparing the first space length with the preset space length set by the memory, it is avoided that the space length applied for memory allocation is smaller than the preset space length set by the memory, which can effectively avoid the generation of space fragments.

S104. Allocate storage resources to the first data by using the first free resource block.

When the memory determines the first free resource block to be allocated, it separates the first free resource block according to the allocated space length determined by the memory, and allocates the separated free resource block to the first data storage resource.

In the embodiment of the present invention, when the first space length is less than the preset space length, it is compared whether the sum of the two preset space lengths is greater than the length of the first free resource block, and if the sum of the two preset space lengths is greater than or equal to the first The length of the free resource block indicates that after the first free resource block is separated from the free resource block with a preset space length, the remaining free resource blocks are smaller than the preset space length. At this time, the entire first free resource block is allocated to the first free resource block One data stores data; if the sum of the two preset space lengths is less than the length of the first free resource block, it means that after the first free resource block separates the free resource blocks with the preset space length, the remaining free resource blocks are greater than The space length is preset. At this time, the first free resource block is intercepted from the end of the free resource block of the preset space length and allocated to the first data for data storage.

Further, when the first space length is greater than or equal to the preset space length, compare whether the sum of the first space length and the preset space length is greater than the length of the first idle resource block, if the first space length and the preset space length are the same as the preset space length Let the sum of the space lengths be greater than or equal to the length of the first free resource block, which means that after the first free resource block is separated from the free resource blocks of the first space length, the remaining free resource blocks are smaller than the preset space length. At this time, the entire The first free resource block is all allocated to the first data for data storage; if the sum of the first space length and the preset space length and the preset space length is less than the length of the first free resource block, it indicates that the first free resource block is separating After the free resource blocks of the first space length are found, the remaining free resource blocks are larger than the preset space length. At this time, the first free resource blocks are intercepted from the end of the first free resource blocks and allocated to the first data for data processing. storage.

In the embodiment of the present invention, the data structure of the allocated resource block is as shown in Figure 4, and consists of two parts, LEN and Addr, wherein, LEN is used to indicate the actual length of the allocated space, and the value of LEN is the value of Next Addr and Space The sum of the values, Addr is used to record the starting address of the allocated resource block.

In the embodiment of the present invention, the first idle resource block intercepts an idle resource block with a specified space length from the tail. As shown in FIG. 5, the idle resource block is composed of LEN1, Next Addr and Space before allocation. When a resource with a length of 64K is allocated in the free resource block, 64K is intercepted from the end of Space as the allocated resource, and 2 bytes are allocated before the allocated resource to store the LEN2 and Addr of the resource. At this time, the value of LEN1 of the free resource block is changed to LEN1', where the value of LEN1' is the difference between the value of LEN1 and 64k.

Exemplarily, as shown in FIG. 6, there are three free resource blocks L1, L2, and L3 in the memory, which are stored in the form of a linked list. When the memory allocates all the free resource blocks of L2 to the first data for storage operations, L2 The value of Next Addr in the free resource block is changed to the value of Next Addr in the L3 free resource block, the value of Next Addr in the L1 free resource block is changed to the value of Next Addr in the L2 free resource block, and the L2 free resource block assigned to the first data.

Exemplarily, as shown in FIG. 7, there are two free resource blocks L1 and L2 in the memory, which are stored in the form of a linked list. When the memory allocates part of the free resource blocks in the L2 free resource blocks to the first data storage operation , the L2 idle resource block intercepts the specified idle resource block L3 determined according to the first data from the end, and adds the L3 and Addr fields representing the length and address of the L3 resource block before the L3 resource block. At this time, the L2 idle resource block represents The L2 value of the assignable length is changed to L2', where the value of L2' is the difference between the L2 value and the L3 value.

It can be understood that when allocating the free resource blocks to the first data, it is ensured that the allocated first free resource blocks and the remaining free resource blocks are not less than the minimum value preset by the memory, thus reducing resource allocation. Smaller space resource blocks are generated, resulting in the impossibility of subsequent resource allocation, which can reduce space debris and waste of resources.

Embodiment two

As shown in FIG. 8, based on the first embodiment, the embodiment of the present invention also provides a resource recovery method. After step S104, the specific steps include:

S201. When the transmission of the first data is completed, release the first data, and acquire a storage resource block for which the first data has been released, where the storage resource block includes first address information.

A resource processing method provided by an embodiment of the present invention is applicable to a scenario where allocated resource blocks are reclaimed to a memory.

In the embodiment of the present invention, when the terminal completes the transmission of the first data, the terminal will release the storage resource block storing the relevant information of the first data. At this time, the memory acquires the storage resource block and recycles the storage resource block to the specified address of the free resource block linked list.

In the embodiment of the present invention, the data structure of the allocated resource block is as shown in Figure 4, and consists of two parts, LEN and Addr, wherein, LEN is used to indicate the actual length of the allocated space, and the value of LEN is the value of Next Addr and Space The sum of the values, Addr is used to record the starting address of the allocated resource block.

S202. Traverse the idle resource blocks according to the first address information and preset determination conditions, and determine a fourth idle resource block adjacent to the storage resource block.

After the memory reclaims the storage resource block to the free resource block linked list, the memory will search for the free resource block adjacent to the storage resource block in the free resource block linked list to determine whether the storage resource block can be combined with the adjacent free resource block. The blocks are merged.

In the embodiment of the present invention, the storage resource block includes the first address information represented by the Addr field and the third space length represented by the LEN field.

In the embodiment of the present invention, the memory reads the LEN field and the Addr field of the storage resource block, and then sequentially reads the Next Addr field in the free resource block linked list, when the Next Addr of the fifth free resource block in the free resource block linked list is greater than the value of Addr value, and the value difference between Next Addr and Addr of the fifth free resource block is the smallest, determine that the fifth free resource block is the free resource block right adjacent to the storage resource block; when the sixth free resource in the free resource block linked list When the Next Addr of the block is less than the value of Addr, and the difference between the value of Next Addr and Addr of the sixth idle resource block is the smallest, determine that the sixth idle resource block is an idle resource block left adjacent to the storage resource block.

In the embodiment of the present invention, after the storage resource block is inserted into the free block linked list of the memory, the value of the NextAddr field of the storage resource block is the value of the Next Addr field of the sixth free resource block, and the value of the Next Addr field of the sixth free resource block is Stores the value of the Addr field of the resource block.

In the embodiment of the present invention, when the memory traverses to the last free resource block and does not find a free resource block greater than Addr, it indicates that the storage resource block is the last free resource block in the free resource block linked list. At this time, the Next of the storage resource block The value of Addr is Null, and the value of Next Addr of the last free resource block is the value of Addr of the storage resource block.

Exemplarily, as shown in Figure 9, there are two free resource blocks L1 and L3 in the free resource block linked list, and now the L2 resource block should be reclaimed to an address between L1 and L3, after reclaiming, the Next Addr of the L2 resource block The value of is the value of the Next Addr of the L1 idle resource block, and the value of the Next Addr of the L1 idle resource block is changed to the value of the Addr of the L2 resource block.

S203. Determine the storage resource block and the fourth idle resource block according to the first address information and the second address information, the fourth idle resource block is an idle resource block adjacent to the storage resource block among the idle resource blocks, and the second address information is the address information of the fourth free resource block.

When the storage resource block finds its adjacent free resource block in the free resource block linked list, it is necessary to judge whether the storage resource block is continuous with its adjacent free resource block.

In the embodiment of the present invention, after the memory determines the fifth free resource block adjacent to the right of the storage resource block and the sixth free resource block adjacent to the left of the storage resource block, respectively, the Addr field and the LEN field of the storage resource block are respectively obtained value of , the values of the Next Addr field and the LEN field of the fifth free resource block and the sixth free resource block.

In the embodiment of the present invention, the memory determines whether the storage resource block is continuous with the fifth free resource block by comparing the sum of the Addr field and the LEN field value of the storage resource block with the value of Next Addr of the sixth free resource block; The Addr field of the resource block, the value of the Next Addr pointing to the address of the sixth free resource block, and the value of the LEN field of the sixth free resource block determine whether the storage resource block is continuous with the sixth free resource block.

S204. When it is determined that the fourth idle resource block is continuous with the storage resource block, combine the fourth idle resource block and the storage resource block into a new fourth idle resource block.

The memory compares the first address information with the second address information, and determines whether to combine the storage resource block and the fourth free resource block into a new fourth free resource block according to the comparison result.

In the embodiment of the present invention, when the sum of the Addr field and the LEN field value of the storage resource block is continuous with the Next Addr value of the sixth free resource block, it indicates that the fifth free resource block is continuous with the storage resource block, and at this time, the storage The value of the LEN field of the resource block is changed to the sum of the LEN value of the storage resource block and the LEN value of the fifth free resource block, the value of the Next Addr field of the storage resource block is changed to the Next Addr value of the fifth free resource block, and The value of the NextAddr field of the six free resource blocks is changed to the Addr value of the storage resource block; when the sum of the Addr field and the LEN field value of the storage resource block is not continuous with the value of the Next Addr of the sixth free resource block, it represents the fifth free resource block The resource block is not continuous with the storage resource block. At this time, the value of the Addr field of the storage resource block is used as the value of the Next Addr field of the new sixth free resource block, and the value of the Next Addr field of the sixth free resource block is used as the value of the storage resource block. The value of the Next Addr of the resource block.

Exemplarily, as shown in FIG. 10 , there are two free resource blocks L1 and L3 in the free resource block linked list and L2 storage resource blocks, wherein L2 is between L1 and L3 and L2 and L3 are continuous. At this time, L2 and L3 is merged into L2', the length of the allocated space of the merged idle resource block L2' is L2+L3, the Next Addr value of L2' is the Next Addr value of L3, and the Next Addr value of the LI idle resource block is L2 Addr value.

In the embodiment of the present invention, when the Addr field of the storage resource block is continuous with the value of the Next Addr pointing to the sixth free resource block and the value of the LEN field of the sixth free resource block, it indicates that the sixth free resource block and the storage resource block Continuously, at this time, change the value of the LEN field of the sixth free resource block to the sum of the LEN value of the storage resource block and the LEN value of the sixth free resource block; when the Addr field of the storage resource block points to the sixth free resource block When the value of the Next Addr and the value of the LEN field of the sixth free resource block are discontinuous, it indicates that the sixth free resource block is not continuous with the storage resource block. At this time, the value of the Addr field of the storage resource block is used as the new For the value of the Next Addr field of the sixth free resource block, the value of the Next Addr field of the sixth free resource block is used as the value of the Next Addr of the stored resource block.

Exemplarily, as shown in Figure 11, there are two free resource blocks L1 and L2 and L storage resource blocks in the free resource block linked list, where L is after L2 and L2 and L are continuous, at this time, L2 and L are combined into L2', the length of the allocated space of the combined idle resource block L2' is L2+L.

It can be understood that when the allocated resource blocks are recycled to the free resource block linked list, the free resource blocks adjacent to the allocated resource blocks are merged into a new free resource block, which can reduce space fragmentation and reduce resources. waste.

It should be noted that a resource processing method suitable for reclaiming allocated resource blocks to memory provided by the embodiment of the present invention may also be used independently.

Embodiment Three

An embodiment of the present invention provides a resource processing method, as shown in FIG. 12 , the method may include:

S301. When the terminal transmits the first data, the memory acquires a first space length of the first data.

A resource processing method provided by an embodiment of the present invention is applicable to a scenario in which idle resources in a memory are allocated.

In the embodiment of the present invention, when the terminal transmits the first data, the terminal operating system needs to call idle resources in the memory to store the first data, and at this time, the memory obtains the first space length required by the first data.

In the embodiment of the present invention, the free resource blocks in the memory are stored in the form of a free block linked list, as shown in Figure 3, each free resource block is composed of three parts, namely LEN, Next Addr and Space, wherein , LEN represents the length of the available space of the free resource block, the value of LEN is the sum of the values of Next Addr and Space, Next Addr represents the starting address of the next free resource block, and when the free resource block is the last For a free resource block, the value is NULL, and Space indicates the length that the free resource block can actually allocate.

In the embodiment of the present invention, the length occupied by LEN and Next Addr can be set according to the memory size.

Exemplarily, when the length sum occupied by LEN and Next Addr is set to 2 bytes, a 64K free resource block can be managed; when the length sum occupied by LEN and Next Addr is set to 4 bytes, it can Manage free resource blocks of 4G size.

S302. The memory compares the first space length with a preset space length.

After the memory acquires the first space length of the first data, it is necessary to determine whether the first space length is smaller than the minimum length set by the memory.

In the embodiment of the present invention, a preset space length is set in the memory. When the memory acquires that the terminal needs to occupy the first space, the memory compares the first space length with the preset space length to determine whether the first space length is greater than or equal to the preset space length. Set the length of the space.

S303. When the first space length is less than the preset space length, the memory traverses the free resource blocks from the initial free resource block.

When the first space length is less than the preset space length, it means that the space length applied by the terminal to the memory does not meet the minimum application standard of the memory. At this time, the memory will be allocated to the terminal with a preset space length, and the preset space length is the memory allocation space length minimum standard.

In the embodiment of the present invention, when the first space length requested by the terminal is less than the minimum standard set by the memory, the memory traverses the free resource block linked list according to the minimum standard preset space length of the allocated space length, and determines a suitable free resource block to be allocated. .

S304. The memory compares the preset space length with the second space length of the current free resource block, where the current free resource block is one of the free resource blocks.

The memory determines the first free resource block to be allocated according to the preset space length and the second space length of each free resource block in the free resource block linked list.

In the embodiment of the present invention, the memory sequentially compares the length of the preset space block with the second space length of the current free resource block in the free resource block linked list, so as to determine a suitable free resource block to be allocated.

S305. The memory determines that the current idle resource block whose second space length is greater than the preset space length is the first idle resource block.

When the second space length is greater than the preset space length, the memory uses the current free resource block corresponding to the second space length as the first free resource block for the memory to allocate storage space to the terminal.

In the embodiment of the present invention, when the second space length is greater than the preset space length, it indicates that the current idle resource block corresponding to the second space length meets the requirements of the idle resource block to be allocated. At this time, the current idle resource block to be allocated will meet the The idle resource block is determined as the first idle resource block for the memory to allocate storage space from the first idle resource block.

It can be understood that by comparing the first space length with the preset space length set by the memory, it is avoided that the space length applied for memory allocation is smaller than the preset space length set by the memory, which can effectively avoid the generation of space fragments.

S306. When the first free resource block is not determined after traversing the memory until the end of the free resource block, end the process of comparing the preset space length with the second space length of the current free resource block and return the determination failure instruction.

When the first free resource block is not determined after memory traversal to the end of the free resource block, it means that there is no free resource block larger than the preset space length in the free resource block linked list, and the process of allocating storage space to the terminal cannot be performed, and it needs to end at this time The process returns a confirm failure command.

In the embodiment of the present invention, the memory starts from the space length of the initial free resource block of the free resource block linked list and compares it with the preset space length sequentially. length, it indicates that there is no free resource block larger than the preset space length in the free resource block linked list. At this point, the process of comparing the preset space length with the second space length of the current free resource block is ended and the determination failure instruction is returned.

S307. When the sum of the two preset space lengths is greater than the length of the first free resource block, the memory determines the first free resource block as a resource block for storing the first data.

When the memory determines the first free resource block to be allocated, the first free resource block is separated according to the allocated space length determined by the memory, and the separated space resource block to be allocated is allocated to the first data storage resource .

In the embodiment of the present invention, the memory needs to determine whether the remaining length of the first idle resource block is greater than the preset space length except for the preset space length.

In the embodiment of the present invention, when the sum of the two preset space lengths is greater than the length of the first free resource block, it indicates that the remaining length of the first free resource block other than the preset space length is less than the preset space length. At this time, the memory Allocating the entire first free resource block to the first data for resource storage.

Exemplarily, as shown in FIG. 6, there are three free resource blocks L1, L2, and L3 in the memory, which are stored in the form of a linked list. When the memory allocates all the free resource blocks of L2 to the first data for storage operations, L2 The value of Next Addr in the free resource block is changed to the value of Next Addr in the L3 free resource block, the value of Next Addr in the L1 free resource block is changed to the value of Next Addr in the L2 free resource block, and the L2 free resource block assigned to the first data.

S308. When the sum of the two preset space lengths is less than or equal to the length of the first free resource block, the memory determines a resource block to be allocated whose length is the preset space length from the first free resource block, and the resource block to be allocated is the first A data storage resource block.

When the memory determines the first free resource block to be allocated, the first free resource block is separated according to the allocated space length determined by the memory, and the separated space resource block to be allocated is allocated to the first data storage resource .

In the embodiment of the present invention, when the sum of the two preset space lengths is less than the length of the first free resource block, it indicates that the remaining length of the first free resource block other than the preset space length is greater than the preset space length. At this time, the memory The first idle resource block is intercepted from the tail and the idle resource block with a preset space length is allocated to the first data for data storage.

In the embodiment of the present invention, the data structure of the allocated resource block is as shown in Figure 4, and consists of two parts, LEN and Addr, wherein, LEN is used to indicate the actual length of the allocated space, and the value of LEN is the value of Next Addr and Space The sum of the values, Addr is used to record the starting address of the allocated resource block.

In the embodiment of the present invention, the first idle resource block intercepts an idle resource block with a specified space length from the tail. As shown in FIG. 5, the idle resource block is composed of LEN1, Next Addr and Space before allocation. When a resource with a length of 64K is allocated in the free resource block, 64K is intercepted from the end of Space as the allocated resource, and 2 bytes are allocated before the allocated resource to store the LEN2 and Addr of the resource. At this time, the value of LEN1 of the free resource block is changed to LEN1', where the value of LEN1' is the difference between the value of LEN1 and 64k.

Exemplarily, as shown in FIG. 7, there are two free resource blocks L1 and L2 in the memory, which are stored in the form of a linked list. When the memory allocates part of the free resource blocks in the L2 free resource blocks to the first data storage operation , the L2 idle resource block intercepts the specified idle resource block L3 determined according to the first data from the end, and adds the L3 and Addr fields representing the length and address of the L3 resource block before the L3 resource block. At this time, the L2 idle resource block represents The L2 value of the assignable length is changed to L2', where the value of L2' is the difference between the L2 value and the L3 value.

It should be noted that S307 and S308 are two parallel steps, and the corresponding steps are specifically performed according to the comparison result of the sum of the two preset lengths and the space length of the first free resource block, which will not be described in detail in this embodiment of the present invention. limited.

S309. When the first space length is greater than or equal to the preset space length, the memory traverses the free resource blocks according to the first space length to determine the first free resource block, and the first free resource block is greater than or equal to the first space length.

When the first space length is greater than the preset space length, it means that the space length applied by the terminal to the memory has reached the minimum application standard of the memory. At this time, the memory will be allocated to the terminal for the first space length, and the preset space length is the memory allocation space length minimum standard.

In the embodiment of the present invention, when the first space length requested by the terminal is greater than the minimum standard set by the memory, the memory traverses the free resource block linked list according to the first space length, and sequentially combines the first space length with the second space in the free resource block linked list. Space lengths are compared, when the second space length is greater than the first space length, the current free resource block corresponding to the second space length is determined as the first free resource block, so that the memory can allocate storage space from the first free resource block to terminal.

It should be noted that S303 and S309 are two parallel steps after S302, which are specifically executed according to the determination conditions, and are not specifically limited in this embodiment of the present invention.

S310. When the sum of the first space length and the preset space length is greater than the length of the first free resource block, the memory determines that the first free resource block is a resource block for storing the first data.

When the memory determines the first free resource block to be allocated, the first free resource block is separated according to the allocated space length determined by the memory, and the separated space resource block to be allocated is allocated to the first data storage resource .

In the embodiment of the present invention, the memory needs to judge whether the remaining length of the first idle resource block is greater than the preset space length except for the first space length.

In the embodiment of the present invention, when the sum of the preset space length and the first space length is greater than the length of the first free resource block, it means that the remaining length of the first free resource block other than the first space length is less than the preset space length. , the memory allocates the entire first free resource block to the first data for resource storage.

S311. When the sum of the first space length and the preset space length is less than or equal to the length of the first free resource block, the memory determines resource blocks to be allocated whose length is the preset space length from the first free resource block, and resources to be allocated The block is a storage resource block of the first data.

When the memory determines the first free resource block to be allocated, the first free resource block is separated according to the allocated space length determined by the memory, and the separated space resource block to be allocated is allocated to the first data storage resource .

In the embodiment of the present invention, when the sum of the preset space length and the first space length is less than the length of the first free resource block, it indicates that the remaining length of the first free resource block other than the first space length is greater than the preset space length. , the memory intercepts the idle resource block of the first space length from the end of the first idle resource block and allocates it to the first data for data storage.

In the embodiment of the present invention, the memory starts from the end address of the first free resource block, reads the second free resource block whose length is the first space length, the second free resource block belongs to the first free resource block, and reads The second idle resource block is determined as the resource block to be allocated.

It should be noted that S310 and S311 are two parallel steps, and the corresponding steps are specifically executed according to the comparison result of the sum of the preset length, the first space length, and the second space length, which is not specifically limited in this embodiment of the present invention. .

It can be understood that when allocating the free resource blocks to the first data, it is ensured that the allocated first free resource blocks and the remaining free resource blocks are not less than the minimum value preset by the memory, thus reducing resource allocation. Smaller space resource blocks are generated, resulting in the impossibility of subsequent resource allocation, which can reduce space debris and waste of resources.

Embodiment four

Based on the third embodiment, as shown in FIG. 13 , the embodiment of the present invention also provides a resource recycling method. After step S309, the specific steps include:

S401. When the terminal finishes transmitting the first data, the memory releases the first data, and acquires a storage resource block that has released the first data, where the storage resource block includes first address information.

A resource processing method provided by an embodiment of the present invention is applicable to a scenario where allocated resource blocks are reclaimed to a memory.

In the embodiment of the present invention, when the terminal completes the transmission of the first data, the terminal will release the storage resource block storing the relevant information of the first data. At this time, the memory acquires the storage resource block and recycles the storage resource block to the specified address of the free resource block linked list.

In the embodiment of the present invention, the data structure of the allocated resource block is as shown in Figure 4, and consists of two parts, LEN and Addr, wherein, LEN is used to indicate the actual length of the allocated space, and the value of LEN is the value of Next Addr and Space The sum of the values, Addr is used to record the starting address of the allocated resource block.

S402. The memory traverses the free resource blocks from the initial free resource block.

After the memory acquires the first address information of the storage resource block, it needs to determine the free resource block adjacent to the storage resource block in the free resource block linked list.

In the embodiment of the present invention, the memory searches for an idle resource block adjacent to the storage resource block from the initial idle resource block of the idle resource block linked list.

S403. The memory compares the first address information with the second address information of the current free resource block.

The memory determines the free resource block adjacent to the storage resource block by comparing the first address information with the second address information of the current free resource block in the free resource block linked list.

In the embodiment of the present invention, the storage resource block includes the first address information represented by the Addr field and the third space length represented by the LEN field.

In the embodiment of the present invention, the memory reads the LEN field and the Addr field of the storage resource block, and then compares them with the Next Addr field in the free resource block linked list in sequence.

S404. When the memory determines that the second address information is greater than the first address information, and the difference between the second address information and the first address information is the smallest, determine the current free resource block as the fifth free resource block, and the fifth free resource block is the same as A fourth idle resource block adjacent to the right of the storage resource block is stored, and the fourth idle resource block is an idle resource block adjacent to the storage resource block among the idle resource blocks.

The memory determines a fifth free resource block right adjacent to the storage resource block according to the relationship between the first address information and the second address information.

In the embodiment of the present invention, when the value of Next Addr of the fifth idle resource block is greater than the value of Addr, and the difference between the values of Next Addr and Addr of the fifth idle resource block is the smallest, it is determined that the fifth idle resource block is the same as the storage resource Free resource blocks adjacent to the right of the block.

S405. When the memory determines that the second address information is smaller than the first address information, and the difference between the second address information and the first address information is the smallest, determine the current free resource block as the sixth free resource block, and the sixth free resource block is the same as The fourth free resource block adjacent to the left of the resource block is stored.

The memory determines a fifth free resource block right adjacent to the storage resource block according to the relationship between the first address information and the second address information.

In the embodiment of the present invention, when the Next Addr of the sixth idle resource block in the idle resource block linked list is less than the value of Addr, and the difference between the values of Next Addr and Addr of the sixth idle resource block is the smallest, determine the sixth idle resource block is the free resource block left adjacent to the storage resource block.

In the embodiment of the present invention, after the storage resource block is inserted into the free block linked list of the memory, the value of the NextAddr field of the storage resource block is the value of the Next Addr field of the sixth free resource block, and the value of the Next Addr field of the sixth free resource block is Stores the value of the Addr field of the resource block.

Exemplarily, as shown in Figure 9, there are two free resource blocks L1 and L3 in the free resource block linked list, and now the L2 resource block should be reclaimed to an address between L1 and L3, after reclaiming, the Next Addr of the L2 resource block The value of is the value of the Next Addr of the L1 idle resource block, and the value of the Next Addr of the L1 idle resource block is changed to the value of the Addr of the L2 resource block.

It should be noted that S404 and S405 are two parallel steps after S403, and specific corresponding steps are executed according to the determination conditions, which are not specifically limited in this embodiment of the present invention.

S406. When the current free resource block is a terminated free resource block, and the second address information is smaller than the first address information, the memory ends the process of traversing the free resource block.

When the terminal free resource block of the free resource block linked list is compared and no second address information greater than the first address information is found, the memory traverses the free resource block linked list.

In the embodiment of the present invention, when the memory traverses to the last free resource block and does not find a free resource block greater than Addr, it indicates that the storage resource block is the last free resource block in the free resource block linked list. At this time, the Next of the storage resource block The value of Addr is Null, and the value of Next Addr of the last free resource block is the value of Addr of the storage resource block.

S407. The memory determines the storage resource block and the fourth free resource block according to the first address information and the second address information, where the second address information is address information of the fourth free resource block.

The memory compares the first address information with the second address information, and determines whether the storage resource block is continuous with the fifth free resource block and the sixth free resource block.

In the embodiment of the present invention, the memory judges whether the storage resource block is continuous with the fifth free resource block by judging the sum of the Addr field and the LEN field value of the storage resource block and the Next Addr value of the sixth free resource block, and the memory judges whether the storage resource block is continuous with the fifth free resource block. The sum of the Addr field of the resource block, the value of Next Addr pointing to the sixth free resource block and the value of the LEN field of the sixth free resource block is used to determine whether the storage resource block and the sixth free resource block are continuous.

S408. When the memory determines that the fourth free resource block is continuous with the storage resource block, combine the fourth free resource block and the storage resource block into a new fourth free resource block.

The memory compares the first address information with the second address information, and determines whether to combine the storage resource block and the fourth free resource block into a new fourth free resource block according to the comparison result.

In the embodiment of the present invention, when the storage resource block is continuous with the fifth idle resource block, the space length of the fifth idle resource block and the third space length are combined into a new space length of the fifth idle resource block, and the first address The information is used as the address information of the next free resource block pointed to by the first pointer, and the address information of the next free resource block pointed to by the second pointer is used as the address information of the next free resource block pointed to by the new third pointer, and the first pointer The address information of the next free resource block pointed to is the pointer information corresponding to the sixth free resource block, the address information of the next free resource block pointed to by the second pointer is the pointer information corresponding to the storage resource block, and the next The address information of the idle resource block is pointer information corresponding to the fifth idle resource block.

In the embodiment of the present invention, when the storage resource block is continuous with the sixth free resource block, the space length of the sixth free resource block and the second space length are combined into a new space length of the sixth free resource block.

In the embodiment of the present invention, when the sum of the Addr field and the LEN field value of the storage resource block is continuous with the Next Addr value of the sixth free resource block, it indicates that the fifth free resource block is continuous with the storage resource block, and at this time, the storage The value of the LEN field of the resource block is changed to the sum of the LEN value of the storage resource block and the LEN value of the fifth free resource block, the value of the Next Addr field of the storage resource block is changed to the Next Addr value of the fifth free resource block, and The value of the NextAddr field of the six free resource blocks is changed to the Addr value of the storage resource block; when the sum of the Addr field and the LEN field value of the storage resource block is not continuous with the value of the Next Addr of the sixth free resource block, it represents the fifth free resource block The resource block is not continuous with the storage resource block. At this time, the value of the Addr field of the storage resource block is used as the value of the Next Addr field of the new sixth free resource block, and the value of the Next Addr field of the sixth free resource block is used as the value of the storage resource block. The value of the Next Addr of the resource block.

Exemplarily, as shown in FIG. 10 , there are two free resource blocks L1 and L3 in the free resource block linked list and L2 storage resource blocks, wherein L2 is between L1 and L3 and L2 and L3 are continuous. At this time, L2 and L3 is merged into L2', the length of the allocated space of the merged idle resource block L2' is L2+L3, the Next Addr value of L2' is the Next Addr value of L3, and the Next Addr value of the LI idle resource block is L2 Addr value.

In the embodiment of the present invention, when the Addr field of the storage resource block is continuous with the value of the Next Addr pointing to the sixth free resource block and the value of the LEN field of the sixth free resource block, it indicates that the sixth free resource block and the storage resource block Continuously, at this time, change the value of the LEN field of the sixth free resource block to the sum of the LEN value of the storage resource block and the LEN value of the sixth free resource block; when the Addr field of the storage resource block points to the sixth free resource block When the value of the Next Addr and the value of the LEN field of the sixth free resource block are discontinuous, it indicates that the sixth free resource block is not continuous with the storage resource block. At this time, the value of the Addr field of the storage resource block is used as the new For the value of the Next Addr field of the sixth free resource block, the value of the Next Addr field of the sixth free resource block is used as the value of the Next Addr of the stored resource block.

Exemplarily, as shown in Figure 11, there are two free resource blocks L1 and L2 and L storage resource blocks in the free resource block linked list, where L is after L2 and L2 and L are continuous, at this time, L2 and L are combined into L2', the length of the allocated space of the combined idle resource block L2' is L2+L.

Further, when the memory determines that the storage of the free resource block is not continuous with the fifth free resource block and the sixth free resource block, the first address information is used as the address information of the next free resource block pointed to by the first pointer, and the first The address information of the next free resource block pointed to by the pointer is used as the address information of the next free resource block pointed to by the third pointer.

It should be noted that a resource processing method suitable for reclaiming allocated resource blocks to memory provided by the embodiment of the present invention may also be used independently.

It can be understood that when the memory allocates idle resources, a minimum value is set, so that the length of the allocated idle resources and the length of the remaining idle resources are not less than the minimum value, avoiding the generation of fragments with too small lengths, and reducing space fragmentation. Reduce waste of resources.

Embodiment five

As shown in Figure 14, the embodiment of the present invention provides a terminal 1, which may include:

The acquiring unit 10 is configured to acquire a first space length of the first data when transmitting the first data.

A comparing unit 11, configured to compare the first space length with a preset space length.

The determining unit 12 is configured to traverse the idle resource blocks according to the preset space length when the first space length is less than the preset space length, and determine a first idle resource block, and the first idle resource block is greater than or equal to The preset space length.

The allocating unit 13 is configured to allocate storage resources to the first data by using the first free resource block.

Optionally, the determining unit 12 is further configured to traverse the free resource blocks according to the first space length to determine the first free resource block when the first space length is greater than or equal to the preset space length. A resource block, the first idle resource block is greater than or equal to the first space length.

Optionally, the determining unit 12 is further configured to determine that the first idle resource block is the first idle resource block when the sum of the two preset space lengths is greater than the length of the first idle resource block. A data storage resource block; when the sum of the two preset space lengths is less than or equal to the length of the first free resource block, determine from the first free resource block the length of the preset space length A resource block to be allocated is a resource block for storing the first data.

Optionally, the determining unit 12 is further configured to determine the first idle resource block when the sum of the first space length and the preset space length is greater than the length of the first idle resource block storage resource block for the first data; when the sum of the first space length and the preset space length is less than or equal to the length of the first free resource block, select from the first free resource block Determine a resource block to be allocated whose length is the first space length, and the resource block to be allocated is a resource block for storing the first data.

Optionally, as shown in FIG. 15 based on FIG. 14 , the terminal 1 further includes: a reading unit 14 .

The reading unit 14 is configured to, in the first free resource block, start from the termination address of the first free resource block, and read a second free resource block whose length is the preset space length, so The second idle resource block belongs to the first idle resource block.

The determining unit 12 is further configured to determine the second idle resource block as the resource block to be allocated.

Optionally, the reading unit 14 is further configured to, in the first free resource block, start from the end address of the first free resource block, and read the third resource block whose length is the first space length. An idle resource block, the third idle resource block belongs to the first idle resource block.

The determining unit 12 is further configured to determine the third idle resource block as the resource block to be allocated.

Optionally, as shown in FIG. 16 based on FIG. 14 , the terminal 1 further includes: a traversing unit 15 and a comparing unit 16 .

The traversing unit 15 is configured to start traversing the idle resource block from the initial idle resource block.

The comparing unit 16 is configured to compare the preset space length with a second space length of a current free resource block, where the current free resource block is one of the free resource blocks.

The determining unit 12 is specifically configured to determine that the current idle resource block whose second space length is greater than the preset space length is the first idle resource block.

Optionally, as shown in FIG. 17 based on FIG. 16 , the terminal 1 further includes: an end unit 17 .

The end unit 17 is configured to end the comparison between the preset space length and the second space length of the current free resource block when the first free resource block is not determined after traversing to the end of the free resource block. The flow of the comparison and returns the OK failure instruction.

Optionally, as shown in FIG. 18 based on FIG. 14 , the terminal 1 further includes: a determining unit 18 and a combining unit 19 .

The obtaining unit 10 is further configured to release the first data when the transmission of the first data is completed, and obtain a storage resource block that has released the first data, and the storage resource block includes first address information .

The determining unit 12 is further configured to traverse the free resource blocks according to the first address information and preset determination conditions, and determine a fourth free resource block adjacent to the storage resource block.

The determination unit 18 is configured to determine the storage resource block and the fourth idle resource block according to the first address information and the second address information, and the fourth idle resource block is the idle resource block In the idle resource block adjacent to the storage resource block, the second address information is the address information of the fourth idle resource block.

The combining unit 19 is configured to combine the fourth idle resource block and the storage resource block into a new fourth idle resource when it is determined that the fourth idle resource block is continuous with the storage resource block piece.

Optionally, the traversing unit 15 is further configured to start traversing the idle resource block from the initial idle resource block.

The comparing unit 16 also compares the first address information with the second address information of the current idle resource block.

The determining unit 12 is further configured to determine the current idle resource block when it is determined that the second address information is greater than the first address information and the difference between the second address information and the first address information is the smallest. is the fifth idle resource block, the fifth idle resource block is the fourth idle resource block right adjacent to the storage resource block; when it is determined that the second address information is smaller than the first address information, and When the difference between the second address information and the first address information is the smallest, determine the current idle resource block as the sixth idle resource block, and the sixth idle resource block is all left adjacent to the storage resource block The fourth free resource block.

Optionally, the ending unit 17 is configured to end the process of traversing the idle resource block when the current idle resource block is a terminated idle resource block and the second address information is smaller than the first address information .

Optionally, the combining unit 19 is specifically configured to combine the space length of the fifth free resource block and the third space length into The space length of the new fifth free resource block, using the first address information as the address information of the next free resource block pointed to by the first pointer, and using the address information of the next free resource block pointed to by the second pointer as the new The address information of the next free resource block pointed to by the third pointer, the address information of the next free resource block pointed to by the first pointer is the pointer information corresponding to the sixth free resource block, and the next free resource block pointed to by the second pointer The address information of a free resource block is the pointer information corresponding to the storage resource block, and the address information of the next free resource block pointed to by the third pointer is the pointer information corresponding to the fifth free resource block; when the storage When the resource block is continuous with the sixth idle resource block, combining the space length of the sixth idle resource block and the second space length into a new space length of the sixth idle resource block.

Optionally, as shown in FIG. 19 based on FIG. 18 , the terminal 1 further includes: an updating unit 110 .

The updating unit 111 is configured to use the first address information as the first pointer when it is determined that the stored free resource block is not continuous with the fifth free resource block and the sixth free resource block The address information of the next free resource block pointed to by the first pointer is used as the address information of the next free resource block pointed to by the third pointer.

As shown in Figure 20, in practical applications, the above acquisition unit 10, comparison unit 11, determination unit 12, allocation unit 13, reading unit 14, traversal unit 15, comparison unit 16, end unit 17, determination unit 18, merge Both the unit 19 and the update unit 110 can be realized by a processor 111 located on the server 1, which can be a central processing unit (CPU), a microprocessor (MPU), a digital signal processor (DSP) or a field programmable gate array (FPGA) etc., the server may also include a memory 112, which may be connected to the processor 111, wherein the memory 112 is used to store executable program codes, the program codes include computer operation instructions, and the memory 112 may include a high-speed RAM memory , and may also include non-volatile memory, eg, at least one disk memory.

Those skilled in the art should understand that the embodiments of the present invention may be provided as methods, systems, or computer program products. Accordingly, the present invention can take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It should be understood that each procedure and/or block in the flowchart and/or block diagram, and a combination of procedures and/or blocks in the flowchart and/or block diagram can be realized by computer program instructions. These computer program instructions may be provided to a general purpose computer, special purpose computer, embedded processor, or processor of other programmable data processing equipment to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing equipment produce a An apparatus for realizing the functions specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to operate in a specific manner, such that the instructions stored in the computer-readable memory produce an article of manufacture comprising instruction means, the instructions The device realizes the function specified in one or more procedures of the flowchart and/or one or more blocks of the block diagram.

These computer program instructions can also be loaded onto a computer or other programmable data processing device, causing a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby The instructions provide steps for implementing the functions specified in the flow chart or blocks of the flowchart and/or the block or blocks of the block diagrams.

The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the protection scope of the present invention.

Claims (26)

1. A resource processing method, characterized in that the method comprises: When transmitting the first data, acquire the first space length of the first data; comparing the first space length with a preset space length; When the first space length is less than the preset space length, traverse the free resource blocks according to the preset space length to determine a first free resource block, and the first free resource block is greater than or equal to the preset space length ; Allocating storage resources to the first data by using the first idle resource block. 2. The method according to claim 1, wherein after the comparison between the first space length and the preset space length, the use of the first idle resource block for the first Before allocating data storage resources, the method also includes: When the first space length is greater than or equal to the preset space length, traverse the idle resource blocks according to the first space length to determine the first idle resource block, and the first idle resource block is greater than or equal to the preset space length the first space length. 3. The method according to claim 1, wherein the allocating storage resources to the first data by using the first free resource block comprises: When the sum of the two preset space lengths is greater than the length of the first free resource block, determine that the first free resource block is a storage resource block for the first data; When the sum of the two preset space lengths is less than or equal to the length of the first free resource block, determine a resource block to be allocated whose length is the preset space length from the first free resource block, and The resource block to be allocated is a resource block for storing the first data. 4. The method according to claim 2, wherein the allocating storage resources to the first data by using the first free resource block comprises: When the sum of the first space length and the preset space length is greater than the length of the first free resource block, determine that the first free resource block is a storage resource block for the first data; When the sum of the first space length and the preset space length is less than or equal to the length of the first free resource block, determine from the first free resource block a waiting space whose length is the first space length Allocating a resource block, where the resource block to be allocated is a storage resource block for the first data. 5. The method according to claim 3, wherein the determining the resource block to be allocated whose length is the preset space length from the first free resource block comprises: In the first free resource block, starting from the end address of the first free resource block, read a second free resource block whose length is the preset space length, and the second free resource block belongs to the the first free resource block; Determining the second idle resource block as the resource block to be allocated. 6. The method according to claim 4, wherein the determining the resource block to be allocated whose length is the first space length from the first free resource block comprises: In the first free resource block, starting from the end address of the first free resource block, read a third free resource block whose length is the first space length, and the third free resource block belongs to the the first free resource block; Determining the third idle resource block as the resource block to be allocated. 7. The method according to claim 1, wherein traversing the idle resource blocks according to the preset space length to determine the first idle resource block comprises: traversing the free resource blocks from the initial free resource block; comparing the preset space length with a second space length of a current free resource block, where the current free resource block is one of the free resource blocks; Until it is determined that the current idle resource block whose second space length is greater than the preset space length is the first idle resource block. 8. The method according to claim 7, wherein after comparing the preset space length with the second space length of the current idle resource block, the method further comprises: When traversing to the end of the free resource block does not determine the first free resource block, end the process of comparing the preset space length with the second space length of the current free resource block and return the determination failure instruction . 9. The method according to any one of claims 1-8, characterized in that, after allocating storage resources to the first data by using the first free resource block, the method further comprises: When the transmission of the first data is completed, releasing the first data, and obtaining a storage resource block after releasing the first data, the storage resource block includes first address information; Traverse the idle resource blocks according to the first address information and preset determination conditions, and determine a fourth idle resource block adjacent to the storage resource block; Determine the storage resource block and the fourth idle resource block according to the first address information and the second address information, and the fourth idle resource block is one of the idle resource blocks corresponding to the storage resource block. Adjacent idle resource blocks, the second address information is address information of the fourth idle resource block; When it is determined that the fourth idle resource block is continuous with the storage resource block, combining the fourth idle resource block and the storage resource block into a new fourth idle resource block. 10. The method according to claim 9, characterized in that, according to the first address information and preset determination conditions, traversing the free resource blocks to determine a fourth free resource block adjacent to the storage resource block Resource blocks, including: traversing the free resource blocks from the initial free resource block; comparing the first address information with the second address information of the current free resource block; When it is determined that the second address information is greater than the first address information, and the difference between the second address information and the first address information is the smallest, determine the current idle resource block as the fifth idle resource block, the The fifth idle resource block is the fourth idle resource block right adjacent to the storage resource block; When it is determined that the second address information is smaller than the first address information, and the difference between the second address information and the first address information is the smallest, determine the current idle resource block as the sixth idle resource block, the The sixth idle resource block is the fourth idle resource block left adjacent to the storage resource block. 11. The method according to claim 10, characterized in that traversing the free resource blocks according to the first address information and preset determination conditions, and determining a fourth free resource block adjacent to the storage resource block After the resource block, the method further includes: When the current idle resource block is a terminated idle resource block and the second address information is smaller than the first address information, the process of traversing the idle resource block ends. 12. The method according to claim 10, wherein the storage resource block includes a third space length, and when the fourth free resource block is continuous with the storage resource block, the fourth The idle resource block and the storage resource block are merged into a new fourth idle resource block, including: When the storage resource block is continuous with the fifth idle resource block, combining the space length of the fifth idle resource block and the third space length into a new space length of the fifth idle resource block, and combining the space length of the fifth idle resource block The first address information is used as the address information of the next free resource block pointed to by the first pointer, and the address information of the next free resource block pointed to by the second pointer is used as the address information of the next free resource block pointed to by the new third pointer The address information of the next free resource block pointed to by the first pointer is the pointer information corresponding to the sixth free resource block, and the address information of the next free resource block pointed to by the second pointer is the storage resource block Corresponding pointer information, where the address information of the next free resource block pointed to by the third pointer is the pointer information corresponding to the fifth free resource block; When the storage resource block is continuous with the sixth free resource block, combining the space length of the sixth free resource block and the second space length into a new space length of the sixth free resource block. 13. The method according to claim 12, characterized in that, after determining the storage resource block and the fourth idle resource block according to the first address information and the second address information, the method Also includes: When it is determined that the stored free resource block is not continuous with the fifth free resource block and the sixth free resource block, using the first address information as the address of the next free resource block pointed to by the first pointer Address information, using the address information of the next free resource block pointed to by the first pointer as the address information of the next free resource block pointed to by the third pointer. 14. A terminal, characterized in that the terminal comprises: an acquiring unit, configured to acquire a first space length of the first data when transmitting the first data; a comparison unit, configured to compare the first space length with a preset space length; A determining unit, configured to traverse idle resource blocks according to the preset space length when the first space length is less than the preset space length, and determine a first idle resource block, where the first idle resource block is greater than or equal to the preset space length the preset space length; An allocating unit, configured to allocate storage resources to the first data by using the first free resource block. 15. The terminal according to claim 14, characterized in that, The determining unit is further configured to traverse the free resource blocks according to the first space length and determine the first free resource blocks when the first space length is greater than or equal to the preset space length, the The first idle resource block is greater than or equal to the first space length. 16. The terminal according to claim 14, characterized in that, The determining unit is further configured to determine that the first idle resource block is a storage resource block for the first data when the sum of the two preset space lengths is greater than the length of the first idle resource block ; When the sum of the two preset space lengths is less than or equal to the length of the first free resource block, determine a resource block to be allocated whose length is the preset space length from the first free resource block, The resource block to be allocated is a resource block for storing the first data. 17. The terminal according to claim 15, characterized in that, The determining unit is further configured to determine that the first idle resource block is the first idle resource block when the sum of the first space length and the preset space length is greater than the length of the first idle resource block. A data storage resource block; when the sum of the first space length and the preset space length is less than or equal to the length of the first free resource block, determine the length from the first free resource block as the A resource block to be allocated with a first space length, where the resource block to be allocated is a resource block for storing the first data. 18. The terminal according to claim 16, further comprising: a reading unit; The reading unit is configured to, in the first free resource block, start from the end address of the first free resource block, and read a second free resource block whose length is the preset space length, the the second idle resource block belongs to the first idle resource block; The determining unit is further configured to determine the second idle resource block as the resource block to be allocated. 19. The terminal according to claim 17, characterized in that, The reading unit is further configured to read a third free resource block whose length is the first space length from the end address of the first free resource block in the first free resource block, so The third idle resource block belongs to the first idle resource block; The determining unit is further configured to determine the third idle resource block as the resource block to be allocated. 20. The terminal according to claim 14, characterized in that, the terminal further comprises: a traversal unit and a comparison unit; The traversal unit is configured to traverse the idle resource block from the initial idle resource block; The comparison unit is configured to compare the preset space length with a second space length of a current idle resource block, where the current idle resource block is one of the idle resource blocks; The determining unit is specifically configured to determine that the current idle resource block whose second space length is greater than the preset space length is the first idle resource block. 21. The method according to claim 20, wherein the terminal further comprises: an end unit; The end unit is configured to end comparing the preset space length with the second space length of the current free resource block when the first free resource block is not determined after traversing to the end of the free resource block The process and return to confirm failure instruction. 22. The terminal according to any one of claims 14-21, characterized in that, the terminal further comprises: a determining unit and a combining unit; The obtaining unit is further configured to release the first data when the transmission of the first data is completed, and obtain a storage resource block that has released the first data, and the storage resource block includes first address information; The determining unit is further configured to traverse the idle resource blocks according to the first address information and preset determination conditions, and determine a fourth idle resource block adjacent to the storage resource block; The determination unit is configured to determine the storage resource block and the fourth idle resource block according to the first address information and the second address information, and the fourth idle resource block is one of the idle resource blocks For an idle resource block adjacent to the storage resource block, the second address information is address information of the fourth idle resource block; The combining unit is configured to combine the fourth idle resource block and the storage resource block into a new fourth idle resource block when it is determined that the fourth idle resource block is continuous with the storage resource block . 23. The terminal according to claim 22, characterized in that, The traversal unit is further configured to traverse the idle resource block from the initial idle resource block; The comparing unit further compares the first address information with the second address information of the current idle resource block; The determining unit is further configured to determine the current idle resource block as A fifth idle resource block, where the fifth idle resource block is the fourth idle resource block right adjacent to the storage resource block; when it is determined that the second address information is smaller than the first address information, and the When the difference between the second address information and the first address information is the smallest, determine the current free resource block as the sixth free resource block, and the sixth free resource block is the left adjacent to the storage resource block. A fourth free resource block. 24. The terminal according to claim 23, characterized in that, The ending unit is further configured to end the process of traversing the idle resource block when the current idle resource block is a terminated idle resource block and the second address information is smaller than the first address information. 25. The terminal according to claim 23, characterized in that, The merging unit is specifically configured to combine the space length of the fifth free resource block and the third space length into a new fifth free resource block when the storage resource block is continuous with the fifth free resource block. The space length of the resource block, the first address information is used as the address information of the next free resource block pointed to by the first pointer, and the address information of the next free resource block pointed to by the second pointer is used as the address information pointed to by the new third pointer Address information of the next free resource block, where the address information of the next free resource block pointed to by the first pointer is the pointer information corresponding to the sixth free resource block, and the address information of the next free resource block pointed to by the second pointer The address information is the pointer information corresponding to the storage resource block, and the address information of the next free resource block pointed to by the third pointer is the pointer information corresponding to the fifth free resource block; when the storage resource block and the When the sixth idle resource blocks are continuous, the space length of the sixth idle resource block and the second space length are combined into a new space length of the sixth idle resource block. 26. The terminal according to claim 25, further comprising: an updating unit; The update unit is configured to use the first address information as the first pointer to The address information of the next free resource block pointed to by the first pointer is used as the address information of the next free resource block pointed to by the third pointer.