| /external/libcxx/fuzzing/ |
| D | fuzzing.cpp | 166 Vec working(data, data + size); in sort() local
167 std::sort(working.begin(), working.end()); in sort()
169 if (!std::is_sorted(working.begin(), working.end())) return 1; in sort()
170 if (!fuzzing::is_permutation(data, data + size, working.cbegin())) return 99; in sort()
181 StableVec working = input; in stable_sort() local
182 std::stable_sort(working.begin(), working.end(), key_less()); in stable_sort()
184 if (!std::is_sorted(working.begin(), working.end(), key_less())) return 1; in stable_sort()
185 auto iter = working.begin(); in stable_sort()
186 while (iter != working.end()) in stable_sort()
188 auto range = std::equal_range(iter, working.end(), *iter, key_less()); in stable_sort()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/regex/.github/workflows/ |
| D | ci.yml | 35 working-directory: ../boost-root
38 working-directory: ../boost-root
41 working-directory: ../boost-root
44 working-directory: ../boost-root
47 working-directory: ../boost-root
50 working-directory: ../boost-root
53 working-directory: ../boost-root/libs/config/test
56 working-directory: ../boost-root/libs/config/test
59 working-directory: ../boost-root/libs/regex/test
86 working-directory: ../boost-root
[all …]
|
| /external/sdv/vsomeip/third_party/boost/type_traits/.github/workflows/ |
| D | ci.yml | 55 working-directory: ../boost-root
58 working-directory: ../boost-root
61 working-directory: ../boost-root
64 working-directory: ../boost-root
67 working-directory: ../boost-root
70 working-directory: ../boost-root
73 working-directory: ../boost-root/libs/config/test
76 working-directory: ../boost-root/libs/config/test
79 working-directory: ../boost-root/libs/type_traits/test
118 working-directory: ../boost-root
[all …]
|
| /external/sdv/vsomeip/third_party/boost/config/.github/workflows/ |
| D | ci.yml | 35 working-directory: ../boost-root
38 working-directory: ../boost-root
41 working-directory: ../boost-root
44 working-directory: ../boost-root
47 working-directory: ../boost-root
50 working-directory: ../boost-root/libs/config/test
53 working-directory: ../boost-root/libs/config/test
79 working-directory: ../boost-root
82 working-directory: ../boost-root
85 working-directory: ../boost-root
[all …]
|
| /external/cronet/stable/third_party/libc++/src/test/libcxx/fuzzing/ |
| D | unique_copy.pass.cpp | 20 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
21 std::sort(working.begin(), working.end()); in LLVMFuzzerTestOneInput()
23 (void)std::unique_copy(working.begin(), working.end(), in LLVMFuzzerTestOneInput()
30 return working.size() == 0 ? 0 : 1; in LLVMFuzzerTestOneInput()
45 // Every element in 'results' must be in 'working' in LLVMFuzzerTestOneInput()
47 if (std::find(working.begin(), working.end(), v) == working.end()) in LLVMFuzzerTestOneInput()
50 // Every element in 'working' must be in 'results' in LLVMFuzzerTestOneInput()
51 for (auto v : working) in LLVMFuzzerTestOneInput()
|
| D | unique.pass.cpp | 19 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
20 std::sort(working.begin(), working.end()); in LLVMFuzzerTestOneInput()
21 std::vector<std::uint8_t> results = working; in LLVMFuzzerTestOneInput()
28 return working.size() == 0 ? 0 : 1; in LLVMFuzzerTestOneInput()
43 // Every element in 'results' must be in 'working' in LLVMFuzzerTestOneInput()
45 if (std::find(working.begin(), working.end(), *it) == working.end()) in LLVMFuzzerTestOneInput()
48 // Every element in 'working' must be in 'results' in LLVMFuzzerTestOneInput()
49 for (auto v : working) in LLVMFuzzerTestOneInput()
|
| D | partial_sort.pass.cpp | 23 std::vector<std::uint8_t> working(data + 1, data + size); in LLVMFuzzerTestOneInput() local
24 const auto sort_iter = working.begin() + sort_point; in LLVMFuzzerTestOneInput()
25 std::partial_sort(working.begin(), sort_iter, working.end()); in LLVMFuzzerTestOneInput()
27 if (sort_iter != working.end()) { in LLVMFuzzerTestOneInput()
28 const std::uint8_t nth = *std::min_element(sort_iter, working.end()); in LLVMFuzzerTestOneInput()
29 if (!std::all_of(working.begin(), sort_iter, [=](std::uint8_t v) { return v <= nth; })) in LLVMFuzzerTestOneInput()
31 if (!std::all_of(sort_iter, working.end(), [=](std::uint8_t v) { return v >= nth; })) in LLVMFuzzerTestOneInput()
34 if (!std::is_sorted(working.begin(), sort_iter)) in LLVMFuzzerTestOneInput()
36 if (!fast_is_permutation(data + 1, data + size, working.cbegin())) in LLVMFuzzerTestOneInput()
|
| D | stable_sort.pass.cpp | 23 std::vector<ByteWithPayload> working = input; in LLVMFuzzerTestOneInput() local
24 std::stable_sort(working.begin(), working.end(), ByteWithPayload::key_less()); in LLVMFuzzerTestOneInput()
26 if (!std::is_sorted(working.begin(), working.end(), ByteWithPayload::key_less())) in LLVMFuzzerTestOneInput()
29 auto iter = working.begin(); in LLVMFuzzerTestOneInput()
30 while (iter != working.end()) { in LLVMFuzzerTestOneInput()
31 auto range = std::equal_range(iter, working.end(), *iter, ByteWithPayload::key_less()); in LLVMFuzzerTestOneInput()
36 if (!fast_is_permutation(input.cbegin(), input.cend(), working.cbegin())) in LLVMFuzzerTestOneInput()
|
| D | nth_element.pass.cpp | 22 std::vector<std::uint8_t> working(data + 1, data + size); in LLVMFuzzerTestOneInput() local
23 const auto partition_iter = working.begin() + partition_point; in LLVMFuzzerTestOneInput()
24 std::nth_element(working.begin(), partition_iter, working.end()); in LLVMFuzzerTestOneInput()
27 if (partition_iter == working.end()) { in LLVMFuzzerTestOneInput()
28 if (!std::equal(data + 1, data + size, working.begin())) in LLVMFuzzerTestOneInput()
33 if (!std::all_of(working.begin(), partition_iter, [=](std::uint8_t v) { return v <= nth; })) in LLVMFuzzerTestOneInput()
35 if (!std::all_of(partition_iter, working.end(), [=](std::uint8_t v) { return v >= nth; })) in LLVMFuzzerTestOneInput()
37 if (!fast_is_permutation(data + 1, data + size, working.cbegin())) in LLVMFuzzerTestOneInput()
|
| D | push_heap.pass.cpp | 23 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
24 auto iter = working.begin() + (size / 2); in LLVMFuzzerTestOneInput()
25 std::make_heap(working.begin(), iter); in LLVMFuzzerTestOneInput()
26 if (!std::is_heap(working.begin(), iter)) in LLVMFuzzerTestOneInput()
31 for (; iter != working.end(); ++iter) { in LLVMFuzzerTestOneInput()
32 std::push_heap(working.begin(), iter); in LLVMFuzzerTestOneInput()
33 if (!std::is_heap(working.begin(), iter)) in LLVMFuzzerTestOneInput()
37 if (!fast_is_permutation(data, data + size, working.cbegin())) in LLVMFuzzerTestOneInput()
|
| D | stable_partition.pass.cpp | 24 std::vector<ByteWithPayload> working = input; in LLVMFuzzerTestOneInput() local
25 auto iter = std::stable_partition(working.begin(), working.end(), is_even); in LLVMFuzzerTestOneInput()
27 if (!std::all_of(working.begin(), iter, is_even)) in LLVMFuzzerTestOneInput()
29 if (!std::none_of(iter, working.end(), is_even)) in LLVMFuzzerTestOneInput()
31 if (!std::is_sorted(working.begin(), iter, ByteWithPayload::payload_less())) in LLVMFuzzerTestOneInput()
33 if (!std::is_sorted(iter, working.end(), ByteWithPayload::payload_less())) in LLVMFuzzerTestOneInput()
35 if (!fast_is_permutation(input.cbegin(), input.cend(), working.cbegin())) in LLVMFuzzerTestOneInput()
|
| D | pop_heap.pass.cpp | 21 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
22 std::make_heap(working.begin(), working.end()); in LLVMFuzzerTestOneInput()
25 auto iter = --working.end(); in LLVMFuzzerTestOneInput()
26 while (iter != working.begin()) { in LLVMFuzzerTestOneInput()
27 std::pop_heap(working.begin(), iter); in LLVMFuzzerTestOneInput()
28 if (!std::is_heap(working.begin(), --iter)) in LLVMFuzzerTestOneInput()
|
| /external/cronet/tot/third_party/libc++/src/test/libcxx/fuzzing/ |
| D | unique_copy.pass.cpp | 20 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
21 std::sort(working.begin(), working.end()); in LLVMFuzzerTestOneInput()
23 (void)std::unique_copy(working.begin(), working.end(), in LLVMFuzzerTestOneInput()
30 return working.size() == 0 ? 0 : 1; in LLVMFuzzerTestOneInput()
45 // Every element in 'results' must be in 'working' in LLVMFuzzerTestOneInput()
47 if (std::find(working.begin(), working.end(), v) == working.end()) in LLVMFuzzerTestOneInput()
50 // Every element in 'working' must be in 'results' in LLVMFuzzerTestOneInput()
51 for (auto v : working) in LLVMFuzzerTestOneInput()
|
| D | unique.pass.cpp | 19 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
20 std::sort(working.begin(), working.end()); in LLVMFuzzerTestOneInput()
21 std::vector<std::uint8_t> results = working; in LLVMFuzzerTestOneInput()
28 return working.size() == 0 ? 0 : 1; in LLVMFuzzerTestOneInput()
43 // Every element in 'results' must be in 'working' in LLVMFuzzerTestOneInput()
45 if (std::find(working.begin(), working.end(), *it) == working.end()) in LLVMFuzzerTestOneInput()
48 // Every element in 'working' must be in 'results' in LLVMFuzzerTestOneInput()
49 for (auto v : working) in LLVMFuzzerTestOneInput()
|
| D | partial_sort.pass.cpp | 23 std::vector<std::uint8_t> working(data + 1, data + size); in LLVMFuzzerTestOneInput() local
24 const auto sort_iter = working.begin() + sort_point; in LLVMFuzzerTestOneInput()
25 std::partial_sort(working.begin(), sort_iter, working.end()); in LLVMFuzzerTestOneInput()
27 if (sort_iter != working.end()) { in LLVMFuzzerTestOneInput()
28 const std::uint8_t nth = *std::min_element(sort_iter, working.end()); in LLVMFuzzerTestOneInput()
29 if (!std::all_of(working.begin(), sort_iter, [=](std::uint8_t v) { return v <= nth; })) in LLVMFuzzerTestOneInput()
31 if (!std::all_of(sort_iter, working.end(), [=](std::uint8_t v) { return v >= nth; })) in LLVMFuzzerTestOneInput()
34 if (!std::is_sorted(working.begin(), sort_iter)) in LLVMFuzzerTestOneInput()
36 if (!fast_is_permutation(data + 1, data + size, working.cbegin())) in LLVMFuzzerTestOneInput()
|
| D | stable_sort.pass.cpp | 23 std::vector<ByteWithPayload> working = input; in LLVMFuzzerTestOneInput() local
24 std::stable_sort(working.begin(), working.end(), ByteWithPayload::key_less()); in LLVMFuzzerTestOneInput()
26 if (!std::is_sorted(working.begin(), working.end(), ByteWithPayload::key_less())) in LLVMFuzzerTestOneInput()
29 auto iter = working.begin(); in LLVMFuzzerTestOneInput()
30 while (iter != working.end()) { in LLVMFuzzerTestOneInput()
31 auto range = std::equal_range(iter, working.end(), *iter, ByteWithPayload::key_less()); in LLVMFuzzerTestOneInput()
36 if (!fast_is_permutation(input.cbegin(), input.cend(), working.cbegin())) in LLVMFuzzerTestOneInput()
|
| D | nth_element.pass.cpp | 22 std::vector<std::uint8_t> working(data + 1, data + size); in LLVMFuzzerTestOneInput() local
23 const auto partition_iter = working.begin() + partition_point; in LLVMFuzzerTestOneInput()
24 std::nth_element(working.begin(), partition_iter, working.end()); in LLVMFuzzerTestOneInput()
27 if (partition_iter == working.end()) { in LLVMFuzzerTestOneInput()
28 if (!std::equal(data + 1, data + size, working.begin())) in LLVMFuzzerTestOneInput()
33 if (!std::all_of(working.begin(), partition_iter, [=](std::uint8_t v) { return v <= nth; })) in LLVMFuzzerTestOneInput()
35 if (!std::all_of(partition_iter, working.end(), [=](std::uint8_t v) { return v >= nth; })) in LLVMFuzzerTestOneInput()
37 if (!fast_is_permutation(data + 1, data + size, working.cbegin())) in LLVMFuzzerTestOneInput()
|
| D | push_heap.pass.cpp | 23 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
24 auto iter = working.begin() + (size / 2); in LLVMFuzzerTestOneInput()
25 std::make_heap(working.begin(), iter); in LLVMFuzzerTestOneInput()
26 if (!std::is_heap(working.begin(), iter)) in LLVMFuzzerTestOneInput()
31 for (; iter != working.end(); ++iter) { in LLVMFuzzerTestOneInput()
32 std::push_heap(working.begin(), iter); in LLVMFuzzerTestOneInput()
33 if (!std::is_heap(working.begin(), iter)) in LLVMFuzzerTestOneInput()
37 if (!fast_is_permutation(data, data + size, working.cbegin())) in LLVMFuzzerTestOneInput()
|
| D | stable_partition.pass.cpp | 24 std::vector<ByteWithPayload> working = input; in LLVMFuzzerTestOneInput() local
25 auto iter = std::stable_partition(working.begin(), working.end(), is_even); in LLVMFuzzerTestOneInput()
27 if (!std::all_of(working.begin(), iter, is_even)) in LLVMFuzzerTestOneInput()
29 if (!std::none_of(iter, working.end(), is_even)) in LLVMFuzzerTestOneInput()
31 if (!std::is_sorted(working.begin(), iter, ByteWithPayload::payload_less())) in LLVMFuzzerTestOneInput()
33 if (!std::is_sorted(iter, working.end(), ByteWithPayload::payload_less())) in LLVMFuzzerTestOneInput()
35 if (!fast_is_permutation(input.cbegin(), input.cend(), working.cbegin())) in LLVMFuzzerTestOneInput()
|
| D | pop_heap.pass.cpp | 21 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
22 std::make_heap(working.begin(), working.end()); in LLVMFuzzerTestOneInput()
25 auto iter = --working.end(); in LLVMFuzzerTestOneInput()
26 while (iter != working.begin()) { in LLVMFuzzerTestOneInput()
27 std::pop_heap(working.begin(), iter); in LLVMFuzzerTestOneInput()
28 if (!std::is_heap(working.begin(), --iter)) in LLVMFuzzerTestOneInput()
|
| /external/libcap/libcap/ |
| D | cap_proc.c | 440 cap_t working = cap_get_proc(); in _cap_set_mode() local
442 if (working == NULL) { in _cap_set_mode()
447 ret = cap_set_flag(working, CAP_EFFECTIVE, 1, raise_cap_setpcap, CAP_SET) | in _cap_set_mode()
448 _cap_set_proc(sc, working); in _cap_set_mode()
456 (void) cap_clear_flag(working, CAP_INHERITABLE); in _cap_set_mode()
477 (void) cap_clear_flag(working, CAP_PERMITTED); in _cap_set_mode()
492 (void) cap_clear_flag(working, CAP_EFFECTIVE); in _cap_set_mode()
493 ret = _cap_set_proc(sc, working) | ret; in _cap_set_mode()
494 (void) cap_free(working); in _cap_set_mode()
549 cap_t working = cap_get_proc(); in cap_get_mode() local
[all …]
|
| /external/autotest/site_utils/ |
| D | dut_status.py | 6 """Report whether DUTs are working or broken.
11 determine whether they're "working" or "broken". For purposes of
13 before it can be used for further testing", and "working" means "not
52 -w/--working - Only include hosts in a working state.
53 -n/--broken - Only include hosts in a non-working state. Hosts
54 with no job history are considered non-working.
64 surrounding the DUT's last change from working to broken,
69 * With the --working or --broken options, the list of host names
75 -o/--oneline - Use the one-line summary with the --working or
98 job's logs. The status indicates the working or broken status after
[all …]
|
| /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/ |
| D | default.build | 28 <mkdir dir="${build.working.dir}/tests" />
33 <copy todir="${build.working.dir}" overwrite="true">
40 <copy todir="${build.working.dir}" overwrite="true">
73 report-output-directory="${build.working.dir}"
77 <include name="${build.working.dir}/${test.assembly.name}" />
88 output="${build.working.dir}/${assembly.name}"
89 doc="${build.working.dir}/${name}.xml">
104 <!-- <include name="${build.working.dir}/antlr.runtime.dll" /> -->
114 output="${build.working.dir}/${test.assembly.name}">
124 <include name="${build.working.dir}/${assembly.name}" />
[all …]
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/src/ |
| D | Interruptible.kt | 22 * There is an optional [context] parameter to this function working just like [withContext]. in <lambda>()
57 private const val WORKING = 0 constant
66 WORKING: running normally
74 | WORKING | cancellation listener | WORKING |
92 private val _state = atomic(WORKING)
106 WORKING -> if (_state.compareAndSet(state, WORKING)) return in setup()
120 WORKING -> if (_state.compareAndSet(state, FINISHED)) { in clearInterrupt()
144 // Working -> try to transite state and interrupt the thread in invoke()
145 WORKING -> { in invoke()
|
| /external/ltp/testcases/kernel/syscalls/vfork/ |
| D | vfork01.c | 26 * root and current working directories are same as that of the parent
31 * and device number of root and current working directory of the parent and
95 * pathname of working directory of
133 * and the current working directory of the in main()
164 * Get the pathname of current working in main()
188 * (working directory) for the child process. in main()
192 "info. of working irectory in " in main()
210 /* Check for the same working directories */ in main()
212 tst_resm(TFAIL, "Working directories " in main()
217 tst_resm(TINFO, "Working directories " in main()
[all …]
|