Skip to content

Add support for user linked lists without size specifier in xml #68

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

ariaci
Copy link

@ariaci ariaci commented Jan 21, 2025

This is the second implementation not using mreader in ForEachElement - see closed pull request #67 for more ...

In some legacy C++-code linked lists are implemented without having a size-member or -field. That's why it's very difficult to display these polygons - sometimes impossible because graphical debugger doesn't know something about the number of nodes or polygons.

This commit adds support for linked lists without specifiying the Size-trait in LinkedList-node.
With this modification Graphical Debugger stops iterating at last element. The last node is determined by a null-node or the initial head-element. In this way you are also able to iterate through circular linked lists.

<Ring Id="MyRing">
  <Points>
    <LinkedList>
      <Size>???????</Size>
      <HeadPointer>&amp;head</HeadPointer>
      <NextPointer>next</NextPointer>
      <Value>*this</Value>
    </LinkedList>
  </Points>
</Ring>

The above shown example using MyRing without a size member could be displayed in graphical debugger by the following code:

<Ring Id="MyRing">
  <Points>
    <LinkedList>
      <HeadPointer>&amp;head</HeadPointer>
      <NextPointer>next</NextPointer>
      <Value>*this</Value>
    </LinkedList>
  </Points>
</Ring>

…rating lists will end with defined head-element or nullptr-element
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants