A method, computer storage medium and terminal for implementing partition processing

Abstract

The application discloses a method, a computer storage medium and a terminal for realizing partition processing, which comprises the following steps: when creating one or more primary partitions of a disk, writing the data of the first sector of the disk into a first backup sector after first symmetric encryption, wherein the first backup sector is one of the first to 2047th sectors of the disk; when creating an i-th logical node of the disk, writing the logical node information of the i-th logical node into a second backup sector corresponding to the i-th logical node after second symmetric encryption, wherein the second backup sector is from the N i +1th sector to the M i th sector of the disk, the N i th sector is the sector where the i-th logical node is located, and the M i th sector is the start sector of the i-th logical partition. According to the application, the data of the first sector and the logical node information data are symmetrically encrypted, so that the problem that the partition cannot be restored due to the deletion of the partition data of the disk is avoided.

Description

Technical Field

[0001] This article relates to, but is not limited to, disk partitioning technology, and in particular to a method for implementing partitioning, computer storage media, and terminals. Background Technology

[0002] Master Boot Record (MBR) disk partitioning is a common type of disk partitioning on the market. The MBR disk partitioning specification stipulates that the first sector (512 bytes) of cylinder 0 (head 0, cylinder 0) records boot information and disk partitioning information; the first 446 bytes are the master boot record, the middle 64 bytes contain four 16-byte partition table entries, and the last two bytes are specific end-of-partition identifiers 55 and AA.

[0003] According to the rules defined by MBR partitioning technology, hard drives are managed in the form of sectors, dividing the hard drive into several sectors, each sector being 512 bytes in size. All partition table information and user data are stored in the sectors of the disk. The 511th and 512th bytes of the first sector describing the partition table information are fixed as 55 and AA. Figure 1 This is a diagram illustrating MBR disk partitioning in related technologies, such as... Figure 1 As shown, sector 0 of the disk, consisting of 512 bytes, contains 64 bytes of partition table information. Each 16-byte partition table can describe a partition individually. If all 16 bytes are zero, it means there is no partition information. The fifth byte of the 16 bytes describes the partition type, whether it's a primary partition or a logical partition (or extended partition). Bytes 9-16 determine the starting sector position and sector size of the partition. A logical node also occupies one sector (512 bytes), which contains 64 bytes of partition table information. The first 32 bytes are valid. Of these, the first 16 bytes record the logical node information, including the partition type, starting sector, and sector size. The second 16 bytes record the partition type, starting sector, and sector size of the next logical node. When using MBR for disk partitioning, the partition table and logical node information can be easily accessed from any computer. If these information are deleted, the disk partition is difficult to restore. Furthermore, the plaintext partition table and logical node information is easily read, exposing user-stored data and increasing information security risks.

[0004] In summary, the deletion of partition table information and logical node information in related technologies makes partitions difficult to restore, and the ease with which data can be read poses a security risk to disk data. How to improve the security of MBR disk partitioning applications has become an issue that needs to be addressed. Summary of the Invention

[0005] The following is an overview of the subject matter described in detail herein. This overview is not intended to limit the scope of the claims.

[0006] This invention provides a method for partitioning, a computer storage medium, and a terminal, which can improve the security of disk partitioning applications.

[0007] This invention provides a method for implementing partitioning, comprising:

[0008] When creating more than one primary partition on a disk, the data in the first sector of the disk is first symmetric encrypted and then written to a pre-defined first backup sector. The first backup sector is one of the 1st to 2047th sectors of the disk.

[0009] When creating the i-th logical node of the disk, the logical node information of the i-th logical node is subjected to a second symmetric encryption and then written to the second backup sector corresponding to the pre-defined i-th logical node. The second backup sector is the N-th logical node of the disk. i +1 sector to M i The nth sector, the Nth i The sector is the sector where the i-th logical node is located; the M-th sector is the sector where the i-th logical node is located. i The i-th sector is the starting sector of the i-th logical partition.

[0010] On the other hand, embodiments of the present invention also provide a computer storage medium storing a computer program, which, when executed by a processor, implements the above-described method for partitioning.

