typofix: in-code comments
Signed-off-by: Ondřej Bílka <neleai@seznam.cz> Signed-off-by: Junio C Hamano <gitster@pobox.com>
This commit is contained in:

committed by
Junio C Hamano

parent
17b83d71d5
commit
749f763dbb
@ -2617,7 +2617,7 @@ parse_dup_op (bin_tree_t *elem, re_string_t *regexp, re_dfa_t *dfa,
|
||||
Build the range expression which starts from START_ELEM, and ends
|
||||
at END_ELEM. The result are written to MBCSET and SBCSET.
|
||||
RANGE_ALLOC is the allocated size of mbcset->range_starts, and
|
||||
mbcset->range_ends, is a pointer argument sinse we may
|
||||
mbcset->range_ends, is a pointer argument since we may
|
||||
update it. */
|
||||
|
||||
static reg_errcode_t
|
||||
@ -2788,7 +2788,7 @@ parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, re_token_t *token,
|
||||
const int32_t *symb_table;
|
||||
const unsigned char *extra;
|
||||
|
||||
/* Local function for parse_bracket_exp used in _LIBC environement.
|
||||
/* Local function for parse_bracket_exp used in _LIBC environment.
|
||||
Seek the collating symbol entry correspondings to NAME.
|
||||
Return the index of the symbol in the SYMB_TABLE. */
|
||||
|
||||
@ -2892,11 +2892,11 @@ parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, re_token_t *token,
|
||||
return UINT_MAX;
|
||||
}
|
||||
|
||||
/* Local function for parse_bracket_exp used in _LIBC environement.
|
||||
/* Local function for parse_bracket_exp used in _LIBC environment.
|
||||
Build the range expression which starts from START_ELEM, and ends
|
||||
at END_ELEM. The result are written to MBCSET and SBCSET.
|
||||
RANGE_ALLOC is the allocated size of mbcset->range_starts, and
|
||||
mbcset->range_ends, is a pointer argument sinse we may
|
||||
mbcset->range_ends, is a pointer argument since we may
|
||||
update it. */
|
||||
|
||||
auto inline reg_errcode_t
|
||||
@ -2976,11 +2976,11 @@ parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, re_token_t *token,
|
||||
return REG_NOERROR;
|
||||
}
|
||||
|
||||
/* Local function for parse_bracket_exp used in _LIBC environement.
|
||||
/* Local function for parse_bracket_exp used in _LIBC environment.
|
||||
Build the collating element which is represented by NAME.
|
||||
The result are written to MBCSET and SBCSET.
|
||||
COLL_SYM_ALLOC is the allocated size of mbcset->coll_sym, is a
|
||||
pointer argument sinse we may update it. */
|
||||
pointer argument since we may update it. */
|
||||
|
||||
auto inline reg_errcode_t
|
||||
__attribute ((always_inline))
|
||||
@ -3419,7 +3419,7 @@ parse_bracket_symbol (bracket_elem_t *elem, re_string_t *regexp,
|
||||
Build the equivalence class which is represented by NAME.
|
||||
The result are written to MBCSET and SBCSET.
|
||||
EQUIV_CLASS_ALLOC is the allocated size of mbcset->equiv_classes,
|
||||
is a pointer argument sinse we may update it. */
|
||||
is a pointer argument since we may update it. */
|
||||
|
||||
static reg_errcode_t
|
||||
#ifdef RE_ENABLE_I18N
|
||||
@ -3515,7 +3515,7 @@ build_equiv_class (bitset_t sbcset, const unsigned char *name)
|
||||
Build the character class which is represented by NAME.
|
||||
The result are written to MBCSET and SBCSET.
|
||||
CHAR_CLASS_ALLOC is the allocated size of mbcset->char_classes,
|
||||
is a pointer argument sinse we may update it. */
|
||||
is a pointer argument since we may update it. */
|
||||
|
||||
static reg_errcode_t
|
||||
#ifdef RE_ENABLE_I18N
|
||||
|
@ -455,7 +455,7 @@ re_search_stub (struct re_pattern_buffer *bufp,
|
||||
|
||||
rval = 0;
|
||||
|
||||
/* I hope we needn't fill ther regs with -1's when no match was found. */
|
||||
/* I hope we needn't fill their regs with -1's when no match was found. */
|
||||
if (result != REG_NOERROR)
|
||||
rval = -1;
|
||||
else if (regs != NULL)
|
||||
@ -1071,7 +1071,7 @@ acquire_init_state_context (reg_errcode_t *err, const re_match_context_t *mctx,
|
||||
FL_LONGEST_MATCH means we want the POSIX longest matching.
|
||||
If P_MATCH_FIRST is not NULL, and the match fails, it is set to the
|
||||
next place where we may want to try matching.
|
||||
Note that the matcher assume that the maching starts from the current
|
||||
Note that the matcher assume that the matching starts from the current
|
||||
index of the buffer. */
|
||||
|
||||
static int
|
||||
@ -2239,7 +2239,7 @@ sift_states_iter_mb (const re_match_context_t *mctx, re_sift_context_t *sctx,
|
||||
dfa->nexts[node_idx]))
|
||||
/* The node can't accept the `multi byte', or the
|
||||
destination was already thrown away, then the node
|
||||
could't accept the current input `multi byte'. */
|
||||
couldn't accept the current input `multi byte'. */
|
||||
naccepted = 0;
|
||||
/* Otherwise, it is sure that the node could accept
|
||||
`naccepted' bytes input. */
|
||||
|
Reference in New Issue
Block a user