| /external/deqp/framework/delibs/decpp/ |
| D | deThreadSafeRingBuffer.cpp | 135 vector<Consumer*> consumers; in ThreadSafeRingBuffer_selfTest() local
141 consumers.push_back(new Consumer(buffer, numProducers)); in ThreadSafeRingBuffer_selfTest()
144 for (vector<Consumer*>::iterator i = consumers.begin(); i != consumers.end(); i++) in ThreadSafeRingBuffer_selfTest()
160 for (vector<Consumer*>::iterator i = consumers.begin(); i != consumers.end(); i++) in ThreadSafeRingBuffer_selfTest()
172 cmpSum += consumers[j]->getPayloadSum((deUint16)i); in ThreadSafeRingBuffer_selfTest()
179 for (vector<Consumer*>::iterator i = consumers.begin(); i != consumers.end(); i++) in ThreadSafeRingBuffer_selfTest()
|
| D | deBlockBuffer.cpp | 172 vector<Consumer*> consumers; in runTest() local
178 consumers.push_back(new Consumer(buffer, numProducers)); in runTest()
181 for (vector<Consumer*>::iterator i = consumers.begin(); i != consumers.end(); i++) in runTest()
199 for (vector<Consumer*>::iterator i = consumers.begin(); i != consumers.end(); i++) in runTest()
211 cmpSum += consumers[j]->getPayloadSum((deUint16)i); in runTest()
218 for (vector<Consumer*>::iterator i = consumers.begin(); i != consumers.end(); i++) in runTest()
|
| /external/kotlinx.coroutines/benchmarks/src/jmh/kotlin/benchmarks/ |
| D | ChannelProducerConsumerBenchmark.kt | 67 val consumers = 1 in <lambda>() constant
68 run(producers, consumers) in <lambda>()
74 val consumers = producers in <lambda>() constant
75 run(producers, consumers) in <lambda>()
78 private fun run(producers: Int, consumers: Int) { in <lambda>()
80 val phaser = Phaser(producers + consumers + 1) in <lambda>()
92 repeat(consumers) { in <lambda>()
95 repeat(n / consumers) { in <lambda>()
|
| /external/tensorflow/tensorflow/lite/delegates/gpu/common/ |
| D | model.cc | 55 return FilterValues([](const ValueDef& v) { return v.consumers.empty(); }); in outputs()
83 return values_[id].consumers.empty(); in IsGraphOutput()
97 return values_[id].consumers; in FindConsumers()
215 v->consumers.push_back(node_ptr); in AddConsumer()
253 v_new->consumers.push_back(node_ptr); in ReplaceInput()
254 Erase(&v_old->consumers, node_ptr); in ReplaceInput()
269 Erase(&v->consumers, node_ptr); in RemoveConsumer()
278 Erase(&values_[value->id].consumers, node_ptr); in DeleteNode()
296 if (!v->consumers.empty()) { in DeleteValue()
297 for (auto node : v->consumers) { in DeleteValue()
[all …]
|
| /external/grpc-grpc/test/core/surface/ |
| D | completion_queue_threading_test.cc | 208 static void test_threading(size_t producers, size_t consumers) { in test_threading() argument
210 gpr_malloc((producers + consumers) * sizeof(test_thread_options))); in test_threading()
219 "test_threading", producers, consumers); in test_threading()
223 gpr_malloc(sizeof(*threads) * (producers + consumers))); in test_threading()
224 for (i = 0; i < producers + consumers; i++) { in test_threading()
249 for (i = 0; i < producers + consumers; i++) { in test_threading()
264 for (i = 0; i < producers + consumers; i++) { in test_threading()
272 for (i = 0; i < producers + consumers; i++) { in test_threading()
278 for (i = 0; i < producers + consumers; i++) { in test_threading()
|
| /external/igt-gpu-tools/benchmarks/ |
| D | gem_latency.c | 139 struct consumer *consumers; member
358 p->consumers[n].go = 1; in producer()
384 p->consumers[n].go = 1; in producer()
496 p[n].consumers = calloc(nconsumers, sizeof(struct consumer)); in run()
498 p[n].consumers[m].producer = &p[n]; in run()
499 igt_mean_init(&p[n].consumers[m].latency); in run()
500 pthread_create(&p[n].consumers[m].thread, NULL, in run()
501 consumer, &p[n].consumers[m]); in run()
543 pthread_join(p[n].consumers[m].thread, NULL); in run()
545 p[n].consumers[m].latency.mean); in run()
[all …]
|
| /external/tensorflow/tensorflow/python/framework/ |
| D | composite_tensor.py | 85 consumers = nest.flatten([
86 component.consumers()
90 return list(set(consumers))
|
| D | subscribe.py | 122 for consumer_op in list(tensor.consumers()): # explicit copy
248 consumers = tensor.consumers()
249 matching_ops = [op for op in consumers if op.name.startswith(name_scope)]
|
| D | sparse_tensor_test.py | 92 self.assertEqual(len(sp.consumers()), 1)
93 self.assertEqual(sp.consumers()[0], out.op)
96 self.assertEqual(len(sp.consumers()), 2)
97 self.assertIn(dense.op, sp.consumers())
98 self.assertIn(out.op, sp.consumers())
|
| /external/perfetto/src/traced/probes/power/ |
| D | android_power_data_source.cc | 109 std::vector<android_internal::EnergyConsumerInfo> consumers( in GetEnergyConsumerInfo() local
111 size_t num_power_entities = consumers.size(); in GetEnergyConsumerInfo()
112 if (!get_energy_consumer_info_(&consumers[0], &num_power_entities)) { in GetEnergyConsumerInfo()
116 consumers.resize(num_power_entities); in GetEnergyConsumerInfo()
117 return consumers; in GetEnergyConsumerInfo()
300 auto consumers = lib_->GetEnergyConsumerInfo(); in WriteEnergyEstimationBreakdown() local
301 for (const auto& consumer : consumers) { in WriteEnergyEstimationBreakdown()
|
| /external/boringssl/src/ |
| D | BREAKING-CHANGES.md | 3 …g changes require some care. We depend on tight feedback loops with our consumers so that we can l…
19 The vast majority of BoringSSL consumers are conveniently indexed in various Code Search instances.…
23 If some change has high cost (from having to fix consumers) and relatively little benefit to Boring…
25 …hat leads to a major improvement to all BoringSSL consumers, at the cost of fixing one or two cons…
27 ## Fixing consumers
35 3. Remove the original API once all consumers have been migrated.
56 …consumers fail to compile. Prefer to remove functions completely over leaving an always failing st…
60 … hope that consumers have some amount of test coverage. When doing so, try to fail on the common c…
72 …somewhere first then wait a couple of weeks for the change to appear in consumers. This ensures th…
74 While we rely on a tight feedback loop with our consumers, there are a few consumers which update l…
[all …]
|
| /external/tensorflow/tensorflow/core/tpu/graph_rewrite/ |
| D | variable_merger_pass.cc | 84 std::vector<std::pair<Node*, int>> consumers; in MergeVarHandleOps() local
86 consumers.emplace_back(e->dst(), e->dst_input()); in MergeVarHandleOps()
89 for (const auto& t : consumers) { in MergeVarHandleOps()
122 std::vector<std::pair<Node*, int>> consumers; in MergeReadVariableOps() local
124 consumers.emplace_back(e->dst(), e->dst_input()); in MergeReadVariableOps()
127 for (const auto& t : consumers) { in MergeReadVariableOps()
|
| /external/tensorflow/tensorflow/core/data/service/ |
| D | task_runner_test.cc | 114 std::vector<std::unique_ptr<Thread>> consumers; in TEST_P() local
120 consumers.push_back(absl::WrapUnique(Env::Default()->StartThread( in TEST_P()
134 consumers.clear(); in TEST_P()
167 std::vector<std::unique_ptr<Thread>> consumers; in TEST() local
173 consumers.push_back(absl::WrapUnique(Env::Default()->StartThread( in TEST()
187 consumers.clear(); in TEST()
|
| D | common.proto | 23 // Optional number of consumers. If set, the results of the task will be
24 // provided to consumers round-robin.
|
| /external/tensorflow/tensorflow/python/tpu/ |
| D | tensor_tracer_report.py | 115 consumers = list(op._control_outputs)
118 consumers += [consumer_op for consumer_op in out_tensor.consumers()]
119 consumers.sort(key=lambda op: op.name)
120 for consumer in consumers:
395 consumers = tensor.consumers()
396 consumers.sort(key=lambda op: op.name)
397 for consumer_op in consumers:
|
| /external/tensorflow/tensorflow/lite/delegates/gpu/common/selectors/ |
| D | special_selector.cc | 49 auto consumers = graph.FindConsumers(dw_outputs[0]->id); in TryDepthwiseConvPlus1x1Conv() local
50 if (consumers.size() != 1) { in TryDepthwiseConvPlus1x1Conv()
53 auto* conv_node = consumers[0]; in TryDepthwiseConvPlus1x1Conv()
113 auto consumers = graph.FindConsumers(fc0_output_id); in TryFCFCAdd() local
114 if (consumers.size() != 1) { in TryFCFCAdd()
117 auto* add_node = consumers[0]; in TryFCFCAdd()
|
| /external/tensorflow/tensorflow/lite/delegates/gpu/common/transformations/ |
| D | add_quant_adjustments.cc | 48 auto consumers = graph->FindConsumers(output_value->id); in ApplyToNode() local
50 if (consumers.empty()) { in ApplyToNode()
81 for (auto& consumer : consumers) { in ApplyToNode()
|
| /external/tensorflow/tensorflow/go/ |
| D | operation.go | 147 var consumers []Consumer
149 consumers = append(consumers, Consumer{
158 return consumers
|
| /external/perfetto/src/android_internal/ |
| D | power_stats.cc | 52 virtual bool GetEnergyConsumerInfo(EnergyConsumerInfo* consumers,
63 bool GetEnergyConsumerInfo(EnergyConsumerInfo* consumers,
83 bool GetEnergyConsumerInfo(EnergyConsumerInfo* consumers,
123 bool GetEnergyConsumerInfo(EnergyConsumerInfo* consumers, size_t* size_of_arr) { in GetEnergyConsumerInfo() argument
124 return GetDataProvider()->GetEnergyConsumerInfo(consumers, size_of_arr); in GetEnergyConsumerInfo()
309 EnergyConsumerInfo* consumers, in GetEnergyConsumerInfo() argument
333 auto& cur = consumers[(*size_of_arr)++]; in GetEnergyConsumerInfo()
|
| /external/eigen/unsupported/test/ |
| D | cxx11_eventcount.cpp | 106 std::vector<std::unique_ptr<std::thread>> consumers; in test_stress_eventcount() local
108 consumers.emplace_back(new std::thread([&ec, &queues, &waiters, i]() { in test_stress_eventcount()
134 consumers[i]->join(); in test_stress_eventcount()
|
| /external/autotest/client/common_lib/cros/ |
| D | memory_eater.py | 43 def cleanup_consumers(consumers): argument
48 while len(consumers):
49 job = consumers.pop()
|
| /external/llvm/docs/ |
| D | MarkedUpDisassembly.rst | 11 LLVM's default disassembly output is raw text. To allow consumers more ability
22 mismatches between consumers and producers. That is, the syntax generally does
23 not carry semantics beyond "this text has an annotation," so consumers can
83 The intended consumers of this information use the C API, therefore the new C
|
| /external/llvm-project/llvm/docs/ |
| D | MarkedUpDisassembly.rst | 11 LLVM's default disassembly output is raw text. To allow consumers more ability
22 mismatches between consumers and producers. That is, the syntax generally does
23 not carry semantics beyond "this text has an annotation," so consumers can
83 The intended consumers of this information use the C API, therefore the new C
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | loop_optimizer.cc | 88 auto consumers = node_map_->GetOutputs(node->name()); in HandleInvariantEnter() local
98 for (auto* consumer : consumers) { in HandleInvariantEnter()
142 auto consumers = node_map_->GetOutputs(node->name()); in HandleConst() local
143 for (auto* consumer : consumers) { in HandleConst()
210 auto consumers = node_map_->GetOutputs(node->name()); in HandleInvariantNode() local
214 for (auto* consumer : consumers) { in HandleInvariantNode()
281 auto& consumers = node_map_->GetOutputs(node->name()); in RevertInvariantNodes() local
282 for (auto* consumer : consumers) { in RevertInvariantNodes()
340 auto consumers = node_map_->GetOutputs(node->name()); in FindInvariantNodes() local
341 invariant_nodes_.emplace(node, consumers.size()); in FindInvariantNodes()
[all …]
|
| /external/rust/crates/rayon/src/iter/plumbing/ |
| D | README.md | 39 variants of consumers. The difference is how the split is performed:
48 - Not all consumers can operate in this mode. It works for
65 To handle an iterator chain, we start by creating consumers. This
76 it only works for unindexed consumers.
78 (As an aside, it is interesting that only some consumers can work in
81 all consumers can be supplied indexes. Isn't variance neat.)
83 As it happens, `FlatMap` only works with unindexed consumers anyway.
90 we want. But for unindexed consumers, this doesn't matter, since they
119 creating consumers. Instead, it creates a *producer*, a `ZipProducer`,
145 appropriate. This may create yet more consumers as we proceed up the
|