-/* $OpenBSD: buffer.c,v 1.32 2019/05/03 16:31:34 tobias Exp $ */
+/* $OpenBSD: buffer.c,v 1.33 2022/12/27 23:05:55 jmc Exp $ */
/*
* Copyright (c) 2002, 2003 Niels Provos <provos@citi.umich.edu>
* reading. We do not want to exhaust resources
* before the reader has a chance to do something
* about it. If the reader does not tell us how much
- * data we should read, we artifically limit it.
+ * data we should read, we artificially limit it.
*/
if ((size_t)n > buf->totallen << 2)
n = buf->totallen << 2;
-/* $OpenBSD: event.c,v 1.41 2019/05/01 19:14:25 jca Exp $ */
+/* $OpenBSD: event.c,v 1.42 2022/12/27 23:05:55 jmc Exp $ */
/*
* Copyright (c) 2000-2004 Niels Provos <provos@citi.umich.edu>
}
/*
- * Wait continously for events. We exit only if no events are left.
+ * Wait continuously for events. We exit only if no events are left.
*/
int
}
/*
- * we should change the timout state only if the previous event
+ * we should change the timeout state only if the previous event
* addition succeeded.
*/
if (res != -1 && tv != NULL) {
/*
* we already reserved memory above for the case where we
- * are not replacing an exisiting timeout.
+ * are not replacing an existing timeout.
*/
if (ev->ev_flags & EVLIST_TIMEOUT)
event_queue_remove(base, ev, EVLIST_TIMEOUT);
-/* $OpenBSD: kqueue.c,v 1.41 2019/05/08 17:33:22 tobias Exp $ */
+/* $OpenBSD: kqueue.c,v 1.42 2022/12/27 23:05:55 jmc Exp $ */
/*
* Copyright 2000-2002 Niels Provos <provos@citi.umich.edu>
if (!(kqueueop = calloc(1, sizeof(struct kqop))))
return (NULL);
- /* Initalize the kernel queue */
+ /* Initialize the kernel queue */
if ((kq = kqueue()) == -1) {
event_warn("kqueue");
kqueueop->pid = getpid();
- /* Initalize fields */
+ /* Initialize fields */
kqueueop->changes = calloc(NEVENT, sizeof(struct kevent));
if (kqueueop->changes == NULL) {
free (kqueueop);