summaryrefslogtreecommitdiff
path: root/lib/dfa.c
diff options
context:
space:
mode:
authorPaul Eggert <eggert@cs.ucla.edu>2019-12-11 13:40:01 -0800
committerPaul Eggert <eggert@cs.ucla.edu>2019-12-11 15:09:38 -0800
commit360cbd3b17a314807e808626e100ef47dcf4d162 (patch)
tree2dc2500b8ba8a53e96f8cbc484ccf9898ea3de86 /lib/dfa.c
parentac92492294ca52fe2596f6353a3fe2800052f676 (diff)
downloadgnulib-360cbd3b17a314807e808626e100ef47dcf4d162.tar.gz
dfa: update commentary for previous change
* NEWS: Mention the change. * lib/dfa.c, lib/dfa.h (dfaparse, dfamust, dfacomp): Update comments.
Diffstat (limited to 'lib/dfa.c')
-rw-r--r--lib/dfa.c9
1 files changed, 5 insertions, 4 deletions
diff --git a/lib/dfa.c b/lib/dfa.c
index 1e125b4d24..2347a91c13 100644
--- a/lib/dfa.c
+++ b/lib/dfa.c
@@ -1966,9 +1966,8 @@ regexp (struct dfa *dfa)
}
}
-/* Main entry point for the parser. S is a string to be parsed, len is the
- length of the string, so s can include NUL characters. D is a pointer to
- the struct dfa to parse into. */
+/* Parse a string S of length LEN into D. S can include NUL characters.
+ This is the main entry point for the parser. */
void
dfaparse (char const *s, size_t len, struct dfa *d)
{
@@ -3741,7 +3740,9 @@ dfassbuild (struct dfa *d)
}
}
-/* Parse and analyze a single string of the given length. */
+/* Parse a string S of length LEN into D (but skip this step if S is null).
+ Then analyze D and build a matcher for it.
+ SEARCHFLAG says whether to build a searching or an exact matcher. */
void
dfacomp (char const *s, size_t len, struct dfa *d, bool searchflag)
{