diff --git a/lib/libedit/chartype.h b/lib/libedit/chartype.h index 17ca5f368673..14456819fd2e 100644 --- a/lib/libedit/chartype.h +++ b/lib/libedit/chartype.h @@ -204,11 +204,11 @@ protected size_t ct_enc_width(Char); #endif #ifndef NARROWCHAR -/* Encode a characted into the destination buffer, provided there is sufficent +/* Encode a characted into the destination buffer, provided there is sufficient * buffer space available. Returns the number of bytes used up (zero if the * character cannot be encoded, -1 if there was not enough space available). */ -/* The maximum buffer size to hold the most unwieldly visual representation, +/* The maximum buffer size to hold the most unwieldy visual representation, * in this case \U+nnnnn. */ #define VISUAL_WIDTH_MAX ((size_t)8) diff --git a/lib/libedit/refresh.c b/lib/libedit/refresh.c index c85e84513b6e..cd516f63c246 100644 --- a/lib/libedit/refresh.c +++ b/lib/libedit/refresh.c @@ -561,7 +561,7 @@ re_update_line(EditLine *el, Char *old, Char *new, int i) nls = ++n; /* - * find same begining and same end + * find same beginning and same end */ osb = ols; nsb = nls; diff --git a/lib/libfetch/common.c b/lib/libfetch/common.c index 76dc4f9206eb..00f8b92399ca 100644 --- a/lib/libfetch/common.c +++ b/lib/libfetch/common.c @@ -471,7 +471,7 @@ fetch_ssl_hname_match(const char *h, size_t hlen, const char *m, if (!fetch_ssl_hname_equal(hdot - delta, delta, mdot1 - delta, delta)) return (0); - /* all tests succeded, it's a match */ + /* all tests succeeded, it's a match */ return (1); } @@ -1349,7 +1349,7 @@ fetch_netrc_auth(struct url *url) * which the proxy should not be consulted; the contents is a comma-, * or space-separated list of domain names. A single asterisk will * override all proxy variables and no transactions will be proxied - * (for compatability with lynx and curl, see the discussion at + * (for compatibility with lynx and curl, see the discussion at * ). */ int diff --git a/lib/libgssapi/gss_accept_sec_context.c b/lib/libgssapi/gss_accept_sec_context.c index 930da7f656fd..0fa739c96a9e 100644 --- a/lib/libgssapi/gss_accept_sec_context.c +++ b/lib/libgssapi/gss_accept_sec_context.c @@ -135,7 +135,7 @@ choose_mech(const gss_buffer_t input, gss_OID mech_oid) return (GSS_S_COMPLETE); } else if (input->length == 0) { /* - * There is the a wierd mode of SPNEGO (in CIFS and + * There is the a weird mode of SPNEGO (in CIFS and * SASL GSS-SPENGO where the first token is zero * length and the acceptor returns a mech_list, lets * hope that is what is happening now. diff --git a/lib/libkiconv/quirks.c b/lib/libkiconv/quirks.c index d1cc607562fc..54b61539b830 100644 --- a/lib/libkiconv/quirks.c +++ b/lib/libkiconv/quirks.c @@ -41,10 +41,10 @@ * * For example, the eucJP and Unocode mapping rule is based on * the JIS standard. Since Microsoft uses cp932 for Unicode mapping - * witch is not truly based on the JIS standard, reading a file + * which is not truly based on the JIS standard, reading a file * system created by Microsoft Windows family using eucJP/Unicode * mapping rule will cause a problem. That's why we define eucJP-ms here. - * The eucJP-ms has been defined by The Open Group Japan Vendor Coucil. + * The eucJP-ms has been defined by The Open Group Japan Vendor Council. * * Well, Apple Mac OS also has their own Unicode mappings, * but we won't require these quirks here, because HFS doesn't have diff --git a/lib/libkvm/kvm.c b/lib/libkvm/kvm.c index de21f39d1eab..5ad8dcc67fe2 100644 --- a/lib/libkvm/kvm.c +++ b/lib/libkvm/kvm.c @@ -237,7 +237,7 @@ _kvm_is_minidump(kvm_t *kd) * header from the core before treating it as an ELF header. * * We can add that here if we can get a change to libelf to support - * an inital offset into the file. Alternatively we could patch + * an initial offset into the file. Alternatively we could patch * savecore to extract cores from a regular file instead. */ int @@ -756,7 +756,7 @@ kvm_nlist2(kvm_t *kd, struct kvm_nlist *nl) { /* - * If called via the public interface, permit intialization of + * If called via the public interface, permit initialization of * further virtualized modules on demand. */ return (_kvm_nlist(kd, nl, 1)); diff --git a/lib/libkvm/kvm_pcpu.c b/lib/libkvm/kvm_pcpu.c index eaea7e409f5a..68dd36334330 100644 --- a/lib/libkvm/kvm_pcpu.c +++ b/lib/libkvm/kvm_pcpu.c @@ -266,7 +266,7 @@ _kvm_dpcpu_init(kvm_t *kd) } /* - * Check whether the dpcpu module has been initialized sucessfully or not, + * Check whether the dpcpu module has been initialized successfully or not, * initialize it if permitted. */ int diff --git a/lib/libkvm/kvm_vnet.c b/lib/libkvm/kvm_vnet.c index d9bdf5591ef3..817462cc4027 100644 --- a/lib/libkvm/kvm_vnet.c +++ b/lib/libkvm/kvm_vnet.c @@ -127,7 +127,7 @@ _kvm_vnet_selectpid(kvm_t *kd, pid_t pid) /* * First, find the process for this pid. If we are working on a - * dump, either locate the thread dumptid is refering to or proc0. + * dump, either locate the thread dumptid is referring to or proc0. * Based on either, take the address of the ucred. */ credp = 0; @@ -208,7 +208,7 @@ _kvm_vnet_selectpid(kvm_t *kd, pid_t pid) } /* - * Check whether the vnet module has been initialized sucessfully + * Check whether the vnet module has been initialized successfully * or not, initialize it if permitted. */ int diff --git a/lib/libpmc/libpmc.c b/lib/libpmc/libpmc.c index 39deec636de1..0e54b68dabbf 100644 --- a/lib/libpmc/libpmc.c +++ b/lib/libpmc/libpmc.c @@ -3240,7 +3240,7 @@ pmc_init(void) if (PMC_CALL(GETMODULEVERSION, &abi_version) < 0) return (pmc_syscall = -1); - /* ignore patch & minor numbers for the comparision */ + /* ignore patch & minor numbers for the comparison */ if ((abi_version & 0xFF000000) != (PMC_VERSION & 0xFF000000)) { errno = EPROGMISMATCH; return (pmc_syscall = -1); diff --git a/lib/libsdp/sdp.h b/lib/libsdp/sdp.h index 35dbea732fa5..3bc144e79e0a 100644 --- a/lib/libsdp/sdp.h +++ b/lib/libsdp/sdp.h @@ -561,7 +561,7 @@ void sdp_print (uint32_t level, uint8_t const *start, * bdaddr_t bdaddr; local BD_ADDR (or ANY) * profile data[pdu->len - sizeof(uuid) - sizeof(bdaddr)] * - * in successful reponse additional data will contain 4 bytes record handle + * in successful response additional data will contain 4 bytes record handle * * * SDP_PDU_SERVICE_UNREGISTER_REQUEST diff --git a/lib/libusb/libusb20_desc.c b/lib/libusb/libusb20_desc.c index a40318246d00..c285193664ab 100644 --- a/lib/libusb/libusb20_desc.c +++ b/lib/libusb/libusb20_desc.c @@ -135,7 +135,7 @@ libusb20_parse_config_desc(const void *config_desc) /* * Make a copy of the config descriptor, so that the caller can free - * the inital config descriptor pointer! + * the initial config descriptor pointer! */ memcpy((void *)(lub_endpoint + nendpoint), config_desc, pcdesc.len); diff --git a/lib/libvmmapi/vmmapi.h b/lib/libvmmapi/vmmapi.h index 57f8c564ed2d..98eee60a8619 100644 --- a/lib/libvmmapi/vmmapi.h +++ b/lib/libvmmapi/vmmapi.h @@ -176,7 +176,7 @@ int vm_get_hpet_capabilities(struct vmctx *ctx, uint32_t *capabilities); /* * Translate the GLA range [gla,gla+len) into GPA segments in 'iov'. - * The 'iovcnt' should be big enough to accomodate all GPA segments. + * The 'iovcnt' should be big enough to accommodate all GPA segments. * * retval fault Interpretation * 0 0 Success diff --git a/lib/msun/src/k_rem_pio2.c b/lib/msun/src/k_rem_pio2.c index 3942441344fd..d8af97ebdc52 100644 --- a/lib/msun/src/k_rem_pio2.c +++ b/lib/msun/src/k_rem_pio2.c @@ -83,7 +83,7 @@ __FBSDID("$FreeBSD$"); * jk+1 must be 2 larger than you might expect so that our * recomputation test works. (Up to 24 bits in the integer * part (the 24 bits of it that we compute) and 23 bits in - * the fraction part may be lost to cancelation before we + * the fraction part may be lost to cancellation before we * recompute.) * * jz local integer variable indicating the number of diff --git a/lib/msun/src/s_cbrt.c b/lib/msun/src/s_cbrt.c index 910f75b1a98d..30ffe5f294a2 100644 --- a/lib/msun/src/s_cbrt.c +++ b/lib/msun/src/s_cbrt.c @@ -59,7 +59,7 @@ cbrt(double x) * error of about 1 in 16. Adding a bias of -0.03306235651 to the * (e%3+m)/3 term reduces the error to about 1 in 32. With the IEEE * floating point representation, for finite positive normal values, - * ordinary integer divison of the value in bits magically gives + * ordinary integer division of the value in bits magically gives * almost exactly the RHS of the above provided we first subtract the * exponent bias (1023 for doubles) and later add it back. We do the * subtraction virtually to keep e >= 0 so that ordinary integer