Aren/NetBSD
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

"Utilize" has exactly the same meaning as "use," but it is more

Browse Source 
difficult to read and understand. Most manuals of English style
therefore say that you should use "use".
This commit is contained in:
perry 2003-02-05 00:02:24 +00:00
parent b8c616269f
commit 1f4ad37fe3
29 changed files with 77 additions and 77 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
bin/csh/USD.doc/csh.g
View File

@ -1,4 +1,4 @@
.\" $NetBSD: csh.g,v 1.3 1995/03/21 09:03:42 cgd Exp $
.\" $NetBSD: csh.g,v 1.4 2003/02/05 00:02:24 perry Exp $
.\"
.\" Copyright (c) 1980, 1993
.\" The Regents of the University of California. All rights reserved.
@ -1596,7 +1596,7 @@ The
.I time
command can be used to measure the amount of \s-2CPU\s0
and real time consumed by a specified command as well
as the amount of disk i/o, memory utilized, and number
as the amount of disk i/o, memory used, and number
of page faults and swaps taken by the command (2.1, 2.8).
.IP tset
The

6
lib/libpcap/README
View File

@ -1,4 +1,4 @@
$NetBSD: README,v 1.4 1997/10/03 15:53:01 christos Exp $
$NetBSD: README,v 1.5 2003/02/05 00:02:25 perry Exp $
@(#) Header: README,v 1.18 97/06/12 14:23:56 leres Exp (LBL)
LIBPCAP 0.4
@ -27,7 +27,7 @@ User-level Packet Capture''. A compressed postscript version is in:
ftp://ftp.ee.lbl.gov/papers/bpf-usenix93.ps.Z.
Although most packet capture interfaces support in-kernel filtering,
libpcap utilizes in-kernel filtering only for the BPF interface.
libpcap uses in-kernel filtering only for the BPF interface.
On systems that don't have BPF, all packets are read into user-space
and the BPF filters are evaluated in the libpcap library, incurring
added overhead (especially, for selective filters). Ideally, libpcap
@ -36,7 +36,7 @@ with the underlying kernel subsystem, but this is not yet implemented.
BPF is standard in 4.4BSD, BSD/386, NetBSD, and FreeBSD. DEC OSF/1
uses the packetfilter interface but has been extended to accept BPF
filters (which libpcap utilizes). Also, you can add BPF filter support
filters (which libpcap uses). Also, you can add BPF filter support
to Ultrix using the kernel source and/or object patches available in:
ftp://gatekeeper.dec.com/pub/DEC/net/bpfext42.tar.Z.

6
libexec/lfs_cleanerd/cleanerd.c
View File

@ -1,4 +1,4 @@
/* $NetBSD: cleanerd.c,v 1.42 2003/01/28 08:34:17 mrg Exp $ */
/* $NetBSD: cleanerd.c,v 1.43 2003/02/05 00:02:25 perry Exp $ */
/*-
* Copyright (c) 1992, 1993
@ -40,7 +40,7 @@ __COPYRIGHT("@(#) Copyright (c) 1992, 1993\n\
#if 0
static char sccsid[] = "@(#)cleanerd.c 8.5 (Berkeley) 6/10/95";
#else
__RCSID("$NetBSD: cleanerd.c,v 1.42 2003/01/28 08:34:17 mrg Exp $");
__RCSID("$NetBSD: cleanerd.c,v 1.43 2003/02/05 00:02:25 perry Exp $");
#endif
#endif /* not lint */
@ -587,7 +587,7 @@ clean_fs(FS_INFO *fsp, unsigned long (*cost_func)(FS_INFO *, SEGUSE *),
/*
* Segment with the highest priority get sorted to the beginning of the
* list. This sort assumes that empty segments always have a higher
* cost/benefit than any utilized segment.
* cost/benefit than any used segment.
*/
int
cost_compare(const void *a, const void *b)

4
share/doc/iso/wisc/esis_design.nr
View File

@ -1,4 +1,4 @@
.\" $NetBSD: esis_design.nr,v 1.2 1998/01/09 06:34:45 perry Exp $
.\" $NetBSD: esis_design.nr,v 1.3 2003/02/05 00:02:26 perry Exp $
.\"
.NC "The Design of the ARGO Network Layer"
.sh 1 "End System to Intermediate System Routing Protocol"
@ -26,7 +26,7 @@ System (ES-IS) Routing Exchange Protocol.
.sh 2 "Kernel Resident Features"
.sh 3 "Support for PDU Transmission"
- need mechanism to send/receive PDUs
- utilize ES-IS socket (like raw socket)
- use ES-IS socket (like raw socket)
- socket(AF_ISO, SOCK_DGRAM, ISOPROTO_ESIS)
.sh 4 "Sending PDUs"
- sendmsg() used for transmitting PDUS

4
share/doc/papers/bus_dma/3.me
View File

@ -1,4 +1,4 @@
.\" $NetBSD: 3.me,v 1.1 1998/07/15 00:34:54 thorpej Exp $
.\" $NetBSD: 3.me,v 1.2 2003/02/05 00:02:26 perry Exp $
.\"
.\" Copyright (c) 1998 Jason R. Thorpe.
.\" All rights reserved.
@ -85,7 +85,7 @@ are also four placeholder flags, \fBBUS_DMA_BUS1\fR through
\fBBUS_DMA_BUS4\fR. These flags are reserved for the individual
bus layers, which may need to define special semantics specific to
that bus. An example of this is the ability of VESA local bus
devices to utilize 32-bit DMA addresses; while the kernel considers
devices to use 32-bit DMA addresses; while the kernel considers
such devices to be logically connected to the ISA bus, they are not
limited to the addressing constraints of other ISA devices.
The placeholder flags allow such special cases to be handled on

4
share/doc/papers/bus_dma/4.me
View File

@ -1,4 +1,4 @@
.\" $NetBSD: 4.me,v 1.1 1998/07/15 00:34:54 thorpej Exp $
.\" $NetBSD: 4.me,v 1.2 2003/02/05 00:02:27 perry Exp $
.\"
.\" Copyright (c) 1998 Jason R. Thorpe.
.\" All rights reserved.
@ -247,7 +247,7 @@ special DMA requirements. This may change in future versions of the
system.
.)f
All of the common interface methods may be called directly from the
DMA tag's function switch. Both the PCI and EISA DMA tags utilize
DMA tag's function switch. Both the PCI and EISA DMA tags use
this feature; they provide no bus-specific DMA methods. The ISA DMA
front-ends provide support for DMA bouncing if the system has more
than 16MB of physical memory. If the system has 16MB of physical

4
share/doc/psd/05.sysman/1.6.t
View File

@ -1,4 +1,4 @@
.\" $NetBSD: 1.6.t,v 1.2 1998/01/09 06:54:45 perry Exp $
.\" $NetBSD: 1.6.t,v 1.3 2003/02/05 00:02:27 perry Exp $
.\"
.\" Copyright (c) 1983, 1993, 1994
.\" The Regents of the University of California. All rights reserved.
@ -73,7 +73,7 @@ Only the super-user may lower priorities.
.PP
The
.Fn getrusage
call returns information describing the resources utilized by the
call returns information describing the resources used by the
current process (RUSAGE_SELF),
or all its terminated descendent processes (RUSAGE_CHILDREN):
.DS

4
share/doc/psd/21.ipc/5.t
View File

@ -1,4 +1,4 @@
.\" $NetBSD: 5.t,v 1.2 1998/01/09 06:55:14 perry Exp $
.\" $NetBSD: 5.t,v 1.3 2003/02/05 00:02:27 perry Exp $
.\"
.\" Copyright (c) 1986, 1993
.\" The Regents of the University of California. All rights reserved.
@ -48,7 +48,7 @@
A number of facilities have yet to be discussed. For most users
of the IPC the mechanisms already
described will suffice in constructing distributed
applications. However, others will find the need to utilize some
applications. However, others will find the need to use some
of the features which we consider in this section.
.NH 2
Out of band data

4
share/doc/smm/18.net/1.t
View File

@ -1,4 +1,4 @@
.\" $NetBSD: 1.t,v 1.2 1998/01/09 06:55:41 perry Exp $
.\" $NetBSD: 1.t,v 1.3 2003/02/05 00:02:28 perry Exp $
.\"
.\" Copyright (c) 1983, 1986, 1993
.\" The Regents of the University of California. All rights reserved.
@ -64,5 +64,5 @@ any additional ideas are introduced.
.PP
The remainder of this document
provides a description of the system internals,
avoiding, when possible, those portions which are utilized only
avoiding, when possible, those portions which are used only
by the interprocess communication facilities.

4
share/doc/smm/18.net/2.t
View File

@ -1,4 +1,4 @@
.\" $NetBSD: 2.t,v 1.2 1998/01/09 06:55:41 perry Exp $
.\" $NetBSD: 2.t,v 1.3 2003/02/05 00:02:28 perry Exp $
.\"
.\" Copyright (c) 1983, 1986, 1993
.\" The Regents of the University of California. All rights reserved.
@ -65,7 +65,7 @@ to acknowledge a transfer results in retransmission of
the data. Sequencing may be handled by tagging
each message handed to the network layer by a
\fIsequence number\fP and maintaining
state at the endpoints of communication to utilize
state at the endpoints of communication to use
received sequence numbers in reordering data which
arrives out of order.
.PP

4
share/doc/smm/18.net/6.t
View File

@ -1,4 +1,4 @@
.\" $NetBSD: 6.t,v 1.2 1998/01/09 06:55:44 perry Exp $
.\" $NetBSD: 6.t,v 1.3 2003/02/05 00:02:29 perry Exp $
.\"
.\" Copyright (c) 1983, 1986, 1993
.\" The Regents of the University of California. All rights reserved.
@ -499,7 +499,7 @@ UNIBUS interfaces
All hardware related interfaces currently reside on the UNIBUS.
Consequently a common set of utility routines for dealing
with the UNIBUS has been developed. Each UNIBUS interface
utilizes a structure of the following form:
uses a structure of the following form:
.DS
.ta \w'#define 'u +\w'ifw_xtofree 'u +\w'pte ifu_wmap[IF_MAXNUBAMR]; 'u
struct ifubinfo {

4
share/doc/smm/18.net/b.t
View File

@ -1,4 +1,4 @@
.\" $NetBSD: b.t,v 1.2 1998/01/09 06:55:49 perry Exp $
.\" $NetBSD: b.t,v 1.3 2003/02/05 00:02:29 perry Exp $
.\"
.\" Copyright (c) 1983, 1986, 1993
.\" The Regents of the University of California. All rights reserved.
@ -46,7 +46,7 @@ processes which wish to take advantage of some protocol
feature not directly accessible through the normal interface, or
for the development of new protocols built atop existing lower level
protocols. For example, a new version of TCP might be developed at the
user level by utilizing a raw IP socket for delivery of packets.
user level by using a raw IP socket for delivery of packets.
The raw IP socket interface attempts to provide an identical interface
to the one a protocol would have if it were resident in the kernel.
.PP

4
share/man/tools/README
View File

@ -90,7 +90,7 @@ The following describes these 14 procedures:
Missing `.so' entries are written to the files _n_e_e_d_s_o[_1-_8].
5. ckspell
Utilizes _s_p_e_l_l to check for spelling errors in manual
Uses _s_p_e_l_l to check for spelling errors in manual
entries. Produces file _s_p._e_r_r_s containing a section-by-
section list of errors. Uses file /_u_s_r/_m_a_n/_t_o_o_l_s/_s_p._i_g_n_o_r_e
to eliminate strings that appear often in the manual and are
@ -122,7 +122,7 @@ The following describes these 14 procedures:
(see `ckso' above).
10. mroff
Utilizes the _m_a_n command to _t_r_o_f_f and typeset manual entries.
Uses the _m_a_n command to _t_r_o_f_f and typeset manual entries.
The `-p' (yes, `-p'!) option is used to produce entries in a
6x9 inch format, as opposed to the default 8.5x11. Produces
files _m_l_o_g[_1-_8] containing logs of the files that were

4
share/man/tools/TOOLKIT
View File

@ -90,7 +90,7 @@ The following describes these 14 procedures:
Missing `.so' entries are written to the files _n_e_e_d_s_o[_1-_8].
5. ckspell
Utilizes _s_p_e_l_l to check for spelling errors in manual
Uses _s_p_e_l_l to check for spelling errors in manual
entries. Produces file _s_p._e_r_r_s containing a section-by-
section list of errors. Uses file /_u_s_r/_m_a_n/_t_o_o_l_s/_s_p._i_g_n_o_r_e
to eliminate strings that appear often in the manual and are
@ -122,7 +122,7 @@ The following describes these 14 procedures:
(see `ckso' above).
10. mroff
Utilizes the _m_a_n command to _t_r_o_f_f and typeset manual entries.
Uses the _m_a_n command to _t_r_o_f_f and typeset manual entries.
The `-p' (yes, `-p'!) option is used to produce entries in a
6x9 inch format, as opposed to the default 8.5x11. Produces
files _m_l_o_g[_1-_8] containing logs of the files that were

4
sys/arch/alpha/a12/if_ade.c
View File

@ -1,4 +1,4 @@
/* $NetBSD: if_ade.c,v 1.19 2003/01/31 05:00:25 thorpej Exp $ */
/* $NetBSD: if_ade.c,v 1.20 2003/02/05 00:02:30 perry Exp $ */
/*
* NOTE: this version of if_de was modified for bounce buffers prior
@ -1902,7 +1902,7 @@ static const tulip_boardsw_t tulip_2114x_isv_boardsw = {
/*
* At least in some versions of the driver, all 2114x are mapped to
* tulip_21140_eb_boardsw, so this isn't necessarily going to be
* utilized. But for possible later use, provide this as a clone of
* used. But for possible later use, provide this as a clone of
* the dec evalboard configuration. The Avalon card should look the
* same to the software as the eval card, with the exception of the
* srom format in the early production units.

8
sys/arch/amiga/dev/grf_rhreg.h
View File

@ -1,4 +1,4 @@
/* $NetBSD: grf_rhreg.h,v 1.10 2002/01/26 13:40:55 aymeric Exp $ */
/* $NetBSD: grf_rhreg.h,v 1.11 2003/02/05 00:02:31 perry Exp $ */
/*
* Copyright (c) 1994 Markus Wild
@ -285,7 +285,7 @@ struct MonDef {
unsigned short w, unsigned short h );
/*
* This Routine utilizes the blitter to perform fast copies
* This Routine uses the blitter to perform fast copies
* in the text-display. The paramters are:
* xs - source x-coordinate
* ys - source y-coordinate
@ -303,7 +303,7 @@ struct MonDef {
unsigned short w, unsigned short h );
/*
* RZ3AlphaErase utilizes the blitter to erase portions of
* RZ3AlphaErase uses the blitter to erase portions of
* the text-display. The parameters are:
* xd - destination x-coordinate
* yd - destination y-coordinate
@ -324,7 +324,7 @@ struct MonDef {
void RZ3BitBlit (struct grf_bitblt * gbb );
/*
* RZ3BitBlit utilizes the blitter to perform one of 16
* RZ3BitBlit uses the blitter to perform one of 16
* available logical operations on the display memory,
* among them ordinary fill- and copy operations.
* The only parameter is a pointer to a struct grf_bitblt:

6
sys/arch/amiga/dev/ms.c
View File

@ -1,4 +1,4 @@
/* $NetBSD: ms.c,v 1.24 2002/10/23 09:10:34 jdolecek Exp $ */
/* $NetBSD: ms.c,v 1.25 2003/02/05 00:02:31 perry Exp $ */
/*
* based on:
@ -49,7 +49,7 @@
*/
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: ms.c,v 1.24 2002/10/23 09:10:34 jdolecek Exp $");
__KERNEL_RCSID(0, "$NetBSD: ms.c,v 1.25 2003/02/05 00:02:31 perry Exp $");
/*
* Mouse driver.
@ -126,7 +126,7 @@ const struct cdevsw ms_cdevsw = {
/*
* Given a dev_t, return a pointer to the port's hardware state.
* Assumes the unit to be valid, so do *not* utilize this in msopen().
* Assumes the unit to be valid, so do *not* use this in msopen().
*/
#define MS_DEV2MSPORT(d) \
(&(((struct ms_softc *)getsoftc(ms_cd, MS_UNIT(d)))->sc_ports[MS_PORT(d)]))

12
sys/arch/m68k/060sp/dist/fplsp.s vendored
View File

@ -1,5 +1,5 @@
#
# $NetBSD: fplsp.s,v 1.1 2000/04/14 20:24:37 is Exp $
# $NetBSD: fplsp.s,v 1.2 2003/02/05 00:02:32 perry Exp $
#
#~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@ -6799,7 +6799,7 @@ sacosd:
# b) Even with the restrictions above, #
# |p - (exp(R)-1)| < 2^(-68.8) for all |R| <= 0.0062. #
# Note that 0.0062 is slightly bigger than 0.57 log2/64. #
# c) To fully utilize the pipeline, p is separated into #
# c) To fully use the pipeline, p is separated into #
# two independent pieces of roughly equal complexities #
# p = [ R + R*S*(A2 + S*A4) ] + #
# [ S*(A1 + S*(A3 + S*A5)) ] #
@ -6927,7 +6927,7 @@ sacosd:
# b) Even with the restriction above, #
# |p - (exp(R)-1)| < |R| * 2^(-72.7) #
# for all |R| <= 0.0055. #
# c) To fully utilize the pipeline, p is separated into #
# c) To fully use the pipeline, p is separated into #
# two independent pieces of roughly equal complexity #
# p = [ R*S*(A2 + S*(A4 + S*A6)) ] + #
# [ R + S*(A1 + S*(A3 + S*A5)) ] #
@ -6990,7 +6990,7 @@ sacosd:
# computed as #
# X + ( S*B1 + Q ) where S = X*X and #
# Q = X*S*(B2 + X*(B3 + ... + X*B12)) #
# d) To fully utilize the pipeline, Q is separated into #
# d) To fully use the pipeline, Q is separated into #
# two independent pieces of roughly equal complexity #
# Q = [ X*S*(B2 + S*(B4 + ... + S*B12)) ] + #
# [ S*S*(B3 + S*(B5 + ... + S*B11)) ] #
@ -7159,7 +7159,7 @@ EXPCONT1:
#--Step 4.
#--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
#-- R + R*R*(A1 + R*(A2 + R*(A3 + R*(A4 + R*A5))))
#--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
#--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*R
#--[R+R*S*(A2+S*A4)] + [S*(A1+S*(A3+S*A5))]
fmov.x %fp0,%fp1
@ -7322,7 +7322,7 @@ EM1MAIN:
#--Step 4.
#--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
#-- R + R*R*(A1 + R*(A2 + R*(A3 + R*(A4 + R*(A5 + R*A6)))))
#--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
#--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*R
#--[R*S*(A2+S*(A4+S*A6))] + [R+S*(A1+S*(A3+S*A5))]
fmov.x %fp0,%fp1

12
sys/arch/m68k/060sp/dist/fpsp.s vendored
View File

@ -1,5 +1,5 @@
#
# $NetBSD: fpsp.s,v 1.2 2001/09/16 16:34:30 wiz Exp $
# $NetBSD: fpsp.s,v 1.3 2003/02/05 00:02:33 perry Exp $
#
#~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@ -6905,7 +6905,7 @@ sacosd:
# b) Even with the restrictions above, #
# |p - (exp(R)-1)| < 2^(-68.8) for all |R| <= 0.0062. #
# Note that 0.0062 is slightly bigger than 0.57 log2/64. #
# c) To fully utilize the pipeline, p is separated into #
# c) To fully use the pipeline, p is separated into #
# two independent pieces of roughly equal complexities #
# p = [ R + R*S*(A2 + S*A4) ] + #
# [ S*(A1 + S*(A3 + S*A5)) ] #
@ -7033,7 +7033,7 @@ sacosd:
# b) Even with the restriction above, #
# |p - (exp(R)-1)| < |R| * 2^(-72.7) #
# for all |R| <= 0.0055. #
# c) To fully utilize the pipeline, p is separated into #
# c) To fully use the pipeline, p is separated into #
# two independent pieces of roughly equal complexity #
# p = [ R*S*(A2 + S*(A4 + S*A6)) ] + #
# [ R + S*(A1 + S*(A3 + S*A5)) ] #
@ -7096,7 +7096,7 @@ sacosd:
# computed as #
# X + ( S*B1 + Q ) where S = X*X and #
# Q = X*S*(B2 + X*(B3 + ... + X*B12)) #
# d) To fully utilize the pipeline, Q is separated into #
# d) To fully use the pipeline, Q is separated into #
# two independent pieces of roughly equal complexity #
# Q = [ X*S*(B2 + S*(B4 + ... + S*B12)) ] + #
# [ S*S*(B3 + S*(B5 + ... + S*B11)) ] #
@ -7265,7 +7265,7 @@ EXPCONT1:
#--Step 4.
#--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
#-- R + R*R*(A1 + R*(A2 + R*(A3 + R*(A4 + R*A5))))
#--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
#--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*R
#--[R+R*S*(A2+S*A4)] + [S*(A1+S*(A3+S*A5))]
fmov.x %fp0,%fp1
@ -7428,7 +7428,7 @@ EM1MAIN:
#--Step 4.
#--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
#-- R + R*R*(A1 + R*(A2 + R*(A3 + R*(A4 + R*(A5 + R*A6)))))
#--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
#--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*R
#--[R*S*(A2+S*(A4+S*A6))] + [R+S*(A1+S*(A3+S*A5))]
fmov.x %fp0,%fp1

12
sys/arch/m68k/fpsp/setox.sa
View File

@ -1,4 +1,4 @@
* $NetBSD: setox.sa,v 1.3 1994/10/26 07:49:42 cgd Exp $
* $NetBSD: setox.sa,v 1.4 2003/02/05 00:02:35 perry Exp $
* MOTOROLA MICROPROCESSOR & MEMORY TECHNOLOGY GROUP
* M68000 Hi-Performance Microprocessor Division
@ -164,7 +164,7 @@
* b) Even with the restrictions above,
* |p - (exp(R)-1)| < 2^(-68.8) for all |R| <= 0.0062.
* Note that 0.0062 is slightly bigger than 0.57 log2/64.
* c) To fully utilize the pipeline, p is separated into
* c) To fully use the pipeline, p is separated into
* two independent pieces of roughly equal complexities
* p = [ R + R*S*(A2 + S*A4) ] +
* [ S*(A1 + S*(A3 + S*A5)) ]
@ -284,7 +284,7 @@
* b) Even with the restriction above,
* |p - (exp(R)-1)| < |R| * 2^(-72.7)
* for all |R| <= 0.0055.
* c) To fully utilize the pipeline, p is separated into
* c) To fully use the pipeline, p is separated into
* two independent pieces of roughly equal complexity
* p = [ R*S*(A2 + S*(A4 + S*A6)) ] +
* [ R + S*(A1 + S*(A3 + S*A5)) ]
@ -343,7 +343,7 @@
* c) To fully preserve accuracy, the polynomial is computed
* as X + ( S*B1 + Q ) where S = X*X and
* Q = X*S*(B2 + X*(B3 + ... + X*B12))
* d) To fully utilize the pipeline, Q is separated into
* d) To fully use the pipeline, Q is separated into
* two independent pieces of roughly equal complexity
* Q = [ X*S*(B2 + S*(B4 + ... + S*B12)) ] +
* [ S*S*(B3 + S*(B5 + ... + S*B11)) ]
@ -536,7 +536,7 @@ EXPCONT1:
*--Step 4.
*--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
*-- R + R*R*(A1 + R*(A2 + R*(A3 + R*(A4 + R*A5))))
*--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
*--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*R
*--[R+R*S*(A2+S*A4)] + [S*(A1+S*(A3+S*A5))]
FMOVE.X fp0,fp1
@ -703,7 +703,7 @@ EM1MAIN:
*--Step 4.
*--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
*-- R + R*R*(A1 + R*(A2 + R*(A3 + R*(A4 + R*(A5 + R*A6)))))
*--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
*--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*R
*--[R*S*(A2+S*(A4+S*A6))] + [R+S*(A1+S*(A3+S*A5))]
FMOVE.X fp0,fp1

