| /minix/tests/lib/libc/regex/data/ |
| H A D | complex.in | 6 a[ab]{20} - aaaaabaaaabaaaabaaaab aaaaabaaaabaaaabaaaab
8 a[ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab] - aaaaabaaaabaaaa…
10 a[ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab][ab](wee|week)(knights…
20 [ab][cd][ef][gh][ij][kl][mn] - xacegikmoq acegikm
21 [ab][cd][ef][gh][ij][kl][mn][op] - xacegikmoq acegikmo
22 [ab][cd][ef][gh][ij][kl][mn][op][qr] - xacegikmoqy acegikmoq
23 [ab][cd][ef][gh][ij][kl][mn][op][q] - xacegikmoqy acegikmoq
|
| H A D | repet_bounded.in | 7 a{1}b - ab ab
8 a\{1\}b b ab ab
9 a{1,}b - ab ab
10 a\{1,\}b b ab ab
31 ab{0,0}c - abcac ac
32 ab\{0,0\}c b abcac ac
33 ab{0,1}c - abcac abc
34 ab\{0,1\}c b abcac abc
35 ab{0,3}c - abbcac abbc
37 ab{1,1}c - acabc abc
[all …]
|
| /minix/external/bsd/libc++/dist/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), in main()
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)), in main()
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()), in main()
|
| H A D | move_alloc.pass.cpp | 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
44 for (int* p = ab; p < an; ++p) in main()
47 for (int* p = ab; p < an; ++p) in main()
56 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
59 for (int* p = ab; p < an; ++p) in main()
62 for (int* p = ab; p < an; ++p) in main()
72 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
[all …]
|
| H A D | move_assign.pass.cpp | 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
42 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
45 for (int* p = ab; p < an; ++p) in main()
48 for (int* p = ab; p < an; ++p) in main()
58 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
61 for (int* p = ab; p < an; ++p) in main()
64 for (int* p = ab; p < an; ++p) in main()
75 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
[all …]
|
| H A D | move.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
44 for (int* p = ab; p < an; ++p) in main()
47 for (int* p = ab; p < an; ++p) in main()
57 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
60 for (int* p = ab; p < an; ++p) in main()
[all …]
|
| H A D | iter_iter_alloc.pass.cpp | 39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
40 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); in main()
42 … test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); in main()
43 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocato… in main()
44 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocato… in main()
46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); in main()
47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); in main()
48 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator… in main()
49 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator… in main()
|
| H A D | copy.pass.cpp | 30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
31 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
32 test(std::deque<int>(ab, an)); in main()
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
52 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
|
| H A D | op_equal.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
33 test(std::deque<int>(ab, an)); in main()
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
53 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
|
| H A D | iter_iter.pass.cpp | 52 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
53 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
54 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); in main()
55 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); in main()
56 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); in main()
57 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); in main()
58 test<stack_allocator<int, 4096> >(ab, an); in main()
60 test<min_allocator<int> >(ab, an); in main()
|
| /minix/external/bsd/libc++/dist/libcxx/test/containers/sequences/deque/deque.cons/ |
| H A D | copy_alloc.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), in main()
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)), in main()
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()), in main()
|
| H A D | move_alloc.pass.cpp | 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
44 for (int* p = ab; p < an; ++p) in main()
47 for (int* p = ab; p < an; ++p) in main()
56 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
59 for (int* p = ab; p < an; ++p) in main()
62 for (int* p = ab; p < an; ++p) in main()
72 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
[all …]
|
| H A D | move_assign.pass.cpp | 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
42 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
45 for (int* p = ab; p < an; ++p) in main()
48 for (int* p = ab; p < an; ++p) in main()
58 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
61 for (int* p = ab; p < an; ++p) in main()
64 for (int* p = ab; p < an; ++p) in main()
75 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
[all …]
|
| H A D | move.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
44 for (int* p = ab; p < an; ++p) in main()
47 for (int* p = ab; p < an; ++p) in main()
57 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
60 for (int* p = ab; p < an; ++p) in main()
[all …]
|
| H A D | iter_iter_alloc.pass.cpp | 39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
40 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); in main()
42 … test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); in main()
43 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocato… in main()
44 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocato… in main()
46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); in main()
47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); in main()
48 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator… in main()
49 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator… in main()
|
| H A D | copy.pass.cpp | 30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
31 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
32 test(std::deque<int>(ab, an)); in main()
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
52 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
|
| H A D | op_equal.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
33 test(std::deque<int>(ab, an)); in main()
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
53 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
|
| H A D | iter_iter.pass.cpp | 52 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
53 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
54 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); in main()
55 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); in main()
56 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); in main()
57 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); in main()
58 test<stack_allocator<int, 4096> >(ab, an); in main()
60 test<min_allocator<int> >(ab, an); in main()
|
| /minix/external/bsd/elftoolchain/dist/libdwarf/ |
| H A D | libdwarf_abbrev.c | 39 Dwarf_Abbrev ab; in _dwarf_abbrev_add() local
51 ab->ab_tag = tag; in _dwarf_abbrev_add()
63 sizeof(ab->ab_entry), ab); in _dwarf_abbrev_add()
66 *abp = ab; in _dwarf_abbrev_add()
77 if (ab == NULL) { in _dwarf_attrdef_add()
96 ab->ab_atnum++; in _dwarf_attrdef_add()
165 Dwarf_Abbrev ab; in _dwarf_abbrev_find() local
176 *abp = ab; in _dwarf_abbrev_find()
194 *abp = ab; in _dwarf_abbrev_find()
222 free(ab); in _dwarf_abbrev_cleanup()
[all …]
|
| H A D | libdwarf_die.c | 63 assert(ab != NULL); in _dwarf_die_add()
72 die->die_ab = ab; in _dwarf_die_add()
109 Dwarf_Abbrev ab; in _dwarf_die_parse() local
282 Dwarf_Abbrev ab; in _dwarf_die_gen_recursive() local
308 for (ab = cu->cu_abbrev_hash; ab != NULL; ab = ab->ab_hh.next) { in _dwarf_die_gen_recursive()
309 if (die->die_tag != ab->ab_tag) in _dwarf_die_gen_recursive()
331 die->die_ab = ab; in _dwarf_die_gen_recursive()
342 0, &ab, error); in _dwarf_die_gen_recursive()
351 die->die_ab = ab; in _dwarf_die_gen_recursive()
402 Dwarf_Abbrev ab, tab; in _dwarf_die_gen() local
[all …]
|
| /minix/tests/lib/libc/regex/data/att/ |
| H A D | forcedassoc.dat | 3 E (a|ab)(c|bcd) abcd (0,4)(0,1)(1,4)
4 E (a|ab)(bcd|c) abcd (0,4)(0,1)(1,4)
5 E (ab|a)(c|bcd) abcd (0,4)(0,1)(1,4)
6 E (ab|a)(bcd|c) abcd (0,4)(0,1)(1,4)
7 E ((a|ab)(c|bcd))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
8 E ((a|ab)(bcd|c))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
9 E ((ab|a)(c|bcd))(d*) abcd (0,4)(0,4)(0,1)(1,4)(4,4)
27 E (a|ab) ab (0,2)(0,2)
28 E (ab|a) ab (0,2)(0,2)
29 E (a|ab)(b*) ab (0,2)(0,2)(2,2)
[all …]
|
| H A D | repetition.dat | 108 # "ab" then "a" then "bcd".
113 :HA#260:E (a|ab|c|bcd){0,}(d*) ababcd (0,6)(3,6)(6,6)
114 :HA#261:E (a|ab|c|bcd){1,}(d*) ababcd (0,6)(3,6)(6,6)
117 :HA#264:E (a|ab|c|bcd){4,}(d*) ababcd NOMATCH
122 :HA#269:E (a|ab|c|bcd){4,10}(d*) ababcd NOMATCH
123 :HA#270:E (a|ab|c|bcd)*(d*) ababcd (0,6)(3,6)(6,6)
124 :HA#271:E (a|ab|c|bcd)+(d*) ababcd (0,6)(3,6)(6,6)
133 :HA#284:E (ab|a|c|bcd){4,}(d*) ababcd NOMATCH
138 :HA#289:E (ab|a|c|bcd){4,10}(d*) ababcd NOMATCH
139 :HA#290:E (ab|a|c|bcd)*(d*) ababcd (0,6)(3,6)(6,6)
[all …]
|
| H A D | leftassoc.dat | 3 E (a|ab)(c|bcd)(d*) abcd (0,4)(0,1)(1,4)(4,4)
4 E (a|ab)(bcd|c)(d*) abcd (0,4)(0,1)(1,4)(4,4)
5 E (ab|a)(c|bcd)(d*) abcd (0,4)(0,1)(1,4)(4,4)
6 E (ab|a)(bcd|c)(d*) abcd (0,4)(0,1)(1,4)(4,4)
13 E (a|ab)(c|bcd)(d|.*) abcd (0,4)(0,1)(1,4)(4,4)
14 E (a|ab)(bcd|c)(d|.*) abcd (0,4)(0,1)(1,4)(4,4)
15 E (ab|a)(c|bcd)(d|.*) abcd (0,4)(0,1)(1,4)(4,4)
16 E (ab|a)(bcd|c)(d|.*) abcd (0,4)(0,1)(1,4)(4,4)
|
| H A D | rightassoc.dat | 3 E (a|ab)(c|bcd)(d*) abcd (0,4)(0,2)(2,3)(3,4)
4 E (a|ab)(bcd|c)(d*) abcd (0,4)(0,2)(2,3)(3,4)
5 E (ab|a)(c|bcd)(d*) abcd (0,4)(0,2)(2,3)(3,4)
6 E (ab|a)(bcd|c)(d*) abcd (0,4)(0,2)(2,3)(3,4)
13 E (a|ab)(c|bcd)(d|.*) abcd (0,4)(0,2)(2,3)(3,4)
14 E (a|ab)(bcd|c)(d|.*) abcd (0,4)(0,2)(2,3)(3,4)
15 E (ab|a)(c|bcd)(d|.*) abcd (0,4)(0,2)(2,3)(3,4)
16 E (ab|a)(bcd|c)(d|.*) abcd (0,4)(0,2)(2,3)(3,4)
|
| /minix/sys/external/bsd/compiler_rt/dist/lib/builtins/ppc/ |
| H A D | gcc_qmul.c | 21 double ab, tmp, tau; in __gcc_qmul() local
23 ab = A * B; in __gcc_qmul()
26 if (ab == 0.0) { in __gcc_qmul()
27 dst.s.hi = ab; in __gcc_qmul()
32 const doublebits abBits = { .d = ab }; in __gcc_qmul()
34 dst.s.hi = ab; in __gcc_qmul()
45 tmp = LOWORDER(ab, aHi, aLo, bHi, bLo); in __gcc_qmul()
47 tau = ab + tmp; in __gcc_qmul()
49 dst.s.lo = (ab - tau) + tmp; in __gcc_qmul()
|