CN109471729B - Resource cleaning method and device based on recursion - Google Patents

Abstract

The embodiment of the invention relates to the field of data processing, and particularly discloses a resource cleaning method and device based on recursion, wherein the method comprises the following steps: determining a basic data resource which is not set to be reserved as a first resource, and searching a dependent resource of the first resource in a system where the first resource is located according to a resource identifier of the first resource; if the dependent resource of the first resource is not found in the system where the first resource is located, deleting the first resource; otherwise, respectively taking the dependent resources of the first resource as first resources to execute the step of searching the dependent resources of the first resource in the system where the first resource is located according to the resource identification of the first resource; and deleting the first resource after all the dependent resources of the first resource are deleted. By adopting the invention, the time and the labor for cleaning the resources can be saved, and sufficient resources can be provided.

Description

Resource cleaning method and device based on recursion

Technical Field

The present invention relates to the field of computer technology, and in particular to a recursive resource cleaning method and device.

Background technique

With the continuous development of computer technology, software testing is becoming more and more important. Nowadays, basically every unit engaged in product research and development will have dedicated software testers to test the performance, correctness, integrity, security, code or framework rigor of the developed products, including white box testing and black box testing, etc., to discover program errors, measure software quality, and evaluate whether it can meet the design requirements, so as to continuously optimize products and ensure the quality of products put on the market.

In the software testing industry, in order to verify the functions of the product, testers will continuously create products for testing in the test environment and production environment, which will consume a lot of resources. After the verification is completed, testers usually manually delete the resources created during the test, or temporarily ignore them and clean up some of them as needed when resources are insufficient. However, the "manual cleanup" method will consume the time and manpower of testers or managers to a certain extent; the "not processing for the time being, and clean up some of them as needed when resources are insufficient" method may affect the progress of the test, especially when resources need to be urgently obtained, which will cause inconvenience and affect the work process.

Summary of the invention

Based on this, in order to solve the above-mentioned problem that resource cleaning wastes manpower and time, and may also cause insufficient resources when urgently needed, affecting the work progress, a recursive resource cleaning method and device are specially provided.

An embodiment of the present invention provides a recursive resource cleaning method, comprising:

Determining whether the basic data resource is set to be reserved, and if the basic data resource is not set to be reserved, determining that the basic data resource is the first resource;

Searching for a dependent resource of the first resource in a system where the first resource is located according to the resource identifier of the first resource, where the dependent resource of the first resource is a data resource that references the first resource when it is generated;

If at least one dependent resource of the first resource is found in the system where the first resource is located, the step of searching for the dependent resource of the first resource in the system where the first resource is located according to the resource identifier of the first resource is performed using the at least one dependent resource of the first resource as the first resource;

If the dependent resources of the first resource are not found in the system where the first resource is located, the first resource is deleted, and the dependent resources of the first resource are used as the first resource to execute the step of searching for the dependent resources of the first resource in the system where the first resource is located according to the resource identifier of the first resource.

The resource identifier of the first resource includes a reference identifier of the first resource, and searching for a dependent resource of the first resource in a system where the first resource is located according to the resource identifier of the first resource includes:

According to the reference identifier of the first resource, searching in the system where the first resource is located for other data resources whose resource names include the reference identifier of the first resource as dependent resources of the first resource;

Alternatively, other data resources whose resource contents include the reference identifier of the first resource are searched in the system where the first resource is located according to the reference identifier of the first resource as dependent resources of the first resource.

The step of determining whether the basic data resource is set to be reserved includes:

Determine whether the basic data resource carries a preset retention tag, and if so, determine that the basic data resource is set to be retained, otherwise, determine that the basic data resource is not set to be retained; or

The Boolean flag of the basic data resource is read, and if the Boolean flag of the basic data resource is a true value, it is determined that the basic data resource is set to be reserved, otherwise it is determined that the basic data resource is not set to be reserved.

Wherein, the determining whether the basic data resource is set to be reserved also includes:

If it is determined that the preset resource cleanup time has arrived or a resource cleanup instruction has been received, the step of determining whether the basic data resource is set to be retained is triggered.

The deleting the first resource includes:

Extracting resource information of the first resource, where the resource information of the first resource includes an ID of the first resource, where the ID of the first resource is used to indicate a storage address of the first resource;

The corresponding resource deletion method is called according to the resource type of the first resource, and the id of the first resource is used as a calling parameter of the resource deletion method to delete the first resource.

The information of the first resource also includes a user account for creating the first resource;

The method further includes calling a corresponding resource deletion method according to the resource type of the first resource, and using the ID of the first resource as a calling parameter of the resource deletion method, and after deleting the first resource, the method further includes:

Feedback a deletion result of the first resource to the user who created the first resource according to the user account who created the first resource, wherein the deletion result includes deletion failure information or deletion success information.

Wherein, the basic data resource is a virtual private cloud.

Wherein, the method further comprises:

