Date: Thu, 08 Aug 2019 02:28:03 +0000 From: bugzilla-noreply@freebsd.org To: bugs@FreeBSD.org Subject: [Bug 239672] gcov: Optimize list traverse by two passes Message-ID: <bug-239672-227-wLklEGXwoH@https.bugs.freebsd.org/bugzilla/> In-Reply-To: <bug-239672-227@https.bugs.freebsd.org/bugzilla/> References: <bug-239672-227@https.bugs.freebsd.org/bugzilla/>
next in thread | previous in thread | raw e-mail | index | archive | help
https://bugs.freebsd.org/bugzilla/show_bug.cgi?id=3D239672 --- Comment #4 from Chuhong Yuan <hslester96@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? --=20 You are receiving this mail because: You are the assignee for the bug.=
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?bug-239672-227-wLklEGXwoH>