4
sys/arch/mipsco/include/prom.h
View File

@ -1,4 +1,4 @@
/* $NetBSD: prom.h,v 1.6 2001/02/06 04:32:29 wdk Exp $ */
/* $NetBSD: prom.h,v 1.7 2003/02/05 00:02:35 perry Exp $ */
/*
* Copyright (c) 2000 The NetBSD Foundation, Inc.
@ -57,7 +57,7 @@ struct mips_prom {
void (*prom_reset) __P((void)) __attribute__((__noreturn__));
/*
* called to utilize prom to boot new image. After the booted
* called to use prom to boot new image. After the booted
* program returns control can either be returned to the
* original caller of the exec routine or to the prom monitor.
* (to return to the original caller, the new program must

4
sys/arch/shark/shark/pccons.c
View File

@ -1,4 +1,4 @@
/* $NetBSD: pccons.c,v 1.14 2003/01/28 22:35:15 wiz Exp $ */
/* $NetBSD: pccons.c,v 1.15 2003/02/05 00:02:36 perry Exp $ */
/*
* Copyright 1997
@ -85,7 +85,7 @@
** The driver has been cleaned up a little as part of the StrongARM
** porting work. The main modifications have been to change the
** driver to use the bus_space_ macros, re-organise the sget and sput
** mechanisms and utilise a more robust set of i8042 keybord controller
** mechanisms and use a more robust set of i8042 keybord controller
** routines which are now external to this module and also used by the
** opms mouse driver.
**

4
sys/arch/sparc64/dev/power.c
View File

@ -1,4 +1,4 @@
/* $NetBSD: power.c,v 1.4 2002/10/02 16:02:18 thorpej Exp $ */
/* $NetBSD: power.c,v 1.5 2003/02/05 00:02:36 perry Exp $ */
/*
* Copyright (c) 1996
@ -61,7 +61,7 @@ extern struct cfdriver power_cd;
* machines. This allows the machine to remove power automatically when
* shutdown or halted or whatever.
*
* XXX: this capability is not utilized in the current kernel.
* XXX: this capability is not used in the current kernel.
*/
static int