After determining that the preset resource cleaning time has arrived or receiving a resource cleaning instruction, the resource information of the basic data resource is extracted, the extracted resource information of the basic data resource is stored in a collection, and traversed in order. When all the resource information of the basic data resource is traversed, the resource cleaning is ended.

Among them, when performing the resource cleanup, after finding the dependent resources of the first resource, the resource information of the dependent resources of the first resource is called. If the dependent resources of the first resource have dependent resources, the resource information of the dependent resources of the first resource is automatically stored in the cache, and the dependent resources of the dependent resources of the first resource are used as the first resources to continue resource cleanup. Otherwise, the dependent resources of the first resource are deleted, and the first resource is returned to continue the resource cleanup.

Another aspect of the present invention provides an image processing device, including:

A traversal processing module, used to traverse resources, search for basic data resources that are not marked as reserved, and store resource information of the basic data resources in a storage module;

A storage module, used to store the information of the basic data resources and resource cleaning results;

a deletion module, configured to delete the first resource if no dependent resource of the first resource is found in the system where the first resource is located, and to use the at least one dependent resource of the first resource as the first resource to perform the step of searching for the dependent resource of the first resource in the system where the first resource is located according to the first resource identifier if at least one dependent resource of the first resource is found in the system where the first resource is located;

The judgment module is used to judge whether the basic data resources are set to be retained, whether the current resources have dependent resources, and whether all resources are cleared.

A setting module, used to obtain the specified time for deleting resources set by the user and whether the basic data resources are to be retained;

The feedback module is used to feed back the resource cleaning result to the user after the resource cleaning is completed, and the resource cleaning result includes the resource deletion result.

Wherein, the judgment module includes:

Determine whether the basic data resource carries a preset retention tag, if so, determine that the basic data resource is set to be retained, otherwise, determine that the basic data resource is not set to be retained, or read the Boolean tag of the basic data resource, if the Boolean tag of the basic data resource is a true value, determine that the basic data resource is set to be retained, otherwise, determine that the basic data resource is not set to be retained;

Searching for dependent resources of the first resource in the system where the first resource is located according to the resource identifier of the first resource; if other data resources containing the resource identifier of the first resource are found in the system where the first resource is located, then the first resource has dependent resources, and the other data resources found are dependent resources of the first resource;

The resource cleaning result is obtained by traversing the information of the basic data resources and judging whether the next basic data resource information is empty. If it is empty, all resources are cleaned up, otherwise, resource cleaning continues.

Another aspect of the embodiment of the present invention provides a recursive-based resource cleaning device, comprising: a processor, a memory;

The processor is connected to the memory, wherein the memory is used to store program codes, and the processor is used to call the program codes to execute the recursive-based resource cleaning method as described in one aspect of an embodiment of the present invention.

Another aspect of an embodiment of the present invention provides a computer storage medium storing computer program instructions. When the computer program instructions are executed by a processor, they are used to process the recursive-based resource cleaning method as described in one aspect of an embodiment of the present invention.

Implementing the embodiments of the present invention will have the following beneficial effects:

The embodiment of the present invention cleans up resources by using a recursive deletion method. Taking a basic data resource as an example, if the basic data resource is not set to be retained, the basic data resource is determined as a first resource, and the dependent resource of the first resource is searched according to the resource identifier of the first resource. If the dependent resource of the first resource exists, the dependent resource of the first resource is determined as the first resource, and the step of searching for the dependent resource of the first resource according to the resource identifier of the first resource is performed. Otherwise, the first resource is deleted. Through this recursive method, all resources are cleaned up to the maximum extent, and the resources that need to be retained are retained at the same time, so that resources can be cleaned up on demand, avoiding the occurrence of incomplete resource cleaning and the deletion of important resources. In addition, regular automatic cleaning saves time and manpower.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

in:

FIG1 is a flow chart of a recursive resource cleaning method provided by an embodiment of the present invention;

FIG2 is a diagram showing a processing structure of a data resource according to an embodiment of the present invention;

FIG3 is a diagram showing an example of resource cleanup based on recursion;

Figure 4 is a VPC resource dependency diagram of Ping An Public Cloud;

FIG5 is a schematic diagram of the structure of a recursive resource cleaning device provided by an embodiment of the present invention;

FIG. 6 is a schematic diagram of the structure of a server provided in an embodiment of the present invention.

Detailed ways

The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

Please refer to Figure 1, which is a flow chart of a recursive resource cleaning method provided by an embodiment of the present invention. As shown in Figure 1, the method includes the following steps:

Step S101, determining whether the basic data resource is set to be reserved;

