NetBSD/share/man/man3/Makefile
dyoung 8cd106d3d2 Per discussion on tech-kern and tech-userlevel, move the bit-twiddling
macros, __BIT, __BITS, SHIFTIN, SHIFTOUT, and __arraycount() from
lib/libkern/libkern.h to sys/cdefs.h.  Add a __-prefix to SHIFTIN
and SHIFTOUT, and add a manual page for the bit-twiddling macros,
bits(3).

Make the __BIT and __BITS macros "widthless," as best I can, by
changing their type to uintmax_t from uint32_t.  XXX The manual
page lags this change by a bit.

Define __PRIxBIT and __PRIxBITS printf(3) format strings.
2006-08-31 19:24:37 +00:00

120 lines
3.7 KiB
Makefile

# $NetBSD: Makefile,v 1.29 2006/08/31 19:24:37 dyoung Exp $
# @(#)Makefile 8.2 (Berkeley) 12/13/93
MAN= _DIAGASSERT.3 assert.3 bits.3 bitstring.3 dlfcn.3 end.3 intro.3 \
queue.3 \
stdarg.3 sysexits.3 tree.3 varargs.3
MLINKS+=end.3 edata.3 end.3 etext.3
MLINKS+=bits.3 __BIT.3 \
bits.3 __BITS.3 \
bits.3 __SHIFTIN.3 \
bits.3 __SHIFTOUT.3 \
bits.3 __SHIFTOUT_MASK.3
MLINKS+=queue.3 LIST_HEAD.3 \
queue.3 LIST_HEAD_INITIALIZER.3 \
queue.3 LIST_ENTRY.3 \
queue.3 LIST_INIT.3 \
queue.3 LIST_INSERT_AFTER.3 \
queue.3 LIST_INSERT_BEFORE.3 \
queue.3 LIST_INSERT_HEAD.3 \
queue.3 LIST_REMOVE.3 \
queue.3 LIST_FOREACH.3 \
queue.3 LIST_EMPTY.3 \
queue.3 LIST_FIRST.3 \
queue.3 LIST_NEXT.3
MLINKS+=queue.3 SLIST_HEAD.3 \
queue.3 SLIST_HEAD_INITIALIZER.3 \
queue.3 SLIST_ENTRY.3 \
queue.3 SLIST_INIT.3 \
queue.3 SLIST_INSERT_AFTER.3 \
queue.3 SLIST_INSERT_HEAD.3 \
queue.3 SLIST_REMOVE_HEAD.3 \
queue.3 SLIST_REMOVE.3 \
queue.3 SLIST_FOREACH.3 \
queue.3 SLIST_EMPTY.3 \
queue.3 SLIST_FIRST.3 \
queue.3 SLIST_NEXT.3
MLINKS+=queue.3 STAILQ_HEAD.3 \
queue.3 STAILQ_HEAD_INITIALIZER.3 \
queue.3 STAILQ_ENTRY.3 \
queue.3 STAILQ_INIT.3 \
queue.3 STAILQ_INSERT_HEAD.3 \
queue.3 STAILQ_INSERT_TAIL.3 \
queue.3 STAILQ_INSERT_AFTER.3 \
queue.3 STAILQ_REMOVE_HEAD.3 \
queue.3 STAILQ_REMOVE.3 \
queue.3 STAILQ_FOREACH.3 \
queue.3 STAILQ_EMPTY.3 \
queue.3 STAILQ_FIRST.3 \
queue.3 STAILQ_NEXT.3
MLINKS+=queue.3 SIMPLEQ_HEAD.3 \
queue.3 SIMPLEQ_HEAD_INITIALIZER.3 \
queue.3 SIMPLEQ_ENTRY.3 \
queue.3 SIMPLEQ_INIT.3 \
queue.3 SIMPLEQ_INSERT_HEAD.3 \
queue.3 SIMPLEQ_INSERT_TAIL.3 \
queue.3 SIMPLEQ_INSERT_AFTER.3 \
queue.3 SIMPLEQ_REMOVE_HEAD.3 \
queue.3 SIMPLEQ_REMOVE.3 \
queue.3 SIMPLEQ_FOREACH.3 \
queue.3 SIMPLEQ_EMPTY.3 \
queue.3 SIMPLEQ_FIRST.3 \
queue.3 SIMPLEQ_NEXT.3
MLINKS+=queue.3 TAILQ_HEAD.3 \
queue.3 TAILQ_HEAD_INITIALIZER.3 \
queue.3 TAILQ_ENTRY.3 \
queue.3 TAILQ_INIT.3 \
queue.3 TAILQ_INSERT_HEAD.3 \
queue.3 TAILQ_INSERT_TAIL.3 \
queue.3 TAILQ_INSERT_AFTER.3 \
queue.3 TAILQ_INSERT_BEFORE.3 \
queue.3 TAILQ_REMOVE.3 \
queue.3 TAILQ_FOREACH.3 \
queue.3 TAILQ_FOREACH_REVERSE.3 \
queue.3 TAILQ_EMPTY.3 \
queue.3 TAILQ_FIRST.3 \
queue.3 TAILQ_NEXT.3 \
queue.3 TAILQ_LAST.3 \
queue.3 TAILQ_PREV.3
MLINKS+=queue.3 CIRCLEQ_HEAD.3 \
queue.3 CIRCLEQ_HEAD_INITIALIZER.3 \
queue.3 CIRCLEQ_ENTRY.3 \
queue.3 CIRCLEQ_INIT.3 \
queue.3 CIRCLEQ_INSERT_AFTER.3 \
queue.3 CIRCLEQ_INSERT_BEFORE.3 \
queue.3 CIRCLEQ_INSERT_HEAD.3 \
queue.3 CIRCLEQ_INSERT_TAIL.3 \
queue.3 CIRCLEQ_REMOVE.3 \
queue.3 CIRCLEQ_FOREACH.3 \
queue.3 CIRCLEQ_FOREACH_REVERSE.3 \
queue.3 CIRCLEQ_EMPTY.3 \
queue.3 CIRCLEQ_FIRST.3 \
queue.3 CIRCLEQ_LAST.3 \
queue.3 CIRCLEQ_NEXT.3 \
queue.3 CIRCLEQ_PREV.3 \
queue.3 CIRCLEQ_LOOP_NEXT.3 \
queue.3 CIRCLEQ_LOOP_PREV.3
MLINKS+=stdarg.3 va_arg.3 stdarg.3 va_copy.3 \
stdarg.3 va_end.3 stdarg.3 va_start.3
MLINKS+=dlfcn.3 dlopen.3 dlfcn.3 dlclose.3 dlfcn.3 dlsym.3 dlfcn.3 dlctl.3 \
dlfcn.3 dlerror.3 dlfcn.3 dladdr.3
MLINKS+=tree.3 SPLAY_PROTOTYPE.3 tree.3 SPLAY_GENERATE.3 \
tree.3 SPLAY_ENTRY.3 tree.3 SPLAY_HEAD.3 \
tree.3 SPLAY_INITIALIZER.3 tree.3 SPLAY_ROOT.3 \
tree.3 SPLAY_EMPTY.3 tree.3 SPLAY_NEXT.3 \
tree.3 SPLAY_MIN.3 tree.3 SPLAY_MAX.3 tree.3 SPLAY_FIND.3 \
tree.3 SPLAY_LEFT.3 tree.3 SPLAY_RIGHT.3 tree.3 SPLAY_INIT.3 \
tree.3 SPLAY_INSERT.3 tree.3 SPLAY_REMOVE.3 \
tree.3 SPLAY_FOREACH.3
MLINKS+=tree.3 RB_PROTOTYPE.3 tree.3 RB_GENERATE.3 \
tree.3 RB_ENTRY.3 tree.3 RB_HEAD.3 \
tree.3 RB_INITIALIZER.3 tree.3 RB_ROOT.3 \
tree.3 RB_EMPTY.3 tree.3 RB_NEXT.3 \
tree.3 RB_MIN.3 tree.3 RB_MAX.3 tree.3 RB_FIND.3 \
tree.3 RB_LEFT.3 tree.3 RB_RIGHT.3 tree.3 RB_PARENT.3 \
tree.3 RB_INIT.3 tree.3 RB_INSERT.3 tree.3 RB_REMOVE.3 \
tree.3 RB_FOREACH.3
.include <bsd.man.mk>
.include <bsd.subdir.mk>