6
sys/dev/pci/cz.c
View File

@ -1,4 +1,4 @@
/* $NetBSD: cz.c,v 1.25 2003/01/31 00:07:41 thorpej Exp $ */
/* $NetBSD: cz.c,v 1.26 2003/02/05 00:02:37 perry Exp $ */
/*-
* Copyright (c) 2000 Zembu Labs, Inc.
@ -40,7 +40,7 @@
* Some notes:
*
* - The Cyclades-Z has fully automatic hardware (and software!)
* flow control. We only utilize RTS/CTS flow control here,
* flow control. We only use RTS/CTS flow control here,
* and it is implemented in a very simplistic manner. This
* may be an area of future work.
*
@ -73,7 +73,7 @@
*/
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: cz.c,v 1.25 2003/01/31 00:07:41 thorpej Exp $");
__KERNEL_RCSID(0, "$NetBSD: cz.c,v 1.26 2003/02/05 00:02:37 perry Exp $");
#include <sys/param.h>
#include <sys/systm.h>

4
sys/dev/raidframe/rf_evenodd_dagfuncs.h
View File

@ -1,4 +1,4 @@
/* $NetBSD: rf_evenodd_dagfuncs.h,v 1.2 1999/02/05 00:06:11 oster Exp $ */
/* $NetBSD: rf_evenodd_dagfuncs.h,v 1.3 2003/02/05 00:02:38 perry Exp $ */
/*
* rf_evenodd_dagfuncs.h
*/
@ -71,7 +71,7 @@ int rf_EOWriteDoubleRecoveryFunc(RF_DagNode_t * node);
/*
* RF_EO_MATRIX_DIM should be a prime number: and "bytesPerSector" should be
* dividable by ( RF_EO_MATRIX_DIM - 1) to fully encode and utilize the space
* dividable by ( RF_EO_MATRIX_DIM - 1) to fully encode and use the space
* in a sector, this number could also be 17. Tha later case doesn't apply
* for disk array larger than 17 columns totally.
*/