Specifically, after determining that the preset resource cleanup time has been reached or receiving a resource cleanup instruction, all resources in the system are traversed to search for basic data resources. The above basic data resources are the starting point for the deletion operation, such as a virtual private cloud (VPC), which is a data resource that is dependent on other data resources but does not depend on other data resources. Specifically, the basic data resources do not contain resource identifiers of other data resources, and do not reference other data resources when generated, that is, the above basic data resources do not depend on other data resources. After finding the basic data resources, it is determined whether the above basic data resources are set to be retained. If the above basic data resources are not set to be retained, the resource information of the basic data resources found is extracted, including the id of the above basic data resources, the account of the user who created the above basic data resources, etc., and the extracted resource information of the above basic data resources is stored in the list in sequence.

Specifically, whether the basic data resource is set to be retained is determined by determining whether the basic data resource carries a preset retention tag or reading the Boolean mark of the basic data resource. If the basic data resource carries the preset retention tag or the Boolean mark of the basic data resource is true, the basic data resource is set to be retained, and step S108 is executed; otherwise, the basic data resource is not set to be retained, the information of the basic data resource is extracted, and step S102 is executed.

Step S102, determining the basic data resource as the first resource;

Specifically, the resource information of the above-mentioned stored basic data resources is stored in the system in the form of a stack, queue or array, and the resource information of the above-mentioned basic data resources includes the id of the above-mentioned basic data resources and the account of the user who created the above-mentioned basic data resources, wherein the id of the above-mentioned basic data resources is used to indicate the address of the above-mentioned basic data resources, and is used as a parameter for calling a method for deleting the above-mentioned basic data resources to delete the above-mentioned basic data resources.

Specifically, one way of resource information of the basic data resources stored above is shown in the following table:

id Resource Name Create User xxxxx1 Basic Resources A XXX … xxxxx2 Basic Resources B XXX … xxxxx3 Basic Resources C XXX …

Traverse in sequence, call the deletion method of the basic data resource with the id of the basic data resource as a parameter, obtain the address of the basic data resource through the id of the basic data resource, access the basic data resource, and delete the basic data resource. Here, take a basic data resource as an example, and determine the basic data resource as the first resource. The first resource is the data resource currently being processed, which has no specific meaning.

Step S103, determining whether the first resource has dependent resources;

Specifically, according to the resource identifier of the above-mentioned first resource, the dependent resources of the above-mentioned first resource are searched in the system where the above-mentioned first resource is located. If other data resources containing the resource identifier of the above-mentioned first resource are found in the system where the above-mentioned first resource is located, then the above-mentioned first resource has dependent resources, and the above-mentioned other data resources found are the dependent resources of the above-mentioned first resource. Execute step 104. Otherwise, the above-mentioned first resource has no dependent resources, and execute step S105.

Step S104, taking the dependent resource of the first resource as the first resource;

Specifically, when the dependent resource of the first resource is found, the first resource is put into the cache, and the dependent resource of the first resource is returned as the first resource to execute step S103.

Step S105, deleting the first resource;

Specifically, the method for deleting the first resource is called through the id included in the information of the first resource to delete the first resource.

Optionally, when performing a deletion operation, call the deletion method. Since the types of data resources are different, the above-mentioned deletion method is an overloaded method. Delete the above-mentioned first resource to obtain the deletion result. If the deletion is successful, continue to perform subsequent deletion operations, otherwise upload the deletion failure information to an empty file. The above-mentioned deletion failure information includes the data resource id corresponding to the deletion failure, the creation user account of the data resource corresponding to the deletion failure, and the reason for the deletion failure, and then continue to perform subsequent deletion operations. Among them, the data resource creation user account can be used for classified storage. After the resource cleaning is completed, the deletion result is sent to the corresponding data resource creation user according to the creation user account of the above-mentioned data resource; the deletion result can also be directly stored in the file. After the resource cleaning is completed, the content of the above-mentioned file is read line by line to obtain the creation user account corresponding to the deletion information, and the line of information is fed back to the creation user corresponding to the line of creation user account, and the reason is analyzed manually.

Step S106, determining whether the first resource has any dependent resources;

Specifically, by post-order reading of the cache, after the first resource is deleted, it is determined whether the first resource in the cache has a predecessor data resource. If so, the first resource has a dependent resource, and the predecessor data resource is the dependent resource of the first resource, and step S107 is executed, otherwise step S108 is executed. Specifically, the cache can be stored through a stack, and the first-in-last-out feature of the stack is used to determine whether the first resource has a dependent resource by processing whether the data resource indicated by the top of the stack is empty. If it is empty, there is no dependent resource, and step S108 is executed, otherwise step S107 is executed.

Step S107, taking the dependent resource of the first resource as the first resource;

When there is a predecessor data resource for the first resource in the cache, the predecessor data resource is a dependent resource of the first resource, and step S103 is performed with the dependent resource of the first resource as the first resource.

Step S108, processing the next basic data resource;

Specifically, according to the basic data resources found in step S101, the successor data of the last deleted basic data resource is read from the extracted basic data resource information list, and the successor data is the next basic data resource of the last deleted basic data resource. The above steps S101-S107 are executed with the next basic data resource as the first resource until the basic data resource information list is completely traversed, thereby ending this resource cleaning.

