d/freebsd-skq
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix typos - remove duplicate "is".

Browse Source 
PR:		docs/154934
Submitted by:	Eitan Adler <lists at eitanadler.com>
MFC after:	3 days
This commit is contained in:
Rebecca Cran 2011-02-23 09:22:33 +00:00
parent 8f382a1fd0
commit 974206cf70
8 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
sbin/growfs/growfs.c
View File

@ -646,7 +646,7 @@ cond_bl_upd(ufs2_daddr_t *block, struct gfs_bpp *field, int fsi, int fso,
/* /*
* Copy the block back immediately. * Copy the block back immediately.
* *
* XXX If src is is from an indirect block we have * XXX If src is from an indirect block we have
* to implement copy on write here in case of * to implement copy on write here in case of
* active snapshots. * active snapshots.
*/ */

2
share/doc/papers/devfs/paper.me
View File

@ -779,7 +779,7 @@ The entry points to the device driver are stored in the specinfo
structure, removing the need for the devsw[] array and allowing structure, removing the need for the devsw[] array and allowing
device drivers to use separate entrypoints for various minor numbers. device drivers to use separate entrypoints for various minor numbers.
.lp .lp
This is is very convenient for devices which have a ``control'' This is very convenient for devices which have a ``control''
device for management and tuning. The control device, almost always device for management and tuning. The control device, almost always
have entirely separate open/close/ioctl implementations [MD.C]. have entirely separate open/close/ioctl implementations [MD.C].
.lp .lp

2
share/doc/psd/23.rpc/rpc.prog.ms
View File

@ -71,7 +71,7 @@ manual page.
.I "The Highest Layer:" .I "The Highest Layer:"
.IX RPC "The Highest Layer" .IX RPC "The Highest Layer"
The highest layer is totally transparent to the operating system, The highest layer is totally transparent to the operating system,
machine and network upon which is is run. It's probably best to machine and network upon which is run. It's probably best to
think of this level as a way of think of this level as a way of
.I using .I using
RPC, rather than as RPC, rather than as

2
sys/fs/nullfs/null_vnops.c
View File

@ -672,7 +672,7 @@ null_unlock(struct vop_unlock_args *ap)
* as soon as possible. * as soon as possible.
* *
* Note, we can't release any resources nor remove vnode from hash before * Note, we can't release any resources nor remove vnode from hash before
* appropriate VXLOCK stuff is is done because other process can find this * appropriate VXLOCK stuff is done because other process can find this
* vnode in hash during inactivation and may be sitting in vget() and waiting * vnode in hash during inactivation and may be sitting in vget() and waiting
* for null_inactive to unlock vnode. Thus we will do all those in VOP_RECLAIM. * for null_inactive to unlock vnode. Thus we will do all those in VOP_RECLAIM.
*/ */

2
sys/libkern/jenkins.h
View File

@ -16,7 +16,7 @@
the public domain. It has no warranty. the public domain. It has no warranty.
You probably want to use hashlittle(). hashlittle() and hashbig() You probably want to use hashlittle(). hashlittle() and hashbig()
hash byte arrays. hashlittle() is is faster than hashbig() on hash byte arrays. hashlittle() is faster than hashbig() on
little-endian machines. Intel and AMD are little-endian machines. little-endian machines. Intel and AMD are little-endian machines.
On second thought, you probably want hashlittle2(), which is identical to On second thought, you probably want hashlittle2(), which is identical to
hashlittle() except it returns two 32-bit hashes for the price of one. hashlittle() except it returns two 32-bit hashes for the price of one.

2
sys/net80211/ieee80211_ageq.c
View File

@ -154,7 +154,7 @@ ieee80211_ageq_drain_node(struct ieee80211_ageq *aq,
* deltas (in seconds) relative to the head so we can check * deltas (in seconds) relative to the head so we can check
* and/or adjust only the head of the list. If a frame's age * and/or adjust only the head of the list. If a frame's age
* exceeds the time quanta then remove it. The list of removed * exceeds the time quanta then remove it. The list of removed
* frames is is returned to the caller joined by m_nextpkt. * frames is returned to the caller joined by m_nextpkt.
*/ */
struct mbuf * struct mbuf *
ieee80211_ageq_age(struct ieee80211_ageq *aq, int quanta) ieee80211_ageq_age(struct ieee80211_ageq *aq, int quanta)

2
sys/x86/isa/clock.c
View File

@ -475,7 +475,7 @@ sysctl_machdep_i8254_freq(SYSCTL_HANDLER_ARGS)
/* /*
* Use `i8254' instead of `timer' in external names because `timer' * Use `i8254' instead of `timer' in external names because `timer'
* is is too generic. Should use it everywhere. * is too generic. Should use it everywhere.
*/ */
freq = i8254_freq; freq = i8254_freq;
error = sysctl_handle_int(oidp, &freq, 0, req); error = sysctl_handle_int(oidp, &freq, 0, req);

2
usr.bin/tip/tip/tip.h
View File

@ -259,7 +259,7 @@ int intflag; /* recognized interrupt */
int stoprompt; /* for interrupting a prompt session */ int stoprompt; /* for interrupting a prompt session */
int timedout; /* ~> transfer timedout */ int timedout; /* ~> transfer timedout */
int cumode; /* simulating the "cu" program */ int cumode; /* simulating the "cu" program */
int bits8; /* terminal is is 8-bit mode */ int bits8; /* terminal is 8-bit mode */
#define STRIP_PAR (bits8 ? 0377 : 0177) #define STRIP_PAR (bits8 ? 0377 : 0177)
char fname[PATH_MAX]; /* file name buffer for ~< */ char fname[PATH_MAX]; /* file name buffer for ~< */