Home
last modified time | relevance | path

Searched refs:rules (Results 1 – 25 of 728) sorted by relevance

12345678910>>...30

/openbsd/gnu/usr.bin/perl/cpan/Test-Harness/t/
H A Dscheduler.t42 rules => $perl_rules,
47 rules => $perl_rules,
52 rules => $perl_rules,
61 rules => $incomplete_rules,
66 rules => $incomplete_rules,
71 rules => $incomplete_rules,
83 $test->{rules},
95 my $rules = {
115 rules => $rules
162 rules => $rules
[all …]
H A Drulesfile.t50 is_deeply( $th->rules, $exp, "rules set from t/testrules.yml" );
71 is_deeply( $th->rules, $exp, "root testrules.yml overrides t/testrules.yml" );
90 is_deeply( $th->rules, $exp, "HARNESS_RULESFILE overrides testrules.yml" );
97 is_deeply( $th->rules, $exp, "rulesfile param overrides testrules.yml" );
/openbsd/regress/sys/net/pf_policy/
H A DMakefile59 .for rules in ${TESTS_PASS}
60 REGRESS_TARGETS += run-pass-${rules}
61 run-pass-${rules}:
63 ${SUDO} pfctl -a "regress" -f ${.CURDIR}/${rules}.conf
67 .for rules in ${TESTS_BLOCK}
68 REGRESS_TARGETS += run-block-${rules}
69 run-block-${rules}:
72 ${SUDO} pfctl -a "regress" -f ${.CURDIR}/${rules}.conf
76 .for rules in ${TESTS_ONCE}
77 REGRESS_TARGETS += run-once-${rules}
[all …]
/openbsd/share/zoneinfo/
H A Dziguard.awk186 rules = $rules_column
188 if (rules == "-") {
191 dstabbr_only = rules ~ /^[+0-9-]/
193 dstoff = get_minutes(rules)
196 if (rules == "Morocco" && NF == 3) {
198 } else if (rules == "NBorneo") {
200 } else if (((rules == "Cook" || rules == "LH") && NF == 3) \
201 || (rules == "Uruguay" \
204 } else if (rules == "Uruguay" && $0 ~ /[\t ]1974 Mar 10$/) {
/openbsd/sys/net/
H A Dpf_ruleset.c107 TAILQ_INIT(&ruleset->rules.queues[0]); in pf_init_ruleset()
108 TAILQ_INIT(&ruleset->rules.queues[1]); in pf_init_ruleset()
109 ruleset->rules.active.ptr = &ruleset->rules.queues[0]; in pf_init_ruleset()
110 ruleset->rules.inactive.ptr = &ruleset->rules.queues[1]; in pf_init_ruleset()
306 if (!TAILQ_EMPTY(ruleset->rules.active.ptr) || in pf_remove_if_empty_ruleset()
307 !TAILQ_EMPTY(ruleset->rules.inactive.ptr) || in pf_remove_if_empty_ruleset()
308 ruleset->rules.inactive.open) in pf_remove_if_empty_ruleset()
H A Dpf_ioctl.c562 rs->rules.inactive.rcount--; in pf_begin_rules()
565 rs->rules.inactive.open = 1; in pf_begin_rules()
581 rs->rules.inactive.rcount--; in pf_rollback_rules()
583 rs->rules.inactive.open = 0; in pf_rollback_rules()
874 old_rules = rs->rules.active.ptr; in pf_commit_rules()
877 rs->rules.active.ptr = rs->rules.inactive.ptr; in pf_commit_rules()
878 rs->rules.active.rcount = rs->rules.inactive.rcount; in pf_commit_rules()
882 rs->rules.active.version = rs->rules.inactive.version; in pf_commit_rules()
889 rs->rules.inactive.rcount = 0; in pf_commit_rules()
890 rs->rules.inactive.open = 0; in pf_commit_rules()
[all …]
/openbsd/gnu/usr.bin/perl/cpan/Test-Harness/lib/TAP/Parser/
H A DScheduler.pm136 my $rules = delete $args{rules} || { par => '**' };
145 $self->_set_rules( $rules, $tests );
162 my ( $self, $rules, $tests ) = @_;
168 my $schedule = $self->_rule_clause( $rules, \@tests );
/openbsd/usr.bin/doas/
H A Dparse.y50 struct rule **rules; variable
101 rules = reallocarray(rules, maxrules,
102 2 * sizeof(*rules));
103 if (!rules)
107 rules[nrules++] = r;
/openbsd/gnu/usr.bin/perl/cpan/Test-Harness/lib/App/
H A DProve.pm246 'rules=s@' => $self->{rules},
371 if ( @{ $self->rules } ) {
372 my @rules;
373 for ( @{ $self->rules } ) {
375 push @rules, $1;
378 push @rules, { seq => $1 };
381 $args{rules} = { par => [@rules] };
/openbsd/gnu/usr.bin/perl/dist/Devel-PPPort/
H A DMakefile.PL200 my @rules = split( m{^\s*$}m, $original );
202 foreach $rule ( @rules ) {
236 my @rules = split( m{^\s*$}m, $original );
238 foreach $rule ( @rules ) {
254 my @rules = split( m{^\s*$}m, $dist );
256 foreach $rule ( @rules ) {
/openbsd/gnu/llvm/llvm/cmake/platforms/
H A DClangClCMakeCompileRules.cmake3 # input file path to force it to be treated as a path. CMake's compilation rules
5 # CMake versions, overriding compilation rules works well enough. This file will
6 # be included by cmake after the default compilation rules have already been set
/openbsd/usr.bin/rsync/
H A Drules.c38 static struct rule *rules; variable
113 new = recallocarray(rules, rulesz, newsz, sizeof(*rules));
117 rules = new;
121 return rules + numrules - 1;
349 r = &rules[i];
422 r = &rules[i];
/openbsd/regress/usr.bin/make/
H A Dmk243 # .SUFFIXES should void suffixes rules
7 # Two suffixes implicit rules
H A Dmk268 # if there is no rules, we just silently accept the dependency
12 # if there is a set of rules, we transparently go through the dependencies
/openbsd/gnu/llvm/clang/docs/
H A DRefactoringEngine.rst32 operations (rules). These rules are grouped under a common umbrella - a single
33 ``clang-refactor`` command. In addition to rules, the refactoring action
57 grouped refactoring action rules that represent one refactoring operation.
58 Although the rules in one action may have a number of different implementations,
63 The distinction between actions and rules enables the creation of actions
64 that define a set of different rules that produce similar results. For example,
69 constant. To achieve that, we can create two different rules that will use one
81 Clang's refactoring engine supports several different refactoring rules:
136 rules for a particular action using the ``createRefactoringActionRule``
138 list of action rules using the following code:
[all …]
H A DClangTransformerTutorial.rst35 Transformer helps users succinctly specify rules of this sort and easily execute
77 ``makeRule`` is our go-to function for generating rewrite rules. It takes three
205 Reference: ranges, stencils, edits, rules
208 The above examples demonstrate just the basics of rewrite rules. Every element
210 and rules. In this section, we'll briefly review each in turn, with references
212 rewrite rules are actually rewriting.
218 explanation of what the rewrite rules are actually rewriting. We've referred to argument
329 We can also compose multiple *rules*, rather than just edits within a rule, argument
330 using ``applyFirst``: it composes a list of rules as an ordered choice, where
333 that case, ``applyFirst`` is simply joining the set of rules into one.
[all …]
/openbsd/usr.bin/yacc/
H A Dlr0.c380 rp2 = p->rules; in save_reductions()
400 short *rules; in set_derives() local
403 rules = NEW2(nvars + nrules, short); in set_derives()
407 derives[lhs] = rules + k; in set_derives()
410 rules[k] = i; in set_derives()
414 rules[k] = -1; in set_derives()
/openbsd/regress/sbin/pfctl/
H A Dpfail8.ok3 stdin:1: route-to, reply-to and dup-to are not supported on block rules
8 stdin:2: route-to, reply-to and dup-to are not supported on block rules
/openbsd/gnu/usr.bin/perl/cpan/Test-Harness/lib/TAP/
H A DHarness.pm83 rules => sub { shift; shift },
450 if ( ! defined $self->rules ) {
503 $self->rules( $yaml->[0] );
785 rules => $self->rules
/openbsd/gnu/usr.bin/perl/
H A Dregcomp.sym75 BOUNDU BOUND, no ; Match "" at any boundary of a given type using /u rules.
80 …UNDU NBOUND, no ; Match "" at any non-boundary of a given type using using /u rules.
158 EXACTFL EXACT, str ; Like EXACT, but match using /il rules; (string not likely to be…
159 EXACTFU EXACT, str ; Like EXACT, but match using /iu rules; (string folded)
237 REFF REF, num 2 V ; Match already matched string, using /di rules.
238 REFFL REF, num 2 V ; Match already matched string, using /li rules.
243 REFFA REF, num 2 V ; Match already matched string, using /aai rules.
248 REFFN REF, no-sv 2 V ; Match already matched string, using /di rules.
249 REFFLN REF, no-sv 2 V ; Match already matched string, using /li rules.
250 REFFUN REF, num 2 V ; Match already matched string, using /ui rules.
[all …]
/openbsd/usr.sbin/zic/
H A Dzic.c252 static struct rule *rules; variable
684 qsort(rules, nrules, sizeof *rules, rcomp); in associate()
686 if (strcmp(rules[i].r_name, in associate()
687 rules[i + 1].r_name) != 0) in associate()
692 eat(rules[i].r_filename, rules[i].r_linenum); in associate()
694 eat(rules[i + 1].r_filename, rules[i + 1].r_linenum); in associate()
697 if (strcmp(rules[i].r_name, in associate()
698 rules[j].r_name) != 0) in associate()
717 rp = &rules[base]; in associate()
896 rules = ereallocarray(rules, nrules + 1, sizeof *rules); in inrule()
[all …]
/openbsd/usr.sbin/bgpd/
H A Drde_peer.c66 peer_init(struct filter_head *rules) in peer_init() argument
76 peerself = peer_add(PEER_ID_SELF, &pc, rules); in peer_init()
136 peer_add(uint32_t id, struct peer_config *p_conf, struct filter_head *rules) in peer_add() argument
162 peer_apply_out_filter(peer, rules); in peer_add()
188 peer_apply_out_filter(struct rde_peer *peer, struct filter_head *rules) in peer_apply_out_filter() argument
198 TAILQ_FOREACH(fr, rules, entry) { in peer_apply_out_filter()
/openbsd/gnu/usr.bin/perl/t/
H A Dharness101 my ($rules, $state, $color);
362 $rules = { seq => \@seq };
423 rules => $rules,
/openbsd/gnu/llvm/llvm/utils/vim/
H A DREADME4 tablegen *.td files. It comes with filetype detection rules in the (ftdetect),
17 highlighting (because the files have names such as Makefile.rules or
/openbsd/gnu/llvm/llvm/docs/GlobalISel/
H A DLegalizer.rst70 and describes a set of rules by which we can either declare an instruction legal
104 opcode(s) that rules can be added to. If multiple opcodes are given, they are
105 all permanently bound to the same ruleset. The rules in a ruleset are executed
107 legalized as a result of the rules. If the ruleset is exhausted without
110 When it doesn't declare the instruction legal, each pass over the rules may
118 the rule as possible and to place any expensive rules as low as possible. This
120 legalization and legalization can require multiple passes over the rules.
151 There are various rule factories that append rules to a ruleset but they have a
234 There are some composite rules for common situations built out of the above facilities:
330 There are no minimum rules for pointers since G_INTTOPTR and G_PTRTOINT can
[all …]

12345678910>>...30