libc: spelling fixes.
Mostly on comments.
This commit is contained in:
parent
1ce4275dd2
commit
32223c1b7d
@ -29,7 +29,7 @@ ENTRY(strcmp)
|
||||
jmp .Ldone
|
||||
|
||||
/*
|
||||
* Check whether s2 is aligned to a word boundry. If it is, we
|
||||
* Check whether s2 is aligned to a word boundary. If it is, we
|
||||
* can compare by words. Otherwise we have to compare by bytes.
|
||||
*/
|
||||
.Ls1aligned:
|
||||
|
@ -27,7 +27,7 @@
|
||||
*/
|
||||
|
||||
/*
|
||||
* Interal prototypes for our back-end functions.
|
||||
* Internal prototypes for our back-end functions.
|
||||
*/
|
||||
size_t __bsd___iconv(iconv_t, char **, size_t *, char **,
|
||||
size_t *, __uint32_t, size_t *);
|
||||
|
@ -28,7 +28,7 @@
|
||||
*/
|
||||
|
||||
/*
|
||||
* This file defines compatiblity symbol versions for old system calls. It
|
||||
* This file defines compatibility symbol versions for old system calls. It
|
||||
* is included in all generated system call files.
|
||||
*/
|
||||
|
||||
|
@ -49,7 +49,7 @@
|
||||
* One approach for thread safety is to provide discrete versions of the
|
||||
* library: one thread safe, the other not. The disadvantage of this is
|
||||
* that libc is rather large, and two copies of a library which are 99%+
|
||||
* identical is not an efficent use of resources.
|
||||
* identical is not an efficient use of resources.
|
||||
*
|
||||
* Another approach is to provide a single thread safe library. However,
|
||||
* it should not add significant run time or code size overhead to non-
|
||||
|
@ -322,7 +322,7 @@ _collate_lookup(struct xlocale_collate *table, const wchar_t *t, int *len,
|
||||
*len = 1;
|
||||
|
||||
/*
|
||||
* Check for composites such as dipthongs that collate as a
|
||||
* Check for composites such as diphthongs that collate as a
|
||||
* single element (aka chains or collating-elements).
|
||||
*/
|
||||
if (((p2 = chainsearch(table, t, &l)) != NULL) &&
|
||||
|
@ -153,7 +153,7 @@ nl_langinfo_l(nl_item item, locale_t loc)
|
||||
break;
|
||||
/*
|
||||
* YESSTR and NOSTR items marked with LEGACY are available, but not
|
||||
* recomended by SUSv2 to be used in portable applications since
|
||||
* recommended by SUSv2 to be used in portable applications since
|
||||
* they're subject to remove in future specification editions.
|
||||
*/
|
||||
case YESSTR: /* LEGACY */
|
||||
|
@ -34,7 +34,7 @@ __FBSDID("$FreeBSD$");
|
||||
* Check whether a name belongs to a domain.
|
||||
*
|
||||
* Inputs:
|
||||
*\li a - the domain whose ancestory is being verified
|
||||
*\li a - the domain whose ancestry is being verified
|
||||
*\li b - the potential ancestor we're checking against
|
||||
*
|
||||
* Return:
|
||||
|
@ -472,7 +472,7 @@ getaddrinfo(const char *hostname, const char *servname,
|
||||
/*
|
||||
* RFC 3493: AI_ALL and AI_V4MAPPED are effective only against
|
||||
* AF_INET6 query. They need to be ignored if specified in other
|
||||
* occassions.
|
||||
* occasions.
|
||||
*/
|
||||
switch (pai->ai_flags & (AI_ALL | AI_V4MAPPED)) {
|
||||
case AI_V4MAPPED:
|
||||
|
@ -51,7 +51,7 @@ __FBSDID("$FreeBSD$");
|
||||
static int gethostbyname_internal(const char *, int, struct hostent *, char *,
|
||||
size_t, struct hostent **, int *, res_state);
|
||||
|
||||
/* Host lookup order if nsswitch.conf is broken or nonexistant */
|
||||
/* Host lookup order if nsswitch.conf is broken or nonexistent */
|
||||
static const ns_src default_src[] = {
|
||||
{ NSSRC_FILES, NS_SUCCESS },
|
||||
{ NSSRC_DNS, NS_SUCCESS },
|
||||
|
@ -46,7 +46,7 @@ __FBSDID("$FreeBSD$");
|
||||
#include "nscache.h"
|
||||
#endif
|
||||
|
||||
/* Network lookup order if nsswitch.conf is broken or nonexistant */
|
||||
/* Network lookup order if nsswitch.conf is broken or nonexistent */
|
||||
static const ns_src default_src[] = {
|
||||
{ NSSRC_FILES, NS_SUCCESS },
|
||||
{ NSSRC_DNS, NS_SUCCESS },
|
||||
|
@ -239,8 +239,8 @@ getipnodebyname(const char *name, int af, int flags, int *errp)
|
||||
/*
|
||||
* TODO:
|
||||
* Note that implementation dependent test for address
|
||||
* configuration should be done everytime called
|
||||
* (or apropriate interval),
|
||||
* configuration should be done every time called
|
||||
* (or appropriate interval),
|
||||
* because addresses will be dynamically assigned or deleted.
|
||||
*/
|
||||
_close(s);
|
||||
|
@ -95,7 +95,7 @@ safe_write(struct cached_connection_ *connection, const void *data,
|
||||
|
||||
/*
|
||||
* safe_read reads data from connection and tries to do it in the very safe
|
||||
* and stable way. It uses kevent to ensure, that the data are availabe for
|
||||
* and stable way. It uses kevent to ensure, that the data are available for
|
||||
* reading. If the amount of data to be read is too large, then they would
|
||||
* be splitted.
|
||||
*/
|
||||
|
@ -2,5 +2,5 @@
|
||||
|
||||
#define DEBUG 1 /* enable debugging code (needed for dig) */
|
||||
#define RESOLVSORT /* allow sorting of addresses in gethostbyname */
|
||||
#undef SUNSECURITY /* verify gethostbyaddr() calls - WE DONT NEED IT */
|
||||
#undef SUNSECURITY /* verify gethostbyaddr() calls - WE DON'T NEED IT */
|
||||
#define MULTI_PTRS_ARE_ALIASES 1 /* fold multiple PTR records into aliases */
|
||||
|
@ -111,7 +111,7 @@ acl_delete_entry(acl_t acl, acl_entry_t entry_d)
|
||||
sizeof(struct acl_entry));
|
||||
acl->ats_cur_entry = 0;
|
||||
|
||||
/* Continue with the loop to remove all maching entries. */
|
||||
/* Continue with the loop to remove all matching entries. */
|
||||
found = 1;
|
||||
} else
|
||||
i++;
|
||||
|
@ -367,7 +367,7 @@ _posix1e_acl_add_entry(acl_t acl, acl_tag_t tag, uid_t id, acl_perm_t perm)
|
||||
|
||||
/*
|
||||
* Convert "old" type - ACL_TYPE_{ACCESS,DEFAULT}_OLD - into its "new"
|
||||
* counterpart. It's neccessary for the old (pre-NFSv4 ACLs) binaries
|
||||
* counterpart. It's necessary for the old (pre-NFSv4 ACLs) binaries
|
||||
* to work with new libc and kernel. Fixing 'type' for old binaries with
|
||||
* old libc and new kernel is being done by kern/vfs_acl.c:type_unold().
|
||||
*/
|
||||
|
@ -578,7 +578,7 @@ p_simp_re(struct parse *p,
|
||||
sopno subno;
|
||||
# define BACKSL (1<<CHAR_BIT)
|
||||
|
||||
pos = HERE(); /* repetion op, if any, covers from here */
|
||||
pos = HERE(); /* repetition op, if any, covers from here */
|
||||
|
||||
assert(MORE()); /* caller should have ensured this */
|
||||
c = GETNEXT();
|
||||
|
@ -85,7 +85,7 @@ __FBSDID("$FreeBSD$");
|
||||
/*%
|
||||
* Expand compressed domain name 'src' to full domain name.
|
||||
*
|
||||
* \li 'msg' is a pointer to the begining of the message,
|
||||
* \li 'msg' is a pointer to the beginning of the message,
|
||||
* \li 'eom' points to the first location after the message,
|
||||
* \li 'dst' is a pointer to a buffer of size 'dstsiz' for the result.
|
||||
* \li Return size of compressed name or -1 if there was an error.
|
||||
|
@ -119,7 +119,7 @@ static void res_dprintf(const char *, ...) ISC_FORMAT_PRINTF(1, 2);
|
||||
* notes:
|
||||
*\li this function calls res_nsend() which means it depends on correctly
|
||||
* functioning recursive nameservers (usually defined in /etc/resolv.conf
|
||||
* or its local equivilent).
|
||||
* or its local equivalent).
|
||||
*
|
||||
*\li we start by asking for an SOA<dname,class>. if we get one as an
|
||||
* answer, that just means <dname,class> is a zone top, which is fine.
|
||||
|
@ -144,7 +144,7 @@ static u_int32_t net_mask(struct in_addr);
|
||||
* there will have precedence. Otherwise, the server address is set to
|
||||
* INADDR_ANY and the default domain name comes from the gethostname().
|
||||
*
|
||||
* An interrim version of this code (BIND 4.9, pre-4.4BSD) used 127.0.0.1
|
||||
* An interim version of this code (BIND 4.9, pre-4.4BSD) used 127.0.0.1
|
||||
* rather than INADDR_ANY ("0.0.0.0") as the default name server address
|
||||
* since it was noted that INADDR_ANY actually meant ``the first interface
|
||||
* you "ifconfig"'d at boot time'' and if this was a SLIP or PPP interface,
|
||||
@ -167,7 +167,7 @@ res_ninit(res_state statp) {
|
||||
return (__res_vinit(statp, 0));
|
||||
}
|
||||
|
||||
/*% This function has to be reachable by res_data.c but not publically. */
|
||||
/*% This function has to be reachable by res_data.c but not publicly. */
|
||||
int
|
||||
__res_vinit(res_state statp, int preinit) {
|
||||
FILE *fp;
|
||||
|
@ -72,7 +72,7 @@ WHAT'S NEW IN THIS RELEASE: TIRPCSRC 2.3
|
||||
The previous release was TIRPCSRC 2.0.
|
||||
|
||||
1. This release is based on Solaris 2.3. The previous release was
|
||||
based on Solaris 2.0. This release contains a siginificant number of
|
||||
based on Solaris 2.0. This release contains a significant number of
|
||||
bug fixes and other enhancements over TIRPCSRC 2.0.
|
||||
|
||||
2. The RPC library is thread safe for all client-side interfaces
|
||||
|
@ -582,7 +582,7 @@ clnt_dg_call(CLIENT *cl, rpcproc_t proc, xdrproc_t xargs, void *argsp,
|
||||
}
|
||||
} /* end successful completion */
|
||||
/*
|
||||
* If unsuccesful AND error is an authentication error
|
||||
* If unsuccessful AND error is an authentication error
|
||||
* then refresh credentials and try again, else break
|
||||
*/
|
||||
else if (cu->cu_error.re_status == RPC_AUTHERROR)
|
||||
@ -742,7 +742,7 @@ clnt_dg_control(CLIENT *cl, u_int request, void *info)
|
||||
/*
|
||||
* This RELIES on the information that, in the call body,
|
||||
* the version number field is the fifth field from the
|
||||
* begining of the RPC header. MUST be changed if the
|
||||
* beginning of the RPC header. MUST be changed if the
|
||||
* call_struct is changed
|
||||
*/
|
||||
*(u_int32_t *)info =
|
||||
@ -759,7 +759,7 @@ clnt_dg_control(CLIENT *cl, u_int request, void *info)
|
||||
/*
|
||||
* This RELIES on the information that, in the call body,
|
||||
* the program number field is the fourth field from the
|
||||
* begining of the RPC header. MUST be changed if the
|
||||
* beginning of the RPC header. MUST be changed if the
|
||||
* call_struct is changed
|
||||
*/
|
||||
*(u_int32_t *)info =
|
||||
|
@ -601,7 +601,7 @@ clnt_vc_control(CLIENT *cl, u_int request, void *info)
|
||||
/*
|
||||
* This RELIES on the information that, in the call body,
|
||||
* the version number field is the fifth field from the
|
||||
* begining of the RPC header. MUST be changed if the
|
||||
* beginning of the RPC header. MUST be changed if the
|
||||
* call_struct is changed
|
||||
*/
|
||||
ntohlp(info, ct->ct_u.ct_mcallc + 4 * BYTES_PER_XDR_UNIT);
|
||||
@ -615,7 +615,7 @@ clnt_vc_control(CLIENT *cl, u_int request, void *info)
|
||||
/*
|
||||
* This RELIES on the information that, in the call body,
|
||||
* the program number field is the fourth field from the
|
||||
* begining of the RPC header. MUST be changed if the
|
||||
* beginning of the RPC header. MUST be changed if the
|
||||
* call_struct is changed
|
||||
*/
|
||||
ntohlp(info, ct->ct_u.ct_mcallc + 3 * BYTES_PER_XDR_UNIT);
|
||||
|
@ -405,7 +405,7 @@ endnetconfig(void *handlep)
|
||||
}
|
||||
|
||||
/*
|
||||
* Noone needs these entries anymore, then frees them.
|
||||
* No one needs these entries anymore, then frees them.
|
||||
* Make sure all info in netconfig_info structure has been reinitialized.
|
||||
*/
|
||||
q = ni.head;
|
||||
|
@ -74,7 +74,7 @@ __FBSDID("$FreeBSD$");
|
||||
* The services list
|
||||
* Each entry represents a set of procedures (an rpc program).
|
||||
* The dispatch routine takes request structs and runs the
|
||||
* apropriate procedure.
|
||||
* appropriate procedure.
|
||||
*/
|
||||
static struct svc_callout {
|
||||
struct svc_callout *sc_next;
|
||||
|
@ -42,7 +42,7 @@ __FBSDID("$FreeBSD$");
|
||||
|
||||
/*
|
||||
* This interface creates a virtual listener for all the services
|
||||
* started thru rpc_reg(). It listens on the same endpoint for
|
||||
* started through rpc_reg(). It listens on the same endpoint for
|
||||
* all the services and then executes the corresponding service
|
||||
* for the given prognum and procnum.
|
||||
*/
|
||||
@ -229,7 +229,7 @@ rpc_reg(rpcprog_t prognum, rpcvers_t versnum, rpcproc_t procnum,
|
||||
mutex_unlock(&proglst_lock);
|
||||
|
||||
if (done == FALSE) {
|
||||
warnx("%s cant find suitable transport for %s",
|
||||
warnx("%s can't find suitable transport for %s",
|
||||
rpc_reg_msg, nettype);
|
||||
return (-1);
|
||||
}
|
||||
|
@ -262,7 +262,7 @@ makefd_xprt(int fd, u_int sendsize, u_int recvsize)
|
||||
xprt, read_vc, write_vc);
|
||||
xprt->xp_p1 = cd;
|
||||
xprt->xp_verf.oa_base = cd->verf_body;
|
||||
svc_vc_ops(xprt); /* truely deals with calls */
|
||||
svc_vc_ops(xprt); /* truly deals with calls */
|
||||
xprt->xp_port = 0; /* this is a connection, not a rendezvouser */
|
||||
xprt->xp_fd = fd;
|
||||
if (__rpc_fd2sockinfo(fd, &si) && __rpc_sockinfo2netid(&si, &netid))
|
||||
|
@ -51,7 +51,7 @@ typedef void (fp_ldst64_fn)(u_int64_t *);
|
||||
/*
|
||||
* These are the functions that are actually used in the fpu emulation code to
|
||||
* access the fp registers. They are usually not used more than once, so
|
||||
* cacheing needs not be done here.
|
||||
* caching needs not be done here.
|
||||
*/
|
||||
static __inline u_int32_t
|
||||
__fpu_getreg(int r)
|
||||
|
@ -864,7 +864,7 @@ __sccl(char *tab, const u_char *fmt)
|
||||
* z', but treats `a-a' as `the letter a, the
|
||||
* character -, and the letter a'.
|
||||
*
|
||||
* For compatibility, the `-' is not considerd
|
||||
* For compatibility, the `-' is not considered
|
||||
* to define a range if the character following
|
||||
* it is either a close bracket (required by ANSI)
|
||||
* or is not numerically greater than the character
|
||||
|
@ -102,7 +102,7 @@ typedef DECLARE_BLOCK(int, heapsort_block, const void *, const void *);
|
||||
* Select the top of the heap and 'heapify'. Since by far the most expensive
|
||||
* action is the call to the compar function, a considerable optimization
|
||||
* in the average case can be achieved due to the fact that k, the displaced
|
||||
* elememt, is ususally quite small, so it would be preferable to first
|
||||
* elememt, is usually quite small, so it would be preferable to first
|
||||
* heapify, always maintaining the invariant that the larger child is copied
|
||||
* over its parent's record.
|
||||
*
|
||||
|
@ -50,7 +50,7 @@ __FBSDID("$FreeBSD$");
|
||||
#define SIGN_POSN_USED 0x02 /* '+' or '(' usage flag */
|
||||
#define LOCALE_POSN 0x04 /* use locale defined +/- (default) */
|
||||
#define PARENTH_POSN 0x08 /* enclose negative amount in () */
|
||||
#define SUPRESS_CURR_SYMBOL 0x10 /* supress the currency from output */
|
||||
#define SUPRESS_CURR_SYMBOL 0x10 /* suppress the currency from output */
|
||||
#define LEFT_JUSTIFY 0x20 /* left justify */
|
||||
#define USE_INTL_CURRENCY 0x40 /* use international currency symbol */
|
||||
#define IS_NEGATIVE 0x80 /* is argument value negative ? */
|
||||
@ -580,7 +580,7 @@ __format_grouped_double(double value, int *flags,
|
||||
}
|
||||
bufend = rslt + bufsize - 1; /* reserve space for trailing '\0' */
|
||||
|
||||
/* skip spaces at beggining */
|
||||
/* skip spaces at beginning */
|
||||
padded = 0;
|
||||
while (avalue[padded] == ' ') {
|
||||
padded++;
|
||||
|
@ -65,7 +65,7 @@ wcscoll_l(const wchar_t *ws1, const wchar_t *ws2, locale_t locale)
|
||||
* safely. You absolutely have to run this pass by pass,
|
||||
* because some passes will be ignored for a given character,
|
||||
* while others will not. Simpler locales will benefit from
|
||||
* having fewer passes, and most comparisions should resolve
|
||||
* having fewer passes, and most comparisons should resolve
|
||||
* during the primary pass anyway.
|
||||
*
|
||||
* Note that we do one final extra pass at the end to pick
|
||||
|
@ -154,7 +154,7 @@ The separate
|
||||
and
|
||||
.Fa id
|
||||
arguments support many other types of
|
||||
identifers in addition to process IDs and process group IDs.
|
||||
identifiers in addition to process IDs and process group IDs.
|
||||
.Bl -bullet -offset indent
|
||||
.It
|
||||
If
|
||||
|
@ -315,8 +315,8 @@ protoent_test_correctness(struct protoent *pe, void *mdata)
|
||||
}
|
||||
|
||||
/* protoent_check_ambiguity() is needed when one port+proto is associated with
|
||||
* more than one peice (these cases are usually marked as PROBLEM in
|
||||
* /etc/peices. This functions is needed also when one peice+proto is
|
||||
* more than one piece (these cases are usually marked as PROBLEM in
|
||||
* /etc/peices. This functions is needed also when one piece+proto is
|
||||
* associated with several ports. We have to check all the protoent structures
|
||||
* to make sure that pe really exists and correct */
|
||||
static int
|
||||
|
@ -317,8 +317,8 @@ rpcent_test_correctness(struct rpcent *rpc, void *mdata)
|
||||
}
|
||||
|
||||
/* rpcent_check_ambiguity() is needed when one port+rpc is associated with
|
||||
* more than one peice (these cases are usually marked as PROBLEM in
|
||||
* /etc/peices. This functions is needed also when one peice+rpc is
|
||||
* more than one piece (these cases are usually marked as PROBLEM in
|
||||
* /etc/peices. This functions is needed also when one piece+rpc is
|
||||
* associated with several ports. We have to check all the rpcent structures
|
||||
* to make sure that rpc really exists and correct */
|
||||
static int
|
||||
|
Loading…
Reference in New Issue
Block a user