[0011] Furthermore, embodiments of the present invention also provide a terminal, comprising: a memory and a processor, wherein the memory stores a computer program; wherein,

[0012] The processor is configured to execute computer programs in memory;

[0013] When the computer program is executed by the processor, it implements the partitioning method as described above.

[0014] The technical solution of this application includes: when creating one or more primary partitions on a disk, the data in the first sector of the disk is first symmetrically encrypted and then written to a pre-set first backup sector, the first backup sector being one of the 1st to 2047th sectors of the disk; when creating the i-th logical node of the disk, the logical node information of the i-th logical node is second symmetrically encrypted and then written to a pre-set second backup sector corresponding to the i-th logical node, the second backup sector being the Nth sector of the disk. i +1 sector to M i The nth sector, the Nth i The sector is the sector where the i-th logical node is located; the M-th sector is the sector where the i-th logical node is located. i Each sector is the starting sector of the i-th logical partition. This embodiment of the invention avoids the problem of partitions being unrecoverable due to deleted partition data by symmetrically encrypting the data in the first sector and the logical node information data.

[0015] Other features and advantages of the invention will be set forth in the description which follows, and will be apparent in part from the description, or may be learned by practicing the invention. The objects and other advantages of the invention may be realized and obtained by means of the structures particularly pointed out in the description, claims, and drawings. Attached Figure Description

[0016] The accompanying drawings are provided to further understand the technical solutions of the present invention and constitute a part of the specification. They are used together with the embodiments of this application to explain the technical solutions of the present invention and do not constitute a limitation on the technical solutions of the present invention.

[0017] Figure 1 This is a schematic diagram of MBR disk partitioning in related technologies;

[0018] Figure 2 This is a flowchart illustrating the partitioning process implemented in an embodiment of the present invention;

[0019] Figure 3 This is a schematic diagram of partition table information in the primary partition hiding process according to an embodiment of the present invention;

[0020] Figure 4 A schematic diagram illustrating the creation of a logical partition according to an embodiment of the present invention;

[0021] Figure 5 A schematic diagram illustrating the creation of a logical partition according to another embodiment of the present invention;

[0022] Figure 6 This is a schematic diagram illustrating the deletion of a logical partition according to an embodiment of the present invention;

[0023] Figure 7 This is a schematic diagram illustrating the deletion of a logical partition according to another embodiment of the present invention;

[0024] Figure 8 This is a schematic diagram illustrating the deletion of a logical partition according to another embodiment of the present invention;

[0025] Figure 9 A schematic diagram illustrating the creation of a hidden logical partition in an embodiment of the present invention;

[0026] Figure 10 This is a schematic diagram illustrating the physical linear arrangement of sectors in a disk, illustrating an application example of the present invention.

[0027] Figure 11 A flowchart for creating partitions as an application example of this invention;

[0028] Figure 12 This is a flowchart illustrating the process of deleting a partition, an application example of the present invention.

[0029] Figure 13 This is a flowchart illustrating the application example of the hidden partition in this invention;

[0030] Figure 14 The flowchart of the partitioning process is shown as an application example of the present invention. Detailed Implementation

[0031] To make the objectives, technical solutions, and advantages of the present invention clearer, the embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be noted that, unless otherwise specified, the embodiments and features described in this application can be arbitrarily combined with each other.

[0032] The steps illustrated in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases the steps shown or described may be performed in a different order than that presented here.

[0033] Figure 2 This is a flowchart illustrating the partitioning method implemented in an embodiment of the present invention, as shown below. Figure 1 As shown, it includes:

[0034] Step 201: When creating one or more primary partitions on a disk, the data in the first sector of the disk is first symmetrically encrypted and then written into a pre-defined first backup sector. The first backup sector is one of the 1st to 2047th sectors of the disk. In an exemplary instance, the first backup sector is the starting sector with the smallest sector number among the one or more primary partitions.

[0035] Step 202: When creating the i-th logical node of the disk, the logical node information of the i-th logical node is subjected to a second symmetric encryption and then written into the pre-defined second backup sector. The second backup sector is the N-th logical node of the disk. i +1 sector to M i The nth sector, the Nth iThe sector is the sector where the i-th logical node is located; the M-th sector is the sector where the i-th logical node is located. i The i-th sector is the starting sector of the i-th logical partition.

