1# $NetBSD: Makefile,v 1.27 2005/09/30 20:55:26 rpaulo Exp $ 2# @(#)Makefile 8.2 (Berkeley) 12/13/93 3 4MAN= _DIAGASSERT.3 assert.3 bitstring.3 dlfcn.3 end.3 intro.3 queue.3 \ 5 stdarg.3 sysexits.3 tree.3 varargs.3 6MLINKS+=end.3 edata.3 end.3 etext.3 7MLINKS+=queue.3 LIST_HEAD.3 \ 8 queue.3 LIST_HEAD_INITIALIZER.3 \ 9 queue.3 LIST_ENTRY.3 \ 10 queue.3 LIST_INIT.3 \ 11 queue.3 LIST_INSERT_AFTER.3 \ 12 queue.3 LIST_INSERT_BEFORE.3 \ 13 queue.3 LIST_INSERT_HEAD.3 \ 14 queue.3 LIST_REMOVE.3 \ 15 queue.3 LIST_FOREACH.3 \ 16 queue.3 LIST_EMPTY.3 \ 17 queue.3 LIST_FIRST.3 \ 18 queue.3 LIST_NEXT.3 19MLINKS+=queue.3 SLIST_HEAD.3 \ 20 queue.3 SLIST_HEAD_INITIALIZER.3 \ 21 queue.3 SLIST_ENTRY.3 \ 22 queue.3 SLIST_INIT.3 \ 23 queue.3 SLIST_INSERT_AFTER.3 \ 24 queue.3 SLIST_INSERT_HEAD.3 \ 25 queue.3 SLIST_REMOVE_HEAD.3 \ 26 queue.3 SLIST_REMOVE.3 \ 27 queue.3 SLIST_FOREACH.3 \ 28 queue.3 SLIST_EMPTY.3 \ 29 queue.3 SLIST_FIRST.3 \ 30 queue.3 SLIST_NEXT.3 31MLINKS+=queue.3 STAILQ_HEAD.3 \ 32 queue.3 STAILQ_HEAD_INITIALIZER.3 \ 33 queue.3 STAILQ_ENTRY.3 \ 34 queue.3 STAILQ_INIT.3 \ 35 queue.3 STAILQ_INSERT_HEAD.3 \ 36 queue.3 STAILQ_INSERT_TAIL.3 \ 37 queue.3 STAILQ_INSERT_AFTER.3 \ 38 queue.3 STAILQ_REMOVE_HEAD.3 \ 39 queue.3 STAILQ_REMOVE.3 \ 40 queue.3 STAILQ_FOREACH.3 \ 41 queue.3 STAILQ_EMPTY.3 \ 42 queue.3 STAILQ_FIRST.3 \ 43 queue.3 STAILQ_NEXT.3 44MLINKS+=queue.3 SIMPLEQ_HEAD.3 \ 45 queue.3 SIMPLEQ_HEAD_INITIALIZER.3 \ 46 queue.3 SIMPLEQ_ENTRY.3 \ 47 queue.3 SIMPLEQ_INIT.3 \ 48 queue.3 SIMPLEQ_INSERT_HEAD.3 \ 49 queue.3 SIMPLEQ_INSERT_TAIL.3 \ 50 queue.3 SIMPLEQ_INSERT_AFTER.3 \ 51 queue.3 SIMPLEQ_REMOVE_HEAD.3 \ 52 queue.3 SIMPLEQ_REMOVE.3 \ 53 queue.3 SIMPLEQ_FOREACH.3 \ 54 queue.3 SIMPLEQ_EMPTY.3 \ 55 queue.3 SIMPLEQ_FIRST.3 \ 56 queue.3 SIMPLEQ_NEXT.3 57MLINKS+=queue.3 TAILQ_HEAD.3 \ 58 queue.3 TAILQ_HEAD_INITIALIZER.3 \ 59 queue.3 TAILQ_ENTRY.3 \ 60 queue.3 TAILQ_INIT.3 \ 61 queue.3 TAILQ_INSERT_HEAD.3 \ 62 queue.3 TAILQ_INSERT_TAIL.3 \ 63 queue.3 TAILQ_INSERT_AFTER.3 \ 64 queue.3 TAILQ_INSERT_BEFORE.3 \ 65 queue.3 TAILQ_REMOVE.3 \ 66 queue.3 TAILQ_FOREACH.3 \ 67 queue.3 TAILQ_FOREACH_REVERSE.3 \ 68 queue.3 TAILQ_EMPTY.3 \ 69 queue.3 TAILQ_FIRST.3 \ 70 queue.3 TAILQ_NEXT.3 \ 71 queue.3 TAILQ_LAST.3 \ 72 queue.3 TAILQ_PREV.3 73MLINKS+=queue.3 CIRCLEQ_HEAD.3 \ 74 queue.3 CIRCLEQ_HEAD_INITIALIZER.3 \ 75 queue.3 CIRCLEQ_ENTRY.3 \ 76 queue.3 CIRCLEQ_INIT.3 \ 77 queue.3 CIRCLEQ_INSERT_AFTER.3 \ 78 queue.3 CIRCLEQ_INSERT_BEFORE.3 \ 79 queue.3 CIRCLEQ_INSERT_HEAD.3 \ 80 queue.3 CIRCLEQ_INSERT_TAIL.3 \ 81 queue.3 CIRCLEQ_REMOVE.3 \ 82 queue.3 CIRCLEQ_FOREACH.3 \ 83 queue.3 CIRCLEQ_FOREACH_REVERSE.3 \ 84 queue.3 CIRCLEQ_EMPTY.3 \ 85 queue.3 CIRCLEQ_FIRST.3 \ 86 queue.3 CIRCLEQ_LAST.3 \ 87 queue.3 CIRCLEQ_NEXT.3 \ 88 queue.3 CIRCLEQ_PREV.3 89MLINKS+=stdarg.3 va_arg.3 stdarg.3 va_copy.3 \ 90 stdarg.3 va_end.3 stdarg.3 va_start.3 91MLINKS+=dlfcn.3 dlopen.3 dlfcn.3 dlclose.3 dlfcn.3 dlsym.3 dlfcn.3 dlctl.3 \ 92 dlfcn.3 dlerror.3 dlfcn.3 dladdr.3 93MLINKS+=tree.3 SPLAY_PROTOTYPE.3 tree.3 SPLAY_GENERATE.3 \ 94 tree.3 SPLAY_ENTRY.3 tree.3 SPLAY_HEAD.3 \ 95 tree.3 SPLAY_INITIALIZER.3 tree.3 SPLAY_ROOT.3 \ 96 tree.3 SPLAY_EMPTY.3 tree.3 SPLAY_NEXT.3 \ 97 tree.3 SPLAY_MIN.3 tree.3 SPLAY_MAX.3 tree.3 SPLAY_FIND.3 \ 98 tree.3 SPLAY_LEFT.3 tree.3 SPLAY_RIGHT.3 tree.3 SPLAY_INIT.3 \ 99 tree.3 SPLAY_INSERT.3 tree.3 SPLAY_REMOVE.3 \ 100 tree.3 SPLAY_FOREACH.3 101MLINKS+=tree.3 RB_PROTOTYPE.3 tree.3 RB_GENERATE.3 \ 102 tree.3 RB_ENTRY.3 tree.3 RB_HEAD.3 \ 103 tree.3 RB_INITIALIZER.3 tree.3 RB_ROOT.3 \ 104 tree.3 RB_EMPTY.3 tree.3 RB_NEXT.3 \ 105 tree.3 RB_MIN.3 tree.3 RB_MAX.3 tree.3 RB_FIND.3 \ 106 tree.3 RB_LEFT.3 tree.3 RB_RIGHT.3 tree.3 RB_PARENT.3 \ 107 tree.3 RB_INIT.3 tree.3 RB_INSERT.3 tree.3 RB_REMOVE.3 \ 108 tree.3 RB_FOREACH.3 109 110.include <bsd.man.mk> 111.include <bsd.subdir.mk> 112