Specifically, see Figure 2, which is a processing structure diagram of a data resource in an embodiment of the present invention. It is assumed that there are system data resources 301 in the system, including data resources A, B, C, D, E, A1, A2, A3, A11, A12, A21, B1, among which data resource E is a basic data resource with a "reserved" tag, and other data resources are resources that are not set as reserved. By traversing the data resources in the system, according to the resource cleaning steps shown in Figure 1, the following operations are performed:

① Determine whether the basic data resources are set to be reserved, where basic data resources A, B, C, and D are resources that are not set to be reserved and can be stored in the form of a queue, including basic data resources A—>C—>B—>D. By traversing all resources in the system, finding basic data resources that are not set to be reserved, extracting the information of the above basic data resources, and performing a queue operation, where the information of the basic data resources at least includes the id of the above basic data resources and the user account that created them, the following relationship is finally obtained: A—>next=C, C—>next=B, B—>next=D.

② Read the above basic resources in sequence and determine the basic data resource A as the first resource;

③ Determine whether the above basic data resource A has dependent resources;

④ The above basic data resource A has dependent resources, the basic data resource A is added to the cache, and the dependent resource A1 of the basic data resource A is used as the first resource;

⑤ Determine whether data resource A1 has dependent resources;

⑥ The data resource A1 has dependent resources, and the data resource A1 is added to the cache. At this time, the cache includes A—>A1, and the dependent resource A12 of the found data resource A1 is used as the first resource;

⑦ Determine whether data resource A12 has dependent resources;

⑧Data resource A12 has no dependent resources, so delete data resource A12;

⑨ Read the cache. If data resource A12 has predecessor data A1, take data resource A1 out of the cache as the first resource and return to execute ⑤.

Similarly, delete data resources A11—>A1—>A21—>A2—>A3—>A in sequence to complete the cleanup of basic data resource A and its dependent resources. Use the same method to delete basic data resources C, B, D and their dependent resources.

The relationship structure diagram between basic data resources and dependent resources can be viewed as a tree structure. The deletion operation is performed in post-order traversal order. The basic steps of deletion are as follows:

Optionally, the specific deletion process is shown in Figure 3, which is a diagram of a resource cleanup example based on recursion. Specifically, the data resources in the system can be read in sequence according to the storage address, and regular expressions can be used for label matching to determine whether the basic data resources are set to be retained. Among them, data resource A does not contain the resource identifier of other data resources, and is determined to be a basic data resource. The information of data resource A is extracted and added to the list of basic data resources 302. It is assumed here that a queue is used for storage. At this time, the information of data resource A is located at the front of the queue. After traversing in sequence, data resource A1 contains the resource identifier of data resource A and is determined to be a dependent resource. The information of data resource A1 is extracted and put into the list of unprocessed dependent resources 303. Similarly, the final result data processing 1 can be obtained. Basic data resources 302 include A—>C—>B—>D, and unprocessed dependent resources 303 include A1—>A12—>A2—>B1—>A21—>A11—>A3. Among them, data resource E does not contain the resource identifier of other data resources and is determined to be a basic data resource. After the regular expression matches the "retain" label, data resource E is not deleted and is not processed. Among them, the unprocessed dependent resources 303 are used to store data resources that have not been deleted for subsequent dependent resource search.

The basic data resources 302 are traversed in sequence, and the data resource A is accessed through the id contained in the information of the data resource A, and the data resource A is deleted. The unprocessed dependent resources 303 are traversed to find the dependent resources of the data resource A, so the information of the data resource A is put into the cache resource 304, which can be stored in the form of a stack, wherein the data resource A is the bottom of the stack and also the top of the stack. At the same time, the dependent resource A1 of the data resource A is deleted. As shown in data processing 2, the data resource A1 has dependent resources. It is added to the cache resource 304 and is the top of the stack. Similarly, after processing, the dependent resource A12 of the data resource A1 is deleted. The data resource A12 has no dependent resources. After being added to the cache resource 304, the deletion method is directly called according to the id and data type of the data resource A12 to perform the deletion operation. If the deletion is successful, the data shown in the system data resource 301.a is obtained, and the cache resource 304 is popped out of the stack, top--. If the deletion fails, the failure information of the data resource A12 is stored. Then operate on the data resource A1 at the top of the stack. At this time, data resource A1 has a dependent resource A11. Data resource A11 is added to the cache resource 304. At this time, the unprocessed dependent resources 303 include data resources A2->B1->A21->A3. A11 is deleted. At this time, data resource A1 has no dependent resources, so data resource A1 is deleted. After the deletion is successful, the cache resource 304 is popped out of the stack. At this time, the processing object is data resource A. The unprocessed dependent resources 303 are traversed to find the dependent resource A2 of data resource A. The data resource A2 is deleted. The dependent resource A21 of data resource A2 is found in the unprocessed dependent resources 303. As shown in the above operation, data resource A21 and data resource A2 are deleted in turn. At this time, the unprocessed dependent resources 303 include data resources B1->A3. Similarly, data resource A3 can be deleted. At this time, data resource A has no dependent resources. Data resource A is deleted to obtain the result shown in data processing 4. The unprocessed dependent resources 303 include data resource B1, the cache resource 304 is empty, and the basic data resource 302 includes basic data resource information C—>B—>D. The data resources in the system include data resource C, data resource B, data resource B1, data resource D, and data resource E.

