| /src/external/apache2/llvm/dist/llvm/utils/ |
| shuffle_fuzz.py | 73 # we uniformly select between -1 and the other inputs, each element of the
123 inputs = [[int(j % element_modulus)
126 results = inputs
139 print(' from: %s' % (inputs,), file=sys.stderr)
206 %%v = call fastcc <%(N)d x %(T)s> @test_wrapper(%(inputs)s)
212 inputs=', '.join( variable
217 for input in inputs])))
|
| /src/external/gpl3/gdb/dist/sim/testsuite/aarch64/ |
| cmtst.s | 19 inputs: label
70 adrp x0, inputs
71 ldr q0, [x0, #:lo12:inputs]
|
| /src/external/gpl3/gdb.old/dist/sim/testsuite/aarch64/ |
| cmtst.s | 19 inputs: label
70 adrp x0, inputs
71 ldr q0, [x0, #:lo12:inputs]
|
| /src/sys/dev/dmover/ |
| dmover_request.c | 77 int inputs = dses->dses_ninputs; local
88 if (inputs != 0) {
90 inbuf = malloc(sizeof(dmover_buffer) * inputs,
|
| /src/lib/libedit/TEST/ |
| 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++) {
506 if (strcmp(text, inputs[i].completion_function_input) == 0) {
507 if (inputs[i].expanded_text[last_index] != NULL)
508 return strdup(inputs[i].expanded_text[last_index++]);
530 for (i = 0; i < sizeof(inputs)/sizeof(inputs[0]); i++) {
532 input_len = wcslen(inputs[i].user_typed_text)
[all...] |
| /src/external/bsd/nsd/dist/dnstap/ |
| dnstap_collector.h | 41 struct dt_collector_input* inputs; member in struct:dt_collector
|
| /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/ |
| internals.h | 33 // The number of inputs to each phi node. Caching the information here
38 // An array of all the phi inputs for this block. It lists all inputs
39 // from the first incoming edge followed by all inputs for the next
40 // incoming edge, and so on. The inputs for a given edge are sorted
42 set_info **inputs; member in class:rtl_ssa::function_info::bb_phi_info
|
| insns.cc | 427 access_info *inputs[] = { look_through_degenerate_phi (value) }; local
428 value = create_phi (bi.current_ebb, value->resource (), inputs, 1);
|
| blocks.cc | 411 // Remove the inputs to the phi.
412 for (use_info *input : phi->inputs ())
467 // the phi node sets (and thus that all the inputs set too). NUM_INPUTS
468 // is the number of inputs, which is 1 for a degenerate phi. INPUTS[I]
477 access_info **inputs, unsigned int num_inputs)
496 auto *input = safe_as_a<set_info *> (inputs[i]);
499 inputs[i] = use;
504 phi->set_inputs (use_array (inputs, num_inputs));
689 // Create an array that contains all phi inputs for this block
785 auto *inputs = XOBNEWVEC (&m_obstack, access_info *, num_preds); local
832 auto *inputs = static_cast<access_info **> (obstack_finish (&m_obstack)); local
1108 set_info **inputs = phis.inputs; local
[all...] |
| /src/external/apache2/llvm/dist/libcxx/benchmarks/ |
| GenerateInput.h | 53 std::vector<IntT> inputs(N, static_cast<IntT>(-1));
54 return inputs;
59 std::vector<IntT> inputs; local
61 inputs.push_back(i);
62 return inputs;
67 std::vector<IntT> inputs; local
69 inputs.push_back(i + N);
71 return inputs;
76 std::vector<IntT> inputs = getSortedIntegerInputs<IntT>(N); local
77 for (auto& E : inputs) E <<= ((sizeof(IntT) / 2) * CHAR_BIT)
83 std::vector<IntT> inputs; local
103 std::vector<IntT> inputs; local
116 std::vector<std::string> inputs; local
124 std::vector<std::string> inputs = getRandomStringInputs(N); local
130 std::vector<std::string> inputs = getSortedStringInputs(N); local
136 static std::vector<std::string> inputs = getRandomStringInputs(N); local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/rtl-ssa/ |
| internals.h | 33 // The number of inputs to each phi node. Caching the information here
38 // An array of all the phi inputs for this block. It lists all inputs
39 // from the first incoming edge followed by all inputs for the next
40 // incoming edge, and so on. The inputs for a given edge are sorted
42 set_info **inputs; member in class:rtl_ssa::function_info::bb_phi_info
|
| insns.cc | 440 access_info *inputs[] = { look_through_degenerate_phi (value) }; local
441 value = create_phi (bi.current_ebb, value->resource (), inputs, 1);
|
| blocks.cc | 399 // Remove the inputs to the phi.
400 for (use_info *input : phi->inputs ())
455 // the phi node sets (and thus that all the inputs set too). NUM_INPUTS
456 // is the number of inputs, which is 1 for a degenerate phi. INPUTS[I]
465 access_info **inputs, unsigned int num_inputs)
484 auto *input = safe_as_a<set_info *> (inputs[i]);
487 inputs[i] = use;
492 phi->set_inputs (use_array (inputs, num_inputs));
695 // Create an array that contains all phi inputs for this block
791 auto *inputs = XOBNEWVEC (&m_obstack, access_info *, num_preds); local
838 auto *inputs = static_cast<access_info **> (obstack_finish (&m_obstack)); local
1127 set_info **inputs = phis.inputs; local
[all...] |
| /src/external/bsd/tmux/dist/ |
| cmd-command-prompt.c | 46 .usage = "[-1bFkliN] [-I inputs] [-p prompts] " CMD_TARGET_CLIENT_USAGE
89 char *inputs = NULL, *next_input; local
117 next_input = inputs = xstrdup(s);
123 cdata->prompts[0].input = inputs;
144 free(inputs);
|
| /src/external/bsd/jemalloc/dist/test/unit/ |
| ncached_max.c | 91 char inputs[100] = "8-128:1|160-160:11|170-320:22|224-8388609:0"; local
92 char *inputp = inputs;
128 strcpy(inputs, "0-112:8");
163 strcpy(inputs, "2048-6144:123");
185 strcpy(inputs, "");
192 strcpy(inputs, "4-1024:7|256-1024");
202 strcpy(inputs, "1024-256:7");
230 strcpy(inputs, "k8-1024:77p");
231 inputp = inputs;
238 strcpy(inputs, "1024-1024:65540")
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-harden-conditionals.cc | 182 vec<tree, va_gc> *inputs = NULL; local
190 vec_safe_push (inputs,
196 gasm *detach = gimple_build_asm_vec ("", inputs, outputs,
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-harden-conditionals.cc | 173 vec<tree, va_gc> *inputs = NULL; local
181 vec_safe_push (inputs,
187 gasm *detach = gimple_build_asm_vec ("", inputs, outputs,
|
| /src/external/mit/expat/dist/tests/ |
| misc_tests.c | 370 const char *const inputs[] = {inputOne, inputTwo, inputThree, inputIssue317}; local
374 for (; inputIndex < sizeof(inputs) / sizeof(inputs[0]); inputIndex++) {
378 const char *const input = inputs[inputIndex];
|
| /src/sys/dev/ic/ |
| interwave.c | 122 static int inputs = 0; variable
250 inputs = 0;
265 DPRINTF(("iwclose: outputs %d ints %d inputs %d in_ints %d\n",
266 outputs, iw_ints, inputs, iw_inints));
963 if ((inputs != iw_inints))
964 printf("iw_start_input: in %d, inints %d\n", inputs, iw_inints);
965 inputs++;
|
| /src/external/bsd/zstd/dist/tests/regression/ |
| method.c | 40 data_buffers_t inputs; /**< The input buffer for each file. */ member in struct:__anon8923
60 state->inputs = data_buffers_get(data);
62 size_t const max_size = buffers_max_size(state->inputs);
82 if (state->inputs.size == 0 || state->compressed.data == NULL ||
117 data_buffer_t const input = state->inputs.buffers[0];
172 for (size_t i = 0; i < state->inputs.size; ++i) {
173 data_buffer_t const input = state->inputs.buffers[i];
351 for (size_t i = 0; i < state->inputs.size; ++i) {
352 data_buffer_t const input = state->inputs.buffers[i];
408 for (size_t i = 0; i < state->inputs.size; ++i)
[all...] |
| /src/external/ibm-public/postfix/dist/src/cleanup/ |
| cleanup_message_test.c | 191 static int test_action(const TEST_CASE *tp, const char *inputs[],
214 for (cpp = inputs; *cpp; cpp++)
243 static const char *inputs[] = { local
256 return (test_action(tp, inputs, want_errs, want_text));
261 static const char *inputs[] = { local
275 return (test_action(tp, inputs, want_errs, want_text));
280 static const char *inputs[] = { local
289 return (test_action(tp, inputs, want_errs, want_text));
|
| /src/external/ibm-public/postfix/dist/src/util/ |
| argv.c | 467 const char *inputs[ARRAY_LEN]; /* input strings */ member in struct:TEST_CASE
503 for (cpp = tp->inputs; *cpp; cpp++)
653 argvp = argv_addv(argvp, tp->inputs);
662 argvp = argv_addv((ARGV *) 0, tp->inputs);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| InstrTypes.h | 1060 ArrayRef<Use> Inputs;
1063 explicit OperandBundleUse(StringMapEntry<uint32_t> *Tag, ArrayRef<Use> Inputs)
1064 : Inputs(Inputs), Tag(Tag) {}
1071 return Inputs[Idx]->getType()->isPointerTy();
1119 std::vector<InputTy> Inputs;
1122 explicit OperandBundleDefT(std::string Tag, std::vector<InputTy> Inputs)
1123 : Tag(std::move(Tag)), Inputs(std::move(Inputs)) {}
1124 explicit OperandBundleDefT(std::string Tag, ArrayRef<InputTy> Inputs)
1132 ArrayRef<InputTy> inputs() const { return Inputs; } function in class:llvm::CmpInst::OperandBundleDefT
[all...] |
| /src/external/bsd/pcc/dist/pcc/cc/driver/ |
| driver.c | 93 static struct strlist inputs; variable in typeref:struct:strlist
544 strlist_init(&inputs);
565 strlist_append(&inputs, argp);
832 if (last_phase != LINK && final_output && !STRLIST_EMPTY(&inputs) &&
833 !STRLIST_NEXT(STRLIST_FIRST(&inputs)))
839 if (STRLIST_EMPTY(&inputs))
846 STRLIST_FOREACH(input, &inputs) {
867 strlist_free(&inputs);
|
| /src/external/apache2/llvm/dist/clang/include/clang/Driver/ |
| Action.h | 105 ActionList Inputs;
134 Action(ActionClass Kind, const ActionList &Inputs, types::ID Type)
135 : Kind(Kind), Type(Type), Inputs(Inputs) {}
145 ActionList &getInputs() { return Inputs; }
146 const ActionList &getInputs() const { return Inputs; }
148 size_type size() const { return Inputs.size(); }
150 input_iterator input_begin() { return Inputs.begin(); }
151 input_iterator input_end() { return Inputs.end(); }
152 input_range inputs() { return input_range(input_begin(), input_end()); function in class:clang::driver::Action
155 input_const_range inputs() const { function in class:clang::driver::Action
[all...] |
