| 1 |
30 |
unneback |
.\" Copyright (c) 1986, 1991, 1993
|
| 2 |
|
|
.\" The Regents of the University of California. All rights reserved.
|
| 3 |
|
|
.\"
|
| 4 |
|
|
.\" Redistribution and use in source and binary forms, with or without
|
| 5 |
|
|
.\" modification, are permitted provided that the following conditions
|
| 6 |
|
|
.\" are met:
|
| 7 |
|
|
.\" 1. Redistributions of source code must retain the above copyright
|
| 8 |
|
|
.\" notice, this list of conditions and the following disclaimer.
|
| 9 |
|
|
.\" 2. Redistributions in binary form must reproduce the above copyright
|
| 10 |
|
|
.\" notice, this list of conditions and the following disclaimer in the
|
| 11 |
|
|
.\" documentation and/or other materials provided with the distribution.
|
| 12 |
|
|
.\" 3. All advertising materials mentioning features or use of this software
|
| 13 |
|
|
.\" must display the following acknowledgement:
|
| 14 |
|
|
.\" This product includes software developed by the University of
|
| 15 |
|
|
.\" California, Berkeley and its contributors.
|
| 16 |
|
|
.\" 4. Neither the name of the University nor the names of its contributors
|
| 17 |
|
|
.\" may be used to endorse or promote products derived from this software
|
| 18 |
|
|
.\" without specific prior written permission.
|
| 19 |
|
|
.\"
|
| 20 |
|
|
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
| 21 |
|
|
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 22 |
|
|
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 23 |
|
|
.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
| 24 |
|
|
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 25 |
|
|
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
| 26 |
|
|
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
| 27 |
|
|
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
| 28 |
|
|
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
| 29 |
|
|
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
| 30 |
|
|
.\" SUCH DAMAGE.
|
| 31 |
|
|
.\"
|
| 32 |
|
|
.\" @(#)ns.3 8.1 (Berkeley) 6/4/93
|
| 33 |
|
|
.\" $Id: ns.3,v 1.2 2001-09-27 12:01:53 chris Exp $
|
| 34 |
|
|
.\"
|
| 35 |
|
|
.Dd June 4, 1993
|
| 36 |
|
|
.Dt NS 3
|
| 37 |
|
|
.Os BSD 4.3
|
| 38 |
|
|
.Sh NAME
|
| 39 |
|
|
.Nm ns_addr ,
|
| 40 |
|
|
.Nm ns_ntoa
|
| 41 |
|
|
.Nd Xerox
|
| 42 |
|
|
.Tn NS Ns (tm)
|
| 43 |
|
|
address conversion routines
|
| 44 |
|
|
.Sh SYNOPSIS
|
| 45 |
|
|
.Fd #include
|
| 46 |
|
|
.Fd #include
|
| 47 |
|
|
.Ft struct ns_addr
|
| 48 |
|
|
.Fn ns_addr "char *cp"
|
| 49 |
|
|
.Ft char *
|
| 50 |
|
|
.Fn ns_ntoa "struct ns_addr ns"
|
| 51 |
|
|
.Sh DESCRIPTION
|
| 52 |
|
|
The routine
|
| 53 |
|
|
.Fn ns_addr
|
| 54 |
|
|
interprets character strings representing
|
| 55 |
|
|
.Tn XNS
|
| 56 |
|
|
addresses, returning binary information suitable
|
| 57 |
|
|
for use in system calls.
|
| 58 |
|
|
The routine
|
| 59 |
|
|
.Fn ns_ntoa
|
| 60 |
|
|
takes
|
| 61 |
|
|
.Tn XNS
|
| 62 |
|
|
addresses and returns
|
| 63 |
|
|
.Tn ASCII
|
| 64 |
|
|
strings representing the address in a
|
| 65 |
|
|
notation in common use in the Xerox Development Environment:
|
| 66 |
|
|
.Bd -filled -offset indent
|
| 67 |
|
|
..
|
| 68 |
|
|
.Ed
|
| 69 |
|
|
.Pp
|
| 70 |
|
|
Trailing zero fields are suppressed, and each number is printed in hexadecimal,
|
| 71 |
|
|
in a format suitable for input to
|
| 72 |
|
|
.Fn ns_addr .
|
| 73 |
|
|
Any fields lacking super-decimal digits will have a
|
| 74 |
|
|
trailing
|
| 75 |
|
|
.Ql H
|
| 76 |
|
|
appended.
|
| 77 |
|
|
.Pp
|
| 78 |
|
|
Unfortunately, no universal standard exists for representing
|
| 79 |
|
|
.Tn XNS
|
| 80 |
|
|
addresses.
|
| 81 |
|
|
An effort has been made to insure that
|
| 82 |
|
|
.Fn ns_addr
|
| 83 |
|
|
be compatible with most formats in common use.
|
| 84 |
|
|
It will first separate an address into 1 to 3 fields using a single delimiter
|
| 85 |
|
|
chosen from
|
| 86 |
|
|
period
|
| 87 |
|
|
.Ql \&. ,
|
| 88 |
|
|
colon
|
| 89 |
|
|
.Ql \&:
|
| 90 |
|
|
or pound-sign
|
| 91 |
|
|
.Ql \&# .
|
| 92 |
|
|
Each field is then examined for byte separators (colon or period).
|
| 93 |
|
|
If there are byte separators, each subfield separated is taken to be
|
| 94 |
|
|
a small hexadecimal number, and the entirety is taken as a network-byte-ordered
|
| 95 |
|
|
quantity to be zero extended in the high-network-order bytes.
|
| 96 |
|
|
Next, the field is inspected for hyphens, in which case
|
| 97 |
|
|
the field is assumed to be a number in decimal notation
|
| 98 |
|
|
with hyphens separating the millenia.
|
| 99 |
|
|
Next, the field is assumed to be a number:
|
| 100 |
|
|
It is interpreted
|
| 101 |
|
|
as hexadecimal if there is a leading
|
| 102 |
|
|
.Ql 0x
|
| 103 |
|
|
(as in C),
|
| 104 |
|
|
a trailing
|
| 105 |
|
|
.Ql H
|
| 106 |
|
|
(as in Mesa), or there are any super-decimal digits present.
|
| 107 |
|
|
It is interpreted as octal is there is a leading
|
| 108 |
|
|
.Ql 0
|
| 109 |
|
|
and there are no super-octal digits.
|
| 110 |
|
|
Otherwise, it is converted as a decimal number.
|
| 111 |
|
|
.Sh RETURN VALUES
|
| 112 |
|
|
None. (See
|
| 113 |
|
|
.Sx BUGS . )
|
| 114 |
|
|
.Sh SEE ALSO
|
| 115 |
|
|
.Xr hosts 5 ,
|
| 116 |
|
|
.Xr networks 5
|
| 117 |
|
|
.Sh HISTORY
|
| 118 |
|
|
The
|
| 119 |
|
|
.Fn ns_addr
|
| 120 |
|
|
and
|
| 121 |
|
|
.Fn ns_toa
|
| 122 |
|
|
functions appeared in
|
| 123 |
|
|
.Bx 4.3 .
|
| 124 |
|
|
.Sh BUGS
|
| 125 |
|
|
The string returned by
|
| 126 |
|
|
.Fn ns_ntoa
|
| 127 |
|
|
resides in a static memory area.
|
| 128 |
|
|
The function
|
| 129 |
|
|
.Fn ns_addr
|
| 130 |
|
|
should diagnose improperly formed input, and there should be an unambiguous
|
| 131 |
|
|
way to recognize this.
|