[0036] This invention avoids the problem of partitions being unrecoverable due to the deletion of disk partition data by symmetrically encrypting the data in the first sector and the logical node information data.

[0037] In one exemplary instance, when creating a primary partition, the present invention, referring to related technologies, writes partition table information into the 64-byte Disk Partition Table (DPT) byte of the first sector (sector 0) of the primary partition. In another exemplary instance, if the primary partition is not hidden, the first sector of the disk retains 512 bytes of data, including the aforementioned 64-byte DPT byte, according to related technologies. In yet another exemplary instance, if logical partitions are not hidden, the data is written into the Nth sector... i Each sector contains the logical node information of the i-th logical node.

[0038] In one exemplary instance, both the first backup sector and the second backup sector in this embodiment of the invention are sectors that are not covered by user data.

[0039] In one exemplary instance, the first symmetric encryption and the second symmetric encryption of the present invention can be a symmetric encryption method known to those skilled in the art, or they can be different symmetric encryption methods. The specific encryption can be determined by those skilled in the art based on security, complexity, etc.

[0040] In one exemplary instance, after performing a first symmetric encryption on the data in the first sector of the disk and writing it to a pre-defined first backup sector, the method of this embodiment of the invention further includes:

[0041] When a pre-defined instruction is received to hide the xth primary partition among more than one primary partition, the partition table information of the xth primary partition in the first sector of the disk is deleted to hide the xth primary partition.

[0042] In one exemplary instance, after deleting the partition table information of the xth primary partition in the first sector of the disk, the method of this embodiment further includes:

[0043] When a pre-set instruction to display the xth primary partition is received, the first backup sector is decrypted, and the partition table information of the xth primary partition in the decrypted first backup sector is added to the first sector.

[0044] In one exemplary instance, the method of this embodiment of the invention further includes:

[0045] When a pre-defined instruction is received to delete the y-th primary partition from one or more primary partitions, the partition table information of the y-th primary partition in the first sector is updated.

[0046] After performing the first symmetric encryption on the data in the first updated sector, the data is then updated to the first backup sector.

[0047] This invention hides the primary partition, making the data within the partition invisible. Because the partition table information of the primary partition is symmetrically encrypted, it prevents recovery by third parties, improves the security of disk data, and provides protection for user data privacy.

[0048] The following is a brief example illustrating the handling of hiding and showing the main partition. Figure 3 This is a schematic diagram of partition table information in the primary partition hiding process according to an embodiment of the present invention, as shown below. Figure 3 As shown, the primary partition is hidden as follows: If primary partition x (taking primary partition 1 as an example in the figure) is in a displayed state, the 16-byte partition table information about the primary partition in the DPT of the first sector is not zero. After clearing (the horizontal line on partition table information 1 in the figure indicates clearing) the 16-byte partition table information describing the primary partition in the first sector (the 16-byte partition table information is zero), the primary partition x is not visible to the system (the horizontal line on primary partition 1 indicates that it is not visible). In this embodiment of the invention, only the primary partition is hidden, so the data in the first backup sector remains unchanged. After the primary partition x is hidden, if it is necessary to display the hidden primary partition x, if primary partition 1 is in a hidden state, the data in the first backup sector is decrypted, the 16-byte partition table information of primary partition x is read, and then the 16-byte partition table information is written into the DPT table of the first sector. When it is necessary to delete primary partition y, this embodiment of the invention deletes 16 bytes of partition table information corresponding to primary partition y in the DPT table of the first sector (sector 0) of the disk, that is, deletes primary partition y. After deleting primary partition y, this embodiment of the invention performs a first symmetric encryption on the data of the first sector corresponding to the deleted primary partition y and backs it up to the first backup sector.

[0049] In one exemplary instance, after performing a second symmetric encryption on the logical node information of the i-th logical node and writing it into the pre-defined second backup sector corresponding to the i-th logical node, the method of this embodiment of the invention further includes:

