Method to detect unbounded growth of linked lists in a running application

   
   

A method for detecting memory leakage of a linked list in a running program, includes saving current size of the linked list as a new maximum size of the linked list when a new element is added to the linked list that causes the current size of the linked list to exceed a former maximum size of the linked list, determining whether a first pre-determined period of time has elapsed from when the liked list was created, and determining whether the new maximum size of the linked list exceeds the former maximum size of the linked list during a second pre-determined period of time.

 
Web www.patentalert.com

< Method and apparatus for providing multiple-version support for highly available objects

< Method for displaying variable values within a software debugger

> Method, system and program product for determining differences between an existing graphical user interface (GUI) mapping file and a current GUI

> Handling calls from relocated instrumented functions to functions that expect a return pointer value in an original address space

~ 00179