1093. [doc] libbind: miscellaneous nroff fixes.
1101. [bug] Array bounds read error in lwres_gai_strerror.
+1093. [doc] libbind: miscellaneous nroff fixes.
+
1092. [bug] libbind: get*by*() failed to check if res_init() had
been called.
-.\" $Id: assertions.mdoc,v 1.1 2001/03/29 06:31:53 marka Exp $
+.\" $Id: assertions.mdoc,v 1.1.2.1 2001/11/02 21:05:58 gson Exp $
.\"
.\"Copyright (c) 1997,1999 by Internet Software Consortium.
.\"
when
.Dq "<isc/assertions.h>"
is included, then assertions of that type will not be checked. E.g.
-
+.Pp
.Dl #define CHECK_ENSURE 0
-
+.Pp
will disable checking of
.Fn ENSURE
and
specifies the function to call when an assertion fails.
.Pp
When an
-.li
-assertion_failure_callback
+.Fn assertion_failure_callback
is called, the
.Fa filename
and
assert_insist
assert_invariant
.Ed
-
+.Pp
and may be used by the callback to determine the type of the failing
assertion.
.Fa condition
returns the string
.Dq REQUIRE .
.Sh SEE ALSO
-Bertrand Meyer,
-.Sy Object-Oriented Software Construction,
-2nd edition, Prentice\-Hall, 1997, ISBN 0\-13\-629155\-4, chapter 11.
+.Rs
+.%A Bertrand Meyer
+.%B Object-Oriented Software Construction, 2nd edition
+.%Q Prentice\-Hall
+.%D 1997
+.%O ISBN 0\-13\-629155\-4
+.%P chapter 11
+.Re
.Sh AUTHOR
Bob Halley (ISC).
-.\" $Id: bitncmp.mdoc,v 1.1 2001/03/29 06:31:53 marka Exp $
+.\" $Id: bitncmp.mdoc,v 1.1.2.1 2001/11/02 21:05:59 gson Exp $
.\"
.\"Copyright (c) 1996,1999 by Internet Software Consortium.
.\"
when taken to be unsigned characters (this behaviour is just like that of
.Xr memcmp 3 ) .
.Pp
-.Sy NOTE:
+.Sy NOTE :
.Fn Bitncmp
assumes
.Sy network byte order ;
.Fn Bitncmp
returns values in the manner of
.Xr memcmp 3 :
-.Bd -filled -offset indent
+.Bd -ragged -offset indent
+1 if
.Dq Fa 1
is greater than
and
.Dq Fa r
are both interpreted as strings of unsigned characters (through bit
-.Dq Fa n .)
+.Dq Fa n . )
.Sh SEE ALSO
.Xr memcmp 3 .
.Sh AUTHOR
-.\" $Id: eventlib.mdoc,v 1.1 2001/03/29 06:31:54 marka Exp $
+.\" $Id: eventlib.mdoc,v 1.1.2.1 2001/11/02 21:06:00 gson Exp $
.\"
.\"Copyright (c) 1995-1999 by Internet Software Consortium
.\"
.Sh SYNOPSIS
.Fd #include <isc/eventlib.h>
.Ft typedef void
-.Fn (*evConnFunc) "evContext ctx" "void *uap" "int fd" \
+.Fn \*(lp*evConnFunc\*(rp "evContext ctx" "void *uap" "int fd" \
"const void *la" "int lalen" "const void *ra" "int ralen"
.Ft typedef void
-.Fn (*evTimerFunc) "evContext ctx" "void *uap" \
+.Fn \*(lp*evTimerFunc\*(rp "evContext ctx" "void *uap" \
"struct timespec due" "struct timespec inter"
.Ft typedef void
-.Fn (*evFileFunc) "evContext ctx" "void *uap" "int fd" "int eventmask"
+.Fn \*(lp*evFileFunc\*(rp "evContext ctx" "void *uap" "int fd" "int eventmask"
.Ft typedef void
-.Fn (*evStreamFunc) "evContext ctx" "void *uap" "int fd" "int bytes"
+.Fn \*(lp*evStreamFunc\*(rp "evContext ctx" "void *uap" "int fd" "int bytes"
.Ft typedef void
-.Fn (*evWaitFunc) "evContext ctx" "void *uap" "const void *tag"
+.Fn \*(lp*evWaitFunc\*(rp "evContext ctx" "void *uap" "const void *tag"
.Ft int
.Fn evCreate "evContext *ctx"
.Ft int
creates an event context which is needed by all the other functions in this
library. All information used internally by this library is bound to this
context, rather than to static storage. This makes the library
-.Dq thread safe,
+.Dq thread safe ,
and permits other library functions to use events without
disrupting the application's use of events.
.Pp
adds two
.Dq Fa struct timespec
values and returns the result as a
-.Dq Fa struct timespec.
+.Dq Fa struct timespec .
.Pp
The function
.Fn evSubTime
argument from its first
.Dq Fa struct timespec
argument and returns the result as a
-.Dq Fa struct timespec.
+.Dq Fa struct timespec .
.Pp
The function
.Fn evCmpTime
and then if time
.Fa inter
is not equal to
-.Dq Fa evConsTime(0,0) ,
+.Dq Fn evConsTime 0 0 ,
subsequently at intervals equal to time
.Fa inter .
As a special case, specifying a
.Fa due
argument equal to
-.Dq Fa evConsTime(0,0)
+.Dq Fn evConsTime 0 0
means
-.Dq due immediately.
+.Dq due immediately .
The
.Fa opaqueID
argument, if specified as a value other than
to destination address
.Fa ra
(whose length is
-.Fa ralen ).
+.Fa ralen ) .
When the connection is complete,
.Fa func
will be called with
as one of its arguments. The argument
.Fa fd
to
-.Fn (*func)()
+.Fn \*(lp*func\*(rp
will be
.Fa -1
if an error occurred that prevented this connection from completing
-.\" $Id: heap.mdoc,v 1.1 2001/03/29 06:31:55 marka Exp $
+.\" $Id: heap.mdoc,v 1.1.2.1 2001/11/02 21:06:01 gson Exp $
.\"
.\"Copyright (c) 1997,1999 by Internet Software Consortium.
.\"
.\"ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
.\"SOFTWARE.
.\"
-.Dd Jan 1, 1997
+.Dd January 1, 1997
.\"Os OPERATING_SYSTEM [version/release]
.Os BSD 4
.Dt HEAP @SYSCALL_EXT@
These functions implement heap\-based priority queues. The user defines a
priority scheme, and provides a function for comparison of the priority
of heap elements
-.Po see the description of the
+(see the description of the
.Ft heap_higher_priority_func
-function pointer, below
-.Pc .
+function pointer, below).
.Pp
Each of the functions depends upon the
.Ft heap_context
.Ft heap
indicated by
.Fa ctx
-.Po a pointer to a
-.Ft heap_context
-.Pc .
+(a pointer to a
+.Ft heap_context ) .
If
.No non\- Ns Dv NULL ,
the user-defined
pointed to by
.Ft higher_priority
function pointer
-.Pq see description of Fn heap_new, No above .
+(see description of
+.Fn heap_new ,
+above).
.Pp
.Fn heap_increased
.Pp
or if the
.Fa higher_priority
function pointer is
-.Dv NULL;
+.Dv NULL ;
otherwise, a valid
.Ft heap_context
.Ns .
.Sh SEE ALSO
.Xr malloc 3 ,
.Xr realloc 3 .
-.Pp
-Cormen, Leiserson, and Rivest,
-.Sy Introduction to Algorithms,
-MIT Press / McGraw Hill, 1990, ISBN 0\-262\-03141\-8, chapter 7.
-.Pp
-Sedgewick,
-.Sy Algorithms,
-2nd ed'n, Addison\-Wesley, 1988, ISBN 0\-201\-06673\-4, chapter 11.
+.Rs
+.%A Cormen
+.%A Leiserson
+.%A Rivest
+.%B Introduction to Algorithms
+.%Q "MIT Press / McGraw Hill"
+.%D 1990
+.%O ISBN 0\-262\-03141\-8
+.%P chapter 7
+.Re
+.Rs
+.%A Sedgewick
+.%B Algorithms, 2nd ed'n
+.%Q Addison\-Wesley
+.%D 1988
+.%O ISBN 0\-201\-06673\-4
+.%P chapter 11
+.Re
.\" .Sh STANDARDS
.\" .Sh HISTORY
.Sh AUTHORS
-.\" $Id: logging.mdoc,v 1.1 2001/03/29 06:31:55 marka Exp $
+.\" $Id: logging.mdoc,v 1.1.2.1 2001/11/02 21:06:02 gson Exp $
.\"
.\"Copyright (c) 1995-1999 by Internet Software Consortium
.\"
associated with it; we say that such a channel is
.Dq in
the particular category.
-.Sy NOTE:
+.Sy NOTE :
Individual logging channels can appear in more than one category.
.Pp
A
is the set of all
.Nm logging channels
associated with the context's
-.Nm categories;
+.Nm categories ;
thus, a particular
.Nm category
scheme is associated with a particular
-.Nm logging context.
-.Sy NOTE:
+.Nm logging context .
+.Sy NOTE :
A logging channel may appear in more than one logging context, and in
multiple categories within each logging context.
.Pp
field of the logging channel structure is set), then any file with the
.Dq current
filename for the stream is
-.X4 unlink 2 Ns -d .
-.Sy NOTE:
+.Xr unlink 2 Ns -d .
+.Sy NOTE :
If the logging file is
.Em not
a regular file, and either of the above operations (version numbering
than 0), then it will not be logged.
Finally, if the message's priority is less important than the
channel's logging level (the priority threshold), will not be logged.
-.Sy NOTE:
+.Sy NOTE :
If a logging channel's flag has
.Dv LOG_USE_CONTEXT_LEVEL
set, it will use the logging context's priority, rather than its own.
.Dq Fa category_names
which are supplied; the latter can be
.Dv NULL .
-.Sy NOTE:
+.Sy NOTE :
Since
.Dq Fa category_names
is used directly, it
function is used to free the opaque structure
.Dq Va lc.opaque
and its components.
-.Sy NOTE:
+.Sy NOTE :
The
.Dq Va opaque
field of
is set to
.Dv NULL .
.Pp
-.Sy NOTE:
+.Sy NOTE :
The function
.Fn log_free_context
does
the
.Dq Va type
field of the new
-.Dq Ft struct log_channel
+.Do
+.Ft struct log_channel
+.Dc
is always set to the appropriate value.
.Pp
The
or
.Xr fdopen 3
fails
-.Po Va errno
+.Po
+.Va errno
is set by the call which failed
.Pc .
If some value other than
or
.Fa category
is invalid (negative or greater than or equal to
-.Va lcp->num_categories ), with
+.Va lcp->num_categories ) ,
+with
.Va errno
set to
.Dv EINVAL ;
-.\" $Id: memcluster.mdoc,v 1.1 2001/03/29 06:31:55 marka Exp $
+.\" $Id: memcluster.mdoc,v 1.1.2.1 2001/11/02 21:06:03 gson Exp $
.\"
.\"Copyright (c) 1995-1999 by Internet Software Consortium
.\"
.\"Os OPERATING_SYSTEM [version/release]
.Os BSD 4
.\"Dt DOCUMENT_TITLE [section number] [volume]
-.Dt memcluster 3
+.Dt MEMCLUSTER 3
.Sh NAME
.Nm meminit ,
.Nm memget ,
as mentioned in the
.Sx INTERNALS
subsection, above, the block is placed at the head of the free list of
-.Va new_size Ns No -sized blocks.
+.Va new_size Ns -sized
+blocks.
If the given
.Fa size
is zero or negative, then
equal to
.Fa size ,
which has these implications:
-.Bl -enum -offset -indent means that, for
+.Bl -enum -offset indent
.It
For
.Fa size
-.\" $Id: tree.mdoc,v 1.1 2001/03/29 06:31:55 marka Exp $
+.\" $Id: tree.mdoc,v 1.1.2.1 2001/11/02 21:06:04 gson Exp $
.\"
.\"Copyright (c) 1995-1999 by Internet Software Consortium
.\"
.Ft void *
.Fn tree_srch "void **tree" "int (*compare)()" "void *data"
.Ft void
-.Fn tree_add(tree, compare, data, del_uar) "void **tree" "int (*compare)()" \
+.Fn tree_add "void **tree" "int (*compare)()" \
"void *data" "void (*del_uar)()"
.Ft int
-.Fn tree_delete(tree, compare, data, del_uar) "void **tree" "int (*compare)()" \
+.Fn tree_delete "void **tree" "int (*compare)()" \
"void *data" "void (*del_uar)()"
.Ft int
-.Fn tree_trav(tree, trav_uar) "void **tree" "int (*trav_uar)()"
+.Fn tree_trav "void **tree" "int (*trav_uar)()"
.Ft void
-.Fn tree_mung(tree, del_uar) "void **tree" "void (*del_uar)()"
+.Fn tree_mung "void **tree" "void (*del_uar)()"
.Sh DESCRIPTION
These functions create and manipulate a balanced binary (AVL) tree. Each node
of the tree contains the expected left & right subtree pointers, a short int
inserts or replaces a node in the specified tree. The tree specified by
.Dq Fa tree
is searched as in
-.Fn tree_srch,
+.Fn tree_srch ,
and if a node is found to match
-.Dq Fa data,
+.Dq Fa data ,
then the
.Fn del_uar
function, if non\-\s-2NULL\s+2, is called with the address of the user data
block for the node (this routine should deallocate any dynamic memory which
is referenced exclusively by the node); the user data pointer for the node
is then replaced by the value of
-.Dq Fa data.
+.Dq Fa data .
If no node is found to match, a new node is added (which may or may not
cause a transparent rebalance operation), with a user data pointer equal to
-.Dq Fa data.
+.Dq Fa data .
A rebalance may or may not occur, depending on where the node is added
and what the rest of the tree looks like.
.Fn Tree_add
.Pp
.Fn Tree_delete
deletes a node from
-.Dq Fa tree.
+.Dq Fa tree .
A rebalance may or may not occur, depending on where the node is removed from
and what the rest of the tree looks like.
.Fn Tree_delete
.Pp
.Fn Tree_trav
traverses all of
-.Dq Fa tree,
+.Dq Fa tree ,
calling
.Fn trav_uar
with the address of each user data block. If
.Pp
.Fn Tree_mung
deletes every node in
-.Dq Fa tree,
+.Dq Fa tree ,
calling
.Fn del_uar
(if it is not \s-2NULL\s+2) with the user data address from each node (see
projects / thirdparty / bind9.git / commitdiff
