Commit ce2c5173 authored by Quanah Gibson-Mount's avatar Quanah Gibson-Mount
Browse files

ITS#9161 - Fix various typos

Fix a number of different typos across the code base
parent 71213e69
......@@ -99,7 +99,7 @@ int uccanondecomp(const unsigned long *in, int inlen, unsigned long **out,
the characters at the same time.
If a -1 is returned, memory allocation was not successful. If a zero is
returned, no decomposition occured. Any other value means the output string
returned, no decomposition occurred. Any other value means the output string
contains the fully decomposed string in canonical order.
If the "outlen" parameter comes back with a value > 0, then the string
......@@ -146,7 +146,7 @@ int uccomp_hangul(unsigned long *str, int len)
done in-place.
The return value provides the new length of the string. This will be
smaller than "len" if compositions occured.
smaller than "len" if compositions occurred.
int uccanoncomp(unsigned long *str, int len)
......
......@@ -490,7 +490,7 @@ _ucstring_visual_cursor_right(ucstring_t *str, int count)
*/
if (cursor->visual_next == 0)
/*
* If movement occured, then report it.
* If movement occurred, then report it.
*/
return (cnt != count);
......@@ -616,7 +616,7 @@ _ucstring_visual_cursor_left(ucstring_t *str, int count)
*/
if (cursor->visual_prev == 0)
/*
* If movement occured, then report it.
* If movement occurred, then report it.
*/
return (cnt != count);
......
......@@ -1700,7 +1700,7 @@ ure_compile(ucs2_t *re, unsigned long relen, int casefold, ure_buffer_t buf)
/*
* Reset the various fields of the compilation buffer. Default the flags
* to indicate the presense of the "^$" pattern. If any other pattern
* to indicate the presence of the "^$" pattern. If any other pattern
* occurs, then this flag will be removed. This is done to catch this
* special pattern and handle it specially when matching.
*/
......@@ -1720,7 +1720,7 @@ ure_compile(ucs2_t *re, unsigned long relen, int casefold, ure_buffer_t buf)
buf->states.states_used = 0;
/*
* Construct the NFA. If this stage returns a 0, then an error occured or
* Construct the NFA. If this stage returns a 0, then an error occurred or
* an empty expression was passed.
*/
if ((state = _ure_re2nfa(re, relen, buf)) == _URE_NOOP)
......
......@@ -15,7 +15,7 @@
* <http://www.OpenLDAP.org/license.html>.
*/
/* This work was initially developed by Kurt D. Zeilenga for
* inclusion in OpenLDAP Software based, in part, on publically
* inclusion in OpenLDAP Software based, in part, on publicly
* available works (as noted below).
*/
......
......@@ -241,8 +241,8 @@ static void *start_status_routine( void *ptr )
SetServiceStatus(hlutil_ServiceStatus, &lutil_ServiceStatus);
break;
case WAIT_FAILED:
/* theres been some problem with WaitForSingleObject so tell the Service
* Control Manager to wait 30 seconds before deploying its assasin and
/* there's been some problem with WaitForSingleObject so tell the Service
* Control Manager to wait 30 seconds before deploying its assassin and
* then leave the thread. */
lutil_ServiceStatus.dwCheckPoint++;
lutil_ServiceStatus.dwWaitHint = THIRTY_SECONDS;
......@@ -283,8 +283,8 @@ static void *stop_status_routine( void *ptr )
SetServiceStatus(hlutil_ServiceStatus, &lutil_ServiceStatus);
break;
case WAIT_FAILED:
/* theres been some problem with WaitForSingleObject so tell the Service
* Control Manager to wait 30 seconds before deploying its assasin and
/* there's been some problem with WaitForSingleObject so tell the Service
* Control Manager to wait 30 seconds before deploying its assassin and
* then leave the thread. */
lutil_ServiceStatus.dwCheckPoint++;
lutil_ServiceStatus.dwWaitHint = THIRTY_SECONDS;
......@@ -332,7 +332,7 @@ static void WINAPI lutil_ServiceCtrlHandler( IN DWORD Opcode)
/* failed to create the thread that tells the Service Control Manager that the
* service stopping is proceeding.
* tell the Service Control Manager to wait another 30 seconds before deploying its
* assasin. */
* assassin. */
lutil_ServiceStatus.dwCheckPoint++;
lutil_ServiceStatus.dwWaitHint = THIRTY_SECONDS;
SetServiceStatus(hlutil_ServiceStatus, &lutil_ServiceStatus);
......@@ -444,7 +444,7 @@ void lutil_CommenceStartupProcessing( char *lpszServiceName,
{
/* failed to create the event to determine when the startup process is complete so
* tell the Service Control Manager to wait another 30 seconds before deploying its
* assasin */
* assassin */
lutil_ServiceStatus.dwCheckPoint++;
lutil_ServiceStatus.dwWaitHint = THIRTY_SECONDS;
SetServiceStatus(hlutil_ServiceStatus, &lutil_ServiceStatus);
......@@ -461,7 +461,7 @@ void lutil_CommenceStartupProcessing( char *lpszServiceName,
/* failed to create the thread that tells the Service Control Manager that the
* service startup is proceeding.
* tell the Service Control Manager to wait another 30 seconds before deploying its
* assasin. */
* assassin. */
lutil_ServiceStatus.dwCheckPoint++;
lutil_ServiceStatus.dwWaitHint = THIRTY_SECONDS;
SetServiceStatus(hlutil_ServiceStatus, &lutil_ServiceStatus);
......
......@@ -10,7 +10,7 @@
// source with by creating the appropriate entries in the system registry.
//
//
// Values are 32 bit values layed out as follows:
// Values are 32 bit values laid out as follows:
//
// 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1
// 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0
......
......@@ -122,7 +122,7 @@ client_bind_as_vc(
/*
* The client connection can be in the following states:
* 1) there are betwee zero and many non-bind operations pending
* 1) there are between zero and many non-bind operations pending
* client->c_state == LLOAD_C_READY && client->c_pin_id == 0
* 2) there is one bind operation pending (waiting on an upstream response)
* a) It is a simple bind
......@@ -163,7 +163,7 @@ client_bind_as_vc(
* As usual, we have to make any changes to the target connection before we've
* sent the PDU over it - while we are in charge of the read side and nothing
* happens there without our ceding control, the other read side could wake up
* at any time and pre-empt us.
* at any time and preempt us.
*
* On a response (in handle_bind_response):
* - to a simple bind, clear c_auth on a failure otherwise keep it while we
......@@ -222,7 +222,7 @@ request_bind( LloadConnection *client, LloadOperation *op )
pinned_op->o_request = op->o_request;
pinned_op->o_ctrls = op->o_ctrls;
/* Noone has seen this operation yet, plant the pin back in its stead */
/* No one has seen this operation yet, plant the pin back in its stead */
client->c_n_ops_executing--;
op->o_res = LLOAD_OP_COMPLETED;
tavl_delete( &client->c_ops, op, operation_client_cmp );
......@@ -233,7 +233,7 @@ request_bind( LloadConnection *client, LloadOperation *op )
avl_dup_error );
assert( rc == LDAP_SUCCESS );
/* Noone has seen this operation yet */
/* No one has seen this operation yet */
op->o_refcnt--;
operation_destroy( op );
......
......@@ -1856,7 +1856,7 @@ slap_acl_mask(
ACL_PRIV_CLR( *mask, ~ACL_PRIV_MASK );
} else if( ACL_IS_SUBTRACTIVE(modmask) ) {
/* substract privs */
/* subtract privs */
ACL_PRIV_CLR( *mask, modmask );
/* cleanup */
......
......@@ -546,7 +546,7 @@ int ad_inlist(
}
/*
* EXTENSION: if requested description is preceeded by
* EXTENSION: if requested description is preceded by
* a '-' character, do not match on subtypes.
*/
if ( attrs->an_name.bv_val[0] == '-' ) {
......
......@@ -200,7 +200,7 @@ at_delete_from_list(
list[i] = list[j];
}
list[i] = NULL;
/* Tell the runtime this can be shrinked */
/* Tell the runtime this can be shrunk */
list1 = ch_realloc(list, (i+1)*sizeof(AttributeType **));
if ( !list1 ) {
return -1;
......
......@@ -1077,7 +1077,7 @@ asyncmeta_back_proxy_authz_ctrl(Operation *op,
* option (2) will likely break the idassert
* assumptions, so we cannot accept it;
* option (1) means that we are contradicting
* the client's reques.
* the client's request.
*
* I think (4) is the only correct choice.
*/
......
......@@ -2625,7 +2625,7 @@ ldap_back_proxy_authz_ctrl(
* option (2) will likely break the idassert
* assumptions, so we cannot accept it;
* option (1) means that we are contradicting
* the client's reques.
* the client's request.
*
* I think (4) is the only correct choice.
*/
......
......@@ -32,7 +32,7 @@
* the same key. Also, the first item under the key contains the entry's own
* rdn and the ID of the node's parent, to allow bottom-up tree traversal as
* well as top-down. To keep this info first in the list, the high bit of all
* subsequent nrdnlen's is always set. This means we can only accomodate
* subsequent nrdnlen's is always set. This means we can only accommodate
* RDNs up to length 32767, but that's fine since full DNs are already
* restricted to 8192.
*
......
......@@ -91,7 +91,7 @@ unsigned mdb_idl_search( ID *ids, ID id )
/*
* binary search of id in ids
* if found, returns position of id
* if not found, returns first postion greater than id
* if not found, returns first position greater than id
*/
unsigned base = 0;
unsigned cursor = 1;
......@@ -1189,7 +1189,7 @@ mdb_idl_sort( ID *ids, ID *tmp )
np = num;
for ( i = BUCKETS; i > 0; --i ) *np++ = 0;
/* count occurences of every byte value */
/* count occurrences of every byte value */
bp = source_start;
for ( i = size; i > 0; --i, bp += sizeof(ID) )
num[*bp]++;
......
......@@ -328,7 +328,7 @@ down:;
default:
other:;
/* convert rc to the correct LDAP error and send it back to the client:
assing the error to rs, so we can use it as argument to slap_map_api2result
assign the error to rs, so we can use it as argument to slap_map_api2result
and then assign the output back to rs->sr_err */
rs->sr_err = rc;
rs->sr_err = slap_map_api2result( rs );
......
......@@ -48,7 +48,7 @@ is used to hold the monitor information of each entry.
FUNCTIONALITY
Most of the sybsystems contain an additional depth level, represented
Most of the subsystems contain an additional depth level, represented
by detailed item monitoring.
All the entries undergo an update operation, if a related method is
defined, prior to being returned. Moreover, there's a mechanism to
......
......@@ -18,7 +18,7 @@
/* This file is necessary because both PERL headers */
/* and OpenLDAP define a number of macros without */
/* checking wether they're already defined */
/* checking whether they're already defined */
#ifndef ASPERL_UNDEFS_H
#define ASPERL_UNDEFS_H
......
......@@ -79,7 +79,7 @@ unsigned wt_idl_search( ID *ids, ID id )
/*
* binary search of id in ids
* if found, returns position of id
* if not found, returns first postion greater than id
* if not found, returns first position greater than id
*/
unsigned base = 0;
unsigned cursor = 1;
......@@ -755,7 +755,7 @@ wt_idl_sort( ID *ids, ID *tmp )
np = num;
for ( i = BUCKETS; i > 0; --i ) *np++ = 0;
/* count occurences of every byte value */
/* count occurrences of every byte value */
bp = source_start;
for ( i = size; i > 0; --i, bp += sizeof(ID) )
num[*bp]++;
......
......@@ -863,7 +863,7 @@ get_matching_value( Operation *op, ComponentAssertion* ca,
}
} else {
/* embeded componentFilterMatch Description */
/* embedded componentFilterMatch Description */
bv->bv_val = cav->cav_ptr;
bv->bv_len = cav_cur_len( cav );
}
......
......@@ -759,7 +759,7 @@ int entry_encode(Entry *e, struct berval *bv)
/* Retrieve an Entry that was stored using entry_encode above.
* First entry_header must be called to decode the size of the entry.
* Then a single block of memory must be malloc'd to accomodate the
* Then a single block of memory must be malloc'd to accommodate the
* bervals and the bulk data. Next the bulk data is retrieved from
* the DB and parsed by entry_decode.
*
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment