| /freebsd/contrib/llvm-project/compiler-rt/lib/fuzzer/ |
| H A D | FuzzerCorpus.h | 73 // average execution time of inputs. The faster an input executes, the more
102 // Scaling to favor inputs with lower execution time. in UpdateEnergy()
172 for (auto II : Inputs) in ~InputCorpus()
175 size_t size() const { return Inputs.size(); } in SizeInBytes()
178 for (auto II : Inputs) in SizeInBytes()
184 for (auto II : Inputs) in NumActiveUnits()
190 for (auto II : Inputs) in MaxInputSize()
197 return std::count_if(Inputs.begin(), Inputs.end(), [](const InputInfo *II) { in NumInputsThatTouchFocusFunction()
203 return std::count_if(Inputs in NumInputsWithDataFlowTrace()
573 std::vector<InputInfo *> Inputs; global() variable
[all...] |
| H A D | FuzzerFlags.def | 20 FUZZER_FLAG_INT(len_control, 100, "Try generating small inputs first, "
21 "then try larger inputs over time. Specifies the rate at which the length "
22 "limit is increased (smaller == faster). If 0, immediately try inputs with "
27 FUZZER_FLAG_INT(keep_seed, 0, "If 1, keep seed inputs in the corpus even if "
29 "seed inputs will never be reduced. This option can be useful when seeds are"
31 FUZZER_FLAG_INT(cross_over, 1, "If 1, cross over inputs.")
33 "uniform probability distribution when choosing inputs to cross over with. "
34 "Some of the inputs in the corpus may never get chosen for mutation "
36 "inputs, regardless of the input mutation scheduling policy, can be chosen "
38 "|keep_seed==1|; all the initial seed inputs, even though they do not "
[all …]
|
| H A D | FuzzerMerge.h | 11 // Take the existing corpus (possibly empty) and merge new inputs into
12 // it so that only inputs with new coverage ('features') are added.
18 // process until all inputs are processed.
21 // The inner process reads the control file and sees a) list of all the inputs
22 // and b) the last processed input. Then it starts processing the inputs one
32 // Once all inputs are processed by the inner process(es) the outer process
35 // It uses a single pass greedy algorithm choosing first the smallest inputs
36 // within the same size the inputs that have more new features.
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonConstPropagation.cpp | 279 // (1) Given an instruction MI, and the map with input values "Inputs",
292 virtual bool evaluate(const MachineInstr &MI, const CellMap &Inputs,
296 virtual bool evaluate(const MachineInstr &BrI, const CellMap &Inputs,
299 virtual bool rewrite(MachineInstr &MI, const CellMap &Inputs) = 0;
337 bool getCell(const RegSubRegPair &R, const CellMap &Inputs,
344 const RegSubRegPair &R2, const CellMap &Inputs,
347 const CellMap &Inputs, bool &Result);
349 const CellMap &Inputs, bool &Result);
357 bool evaluateCOPY(const RegSubRegPair &R1, const CellMap &Inputs,
362 const CellMap &Inputs, LatticeCell &Result);
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Driver/ |
| H A D | Action.cpp | 76 for (auto *A : Inputs) in propagateDeviceOffloadInfo()
90 for (auto *A : Inputs) in propagateHostOffloadInfo()
209 // If all inputs agree on the same kind, use it also for this action. in OffloadAction()
232 // Add device inputs and propagate info to the device actions. Do work only if in OffloadAction()
349 JobAction::JobAction(ActionClass Kind, const ActionList &Inputs, types::ID Type) in JobAction() argument
350 : Action(Kind, Inputs, Type) {} in JobAction()
370 ExtractAPIJobAction::ExtractAPIJobAction(Action *Inputs, types::ID OutputType) in ExtractAPIJobAction() argument
371 : JobAction(ExtractAPIJobClass, Inputs, OutputType) {} in ExtractAPIJobAction()
395 IfsMergeJobAction::IfsMergeJobAction(ActionList &Inputs, types::ID Type) in IfsMergeJobAction() argument
396 : JobAction(IfsMergeJobClass, Inputs, Type) {} in IfsMergeJobAction()
[all …]
|
| /freebsd/contrib/llvm-project/lld/MachO/ |
| H A D | ConcatOutputSection.cpp | 28 if (inputs.empty()) { in addInput()
35 inputs.push_back(input); in addInput()
98 // to the inputs vector. We store new thunks via cheap vector append, rather
99 // than costly insertion into the inputs vector.
112 // the inputs and thunks vectors (both ordered by ascending address), which
126 for (ConcatInputSection *isec : inputs) in needsThunks()
150 for (ConcatInputSection *isec : inputs) { in needsThunks()
188 uint64_t isecVA = inputs[callIdx]->getVA(); in estimateBranchTargetThresholdVA()
190 for (size_t i = callIdx; i < inputs.size(); i++) { in estimateBranchTargetThresholdVA()
191 InputSection *isec = inputs[i]; in estimateBranchTargetThresholdVA()
[all …]
|
| /freebsd/share/man/man4/ |
| H A D | pcf8591.4 | 51 driver supports reading four inputs and setting one output over I2C.
55 four single-ended inputs
57 three differential inputs (one input line is shared between all three inputs)
59 two single-ended inputs and one differential input
61 two differential inputs.
71 .Bl -tag -width inputs.%d
72 .It Va inputs.%d
115 All input lines are configured as single-ended inputs.
|
| /freebsd/contrib/llvm-project/clang/lib/Driver/ToolChains/ |
| H A D | HIPAMD.cpp | 38 const InputInfoList &Inputs, in constructLlvmLinkCommand() argument
45 assert(!Inputs.empty() && "Must have at least one input."); in constructLlvmLinkCommand()
48 for (auto Input : Inputs) in constructLlvmLinkCommand()
52 // for the extracted archive of bitcode to inputs. in constructLlvmLinkCommand()
54 AddStaticDeviceLibsLinking(C, *this, JA, Inputs, Args, LlvmLinkArgs, "amdgcn", in constructLlvmLinkCommand()
60 LlvmLink, LlvmLinkArgs, Inputs, in constructLlvmLinkCommand()
65 const InputInfoList &Inputs, in constructLldCommand() argument
83 addLTOOptions(TC, Args, LldArgs, Output, Inputs, IsThinLTO); in constructLldCommand()
144 for (auto Input : Inputs) in constructLldCommand()
148 // for the extracted archive of bitcode to inputs. in constructLldCommand()
[all …]
|
| H A D | SPIRV.cpp | 75 const InputInfoList &Inputs, in ConstructJob() argument
79 if (Inputs.size() != 1) in ConstructJob()
81 constructTranslateCommand(C, *this, JA, Output, Inputs[0], {}); in ConstructJob()
86 const InputInfoList &Inputs, in ConstructJob() argument
90 if (Inputs.size() != 1) in ConstructJob()
92 constructAssembleCommand(C, *this, JA, Output, Inputs[0], {}); in ConstructJob()
121 const InputInfoList &Inputs, in ConstructJob() argument
127 AddLinkerInputs(getToolChain(), Inputs, Args, CmdArgs, JA); in ConstructJob()
138 Inputs, Output)); in ConstructJob()
|
| H A D | Clang.h | 37 const InputInfoList &Inputs);
39 const InputInfoList &Inputs);
46 const InputInfoList &Inputs) const;
88 const InputInfoList &inputs,
116 const InputInfo &Output, const InputInfoList &Inputs,
139 const InputInfo &Output, const InputInfoList &Inputs,
152 const InputInfo &Output, const InputInfoList &Inputs,
157 const InputInfoList &Inputs,
170 const InputInfo &Output, const InputInfoList &Inputs,
185 const InputInfo &Output, const InputInfoList &Inputs,
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/BLAKE3/ |
| H A D | blake3_avx2.c | 192 INLINE void transpose_msg_vecs(const uint8_t *const *inputs, in transpose_msg_vecs() argument
194 out[0] = loadu(&inputs[0][block_offset + 0 * sizeof(__m256i)]); in transpose_msg_vecs()
195 out[1] = loadu(&inputs[1][block_offset + 0 * sizeof(__m256i)]); in transpose_msg_vecs()
196 out[2] = loadu(&inputs[2][block_offset + 0 * sizeof(__m256i)]); in transpose_msg_vecs()
197 out[3] = loadu(&inputs[3][block_offset + 0 * sizeof(__m256i)]); in transpose_msg_vecs()
198 out[4] = loadu(&inputs[4][block_offset + 0 * sizeof(__m256i)]); in transpose_msg_vecs()
199 out[5] = loadu(&inputs[5][block_offset + 0 * sizeof(__m256i)]); in transpose_msg_vecs()
200 out[6] = loadu(&inputs[6][block_offset + 0 * sizeof(__m256i)]); in transpose_msg_vecs()
201 out[7] = loadu(&inputs[7][block_offset + 0 * sizeof(__m256i)]); in transpose_msg_vecs()
202 out[8] = loadu(&inputs[0][block_offset + 1 * sizeof(__m256i)]); in transpose_msg_vecs()
[all …]
|
| H A D | blake3_neon.c | 213 INLINE void transpose_msg_vecs4(const uint8_t *const *inputs, in transpose_msg_vecs4() argument
215 out[0] = loadu_128(&inputs[0][block_offset + 0 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
216 out[1] = loadu_128(&inputs[1][block_offset + 0 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
217 out[2] = loadu_128(&inputs[2][block_offset + 0 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
218 out[3] = loadu_128(&inputs[3][block_offset + 0 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
219 out[4] = loadu_128(&inputs[0][block_offset + 1 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
220 out[5] = loadu_128(&inputs[1][block_offset + 1 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
221 out[6] = loadu_128(&inputs[2][block_offset + 1 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
222 out[7] = loadu_128(&inputs[3][block_offset + 1 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
223 out[8] = loadu_128(&inputs[0][block_offset + 2 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
[all …]
|
| H A D | blake3_avx512.c | 456 INLINE void transpose_msg_vecs4(const uint8_t *const *inputs, in transpose_msg_vecs4() argument
458 out[0] = loadu_128(&inputs[0][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs4()
459 out[1] = loadu_128(&inputs[1][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs4()
460 out[2] = loadu_128(&inputs[2][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs4()
461 out[3] = loadu_128(&inputs[3][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs4()
462 out[4] = loadu_128(&inputs[0][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs4()
463 out[5] = loadu_128(&inputs[1][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs4()
464 out[6] = loadu_128(&inputs[2][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs4()
465 out[7] = loadu_128(&inputs[3][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs4()
466 out[8] = loadu_128(&inputs[0][block_offset + 2 * sizeof(__m128i)]); in transpose_msg_vecs4()
[all …]
|
| /freebsd/crypto/libecc/src/examples/hash/ |
| H A D | mdc2.h | 60 * 'inputs' with the length of each buffer passed via 'ilens'. The function
61 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
64 ATTRIBUTE_WARN_UNUSED_RET int mdc2_scattered(const u8 **inputs, const u32 *ilens,
69 * 'inputs' with the length of each buffer passed via 'ilens'. The function
70 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
73 ATTRIBUTE_WARN_UNUSED_RET int mdc2_scattered_padding1(const u8 **inputs, const u32 *ilens,
78 * 'inputs' with the length of each buffer passed via 'ilens'. The function
79 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
82 ATTRIBUTE_WARN_UNUSED_RET int mdc2_scattered_padding2(const u8 **inputs, const u32 *ilens,
|
| H A D | mdc2.c | 219 * 'inputs' with the length of each buffer passed via 'ilens'. The function
220 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
223 ATTRIBUTE_WARN_UNUSED_RET int mdc2_scattered(const u8 **inputs, const u32 *ilens, in mdc2_scattered() argument
229 MUST_HAVE((inputs != NULL) && (ilens != NULL) && (output != NULL), ret, err); in mdc2_scattered()
235 while (inputs[pos] != NULL) { in mdc2_scattered()
236 ret = mdc2_update(&ctx, inputs[pos], ilens[pos]); EG(ret, err); in mdc2_scattered()
248 * 'inputs' with the length of each buffer passed via 'ilens'. The function
249 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
252 ATTRIBUTE_WARN_UNUSED_RET int mdc2_scattered_padding1(const u8 **inputs, const u32 *ilens, in mdc2_scattered_padding1() argument
255 return mdc2_scattered(inputs, ilens, output, ISOIEC10118_TYPE1); in mdc2_scattered_padding1()
[all …]
|
| /freebsd/sys/contrib/openzfs/.github/workflows/ |
| H A D | zfs-qemu-packages.yml | 26 inputs:
86 if [ "${{ github.event.inputs.test_type }}" == "Test repo" ] ; then
92 if [ "${{ github.event.inputs.lookup }}" == 'true' ] ; then
96 …HOME/zfs/.github/workflows/scripts/qemu-test-repo-vm.sh' $EXTRA ${{ github.event.inputs.repo_url }}
99 if [ -n "${{ github.event.inputs.patch_level }}" ] ; then
100 EXTRA="--patch-level ${{ github.event.inputs.patch_level }}"
102 if [ -n "${{ github.event.inputs.custom_branch }}" ] ; then
103 EXTRA+=" --custom-branch ${{ github.event.inputs.custom_branch }}"
109 if [ -n "${{ github.event.inputs.custom_branch }}" ] ; then
110 echo "Built packages for ${{ github.event.inputs.custom_branch }}"
[all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/Driver/ |
| H A D | Action.h | 108 ActionList Inputs; variable
140 Action(ActionClass Kind, const ActionList &Inputs, types::ID Type) in Action() argument
141 : Kind(Kind), Type(Type), Inputs(Inputs) {} in Action()
151 ActionList &getInputs() { return Inputs; } in getInputs()
152 const ActionList &getInputs() const { return Inputs; } in getInputs()
154 size_type size() const { return Inputs.size(); } in size()
156 input_iterator input_begin() { return Inputs.begin(); } in input_begin()
157 input_iterator input_end() { return Inputs.end(); } in input_end()
158 input_range inputs() { return input_range(input_begin(), input_end()); } in inputs() function
159 input_const_iterator input_begin() const { return Inputs.begin(); } in input_begin()
[all …]
|
| /freebsd/contrib/libedit/TEST/ |
| H A D | test_filecompletion.c | 52 static test_input inputs[] = { variable
493 * based on the test cases present in inputs[] (above)
505 for (i = 0; i < sizeof(inputs)/sizeof(inputs[0]); i++) { in mycomplet_func()
506 if (strcmp(text, inputs[i].completion_function_input) == 0) { in mycomplet_func()
507 if (inputs[i].expanded_text[last_index] != NULL) in mycomplet_func()
508 return strdup(inputs[i].expanded_text[last_index++]); in mycomplet_func()
530 for (i = 0; i < sizeof(inputs)/sizeof(inputs[0]); i++) { in main()
532 input_len = wcslen(inputs[i].user_typed_text); in main()
533 wmemcpy(buffer, inputs[i].user_typed_text, input_len); in main()
547 inputs[i].user_typed_text, inputs[i].escaped_output, el->el_line.buffer); in main()
[all …]
|
| /freebsd/crypto/libecc/src/hash/ |
| H A D | bash224.c | 62 * 'inputs' with the length of each buffer passed via 'ilens'. The function
63 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
66 int bash224_scattered(const u8 **inputs, const u32 *ilens, in bash224_scattered() argument
72 MUST_HAVE((inputs != NULL) && (ilens != NULL) && (output != NULL), ret, err); in bash224_scattered()
76 while (inputs[pos] != NULL) { in bash224_scattered()
77 ret = bash224_update(&ctx, inputs[pos], ilens[pos]); EG(ret, err); in bash224_scattered()
|
| H A D | bash256.c | 62 * 'inputs' with the length of each buffer passed via 'ilens'. The function
63 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
66 int bash256_scattered(const u8 **inputs, const u32 *ilens, in bash256_scattered() argument
72 MUST_HAVE((inputs != NULL) && (ilens != NULL) && (output != NULL), ret, err); in bash256_scattered()
76 while (inputs[pos] != NULL) { in bash256_scattered()
77 ret = bash256_update(&ctx, inputs[pos], ilens[pos]); EG(ret, err); in bash256_scattered()
|
| H A D | bash512.c | 62 * 'inputs' with the length of each buffer passed via 'ilens'. The function
63 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
66 int bash512_scattered(const u8 **inputs, const u32 *ilens, in bash512_scattered() argument
72 MUST_HAVE((inputs != NULL) && (ilens != NULL) && (output != NULL), ret, err); in bash512_scattered()
76 while (inputs[pos] != NULL) { in bash512_scattered()
77 ret = bash512_update(&ctx, inputs[pos], ilens[pos]); EG(ret, err); in bash512_scattered()
|
| H A D | bash384.c | 62 * 'inputs' with the length of each buffer passed via 'ilens'. The function
63 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
66 int bash384_scattered(const u8 **inputs, const u32 *ilens, in bash384_scattered() argument
72 MUST_HAVE((inputs != NULL) && (ilens != NULL) && (output != NULL), ret, err); in bash384_scattered()
76 while (inputs[pos] != NULL) { in bash384_scattered()
77 const u8 *buf = inputs[pos]; in bash384_scattered()
|
| H A D | sha3-512.c | 67 * 'inputs' with the length of each buffer passed via 'ilens'. The function
68 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
71 int sha3_512_scattered(const u8 **inputs, const u32 *ilens, in sha3_512_scattered() argument
77 MUST_HAVE((inputs != NULL) && (ilens != NULL) && (output != NULL), ret, err); in sha3_512_scattered()
81 while (inputs[pos] != NULL) { in sha3_512_scattered()
82 ret = sha3_512_update(&ctx, inputs[pos], ilens[pos]); EG(ret, err); in sha3_512_scattered()
|
| H A D | sha3-384.c | 67 * 'inputs' with the length of each buffer passed via 'ilens'. The function
68 * loops on pointers in 'inputs' until it finds a NULL pointer. The function
71 int sha3_384_scattered(const u8 **inputs, const u32 *ilens, in sha3_384_scattered() argument
77 MUST_HAVE((inputs != NULL) && (ilens != NULL) && (output != NULL), ret, err); in sha3_384_scattered()
81 while (inputs[pos] != NULL) { in sha3_384_scattered()
82 const u8 *buf = inputs[pos]; in sha3_384_scattered()
|
| /freebsd/sys/contrib/openzfs/module/icp/algs/blake3/ |
| H A D | blake3_impl.c | 39 extern void ASMABI zfs_blake3_hash_many_sse2(const uint8_t * const *inputs,
62 static void blake3_hash_many_sse2(const uint8_t * const *inputs, in blake3_hash_many_sse2() argument
67 zfs_blake3_hash_many_sse2(inputs, num_inputs, blocks, key, counter, in blake3_hash_many_sse2()
103 extern void ASMABI zfs_blake3_hash_many_sse41(const uint8_t * const *inputs,
126 static void blake3_hash_many_sse41(const uint8_t * const *inputs, in blake3_hash_many_sse41() argument
131 zfs_blake3_hash_many_sse41(inputs, num_inputs, blocks, key, counter, in blake3_hash_many_sse41()
158 extern void ASMABI zfs_blake3_hash_many_avx2(const uint8_t * const *inputs,
163 static void blake3_hash_many_avx2(const uint8_t * const *inputs, in blake3_hash_many_avx2() argument
168 zfs_blake3_hash_many_avx2(inputs, num_inputs, blocks, key, counter, in blake3_hash_many_avx2()
199 extern void ASMABI zfs_blake3_hash_many_avx512(const uint8_t * const *inputs,
[all …]
|