Refer to tree.3 from queue.3, and the other way around.
Index: share/man/man3/queue.3
===================================================================
RCS file: /cvs/src/share/man/man3/queue.3,v
retrieving revision 1.63
diff -u -p -r1.63 queue.3
--- share/man/man3/queue.3 19 Nov 2015 13:38:07 -0000 1.63
+++ share/man/man3/queue.3 13 Mar 2016 09:57:24 -0000
@@ -918,6 +918,8 @@ while ((np = TAILQ_FIRST(&head))) {
}
.Ed
+.Sh SEE ALSO
+.Xr tree 3
.Sh NOTES
It is an error to assume the next and previous fields are preserved
after an element has been removed from a list or queue.
Index: share/man/man3/tree.3
===================================================================
RCS file: /cvs/src/share/man/man3/tree.3,v
retrieving revision 1.27
diff -u -p -r1.27 tree.3
--- share/man/man3/tree.3 10 Nov 2015 23:48:17 -0000 1.27
+++ share/man/man3/tree.3 13 Mar 2016 09:57:24 -0000
@@ -549,6 +549,8 @@ main()
return (0);
}
.Ed
+.Sh SEE ALSO
+.Xr queue 3
.Sh NOTES
Trying to free a tree in the following way is a common error:
.Bd -literal -offset indent
--
Michal Mazurek
