Home
last modified time | relevance | path

Searched refs:working (Results 1 – 25 of 1624) sorted by relevance

12345678910>>...65

/external/libcxx/fuzzing/
Dfuzzing.cpp166 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/llvm-project/libcxx/test/libcxx/fuzzing/
Dpartial_sort.pass.cpp23 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()
Dunique_copy.pass.cpp20 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()
47 if (std::find(working.begin(), working.end(), v) == working.end()) in LLVMFuzzerTestOneInput()
51 for (auto v : working) in LLVMFuzzerTestOneInput()
Dnth_element.pass.cpp22 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()
Dstable_sort.pass.cpp23 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()
Dpush_heap.pass.cpp23 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()
Dunique.pass.cpp19 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()
45 if (std::find(working.begin(), working.end(), *it) == working.end()) in LLVMFuzzerTestOneInput()
49 for (auto v : working) in LLVMFuzzerTestOneInput()
Dstable_partition.pass.cpp24 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()
Dpop_heap.pass.cpp21 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()
Dsort.pass.cpp19 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
20 std::sort(working.begin(), working.end()); in LLVMFuzzerTestOneInput()
22 if (!std::is_sorted(working.begin(), working.end())) in LLVMFuzzerTestOneInput()
24 if (!fast_is_permutation(data, data + size, working.cbegin())) in LLVMFuzzerTestOneInput()
Dmake_heap.pass.cpp19 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
20 std::make_heap(working.begin(), working.end()); in LLVMFuzzerTestOneInput()
22 if (!std::is_heap(working.begin(), working.end())) in LLVMFuzzerTestOneInput()
24 if (!fast_is_permutation(data, data + size, working.cbegin())) in LLVMFuzzerTestOneInput()
Dpartition.pass.cpp20 std::vector<std::uint8_t> working(data, data + size); in LLVMFuzzerTestOneInput() local
21 auto iter = std::partition(working.begin(), working.end(), is_even); in LLVMFuzzerTestOneInput()
23 if (!std::all_of(working.begin(), iter, is_even)) in LLVMFuzzerTestOneInput()
25 if (!std::none_of(iter, working.end(), is_even)) in LLVMFuzzerTestOneInput()
27 if (!fast_is_permutation(data, data + size, working.cbegin())) in LLVMFuzzerTestOneInput()
/external/libcap/libcap/
Dcap_proc.c423 cap_t working = cap_get_proc(); in _cap_set_mode() local
426 int ret = cap_set_flag(working, CAP_EFFECTIVE, in _cap_set_mode()
428 ret = ret | _cap_set_proc(sc, working); in _cap_set_mode()
437 (void) cap_clear_flag(working, CAP_INHERITABLE); in _cap_set_mode()
458 (void) cap_clear_flag(working, CAP_PERMITTED); in _cap_set_mode()
471 (void) cap_clear_flag(working, CAP_EFFECTIVE); in _cap_set_mode()
472 ret = _cap_set_proc(sc, working) | ret; in _cap_set_mode()
473 (void) cap_free(working); in _cap_set_mode()
521 cap_t working = cap_get_proc(); in cap_get_mode() local
523 int cf = cap_compare(empty, working); in cap_get_mode()
[all …]
/external/libese/apps/boot/card/src/com/android/verifiedboot/storage/
DStorage.java232 byte[] working = new byte[2]; in sendStorageState()
257 Util.setShort(working, (short) 0, (short) 0x0); in sendStorageState()
258 apdu.sendBytesLong(working, (short) 0, (short) 2); in sendStorageState()
265 working[0] = VERSION; in sendStorageState()
266 apdu.sendBytesLong(working, (short) 0, (short) 1); in sendStorageState()
273 Util.setShort(working, (short) 0, length); in sendStorageState()
274 apdu.sendBytesLong(working, (short) 0, (short) 2); in sendStorageState()
281 working[0] = globalState.inBootloaderRaw(); in sendStorageState()
282 apdu.sendBytesLong(working, (short) 0, (short) 1); in sendStorageState()
289 working[0] = (byte)0; in sendStorageState()
[all …]
/external/tensorflow/tensorflow/lite/kernels/internal/
Dmfcc.cc52 std::vector<double> working; in Compute() local
53 mel_filterbank_.Compute(spectrogram_frame, &working); in Compute()
54 for (int i = 0; i < working.size(); ++i) { in Compute()
55 double val = working[i]; in Compute()
59 working[i] = log(val); in Compute()
61 dct_.Compute(working, output); in Compute()
/external/tensorflow/tensorflow/core/kernels/
Dmfcc.cc53 std::vector<double> working; in Compute() local
54 mel_filterbank_.Compute(spectrogram_frame, &working); in Compute()
55 for (int i = 0; i < working.size(); ++i) { in Compute()
56 double val = working[i]; in Compute()
60 working[i] = log(val); in Compute()
62 dct_.Compute(working, output); in Compute()
/external/google-breakpad/src/processor/
Dcfi_frame_info.cc59 RegisterValueMap<V> working; in FindCallerRegs() local
60 PostfixEvaluator<V> evaluator(&working, &memory); in FindCallerRegs()
66 working = registers; in FindCallerRegs()
72 working = registers; in FindCallerRegs()
73 working[".cfa"] = cfa; in FindCallerRegs()
81 working = registers; in FindCallerRegs()
82 working[".cfa"] = cfa; in FindCallerRegs()
/external/libcap/
Ddistcheck.sh4 working=$(grep "#define.CAP_LAST_CAP" libcap/include/uapi/linux/capability.h|awk '{print $3}')
6 if [[ ${actual} = ${working} ]]; then
12 echo "have: ${working}"
/external/skia/src/core/
DSkColorFilter.cpp355 working = {dstColorInfo.colorType(), workingAT, workingCS}; in asFragmentProcessor() local
358 GrColorSpaceXformEffect::Make(std::move(inputFP), dst,working), context, working); in asFragmentProcessor()
360 return ok ? GrFPSuccess(GrColorSpaceXformEffect::Make(std::move(fp), working,dst)) in asFragmentProcessor()
376 working = {kUnknown_SkColorType, workingAT, workingCS}; in onProgram() local
378 c = SkColorSpaceXformSteps{dst,working}.program(p, uniforms, c); in onProgram()
379 c = as_CFB(fChild)->program(p, c, working.colorSpace(), uniforms, alloc); in onProgram()
380 return c ? SkColorSpaceXformSteps{working,dst}.program(p, uniforms, c) in onProgram()
393 working = {kUnknown_SkColorType, workingAT, workingCS}; in onFilterColor4f() local
396 SkColorSpaceXformSteps{dst,working}.apply(color.vec()); in onFilterColor4f()
397 color = as_CFB(fChild)->onFilterColor4f(color, working.colorSpace()); in onFilterColor4f()
[all …]
/external/autotest/site_utils/
Dlab_inventory_unittest.py141 def _check_counts(self, working, broken, idle): argument
152 self.assertEqual(self.histories.get_working(), working)
156 working + broken + idle)
213 def _check_all_counts(self, working, broken): argument
228 self.assertEqual(self._pool_histories.get_working(), working)
231 working + broken)
239 self.assertEqual(count_working, working)
241 self.assertEqual(count_total, working + broken)
243 def _check_pool_counts(self, pool, working, broken): argument
255 working)
[all …]
/external/llvm-project/compiler-rt/test/fuzzer/
Dfuzzer-timeout.test4 TimeoutTest: ALARM: working on the last Unit for
13 SingleInputTimeoutTest: ALARM: working on the last Unit for {{[1-3]}} seconds
19 TimeoutEmptyTest: ALARM: working on the last Unit for
/external/libcap/tests/
Dexploit.c41 char *working; in handler() local
45 working = cap_to_text(caps, &length); in handler()
51 text = working; in handler()
/external/markdown/MarkdownTest/Tests_2004/
DBlockquotes with code blocks.text4 > print "working";
10 > return "working";
/external/markdown/MarkdownTest/Tests_2007/
DBlockquotes with code blocks.text4 > print "working";
10 > return "working";
/external/markdown/tests/markdown-test/
Dblockquotes-with-code-blocks.txt4 > print "working";
10 > return "working";

12345678910>>...65