Heap Walker Reference View - Reference Graph | ![]() ![]() ![]() |
![]() |
There is always one instance visible at a time whose class name or array type is
given above the field table. Above the upper right corner of the table,
![]() ![]() The instance navigation is linked among the following views of the heap walker: This allows you to easily switch back and forth between these views while keeping the focus on the same object. |
![]() |
The order of the instances in the object set can be adjusted to
Please see the key concepts of the heap walker for an explanation of the different size types. Sorting can take a few seconds, depending on the size of the heap. The exclusive deep size sort mode is the computationally most expensive one. A progress dialog is shown while the objects are sorted. If the operation takes longer than the configured timeout, the operation will return with a report about the amount of work done. In that case, there will be a partial sorting. After changing the sort order, the displayed index is set to one. |
![]() |
The references graph has the following properties:
By default, the reference graph only shows the direct incoming and outgoing references of the current instance. You can expand the graph by double clicking on any object. This will expand either the direct incoming or the outgoing references for that object, depending on the direction you're moving in. Selective actions for expanding the graph are available in the view-specific toolbar and the context menu:
If applicable, an instance has
plus and minus signs at the left and the right side to show or hide
incoming and outgoing references. The controls at the left side are
for incoming, the controls at the right side for outgoing references. The plus signs have the same effect
as the Additionally, the plus and minus signs give you the following indications:
To reset the graph to its original state, you can choose Reset graph from the context menu. The reference graph offers a number of navigation and zoom options. |
![]() |
To check why an instance is not garbage collected, you can select it and use the
![]() A dialog will ask you whether to search for a single garbage collector root or for all roots. After that, the paths to root are searched. This is a computationally expensive operation and can take some time. A progress dialog is shown while the paths to root are calculated. If the operation takes longer than the configured timeout, the operation will return with a report about the amount of work done. In that case, all garbage collector roots found so far will be displayed.
|
![]() | Each object is optionally annotate with an object ID. With this ID, you can check whether two objects are the same or not. The display of IDs can be switched of the the context menu, the View menu and the view settings of the heap walker. |
![]() |
There are four layout strategies for showing the reference graph which can be chosen
by clicking on ![]()
|
![]() |
To add a selection step from this view you can select one or multiple objects and click the
[Use ...] button above the graph and choose in the popup menu. There is a corresponding entry
in the context menu. Multiple objects are selected by keeping the SHIFT key pressed during selection.
The following selection modes are available:
After your selection, the view helper dialog will assist you in choosing the appropriate view for the new object set. |
![]() ![]() ![]() |