| /dports/games/xspacewarp/xspacewarp-1.2/ |
| H A D | c_jovian_ai.cc | 438 int ndests = 0; // The number of available destinations. in pick_sector() local
452 dests[ndests].urow = i+1; in pick_sector()
453 dests[ndests].ucol = j+1; in pick_sector()
454 ndests++; in pick_sector()
472 dests[ndests].urow = i+1; // i,j is an available sector in pick_sector()
473 dests[ndests].ucol = j+1; in pick_sector()
474 ndests++; in pick_sector()
480 if (ndests == 0) in pick_sector()
483 return (dests[rand() % ndests]); in pick_sector()
|
| /dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/ |
| H A D | tree-eh.c | 1144 int nlabels, ndests, j, last_case_index; in lower_try_finally_switch() local
1160 ndests = fallthru_index + tf->may_fallthru; in lower_try_finally_switch()
1165 case_label_vec = make_tree_vec (ndests); in lower_try_finally_switch()
1322 f_estimate = (f_estimate + 1) * ndests; in decide_copy_try_finally()
1325 sw_estimate = 10 + 2 * ndests; in decide_copy_try_finally()
1348 int ndests; in lower_try_finally() local
1391 ndests += this_tf.may_fallthru; in lower_try_finally()
1392 ndests += this_tf.may_return; in lower_try_finally()
1393 ndests += this_tf.may_throw; in lower_try_finally()
1396 if (ndests == 0) in lower_try_finally()
[all …]
|
| /dports/security/gnupg1/gnupg-1.4.23/util/ |
| H A D | regexec.c | 2527 if (BE (ndests <= 0, 0))
2546 for (i = 0; i < ndests; ++i)
2614 for (k = 0; k < ndests; ++k)
2641 for (k = 0; k < ndests; ++k)
2657 for (i = 0; i < ndests; ++i)
2685 ndests = 0;
2742 for (j = 0; j < ndests; ++j)
2778 ++ndests;
2791 if (j == ndests)
2797 ++ndests;
[all …]
|
| /dports/mail/libsieve/libsieve-2.3.1/src/sv_regex/ |
| H A D | regexec.c | 3123 if (BE (ndests <= 0, 0))
3128 if (ndests == 0)
3154 for (i = 0; i < ndests; ++i)
3168 for (i = 0; i < ndests; ++i)
3278 for (i = 0; i < ndests; ++i)
3306 ndests = 0;
3392 ++ndests;
3405 if (j == ndests)
3411 ++ndests;
3415 return ndests;
[all …]
|
| /dports/devel/interactive_rebase_tool/git-interactive-rebase-tool-1.2.1/cargo-crates/libgit2-sys-0.7.11/libgit2/deps/regex/ |
| H A D | regexec.c | 3357 if (BE (ndests <= 0, 0)) in build_trtable()
3362 if (ndests == 0) in build_trtable()
3378 < (size_t)ndests), in build_trtable()
3411 for (i = 0; i < ndests; ++i) in build_trtable()
3535 for (i = 0; i < ndests; ++i) in build_trtable()
3561 ndests = 0; in group_nodes_into_DFAstates()
3700 ++ndests; in group_nodes_into_DFAstates()
3713 if (j == ndests) in group_nodes_into_DFAstates()
3719 ++ndests; in group_nodes_into_DFAstates()
3723 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/git-gui/git-2.34.1/compat/regex/ |
| H A D | regexec.c | 3356 if (BE (ndests <= 0, 0)) in build_trtable()
3361 if (ndests == 0) in build_trtable()
3377 < ndests), in build_trtable()
3410 for (i = 0; i < ndests; ++i) in build_trtable()
3534 for (i = 0; i < ndests; ++i) in build_trtable()
3560 ndests = 0; in group_nodes_into_DFAstates()
3699 ++ndests; in group_nodes_into_DFAstates()
3712 if (j == ndests) in group_nodes_into_DFAstates()
3718 ++ndests; in group_nodes_into_DFAstates()
3722 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/git-p4/git-2.34.1/compat/regex/ |
| H A D | regexec.c | 3356 if (BE (ndests <= 0, 0)) in build_trtable()
3361 if (ndests == 0) in build_trtable()
3377 < ndests), in build_trtable()
3410 for (i = 0; i < ndests; ++i) in build_trtable()
3534 for (i = 0; i < ndests; ++i) in build_trtable()
3560 ndests = 0; in group_nodes_into_DFAstates()
3699 ++ndests; in group_nodes_into_DFAstates()
3712 if (j == ndests) in group_nodes_into_DFAstates()
3718 ++ndests; in group_nodes_into_DFAstates()
3722 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/git/git-2.34.1/compat/regex/ |
| H A D | regexec.c | 3356 if (BE (ndests <= 0, 0)) in build_trtable()
3361 if (ndests == 0) in build_trtable()
3377 < ndests), in build_trtable()
3410 for (i = 0; i < ndests; ++i) in build_trtable()
3534 for (i = 0; i < ndests; ++i) in build_trtable()
3560 ndests = 0; in group_nodes_into_DFAstates()
3699 ++ndests; in group_nodes_into_DFAstates()
3712 if (j == ndests) in group_nodes_into_DFAstates()
3718 ++ndests; in group_nodes_into_DFAstates()
3722 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/R-cran-git2r/git2r/src/libgit2/deps/regex/ |
| H A D | regexec.c | 3357 if (BE (ndests <= 0, 0)) in build_trtable()
3362 if (ndests == 0) in build_trtable()
3378 < (size_t)ndests), in build_trtable()
3411 for (i = 0; i < ndests; ++i) in build_trtable()
3535 for (i = 0; i < ndests; ++i) in build_trtable()
3561 ndests = 0; in group_nodes_into_DFAstates()
3700 ++ndests; in group_nodes_into_DFAstates()
3713 if (j == ndests) in group_nodes_into_DFAstates()
3719 ++ndests; in group_nodes_into_DFAstates()
3723 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/git-cvs/git-2.34.1/compat/regex/ |
| H A D | regexec.c | 3356 if (BE (ndests <= 0, 0)) in build_trtable()
3361 if (ndests == 0) in build_trtable()
3377 < ndests), in build_trtable()
3410 for (i = 0; i < ndests; ++i) in build_trtable()
3534 for (i = 0; i < ndests; ++i) in build_trtable()
3560 ndests = 0; in group_nodes_into_DFAstates()
3699 ++ndests; in group_nodes_into_DFAstates()
3712 if (j == ndests) in group_nodes_into_DFAstates()
3718 ++ndests; in group_nodes_into_DFAstates()
3722 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/git-svn/git-2.34.1/compat/regex/ |
| H A D | regexec.c | 3356 if (BE (ndests <= 0, 0)) in build_trtable()
3361 if (ndests == 0) in build_trtable()
3377 < ndests), in build_trtable()
3410 for (i = 0; i < ndests; ++i) in build_trtable()
3534 for (i = 0; i < ndests; ++i) in build_trtable()
3560 ndests = 0; in group_nodes_into_DFAstates()
3699 ++ndests; in group_nodes_into_DFAstates()
3712 if (j == ndests) in group_nodes_into_DFAstates()
3718 ++ndests; in group_nodes_into_DFAstates()
3722 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/cgit/cgit-1.2.3/git/compat/regex/ |
| H A D | regexec.c | 3356 if (BE (ndests <= 0, 0)) in build_trtable()
3361 if (ndests == 0) in build_trtable()
3377 < ndests), in build_trtable()
3410 for (i = 0; i < ndests; ++i) in build_trtable()
3534 for (i = 0; i < ndests; ++i) in build_trtable()
3560 ndests = 0; in group_nodes_into_DFAstates()
3699 ++ndests; in group_nodes_into_DFAstates()
3712 if (j == ndests) in group_nodes_into_DFAstates()
3718 ++ndests; in group_nodes_into_DFAstates()
3722 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/net/openslp/openslp-2.0.0/libslp/ |
| H A D | libslp_network.c | 1490 int ndests = 0; // Number of destinations in NetworkMultiUcastRqstRply() local
1586 for (ndests = 0; ; ndests++) in NetworkMultiUcastRqstRply()
1588 if (destaddr[ndests].sin_addr.s_addr == 0) in NetworkMultiUcastRqstRply()
1594 pconnections = (struct _UcastConnection*)xmalloc(ndests * sizeof pconnections[0]); in NetworkMultiUcastRqstRply()
1605 for (i = 0; i < ndests; i++) in NetworkMultiUcastRqstRply()
1745 for (i = 0; i < ndests; i++) in NetworkMultiUcastRqstRply()
1788 for (i = 0; i < ndests; i++) in NetworkMultiUcastRqstRply()
1989 for (i = 0; (i < ndests) && selected; i++) in NetworkMultiUcastRqstRply()
2175 for (i = 0; i < ndests; i++) in NetworkMultiUcastRqstRply()
2215 for (i = 0; i < ndests; i++) in NetworkMultiUcastRqstRply()
|
| /dports/devel/gettext-tools/gettext-0.21/gettext-tools/libgrep/ |
| H A D | regexec.c | 3304 if (ndests == 0) in build_trtable()
3339 for (i = 0; i < ndests; ++i) in build_trtable()
3352 for (i = 0; i < ndests; ++i) in build_trtable()
3477 for (i = 0; i < ndests; ++i) in build_trtable()
3502 ndests = 0; in group_nodes_into_DFAstates()
3644 ++ndests; in group_nodes_into_DFAstates()
3657 if (j == ndests) in group_nodes_into_DFAstates()
3663 ++ndests; in group_nodes_into_DFAstates()
3667 assume (ndests <= SBC_MAX); in group_nodes_into_DFAstates()
3668 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/archivers/gtar/tar-1.34/gnu/ |
| H A D | regexec.c | 3304 if (ndests == 0) in build_trtable()
3339 for (i = 0; i < ndests; ++i) in build_trtable()
3352 for (i = 0; i < ndests; ++i) in build_trtable()
3477 for (i = 0; i < ndests; ++i) in build_trtable()
3502 ndests = 0; in group_nodes_into_DFAstates()
3644 ++ndests; in group_nodes_into_DFAstates()
3657 if (j == ndests) in group_nodes_into_DFAstates()
3663 ++ndests; in group_nodes_into_DFAstates()
3667 assume (ndests <= SBC_MAX); in group_nodes_into_DFAstates()
3668 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/math/pspp/pspp-1.4.1/gl/ |
| H A D | regexec.c | 3304 if (ndests == 0)
3339 for (i = 0; i < ndests; ++i)
3352 for (i = 0; i < ndests; ++i)
3477 for (i = 0; i < ndests; ++i)
3502 ndests = 0;
3644 ++ndests;
3657 if (j == ndests)
3663 ++ndests;
3667 assume (ndests <= SBC_MAX);
3668 return ndests;
[all …]
|
| /dports/sysutils/coreutils/coreutils-8.32/lib/ |
| H A D | regexec.c | 3304 if (ndests == 0) in build_trtable()
3339 for (i = 0; i < ndests; ++i) in build_trtable()
3352 for (i = 0; i < ndests; ++i) in build_trtable()
3477 for (i = 0; i < ndests; ++i) in build_trtable()
3502 ndests = 0; in group_nodes_into_DFAstates()
3644 ++ndests; in group_nodes_into_DFAstates()
3657 if (j == ndests) in group_nodes_into_DFAstates()
3663 ++ndests; in group_nodes_into_DFAstates()
3667 assume (ndests <= SBC_MAX); in group_nodes_into_DFAstates()
3668 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/gettext-po-mode/gettext-0.21/gettext-tools/libgrep/ |
| H A D | regexec.c | 3304 if (ndests == 0) in build_trtable()
3339 for (i = 0; i < ndests; ++i) in build_trtable()
3352 for (i = 0; i < ndests; ++i) in build_trtable()
3477 for (i = 0; i < ndests; ++i) in build_trtable()
3502 ndests = 0; in group_nodes_into_DFAstates()
3644 ++ndests; in group_nodes_into_DFAstates()
3657 if (j == ndests) in group_nodes_into_DFAstates()
3663 ++ndests; in group_nodes_into_DFAstates()
3667 assume (ndests <= SBC_MAX); in group_nodes_into_DFAstates()
3668 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/gettext-runtime/gettext-0.21/gettext-tools/libgrep/ |
| H A D | regexec.c | 3304 if (ndests == 0) in build_trtable()
3339 for (i = 0; i < ndests; ++i) in build_trtable()
3352 for (i = 0; i < ndests; ++i) in build_trtable()
3477 for (i = 0; i < ndests; ++i) in build_trtable()
3502 ndests = 0; in group_nodes_into_DFAstates()
3644 ++ndests; in group_nodes_into_DFAstates()
3657 if (j == ndests) in group_nodes_into_DFAstates()
3663 ++ndests; in group_nodes_into_DFAstates()
3667 assume (ndests <= SBC_MAX); in group_nodes_into_DFAstates()
3668 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/libtextstyle/gettext-0.21/gettext-tools/libgrep/ |
| H A D | regexec.c | 3304 if (ndests == 0) in build_trtable()
3339 for (i = 0; i < ndests; ++i) in build_trtable()
3352 for (i = 0; i < ndests; ++i) in build_trtable()
3477 for (i = 0; i < ndests; ++i) in build_trtable()
3502 ndests = 0; in group_nodes_into_DFAstates()
3644 ++ndests; in group_nodes_into_DFAstates()
3657 if (j == ndests) in group_nodes_into_DFAstates()
3663 ++ndests; in group_nodes_into_DFAstates()
3667 assume (ndests <= SBC_MAX); in group_nodes_into_DFAstates()
3668 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/editors/emacs/emacs-27.2/lib/ |
| H A D | regexec.c | 3304 if (ndests == 0) in build_trtable()
3339 for (i = 0; i < ndests; ++i) in build_trtable()
3352 for (i = 0; i < ndests; ++i) in build_trtable()
3477 for (i = 0; i < ndests; ++i) in build_trtable()
3502 ndests = 0; in group_nodes_into_DFAstates()
3644 ++ndests; in group_nodes_into_DFAstates()
3657 if (j == ndests) in group_nodes_into_DFAstates()
3663 ++ndests; in group_nodes_into_DFAstates()
3667 assume (ndests <= SBC_MAX); in group_nodes_into_DFAstates()
3668 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/textproc/gsed/sed-4.8/lib/ |
| H A D | regexec.c | 3304 if (ndests == 0) in build_trtable()
3339 for (i = 0; i < ndests; ++i) in build_trtable()
3352 for (i = 0; i < ndests; ++i) in build_trtable()
3477 for (i = 0; i < ndests; ++i) in build_trtable()
3502 ndests = 0; in group_nodes_into_DFAstates()
3644 ++ndests; in group_nodes_into_DFAstates()
3657 if (j == ndests) in group_nodes_into_DFAstates()
3663 ++ndests; in group_nodes_into_DFAstates()
3667 assume (ndests <= SBC_MAX); in group_nodes_into_DFAstates()
3668 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/ftp/lftp/lftp-4.9.2/lib/ |
| H A D | regexec.c | 3304 if (ndests == 0) in build_trtable()
3339 for (i = 0; i < ndests; ++i) in build_trtable()
3352 for (i = 0; i < ndests; ++i) in build_trtable()
3477 for (i = 0; i < ndests; ++i) in build_trtable()
3502 ndests = 0; in group_nodes_into_DFAstates()
3644 ++ndests; in group_nodes_into_DFAstates()
3657 if (j == ndests) in group_nodes_into_DFAstates()
3663 ++ndests; in group_nodes_into_DFAstates()
3667 assume (ndests <= SBC_MAX); in group_nodes_into_DFAstates()
3668 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regexec.c | 3310 if (BE (ndests <= 0, 0)) in build_trtable()
3315 if (ndests == 0) in build_trtable()
3342 for (i = 0; i < ndests; ++i) in build_trtable()
3355 for (i = 0; i < ndests; ++i) in build_trtable()
3479 for (i = 0; i < ndests; ++i) in build_trtable()
3505 ndests = 0; in group_nodes_into_DFAstates()
3644 ++ndests; in group_nodes_into_DFAstates()
3657 if (j == ndests) in group_nodes_into_DFAstates()
3663 ++ndests; in group_nodes_into_DFAstates()
3667 return ndests; in group_nodes_into_DFAstates()
[all …]
|
| /dports/devel/arduino-ctags/ctags-5.8-arduino11/gnu_regex/ |
| H A D | regexec.c | 3341 if (BE (ndests <= 0, 0)) in build_trtable()
3346 if (ndests == 0) in build_trtable()
3373 for (i = 0; i < ndests; ++i) in build_trtable()
3386 for (i = 0; i < ndests; ++i) in build_trtable()
3510 for (i = 0; i < ndests; ++i) in build_trtable()
3536 ndests = 0; in group_nodes_into_DFAstates()
3675 ++ndests; in group_nodes_into_DFAstates()
3688 if (j == ndests) in group_nodes_into_DFAstates()
3694 ++ndests; in group_nodes_into_DFAstates()
3698 return ndests; in group_nodes_into_DFAstates()
[all …]
|