[0050] When a pre-defined instruction to delete the z-th logical partition is received, the N-th logical partition is... z Update the logical node information of the z-th logical node in each sector;

[0051] After the logical node information of the updated z-th logical node is encrypted using the second symmetric encryption, it is updated to the second backup sector corresponding to the z-th logical node.

[0052] The z-th logical partition is one of all the logical partitions created.

[0053] In one exemplary instance, after performing a second symmetric encryption on the logical node information of the i-th logical node and writing it into the pre-defined second backup sector corresponding to the i-th logical node, the method of this embodiment of the invention further includes:

[0054] When a pre-set instruction to hide the p-th logical partition is received, for N... p The logical node information of the p-th logical node in each sector is deleted to hide the p-th logical partition.

[0055] Wherein, the p-th logical partition is one of all logical partitions created.

[0056] In one exemplary instance, after hiding the p-th logical partition, the method of this embodiment of the invention further includes:

[0057] Upon receiving a pre-set instruction to display the p-th logical partition, the system decrypts and backs up the data to the second backup sector corresponding to the p-th logical node. The system then adds the logical node information of the p-th logical node from the decrypted second backup sector to N. p In each sector.

[0058] This invention hides logical partitions, making the data within those partitions invisible. Because the partition table information of the logical partitions is symmetrically encrypted, it prevents recovery by third parties, thus improving the security of disk data and providing protection for user data privacy.

[0059] The creation of logical partitions in this embodiment of the invention includes, as follows: Figure 4 He Ru Figure 5 The two scenarios are as follows: 1. Referring to relevant technologies, if the 64-byte DPT table of the first sector (sector 0) of the disk does not contain logical node information, and the DPT table contains a 16-byte empty partition table with zeros, then 16 bytes of logical node information are written into the 16-byte empty partition table. Based on the starting position and size of the sector where the logical node information is written, the sector N where the logical node of the disk is located is determined, and the information of the corresponding logical partition is written into the first 16 bytes of the 64-byte DPT table of the sector N where the logical node is located. Then, logical partition 1 is created. After writing the logical node information and the logical partition information according to relevant technologies, the data of the first sector and the data of the first Nth sector in this embodiment of the invention are changed. Therefore, after performing a first symmetric encryption on the data of the first sector, it is backed up to the first backup sector. After performing a second symmetric encryption on the logical node information of the i-th logical node in the Nth sector, it is written into the pre-set second backup sector. The second backup sector is the Nth logical node of the disk. i+1 sector to M i The nth sector, the Nth i The sector is the sector where the i-th logical node is located; the M-th sector is the sector where the i-th logical node is located. i Each sector is the starting sector of the i-th logical partition. In an exemplary instance, embodiments of the present invention can back up the data of the first sector, which is encrypted using a first symmetric encryption, in sector 1 (the second sector of the disk), and in the N-th sector... i +1 sector backup of the logical node information of the i-th logical node through the second symmetric encryption. 2. If logical node information exists in the DPT table of the first sector, then the location of logical node i in sector N is determined based on the 16-byte partition table information. Since the first 16-bit byte of the DPT table of sector i describes the information of logical partition i, the description information of the newly created logical node i+1 needs to be written in the second 16-bit byte of logical node i. Thus, the location of logical node i+1 in sector N can be determined. i+1 Sector, at the Nth i+1 The partition table information for logical partition i+1 is written into the first 16 bytes of the DPT table of each sector, and the creation of logical partition i+1 is complete; since logical node i and logical node i+1 are located in N i Sector and N i+1 The DPT tables of all sectors have been changed. Therefore, after performing a second symmetric encryption on the updated logical node information, it is backed up to the second backup sectors corresponding to logical node i and logical node i+1. In an exemplary embodiment, this invention can be implemented in the Nth... i +1 sector and Nth i+1 The backup and encrypted logical node information of logical node i and logical node i+1 is stored in sector +1.

