Mirrors
/
netbsd-src
mirror of https://github.com/NetBSD/src.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

s/similarily/similarly/

bouyer-sunxi-drm
andvar 2022-04-12 20:51:42 +00:00
parent 06ddeb9f13
commit bdd61daa31
3 changed files with 14 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
sbin/mount_tmpfs/mount_tmpfs.8
View File

@ -1,4 +1,4 @@
.\" $NetBSD: mount_tmpfs.8,v 1.18 2014/06/07 10:03:44 martin Exp $
.\" $NetBSD: mount_tmpfs.8,v 1.19 2022/04/12 20:51:42 andvar Exp $
.\"
.\" Copyright (c) 2005, 2006 The NetBSD Foundation, Inc.
.\" All rights reserved.
@ -94,7 +94,7 @@ system ram by using the notation
where
.Ar n
is a number between 1 and 100.
Similarily it can be specified as a fraction of the available system
Similarly it can be specified as a fraction of the available system
ram by using
.Ar ram/n
where

6
sys/dev/ic/ispvar.h
View File

@ -1,4 +1,4 @@
/* $NetBSD: ispvar.h,v 1.74 2021/09/11 20:28:06 andvar Exp $ */
/* $NetBSD: ispvar.h,v 1.75 2022/04/12 20:51:42 andvar Exp $ */
/*
* Copyright (C) 1999 National Aeronautics & Space Administration
* All rights reserved.
@ -395,9 +395,9 @@ typedef struct {
* index to put it into the Database, but that's just an optimization. We mark
* the entry VALID and make sure that the target index is updated and correct.
*
* When we get done searching the local loop, we then search similarily for
* When we get done searching the local loop, we then search similarly for
* a list of devices we've gotten from the fabric name controller (if we're
* on a fabric). VALID marking is also done similarily.
* on a fabric). VALID marking is also done similarly.
*
* When all of this is done, we can march through the database and clean up
* any entry that is still PROBATIONAL (these represent devices which have

18
sys/net/zlib.c
View File

@ -1,4 +1,4 @@
/* $NetBSD: zlib.c,v 1.37 2019/07/11 03:49:51 msaitoh Exp $ */
/* $NetBSD: zlib.c,v 1.38 2022/04/12 20:51:42 andvar Exp $ */
/*
* This file is derived from various .h and .c files from the zlib-1.0.4
* distribution by Jean-loup Gailly and Mark Adler, with some additions
@ -11,7 +11,7 @@
* - added inflateIncomp and deflateOutputPending
* - allow strm->next_out to be NULL, meaning discard the output
*
* $Id: zlib.c,v 1.37 2019/07/11 03:49:51 msaitoh Exp $
* $Id: zlib.c,v 1.38 2022/04/12 20:51:42 andvar Exp $
*/
/*
@ -22,7 +22,7 @@
*/
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: zlib.c,v 1.37 2019/07/11 03:49:51 msaitoh Exp $");
__KERNEL_RCSID(0, "$NetBSD: zlib.c,v 1.38 2022/04/12 20:51:42 andvar Exp $");
#define NO_DUMMY_DECL
#define NO_ZCFUNCS
@ -45,7 +45,7 @@ __KERNEL_RCSID(0, "$NetBSD: zlib.c,v 1.37 2019/07/11 03:49:51 msaitoh Exp $");
subject to change. Applications should only use zlib.h.
*/
/* @(#) $Id: zlib.c,v 1.37 2019/07/11 03:49:51 msaitoh Exp $ */
/* @(#) $Id: zlib.c,v 1.38 2022/04/12 20:51:42 andvar Exp $ */
#ifndef _Z_UTIL_H
#define _Z_UTIL_H
@ -294,7 +294,7 @@ void zcfree(voidpf opaque, voidpf ptr);
subject to change. Applications should only use zlib.h.
*/
/* @(#) $Id: zlib.c,v 1.37 2019/07/11 03:49:51 msaitoh Exp $ */
/* @(#) $Id: zlib.c,v 1.38 2022/04/12 20:51:42 andvar Exp $ */
#ifndef _DEFLATE_H
#define _DEFLATE_H
@ -656,7 +656,7 @@ void _tr_stored_type_only(deflate_state *);
*
*/
/* @(#) $Id: zlib.c,v 1.37 2019/07/11 03:49:51 msaitoh Exp $ */
/* @(#) $Id: zlib.c,v 1.38 2022/04/12 20:51:42 andvar Exp $ */
/* #include "deflate.h" */
@ -1999,7 +1999,7 @@ local block_state deflate_slow(deflate_state *s, int flush)
* Addison-Wesley, 1983. ISBN 0-201-06672-6.
*/
/* @(#) $Id: zlib.c,v 1.37 2019/07/11 03:49:51 msaitoh Exp $ */
/* @(#) $Id: zlib.c,v 1.38 2022/04/12 20:51:42 andvar Exp $ */
/* #define GEN_TREES_H */
@ -3986,7 +3986,7 @@ local const uInt border[] = { /* Order of the bit length code lengths */
end-of-block. Note however that the static length tree defines
288 codes just to fill out the Huffman codes. Codes 286 and 287
cannot be used though, since there is no length base or extra bits
defined for them. Similarily, there are up to 30 distance codes.
defined for them. Similarly, there are up to 30 distance codes.
However, static trees define 32 codes (all 5 bits) to fill out the
Huffman codes, but the last two had better not show up in the data.
7. Unzip can check dynamic Huffman blocks for complete code sets.
@ -5813,7 +5813,7 @@ void zcfree (opaque, ptr)
* For conditions of distribution and use, see copyright notice in zlib.h
*/
/* @(#) $Id: zlib.c,v 1.37 2019/07/11 03:49:51 msaitoh Exp $ */
/* @(#) $Id: zlib.c,v 1.38 2022/04/12 20:51:42 andvar Exp $ */
/* #include "zlib.h" */