-/* $OpenBSD: biosboot.S,v 1.12 2022/08/31 10:46:33 krw Exp $ */
+/* $OpenBSD: biosboot.S,v 1.13 2023/05/30 08:30:00 jsg Exp $ */
/*
* Copyright (c) 2003 Tobias Weingartner
/*
* The addw could be a 3 byte instruction, but stick to a 4 byte
- * one since the former inroduces mysterious hangs on *some*
+ * one since the former introduces mysterious hangs on *some*
* BIOS implementations, possibly alignment related.
* Grand prize for somebody finding the root cause!
*/
-/* $OpenBSD: cpufunc.h,v 1.33 2021/05/16 03:39:27 jsg Exp $ */
+/* $OpenBSD: cpufunc.h,v 1.34 2023/05/30 08:30:00 jsg Exp $ */
/* $NetBSD: cpufunc.h,v 1.29 2003/09/06 09:08:35 rearnsha Exp $ */
/*
*
* I-cache Synch (all or range):
* The goal is to synchronize the instruction stream,
- * so you may beed to write-back dirty D-cache blocks
+ * so you may need to write-back dirty D-cache blocks
* first. If a range is requested, and you can't
* synchronize just a range, you have to hit the whole
* thing.
-/* $OpenBSD: cpu.c,v 1.91 2023/05/29 02:26:14 jsg Exp $ */
+/* $OpenBSD: cpu.c,v 1.92 2023/05/30 08:30:00 jsg Exp $ */
/*
* Copyright (c) 2016 Dale Rahn <drahn@dalerahn.com>
int idx, len, node;
/*
- * Hunt for the deppest idle state for this CPU. This is
+ * Hunt for the deepest idle state for this CPU. This is
* fairly complicated as it requires traversing quite a few
* nodes in the device tree. The first step is to look up the
* "psci" power domain for this CPU.
-/* $OpenBSD: pmapae.c,v 1.70 2023/04/13 15:23:22 miod Exp $ */
+/* $OpenBSD: pmapae.c,v 1.71 2023/05/30 08:30:01 jsg Exp $ */
/*
* Copyright (c) 2006-2008 Michael Shalayeff
/* npa = physaddr of PT page */
npa = pd[l2idx] & PMAP_PA_MASK;
- /* Valide PDE for the 2MB region containing va? */
+ /* Valid PDE for the 2MB region containing va? */
if (!npa) {
/*
* No valid PDE - allocate PT page and set PDE. We
-/* $OpenBSD: biosboot.S,v 1.45 2022/09/01 08:18:20 krw Exp $ */
+/* $OpenBSD: biosboot.S,v 1.46 2023/05/30 08:30:01 jsg Exp $ */
/*
* Copyright (c) 2003 Tobias Weingartner
/*
* The addw could be a 3 byte instruction, but stick to a 4 byte
- * one since the former inroduces mysterious hangs on *some*
+ * one since the former introduces mysterious hangs on *some*
* BIOS implementations, possibly alignment related.
* Grand prize for somebody finding the root cause!
*/
-/* $OpenBSD: scif.c,v 1.22 2022/07/02 08:50:41 visa Exp $ */
+/* $OpenBSD: scif.c,v 1.23 2023/05/30 08:30:01 jsg Exp $ */
/* $NetBSD: scif.c,v 1.47 2006/07/23 22:06:06 ad Exp $ */
/*-
void InitializeScif(unsigned int);
/*
- * following functions are debugging prupose only
+ * following functions are for debugging purposes only
*/
#define CR 0x0D
#define USART_ON (unsigned int)~0x08
-/* $OpenBSD: if_dwqe_fdt.c,v 1.11 2023/04/24 01:33:32 dlg Exp $ */
+/* $OpenBSD: if_dwqe_fdt.c,v 1.12 2023/05/30 08:30:01 jsg Exp $ */
/*
* Copyright (c) 2008, 2019 Mark Kettenis <kettenis@openbsd.org>
* Copyright (c) 2017, 2022 Patrick Wildt <patrick@blueri.se>
sc->sc_ifd.if_ifp = ifp;
if_register(&sc->sc_ifd);
- /* force a configuraton of the clocks/mac */
+ /* force a configuration of the clocks/mac */
if (sc->sc_fixed_link)
sc->sc_mii.mii_statchg(self);
}
-/* $OpenBSD: if_ex.c,v 1.48 2022/04/06 18:59:28 naddy Exp $ */
+/* $OpenBSD: if_ex.c,v 1.49 2023/05/30 08:30:01 jsg Exp $ */
/*
* Copyright (c) 1997, Donald A. Schmidt
* Copyright (c) 1996, Javier MartÃn Rueda (jmrueda@diatel.upm.es)
tmp = ex_eeprom_read(sc, EE_IRQ_No) & IRQ_No_Mask;
if (ia->ia_irq > 0) {
if (ee2irqmap[tmp] != ia->ia_irq)
- printf("ex: WARING: board's EEPROM is configured for IRQ %d, using %d\n", ee2irqmap[tmp], ia->ia_irq);
+ printf("ex: WARNING: board's EEPROM is configured for IRQ %d, using %d\n", ee2irqmap[tmp], ia->ia_irq);
sc->irq_no = ia->ia_irq;
}
else {
-/* $OpenBSD: aicasm.c,v 1.16 2014/12/19 22:44:58 guenther Exp $ */
+/* $OpenBSD: aicasm.c,v 1.17 2023/05/30 08:30:01 jsg Exp $ */
/*
* Aic7xxx SCSI host adapter firmware asssembler
*
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGES.
*
- * $Id: aicasm.c,v 1.16 2014/12/19 22:44:58 guenther Exp $
+ * $Id: aicasm.c,v 1.17 2023/05/30 08:30:01 jsg Exp $
*
* $FreeBSD: src/sys/dev/aic7xxx/aicasm/aicasm.c,v 1.37 2004/03/12 21:45:25 trhodes Exp $
*/
argv += optind;
if (argc != 1) {
- fprintf(stderr, "%s: No input file specifiled\n", appname);
+ fprintf(stderr, "%s: No input file specified\n", appname);
usage();
/* NOTREACHED */
}
-/* $OpenBSD: if_xe.c,v 1.62 2022/04/06 18:59:30 naddy Exp $ */
+/* $OpenBSD: if_xe.c,v 1.63 2023/05/30 08:30:01 jsg Exp $ */
/*
* Copyright (c) 1999 Niklas Hallqvist, Brandon Creighton, Job de Haas
/* Set the local memory dividing line. */
if (sc->sc_rev != 1) {
PAGE(sc, 2);
- /* XXX Symbolic constant preferrable. */
+ /* XXX Symbolic constant preferable. */
bus_space_write_2(bst, bsh, offset + RBS0, 0x2000);
}
-/* $OpenBSD: kern_exec.c,v 1.247 2023/04/24 10:22:06 kettenis Exp $ */
+/* $OpenBSD: kern_exec.c,v 1.248 2023/05/30 08:30:01 jsg Exp $ */
/* $NetBSD: kern_exec.c,v 1.75 1996/02/09 18:59:28 christos Exp $ */
/*-
/*
* XXX As a transition mechanism, we don't enforce branch
- * target control floe integrety on partitions mounted with
+ * target control flow integrity on partitions mounted with
* the wxallowed flag.
*/
if (pr->ps_textvp->v_mount &&
-/* $OpenBSD: subr_blist.c,v 1.3 2022/08/13 16:02:15 semarie Exp $ */
+/* $OpenBSD: subr_blist.c,v 1.4 2023/05/30 08:30:01 jsg Exp $ */
/* DragonFlyBSD:7b80531f545c7d3c51c1660130c71d01f6bccbe0:/sys/kern/subr_blist.c */
/*
* BLIST.C - Bitmap allocator/deallocator, using a radix tree with hinting
* due to swap interleaving not all that much less), but the blist code
* scales much, much better.
*
- * LAYOUT: The radix tree is layed out recursively using a
- * linear array. Each meta node is immediately followed (layed out
+ * LAYOUT: The radix tree is laid out recursively using a
+ * linear array. Each meta node is immediately followed (laid out
* sequentially in memory) by BLIST_META_RADIX lower level nodes. This
* is a recursive structure but one that can be easily scanned through
* a very simple 'skip' calculation. In order to support large radixes,
* ranges.
*
* NOTE: The radix may exceed BLIST_BMAP_RADIX bits in order to support
- * up to 2^(BLIST_BMAP_RADIX-1) blocks. The first divison will
+ * up to 2^(BLIST_BMAP_RADIX-1) blocks. The first division will
* drop the radix down and fit it within a signed BLIST_BMAP_RADIX
* bit integer.
*
/*
* blist_free() - free up space in the block bitmap. Return the base
- * of a contiguous region. Panic if an inconsistancy is
+ * of a contiguous region. Panic if an inconsistency is
* found.
*/
swblk_t next_skip;
if (radix == BLIST_BMAP_RADIX) {
- /* leaf node: we considere only completely free bitmap as free */
+ /* leaf node: we consider only completely free bitmaps as free */
if (state == GAPFIND_FIRSTFREE) {
if (scan->u.bmu_bitmap == (u_swblk_t)-1) {
/* node is fully free */
* We could probably do a better job here. We are required to make
* bighint at least as large as the biggest contiguous block of
* data. If we just shoehorn it, a little extra overhead will
- * be incured on the next allocation (but only that one typically).
+ * be incurred on the next allocation (but only that one typically).
*/
scan->bm_bighint = BLIST_BMAP_RADIX;
}
-/* $OpenBSD: subr_prof.c,v 1.33 2023/04/25 01:32:36 cheloha Exp $ */
+/* $OpenBSD: subr_prof.c,v 1.34 2023/05/30 08:30:01 jsg Exp $ */
/* $NetBSD: subr_prof.c,v 1.12 1996/04/22 01:38:50 christos Exp $ */
/*-
#if !defined(GPROF)
/*
* If this is not a profiling kernel, we need to patch
- * all symbols that can be instrummented.
+ * all symbols that can be instrumented.
*/
error = db_prof_enable();
#endif
-/* $OpenBSD: subr_witness.c,v 1.49 2023/05/25 19:32:34 kurt Exp $ */
+/* $OpenBSD: subr_witness.c,v 1.50 2023/05/30 08:30:01 jsg Exp $ */
/*-
* Copyright (c) 2008 Isilon Systems, Inc.
/*
* If we are locking a sleepable lock and this lock
* isn't sleepable, we want to treat it as a lock
- * order violation to enfore a general lock order of
+ * order violation to enforce a general lock order of
* sleepable locks before non-sleepable locks.
*/
if (((lock->lo_flags & LO_SLEEPABLE) != 0 &&
-/* $OpenBSD: if_var.h,v 1.126 2023/05/07 16:23:23 bluhm Exp $ */
+/* $OpenBSD: if_var.h,v 1.127 2023/05/30 08:30:01 jsg Exp $ */
/* $NetBSD: if.h,v 1.23 1996/05/07 02:40:27 thorpej Exp $ */
/*
struct sockaddr_dl *if_sadl; /* [N] pointer to our sockaddr_dl */
- struct nd_ifinfo *if_nd; /* [I] IPv6 Neighour Discovery info */
+ struct nd_ifinfo *if_nd; /* [I] IPv6 Neighbor Discovery info */
};
#define if_mtu if_data.ifi_mtu
#define if_type if_data.ifi_type
-/* $OpenBSD: if_wg.c,v 1.26 2022/07/21 11:26:50 kn Exp $ */
+/* $OpenBSD: if_wg.c,v 1.27 2023/05/30 08:30:01 jsg Exp $ */
/*
* Copyright (C) 2015-2020 Jason A. Donenfeld <Jason@zx2c4.com>. All Rights Reserved.
* - The parallel queue is used to distribute the encryption across multiple
* threads.
* - The serial queue ensures that packets are not reordered and are
- * delievered in sequence.
+ * delivered in sequence.
* The wg_tag attached to the packet contains two flags to help the two queues
* interact.
* - t_done: The parallel queue has finished with the packet, now the serial
-/* $OpenBSD: uvm_extern.h,v 1.167 2023/02/16 04:42:07 deraadt Exp $ */
+/* $OpenBSD: uvm_extern.h,v 1.168 2023/05/30 08:30:01 jsg Exp $ */
/* $NetBSD: uvm_extern.h,v 1.57 2001/03/09 01:02:12 chs Exp $ */
/*
* such as mbuf pools within address ranges that are reachable by devices
* that perform DMA.
*
- * It is also to discourge memory allocations from being satisfied from ranges
+ * It is also to discourage memory allocations from being satisfied from ranges
* such as the ISA memory range, if they can be satisfied with allocation
* from other ranges.
*
-/* $OpenBSD: uvm_pdaemon.c,v 1.105 2022/09/10 20:35:29 miod Exp $ */
+/* $OpenBSD: uvm_pdaemon.c,v 1.106 2023/05/30 08:30:01 jsg Exp $ */
/* $NetBSD: uvm_pdaemon.c,v 1.23 2000/08/20 10:24:14 bjh21 Exp $ */
/*
} else {
if (uvm_nowait_failed) {
/*
- * XXX realisticly, this is what our
+ * XXX realistically, this is what our
* nowait callers probably care about
*/
constraint = dma_constraint;