StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POHow to dynamically cascade double linked lists
primarykey
Id
11706821
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
2
CommunityOwnedDate
CreationDate
2012-07-29T05:03:46.147
FavoriteCount
0
LastActivityDate
2012-07-29T05:33:24.277
LastEditDate
2012-07-29T05:33:24.277
LastEditorUserId
303549
OwnerUserId
303549
ParentId
0
PostTypeId
1
Score
0
ViewCount
105
LastEditorDisplayName
text
Body
I'm creating double linked lists and each entry of the list could have another list inside. The struct: <pre><code>struct symTabEntry { char *name; symTabEntry *scope; symTabEntry *head; symTabEntry *vader; symTabEntry *next; symTabEntry *prev; }; </code></pre> Pointers to specific elements: <pre><code>symTabEntry **currentHead; //Points to the head of the current scope symTabEntry **currentVader; //Points to the vader head element of the current scope </code></pre> Since I'm working with the utlist.h library I always have to provide the pointer the the head element of the list I'm currently working on to add entries or iterate over all entries. The problem is when I'm adding a entry I want to switch to the scope of the current entry and add the next entries inside the new scope and later try to output the vader of subscope elements, I'm getting a segmentation fault. The vader element provided as parameter is the latest added entry and new entries are always added to the currentHead. Function to switch scope: <pre><code>void newFunctionScope(symTabEntry *vader) { currentVader = &vader; currentHead = &vader->scope; } </code></pre> Error occurs when accessing foundEntry->vader: <pre><code>void printSymboltable(symTabEntry *entry) { symTabEntry *foundEntry; DL_FOREACH(entry, foundEntry) { printf("%s\t%d\t%d\t%d\t%s\t%s", foundEntry->name, foundEntry->line, foundEntry->offset, foundEntry->parameter, types[foundEntry->type], types[foundEntry->internType]); if(foundEntry->vader != NULL) { printf("\t%s\n", foundEntry->vader->name); } else { printf("\n"); } if(foundEntry->scope != NULL) { printSymboltable(foundEntry->scope); } } } </code></pre> Complete source code: <a href="http://pastebin.com/nNp98i3e" rel="nofollow">http://pastebin.com/nNp98i3e</a> Or any other suggestions? Thanks for help!
Tags
<c>
Title
How to dynamically cascade double linked lists
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USPascal Bayer
UserOwnerUserId
1. USPascal Bayer
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. COYes, I have a suggestion: when asking for review of your code on an english-language forum, please comment your code in english. Another suggestion: break the code down into a non-working example so that we don't have to slog through a whole lot to help you. And, finally, give us some idea where in the code you're getting the segfault.
 singulars
 PostPostId
 POHow to dynamically cascade double linked lists
 UserUserId
 UStbert
2. COPost edited, thanks!
 singulars
 PostPostId
 POHow to dynamically cascade double linked lists
 UserUserId
 USPascal Bayer

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.