Home
last modified time | relevance | path

Searched full:consumers (Results 1 – 25 of 2557) sorted by relevance

12345678910>>...103

/aosp_15_r20/hardware/google/gchips/gralloc4/src/core/
Dmali_gralloc_formats.cpp97 * Determines all IP consumers included by the requested buffer usage.
102 * @return flags word of all enabled consumers;
103 * 0, if no consumers are enabled
107 uint16_t consumers = 0; in get_consumers() local
111 consumers |= GOOGLE_GRALLOC_CONSUMER_TPU; in get_consumers()
121 consumers = MALI_GRALLOC_CONSUMER_DPU; in get_consumers()
127 consumers |= MALI_GRALLOC_CONSUMER_CPU; in get_consumers()
137 consumers |= MALI_GRALLOC_CONSUMER_DPU; in get_consumers()
140 consumers |= get_vpu_consumer(usage); in get_consumers()
150 consumers |= MALI_GRALLOC_CONSUMER_DPU; in get_consumers()
[all …]
/aosp_15_r20/hardware/interfaces/power/stats/aidl/vts/
H A DVtsHalPowerStatsTargetTest.cpp357 std::vector<EnergyConsumer> consumers; in TEST_P() local
358 ASSERT_OK(powerstats->getEnergyConsumerInfo(&consumers)); in TEST_P()
363 std::vector<EnergyConsumer> consumers; in TEST_P() local
364 ASSERT_OK(powerstats->getEnergyConsumerInfo(&consumers)); in TEST_P()
366 testUnique(consumers, &EnergyConsumer::id); in TEST_P()
371 std::vector<EnergyConsumer> consumers; in TEST_P() local
372 ASSERT_OK(powerstats->getEnergyConsumerInfo(&consumers)); in TEST_P()
374 for (auto consumer : consumers) { in TEST_P()
381 std::vector<EnergyConsumer> consumers; in TEST_P() local
382 ASSERT_OK(powerstats->getEnergyConsumerInfo(&consumers)); in TEST_P()
[all …]
/aosp_15_r20/external/clang/lib/Frontend/
H A DMultiplexConsumer.cpp246 : Consumers(std::move(C)), MutationListener(), DeserializationListener() { in MultiplexConsumer()
251 for (auto &Consumer : Consumers) { in MultiplexConsumer()
271 for (auto &Consumer : Consumers) in Initialize()
277 for (auto &Consumer : Consumers) in HandleTopLevelDecl()
283 for (auto &Consumer : Consumers) in HandleInlineFunctionDefinition()
288 for (auto &Consumer : Consumers) in HandleCXXStaticMemberVarInstantiation()
293 for (auto &Consumer : Consumers) in HandleInterestingDecl()
298 for (auto &Consumer : Consumers) in HandleTranslationUnit()
303 for (auto &Consumer : Consumers) in HandleTagDeclDefinition()
308 for (auto &Consumer : Consumers) in HandleTagDeclRequiredDefinition()
[all …]
/aosp_15_r20/external/kotlinx.coroutines/kotlinx-coroutines-core/jvmBenchmark/kotlin/kotlinx/coroutines/channels/
H A DChannelProducerConsumerBenchmark.kt16 …the time for a batch of such operations separated into the specified number of consumers/producers. in <lambda>()
63 val consumers = 1 in <lambda>() constant
64 run(producers, consumers) in <lambda>()
71 val consumers = max(1, _4_parallelism - 1) in <lambda>() constant
72 run(producers, consumers) in <lambda>()
78 val consumers = producers in <lambda>() constant
79 run(producers, consumers) in <lambda>()
82 private fun run(producers: Int, consumers: Int) { in <lambda>()
83 val n = (APPROX_BATCH_SIZE / producers * producers) / consumers * consumers in <lambda>()
84 val phaser = Phaser(producers + consumers + 1) in <lambda>()
[all …]
/aosp_15_r20/external/boringssl/src/
H A DBREAKING-CHANGES.md3 …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…
58 If some parameter now must be `NULL`, change the type to an opaque struct pointer. Consumers passin…
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…
[all …]
/aosp_15_r20/external/cronet/third_party/boringssl/src/
H A DBREAKING-CHANGES.md3 …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…
58 If some parameter now must be `NULL`, change the type to an opaque struct pointer. Consumers passin…
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…
[all …]
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/thread/example/
Dperf_condition_variable.cpp83 SharedData(unsigned iterations, unsigned consumers) : in SharedData()
84 …iterations(iterations), counter(), semaphore(consumers) // Initialize to the number of consumers. … in SharedData()
98 unsigned const consumers = shared_data->semaphore; // (*) in producer_thread() local
103 // Wait till all consumers signal. in producer_thread()
104 while (consumers != shared_data->semaphore) in producer_thread()
109 // Signal consumers. in producer_thread()
148 std::vector<std::thread> consumers in benchmark_ping_pong() local
157 // Start the consumers. in benchmark_ping_pong()
159 consumers[i] = std::thread in benchmark_ping_pong()
164 // Wait till consumers finish. in benchmark_ping_pong()
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/lite/delegates/gpu/common/
H A Dmodel.cc55 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 …]
/aosp_15_r20/external/deqp/framework/delibs/decpp/
H A DdeThreadSafeRingBuffer.cpp139 vector<Consumer *> consumers; in ThreadSafeRingBuffer_selfTest() local
145 consumers.push_back(new Consumer(buffer, numProducers)); in ThreadSafeRingBuffer_selfTest()
147 // Start consumers. in ThreadSafeRingBuffer_selfTest()
148 for (vector<Consumer *>::iterator i = consumers.begin(); i != consumers.end(); i++) in ThreadSafeRingBuffer_selfTest()
159 // Write end messages for consumers. in ThreadSafeRingBuffer_selfTest()
163 // Wait for consumers. in ThreadSafeRingBuffer_selfTest()
164 for (vector<Consumer *>::iterator i = consumers.begin(); i != consumers.end(); i++) in ThreadSafeRingBuffer_selfTest()
176 cmpSum += consumers[j]->getPayloadSum((uint16_t)i); in ThreadSafeRingBuffer_selfTest()
183 for (vector<Consumer *>::iterator i = consumers.begin(); i != consumers.end(); i++) in ThreadSafeRingBuffer_selfTest()
H A DdeBlockBuffer.cpp92 … /* Feed back rest of messages to buffer (they are end messages) so other consumers wake up. */ in run()
177 vector<Consumer *> consumers; in runTest() local
183 consumers.push_back(new Consumer(buffer, numProducers)); in runTest()
185 // Start consumers. in runTest()
186 for (vector<Consumer *>::iterator i = consumers.begin(); i != consumers.end(); i++) in runTest()
197 // Write end messages for consumers. in runTest()
203 // Wait for consumers. in runTest()
204 for (vector<Consumer *>::iterator i = consumers.begin(); i != consumers.end(); i++) in runTest()
216 cmpSum += consumers[j]->getPayloadSum((uint16_t)i); in runTest()
223 for (vector<Consumer *>::iterator i = consumers.begin(); i != consumers.end(); i++) in runTest()
/aosp_15_r20/external/tensorflow/tensorflow/python/data/experimental/ops/
H A Ddata_service_ops.py276 When specified, consumers will read from the job in a strict round-robin
278 num_consumers: (Optional.) The number of consumers which will consume from
280 consumers will read from the job in a strict round-robin order, instead
283 producer from running out of data early and causing consumers to go out
302 service worker. Consumers of a shared job must use the same
493 specified, consumers will read from the job in a strict round-robin order,
495 num_consumers: (Optional.) The number of consumers which will consume from
497 consumers will read from the job in a strict round-robin order, instead of
500 producer from running out of data early and causing consumers to go out of
524 Consumers of a shared job must use the same `target_workers`. Defaults to
[all …]
/aosp_15_r20/external/google-cloud-java/java-private-catalog/grpc-google-cloud-private-catalog-v1beta1/src/main/java/com/google/cloud/privatecatalog/v1beta1/
H A DPrivateCatalogGrpc.java24 * `PrivateCatalog` allows catalog consumers to retrieve `Catalog`, `Product`
241 * `PrivateCatalog` allows catalog consumers to retrieve `Catalog`, `Product`
267 …* Search [Catalog][google.cloud.privatecatalog.v1beta1.Catalog] resources that consumers have acce…
283 …* Search [Product][google.cloud.privatecatalog.v1beta1.Product] resources that consumers have acce…
299 …* Search [Version][google.cloud.privatecatalog.v1beta1.Version] resources that consumers have acce…
316 * `PrivateCatalog` allows catalog consumers to retrieve `Catalog`, `Product`
349 * `PrivateCatalog` allows catalog consumers to retrieve `Catalog`, `Product`
384 …* Search [Catalog][google.cloud.privatecatalog.v1beta1.Catalog] resources that consumers have acce…
402 …* Search [Product][google.cloud.privatecatalog.v1beta1.Product] resources that consumers have acce…
420 …* Search [Version][google.cloud.privatecatalog.v1beta1.Version] resources that consumers have acce…
[all …]
/aosp_15_r20/external/igt-gpu-tools/benchmarks/
H A Dgem_latency.c139 struct consumer *consumers; member
358 p->consumers[n].go = 1; in producer()
384 p->consumers[n].go = 1; in producer()
450 printf("producers=%d, consumers=%d, nop=%d, workload=%d, flags=%x\n", in run()
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()
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/dtensor/mlir/
H A Dlayout_propagation_v2.cc108 // E.g. during the creation of the consumers map, we skip the input and output
123 // Then the consumers map would directly connect the mlir::Value %a to input 0
181 // Consumers are first merged together so that we have the layout which is
182 // sharded in a tensor dim if and only if all consumers are sharded in the same
191 const mlir::DenseMap<mlir::OpOperand*, Layout>& consumers) { in MergeLayouts() argument
192 if (consumers.empty()) return producer.value(); in MergeLayouts()
195 // consumers. in MergeLayouts()
197 consumers.begin()->second.sharding_spec_strs(); in MergeLayouts()
201 for (const auto& consumer : consumers) { in MergeLayouts()
210 for (const auto& consumer : consumers) { in MergeLayouts()
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/core/data/service/
H A Ddispatcher_impl.h57 // consumers consume the data from the iteration until there is no data left.
68 // one task for each outstanding iteration. Consumers periodically heartbeat to
71 // For non-round-robin-reads, there is no coordination among consumers. Each
74 // consumers to read from the same task at each step. This requires coordination
75 // to ensure that all consumers start reading from the new task in the same
82 // information is reported by consumers in their heartbeats.
98 // - When consumers heartbeat, they tell the dispatcher their current round and
104 // to add the new task. Once all consumers are ready to add the new task, we
106 // consumers. We set the "starting_round" field of the task to indicate the
107 // target round where all consumers should start reading from the task.
[all …]
H A Dtask_runner.h66 // Interface for providing elements to task consumers.
209 // consumers. These requests are blocked until all requests arrive. Once all
210 // requests arrive, the runner hands out elements to consumers in order of their
213 // Consumers are expected to successively request consecutive element indices,
218 // If the worker restarts mid-round, a situation arises where some consumers
221 // round, where we only serve elements to consumers requesting data for element
222 // index `n`, blocking other consumers until the second round.
236 // Prepares a partial round to get consumers back in sync.
/aosp_15_r20/external/apache-commons-lang/src/test/java/org/apache/commons/lang3/function/
H A DConsumersTest.java27 * Tests {@link Consumers}.
32 * Tests {@link Consumers#nop()}.
36 Stream.of("").forEach(Consumers.nop()); in testNop()
38 final Consumer<?> c1 = Consumers.nop(); in testNop()
40 final Consumer<Object> c2 = Consumers.nop(); in testNop()
42 final Consumer<String> c3 = Consumers.nop(); in testNop()
45 Consumers.nop().accept(null); in testNop()
46 Consumers.nop().accept(""); in testNop()
/aosp_15_r20/external/grpc-grpc/test/core/surface/
H A Dcompletion_queue_threading_test.cc218 static void test_threading(size_t producers, size_t consumers) { in test_threading() argument
220 gpr_malloc((producers + consumers) * sizeof(test_thread_options))); in test_threading()
228 gpr_log(GPR_INFO, "%s: %" PRIuPTR " producers, %" PRIuPTR " consumers", in test_threading()
229 "test_threading", producers, consumers); in test_threading()
233 gpr_malloc(sizeof(*threads) * (producers + consumers))); in test_threading()
234 for (i = 0; i < producers + consumers; i++) { in test_threading()
259 for (i = 0; i < producers + consumers; i++) { in test_threading()
264 // start phase2: operations will complete, and consumers will consume them in test_threading()
274 for (i = 0; i < producers + consumers; i++) { in test_threading()
282 for (i = 0; i < producers + consumers; i++) { in test_threading()
[all …]
/aosp_15_r20/external/autotest/client/common_lib/cros/
H A Dmemory_eater.py45 def cleanup_consumers(consumers): argument
46 """Kill all processes in |consumers|
48 @param consumers: The list of consumers to clean.
50 while len(consumers):
51 job = consumers.pop()
93 """Gets pid of active consumers by all instances of the class."""
186 """Runs concurrent memory consumers to produce memory pressure.
/aosp_15_r20/external/rust/android-crates-io/crates/rayon/src/iter/plumbing/
DREADME.md39 variants of consumers which differ in 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
/aosp_15_r20/prebuilts/cmake/linux-x86/share/cmake-3.22/Help/prop_tgt/
DINTERFACE_POSITION_INDEPENDENT_CODE.rst4 Whether consumers need to create a position-independent target
6 The ``INTERFACE_POSITION_INDEPENDENT_CODE`` property informs consumers of
10 property on all consumers will be set to ``ON``. Similarly, if this
12 property on all consumers will be set to ``OFF``. If this property is
13 undefined, then consumers will determine their
14 :prop_tgt:`POSITION_INDEPENDENT_CODE` property by other means. Consumers
/aosp_15_r20/external/google-cloud-java/java-dataproc-metastore/proto-google-cloud-dataproc-metastore-v1/src/main/java/com/google/cloud/metastore/v1/
H A DNetworkConfig.java1187 …* repeated .google.cloud.metastore.v1.NetworkConfig.Consumer consumers = 1 [(.google.api.field_beh…
1203 …* repeated .google.cloud.metastore.v1.NetworkConfig.Consumer consumers = 1 [(.google.api.field_beh…
1220 …* repeated .google.cloud.metastore.v1.NetworkConfig.Consumer consumers = 1 [(.google.api.field_beh…
1236 …* repeated .google.cloud.metastore.v1.NetworkConfig.Consumer consumers = 1 [(.google.api.field_beh…
1252 …* repeated .google.cloud.metastore.v1.NetworkConfig.Consumer consumers = 1 [(.google.api.field_beh…
1677 …* repeated .google.cloud.metastore.v1.NetworkConfig.Consumer consumers = 1 [(.google.api.field_beh…
1696 …* repeated .google.cloud.metastore.v1.NetworkConfig.Consumer consumers = 1 [(.google.api.field_beh…
1715 …* repeated .google.cloud.metastore.v1.NetworkConfig.Consumer consumers = 1 [(.google.api.field_beh…
1734 …* repeated .google.cloud.metastore.v1.NetworkConfig.Consumer consumers = 1 [(.google.api.field_beh…
1760 …* repeated .google.cloud.metastore.v1.NetworkConfig.Consumer consumers = 1 [(.google.api.field_beh…
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/core/grappler/optimizers/
H A Dloop_optimizer.cc88 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 …]
/aosp_15_r20/external/tensorflow/tensorflow/python/data/experimental/kernel_tests/service/
H A Dtest_base.py295 The dataset simulates `num_consumers` consumers by using parallel
307 num_consumers: The number of consumers to simulate.
312 A dataset that simulates reading with `num_consumers` consumers.
329 consumers = []
331 consumers.append(
339 # Use parallel interleave to read from consumers in parallel.
340 ds = dataset_ops.Dataset.from_tensor_slices(consumers)
355 num_consumers: The number of consumers.
/aosp_15_r20/external/google-cloud-java/java-dataproc-metastore/proto-google-cloud-dataproc-metastore-v1beta/src/main/java/com/google/cloud/metastore/v1beta/
H A DNetworkConfig.java1188 …* repeated .google.cloud.metastore.v1beta.NetworkConfig.Consumer consumers = 1 [(.google.api.field…
1205 …* repeated .google.cloud.metastore.v1beta.NetworkConfig.Consumer consumers = 1 [(.google.api.field…
1222 …* repeated .google.cloud.metastore.v1beta.NetworkConfig.Consumer consumers = 1 [(.google.api.field…
1238 …* repeated .google.cloud.metastore.v1beta.NetworkConfig.Consumer consumers = 1 [(.google.api.field…
1254 …* repeated .google.cloud.metastore.v1beta.NetworkConfig.Consumer consumers = 1 [(.google.api.field…
1722 …* repeated .google.cloud.metastore.v1beta.NetworkConfig.Consumer consumers = 1 [(.google.api.field…
1742 …* repeated .google.cloud.metastore.v1beta.NetworkConfig.Consumer consumers = 1 [(.google.api.field…
1761 …* repeated .google.cloud.metastore.v1beta.NetworkConfig.Consumer consumers = 1 [(.google.api.field…
1780 …* repeated .google.cloud.metastore.v1beta.NetworkConfig.Consumer consumers = 1 [(.google.api.field…
1806 …* repeated .google.cloud.metastore.v1beta.NetworkConfig.Consumer consumers = 1 [(.google.api.field…
[all …]

12345678910>>...103