| /src/external/gpl2/gettext/dist/gettext-tools/libgrep/ |
| m-regex.c | 35 #include "dfa.h"
49 /* DFA compiled regexp. */
50 struct dfa dfa; member in struct:compiled_regex
72 /* Callback from dfa.c. */
79 /* If the DFA turns out to have some set of fixed strings one of
90 if (cregex->dfa.musts)
96 for (dm = cregex->dfa.musts; dm; dm = dm->next)
106 for (dm = cregex->dfa.musts; dm; dm = dm->next)
171 for the DFA matcher that will quickly throw out cases that won't work
[all...] |
| m-regex.c | 35 #include "dfa.h"
49 /* DFA compiled regexp. */
50 struct dfa dfa; member in struct:compiled_regex
72 /* Callback from dfa.c. */
79 /* If the DFA turns out to have some set of fixed strings one of
90 if (cregex->dfa.musts)
96 for (dm = cregex->dfa.musts; dm; dm = dm->next)
106 for (dm = cregex->dfa.musts; dm; dm = dm->next)
171 for the DFA matcher that will quickly throw out cases that won't work
[all...] |
| dfa.h | 0 /* dfa.h - declarations for GNU deterministic regexp compiler
21 2. We should not export so much of the DFA internals.
57 states of the DFA are those that would have
148 /* Sets are stored in an array in the compiled dfa; the index of the
218 /* A state of the dfa consists of a set of positions, some flags,
239 appear in any R.E. matching the DFA. */
268 struct dfa struct
306 /* Array of the bracket expressoin in the DFA. */
313 dfa_state *states; /* States of the dfa. */
351 the dfa. *
[all...] |
| dfa.h | 0 /* dfa.h - declarations for GNU deterministic regexp compiler
21 2. We should not export so much of the DFA internals.
57 states of the DFA are those that would have
148 /* Sets are stored in an array in the compiled dfa; the index of the
218 /* A state of the dfa consists of a set of positions, some flags,
239 appear in any R.E. matching the DFA. */
268 struct dfa struct
306 /* Array of the bracket expressoin in the DFA. */
313 dfa_state *states; /* States of the dfa. */
351 the dfa. *
[all...] |
| dfa.c | 0 /* dfa.c - deterministic extended regexp routines for GNU
90 #include "dfa.h"
103 static void dfamust (struct dfa *dfa);
242 /* A pointer to the current dfa is kept here during parsing. */
243 static struct dfa *dfa; variable in typeref:struct:dfa
245 /* Find the index of charclass s in dfa->charclasses, or allocate a new charclass. */
251 for (i = 0; i < dfa->cindex; ++i)
252 if (equal(s, dfa->charclasses[i])
[all...] |
| dfa.c | 0 /* dfa.c - deterministic extended regexp routines for GNU
90 #include "dfa.h"
103 static void dfamust (struct dfa *dfa);
242 /* A pointer to the current dfa is kept here during parsing. */
243 static struct dfa *dfa; variable in typeref:struct:dfa
245 /* Find the index of charclass s in dfa->charclasses, or allocate a new charclass. */
251 for (i = 0; i < dfa->cindex; ++i)
252 if (equal(s, dfa->charclasses[i])
[all...] |
| /src/external/gpl2/grep/dist/src/ |
| search.c | 3 /* search.c - searching subroutines using dfa, kwset and regex for grep.
37 #include "dfa.h"
50 /* DFA compiled regexp. */
51 static struct dfa dfa; variable in typeref:struct:dfa
108 /* If the DFA turns out to have some set of fixed strings one of
118 if (dfa.musts)
124 for (dm = dfa.musts; dm; dm = dm->next)
134 for (dm = dfa.musts; dm; dm = dm->next)
224 for the DFA matcher that will quickly throw out cases that won't work
[all...] |
| search.c | 3 /* search.c - searching subroutines using dfa, kwset and regex for grep.
37 #include "dfa.h"
50 /* DFA compiled regexp. */
51 static struct dfa dfa; variable in typeref:struct:dfa
108 /* If the DFA turns out to have some set of fixed strings one of
118 if (dfa.musts)
124 for (dm = dfa.musts; dm; dm = dm->next)
134 for (dm = dfa.musts; dm; dm = dm->next)
224 for the DFA matcher that will quickly throw out cases that won't work
[all...] |
| dfa.h | 1 /* $NetBSD: dfa.h,v 1.1.1.1 2016/01/10 21:36:21 christos Exp $ */
3 /* dfa.h - declarations for GNU deterministic regexp compiler
23 2. We should not export so much of the DFA internals.
76 states of the DFA are those that would have
167 /* Sets are stored in an array in the compiled dfa; the index of the
237 /* A state of the dfa consists of a set of positions, some flags,
258 appear in any R.E. matching the DFA. */
287 struct dfa struct
325 /* Array of the bracket expressoin in the DFA. */
332 dfa_state *states; /* States of the dfa. *
[all...] |
| dfa.h | 1 /* $NetBSD: dfa.h,v 1.1.1.1 2016/01/10 21:36:21 christos Exp $ */
3 /* dfa.h - declarations for GNU deterministic regexp compiler
23 2. We should not export so much of the DFA internals.
76 states of the DFA are those that would have
167 /* Sets are stored in an array in the compiled dfa; the index of the
237 /* A state of the dfa consists of a set of positions, some flags,
258 appear in any R.E. matching the DFA. */
287 struct dfa struct
325 /* Array of the bracket expressoin in the DFA. */
332 dfa_state *states; /* States of the dfa. *
[all...] |
| dfa.c | 1 /* $NetBSD: dfa.c,v 1.3 2018/06/12 21:22:47 kamil Exp $ */
3 /* dfa.c - deterministic extended regexp routines for GNU
118 #include "dfa.h"
129 static void dfamust PARAMS ((struct dfa *dfa));
268 /* A pointer to the current dfa is kept here during parsing. */
269 static struct dfa *dfa; variable in typeref:struct:dfa
271 /* Find the index of charclass s in dfa->charclasses, or allocate a new charclass. */
277 for (i = 0; i < dfa->cindex; ++i
[all...] |
| dfa.c | 1 /* $NetBSD: dfa.c,v 1.3 2018/06/12 21:22:47 kamil Exp $ */
3 /* dfa.c - deterministic extended regexp routines for GNU
118 #include "dfa.h"
129 static void dfamust PARAMS ((struct dfa *dfa));
268 /* A pointer to the current dfa is kept here during parsing. */
269 static struct dfa *dfa; variable in typeref:struct:dfa
271 /* Find the index of charclass s in dfa->charclasses, or allocate a new charclass. */
277 for (i = 0; i < dfa->cindex; ++i
[all...] |
| /src/external/gpl2/lvm2/dist/libdm/regex/ |
| matcher.c | 177 struct dfa_state *dfa,
187 r->s = dfa;
199 struct dfa_state *dfa, *ldfa; local
210 dfa = _create_dfa_state(m->mem);
211 m->start = dfa;
212 ttree_insert(tt, rx->firstpos + 1, dfa);
215 h = t = _create_state_queue(m->scratch, dfa, rx->firstpos);
218 dfa = h->s;
230 dfa->final = m->nodes[i]->final;
257 dfa->lookup[a] = ldfa
[all...] |
| matcher.c | 177 struct dfa_state *dfa,
187 r->s = dfa;
199 struct dfa_state *dfa, *ldfa; local
210 dfa = _create_dfa_state(m->mem);
211 m->start = dfa;
212 ttree_insert(tt, rx->firstpos + 1, dfa);
215 h = t = _create_state_queue(m->scratch, dfa, rx->firstpos);
218 dfa = h->s;
230 dfa->final = m->nodes[i]->final;
257 dfa->lookup[a] = ldfa
[all...] |
| /src/sys/arch/sparc64/include/ |
| hypervisor.h | 107 uint64_t dfa; /* data fault address */ member in struct:mmufsa
|
| hypervisor.h | 107 uint64_t dfa; /* data fault address */ member in struct:mmufsa
|
| /src/sys/arch/sparc64/sparc64/ |
| trap.c | 717 + offsetof(struct mmufsa, dfa);
750 paddr_t mmufsa_dfa_addr = cpus->ci_mmufsa + offsetof(struct mmufsa, dfa);
752 int64_t dfa = ldxa(mmufsa_dfa_addr, ASI_PHYS_CACHED); local
753 printf("dfa = %016lx\n", dfa);
|
| trap.c | 717 + offsetof(struct mmufsa, dfa);
750 paddr_t mmufsa_dfa_addr = cpus->ci_mmufsa + offsetof(struct mmufsa, dfa);
752 int64_t dfa = ldxa(mmufsa_dfa_addr, ASI_PHYS_CACHED); local
753 printf("dfa = %016lx\n", dfa);
|
| /src/external/bsd/openldap/dist/libraries/liblunicode/ure/ |
| ure.c | 52 * Flags used internally in the DFA.
94 * Symbol types for the DFA.
104 * Op codes for converting the NFA to a DFA.
196 * Structure to track pairs of DFA states when equivalent states are
205 * Structure used for constructing the NFA and reducing to a minimal DFA.
1190 * reduce to a DFA. The starting state for the reduction will be returned.
1332 * Need to add a new DFA state (set of NFA states).
1366 * Return the ID of the DFA state representing a group of NFA states.
1501 * Generate the DFA states for the symbols collected during the
1516 * Go through the symbol table and generate the DFA state transition
1701 ure_dfa_t dfa; local
[all...] |
| ure.c | 52 * Flags used internally in the DFA.
94 * Symbol types for the DFA.
104 * Op codes for converting the NFA to a DFA.
196 * Structure to track pairs of DFA states when equivalent states are
205 * Structure used for constructing the NFA and reducing to a minimal DFA.
1190 * reduce to a DFA. The starting state for the reduction will be returned.
1332 * Need to add a new DFA state (set of NFA states).
1366 * Return the ID of the DFA state representing a group of NFA states.
1501 * Generate the DFA states for the symbols collected during the
1516 * Go through the symbol table and generate the DFA state transition
1701 ure_dfa_t dfa; local
[all...] |
| /src/external/gpl2/xcvs/dist/lib/ |
| regcomp.c | 28 static reg_errcode_t init_dfa (re_dfa_t *dfa, Idx pat_len);
33 static reg_errcode_t create_initial_state (re_dfa_t *dfa);
35 static void optimize_utf8 (re_dfa_t *dfa);
51 static Idx duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint);
52 static Idx search_duplicated_node (const re_dfa_t *dfa, Idx org_node,
54 static reg_errcode_t calc_eclosure (re_dfa_t *dfa);
55 static reg_errcode_t calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa,
57 static reg_errcode_t calc_inveclosure (re_dfa_t *dfa);
77 re_dfa_t *dfa, re_token_t *token,
79 static bin_tree_t *parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa,
269 re_dfa_t *dfa = (re_dfa_t *) bufp->re_buffer; local
303 re_dfa_t *dfa = (re_dfa_t *) bufp->re_buffer; local
623 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
716 re_dfa_t *dfa; local
918 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
1098 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
1226 re_dfa_t *dfa = (re_dfa_t *) extra; local
1279 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
1315 re_dfa_t *dfa = (re_dfa_t *) extra; local
1358 re_dfa_t *dfa = (re_dfa_t *) extra; local
2063 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
2097 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
2139 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
2178 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
2394 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
[all...] |
| regcomp.c | 28 static reg_errcode_t init_dfa (re_dfa_t *dfa, Idx pat_len);
33 static reg_errcode_t create_initial_state (re_dfa_t *dfa);
35 static void optimize_utf8 (re_dfa_t *dfa);
51 static Idx duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint);
52 static Idx search_duplicated_node (const re_dfa_t *dfa, Idx org_node,
54 static reg_errcode_t calc_eclosure (re_dfa_t *dfa);
55 static reg_errcode_t calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa,
57 static reg_errcode_t calc_inveclosure (re_dfa_t *dfa);
77 re_dfa_t *dfa, re_token_t *token,
79 static bin_tree_t *parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa,
269 re_dfa_t *dfa = (re_dfa_t *) bufp->re_buffer; local
303 re_dfa_t *dfa = (re_dfa_t *) bufp->re_buffer; local
623 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
716 re_dfa_t *dfa; local
918 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
1098 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
1226 re_dfa_t *dfa = (re_dfa_t *) extra; local
1279 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
1315 re_dfa_t *dfa = (re_dfa_t *) extra; local
1358 re_dfa_t *dfa = (re_dfa_t *) extra; local
2063 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
2097 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
2139 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
2178 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
2394 re_dfa_t *dfa = (re_dfa_t *) preg->re_buffer; local
[all...] |
| regex_internal.h | 546 /* `node_idx' is the index in dfa->nodes, if `type' == 0.
665 re_dfa_t *const dfa; member in struct:__anon7265
667 re_dfa_t *dfa; member in struct:__anon7265
734 Idx nbackref; /* The number of backreference in this dfa. */
741 /* If this dfa has "multibyte node", which is a backreference or
|
| /src/external/gpl3/gcc.old/dist/libgcc/ |
| libgcc2.c | 1459 const DFtype dfa = a;
1464 const UWtype hi = dfa / Wtype_MAXp1_F;
1469 const UWtype lo = dfa - (DFtype) hi * Wtype_MAXp1_F;
1429 const DFtype dfa = a; local
|
| libgcc2.c | 1459 const DFtype dfa = a;
1464 const UWtype hi = dfa / Wtype_MAXp1_F;
1469 const UWtype lo = dfa - (DFtype) hi * Wtype_MAXp1_F;
1429 const DFtype dfa = a; local
|
