Linked list management method based on reference counting

Abstract

A linked list management method based on reference counting comprises the steps of setting a reference counting value and a linked list protected by reference counting, nodes in the linked list at least comprise one link pointer, and the nodes are connected through the link pointer. The method further comprises the steps that a plurality of access threads read data from the linked list at the sametime, one management thread is responsible for adding or deleting nodes to the linked list, and one recovery thread releases memory resources of the deleted nodes. In the initial state, the referencecount value is 1 to represent the initial reference count of the management thread to the linked list; before reading the data in the linked list, the access thread firstly adds 2 to the reference count value in an atomization manner; if the quotation count value is not 0 before 2 is added, 2 is subtracted from the quotation count value in an atomization mode after the process of reading the linked list data is completed, and if the quotation count value is 0 before 2 is added, 1 is subtracted from the quotation count value in the atomization mode after the process of reading the linked listdata is completed.

Description

technical field [0001] The invention relates to the field of computer system software programming, in particular to a linked list management method based on reference counting. Background technique [0002] A linked list is a commonly used data structure in a computer system. Usually, there is no problem with multiple threads accessing and reading the data of each node of the linked list at the same time. There is no data exception of access conflict between multiple threads. When multiple threads add or delete nodes to the linked list at the same time, it is necessary to use the lock (Lock) mechanism to ensure the integrity of the linked list structure, that is, the linked list structure can only be modified after a thread successfully obtains the lock. Conventional locks will cause only one thread to access or modify the linked list at any time, and the efficiency will be greatly reduced. At present, the commonly used improvement scheme is to use the read-write lock (RWLo...

AI Technical Summary

Problems solved by technology

Although in theory a separate management thread is used to modify the linked list structure, other threads can access and read the data in the linked list at the same time without the protection of any lock mechanism, but this will lead to another problem. It is absolutely safe to add nodes to the linked list, and the actual process of deleting nodes will eventually release the memory resources of the deleted nodes. If a thread is still accessing and reading the data of this node at this time, it will lead to invalid memory access

Images