| /dports/audio/julius/julius-4.1.2/libsent/src/dfa/ |
| H A D | cpair.c | 206 cp_add(&(dfa->cp[i]), &(dfa->cplen[i]), &(dfa->cpalloclen[i]), j, loc); in set_dfa_cp()
211 cp_remove(&(dfa->cp[i]), &(dfa->cplen[i]), loc); in set_dfa_cp()
232 cp_add(&(dfa->cp_begin), &(dfa->cp_begin_len), &(dfa->cp_begin_alloclen), i, loc); in set_dfa_cp_begin()
258 cp_add(&(dfa->cp_end), &(dfa->cp_end_len), &(dfa->cp_end_alloclen), i, loc); in set_dfa_cp_end()
263 cp_remove(&(dfa->cp_end), &(dfa->cp_end_len), loc); in set_dfa_cp_end()
356 dfa->cp = (int **)myrealloc(dfa->cp, sizeof(int *) * dfa->term_num); in dfa_cp_append()
357 dfa->cplen = (int *)myrealloc(dfa->cplen, sizeof(int) * dfa->term_num); in dfa_cp_append()
358 dfa->cpalloclen = (int *)myrealloc(dfa->cpalloclen, sizeof(int) * dfa->term_num); in dfa_cp_append()
372 dfa->cp_begin = (int *)myrealloc(dfa->cp_begin, sizeof(int) * dfa->cp_begin_alloclen); in dfa_cp_append()
380 dfa->cp_end = (int *)myrealloc(dfa->cp_end, sizeof(int) * dfa->cp_end_alloclen); in dfa_cp_append()
[all …]
|
| /dports/math/jacop/jacop-4.8.0/src/main/scala/org/jacop/examples/scala/ |
| H A D | RegularExample.scala | 53 dfa.init(dfa(0))
56 dfa(0) -> (0, dfa(1))
57 dfa(0) -> (1, dfa(2))
58 dfa(0) -> (2, dfa(3))
59 dfa(1) -> (1, dfa(4))
60 dfa(1) -> (2, dfa(5))
61 dfa(2) -> (0, dfa(4))
62 dfa(2) -> (2, dfa(6))
63 dfa(3) -> (0, dfa(5))
64 dfa(3) -> (1, dfa(6))
[all …]
|
| /dports/audio/harp/harp-0.6.0/ |
| H A D | lex_dfa.c | 26 State *o=dfa; in add_path()
41 dfa=dfa->out[(int)str[i]].state; in add_path()
44 dfa->out=NULL; in add_path()
50 State *dfa; in generate_operator_dfa() local
54 dfa->final=0; in generate_operator_dfa()
57 dfa->out[i].state=dfa; in generate_operator_dfa()
70 return dfa; in generate_operator_dfa()
76 State *dfa; in generate_quote_dfa() local
80 dfa->final=0; in generate_quote_dfa()
83 dfa->out[i].state=dfa; in generate_quote_dfa()
[all …]
|
| /dports/security/sequoia/sequoia-383133f6be990237044900a4df676488bf8dd71e/cargo-crates/lalrpop-0.17.2/src/lexer/dfa/ |
| H A D | test.rs | 1 use lexer::dfa::interpret::interpret;
2 use lexer::dfa::{self, DFAConstructionError, NFAIndex, Precedence, DFA};
12 dfa::build_dfa(®exs, &precedences) in dfa()
20 let dfa = dfa(&[ in tokenizer() localVariable
47 assert!(dfa(&[(r#"."#, P0)]).is_ok()); in issue_32()
57 let dfa = dfa(&[(r#"abc|abd"#, P0)]).unwrap(); in alternatives() localVariable
60 assert_eq!(interpret(&dfa, "123"), None); in alternatives()
65 let dfa = dfa(&[(r#"abc|abcd"#, P0)]).unwrap(); in alternatives_extension() localVariable
68 assert_eq!(interpret(&dfa, "123"), None); in alternatives_extension()
73 let dfa = dfa(&[(r#"abcd|abc"#, P0)]).unwrap(); in alternatives_contraction() localVariable
[all …]
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/lalrpop-0.16.3/src/lexer/dfa/ |
| H A D | test.rs | 1 use lexer::dfa::interpret::interpret;
2 use lexer::dfa::{self, DFAConstructionError, NFAIndex, Precedence, DFA};
12 dfa::build_dfa(®exs, &precedences) in dfa()
20 let dfa = dfa(&[ in tokenizer() localVariable
47 assert!(dfa(&[(r#"."#, P0)]).is_ok()); in issue_32()
57 let dfa = dfa(&[(r#"abc|abd"#, P0)]).unwrap(); in alternatives() localVariable
60 assert_eq!(interpret(&dfa, "123"), None); in alternatives()
65 let dfa = dfa(&[(r#"abc|abcd"#, P0)]).unwrap(); in alternatives_extension() localVariable
68 assert_eq!(interpret(&dfa, "123"), None); in alternatives_extension()
73 let dfa = dfa(&[(r#"abcd|abc"#, P0)]).unwrap(); in alternatives_contraction() localVariable
[all …]
|
| /dports/net/krill/krill-0.9.4/cargo-crates/lalrpop-0.19.6/src/lexer/dfa/ |
| H A D | test.rs | 1 use crate::lexer::dfa::interpret::interpret;
12 dfa::build_dfa(®exs, &precedences) in dfa()
20 let dfa = dfa(&[ in tokenizer() localVariable
34 assert_eq!(interpret(&dfa, ">"), Some((NFAIndex(5), ">"))); in tokenizer()
47 assert!(dfa(&[(r#"."#, P0)]).is_ok()); in issue_32()
57 let dfa = dfa(&[(r#"abc|abd"#, P0)]).unwrap(); in alternatives() localVariable
60 assert_eq!(interpret(&dfa, "123"), None); in alternatives()
65 let dfa = dfa(&[(r#"abc|abcd"#, P0)]).unwrap(); in alternatives_extension() localVariable
68 assert_eq!(interpret(&dfa, "123"), None); in alternatives_extension()
73 let dfa = dfa(&[(r#"abcd|abc"#, P0)]).unwrap(); in alternatives_contraction() localVariable
[all …]
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/security/apparmor/ |
| H A D | match.c | 221 if (base_idx(BASE_TABLE(dfa)[i]) < dfa->max_oob) { in verify_dfa()
273 if (dfa) { in dfa_free()
278 dfa->tables[i] = NULL; in dfa_free()
280 kfree(dfa); in dfa_free()
291 dfa_free(dfa); in aa_dfa_free_kref()
313 if (!dfa) in aa_dfa_unpack()
316 kref_init(&dfa->count); in aa_dfa_unpack()
347 dfa->max_oob = 1; in aa_dfa_unpack()
401 return dfa; in aa_dfa_unpack()
405 dfa_free(dfa); in aa_dfa_unpack()
[all …]
|
| /dports/multimedia/libv4l/linux-5.13-rc2/security/apparmor/ |
| H A D | match.c | 221 if (base_idx(BASE_TABLE(dfa)[i]) < dfa->max_oob) { in verify_dfa()
273 if (dfa) { in dfa_free()
278 dfa->tables[i] = NULL; in dfa_free()
280 kfree(dfa); in dfa_free()
291 dfa_free(dfa); in aa_dfa_free_kref()
313 if (!dfa) in aa_dfa_unpack()
316 kref_init(&dfa->count); in aa_dfa_unpack()
347 dfa->max_oob = 1; in aa_dfa_unpack()
401 return dfa; in aa_dfa_unpack()
405 dfa_free(dfa); in aa_dfa_unpack()
[all …]
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/security/apparmor/ |
| H A D | match.c | 221 if (base_idx(BASE_TABLE(dfa)[i]) < dfa->max_oob) { in verify_dfa()
273 if (dfa) { in dfa_free()
278 dfa->tables[i] = NULL; in dfa_free()
280 kfree(dfa); in dfa_free()
291 dfa_free(dfa); in aa_dfa_free_kref()
313 if (!dfa) in aa_dfa_unpack()
316 kref_init(&dfa->count); in aa_dfa_unpack()
347 dfa->max_oob = 1; in aa_dfa_unpack()
401 return dfa; in aa_dfa_unpack()
405 dfa_free(dfa); in aa_dfa_unpack()
[all …]
|
| /dports/lang/gawk/gawk-5.1.1/support/ |
| H A D | dfa.c | 880 fetch_wc (struct dfa *dfa) in fetch_wc() argument
893 bracket_fetch_wc (struct dfa *dfa) in bracket_fetch_wc() argument
1188 lex (struct dfa *dfa) in lex() argument
1537 if (dfa->talloc == dfa->tindex) in addtok_mb()
1539 dfa->tokens = xpalloc (dfa->tokens, &dfa->talloc, 1, -1, in addtok_mb()
1547 dfa->tokens[dfa->tindex++] = t; in addtok_mb()
1806 atom (struct dfa *dfa) in atom() argument
1900 closure (struct dfa *dfa) in closure() argument
1929 dfa->tindex -= nsubtoks (dfa, dfa->tindex); in closure()
1941 branch (struct dfa* dfa) in branch() argument
[all …]
|
| /dports/security/pkcs11-tools/pkcs11-tools-2.5.0/.gnulib/lib/ |
| H A D | dfa.c | 880 fetch_wc (struct dfa *dfa) in fetch_wc() argument
893 bracket_fetch_wc (struct dfa *dfa) in bracket_fetch_wc() argument
1188 lex (struct dfa *dfa) in lex() argument
1537 if (dfa->talloc == dfa->tindex) in addtok_mb()
1539 dfa->tokens = xpalloc (dfa->tokens, &dfa->talloc, 1, -1, in addtok_mb()
1547 dfa->tokens[dfa->tindex++] = t; in addtok_mb()
1806 atom (struct dfa *dfa) in atom() argument
1900 closure (struct dfa *dfa) in closure() argument
1929 dfa->tindex -= nsubtoks (dfa, dfa->tindex); in closure()
1941 branch (struct dfa* dfa) in branch() argument
[all …]
|
| /dports/textproc/gnugrep/grep-3.7/lib/ |
| H A D | dfa.c | 880 fetch_wc (struct dfa *dfa) in fetch_wc() argument
893 bracket_fetch_wc (struct dfa *dfa) in bracket_fetch_wc() argument
1188 lex (struct dfa *dfa) in lex() argument
1537 if (dfa->talloc == dfa->tindex) in addtok_mb()
1539 dfa->tokens = xpalloc (dfa->tokens, &dfa->talloc, 1, -1, in addtok_mb()
1547 dfa->tokens[dfa->tindex++] = t; in addtok_mb()
1806 atom (struct dfa *dfa) in atom() argument
1900 closure (struct dfa *dfa) in closure() argument
1929 dfa->tindex -= nsubtoks (dfa, dfa->tindex); in closure()
1941 branch (struct dfa* dfa) in branch() argument
[all …]
|
| /dports/textproc/gsed/sed-4.8/lib/ |
| H A D | dfa.c | 907 fetch_wc (struct dfa *dfa) in fetch_wc() argument
920 bracket_fetch_wc (struct dfa *dfa) in bracket_fetch_wc() argument
1215 lex (struct dfa *dfa) in lex() argument
1564 if (dfa->talloc == dfa->tindex) in addtok_mb()
1566 dfa->tokens = xpalloc (dfa->tokens, &dfa->talloc, 1, -1, in addtok_mb()
1574 dfa->tokens[dfa->tindex++] = t; in addtok_mb()
1820 atom (struct dfa *dfa) in atom() argument
1914 closure (struct dfa *dfa) in closure() argument
1943 dfa->tindex -= nsubtoks (dfa, dfa->tindex); in closure()
1955 branch (struct dfa* dfa) in branch() argument
[all …]
|
| /dports/multimedia/audacious/audacious-4.1/src/libguess/ |
| H A D | dfa.h | 41 #define DFA_NEXT(dfa, ch) \ argument
44 if (dfa.state >= 0) { \
45 arc__ = dfa.states[dfa.state][ch]; \
49 dfa.state = dfa.arcs[arc__].next; \
50 dfa.score *= dfa.arcs[arc__].score; \
55 #define DFA_ALIVE(dfa) (dfa.state >= 0) argument
61 arc__ = dfa->states[dfa->state][ch]; \
65 dfa->state = dfa->arcs[arc__].next; \
66 dfa->score *= dfa->arcs[arc__].score; \
71 #define DFA_ALIVE_P(dfa) (dfa->state >= 0) argument
[all …]
|
| /dports/print/texlive-base/texlive-20150521-source/texk/chktex/regex/ |
| H A D | regcomp.c | 272 if (dfa->init_state != dfa->init_state_word) in weak_alias()
274 if (dfa->init_state != dfa->init_state_nl) in weak_alias()
276 if (dfa->init_state != dfa->init_state_begbuf) in weak_alias()
997 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
998 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1084 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1088 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1112 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1115 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1419 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|
| /dports/print/tex-xetex/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 272 if (dfa->init_state != dfa->init_state_word) in weak_alias()
274 if (dfa->init_state != dfa->init_state_nl) in weak_alias()
276 if (dfa->init_state != dfa->init_state_begbuf) in weak_alias()
997 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
998 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1084 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1088 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1112 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1115 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1419 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|
| /dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 272 if (dfa->init_state != dfa->init_state_word) in weak_alias()
274 if (dfa->init_state != dfa->init_state_nl) in weak_alias()
276 if (dfa->init_state != dfa->init_state_begbuf) in weak_alias()
997 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
998 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1084 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1088 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1112 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1115 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1419 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|
| /dports/print/tex-luatex/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 272 if (dfa->init_state != dfa->init_state_word) in weak_alias()
274 if (dfa->init_state != dfa->init_state_nl) in weak_alias()
276 if (dfa->init_state != dfa->init_state_begbuf) in weak_alias()
997 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
998 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1084 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1088 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1112 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1115 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1419 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|
| /dports/devel/kBuild/kBuild-0.1.9998/src/sed/lib/ |
| H A D | regcomp.c | 276 if (dfa->init_state != dfa->init_state_word)
278 if (dfa->init_state != dfa->init_state_nl)
280 if (dfa->init_state != dfa->init_state_begbuf)
1012 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
1013 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1099 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1103 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1127 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1130 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1434 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|
| /dports/comms/direwolf/direwolf-1.6/external/regex/ |
| H A D | regcomp.c | 276 if (dfa->init_state != dfa->init_state_word)
278 if (dfa->init_state != dfa->init_state_nl)
280 if (dfa->init_state != dfa->init_state_begbuf)
1008 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
1009 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1095 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1099 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1123 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1126 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1430 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|
| /dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 272 if (dfa->init_state != dfa->init_state_word) in weak_alias()
274 if (dfa->init_state != dfa->init_state_nl) in weak_alias()
276 if (dfa->init_state != dfa->init_state_begbuf) in weak_alias()
997 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
998 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1084 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1088 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1112 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1115 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1419 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|
| /dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 272 if (dfa->init_state != dfa->init_state_word) in weak_alias()
274 if (dfa->init_state != dfa->init_state_nl) in weak_alias()
276 if (dfa->init_state != dfa->init_state_begbuf) in weak_alias()
997 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
998 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1084 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1088 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1112 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1115 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1419 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|
| /dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 272 if (dfa->init_state != dfa->init_state_word) in weak_alias()
274 if (dfa->init_state != dfa->init_state_nl) in weak_alias()
276 if (dfa->init_state != dfa->init_state_begbuf) in weak_alias()
997 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
998 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1084 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1088 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1112 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1115 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1419 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|
| /dports/print/tex-aleph/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 272 if (dfa->init_state != dfa->init_state_word) in weak_alias()
274 if (dfa->init_state != dfa->init_state_nl) in weak_alias()
276 if (dfa->init_state != dfa->init_state_begbuf) in weak_alias()
997 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
998 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1084 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1088 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1112 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1115 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1419 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|
| /dports/sysutils/sleuthkit/sleuthkit-4.7.0/framework/modules/c_FileTypeSigModule/mingw-libgnurx-2.5.1/ |
| H A D | regcomp.c | 276 if (dfa->init_state != dfa->init_state_word)
278 if (dfa->init_state != dfa->init_state_nl)
280 if (dfa->init_state != dfa->init_state_begbuf)
1008 dfa->init_state_word = dfa->init_state_nl in create_initial_state()
1009 = dfa->init_state_begbuf = dfa->init_state; in create_initial_state()
1095 dfa->nexts = re_malloc (int, dfa->nodes_alloc); in analyze()
1099 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1123 ret = postorder (dfa->str_tree, calc_first, dfa); in analyze()
1126 preorder (dfa->str_tree, calc_next, dfa); in analyze()
1430 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
[all …]
|