guarantee, not guarentee. Idea from miod@openbsd.
This commit is contained in:
wiz
parent
3ac7ce187d
commit
cd68fb44fb
@ -1,4 +1,4 @@
|
||||
/* $NetBSD: bus_dma.c,v 1.23 2003/01/17 22:28:49 thorpej Exp $ */
|
||||
/* $NetBSD: bus_dma.c,v 1.24 2003/02/02 10:24:38 wiz Exp $ */
|
||||
|
||||
/*-
|
||||
* Copyright (c) 1996, 1997, 1998 The NetBSD Foundation, Inc.
|
||||
@ -707,7 +707,7 @@ _bus_dmamem_map(bus_dma_tag_t t, bus_dma_segment_t *segs, int nsegs,
|
||||
* If the memory must remain coherent with the
|
||||
* cache then we must make the memory uncacheable
|
||||
* in order to maintain virtual cache coherency.
|
||||
* We must also guarentee the cache does not already
|
||||
* We must also guarantee the cache does not already
|
||||
* contain the virtal addresses we are making
|
||||
* uncacheable.
|
||||
*/
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* $NetBSD: hil.c,v 1.54 2003/01/28 22:35:07 wiz Exp $ */
|
||||
/* $NetBSD: hil.c,v 1.55 2003/02/02 10:24:39 wiz Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright (c) 1988 University of Utah.
|
||||
@ -43,7 +43,7 @@
|
||||
*/
|
||||
|
||||
#include <sys/cdefs.h>
|
||||
__KERNEL_RCSID(0, "$NetBSD: hil.c,v 1.54 2003/01/28 22:35:07 wiz Exp $");
|
||||
__KERNEL_RCSID(0, "$NetBSD: hil.c,v 1.55 2003/02/02 10:24:39 wiz Exp $");
|
||||
|
||||
#include "opt_compat_hpux.h"
|
||||
#include "rnd.h"
|
||||
@ -290,7 +290,7 @@ hilopen(dev, flags, mode, p)
|
||||
if (flags & FNONBLOCK)
|
||||
dptr->hd_flags |= HIL_NOBLOCK;
|
||||
/*
|
||||
* It is safe to flush the read buffer as we are guarenteed
|
||||
* It is safe to flush the read buffer as we are guaranteed
|
||||
* that no one else is using it.
|
||||
*/
|
||||
if ((dptr->hd_flags & HIL_OPENED) == 0) {
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* $NetBSD: locore.s,v 1.127 2003/01/17 22:53:08 thorpej Exp $ */
|
||||
/* $NetBSD: locore.s,v 1.128 2003/02/02 10:24:39 wiz Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright (c) 1994, 1995 Gordon W. Ross
|
||||
@ -390,7 +390,7 @@ Lstart3:
|
||||
* Prepare to enable MMU.
|
||||
* Since the kernel is not mapped logical == physical we must insure
|
||||
* that when the MMU is turned on, all prefetched addresses (including
|
||||
* the PC) are valid. In order guarentee that, we use the last physical
|
||||
* the PC) are valid. In order guarantee that, we use the last physical
|
||||
* page (which is conveniently mapped == VA) and load it up with enough
|
||||
* code to defeat the prefetch, then we execute the jump back to here.
|
||||
*
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* $NetBSD: locore.s,v 1.37 2003/01/18 06:09:55 thorpej Exp $ */
|
||||
/* $NetBSD: locore.s,v 1.38 2003/02/02 10:24:39 wiz Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright (c) 1998 Darrin B. Jewell
|
||||
@ -285,7 +285,7 @@ Lstart3:
|
||||
* Prepare to enable MMU.
|
||||
* Since the kernel is not mapped logical == physical we must insure
|
||||
* that when the MMU is turned on, all prefetched addresses (including
|
||||
* the PC) are valid. In order guarentee that, we use the last physical
|
||||
* the PC) are valid. In order guarantee that, we use the last physical
|
||||
* page (which is conveniently mapped == VA) and load it up with enough
|
||||
* code to defeat the prefetch, then we execute the jump back to here.
|
||||
*
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* $NetBSD: clock.c,v 1.3 2002/10/05 17:01:49 chs Exp $ */
|
||||
/* $NetBSD: clock.c,v 1.4 2003/02/02 10:24:40 wiz Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright 1997
|
||||
@ -320,7 +320,7 @@ void gettimer0count(pcount)
|
||||
|
||||
/*
|
||||
* Latch the current value of the timer and then read it.
|
||||
* This guarentees an atomic reading of the time.
|
||||
* This guarantees an atomic reading of the time.
|
||||
*/
|
||||
|
||||
current = gettick();
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* $NetBSD: locore.s,v 1.68 2003/01/18 07:14:21 thorpej Exp $ */
|
||||
/* $NetBSD: locore.s,v 1.69 2003/02/02 10:24:40 wiz Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright (c) 1988 University of Utah.
|
||||
@ -838,7 +838,7 @@ Lstart2:
|
||||
* Prepare to enable MMU.
|
||||
* Since the kernel is not mapped logical == physical we must insure
|
||||
* that when the MMU is turned on, all prefetched addresses (including
|
||||
* the PC) are valid. In order guarentee that, we use the last physical
|
||||
* the PC) are valid. In order guarantee that, we use the last physical
|
||||
* page (which is conveniently mapped == VA) and load it up with enough
|
||||
* code to defeat the prefetch, then we execute the jump back to here.
|
||||
*
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* $NetBSD: cs89x0.c,v 1.7 2003/01/06 13:05:09 wiz Exp $ */
|
||||
/* $NetBSD: cs89x0.c,v 1.8 2003/02/02 10:24:40 wiz Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright 1997
|
||||
@ -186,7 +186,7 @@
|
||||
*/
|
||||
|
||||
#include <sys/cdefs.h>
|
||||
__KERNEL_RCSID(0, "$NetBSD: cs89x0.c,v 1.7 2003/01/06 13:05:09 wiz Exp $");
|
||||
__KERNEL_RCSID(0, "$NetBSD: cs89x0.c,v 1.8 2003/02/02 10:24:40 wiz Exp $");
|
||||
|
||||
#include "opt_inet.h"
|
||||
|
||||
@ -1627,7 +1627,7 @@ cs_process_rx_early(struct cs_softc *sc)
|
||||
}
|
||||
m->m_pkthdr.rcvif = ifp;
|
||||
/*
|
||||
* save processing by always using a mbuf cluster, guarenteed to fit
|
||||
* save processing by always using a mbuf cluster, guaranteed to fit
|
||||
* packet
|
||||
*/
|
||||
MCLGET(m, M_DONTWAIT);
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* $NetBSD: cs89x0isa.c,v 1.4 2002/09/27 15:37:22 provos Exp $ */
|
||||
/* $NetBSD: cs89x0isa.c,v 1.5 2003/02/02 10:24:40 wiz Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright 1997
|
||||
@ -36,7 +36,7 @@
|
||||
/* isa dma routines for cs89x0 */
|
||||
|
||||
#include <sys/cdefs.h>
|
||||
__KERNEL_RCSID(0, "$NetBSD: cs89x0isa.c,v 1.4 2002/09/27 15:37:22 provos Exp $");
|
||||
__KERNEL_RCSID(0, "$NetBSD: cs89x0isa.c,v 1.5 2003/02/02 10:24:40 wiz Exp $");
|
||||
|
||||
#include <sys/param.h>
|
||||
#include <sys/systm.h>
|
||||
@ -197,7 +197,7 @@ void cs_process_rx_dma(struct cs_softc *sc)
|
||||
|
||||
/*
|
||||
* Get the length and status of the packet. Only the
|
||||
* status is guarenteed to be at dma_mem_ptr, ie need
|
||||
* status is guaranteed to be at dma_mem_ptr, ie need
|
||||
* to check for wraparound before reading the length
|
||||
*/
|
||||
status = *((unsigned short *) dma_mem_ptr)++;
|
||||
@ -256,7 +256,7 @@ void cs_process_rx_dma(struct cs_softc *sc)
|
||||
}
|
||||
/*
|
||||
* save processing by always using a mbuf
|
||||
* cluster, guarenteed to fit packet
|
||||
* cluster, guaranteed to fit packet
|
||||
*/
|
||||
MCLGET(m, M_DONTWAIT);
|
||||
if ((m->m_flags & M_EXT) == 0) {
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* $NetBSD: ieee1212.c,v 1.4 2003/02/01 06:50:42 ichiro Exp $ */
|
||||
/* $NetBSD: ieee1212.c,v 1.5 2003/02/02 10:24:41 wiz Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright (c) 2000 The NetBSD Foundation, Inc.
|
||||
@ -78,7 +78,7 @@ int p1212debug = 1;
|
||||
* return -1 on error, or 0 on success and possibly reset *size to a larger
|
||||
* value.
|
||||
*
|
||||
* NOTE: Rom's are guarentee'd per the ISO spec to be contiguous but only the
|
||||
* NOTE: Rom's are guaranteed per the ISO spec to be contiguous but only the
|
||||
* first 1k is directly mapped. Anything past 1k is supposed to use a loop
|
||||
* around the indirect registers to read in the rom. This code only assumes the
|
||||
* buffer passed in represents a total rom regardless of end size. It is the
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
/* $NetBSD: hash.h,v 1.3 2002/07/14 00:26:17 wiz Exp $ */
|
||||
/* $NetBSD: hash.h,v 1.4 2003/02/02 10:24:41 wiz Exp $ */
|
||||
|
||||
#ifndef HASH_H
|
||||
#define HASH_H
|
||||
@ -82,7 +82,7 @@ SOFTWARE.
|
||||
*
|
||||
* A generalized hash function, hash_HashFunction(), is included
|
||||
* with this package to make things a little easier. It is not
|
||||
* guarenteed to use the best hash algorithm in existence. . . .
|
||||
* guaranteed to use the best hash algorithm in existence. . . .
|
||||
*/
|
||||
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user