Keep data for inactive nodes but drop from topology

src/utils/liblist.h

@@ -47,4 +47,9 @@ void merge_sort(void *priv, struct list_head *head,
 #define list_sort	merge_sort
 #endif
 
+#define list_for_each_active_entry(p, head, field) \
+	for (p = list_first_entry(head, typeof(*p), field); &p->field != (head); \
+	     p = list_entry(p->field.next, typeof(*p), field)) \
+	     if (p->is_active)
+
 #endif /* LIBLIST_H */