Home
last modified time | relevance | path

Searched refs:each (Results 1 – 25 of 1529) sorted by relevance

12345678910>>...62

/openbsd-src/gnu/usr.bin/perl/t/op/
H A Deach_array.t16 (@r) = each @array;
20 ($k, $v) = each @array;
23 ($k, $v) = each @array;
26 (@r) = each @array;
30 (@r) = each @array;
34 ($k) = each @array;
39 (@r) = each @lex_array;
43 ($k, $v) = each @lex_array;
46 ($k) = each @lex_array;
48 (@r) = each @lex_array;
[all …]
H A Dtiehash.t70 is(each %h, 'beer', "first iterator");
71 is(each %h, 'perl', "second iterator");
72 is(each %h, undef, "third iterator is undef");
87 my $k = each %h;
100 my $k1 = each %h;
107 my $k = each %h;
134 my $k1 = each %h;
142 my $k = each %h;
207 push @got, scalar each %Camelus;
208 push @got, scalar each %Camelus;
[all …]
H A Deach.t53 while (my ($key,$value) = each(%h)) {
91 $total += $key while $key = each %hash;
94 for (1..3) { my @foo = each %hash }
97 $total += $key while $key = each %hash;
100 for (1..3) { my @foo = each %hash }
102 $total += $key while $key = each %hash;
105 for (1..3) { my @foo = each %hash }
108 $total += $key while $key = each %hash;
145 while (my($k,$v) = each %$h) {
195 for my $k (qw(each keys values)) {
[all …]
H A Ddefins.t179 while (my $name = each %hash)
189 while (($seen ? $dummy : $name) = each %hash)
196 while ($where{$seen} = each %hash)
204 while (each %hash)
212 while (each @array)
220 $_ eq '0' and $seen++ while each %hash;
225 $_ eq '0' and $seen++ while each @array;
H A Dhashassign.t38 @temp = each %comma;
40 @temp = each %comma;
56 @temp = each %temp;
58 @temp = each %temp;
78 @temp = each %arrow;
80 @temp = each %arrow;
96 @temp = each %temp;
98 @temp = each %temp;
207 @temp = each %utf8c;
209 @temp = each %utf8c;
[all …]
H A Dtie.t530 each %{ $_[0] };
546 my ($k,$v) = each %h;
600 sub FIRSTKEY { my $a = scalar keys %{$_[0]}; each %{$_[0]} }
601 sub NEXTKEY { each %{$_[0]} }
1527 sub FIRSTKEY { $f++; my $a = scalar keys %{$_[0]}; each %{$_[0]} }
1528 sub NEXTKEY { $n++; each %{$_[0]} }
1543 sub FIRSTKEY { $f++; my $a = scalar keys %{$_[0]}; each %{$_[0]} }
1544 sub NEXTKEY { $n++; each %{$_[0]} }
1560 sub FIRSTKEY { $f++; my $a = scalar keys %{$_[0]}; each %{$_[0]} }
1561 sub NEXTKEY { $n++; each %{$_[0]} }
[all …]
/openbsd-src/gnu/usr.bin/perl/ext/Hash-Util-FieldHash/t/
H A D11_hashassign.t17 # Some of these tests are (effectively) duplicated in each.t
34 @temp = each %comma;
35 is_deeply (\@comma, \@temp, 'first each from comma hash');
36 @temp = each %comma;
37 is_deeply ([], \@temp, 'last each from comma hash');
52 @temp = each %temp;
53 is_deeply (\@temp, \@temp, 'first each from copy of comma hash');
54 @temp = each %temp;
55 is_deeply ([], \@temp, 'last each from copy of comma hash');
75 @temp = each %arrow;
[all …]
H A D05_perlhook.t21 # could be established. $counter will be incremented each time the
92 $x = each %h;
93 is( $counter, 1, "scalar each doesn't trigger");
96 $x = each %h;
97 is( $counter, 1, "scalar each doesn't trigger");
100 (@x) = each %h;
101 is( $counter, 1, "list each doesn't trigger");
174 $x = each %i;
175 () = each %i;
200 $x = each %j;
[all …]
/openbsd-src/regress/include/bitstring/good/
H A D2791 first 1 bit should move right 1 position each line
120 first 0 bit should move right 1 position each line
149 first 0 bit should move left 1 position each line
178 first 1 bit should move left 1 position each line
207 0 bit should move right 1 position each line
236 1 bit should move right 1 position each line
H A D67171 first 1 bit should move right 1 position each line
240 first 0 bit should move right 1 position each line
309 first 0 bit should move left 1 position each line
378 first 1 bit should move left 1 position each line
447 0 bit should move right 1 position each line
516 1 bit should move right 1 position each line
H A D32101 first 1 bit should move right 1 position each line
135 first 0 bit should move right 1 position each line
169 first 0 bit should move left 1 position each line
203 first 1 bit should move left 1 position each line
237 0 bit should move right 1 position each line
271 1 bit should move right 1 position each line
H A D49135 first 1 bit should move right 1 position each line
186 first 0 bit should move right 1 position each line
237 first 0 bit should move left 1 position each line
288 first 1 bit should move left 1 position each line
339 0 bit should move right 1 position each line
390 1 bit should move right 1 position each line
H A D64165 first 1 bit should move right 1 position each line
231 first 0 bit should move right 1 position each line
297 first 0 bit should move left 1 position each line
363 first 1 bit should move left 1 position each line
429 0 bit should move right 1 position each line
495 1 bit should move right 1 position each line
H A D853 first 1 bit should move right 1 position each line
63 first 0 bit should move right 1 position each line
73 first 0 bit should move left 1 position each line
83 first 1 bit should move left 1 position each line
93 0 bit should move right 1 position each line
103 1 bit should move right 1 position each line
/openbsd-src/gnu/llvm/llvm/lib/Target/RISCV/
H A DRISCVInstrFormatsC.td48 // The immediate value encoding differs for each instruction, so each subclass
50 // The bits Inst{6-2} must be set for each instruction.
64 // The immediate value encoding differs for each instruction, so each subclass
66 // The bits Inst{12-7} must be set for each instruction.
90 // The immediate value encoding differs for each instruction, so each subclass
92 // The bits Inst{12-10} and Inst{6-5} must be set for each instruction.
105 // The immediate value encoding differs for each instruction, so each subclass
107 // The bits Inst{12-10} and Inst{6-5} must be set for each instruction.
/openbsd-src/gnu/usr.bin/binutils-2.17/bfd/
H A Ddwarf2.c1519 struct varinfo* each; in lookup_symbol_in_variable_table() local
1521 for (each = unit->variable_table; each; each = each->prev_var) in lookup_symbol_in_variable_table()
1522 if (each->stack == 0 in lookup_symbol_in_variable_table()
1523 && each->file != NULL in lookup_symbol_in_variable_table()
1524 && each->name != NULL in lookup_symbol_in_variable_table()
1525 && each->addr == addr in lookup_symbol_in_variable_table()
1526 && (!each->sec || each->sec == sec) in lookup_symbol_in_variable_table()
1527 && strcmp (name, each->name) == 0) in lookup_symbol_in_variable_table()
1530 if (each) in lookup_symbol_in_variable_table()
1532 each->sec = sec; in lookup_symbol_in_variable_table()
[all …]
/openbsd-src/usr.bin/tmux/
H A Dwindow-tree.c150 u_int each;
541 u_int loop, total, visible, each, width, offset; in window_tree_draw_session()
590 each = (sx - 6) / visible; in window_tree_draw_session()
591 remaining = (sx - 6) - (visible * each); in window_tree_draw_session()
593 each = (sx - 3) / visible; in window_tree_draw_session()
594 remaining = (sx - 3) - (visible * each); in window_tree_draw_session()
596 each = sx / visible; in window_tree_draw_session()
597 remaining = sx - (visible * each); in window_tree_draw_session()
599 if (each == 0) in window_tree_draw_session()
621 data->each in window_tree_draw_session()
149 u_int each; global() member
540 u_int loop, total, visible, each, width, offset; window_tree_draw_session() local
673 u_int loop, total, visible, each, width, offset; window_tree_draw_window() local
[all...]
/openbsd-src/regress/lib/libcrypto/x509/bettertls/
H A DREADME11 expected results for each certificate, generated as per the
13 issues are with each certificate. The "expects.json" output was then
17 "validate.c" runs X509_verify against each certificate, trying with
19 the ip of 127.0.0.1 for the "IP" test, so each cert is tested
/openbsd-src/games/cribbage/
H A Dcribbage.n8 was played with hands of five cards; the modern game gives each player
18 The pack of 52. The cards in each suit rank: K (high), Q, J, 10,
19 9, 8, 7, 6, 5, 4, 3, 2, A. The counting values are: K, Q, J, 10, each 10
20 (wherefore these are called tenth cards); ace, 1; each other card, its
27 and narrow, in which are four rows of 30 holes each. At one end, or in the
29 placed between the two players, and each keeps his own score on the two
35 each subsequent score, the rear peg is jumped ahead of the other, the
46 Nondealer cuts, and must leave at least four cards in each packet.
56 After seeing his hand, each player lays away two cards face down.
64 the top of the stock (the rest of the pack). Again, each packet must
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/
H A DREADME.compat23 the site.exp file used by DejaGNU. The default is to build each test
24 with the compiler under test using the first of each pair of compiler
25 options from COMPAT_OPTIONS. When ALT_CXX_UNDER_TEST is "same", each
53 LD_LIBRARY_PATH for the alternate compiler in the support for each
58 knowledge about how to build a shared library for each target
61 knowledge about how to build a static library for each target
/openbsd-src/gnu/llvm/llvm/docs/
H A DBlockFrequencyTerminology.rst18 Blocks with multiple successors have probabilities associated with each
25 Rather than storing fractions on each edge, we store an integer weight.
66 The implementation of the block frequency calculation analyses each loop,
67 bottom-up, ignoring backedges; i.e., as a DAG. After each loop is processed,
74 For each DAG, the entry node is assigned a mass of ``UINT64_MAX`` and mass is
99 After analysing the complete series of DAGs, each block has a mass (local to
100 its containing loop, if any), and each loop pseudo-node has a loop scale and
/openbsd-src/gnu/usr.bin/gcc/gcc/doc/
H A Dgcov.texi66 how often each line of code executes
72 how much computing time each section of code uses
76 can look at each module to see which modules should be optimized.
93 places only one statement on each line. If you use complicated macros
100 indicates how many times each line of a source file @file{@var{sourcefile}.c}
152 each branch in your program was taken.
182 Output summaries for each function in addition to the file level summary.
202 One @file{.gcov} file is produced for each source file containing code,
211 Additional block information may succeed each line, when requested by
230 Running the program will cause profile output to be generated. For each
[all …]
/openbsd-src/gnu/llvm/llvm/cmake/modules/
H A DGenerateVersionFromVCS.cmake4 # NAMES - A list of names for each of the source directories.
5 # <NAME>_SOURCE_DIR - A path to source directory for each name in NAMES.
10 # for each of the <NAME>_SOURCE_DIR given.
/openbsd-src/gnu/llvm/llvm/docs/CommandGuide/
H A Dllvm-readelf.rst39 address of each function, along with the relative offset of each basic block.
86 When used with :option:`--relocations`, display each relocation in an expanded
154 When used with :option:`--sections`, display section data for each section
167 When used with :option:`--sections`, display relocations for each section
172 When used with :option:`--sections`, display symbols for each section shown.
/openbsd-src/gnu/llvm/lldb/source/Plugins/TraceExporter/docs/
H A Dhtr.rst9 **Block Metadata:** Metadata associated with each *block*. For processor traces, some metadata exam…
18 …sequence of instructions in *layer 0* (the instruction layer). Metadata is stored for each block in
31 …each pass specializes in extracting certain information about the trace. Some examples of potentia…
43 - For each block, compute the number of distinct predecessor and successor blocks.

12345678910>>...62