-/* $OpenBSD: machdep.c,v 1.202 2023/03/08 04:43:07 guenther Exp $ */
+/* $OpenBSD: machdep.c,v 1.203 2023/04/11 00:45:06 jsg Exp $ */
/* $NetBSD: machdep.c,v 1.210 2000/06/01 17:12:38 thorpej Exp $ */
/*-
/*
* Find out how much memory is available, by looking at
* the memory cluster descriptors. This also tries to do
- * its best to detect things things that have never been seen
+ * its best to detect things that have never been seen
* before...
*/
mddtp = (struct mddt *)(((caddr_t)hwrpb) + hwrpb->rpb_memdat_off);
-/* $OpenBSD: pmap.c,v 1.89 2023/02/06 11:16:22 miod Exp $ */
+/* $OpenBSD: pmap.c,v 1.90 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: pmap.c,v 1.154 2000/12/07 22:18:55 thorpej Exp $ */
/*-
* * Process B runs. It is now using the TLB entries tagged
* by process A. *poof*
*
- * In the scenario above, in addition to the processor using using incorrect
+ * In the scenario above, in addition to the processor using incorrect
* TLB entries, the PALcode might use incorrect information to service a
* TLB miss. (The PALcode uses the recursively mapped Virtual Page Table
* to locate the PTE for a faulting address, and tagged TLB entries exist
* safe (since PG_ASM mappings match any ASN).
*
* On processors that do not support ASNs, the PALcode invalidates
- * the TLB and I-cache automatically on swpctx. We still still go
+ * the TLB and I-cache automatically on swpctx. We still go
* through the motions of assigning an ASN (really, just refreshing
* the ASN generation in this particular case) to keep the logic sane
* in other parts of the code.
-/* $OpenBSD: vm_machdep.c,v 1.50 2023/03/17 19:20:19 miod Exp $ */
+/* $OpenBSD: vm_machdep.c,v 1.51 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: vm_machdep.c,v 1.55 2000/03/29 03:49:48 simonb Exp $ */
/*
* the pmap_extract().
*
* no need to flush TLB since we expect nothing to be mapped
- * where we we just allocated (TLB will be flushed when our
+ * where we just allocated (TLB will be flushed when our
* mapping is removed).
*/
while (len) {
-/* $OpenBSD: autoconf.h,v 1.13 2020/05/25 15:00:23 deraadt Exp $ */
+/* $OpenBSD: autoconf.h,v 1.14 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: autoconf.h,v 1.19 2000/06/08 03:10:06 thorpej Exp $ */
/*
/*
* The boot program passes a pointer (in the boot environment virtual
- * address address space; "BEVA") to a bootinfo to the kernel using
+ * address space; "BEVA") to a bootinfo to the kernel using
* the following convention:
*
* a0 contains first free page frame number
-/* $OpenBSD: pmap.c,v 1.162 2023/01/30 11:21:26 deraadt Exp $ */
+/* $OpenBSD: pmap.c,v 1.163 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: pmap.c,v 1.3 2003/05/08 18:13:13 thorpej Exp $ */
/*
* with pmap_remove! if we allow this (and why would
* we?) then we end up freeing the pmap's page
* directory page (PDP) before we are finished using
- * it when we hit in in the recursive mapping. this
+ * it when we hit it in the recursive mapping. this
* is BAD.
*
* long term solution is to move the PTEs out of user
-/* $OpenBSD: vm_machdep.c,v 1.46 2022/08/07 23:56:06 guenther Exp $ */
+/* $OpenBSD: vm_machdep.c,v 1.47 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: vm_machdep.c,v 1.1 2003/04/26 18:39:33 fvdl Exp $ */
/*-
* the pmap_extract().
*
* no need to flush TLB since we expect nothing to be mapped
- * where we we just allocated (TLB will be flushed when our
+ * where we just allocated (TLB will be flushed when our
* mapping is removed).
*/
while (len) {
-/* $OpenBSD: vm_machdep.c,v 1.28 2022/02/21 19:15:58 kettenis Exp $ */
+/* $OpenBSD: vm_machdep.c,v 1.29 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: vm_machdep.c,v 1.31 2004/01/04 11:33:29 jdolecek Exp $ */
/*
* the pmap_extract().
*
* no need to flush TLB since we expect nothing to be mapped
- * where we we just allocated (TLB will be flushed when our
+ * where we just allocated (TLB will be flushed when our
* mapping is removed).
*/
while (len) {
-/* $OpenBSD: setjmp.h,v 1.5 2018/06/22 15:18:50 kettenis Exp $ */
+/* $OpenBSD: setjmp.h,v 1.6 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: setjmp.h,v 1.2 2001/08/25 14:45:59 bjh21 Exp $ */
/*
* 31 (con't)
* 32 (con't)
*
- * The magic number number identifies the jmp_buf and
+ * The magic number identifies the jmp_buf and
* how the buffer was created as well as providing
* a sanity check.
*
-/* $OpenBSD: vm_machdep.c,v 1.10 2022/07/09 09:25:52 kettenis Exp $ */
+/* $OpenBSD: vm_machdep.c,v 1.11 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: vm_machdep.c,v 1.1 2003/04/26 18:39:33 fvdl Exp $ */
/*-
* the pmap_extract().
*
* no need to flush TLB since we expect nothing to be mapped
- * where we we just allocated (TLB will be flushed when our
+ * where we just allocated (TLB will be flushed when our
* mapping is removed).
*/
while (len) {
-/* $OpenBSD: setjmp.h,v 1.1 2016/12/17 23:38:33 patrick Exp $ */
+/* $OpenBSD: setjmp.h,v 1.2 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: setjmp.h,v 1.2 2001/08/25 14:45:59 bjh21 Exp $ */
/*
* 27 (con't)
* 28 (con't)
*
- * The magic number number identifies the jmp_buf and
+ * The magic number identifies the jmp_buf and
* how the buffer was created as well as providing
* a sanity check.
*
-/* $OpenBSD: pmap.c,v 1.220 2023/01/30 10:49:05 jsg Exp $ */
+/* $OpenBSD: pmap.c,v 1.221 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: pmap.c,v 1.91 2000/06/02 17:46:37 thorpej Exp $ */
/*
/*
* pg_g_kern: if CPU is affected by Meltdown pg_g_kern is 0,
- * otherwise it is is set to PG_G. pmap_pg_g will be derived
+ * otherwise it is set to PG_G. pmap_pg_g will be derived
* from pg_g_kern, see pmap_bootstrap().
*/
extern int pg_g_kern;
* with pmap_remove! if we allow this (and why would
* we?) then we end up freeing the pmap's page
* directory page (PDP) before we are finished using
- * it when we hit in in the recursive mapping. this
+ * it when we hit it in the recursive mapping. this
* is BAD.
*
* long term solution is to move the PTEs out of user
-/* $OpenBSD: pmapae.c,v 1.68 2023/01/30 10:49:05 jsg Exp $ */
+/* $OpenBSD: pmapae.c,v 1.69 2023/04/11 00:45:07 jsg Exp $ */
/*
* Copyright (c) 2006-2008 Michael Shalayeff
* with pmap_remove! if we allow this (and why would
* we?) then we end up freeing the pmap's page
* directory page (PDP) before we are finished using
- * it when we hit in in the recursive mapping. this
+ * it when we hit it in the recursive mapping. this
* is BAD.
*
* long term solution is to move the PTEs out of user
-/* $OpenBSD: vm_machdep.c,v 1.73 2023/01/30 10:49:05 jsg Exp $ */
+/* $OpenBSD: vm_machdep.c,v 1.74 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: vm_machdep.c,v 1.61 1996/05/03 19:42:35 christos Exp $ */
/*-
* the pmap_extract().
*
* no need to flush TLB since we expect nothing to be mapped
- * where we we just allocated (TLB will be flushed when our
+ * where we just allocated (TLB will be flushed when our
* mapping is removed).
*/
while (len) {
-/* $OpenBSD: db_trace.c,v 1.18 2019/11/08 15:01:15 mpi Exp $ */
+/* $OpenBSD: db_trace.c,v 1.19 2023/04/11 00:45:07 jsg Exp $ */
/*
* Mach Operating System
* Copyright (c) 1993-1991 Carnegie Mellon University
/*
* We've got to find the top of a stack frame so we can get both
- * a PC and and real SP.
+ * a PC and a real SP.
*/
for (ptr = arg.num;/**/; ptr += 4) {
/* Read a word from the named stack */
-/* $OpenBSD: vm_machdep.c,v 1.27 2022/02/21 19:22:21 kettenis Exp $ */
+/* $OpenBSD: vm_machdep.c,v 1.28 2023/04/11 00:45:07 jsg Exp $ */
/*
* Copyright (c) 1998 Steve Murphree, Jr.
* the pmap_extract().
*
* no need to flush TLB since we expect nothing to be mapped
- * where we we just allocated (TLB will be flushed when our
+ * where we just allocated (TLB will be flushed when our
* mapping is removed).
*/
while (len) {
-/* $OpenBSD: adb.c,v 1.49 2022/12/26 19:17:00 miod Exp $ */
+/* $OpenBSD: adb.c,v 1.50 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: adb.c,v 1.6 1999/08/16 06:28:09 tsubai Exp $ */
/* $NetBSD: adb_direct.c,v 1.14 2000/06/08 22:10:45 tsubai Exp $ */
/*
* This is the delay that is required (in uS) between certain
- * ADB transactions. The actual timing delay for for each uS is
+ * ADB transactions. The actual timing delay for each uS is
* calculated at boot time to account for differences in machine speed.
*/
#define ADB_DELAY 150
int adbSentChars; /* how many characters we have sent */
struct adbCommand adbInbound[ADB_QUEUE]; /* incoming queue */
-int adbInCount; /* how many packets in in queue */
+int adbInCount; /* how many packets in queue */
int adbInHead; /* head of in queue */
int adbInTail; /* tail of in queue */
}
/*
- * called when when an adb interrupt happens
+ * called when an adb interrupt happens
*
* Cuda version of adb_intr
* TO DO: do we want to add some calls to intr_dispatch() here to
}
/*
- * Called when when an adb interrupt happens.
+ * Called when an adb interrupt happens.
* This routine simply transfers control over to the appropriate
* code for the machine we are running on.
*/
-/* $OpenBSD: kauaiata.c,v 1.11 2022/03/13 12:33:01 mpi Exp $ */
+/* $OpenBSD: kauaiata.c,v 1.12 2023/04/11 00:45:07 jsg Exp $ */
/*
* Copyright (c) 2003 Dale Rahn
*/
/*
- * Glue to to attach kauai ata to the macobio_wdc
+ * Glue to attach kauai ata to the macobio_wdc
* which it heavily resembles.
*/
-/* $OpenBSD: lock_machdep.c,v 1.10 2021/05/21 00:39:35 gkoehler Exp $ */
+/* $OpenBSD: lock_machdep.c,v 1.11 2023/04/11 00:45:07 jsg Exp $ */
/*
* Copyright (c) 2021 George Koehler <gkoehler@openbsd.org>
/*
* If we get a page fault after membar_exit() and before
- * releasing the lock, then then recursive call to
+ * releasing the lock, then the recursive call to
* __ppc_unlock() must also membar_exit().
*/
if (mpl->mpl_count == 0) {
-/* $OpenBSD: vm_machdep.c,v 1.54 2022/10/25 15:15:38 guenther Exp $ */
+/* $OpenBSD: vm_machdep.c,v 1.55 2023/04/11 00:45:07 jsg Exp $ */
/* $NetBSD: vm_machdep.c,v 1.1 1996/09/30 16:34:57 ws Exp $ */
/*
* the pmap_extract().
*
* no need to flush TLB since we expect nothing to be mapped
- * where we we just allocated (TLB will be flushed when our
+ * where we just allocated (TLB will be flushed when our
* mapping is removed).
*/
while (len) {
-/* $OpenBSD: trap.c,v 1.52 2023/01/02 23:03:18 kettenis Exp $ */
+/* $OpenBSD: trap.c,v 1.53 2023/04/11 00:45:08 jsg Exp $ */
/*
* Copyright (c) 2020 Mark Kettenis <kettenis@openbsd.org>
* insert a new SLB entry. Executing the faulting
* instruction again should result in a Data Storage
* Interrupt that does indicate whether we're dealing
- * with with a read or a write fault.
+ * with a read or a write fault.
*/
map = &p->p_vmspace->vm_map;
vm_map_lock_read(map);
-/* $OpenBSD: vm_machdep.c,v 1.8 2021/05/16 06:20:29 jsg Exp $ */
+/* $OpenBSD: vm_machdep.c,v 1.9 2023/04/11 00:45:08 jsg Exp $ */
/*-
* Copyright (c) 1995 Charles M. Hannum. All rights reserved.
* the pmap_extract().
*
* no need to flush TLB since we expect nothing to be mapped
- * where we we just allocated (TLB will be flushed when our
+ * where we just allocated (TLB will be flushed when our
* mapping is removed).
*/
while (len) {
-/* $OpenBSD: vm_machdep.c,v 1.10 2022/02/24 14:19:10 visa Exp $ */
+/* $OpenBSD: vm_machdep.c,v 1.11 2023/04/11 00:45:08 jsg Exp $ */
/*-
* Copyright (c) 1995 Charles M. Hannum. All rights reserved.
* the pmap_extract().
*
* no need to flush TLB since we expect nothing to be mapped
- * where we we just allocated (TLB will be flushed when our
+ * where we just allocated (TLB will be flushed when our
* mapping is removed).
*/
while (len) {
-/* $OpenBSD: psycho.c,v 1.82 2023/02/04 19:19:37 cheloha Exp $ */
+/* $OpenBSD: psycho.c,v 1.83 2023/04/11 00:45:08 jsg Exp $ */
/* $NetBSD: psycho.c,v 1.39 2001/10/07 20:30:41 eeh Exp $ */
/*
/*
* Enable the interrupt now we have the handler installed.
* Read the current value as we can't change it besides the
- * valid bit so so make sure only this bit is changed.
+ * valid bit so make sure only this bit is changed.
*
* XXXX --- we really should use bus_space for this.
*/
-/* $OpenBSD: rkpcie.c,v 1.16 2022/01/09 05:42:37 jsg Exp $ */
+/* $OpenBSD: rkpcie.c,v 1.17 2023/04/11 00:45:08 jsg Exp $ */
/*
* Copyright (c) 2018 Mark Kettenis <kettenis@openbsd.org>
*
* It is important to have reached L0 state before beginning Gen 2 training,
* as it is documented that setting the Retrain Link bit while currently
* in Recovery or Configuration states is a race condition that may result
- * in missing the retraining. See See PCIE 2.0 Base Specification, 7.8.7
+ * in missing the retraining. See PCIE 2.0 Base Specification, 7.8.7
* Link Control Register implementation notes on Retrain Link bit.
*/
-/* $OpenBSD: elink3.c,v 1.98 2020/12/12 11:48:52 jan Exp $ */
+/* $OpenBSD: elink3.c,v 1.99 2023/04/11 00:45:08 jsg Exp $ */
/* $NetBSD: elink3.c,v 1.32 1997/05/14 00:22:00 thorpej Exp $ */
/*
for (i = 0; i < 31; i++)
bus_space_read_1(iot, ioh, ep_w1_reg(sc, EP_W1_TX_STATUS));
- /* Set threshold for for Tx-space available interrupt. */
+ /* Set threshold for Tx-space available interrupt. */
bus_space_write_2(iot, ioh, EP_COMMAND,
SET_TX_AVAIL_THRESH | (1600 >> sc->txashift));
-/* $OpenBSD: malo.c,v 1.123 2022/04/21 21:03:02 stsp Exp $ */
+/* $OpenBSD: malo.c,v 1.124 2023/04/11 00:45:08 jsg Exp $ */
/*
* Copyright (c) 2006 Claudio Jeker <claudio@openbsd.org>
}
/*
- * New mbuf mbuf successfully loaded
+ * New mbuf successfully loaded
*/
m = data->m;
data->m = mnew;
-/* $OpenBSD: tcic2reg.h,v 1.5 2022/01/09 05:42:42 jsg Exp $ */
+/* $OpenBSD: tcic2reg.h,v 1.6 2023/04/11 00:45:08 jsg Exp $ */
/* $NetBSD: tcic2reg.h,v 1.1 1999/03/23 20:04:14 bad Exp $ */
/*-
/*
* If set, use full address (a[12:23]) for MCS16 generation.
* If clear, run in ISA-compatible mode (only using a[17:23]).
- * With many chip sets, the TCIC-2/N's timing will will allow full
+ * With many chip sets, the TCIC-2/N's timing will allow full
* address decoding to be used rather than limiting us to LA[17:23];
* thus we can get around the ISA spec which limits the granularity
* of bus sizing to 128K blocks.
-/* $OpenBSD: twereg.h,v 1.9 2008/09/01 17:30:56 deraadt Exp $ */
+/* $OpenBSD: twereg.h,v 1.10 2023/04/11 00:45:08 jsg Exp $ */
/*
* Copyright (c) 2000 Michael Shalayeff
* From 3ware's documentation:
*
* All parameters maintained by the controller are grouped into related
- * tables. Tables are are accessed indirectly via get and set parameter
+ * tables. Tables are accessed indirectly via get and set parameter
* commands. To access a specific parameter in a table, the table ID and
* parameter index are used to uniquely identify a parameter. Table
* 0xffff is the directory table and provides a list of the table IDs and
-/* $OpenBSD: if_de.c,v 1.141 2022/08/15 02:07:11 jsg Exp $ */
+/* $OpenBSD: if_de.c,v 1.142 2023/04/11 00:45:08 jsg Exp $ */
/* $NetBSD: if_de.c,v 1.58 1998/01/12 09:39:58 thorpej Exp $ */
/*-
}
/*
- * If we've been been asked to start a poll or link change interrupt
+ * If we've been asked to start a poll or link change interrupt
* restart the probe (and reset the tulip to a known state).
*/
if (event == TULIP_MEDIAPOLL_START) {
* a bit reminiscent of going on the Ark two by two
* since each descriptor for the TULIP can describe
* two buffers. So we advance through packet filling
- * each of the two entries at a time to to fill each
+ * each of the two entries at a time to fill each
* descriptor. Clear the first and last segment bits
* in each descriptor (actually just clear everything
* but the end-of-ring or chain bits) to make sure
*******************************************************************************/
-/* $OpenBSD: if_em_hw.c,v 1.116 2022/06/23 09:47:04 jsg Exp $ */
+/* $OpenBSD: if_em_hw.c,v 1.117 2023/04/11 00:45:08 jsg Exp $ */
/*
* if_em_hw.c Shared functions for accessing and configuring the MAC
*/
* The possible values of the "fc" parameter are: 0: Flow control is
* completely disabled 1: Rx flow control is enabled (we can receive
* pause frames but not send pause frames). 2: Tx flow control is
- * enabled (we can send pause frames frames but we do not receive
+ * enabled (we can send pause frames but we do not receive
* pause frames). 3: Both Rx and TX flow control (symmetric) is
* enabled. other: No other values should be possible at this point.
*/
* TBI link partner, we will store bad
* packets. Some frames have an additional
* byte on the end and will look like CRC
- * errors to to the hardware.
+ * errors to the hardware.
*/
if (!hw->tbi_compatibility_on) {
hw->tbi_compatibility_on = TRUE;
-/* $OpenBSD: if_iwm.c,v 1.405 2022/12/16 13:49:35 stsp Exp $ */
+/* $OpenBSD: if_iwm.c,v 1.406 2023/04/11 00:45:08 jsg Exp $ */
/*
* Copyright (c) 2014, 2016 genua gmbh <info@genua.de>
.block_num = htole32(sc->num_of_paging_blk),
};
- /* loop for for all paging blocks + CSS block */
+ /* loop for all paging blocks + CSS block */
for (blk_idx = 0; blk_idx < sc->num_of_paging_blk + 1; blk_idx++) {
dev_phy_addr = htole32(
sc->fw_paging_db[blk_idx].fw_paging_block.paddr >>
-/* $OpenBSD: if_tl.c,v 1.76 2022/03/11 18:00:50 mpi Exp $ */
+/* $OpenBSD: if_tl.c,v 1.77 2023/04/11 00:45:08 jsg Exp $ */
/*
* Copyright (c) 1997, 1998
* into mbufs. This saves us from having to do a buffer copy: we can
* just hand the mbufs directly to the network stack. Once the frame
* has been sent on its way, the 'list' structure is assigned a new
- * buffer and moved to the end of the RX chain. As long we we stay
+ * buffer and moved to the end of the RX chain. As long we stay
* ahead of the chip, it will always think it has an endless receive
* channel.
*
TAILQ_FOREACH(ifa, &ifp->if_addrlist, ifa_list) {
/*
* First IPv4 address is always a best match unless
- * we were asked for for an IPv6 address.
+ * we were asked for an IPv6 address.
*/
if ((af == AF_INET || af == AF_UNSPEC) &&
(ifa->ifa_addr->sa_family == AF_INET)) {
-/* $OpenBSD: xenstore.c,v 1.48 2023/01/07 06:40:21 asou Exp $ */
+/* $OpenBSD: xenstore.c,v 1.49 2023/04/11 00:45:08 jsg Exp $ */
/*
* Copyright (c) 2015 Mike Belopuhov
size = MIN(size, avail);
/* How many contiguous bytes can we memcpy... */
left = XS_RING_SIZE - prod;
- /* ...bounded by by how much we need to write? */
+ /* ...bounded by how much we need to write? */
left = MIN(left, size);
memcpy(&xsr->xsr_req[prod], src, left);
size = MIN(size, avail);
/* How many contiguous bytes can we memcpy... */
left = XS_RING_SIZE - cons;
- /* ...bounded by by how much we need to read? */
+ /* ...bounded by how much we need to read? */
left = MIN(left, size);
memcpy(dst, &xsr->xsr_rsp[cons], left);
-/* $OpenBSD: stp4020.c,v 1.22 2020/02/18 00:10:22 cheloha Exp $ */
+/* $OpenBSD: stp4020.c,v 1.23 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: stp4020.c,v 1.23 2002/06/01 23:51:03 lukem Exp $ */
/*-
/*
* Note that this code relies on softintr_establish() to be
* used with real, hardware ipl values. All platforms with
- * SBus support support this.
+ * SBus support this.
*/
h->intrhandler = handler;
h->intrarg = arg;
-/* $OpenBSD: sdhc.c,v 1.73 2022/01/19 10:51:04 patrick Exp $ */
+/* $OpenBSD: sdhc.c,v 1.74 2023/04/11 00:45:09 jsg Exp $ */
/*
* Copyright (c) 2006 Uwe Stuehler <uwe@openbsd.org>
* for the Transfer Mode register that we write out when we write the
* Command register.
*
- * The Arasan controller controller integrated on the Broadcom SoCs
+ * The Arasan controller integrated on the Broadcom SoCs
* used in the Raspberry Pi has an interesting bug where writing the
* same 32-bit register twice doesn't work. This means that we lose
* writes to the Block Sine and/or Block Count register. We work
-/* $OpenBSD: umcs.h,v 1.5 2022/02/21 12:41:39 jsg Exp $ */
+/* $OpenBSD: umcs.h,v 1.6 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: umcs.h,v 1.1 2014/03/16 09:34:45 martin Exp $ */
/*-
* All these registers are documented only in full datasheet, which
* can be requested from MosChip tech support.
*/
-#define UMCS_SP1 0x00 /* Options for for UART 1, R/W */
+#define UMCS_SP1 0x00 /* Option bits for UART 1, R/W */
#define UMCS_CTRL1 0x01 /* Control bits for UART 1, R/W */
#define UMCS_PINPONGHIGH 0x02 /* High bits of ping-pong reg, R/W */
#define UMCS_PINPONGLOW 0x03 /* Low bits of ping-pong reg, R/W */
/* DCRx_1 Registers goes here (see below, they are documented) */
#define UMCS_GPIO 0x07 /* GPIO_0 and GPIO_1 bits, R/W */
-#define UMCS_SP2 0x08 /* Options for for UART 2, R/W */
+#define UMCS_SP2 0x08 /* Option bits for UART 2, R/W */
#define UMCS_CTRL2 0x09 /* Control bits for UART 2, R/W */
-#define UMCS_SP3 0x0a /* Options for for UART 3, R/W */
+#define UMCS_SP3 0x0a /* Option bits for UART 3, R/W */
#define UMCS_CTRL3 0x0b /* Control bits for UART 3, R/W */
-#define UMCS_SP4 0x0c /* Options for for UART 4, R/W */
+#define UMCS_SP4 0x0c /* Option bits for UART 4, R/W */
#define UMCS_CTRL4 0x0d /* Control bits for UART 4, R/W */
#define UMCS_PLL_DIV_M 0x0e /* Pre-divider for PLL, R/W */
#define UMCS_UNKNOWN1 0x0f /* NOT MENTIONED AND NOT USED */
-/* $OpenBSD: kern_event.c,v 1.195 2023/02/10 14:34:17 visa Exp $ */
+/* $OpenBSD: kern_event.c,v 1.196 2023/04/11 00:45:09 jsg Exp $ */
/*-
* Copyright (c) 1999,2000,2001 Jonathan Lemon <jlemon@FreeBSD.org>
#define KN_HASH(val, mask) (((val) ^ (val >> 8)) & (mask))
/*
- * Table for for all system-defined filters.
+ * Table for all system-defined filters.
*/
const struct filterops *const sysfilt_ops[] = {
&file_filtops, /* EVFILT_READ */
-/* $OpenBSD: sysv_msg.c,v 1.40 2022/09/16 15:57:23 mbuhl Exp $ */
+/* $OpenBSD: sysv_msg.c,v 1.41 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: sysv_msg.c,v 1.19 1996/02/09 19:00:18 christos Exp $ */
/*
* Copyright (c) 2009 Bret S. Lambert <blambert@openbsd.org>
* The data to be copied is laid out as a single userspace buffer, with a
* long preceding an opaque buffer of len bytes. The long value ends
* up being the message type, which needs to be copied separately from
- * the buffer data, which is stored in in mbufs.
+ * the buffer data, which is stored in mbufs.
*/
int
-/* $OpenBSD: hfsc.c,v 1.48 2018/10/22 23:44:53 dlg Exp $ */
+/* $OpenBSD: hfsc.c,v 1.49 2023/04/11 00:45:09 jsg Exp $ */
/*
* Copyright (c) 2012-2013 Henning Brauer <henning@openbsd.org>
* representation.
* the slope values are scaled to avoid overflow.
* the inverse slope values as well as the y-projection of the 1st
- * segment are kept in order to to avoid 64-bit divide operations
+ * segment are kept in order to avoid 64-bit divide operations
* that are expensive on 32-bit architectures.
*
* note: Intel Pentium TSC never wraps around in several thousands of years.
-/* $OpenBSD: ofp.h,v 1.14 2021/03/10 10:21:48 jsg Exp $ */
+/* $OpenBSD: ofp.h,v 1.15 2023/04/11 00:45:09 jsg Exp $ */
/*
* Copyright (c) 2013-2016 Reyk Floeter <reyk@openbsd.org>
uint16_t om_length;
} __packed;
-/* Flow matching type type */
+/* Flow matching type */
#define OFP_MATCH_STANDARD 0 /* Standard match deprecated */
#define OFP_MATCH_OXM 1 /* OpenFlow Extensible Match */
-/* $OpenBSD: ieee80211_node.c,v 1.195 2022/03/20 07:50:32 stsp Exp $ */
+/* $OpenBSD: ieee80211_node.c,v 1.196 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: ieee80211_node.c,v 1.14 2004/05/09 09:18:47 dyoung Exp $ */
/*-
/*
* Fake up a node; this handles node discovery in
* adhoc mode. Note that for the driver's benefit
- * we we treat this like an association so the driver
+ * we treat this like an association so the driver
* has an opportunity to setup its private state.
*
* XXX need better way to handle this; issue probe
-/* $OpenBSD: in.h,v 1.141 2021/06/02 00:09:57 dlg Exp $ */
+/* $OpenBSD: in.h,v 1.142 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: in.h,v 1.20 1996/02/13 23:41:47 christos Exp $ */
/*
* sysctl(3). (net.inet.ip.port{hi}{first,last})
*
* Changing those values has bad security implications if you are
- * using a a stateless firewall that is allowing packets outside of that
+ * using a stateless firewall that is allowing packets outside of that
* range in order to allow transparent outgoing connections.
*
* Such a firewall configuration will generally depend on the use of these
-/* $OpenBSD: ch.c,v 1.71 2022/01/11 23:10:11 jsg Exp $ */
+/* $OpenBSD: ch.c,v 1.72 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: ch.c,v 1.26 1997/02/21 22:06:52 thorpej Exp $ */
/*
printf("\n");
/*
- * Store our our device's quirks.
+ * Store our device's quirks.
*/
ch_get_quirks(sc, &link->inqdata);
}
}
/*
- * Copy an an element status descriptor to a user-mode
+ * Copy an element status descriptor to a user-mode
* changer_element_status structure.
*/
static void
-/* $OpenBSD: scsi_changer.h,v 1.10 2022/01/11 23:10:11 jsg Exp $ */
+/* $OpenBSD: scsi_changer.h,v 1.11 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: scsi_changer.h,v 1.7 1996/04/03 00:25:48 thorpej Exp $ */
/*
* Some of these fields can be a little confusing, so an explanation
* is in order.
*
- * Each component within a a medium changer apparatus is called an
+ * Each component within a medium changer apparatus is called an
* "element".
*
* The "medium transport element address" is the address of the first
-/* $OpenBSD: exec_elf.h,v 1.97 2022/10/27 23:17:18 deraadt Exp $ */
+/* $OpenBSD: exec_elf.h,v 1.98 2023/04/11 00:45:09 jsg Exp $ */
/*
* Copyright (c) 1995, 1996 Erik Theisen. All rights reserved.
*
* NT_OPENBSD_PROCINFO
* Note is a "elfcore_procinfo" structure.
* NT_OPENBSD_AUXV
- * Note is a a bunch of Auxiliary Vectors, terminated by
+ * Note is a bunch of Auxiliary Vectors, terminated by
* an AT_NULL entry.
* NT_OPENBSD_REGS
* Note is a "reg" structure.
-/* $OpenBSD: ffs_softdep.c,v 1.150 2021/04/28 09:53:53 claudio Exp $ */
+/* $OpenBSD: ffs_softdep.c,v 1.151 2023/04/11 00:45:09 jsg Exp $ */
/*
* Copyright 1998, 2000 Marshall Kirk McKusick. All Rights Reserved.
DIP_ASSIGN(ip, size, 0);
/*
- * Push the zero'ed inode to to its disk buffer so that we are free
+ * Push the zero'ed inode to its disk buffer so that we are free
* to delete its dependencies below. Once the dependencies are gone
* the buffer can be safely released.
*/
-/* $OpenBSD: uvm_amap.c,v 1.91 2022/08/01 14:15:46 mpi Exp $ */
+/* $OpenBSD: uvm_amap.c,v 1.92 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: uvm_amap.c,v 1.27 2000/11/25 06:27:59 chs Exp $ */
/*
* First check and see if we are the only map entry referencing
* he amap we currently have. If so, then just take it over instead
* of copying it. Note that we are reading am_ref without lock held
- * as the value value can only be one if we have the only reference
+ * as the value can only be one if we have the only reference
* to the amap (via our locked map). If the value is greater than
* one, then allocate amap and re-check the value.
*/
-/* $OpenBSD: uvm_anon.c,v 1.54 2021/03/26 13:40:05 mpi Exp $ */
+/* $OpenBSD: uvm_anon.c,v 1.55 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: uvm_anon.c,v 1.10 2000/11/25 06:27:59 chs Exp $ */
/*
pmap_page_protect(pg, PROT_NONE);
if (pgl != NULL) {
/*
- * clean page, and put on on pglist
+ * clean page, and put it on pglist
* for later freeing.
*/
uvm_lock_pageq();
-/* $OpenBSD: uvm_mmap.c,v 1.180 2023/03/08 04:43:09 guenther Exp $ */
+/* $OpenBSD: uvm_mmap.c,v 1.181 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: uvm_mmap.c,v 1.49 2001/02/18 21:19:08 chs Exp $ */
/*
else
s -= extra;
redo:
- /* make sure sure the desired page is mapped into kernel_map */
+ /* make sure the desired page is mapped into kernel_map */
if (baseva != last_baseva) {
if (kva != 0) {
vm_map_lock(kernel_map);
-/* $OpenBSD: uvm_page.c,v 1.170 2022/08/29 02:58:13 jsg Exp $ */
+/* $OpenBSD: uvm_page.c,v 1.171 2023/04/11 00:45:09 jsg Exp $ */
/* $NetBSD: uvm_page.c,v 1.44 2000/11/27 08:40:04 chs Exp $ */
/*
int start, len, try;
/*
- * if try is too large (thus target is less than than try) we reduce
+ * if try is too large (thus target is less than try) we reduce
* the length to trunc(len/2) [i.e. everything smaller than "try"]
*
* if the try is too small (thus target is greater than try) then