Single-process dynamic storage management method based on Hash table

Abstract

The present invention discloses a single-process dynamic storage management method based on a Hash table, which comprises: initializing the Hash table; applying for a dynamic memory; releasing the dynamic memory; carrying out real-time routing inspection; creating an empty Hash table; and storing dynamic storage applying information. In the dynamic memory applying process, related information of applying for the memory is stored into the Hash table and overflow flags are set; in the dynamic memory releasing process, the Hash table is searched, the memory is released if related pointers are searched, or an alarm is given; and in the real-time routing inspection and calling process, whether overflow of the dynamic memory exists or not is judged; by checking overflow flag words in memory areas in Hash table nodes one by one, the sizes of all memory spaces in the Hash table are added, the sum of the memory spaces is stored according to the frequency of storing for once at intervals of one hour, and whether the memory overflow risk exists or not is judged. According to the present invention, progress idle time is used to monitor and check the use condition of the dynamic memory in real time, a monitoring result is sent to a frame by a message queue, the frame takes charge of carrying out organizing and providing an inquiring function, and the single-process dynamic storage management method has wide application prospect.

Description

technical field [0001] The invention belongs to the technical field of dynamic memory management of an embedded system, and in particular relates to a single-process dynamic storage management method based on a hash table. Background technique [0002] The memory management module of the existing embedded system is mainly responsible for the allocation, recycling and swapping in and out of memory units. Among them, "allocation" is responsible for selecting a suitable memory unit from the free memory unit list when the process applies for a memory unit from the system Assigned to the process; "recycling" is responsible for putting the released memory unit back into the free memory unit list when the process releases the memory unit, and doing appropriate defragmentation; "swapping out" is responsible for not urgent when the physical memory is insufficient Process data or codes are first stored in external memory (disk, etc.), so that the memory units they occupy are freed up ...

AI Technical Summary

Problems solved by technology

[0004] The technical problem solved by the present invention is to overcome the existing problem that in the application layer program debugging, when the program dynamic memory overflows, it is impossible to detect in real time, and there is no means for real-time monitoring of memory leaks, and it is impossible to accurately locate the location of memory overflow and leaked codes

Images