| /dports/www/wwwoffle/wwwoffle-2.9j/src/ |
| H A D | refresh.c | 39 *recurse_limit=""; /*+ the the URL prefix that must match. +*/ variable
262 recurse_limit=""; in ParseRecurseOptions()
285 recurse_limit=TrimArgs(URLDecodeFormArgs(args[i]+6)); in ParseRecurseOptions()
305 recurse_depth,recurse_limit,recurse_force); in ParseRecurseOptions()
402 if(!*recurse_limit || !strncmp(recurse_limit,metarefreshUrl->name,strlen(recurse_limit))) in RecurseFetch()
472 if(!*recurse_limit || !strncmp(recurse_limit,frameUrl->name,strlen(recurse_limit))) in RecurseFetch()
500 if(!*recurse_limit || !strncmp(recurse_limit,iframeUrl->name,strlen(recurse_limit))) in RecurseFetch()
562 if(!*recurse_limit || !strncmp(recurse_limit,objectUrl->name,strlen(recurse_limit))) in RecurseFetch()
586 if(!*recurse_limit || !strncmp(recurse_limit,linkUrl->name,strlen(recurse_limit))) in RecurseFetch()
590 refresh=CreateRefreshPath(linkUrl,recurse_limit,recurse_depth, in RecurseFetch()
[all …]
|
| /dports/devel/git-svn/git-2.34.1/ |
| H A D | match-trees.c | 135 int recurse_limit) in match_trees() argument
155 if (recurse_limit) { in match_trees()
158 newbase, recurse_limit - 1); in match_trees()
|
| /dports/devel/git-gui/git-2.34.1/ |
| H A D | match-trees.c | 135 int recurse_limit) in match_trees() argument
155 if (recurse_limit) { in match_trees()
158 newbase, recurse_limit - 1); in match_trees()
|
| /dports/devel/git-p4/git-2.34.1/ |
| H A D | match-trees.c | 135 int recurse_limit) in match_trees() argument
155 if (recurse_limit) { in match_trees()
158 newbase, recurse_limit - 1); in match_trees()
|
| /dports/devel/git/git-2.34.1/ |
| H A D | match-trees.c | 135 int recurse_limit) in match_trees() argument
155 if (recurse_limit) { in match_trees()
158 newbase, recurse_limit - 1); in match_trees()
|
| /dports/devel/git-cvs/git-2.34.1/ |
| H A D | match-trees.c | 135 int recurse_limit) in match_trees() argument
155 if (recurse_limit) { in match_trees()
158 newbase, recurse_limit - 1); in match_trees()
|
| /dports/devel/cgit/cgit-1.2.3/git/ |
| H A D | match-trees.c | 135 int recurse_limit) in match_trees() argument
155 if (recurse_limit) { in match_trees()
158 newbase, recurse_limit - 1); in match_trees()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/unordered/test/helpers/ |
| H A D | list.hpp | 268 node** merge_sort(node** l, size_type recurse_limit, Less less) in merge_sort() argument
271 for(size_type count = 0; count < recurse_limit && *ptr; ++count) in merge_sort()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/unordered/test/helpers/ |
| H A D | list.hpp | 268 node** merge_sort(node** l, size_type recurse_limit, Less less) in merge_sort() argument
271 for(size_type count = 0; count < recurse_limit && *ptr; ++count) in merge_sort()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/unordered/test/helpers/ |
| H A D | list.hpp | 268 node** merge_sort(node** l, size_type recurse_limit, Less less) in merge_sort() argument
271 for(size_type count = 0; count < recurse_limit && *ptr; ++count) in merge_sort()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/unordered/test/helpers/ |
| H A D | list.hpp | 268 node** merge_sort(node** l, size_type recurse_limit, Less less) in merge_sort() argument
271 for(size_type count = 0; count < recurse_limit && *ptr; ++count) in merge_sort()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/unordered/test/helpers/ |
| H A D | list.hpp | 268 node** merge_sort(node** l, size_type recurse_limit, Less less) in merge_sort() argument
271 for(size_type count = 0; count < recurse_limit && *ptr; ++count) in merge_sort()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/unordered/test/helpers/ |
| H A D | list.hpp | 274 node** merge_sort(node** l, size_type recurse_limit, Less less) in merge_sort() argument
277 for (size_type count = 0; count < recurse_limit && *ptr; ++count) { in merge_sort()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/unordered/test/helpers/ |
| H A D | list.hpp | 274 node** merge_sort(node** l, size_type recurse_limit, Less less) in merge_sort() argument
277 for (size_type count = 0; count < recurse_limit && *ptr; ++count) { in merge_sort()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/unordered/test/helpers/ |
| H A D | list.hpp | 274 node** merge_sort(node** l, size_type recurse_limit, Less less) in merge_sort() argument
277 for (size_type count = 0; count < recurse_limit && *ptr; ++count) { in merge_sort()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/unordered/test/helpers/ |
| H A D | list.hpp | 274 node** merge_sort(node** l, size_type recurse_limit, Less less) in merge_sort() argument
277 for (size_type count = 0; count < recurse_limit && *ptr; ++count) { in merge_sort()
|
| /dports/net/messagelib/messagelib-21.12.3/messagecomposer/src/composer/ |
| H A D | keyresolver.h | 254 int recurse_limit = 100,
|
| /dports/www/p5-CGI-Ex/CGI-Ex-2.50/lib/CGI/Ex/ |
| H A D | App.pm | 66 if ($self->{'_recurse'}++ >= $self->recurse_limit) {
67 my $err = "recurse_limit (".$self->recurse_limit.") reached";
263 sub recurse_limit { $_[0]->{'recurse_limit'} || 15 } subroutine
|
| /dports/devel/hyperscan/boost_1_75_0/tools/quickbook/src/ |
| H A D | values.cpp | 567 value_node** merge_sort(value_node** l, int recurse_limit) in merge_sort() argument
570 for (int count = 0; count < recurse_limit && in merge_sort()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/tools/quickbook/src/ |
| H A D | values.cpp | 578 value_node** merge_sort(value_node** l, int recurse_limit) in merge_sort() argument
582 count < recurse_limit && *p != &value_list_end_impl::instance; in merge_sort()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/tools/quickbook/src/ |
| H A D | values.cpp | 567 value_node** merge_sort(value_node** l, int recurse_limit) in merge_sort() argument
570 for (int count = 0; count < recurse_limit && in merge_sort()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/tools/quickbook/src/ |
| H A D | values.cpp | 578 value_node** merge_sort(value_node** l, int recurse_limit) in merge_sort() argument
582 count < recurse_limit && *p != &value_list_end_impl::instance; in merge_sort()
|
| /dports/databases/percona57-server/boost_1_59_0/tools/quickbook/src/ |
| H A D | values.cpp | 578 value_node** merge_sort(value_node** l, int recurse_limit) in merge_sort() argument
582 count < recurse_limit && *p != &value_list_end_impl::instance; in merge_sort()
|
| /dports/databases/xtrabackup/boost_1_59_0/tools/quickbook/src/ |
| H A D | values.cpp | 578 value_node** merge_sort(value_node** l, int recurse_limit) in merge_sort() argument
582 count < recurse_limit && *p != &value_list_end_impl::instance; in merge_sort()
|
| /dports/databases/percona57-client/boost_1_59_0/tools/quickbook/src/ |
| H A D | values.cpp | 578 value_node** merge_sort(value_node** l, int recurse_limit) in merge_sort() argument
582 count < recurse_limit && *p != &value_list_end_impl::instance; in merge_sort()
|