lib/glibc
1
0
Fork 0
mirror of https://sourceware.org/git/glibc.git synced 2025-07-30 22:43:12 +03:00
Code Activity

regex: Fix spelling in comments.

Browse Source 
Fix the spelling in various comments throughout the
regex implementation. These changes are also present
in gnulib and will be integrated there also, see:
https://sourceware.org/ml/libc-alpha/2017-12/msg00688.html
This commit is contained in:
Arnold Robbins
2017-12-19 19:26:08 -08:00
committed by Carlos O'Donell
parent c85e54ac6c
commit 5069ff3284
5 changed files with 14 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
ChangeLog
View File

@ -1,3 +1,10 @@
2017-12-19 Arnold D. Robbins <arnold@skeeve.com>
* posix/regcomp.c: Fix spelling in comments.
* posix/regex.h: Likewise.
* posix/regex_internal.c: Likewise.
* posix/regexec.c: Likewise.
2017-12-19 Gabriel F. T. Gomes <gabriel@inconstante.eti.br> 2017-12-19 Gabriel F. T. Gomes <gabriel@inconstante.eti.br>
[BZ #22377] [BZ #22377]

2
posix/regcomp.c
View File

@ -3433,7 +3433,7 @@ build_equiv_class (bitset_t sbcset, const unsigned char *name)
/* This isn't a valid character. */ /* This isn't a valid character. */
return REG_ECOLLATE; return REG_ECOLLATE;
/* Build single byte matcing table for this equivalence class. */ /* Build single byte matching table for this equivalence class. */
len = weights[idx1 & 0xffffff]; len = weights[idx1 & 0xffffff];
for (ch = 0; ch < SBC_MAX; ++ch) for (ch = 0; ch < SBC_MAX; ++ch)
{ {

2
posix/regex.h
View File

@ -317,7 +317,7 @@ typedef enum
/* POSIX regcomp return error codes. (In the order listed in the /* POSIX regcomp return error codes. (In the order listed in the
standard.) */ standard.) */
REG_BADPAT, /* Invalid pattern. */ REG_BADPAT, /* Invalid pattern. */
REG_ECOLLATE, /* Inalid collating element. */ REG_ECOLLATE, /* Invalid collating element. */
REG_ECTYPE, /* Invalid character class name. */ REG_ECTYPE, /* Invalid character class name. */
REG_EESCAPE, /* Trailing backslash. */ REG_EESCAPE, /* Trailing backslash. */
REG_ESUBREG, /* Invalid back reference. */ REG_ESUBREG, /* Invalid back reference. */

2
posix/regex_internal.c
View File

@ -1594,7 +1594,7 @@ free_state (re_dfastate_t *state)
re_free (state); re_free (state);
} }
/* Create the new state which is independ of contexts. /* Create the new state which is independent of contexts.
Return the new state if succeeded, otherwise return NULL. */ Return the new state if succeeded, otherwise return NULL. */
static re_dfastate_t * static re_dfastate_t *

8
posix/regexec.c
View File

@ -266,7 +266,7 @@ compat_symbol (libc, __compat_regexec, regexec, GLIBC_2_0);
concerned. concerned.
If REGS is not NULL, and BUFP->no_sub is not set, the offsets of the match If REGS is not NULL, and BUFP->no_sub is not set, the offsets of the match
and all groups is stroed in REGS. (For the "_2" variants, the offsets are and all groups is stored in REGS. (For the "_2" variants, the offsets are
computed relative to the concatenation, not relative to the individual computed relative to the concatenation, not relative to the individual
strings.) strings.)
@ -568,7 +568,7 @@ re_exec (const char *s)
/* Searches for a compiled pattern PREG in the string STRING, whose /* Searches for a compiled pattern PREG in the string STRING, whose
length is LENGTH. NMATCH, PMATCH, and EFLAGS have the same length is LENGTH. NMATCH, PMATCH, and EFLAGS have the same
mingings with regexec. START, and RANGE have the same meanings meaning as with regexec. START, and RANGE have the same meanings
with re_search. with re_search.
Return REG_NOERROR if we find a match, and REG_NOMATCH if not, Return REG_NOERROR if we find a match, and REG_NOMATCH if not,
otherwise return the error code. otherwise return the error code.
@ -849,7 +849,7 @@ re_search_internal (const regex_t *preg, const char *string, int length,
goto free_return; goto free_return;
} }
/* At last, add the offset to the each registers, since we slided /* At last, add the offset to each register, since we slid
the buffers so that we could assume that the matching starts the buffers so that we could assume that the matching starts
from 0. */ from 0. */
for (reg_idx = 0; reg_idx < nmatch; ++reg_idx) for (reg_idx = 0; reg_idx < nmatch; ++reg_idx)
@ -2365,7 +2365,7 @@ find_recover_state (reg_errcode_t *err, re_match_context_t *mctx)
/* From the node set CUR_NODES, pick up the nodes whose types are /* From the node set CUR_NODES, pick up the nodes whose types are
OP_OPEN_SUBEXP and which have corresponding back references in the regular OP_OPEN_SUBEXP and which have corresponding back references in the regular
expression. And register them to use them later for evaluating the expression. And register them to use them later for evaluating the
correspoding back references. */ corresponding back references. */
static reg_errcode_t static reg_errcode_t
check_subexp_matching_top (re_match_context_t *mctx, re_node_set *cur_nodes, check_subexp_matching_top (re_match_context_t *mctx, re_node_set *cur_nodes,