6
sys/netccitt/pk_llcsubr.c
View File

@ -1,4 +1,4 @@
/* $NetBSD: pk_llcsubr.c,v 1.13 2002/10/24 20:54:41 christos Exp $ */
/* $NetBSD: pk_llcsubr.c,v 1.14 2003/02/05 00:02:38 perry Exp $ */
/*
* Copyright (c) 1990, 1991, 1992
@ -43,7 +43,7 @@
*/
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: pk_llcsubr.c,v 1.13 2002/10/24 20:54:41 christos Exp $");
__KERNEL_RCSID(0, "$NetBSD: pk_llcsubr.c,v 1.14 2003/02/05 00:02:38 perry Exp $");
#include "opt_llc.h"
@ -95,7 +95,7 @@ __KERNEL_RCSID(0, "$NetBSD: pk_llcsubr.c,v 1.13 2002/10/24 20:54:41 christos Exp
*
* {X.121_a, X.121_b, X.121_c, ..., X.121_i} -> pkcb_0
*
* LLC2 utilizes the DTE-DTE model of X.25, resulting effectively in a
* LLC2 uses the DTE-DTE model of X.25, resulting effectively in a
* one-to-one relationship, i.e.:
*
* {X.121_j} -> pkcb_1a

4
sys/sys/cdefs.h
View File

@ -1,4 +1,4 @@
/* $NetBSD: cdefs.h,v 1.47 2003/01/18 18:05:56 christos Exp $ */
/* $NetBSD: cdefs.h,v 1.48 2003/02/05 00:02:39 perry Exp $ */
/*
* Copyright (c) 1991, 1993
@ -242,7 +242,7 @@
* code blocks can be reordered such that the predicted path
* sees a more linear flow, thus improving cache behavior, etc.
*
* The following two macros provide us with a way to utilize this
* The following two macros provide us with a way to use this
* compiler feature. Use __predict_true() if you expect the expression
* to evaluate to true, and __predict_false() if you expect the
* expression to evaluate to false.

4
usr.bin/at/privs.h
View File

@ -1,4 +1,4 @@
/* $NetBSD: privs.h,v 1.5 2002/07/10 23:16:34 wiz Exp $ */
/* $NetBSD: privs.h,v 1.6 2003/02/05 00:02:39 perry Exp $ */
/*
* privs.h - header for privileged operations
@ -34,7 +34,7 @@
/* Relinquish privileges temporarily for a setuid or setgid program
* with the option of getting them back later. This is done by
* utilizing POSIX saved user and groups ids. Call RELINQUISH_PRIVS once
* using POSIX saved user and groups ids. Call RELINQUISH_PRIVS once
* at the beginning of the main program. This will cause all operatons
* to be executed with the real userid. When you need the privileges
* of the setuid/setgid invocation, call PRIV_START; when you no longer

4
usr.bin/vi/docs/USD.doc/vitut/vi.in
View File

@ -1,4 +1,4 @@
.\" $NetBSD: vi.in,v 1.3 2001/03/31 11:37:49 aymeric Exp $
.\" $NetBSD: vi.in,v 1.4 2003/02/05 00:02:40 perry Exp $
.\"
.\" Copyright (c) 1980, 1993
.\" The Regents of the University of California. All rights reserved.
@ -1802,7 +1802,7 @@ be expanded as you would have given it on the initial
command.
.PP
If you are editing large programs, you will find the \fB:ta\fR command
very useful. It utilizes a data base of function names and their locations,
very useful. It uses a data base of function names and their locations,
which can be created by programs such as
.I ctags,
to quickly find a function whose name you give.