1# $OpenBSD: Makefile,v 1.28 2015/11/19 13:38:07 millert Exp $ 2# @(#)Makefile 8.2 (Berkeley) 12/13/93 3 4MAN= assert.3 bitstring.3 CMSG_DATA.3 dlfcn.3 dl_iterate_phdr.3 end.3 \ 5 intro.3 makedev.3 offsetof.3 queue.3 stdarg.3 sysexits.3 tree.3 6MLINKS+=bitstring.3 bit_alloc.3 bitstring.3 bit_clear.3 \ 7 bitstring.3 bit_decl.3 bitstring.3 bit_ffc.3 bitstring.3 bit_ffs.3 \ 8 bitstring.3 bit_nclear.3 bitstring.3 bit_set.3 \ 9 bitstring.3 bit_size.3 bitstring.3 bit_test.3 bitstring.3 bit_nset.3 \ 10 bitstring.3 bitstr_size.3 11MLINKS+=CMSG_DATA.3 CMSG_FIRSTHDR.3 CMSG_DATA.3 CMSG_LEN.3 \ 12 CMSG_DATA.3 CMSG_NXTHDR.3 CMSG_DATA.3 CMSG_SPACE.3 13MLINKS+=end.3 edata.3 end.3 etext.3 14MLINKS+=makedev.3 major.3 makedev.3 minor.3 15MLINKS+=queue.3 SLIST_ENTRY.3 queue.3 SLIST_HEAD.3 \ 16 queue.3 SLIST_HEAD_INITIALIZER.3 queue.3 SLIST_FIRST.3 \ 17 queue.3 SLIST_NEXT.3 queue.3 SLIST_EMPTY.3 \ 18 queue.3 SLIST_FOREACH.3 queue.3 SLIST_FOREACH_SAFE.3 \ 19 queue.3 SLIST_INIT.3 \ 20 queue.3 SLIST_INSERT_AFTER.3 queue.3 SLIST_INSERT_HEAD.3 \ 21 queue.3 SLIST_REMOVE_AFTER.3 queue.3 SLIST_REMOVE_HEAD.3 \ 22 queue.3 SLIST_REMOVE.3 23MLINKS+=queue.3 LIST_ENTRY.3 queue.3 LIST_HEAD.3 \ 24 queue.3 LIST_HEAD_INITIALIZER.3 queue.3 LIST_FIRST.3 \ 25 queue.3 LIST_NEXT.3 \ 26 queue.3 LIST_EMPTY.3 queue.3 LIST_FOREACH.3 \ 27 queue.3 LIST_FOREACH_SAFE.3 queue.3 LIST_INIT.3 \ 28 queue.3 LIST_INSERT_AFTER.3 queue.3 LIST_INSERT_BEFORE.3 \ 29 queue.3 LIST_INSERT_HEAD.3 queue.3 LIST_REMOVE.3 \ 30 queue.3 LIST_REPLACE.3 31MLINKS+=queue.3 SIMPLEQ_ENTRY.3 queue.3 SIMPLEQ_HEAD.3 \ 32 queue.3 SIMPLEQ_HEAD_INITIALIZER.3 queue.3 SIMPLEQ_FIRST.3 \ 33 queue.3 SIMPLEQ_NEXT.3 \ 34 queue.3 SIMPLEQ_EMPTY.3 queue.3 SIMPLEQ_FOREACH.3 \ 35 queue.3 SIMPLEQ_FOREACH_SAFE.3 queue.3 SIMPLEQ_INIT.3 \ 36 queue.3 SIMPLEQ_INSERT_HEAD.3 queue.3 SIMPLEQ_INSERT_TAIL.3 \ 37 queue.3 SIMPLEQ_INSERT_AFTER.3 queue.3 SIMPLEQ_REMOVE_HEAD.3 \ 38 queue.3 SIMPLEQ_REMOVE_AFTER.3 queue.3 SIMPLEQ_CONCAT.3 39MLINKS+=queue.3 TAILQ_ENTRY.3 queue.3 TAILQ_HEAD.3 \ 40 queue.3 TAILQ_HEAD_INITIALIZER.3 queue.3 TAILQ_FIRST.3 \ 41 queue.3 TAILQ_NEXT.3 queue.3 TAILQ_LAST.3 \ 42 queue.3 TAILQ_PREV.3 queue.3 TAILQ_EMPTY.3 \ 43 queue.3 TAILQ_FOREACH.3 queue.3 TAILQ_FOREACH_SAFE.3 \ 44 queue.3 TAILQ_FOREACH_REVERSE.3 queue.3 TAILQ_FOREACH_REVERSE_SAFE.3 \ 45 queue.3 TAILQ_INIT.3 \ 46 queue.3 TAILQ_INSERT_AFTER.3 queue.3 TAILQ_INSERT_BEFORE.3 \ 47 queue.3 TAILQ_INSERT_HEAD.3 queue.3 TAILQ_INSERT_TAIL.3 \ 48 queue.3 TAILQ_REMOVE.3 queue.3 TAILQ_REPLACE.3 queue.3 TAILQ_CONCAT.3 49MLINKS+=stdarg.3 varargs.3 stdarg.3 va_arg.3 stdarg.3 va_end.3 50MLINKS+=stdarg.3 va_start.3 stdarg.3 va_copy.3 51MLINKS+=dlfcn.3 dlopen.3 dlfcn.3 dlclose.3 dlfcn.3 dlsym.3 dlfcn.3 dlctl.3 \ 52 dlfcn.3 dlerror.3 dlfcn.3 dladdr.3 53MLINKS+=tree.3 SPLAY_PROTOTYPE.3 tree.3 SPLAY_GENERATE.3 \ 54 tree.3 SPLAY_ENTRY.3 tree.3 SPLAY_HEAD.3 \ 55 tree.3 SPLAY_INITIALIZER.3 tree.3 SPLAY_ROOT.3 \ 56 tree.3 SPLAY_EMPTY.3 tree.3 SPLAY_NEXT.3 \ 57 tree.3 SPLAY_MIN.3 tree.3 SPLAY_MAX.3 tree.3 SPLAY_FIND.3 \ 58 tree.3 SPLAY_LEFT.3 tree.3 SPLAY_RIGHT.3 tree.3 SPLAY_INIT.3 \ 59 tree.3 SPLAY_INSERT.3 tree.3 SPLAY_REMOVE.3 \ 60 tree.3 SPLAY_FOREACH.3 61MLINKS+=tree.3 RB_PROTOTYPE.3 tree.3 RB_PROTOTYPE_STATIC.3 \ 62 tree.3 RB_GENERATE.3 tree.3 RB_GENERATE_STATIC.3 tree.3 RB_ENTRY.3 \ 63 tree.3 RB_HEAD.3 tree.3 RB_INITIALIZER.3 tree.3 RB_ROOT.3 \ 64 tree.3 RB_EMPTY.3 tree.3 RB_NEXT.3 tree.3 RB_PREV.3 \ 65 tree.3 RB_MIN.3 tree.3 RB_MAX.3 tree.3 RB_FIND.3 tree.3 RB_NFIND.3 \ 66 tree.3 RB_LEFT.3 tree.3 RB_RIGHT.3 tree.3 RB_PARENT.3 \ 67 tree.3 RB_INIT.3 tree.3 RB_INSERT.3 tree.3 RB_REMOVE.3 \ 68 tree.3 RB_FOREACH.3 tree.3 RB_FOREACH_SAFE.3 \ 69 tree.3 RB_FOREACH_REVERSE.3 tree.3 RB_FOREACH_REVERSE_SAFE.3 70 71.include <bsd.prog.mk> 72