https://bugs.freebsd.org/bugzilla/show_bug.cgi?id=239672
Conrad Meyer <[email protected]> changed: What |Removed |Added ---------------------------------------------------------------------------- CC| |[email protected] --- Comment #1 from Conrad Meyer <[email protected]> --- This change is not correct. Nodes are actually in a tree topology and remove_node() will release parent nodes as it goes, potentially invalidating the traverse (even with FOREACH_SAFE). The code could be refactored to mark removed nodes as a first pass, and then remove them in a second pass (with plain TAILQ_FOREACH_SAFE). This alternative would avoid wasted work for nodes that are never removed (which is probably the goal of the proposed change), but not break the algorithm. -- You are receiving this mail because: You are the assignee for the bug. _______________________________________________ [email protected] mailing list https://lists.freebsd.org/mailman/listinfo/freebsd-bugs To unsubscribe, send any mail to "[email protected]"