Repeat the above steps, delete data resource C, data resource B1, data resource B, and data resource D in turn, and finally obtain the data shown in system data resource 301.c, including data resource E. The basic data resources 302, unprocessed dependent resources 303, and cache resources 304 in data processing 5 are all empty, releasing the space occupied by the basic data resources 302, unprocessed dependent resources 303, and cache resources 304, ending this resource cleanup, and feeding back the results of the above resource cleanup to the user who created the data resource.

Optionally, it is assumed here that the deletion of data resource A2 and data resource B fails, the user account for creating data resource A2 is XX1, and the user account for creating data resource B is XX2.

Wherein, when the deletion of data resource A2 fails, the deletion result of data resource A2 is stored in the deletion result file. Specifically, if this file already exists, the id of the above data resource A2, the account XX1 of the user who created it, and the reason for the failure to delete the above data resource A2 are stored in this file. Otherwise, a new file is created to store the deletion result of the above data resource A2. Wherein, since the deletion of data resource A2 fails, data resource A cannot be deleted either, and is also stored in the above file. When deleting data resource B, the deletion fails. Since the deletion result file already exists/is created when the deletion of data resource A2 fails, the id of data resource B, the account XX2 of the user who created it, and the reason for the failure to delete the above data resource B are directly stored in the above deletion result file. Specifically, after the resource cleanup is completed, the file content is read line by line, and the deletion result of the data resource in this line is fed back to the creating user corresponding to the creating user's account. Among them, the first line is read as the deletion result of data resource A2, and the above deletion result is fed back to the user corresponding to the account XX1 of the user who created the user. The second line is the deletion result of data resource A, which is also fed back to the user corresponding to the account XX1 of the user who created the user. The reason for the deletion failure is that the dependent resources cannot be deleted. The third line is the deletion result of data resource B, and the deletion result of the above data resource B is fed back to the user corresponding to the account XX2 of the user who created the user.

Among them, when the deletion of data resource A2 fails, the deletion result of the data resource is stored in a file named after the creation user account XX1. Specifically, if the file already exists, the id of the above data resource A2, the creation user account of the above data resource A2, and the reason for the failure to delete the above data resource A2 are stored in this file, otherwise the creation user account XX1 of the above data resource A2 is extracted, and a file named after the creation user account XX1 is created to store the deletion result of the above data resource A2. Since the deletion of data resource A2 fails, the dependent resources of data resource A cannot be deleted, so the deletion also fails, and the deletion result of the above data resource A is stored in file XX1. Continue to delete, when the deletion of data resource B fails, create a file named XX2, and store the deletion result of data resource B in file XX2. Specifically, after the resource cleanup is completed, the obtained resource cleanup result storage file is sent to the creation user corresponding to the above resource cleanup result storage file name, that is, the file named XX1 is sent to the user corresponding to XX1, and the file named XX2 is sent to the user corresponding to XX2.

The embodiment of the present invention cleans up resources according to a preset resource cleanup time or a received resource cleanup request, uses a recursive method to search for other data resources that reference basic data resources, and performs recursive deletion. Specifically, in one embodiment of the present invention, taking Ping An public cloud products as an example, most of Ping An public cloud products are created based on an independent isolated network, wherein the above-mentioned isolated network is a virtual network space divided when data is generated on Ping An public cloud. An isolated network is reflected as a VPC on the public cloud, and a VPC is a basic data resource. In this VPC, users can create network domains, subnets and cloud hosts, elastic files, load balancing and other computing, storage, and network products on demand, and these products are dependent on or depend on each other. Specifically, see Figure 4, which is a VPC resource dependency diagram of Ping An public cloud. Here, it is assumed that user A uses an allocated VPC 401 on Ping An Public Cloud 400 to create a network 4011 for product testing, and then creates a subnet 4012 on this basis, and sets up a cloud host 4014 and a relational database 4013 for specific data processing and storage. During the test, the system generates shared files such as elastic files 4015 and ELB (ElasticLoadBalance) 4016 to generate storage test results. The generated file dependencies are shown in FIG4 . ELB 4016 and elastic files 4015 directly depend on cloud hosts 4014 and relational databases 4013, which depend on subnet 4012, and subnets depend on network 4011. Specifically, all generated files here are for single use and are not set to be retained.

