[Bug 239672] gcov: Optimize list traverse by two passes

[bugzilla-noreply at freebsd.org]

https://bugs.freebsd.org/bugzilla/show_bug.cgi?id=239672

--- Comment #4 from Chuhong Yuan <hslester96 at gmail.com> ---
(In reply to Conrad Meyer from comment #3)
I just find this algorithm is a little strange and has redundant operations.

I am not very clear about how to revise it...
remove_node() will remove the node from "all_head" list and free the node, so
how to call it in the first pass but just mark the nodes for removal and do not
remove or free the nodes?

-- 
You are receiving this mail because:
You are the assignee for the bug.