[0060] The deletion process of logical partition z in this embodiment of the invention includes three cases, which are described in detail below. Figure 6 , Figure 7 and Figure 8If logical partition z is the last logical partition created on the disk (the logical node information contains 64 bytes of partition table information, of which only the first 16 bytes record the logical node information corresponding to the current logical node, and the second 16 bytes are 0), then all partition table information of the logical node is zeroed (the horizontal lines in the diagram represent zeroing, clearing, or erasing), and the sector data is also cleared; the second 16 bytes of partition table information in the DPT table of the logical node corresponding to the logical partition z-1 above logical node z are deleted, and the data in the sector where the logical node corresponding to logical partition z-1 is located is backed up to the second backup sector corresponding to logical node z-1 after performing a second symmetric encryption. If there are logical nodes before and after the logical node z containing logical partition z, then when deleting logical partition z, only the first 16 bytes of partition table information describing the logical partition in the DPT table of that sector need to be deleted, and the logical node information of the updated logical node z is backed up to the second backup sector corresponding to logical node z after performing a second symmetric encryption. If there is only one logical partition z in the disk, clear the data in the sector where logical node z is located to zero, clear the data in the second backup sector corresponding to logical node z, clear the 16 bytes of logical partition information in the DPT table of the first sector of the disk, and update the data related to logical node z in the first backup sector.

[0061] Hiding and showing logical partitions, such as Figure 9 As shown, if logical partition p is in a normal display state, the first 16 bytes of data in the DPT table of the sector where logical node p is located is cleared, while the second backup sector corresponding to logical node p remains unchanged; if logical partition p is in a hidden state, the data of the second backup sector corresponding to logical node p is decrypted, the 16 bytes of partition table information of logical partition p in the decrypted data of the second backup sector corresponding to logical node p is read, and then the 16 bytes of partition table information is written into the DPT table of the sector where logical node p is located.

[0062] This invention also provides a computer storage medium storing a computer program, which, when executed by a processor, implements the above-described method for partitioning.

[0063] This invention also provides a terminal, comprising: a memory and a processor, wherein the memory stores a computer program; wherein,

[0064] The processor is configured to execute computer programs in memory;

[0065] When a computer program is executed by a processor, it implements the partitioning process as described above.

[0066] The following application examples briefly illustrate the embodiments of the present invention. These application examples are only used to describe the embodiments of the present invention and are not intended to limit the scope of protection of the present invention.

[0067] Application Examples

[0068] Figure 10 This is a schematic diagram of the physical linear arrangement of sectors in a disk, as an application example of the present invention. Figure 10 As shown, the sectors are arranged according to relevant technologies, with each sector being 512 bytes. The 512 bytes occupied by the MBR partition table information are exactly the size of one sector. The partition table information is arranged in the sectors, and the data of the sector preceding the first backup sector is symmetrically encrypted.

[0069] Figure 11 A flowchart for creating partitions as an application example of this invention, such as... Figure 11 As shown, this application example creates a partition, that is, writes MBR data containing partition table information into the corresponding sector. If the partition is a primary partition, the data of the first sector only needs to be backed up to the first backup sector (e.g., sector 1) through symmetric encryption. If the partition is a logical partition, the logical node information of the logical node corresponding to the newly created logical partition (the 16-byte address of the newly created sector pointed to by the logical node) needs to be modified, and symmetric encryption and backup of the logical node information are performed at the same time.

[0070] Figure 12 The flowchart for deleting a partition is an application example of this invention, such as... Figure 12 As shown, this application example demonstrates how deleting a partition requires zeroing out 16 bytes of the DPT table in the partition or primary partition where the logical node resides, while also performing symmetric encryption and backup. For the partition to be deleted, all data in the sectors where the logical node resides and the backup sectors are zeroed out.

[0071] Figure 13 The flowchart for the application example of the hidden partition of this invention is as follows: Figure 13 As shown, for a hidden partition, you only need to clear the 16-byte partition table data in the DPT table of the first sector where the primary partition is located or the sector where the logical node of the logical partition is located. The first backup sector or the second backup sector remains unchanged and is used to restore the partition data.