In this embodiment of the present invention, after reaching the preset resource cleanup time or receiving a resource cleanup request, the resources on Ping An public cloud 400 are traversed, and the information of the basic data resource VPC401 is extracted. After searching, the basic data resource VPC401 has a dependent resource network 4011, and VPC401 is added to the cache, and the dependent resource network 4011 is deleted. The network 4011 has a dependent resource subnet 4012, and the network 4011 is added to the cache to process the dependent resource subnet 4012, and the dependent resources of the subnet 4012 are searched. After traversing the data resources, it is found that the cloud host 4014 depends on the subnet 4012, and the subnet 4012 is added to the cache, and the cloud host 4014 is processed. Similarly, it is found that ELB4016 depends on the cloud host 4014, and the cloud host 4014 is added to the cache, and the ELB4016 is deleted. ELB4016 does not have a dependent resource, and ELB4016 is deleted. Return to the previous step, continue to search for the dependent resources of the cloud host 4014, and there is a dependent resource elastic file 401 5. It is determined whether elastic file 4015 has dependent resources. Since elastic file 4015 does not have dependent resources, elastic file 4015 is deleted, and the process returns to continue processing cloud host 4014. At this time, cloud host 4014 does not have dependent resources. Cloud host 4014 is taken out of the cache, cloud host 4014 is deleted, and the cache is read in the subsequent order to determine whether subnet 4012 still has a dependent relationship. It is found that subnet 4012 still has a dependent resource relation database 4013, and relation database 4013 is deleted. Since the dependent resources ELB4016 and elastic file 4015 of relation database 4013 have been deleted, relation database 4013 has no dependent resources at this time and is directly deleted. At this time, subnet 4012 does not have dependent resources. Subnet 4012 is taken out of the cache, subnet 4012 is deleted, and the cache is read in the subsequent order to delete network 4011. At this time, network 4011 does not have dependent resources and can be directly taken out of the cache for deletion. Finally, VPC 401 is released to complete the resource cleanup.

Automatic resource cleanup based on preset resource cleanup time or received resource cleanup requests can release resource space in a timely manner and reduce the impact of insufficient resources on the test progress. Recursive deletion through dependencies can achieve resource cleanup to the greatest extent possible. Some data resources that may be automatically generated during resource utilization can also be cleaned up, avoiding omissions in manual cleanup and saving time and manpower.

Further, please refer to FIG5, which is a schematic diagram of the structure of a recursive resource cleaning device provided by an embodiment of the present invention. As shown in FIG5, the recursive resource cleaning device 1 can be applied to the server in the embodiment corresponding to FIG1 above, and the recursive resource cleaning device 1 can include: a traversal processing module 10, a storage module 20, a deletion module 30, a judgment module 40, a setting module 50 and a feedback module 60;

The traversal processing module 10 is used to traverse the resources, find the basic data resources that are not marked as reserved, and store the resource information of the basic data resources in the storage module 20;

The storage module 20 is used to store the resource information and resource cleaning results of the above basic data resources;

The deleting module 30 is used to delete the first resource if no dependent resource of the first resource is found in the system where the first resource is located, and if at least one dependent resource of the first resource is found in the system where the first resource is located, respectively use the at least one dependent resource of the first resource as the first resource to perform the above step of searching for the dependent resource of the first resource in the system where the first resource is located according to the first resource identifier, and store the resource cleaning result in the storage module 20;

A determination module 40 is used to determine whether the basic data resource is set to be retained, whether the first resource has dependent resources, and whether all resources are cleared;

A setting module 50, used to obtain the specified time for deleting resources set by the user and whether the basic data resources are to be retained;

The feedback module 60 is used to feed back the resource cleaning result stored in the storage module 20 to the user after the resource cleaning is completed. The resource cleaning result includes the resource deletion result.

Among them, the traversal processing module 10 searches for basic data resources that are not set to be retained by obtaining data from the setting module 50. The specific functional implementation method can refer to steps S101 and S103 in the embodiment corresponding to Figure 1 above; the judgment module 40 includes judging whether the basic data resources are set to be retained according to the basic data resource retention setting result of the setting module 50. The specific functional implementation method of the judgment module 40 and the deletion module 30 can refer to steps S103-S107 in the embodiment corresponding to Figure 1 above, which will not be repeated here.

See Figure 6, which is a schematic diagram of the structure of the server provided in the embodiment of the present application. As shown in Figure 6, the server in this embodiment may include: one or more processors 601 and a memory 602. The processor 601 and the memory 602 are connected via a bus 603. The memory 602 is used to store a computer program, which includes program instructions. The processor 601 is used to execute the program instructions stored in the memory 602 to perform the following operations:

Determining whether the basic data resource is set to be reserved, and if the basic data resource is not set to be reserved, determining the basic data resource to be the first resource;

Searching for a dependent resource of the first resource in the system where the first resource is located according to the resource identifier of the first resource, wherein the dependent resource of the first resource is a data resource that references the first resource when it is generated;

