1 # $NetBSD: Makefile,v 1.55 2010/06/08 08:51:09 jruoho Exp $ 2 # @(#)Makefile 8.2 (Berkeley) 12/13/93 3 4 MAN= _DIAGASSERT.3 __CONCAT.3 __UNCONST.3 CMSG_DATA.3 \ 5 __arraycount.3 assert.3 bits.3 bitstring.3 dirent.3 dlfcn.3 end.3 \ 6 fast_divide32.3 ffs32.3 gcq.3 \ 7 ilog2.3 intro.3 inttypes.3 iso646.3 \ 8 offsetof.3 queue.3 rb.3 sigevent.3 \ 9 stdarg.3 stdbool.3 stddef.3 stdint.3 stdlib.3 sysexits.3 \ 10 tgmath.3 timeradd.3 timeval.3 tree.3 types.3 varargs.3 11 12 USETBL= # used by queue.3 13 14 MLINKS+=__CONCAT.3 __STRING.3 15 MLINKS+=__UNCONST.3 __UNVOLATILE.3 16 MLINKS+=bitstring.3 bit_alloc.3 \ 17 bitstring.3 bit_clear.3 \ 18 bitstring.3 bit_decl.3 \ 19 bitstring.3 bit_ffc.3 \ 20 bitstring.3 bit_ffs.3 \ 21 bitstring.3 bit_nclear.3 \ 22 bitstring.3 bit_nset.3 \ 23 bitstring.3 bit_set.3 \ 24 bitstring.3 bitstr_size.3 \ 25 bitstring.3 bit_test.3 26 MLINKS+=bits.3 __BIT.3 \ 27 bits.3 __BITS.3 \ 28 bits.3 __SHIFTIN.3 \ 29 bits.3 __SHIFTOUT.3 \ 30 bits.3 __SHIFTOUT_MASK.3 31 MLINKS+=end.3 edata.3 end.3 etext.3 32 MLINKS+=fast_divide32.3 fast_divide32_prepare.3 \ 33 fast_divide32.3 fast_remainder32.3 34 MLINKS+=ffs32.3 ffs64.3 \ 35 ffs32.3 fls32.3 \ 36 ffs32.3 fls64.3 37 MLINKS+=gcq.3 GCQ_INIT.3 \ 38 gcq.3 GCQ_INIT_HEAD.3 \ 39 gcq.3 gcq_init.3 \ 40 gcq.3 gcq_init_head.3 \ 41 gcq.3 gcq_q.3 \ 42 gcq.3 gcq_hq.3 \ 43 gcq.3 gcq_head.3 \ 44 gcq.3 gcq_remove.3 \ 45 gcq.3 gcq_onlist.3 \ 46 gcq.3 gcq_empty.3 \ 47 gcq.3 gcq_linked.3 \ 48 gcq.3 gcq_insert_after.3 \ 49 gcq.3 gcq_insert_before.3 \ 50 gcq.3 gcq_insert_head.3 \ 51 gcq.3 gcq_insert_tail.3 \ 52 gcq.3 gcq_tie.3 \ 53 gcq.3 gcq_tie_after.3 \ 54 gcq.3 gcq_tie_before.3 \ 55 gcq.3 gcq_merge.3 \ 56 gcq.3 gcq_merge_head.3 \ 57 gcq.3 gcq_merge_tail.3 \ 58 gcq.3 gcq_clear.3 \ 59 gcq.3 gcq_remove_all.3 \ 60 gcq.3 GCQ_ITEM.3 \ 61 gcq.3 GCQ_GOT_FIRST.3 \ 62 gcq.3 GCQ_GOT_LAST.3 \ 63 gcq.3 GCQ_GOT_NEXT.3 \ 64 gcq.3 GCQ_GOT_PREV.3 \ 65 gcq.3 GCQ_DEQUEUED_FIRST.3 \ 66 gcq.3 GCQ_DEQUEUED_LAST.3 \ 67 gcq.3 GCQ_DEQUEUED_NEXT.3 \ 68 gcq.3 GCQ_DEQUEUED_PREV.3 \ 69 gcq.3 GCQ_GOT_FIRST_TYPED.3 \ 70 gcq.3 GCQ_GOT_LAST_TYPED.3 \ 71 gcq.3 GCQ_GOT_NEXT_TYPED.3 \ 72 gcq.3 GCQ_GOT_PREV_TYPED.3 \ 73 gcq.3 GCQ_DEQUEUED_FIRST_TYPED.3 \ 74 gcq.3 GCQ_DEQUEUED_LAST_TYPED.3 \ 75 gcq.3 GCQ_DEQUEUED_NEXT_TYPED.3 \ 76 gcq.3 GCQ_DEQUEUED_PREV_TYPED.3 \ 77 gcq.3 GCQ_GOT_FIRST_COND.3 \ 78 gcq.3 GCQ_GOT_LAST_COND.3 \ 79 gcq.3 GCQ_GOT_NEXT_COND.3 \ 80 gcq.3 GCQ_GOT_PREV_COND.3 \ 81 gcq.3 GCQ_DEQUEUED_FIRST_COND.3 \ 82 gcq.3 GCQ_DEQUEUED_LAST_COND.3 \ 83 gcq.3 GCQ_DEQUEUED_NEXT_COND.3 \ 84 gcq.3 GCQ_DEQUEUED_PREV_COND.3 \ 85 gcq.3 GCQ_GOT_FIRST_COND_TYPED.3 \ 86 gcq.3 GCQ_GOT_LAST_COND_TYPED.3 \ 87 gcq.3 GCQ_GOT_NEXT_COND_TYPED.3 \ 88 gcq.3 GCQ_GOT_PREV_COND_TYPED.3 \ 89 gcq.3 GCQ_DEQUEUED_FIRST_COND_TYPED.3 \ 90 gcq.3 GCQ_DEQUEUED_LAST_COND_TYPED.3 \ 91 gcq.3 GCQ_DEQUEUED_NEXT_COND_TYPED.3 \ 92 gcq.3 GCQ_DEQUEUED_PREV_COND_TYPED.3 \ 93 gcq.3 GCQ_FOREACH.3 \ 94 gcq.3 GCQ_FOREACH_REV.3 \ 95 gcq.3 GCQ_FOREACH_NVAR.3 \ 96 gcq.3 GCQ_FOREACH_NVAR_REV.3 \ 97 gcq.3 GCQ_FOREACH_RO.3 \ 98 gcq.3 GCQ_FOREACH_RO_REV.3 \ 99 gcq.3 GCQ_FOREACH_DEQUEUED.3 \ 100 gcq.3 GCQ_FOREACH_DEQUEUED_REV.3 \ 101 gcq.3 GCQ_FOREACH_TYPED.3 \ 102 gcq.3 GCQ_FOREACH_REV_TYPED.3 \ 103 gcq.3 GCQ_FOREACH_NVAR_TYPED.3 \ 104 gcq.3 GCQ_FOREACH_NVAR_REV_TYPED.3 \ 105 gcq.3 GCQ_FOREACH_RO_TYPED.3 \ 106 gcq.3 GCQ_FOREACH_RO_REV_TYPED.3 \ 107 gcq.3 GCQ_FOREACH_DEQUEUED_TYPED.3 \ 108 gcq.3 GCQ_FOREACH_DEQUEUED_REV_TYPED.3 \ 109 gcq.3 GCQ_FIND.3 \ 110 gcq.3 GCQ_FIND_REV.3 \ 111 gcq.3 GCQ_FIND_TYPED.3 \ 112 gcq.3 GCQ_FIND_REV_TYPED.3 113 MLINKS+=queue.3 LIST_HEAD.3 \ 114 queue.3 LIST_HEAD_INITIALIZER.3 \ 115 queue.3 LIST_ENTRY.3 \ 116 queue.3 LIST_INIT.3 \ 117 queue.3 LIST_INSERT_AFTER.3 \ 118 queue.3 LIST_INSERT_BEFORE.3 \ 119 queue.3 LIST_INSERT_HEAD.3 \ 120 queue.3 LIST_REMOVE.3 \ 121 queue.3 LIST_FOREACH.3 \ 122 queue.3 LIST_EMPTY.3 \ 123 queue.3 LIST_FIRST.3 \ 124 queue.3 LIST_NEXT.3 125 MLINKS+=queue.3 SLIST_HEAD.3 \ 126 queue.3 SLIST_HEAD_INITIALIZER.3 \ 127 queue.3 SLIST_ENTRY.3 \ 128 queue.3 SLIST_INIT.3 \ 129 queue.3 SLIST_INSERT_AFTER.3 \ 130 queue.3 SLIST_INSERT_HEAD.3 \ 131 queue.3 SLIST_REMOVE_HEAD.3 \ 132 queue.3 SLIST_REMOVE.3 \ 133 queue.3 SLIST_FOREACH.3 \ 134 queue.3 SLIST_EMPTY.3 \ 135 queue.3 SLIST_FIRST.3 \ 136 queue.3 SLIST_NEXT.3 137 MLINKS+=queue.3 STAILQ_HEAD.3 \ 138 queue.3 STAILQ_HEAD_INITIALIZER.3 \ 139 queue.3 STAILQ_ENTRY.3 \ 140 queue.3 STAILQ_INIT.3 \ 141 queue.3 STAILQ_INSERT_HEAD.3 \ 142 queue.3 STAILQ_INSERT_TAIL.3 \ 143 queue.3 STAILQ_INSERT_AFTER.3 \ 144 queue.3 STAILQ_REMOVE_HEAD.3 \ 145 queue.3 STAILQ_REMOVE.3 \ 146 queue.3 STAILQ_FOREACH.3 \ 147 queue.3 STAILQ_EMPTY.3 \ 148 queue.3 STAILQ_FIRST.3 \ 149 queue.3 STAILQ_NEXT.3 150 MLINKS+=queue.3 SIMPLEQ_HEAD.3 \ 151 queue.3 SIMPLEQ_HEAD_INITIALIZER.3 \ 152 queue.3 SIMPLEQ_ENTRY.3 \ 153 queue.3 SIMPLEQ_INIT.3 \ 154 queue.3 SIMPLEQ_INSERT_HEAD.3 \ 155 queue.3 SIMPLEQ_INSERT_TAIL.3 \ 156 queue.3 SIMPLEQ_INSERT_AFTER.3 \ 157 queue.3 SIMPLEQ_REMOVE_HEAD.3 \ 158 queue.3 SIMPLEQ_REMOVE.3 \ 159 queue.3 SIMPLEQ_FOREACH.3 \ 160 queue.3 SIMPLEQ_EMPTY.3 \ 161 queue.3 SIMPLEQ_FIRST.3 \ 162 queue.3 SIMPLEQ_NEXT.3 163 MLINKS+=queue.3 TAILQ_HEAD.3 \ 164 queue.3 TAILQ_HEAD_INITIALIZER.3 \ 165 queue.3 TAILQ_ENTRY.3 \ 166 queue.3 TAILQ_INIT.3 \ 167 queue.3 TAILQ_INSERT_HEAD.3 \ 168 queue.3 TAILQ_INSERT_TAIL.3 \ 169 queue.3 TAILQ_INSERT_AFTER.3 \ 170 queue.3 TAILQ_INSERT_BEFORE.3 \ 171 queue.3 TAILQ_REMOVE.3 \ 172 queue.3 TAILQ_FOREACH.3 \ 173 queue.3 TAILQ_FOREACH_REVERSE.3 \ 174 queue.3 TAILQ_EMPTY.3 \ 175 queue.3 TAILQ_FIRST.3 \ 176 queue.3 TAILQ_NEXT.3 \ 177 queue.3 TAILQ_LAST.3 \ 178 queue.3 TAILQ_PREV.3 179 MLINKS+=queue.3 CIRCLEQ_HEAD.3 \ 180 queue.3 CIRCLEQ_HEAD_INITIALIZER.3 \ 181 queue.3 CIRCLEQ_ENTRY.3 \ 182 queue.3 CIRCLEQ_INIT.3 \ 183 queue.3 CIRCLEQ_INSERT_AFTER.3 \ 184 queue.3 CIRCLEQ_INSERT_BEFORE.3 \ 185 queue.3 CIRCLEQ_INSERT_HEAD.3 \ 186 queue.3 CIRCLEQ_INSERT_TAIL.3 \ 187 queue.3 CIRCLEQ_REMOVE.3 \ 188 queue.3 CIRCLEQ_FOREACH.3 \ 189 queue.3 CIRCLEQ_FOREACH_REVERSE.3 \ 190 queue.3 CIRCLEQ_EMPTY.3 \ 191 queue.3 CIRCLEQ_FIRST.3 \ 192 queue.3 CIRCLEQ_LAST.3 \ 193 queue.3 CIRCLEQ_NEXT.3 \ 194 queue.3 CIRCLEQ_PREV.3 \ 195 queue.3 CIRCLEQ_LOOP_NEXT.3 \ 196 queue.3 CIRCLEQ_LOOP_PREV.3 197 MLINKS+=rb.3 rb_tree_init.3 \ 198 rb.3 rb_tree_insert_node.3 \ 199 rb.3 rb_tree_find_node.3 \ 200 rb.3 rb_tree_find_node_geq.3 \ 201 rb.3 rb_tree_find_node_leq.3 \ 202 rb.3 rb_tree_iterate.3 203 MLINKS+=stdarg.3 va_arg.3 stdarg.3 va_copy.3 \ 204 stdarg.3 va_end.3 stdarg.3 va_start.3 205 MLINKS+=dirent.3 dir.3 \ 206 dirent.3 IFTODT.3 \ 207 dirent.3 DTTOIF.3 208 MLINKS+=dlfcn.3 dlopen.3 dlfcn.3 dlclose.3 dlfcn.3 dlsym.3 dlfcn.3 dlctl.3 \ 209 dlfcn.3 dlerror.3 dlfcn.3 dladdr.3 210 MLINKS+=timeradd.3 timersub.3 \ 211 timeradd.3 timerclear.3 \ 212 timeradd.3 timerisset.3 \ 213 timeradd.3 timercmp.3 \ 214 timeradd.3 timespecadd.3 \ 215 timeradd.3 timespecsub.3 \ 216 timeradd.3 timespecclear.3 \ 217 timeradd.3 timespecisset.3 \ 218 timeradd.3 timespeccmp.3 219 MLINKS+=timeval.3 timespec.3 \ 220 timeval.3 itimerval.3 \ 221 timeval.3 itimerspec.3 \ 222 timeval.3 TIMEVAL_TO_TIMESPEC.3 \ 223 timeval.3 TIMESPEC_TO_TIMEVAL.3 224 MLINKS+=tree.3 SPLAY_PROTOTYPE.3 tree.3 SPLAY_GENERATE.3 \ 225 tree.3 SPLAY_ENTRY.3 tree.3 SPLAY_HEAD.3 \ 226 tree.3 SPLAY_INITIALIZER.3 tree.3 SPLAY_ROOT.3 \ 227 tree.3 SPLAY_EMPTY.3 tree.3 SPLAY_NEXT.3 \ 228 tree.3 SPLAY_MIN.3 tree.3 SPLAY_MAX.3 tree.3 SPLAY_FIND.3 \ 229 tree.3 SPLAY_LEFT.3 tree.3 SPLAY_RIGHT.3 tree.3 SPLAY_INIT.3 \ 230 tree.3 SPLAY_INSERT.3 tree.3 SPLAY_REMOVE.3 \ 231 tree.3 SPLAY_FOREACH.3 232 MLINKS+=tree.3 RB_PROTOTYPE.3 tree.3 RB_GENERATE.3 \ 233 tree.3 RB_ENTRY.3 tree.3 RB_HEAD.3 \ 234 tree.3 RB_INITIALIZER.3 tree.3 RB_ROOT.3 \ 235 tree.3 RB_EMPTY.3 tree.3 RB_NEXT.3 \ 236 tree.3 RB_MIN.3 tree.3 RB_MAX.3 tree.3 RB_FIND.3 \ 237 tree.3 RB_LEFT.3 tree.3 RB_RIGHT.3 tree.3 RB_PARENT.3 \ 238 tree.3 RB_INIT.3 tree.3 RB_INSERT.3 tree.3 RB_REMOVE.3 \ 239 tree.3 RB_FOREACH.3 240 MLINKS+=CMSG_DATA.3 CMSG_FIRSTHDR.3 \ 241 CMSG_DATA.3 CMSG_LEN.3 \ 242 CMSG_DATA.3 CMSG_NXTHDR.3 \ 243 CMSG_DATA.3 CMSG_SPACE.3 244 245 .include <bsd.man.mk> 246 .include <bsd.subdir.mk> 247