In near future we will need to walk through the list of internal
drivers in reversed order. The simplest solution is to turn
singly linked list into a doubly linked list.
We will not need to start from the end really, so there's no tail
pointer kept.
Signed-off-by: Michal Privoznik <mprivozn@redhat.com>
Reviewed-by: Cole Robinson <crobinso@redhat.com>
struct _virSecurityStackItem {
virSecurityManagerPtr securityManager;
virSecurityStackItemPtr next;
+ virSecurityStackItemPtr prev;
};
struct _virSecurityStackData {
if (VIR_ALLOC(item) < 0)
return -1;
item->securityManager = nested;
+ item->prev = tmp;
if (tmp)
tmp->next = item;
else