If at least one dependent resource of the first resource is found in the system where the first resource is located, the step of searching for the dependent resource of the first resource in the system where the first resource is located according to the resource identifier of the first resource is performed using the at least one dependent resource of the first resource as the first resource;

If the dependent resources of the first resource are not found in the system where the first resource is located, the first resource is deleted, and the dependent resources of the first resource are used as the first resource to execute the step of searching for the dependent resources of the first resource in the system where the first resource is located according to the resource identifier of the first resource.

In some feasible implementations, the resource identifier of the first resource includes a reference identifier of the first resource, and the processor 601 is configured to:

According to the reference identifier of the first resource, searching in the system where the first resource is located other data resources whose resource names include the reference identifier of the first resource as dependent resources of the first resource;

Alternatively, other data resources whose resource contents include the reference identifier of the first resource are searched in the system where the first resource is located according to the reference identifier of the first resource as dependent resources of the first resource.

In some feasible implementations, the processor 601 is configured to:

Determine whether the basic data resource carries a preset retention tag, and if so, determine that the basic data resource is set to be retained, otherwise, determine that the basic data resource is not set to be retained; or

The Boolean flag of the basic data resource is read, and if the Boolean flag of the basic data resource is a true value, it is determined that the basic data resource is set to be reserved, otherwise it is determined that the basic data resource is not set to be reserved.

In some feasible implementations, the processor 601 is further configured to:

If it is determined that the preset resource cleanup time has arrived or a resource cleanup instruction has been received, the above step of determining whether the basic data resource is set to be retained is triggered.

In some feasible implementations, the processor 601 is configured to:

Extracting resource information of the first resource, where the resource information of the first resource includes an ID of the first resource, where the ID of the first resource is used to indicate a storage address of the first resource;

The corresponding resource deletion method is called according to the resource type of the first resource, and the id of the first resource is used as a calling parameter of the resource deletion method to delete the first resource.

In some feasible implementation manners, the information of the first resource further includes a user account for creating the first resource; and the processor 601 is further configured to:

The deletion result of the first resource is fed back to the user who created the first resource according to the user account who created the first resource, and the deletion result includes deletion failure information or deletion success information.

In some feasible implementations, the above basic data resource is a virtual private cloud (VPC, Virtual Private Cloud).

In some feasible implementations, the processor 601 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc.

The processor 602 may include a read-only memory and a random access memory, and provide instructions and data to the processor 601. A portion of the processor 602 may also include a non-volatile random access memory. For example, the memory 602 may also store information about the server type.

In a specific implementation, the server can execute the implementation methods provided in the steps of FIG. 1 through its built-in functional modules. For details, please refer to the implementation methods provided in the steps, which will not be described again.

In an embodiment of the present application, the server can automatically perform resource cleaning operations according to a preset resource cleaning time or a received resource cleaning request, use a full traversal method to obtain basic data resources that do not reference other data resources, and use this basic data resource as a basis to find the direct or indirect dependent resources of the basic data resource. According to the above-mentioned dependency relationship, use a recursive access method to start deleting dependent resources that have not been referenced by other data resources, clear data resources in sequence, and finally delete the basic data resources after all dependent resources have been deleted. The above-mentioned processing process is similar to a tree structure, and post-order traversal deletion is performed to clean up resources to the greatest extent and reduce the occurrence of resource omissions. At the same time, when searching for basic data resources, it is determined whether the above-mentioned basic data resources are set to be retained. If they are set to be retained, no processing is performed, thereby avoiding the accidental deletion of important resources, and the automatic cleaning operation saves time and manpower to ensure sufficient resources.

An embodiment of the present application also provides a computer-readable storage medium, which stores a computer program. The computer program includes program instructions. When the program instructions are executed by a processor, the recursive resource cleaning method provided in each step of Figure 1 is implemented. For details, please refer to the implementation methods provided in the above steps, which will not be repeated here.

The computer-readable storage medium may be the recursive resource cleaning device or the internal storage unit or external storage device of the server provided in any of the above embodiments. The computer-readable storage medium is used to store the computer program and other programs and data required by the server. The computer-readable storage medium may also be used to temporarily store data that has been output or is to be output.

The term "first" in the claims, specification and drawings of the present application is used to indicate the current processing object, and does not have a specific meaning. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally includes steps or units that are not listed, or optionally includes other steps or units inherent to these processes, methods, products or devices. Mentioning "embodiment" in this article means that the specific features, structures or characteristics described in conjunction with the embodiment may be included in at least one embodiment of the present application. Displaying the phrase at various positions in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments. The term "and/or" used in the specification and the attached claims of the present application refers to any combination of one or more of the items listed in association and all possible combinations, and includes these combinations.

The above disclosure is only a preferred embodiment of the present invention, which certainly cannot be used to limit the scope of the present invention. Therefore, equivalent changes made according to the claims of the present invention are still within the scope of the present invention.

