Home
last modified time | relevance | path

Searched refs:inputs (Results 1 – 25 of 287) sorted by relevance

12345678910>>...12

/openbsd-src/gnu/llvm/libcxx/benchmarks/
H A DGenerateInput.h52 std::vector<IntT> inputs(N, static_cast<IntT>(-1)); in getDuplicateIntegerInputs()
53 return inputs; in getDuplicateIntegerInputs()
58 std::vector<IntT> inputs; in getSortedIntegerInputs() local
60 inputs.push_back(i); in getSortedIntegerInputs()
61 return inputs; in getSortedIntegerInputs()
66 std::vector<IntT> inputs; in getSortedLargeIntegerInputs() local
68 inputs.push_back(i + N); in getSortedLargeIntegerInputs()
70 return inputs; in getSortedLargeIntegerInputs()
75 std::vector<IntT> inputs = getSortedIntegerInputs<IntT>(N); in getSortedTopBitsIntegerInputs() local
76 for (auto& E : inputs) E <<= ((sizeof(IntT) / 2) * CHAR_BIT); in getSortedTopBitsIntegerInputs()
[all …]
/openbsd-src/gnu/llvm/lld/MachO/
H A DConcatOutputSection.cpp30 if (inputs.empty()) { in addInput()
37 inputs.push_back(input); in addInput()
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[i]; in estimateStubsInRangeVA()
206 for (ConcatInputSection *isec : inputs) in finalizeContents()
212 for (ConcatInputSection *isec : inputs) in finalize()
234 for (size_t callIdx = 0, endIdx = inputs.size(); callIdx < endIdx; in finalize()
[all …]
H A DConcatOutputSection.h31 const ConcatInputSection *firstSection() const { return inputs.front(); } in firstSection()
32 const ConcatInputSection *lastSection() const { return inputs.back(); } in lastSection()
33 bool isNeeded() const override { return !inputs.empty(); } in isNeeded()
54 std::vector<ConcatInputSection *> inputs; variable
H A DRelocations.cpp72 for (; isecIdx < osec->inputs.size(); ++isecIdx) { in offsetToInputSection()
73 const ConcatInputSection *isec = osec->inputs[isecIdx]; in offsetToInputSection()
78 ConcatInputSection *isec = osec->inputs[isecIdx - 1]; in offsetToInputSection()
/openbsd-src/gnu/llvm/llvm/utils/
H A Dshuffle_select_fuzz_tester.py203 inputs = []
211 inputs.append(Value('%inp' + str(i), ty, inp))
213 return inputs
284 def gen_insts(inputs, ty): argument
290 while len(inputs) > 1:
292 [idx0, idx1] = sorted(random.sample(range(len(inputs)), 2))
293 op0 = inputs[idx0]
294 op1 = inputs[idx1]
308 op2 = random.choice(inputs)
318 inputs.append(select_inst)
[all …]
H A Dshuffle_fuzz.py123 inputs = [[int(j % element_modulus)
126 results = inputs
139 print(' from: %s' % (inputs,), file=sys.stderr)
212 inputs=', '.join(
217 for input in inputs])))
/openbsd-src/gnu/llvm/clang/utils/ABITest/
H A DMakefile.test.common110 temps/test.%.ref.o: inputs/test.%.c temps/.dir
113 temps/test.%.x.o: inputs/test.%.c temps/.dir
116 temps/test.%.y.o: inputs/test.%.c temps/.dir
127 temps/test.%.a.x.ll: inputs/test.%.a.c temps/.dir
130 temps/test.%.b.x.ll: inputs/test.%.b.c temps/.dir
133 temps/test.%.a.y.ll: inputs/test.%.a.c temps/.dir
136 temps/test.%.b.y.ll: inputs/test.%.b.c temps/.dir
142 test.%.top: inputs/test.%.a.c inputs/test.%.b.c inputs/test.%.driver.c
145 .PRECIOUS: inputs/test.%.a.c inputs/test.%.b.c inputs/test.%.driver.c
146 inputs/test.%.a.c: test.%.generate
[all …]
/openbsd-src/gnu/llvm/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 …]
H A Dblake3_dispatch.c195 void blake3_hash_many(const uint8_t *const *inputs, size_t num_inputs, in blake3_hash_many() argument
204 blake3_hash_many_avx512(inputs, num_inputs, blocks, key, counter, in blake3_hash_many()
212 blake3_hash_many_avx2(inputs, num_inputs, blocks, key, counter, in blake3_hash_many()
220 blake3_hash_many_sse41(inputs, num_inputs, blocks, key, counter, in blake3_hash_many()
228 blake3_hash_many_sse2(inputs, num_inputs, blocks, key, counter, in blake3_hash_many()
237 blake3_hash_many_neon(inputs, num_inputs, blocks, key, counter, in blake3_hash_many()
242 blake3_hash_many_portable(inputs, num_inputs, blocks, key, counter, in blake3_hash_many()
H A Dblake3_impl.h198 void blake3_hash_many(const uint8_t *const *inputs, size_t num_inputs,
221 void blake3_hash_many_portable(const uint8_t *const *inputs, size_t num_inputs,
240 void blake3_hash_many_sse2(const uint8_t *const *inputs, size_t num_inputs,
258 void blake3_hash_many_sse41(const uint8_t *const *inputs, size_t num_inputs,
266 void blake3_hash_many_avx2(const uint8_t *const *inputs, size_t num_inputs,
286 void blake3_hash_many_avx512(const uint8_t *const *inputs, size_t num_inputs,
296 void blake3_hash_many_neon(const uint8_t *const *inputs, size_t num_inputs,
/openbsd-src/gnu/llvm/llvm/lib/Analysis/models/
H A Dgen-regalloc-priority-test-model.py38 inputs = dict(
41 inputs.update(
45 inputs.update(
48 inputs.update(
51 return inputs
65 def action(*inputs): argument
67 tf.cast(inputs[0][key], tf.float32) for key in PER_LIVEINTERVAL_FEATURE_LIST
71 [tf.cast(inputs[0][key], tf.float32) for key in CONTEXT_FEATURE_LIST])
H A Dgen-inline-oz-test-model.py36 inputs = [
78 inputs.extend([
84 inputs.extend([
88 return inputs
105 def action(*inputs): argument
H A Dgen-regalloc-eviction-test-model.py31 inputs = dict(
34 return inputs
48 def action(*inputs): argument
50 tf.cast(inputs[0]['mask'], tf.int32), axis=-1) + module.var
/openbsd-src/usr.sbin/nsd/dnstap/
H A Ddnstap_collector.c318 event_del(dt_col->inputs[i].event); in dt_collector_cleanup()
324 if(dt_col->inputs) { in dt_collector_cleanup()
326 free(dt_col->inputs[i].event); in dt_collector_cleanup()
328 free(dt_col->inputs); in dt_collector_cleanup()
358 dt_col->inputs = xalloc_array_zero(dt_col->count, in dt_attach_events()
359 sizeof(*dt_col->inputs)); in dt_attach_events()
361 dt_col->inputs[i].dt_collector = dt_col; in dt_attach_events()
362 dt_col->inputs[i].event = (struct event*)xalloc_zero( in dt_attach_events()
364 event_set(dt_col->inputs[i].event, in dt_attach_events()
366 dt_handle_input, &dt_col->inputs[i]); in dt_attach_events()
[all …]
/openbsd-src/gnu/llvm/llvm/utils/gn/build/
H A Dcompiled_action.gni22 # inputs
31 # inputs = [ "my_input_file.txt" ]
34 # rebase_path(inputs[0], root_build_dir),
55 "use 'inputs' instead of 'sources' in $target_name")
61 "inputs",
/openbsd-src/gnu/llvm/compiler-rt/lib/fuzzer/
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 …]
/openbsd-src/gnu/llvm/clang/utils/
H A DFuzzTest14 def __init__(self, inputs, delete, insert, replace, argument
16 self.inputs = [(s, open(s).read()) for s in inputs]
24 self.num_positions = sum([len(d) for _,d in self.inputs])
34 for i,(s,d) in enumerate(self.inputs):
81 name,data = self.tg.inputs[i]
95 name,data = self.tg.inputs[i]
114 file_data = test_application.tg.inputs[test[3][0]][1]
/openbsd-src/gnu/llvm/llvm/utils/gn/build/toolchain/
H A DBUILD.gn68 … command = "libtool -D -static -no_warning_for_no_symbols {{arflags}} -o {{output}} {{inputs}}"
73 "rm -f {{output}} && $ar rcsD {{arflags}} {{output}} {{inputs}}"
105 command = "$ld -shared {{ldflags}} -o $outfile {{inputs}} {{libs}} {{frameworks}}"
108 …{{ldflags}} -Wl,-soname,{{target_output_name}}{{output_extension}} -o $outfile {{inputs}} {{libs}}"
120 …ed {{ldflags}} -Wl,-flat_namespace -Wl,-undefined,suppress -o $outfile {{inputs}} {{libs}} {{frame…
123 …{{ldflags}} -Wl,-soname,{{target_output_name}}{{output_extension}} -o $outfile {{inputs}} {{libs}}"
135 "$ld {{ldflags}} -o $outfile {{inputs}} {{libs}} {{frameworks}}"
137 … command = "$ld {{ldflags}} -o $outfile -Wl,--start-group {{inputs}} -Wl,--end-group {{libs}}"
302 command = "$link /lib /nologo {{arflags}} /out:{{output}} {{inputs}}"
317 … "$link /nologo /dll {{ldflags}} /out:$dllfile /implib:$libfile /pdb:$pdbfile {{inputs}} {{libs}} "
[all …]
/openbsd-src/gnu/llvm/llvm/utils/gn/secondary/clang/tools/libclang/
H A DBUILD.gn12 inputs = [ "libclang.map" ]
15 rebase_path(inputs[0], root_build_dir),
47 inputs = [ "libclang.map" ]
49 [ "-Wl,--version-script," + rebase_path(inputs[0], root_build_dir) ]
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.dg/template/
H A Dptrmem4.C14 void inputs();
19 queryAliases(inputs); // { dg-error "" } in ready()
/openbsd-src/gnu/llvm/llvm/docs/
H A DLibFuzzer.rst13 LibFuzzer is linked with the library under test, and feeds fuzzed inputs to the
66 * The fuzzing engine will execute the fuzz target many times with different inputs in the same proc…
108 Coverage-guided fuzzers like libFuzzer rely on a corpus of sample inputs for the
110 of valid and invalid inputs for the code under test; for example, for a graphics
112 files. The fuzzer generates random mutations based around the sample inputs in
119 structured inputs.
122 fuzzing entrypoint still works and that all of the sample inputs run through
135 Only the inputs that trigger new coverage will be added to the first corpus.
145 initial "seed" sample inputs:
175 inputs found by one fuzzer process will be available to the other fuzzer
[all …]

12345678910>>...12