Home
last modified time | relevance | path

Searched full:inputs (Results 1 – 25 of 1080) sorted by relevance

12345678910>>...44

/freebsd-src/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerCorpus.h73 // 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 size()
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.begin(), Inputs.end(), [](const InputInfo *II) { in NumInputsWithDataFlowTrace()
208 bool empty() const { return Inputs.empty(); } in empty()
[all …]
H A DFuzzerFlags.def19 FUZZER_FLAG_INT(len_control, 100, "Try generating small inputs first, "
20 "then try larger inputs over time. Specifies the rate at which the length "
21 "limit is increased (smaller == faster). If 0, immediately try inputs with "
26 FUZZER_FLAG_INT(keep_seed, 0, "If 1, keep seed inputs in the corpus even if "
28 "seed inputs will never be reduced. This option can be useful when seeds are"
30 FUZZER_FLAG_INT(cross_over, 1, "If 1, cross over inputs.")
32 "uniform probability distribution when choosing inputs to cross over with. "
33 "Some of the inputs in the corpus may never get chosen for mutation "
35 "inputs, regardless of the input mutation scheduling policy, can be chosen "
37 "|keep_seed==1|; all the initial seed inputs, even though they do not "
[all …]
H A DFuzzerMerge.h11 // 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.
H A DFuzzerDriver.cpp89 static std::vector<std::string> *Inputs; variable
209 Inputs = new std::vector<std::string>; in ParseFlags()
216 Inputs->push_back(Args[A]); in ParseFlags()
339 if (Inputs->empty()) return false; in AllInputsAreFiles()
340 for (auto &Path : *Inputs) in AllInputsAreFiles()
358 if (Inputs->size() != 1 || !Flags.exact_artifact_path) { in CleanseCrashInput()
363 std::string InputFilePath = Inputs->at(0); in CleanseCrashInput()
413 if (Inputs->size() != 1) { in MinimizeCrashInput()
417 std::string InputFilePath = Inputs->at(0); in MinimizeCrashInput()
495 assert(Inputs in MinimizeCrashInputInternalStep()
[all...]
/freebsd-src/sys/contrib/openzfs/.github/workflows/
H A Dzfs-linux-tests.yml
/freebsd-src/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonConstPropagation.cpp300 // (1) Given an instruction MI, and the map with input values "Inputs",
313 virtual bool evaluate(const MachineInstr &MI, const CellMap &Inputs,
317 virtual bool evaluate(const MachineInstr &BrI, const CellMap &Inputs,
320 virtual bool rewrite(MachineInstr &MI, const CellMap &Inputs) = 0;
358 bool getCell(const RegisterSubReg &R, const CellMap &Inputs, LatticeCell &RC);
364 const CellMap &Inputs, bool &Result);
366 const CellMap &Inputs, bool &Result);
368 const CellMap &Inputs, bool &Result);
376 bool evaluateCOPY(const RegisterSubReg &R1, const CellMap &Inputs,
381 const CellMap &Inputs, LatticeCell &Result);
[all …]
/freebsd-src/contrib/llvm-project/clang/lib/Driver/
H A DAction.cpp74 for (auto *A : Inputs) in propagateDeviceOffloadInfo()
88 for (auto *A : Inputs) in propagateHostOffloadInfo()
201 // If all inputs agree on the same kind, use it also for this action. in OffloadAction()
224 // Add device inputs and propagate info to the device actions. Do work only if in OffloadAction()
341 JobAction::JobAction(ActionClass Kind, const ActionList &Inputs, types::ID Type) in JobAction() argument
342 : Action(Kind, Inputs, Type) {} in JobAction()
362 ExtractAPIJobAction::ExtractAPIJobAction(Action *Inputs, types::ID OutputType) in ExtractAPIJobAction() argument
363 : JobAction(ExtractAPIJobClass, Inputs, OutputType) {} in ExtractAPIJobAction()
392 IfsMergeJobAction::IfsMergeJobAction(ActionList &Inputs, types::ID Type) in IfsMergeJobAction() argument
393 : JobAction(IfsMergeJobClass, Inputs, Type) {} in IfsMergeJobAction()
[all …]
/freebsd-src/share/man/man4/
H A Dpcf8591.451 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-src/contrib/llvm-project/lld/MachO/
H A DConcatOutputSection.cpp30 if (inputs.empty()) { in addInput()
37 inputs.push_back(input); in addInput()
100 // to the inputs vector. We store new thunks via cheap vector append, rather
101 // than costly insertion into the inputs vector.
114 // the inputs and thunks vectors (both ordered by ascending address), which
128 for (ConcatInputSection *isec : inputs) in needsThunks()
134 for (ConcatInputSection *isec : inputs) { in needsThunks()
171 uint64_t isecVA = inputs[callIdx]->getVA(); in estimateStubsInRangeVA()
173 for (size_t i = callIdx; i < inputs.size(); i++) { in estimateStubsInRangeVA()
174 InputSection *isec = inputs[ in estimateStubsInRangeVA()
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Support/BLAKE3/
H A Dblake3_avx2.c192 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 Dblake3_neon.c198 INLINE void transpose_msg_vecs4(const uint8_t *const *inputs, in transpose_msg_vecs4() argument
200 out[0] = loadu_128(&inputs[0][block_offset + 0 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
201 out[1] = loadu_128(&inputs[1][block_offset + 0 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
202 out[2] = loadu_128(&inputs[2][block_offset + 0 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
203 out[3] = loadu_128(&inputs[3][block_offset + 0 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
204 out[4] = loadu_128(&inputs[0][block_offset + 1 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
205 out[5] = loadu_128(&inputs[1][block_offset + 1 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
206 out[6] = loadu_128(&inputs[2][block_offset + 1 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
207 out[7] = loadu_128(&inputs[3][block_offset + 1 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
208 out[8] = loadu_128(&inputs[0][block_offset + 2 * sizeof(uint32x4_t)]); in transpose_msg_vecs4()
[all …]
H A Dblake3_avx512.c452 INLINE void transpose_msg_vecs4(const uint8_t *const *inputs, in transpose_msg_vecs4() argument
454 out[0] = loadu_128(&inputs[0][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs4()
455 out[1] = loadu_128(&inputs[1][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs4()
456 out[2] = loadu_128(&inputs[2][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs4()
457 out[3] = loadu_128(&inputs[3][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs4()
458 out[4] = loadu_128(&inputs[0][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs4()
459 out[5] = loadu_128(&inputs[1][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs4()
460 out[6] = loadu_128(&inputs[2][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs4()
461 out[7] = loadu_128(&inputs[3][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs4()
462 out[8] = loadu_128(&inputs[0][block_offset + 2 * sizeof(__m128i)]); in transpose_msg_vecs4()
[all …]
H A Dblake3_sse41.c413 INLINE void transpose_msg_vecs(const uint8_t *const *inputs, in transpose_msg_vecs() argument
415 out[0] = loadu(&inputs[0][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs()
416 out[1] = loadu(&inputs[1][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs()
417 out[2] = loadu(&inputs[2][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs()
418 out[3] = loadu(&inputs[3][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs()
419 out[4] = loadu(&inputs[0][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs()
420 out[5] = loadu(&inputs[1][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs()
421 out[6] = loadu(&inputs[2][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs()
422 out[7] = loadu(&inputs[3][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs()
423 out[8] = loadu(&inputs[0][block_offset + 2 * sizeof(__m128i)]); in transpose_msg_vecs()
[all …]
H A Dblake3_sse2.c419 INLINE void transpose_msg_vecs(const uint8_t *const *inputs, in transpose_msg_vecs() argument
421 out[0] = loadu(&inputs[0][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs()
422 out[1] = loadu(&inputs[1][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs()
423 out[2] = loadu(&inputs[2][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs()
424 out[3] = loadu(&inputs[3][block_offset + 0 * sizeof(__m128i)]); in transpose_msg_vecs()
425 out[4] = loadu(&inputs[0][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs()
426 out[5] = loadu(&inputs[1][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs()
427 out[6] = loadu(&inputs[2][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs()
428 out[7] = loadu(&inputs[3][block_offset + 1 * sizeof(__m128i)]); in transpose_msg_vecs()
429 out[8] = loadu(&inputs[0][block_offset + 2 * sizeof(__m128i)]); in transpose_msg_vecs()
[all …]
/freebsd-src/contrib/dialog/
H A Drun_test.sh38 INPUTS=inputs.rc
50 sed -e '/^#/d' "$OUTPUT" >"$INPUTS"
51 mv -f $INPUTS $OUTPUT
52 sed -e '/^#/d' "$rcfile" >"$INPUTS"
53 diff -u $INPUTS $OUTPUT | \
54 sed -e "s,$INPUTS,$rcfile," \
58 rm -f $INPUTS $OUTPUT
/freebsd-src/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DHIPAMD.cpp78 const InputInfoList &Inputs, in constructLlvmLinkCommand()
85 assert(!Inputs.empty() && "Must have at least one input."); in constructLlvmLinkCommand()
88 for (auto Input : Inputs) in constructLlvmLinkCommand()
92 // for the extracted archive of bitcode to inputs. in constructLlvmLinkCommand()
94 AddStaticDeviceLibsLinking(C, *this, JA, Inputs, Args, LlvmLinkArgs, "amdgcn", in constructLlvmLinkCommand()
100 LlvmLink, LlvmLinkArgs, Inputs, in constructLlvmLinkCommand()
105 const InputInfoList &Inputs, in constructLldCommand()
122 assert(!Inputs.empty() && "Must have at least one input."); in constructLldCommand()
124 addLTOOptions(TC, Args, LldArgs, Output, Inputs[0], IsThinLTO); in constructLldCommand()
181 for (auto Input : Inputs) in constructLldCommand()
77 constructLlvmLinkCommand(Compilation & C,const JobAction & JA,const InputInfoList & Inputs,const InputInfo & Output,const llvm::opt::ArgList & Args) const constructLlvmLinkCommand() argument
104 constructLldCommand(Compilation & C,const JobAction & JA,const InputInfoList & Inputs,const InputInfo & Output,const llvm::opt::ArgList & Args) const constructLldCommand() argument
196 ConstructJob(Compilation & C,const JobAction & JA,const InputInfo & Output,const InputInfoList & Inputs,const ArgList & Args,const char * LinkingOutput) const ConstructJob() argument
[all...]
H A DClang.h37 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,
[all...]
H A DSPIRV.cpp51 const InputInfoList &Inputs,
55 if (Inputs.size() != 1) in getTranslator()
57 constructTranslateCommand(C, *this, JA, Output, Inputs[0], {});
87 const InputInfoList &Inputs, in ConstructJob()
93 AddLinkerInputs(getToolChain(), Inputs, Args, CmdArgs, JA); in ConstructJob()
100 Inputs, Output));
43 ConstructJob(Compilation & C,const JobAction & JA,const InputInfo & Output,const InputInfoList & Inputs,const ArgList & Args,const char * LinkingOutput) const ConstructJob() argument
79 ConstructJob(Compilation & C,const JobAction & JA,const InputInfo & Output,const InputInfoList & Inputs,const ArgList & Args,const char * LinkingOutput) const ConstructJob() argument
H A DHIPSPV.cpp64 Compilation &C, const JobAction &JA, const InputInfoList &Inputs, in constructLinkAndEmitSpirvCommand() argument
67 assert(!Inputs.empty() && "Must have at least one input."); in constructLinkAndEmitSpirvCommand()
73 for (auto Input : Inputs) in constructLinkAndEmitSpirvCommand()
79 LlvmLink, LinkArgs, Inputs, Output)); in constructLinkAndEmitSpirvCommand()
94 JA, *this, ResponseFileSupport::None(), Opt, OptArgs, Inputs, Output)); in constructLinkAndEmitSpirvCommand()
108 const InputInfoList &Inputs, in ConstructJob() argument
111 if (Inputs.size() > 0 && Inputs[0].getType() == types::TY_Image && in ConstructJob()
113 return HIP::constructGenerateObjFileFromHIPFatBinary(C, Output, Inputs, in ConstructJob()
117 return HIP::constructHIPFatbinCommand(C, JA, Output.getFilename(), Inputs, in ConstructJob()
[all...]
/freebsd-src/contrib/llvm-project/clang/include/clang/Driver/
H A DAction.h107 ActionList Inputs; variable
139 Action(ActionClass Kind, const ActionList &Inputs, types::ID Type) in Action() argument
140 : Kind(Kind), Type(Type), Inputs(Inputs) {} in Action()
150 ActionList &getInputs() { return Inputs; } in getInputs()
151 const ActionList &getInputs() const { return Inputs; } in getInputs()
153 size_type size() const { return Inputs.size(); } in size()
155 input_iterator input_begin() { return Inputs.begin(); } in input_begin()
156 input_iterator input_end() { return Inputs.end(); } in input_end()
157 input_range inputs() { return input_range(input_begin(), input_end()); } in inputs() function
158 input_const_iterator input_begin() const { return Inputs.begin(); } in input_begin()
[all …]
/freebsd-src/contrib/libedit/TEST/
H A Dtest_filecompletion.c52 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-src/sys/contrib/openzfs/module/icp/algs/blake3/
H A Dblake3_impl.c48 extern void ASMABI zfs_blake3_hash_many_sse2(const uint8_t * const *inputs,
71 static void blake3_hash_many_sse2(const uint8_t * const *inputs, in blake3_hash_many_sse2() argument
76 zfs_blake3_hash_many_sse2(inputs, num_inputs, blocks, key, counter, in blake3_hash_many_sse2()
112 extern void ASMABI zfs_blake3_hash_many_sse41(const uint8_t * const *inputs,
135 static void blake3_hash_many_sse41(const uint8_t * const *inputs, in blake3_hash_many_sse41() argument
140 zfs_blake3_hash_many_sse41(inputs, num_inputs, blocks, key, counter, in blake3_hash_many_sse41()
167 extern void ASMABI zfs_blake3_hash_many_avx2(const uint8_t * const *inputs,
172 static void blake3_hash_many_avx2(const uint8_t * const *inputs, in blake3_hash_many_avx2() argument
177 zfs_blake3_hash_many_avx2(inputs, num_inputs, blocks, key, counter, in blake3_hash_many_avx2()
208 extern void ASMABI zfs_blake3_hash_many_avx512(const uint8_t * const *inputs,
[all …]
/freebsd-src/sys/contrib/device-tree/Bindings/sound/
H A Dcirrus,madera.yaml38 INnAR INnBL INnBR. For non-muxed inputs the first two cells
40 and the second two cells must be 0. For muxed inputs the
42 right A inputs and the second two cells set the mode of the
43 left and right B inputs. Valid mode values are one of the
45 of inputs the unspecified inputs default to MADERA_INMODE_DIFF.
/freebsd-src/tests/sys/common/
H A Dnet_receiver.py66 inputs = sockets
69 readable, writable, exceptional = select.select(inputs, [], inputs)
95 inputs = sockets
98 readable, writable, exceptional = select.select(inputs, [], inputs)
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCodeExtractor.h80 /// 1) Find both the inputs and outputs for the extracted region.
81 /// 2) Pass the inputs as arguments, remapping them within the extracted
163 /// interface to see what was categorized as inputs and outputs.
167 /// \param Inputs [out] - filled with values marked as inputs to the
174 ValueSet &Inputs, ValueSet &Outputs);
200 void findInputsOutputs(ValueSet &Inputs, ValueSet &Outputs,
255 Function *constructFunction(const ValueSet &inputs,
270 ValueSet &inputs, ValueSet &outputs);

12345678910>>...44