Claims (9)

1. A recursive resource cleaning method, comprising: After determining that the preset resource cleanup time has arrived, search for a basic data resource, the basic data resource does not contain resource identifiers of other data resources, does not reference other data resources when generated, and the basic data resource does not depend on other data resources, and judge whether the basic data resource carries a preset retention tag, if so, determine that the basic data resource is set to be retained, otherwise determine that the basic data resource is not set to be retained; or read the Boolean mark of the basic data resource, if the Boolean mark of the basic data resource is a true value, determine that the basic data resource is set to be retained, otherwise determine that the basic data resource is not set to be retained; if the basic data resource is not set to be retained, determine that the basic data resource is the first resource; Searching for a dependent resource of the first resource in a system where the first resource is located according to the resource identifier of the first resource, wherein the dependent resource of the first resource is a data resource that references the first resource and contains the resource identifier of the first resource when generated; If at least one dependent resource of the first resource is found in the system where the first resource is located, the step of searching for the dependent resource of the first resource in the system where the first resource is located according to the resource identifier of the first resource is performed using the at least one dependent resource of the first resource as the first resource; If the dependent resources of the first resource are not found in the system where the first resource is located, the first resource is deleted, and the dependent resources of the first resource are used as the first resource to execute the step of searching for the dependent resources of the first resource in the system where the first resource is located according to the resource identifier of the first resource. 2. The method according to claim 1, wherein the resource identifier of the first resource comprises a reference identifier of the first resource, and searching for a dependent resource of the first resource in a system where the first resource is located according to the resource identifier of the first resource comprises: According to the reference identifier of the first resource, searching in the system where the first resource is located for other data resources whose resource names include the reference identifier of the first resource as dependent resources of the first resource; Alternatively, other data resources whose resource contents include the reference identifier of the first resource are searched in the system where the first resource is located according to the reference identifier of the first resource as dependent resources of the first resource. 3. The method according to claim 1, characterized in that before the determining whether the basic data resource is set to be reserved, the step further comprises: If it is determined that the preset resource cleanup time has arrived or a resource cleanup instruction has been received, the step of determining whether the basic data resource is set to be retained is triggered. 4. The method according to claim 1, wherein deleting the first resource comprises: Extracting resource information of the first resource, where the resource information of the first resource includes an ID of the first resource, where the ID of the first resource is used to indicate a storage address of the first resource; The corresponding resource deletion method is called according to the resource type of the first resource, and the id of the first resource is used as a calling parameter of the resource deletion method to delete the first resource. 5. The method according to claim 4, wherein the information of the first resource further includes a user account for creating the first resource; The method further includes calling a corresponding resource deletion method according to the resource type of the first resource, and using the ID of the first resource as a calling parameter of the resource deletion method, and after deleting the first resource, the method further includes: A deletion result of the first resource is fed back to the user who created the first resource according to the user account who created the first resource, where the deletion result includes deletion failure information or deletion success information. 6. The method according to claim 1, characterized in that the basic data resource is a virtual private cloud. 7. A recursive resource cleaning device, comprising: A traversal processing module is used to traverse resources after determining that a preset resource cleanup time has been reached, search for basic data resources that are not marked for retention, the basic data resources do not contain resource identifiers of other data resources, do not reference other data resources when generated, the basic data resources do not depend on other data resources, and store resource information of the basic data resources in a storage module; A storage module, used to store the information of the basic data resources and resource cleaning results; a deletion module, configured to delete the first resource if no dependent resource of the first resource is found in the system where the first resource is located, wherein the dependent resource of the first resource is a data resource that references the first resource during generation and contains a resource identifier of the first resource, and if at least one dependent resource of the first resource is found in the system where the first resource is located, respectively use the at least one dependent resource of the first resource as the first resource to execute the step of searching for the dependent resource of the first resource in the system where the first resource is located according to the first resource identifier; A judgment module, used to judge whether the basic data resource carries a preset retention tag, and if so, determine that the basic data resource is set to be retained, otherwise determine that the basic data resource is not set to be retained, or read the Boolean tag of the basic data resource, and if the Boolean tag of the basic data resource is a true value, determine that the basic data resource is set to be retained, otherwise determine that the basic data resource is not set to be retained, judge whether the current resource has dependent resources, and judge whether all resources are cleared; A setting module, used to obtain the specified time for deleting resources set by the user and whether the basic data resources are to be retained; The feedback module is used to feed back the resource cleaning result to the user after the resource cleaning is completed, and the resource cleaning result includes the resource deletion result. 8. A recursive resource cleaning device, comprising: a processor and a memory; The processor is connected to the memory, wherein the memory is used to store program codes, and the processor is used to call the program codes to execute the method according to any one of claims 1-6. 9. A computer storage medium, characterized in that the computer storage medium stores computer program instructions, and when the computer program instructions are executed by a processor, they are used to process the method according to any one of claims 1 to 6.