[0072] Figure 14 A flowchart of the partitioning process is shown as an application example of this invention, such as... Figure 14 As shown, to display a hidden partition, it is necessary to read the data of the second backup sector of the sector where the corresponding logical node is located. By decrypting and reading the 16-byte partition table information of the hidden partition in the second sector data, and writing it into the sector DPT, the partition can be restored and displayed.

[0073] This application example uses symmetric encryption and backup of partition table information. After the disk data is hidden, the hidden partition is invisible to the operating system, preventing users from manipulating or accessing the data in the hidden partition. This ensures that the data cannot be recovered by third-party software in the event of a hard drive loss. Furthermore, the backup sector cannot be recovered without decryption using a specific key, thus guaranteeing the confidentiality and security of the data stored in the disk partition.

[0074] It will be understood by those skilled in the art that all or some of the steps, systems, or apparatuses disclosed above, and their functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between functional modules / units mentioned above does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit (ASIC). Such software may be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

Claims

1. A method for implementing partitioning, comprising: When creating more than one primary partition on a disk, the data in the first sector of the disk is first symmetric encrypted and then written to a pre-defined first backup sector. The first backup sector is one of the 1st to 2047th sectors of the disk. When creating the i-th logical node of the disk, the logical node information of the i-th logical node is subjected to a second symmetric encryption and then written to the second backup sector corresponding to the pre-defined i-th logical node. The second backup sector is the N-th logical node of the disk. i +1 sector to M i The Nth sector i The sector is the sector where the i-th logical node is located; the M-th sector is the sector where the i-th logical node is located. i The sector is the starting sector of the i-th logical partition; The method further includes, after performing a second symmetric encryption on the logical node information of the i-th logical node and writing it into the pre-defined second backup sector corresponding to the i-th logical node, the method further includes: When a pre-defined instruction to delete the z-th logical partition is received, the N-th logical partition is... z The logical node information of the z-th logical node in each sector is updated; the updated logical node information of the z-th logical node is then encrypted using a second symmetric encryption method and updated to the second backup sector corresponding to the z-th logical node; the z-th logical partition is one of all created logical partitions.

2. The method according to claim 1, characterized in that, The first backup sector is the starting sector with the smallest sector number among the one or more primary partitions.

3. The method according to claim 1, characterized in that, After performing a first symmetric encryption on the data in the first sector of the disk and writing it to a pre-defined first backup sector, the method further includes: When a pre-set instruction is received to hide the xth primary partition among the one or more primary partitions, the partition table information of the xth primary partition in the first sector of the disk is deleted to hide the xth primary partition.

4. The method according to claim 3, characterized in that, After deleting the partition table information of the xth primary partition in the first sector of the disk, the method further includes: When a pre-set instruction to display the xth primary partition is received, the first backup sector is decrypted, and the partition table information of the xth primary partition in the first backup sector obtained from the decryption is added to the first sector.

5. The method according to claim 1, characterized in that, The method further includes: When a pre-set instruction to delete the y-th primary partition in one or more primary partitions is received, the partition table information of the y-th primary partition in the first sector is updated; After performing the first symmetric encryption on the data in the first updated sector, the data is then updated to the first backup sector.

6. The method according to any one of claims 1-5, characterized in that, After performing a second symmetric encryption on the logical node information of the i-th logical node and writing it into the pre-defined second backup sector corresponding to the i-th logical node, the method further includes: When a pre-set instruction to hide the p-th logical partition is received, for N... p The logical node information of the p-th logical node in each sector is deleted to hide the p-th logical partition. Wherein, the p-th logical partition is one of all logical partitions created.

7. The method according to claim 6, characterized in that, After hiding the p-th logical partition, the method further includes: Upon receiving a pre-set instruction to display the p-th logical partition, the system decrypts and backs up the data to the second backup sector corresponding to the p-th logical node. The system then adds the logical node information of the p-th logical node from the decrypted second backup sector to the N-th logical node. p In each sector.

8. A computer storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the method for partitioning processing as described in any one of claims 1-7.

9. A terminal, comprising: A memory and a processor, wherein the memory stores a computer program; wherein, The processor is configured to execute computer programs in memory; When the computer program is executed by the processor, it implements the method for partitioning as described in any one of claims 1-7.

Images