Searched refs:producers (Results 1 – 6 of 6) sorted by relevance
| /Linux-v5.10/virt/lib/ |
| D | irqbypass.c | 25 static LIST_HEAD(producers);
104 list_for_each_entry(tmp, &producers, node) { in irq_bypass_register_producer()
120 list_add(&producer->node, &producers); in irq_bypass_register_producer()
154 list_for_each_entry(tmp, &producers, node) { in irq_bypass_unregister_producer()
207 list_for_each_entry(producer, &producers, node) { in irq_bypass_register_consumer()
254 list_for_each_entry(producer, &producers, node) { in irq_bypass_unregister_consumer()
|
| /Linux-v5.10/tools/testing/selftests/bpf/ |
| D | bench.c | 301 pthread_t *producers; member
370 state.producers = calloc(env.producer_cnt, sizeof(*state.producers)); in setup_benchmark()
374 if (!state.producers || !state.consumers || !state.results) in setup_benchmark()
402 err = pthread_create(&state.producers[i], NULL, in setup_benchmark()
410 set_thread_affinity(state.producers[i], in setup_benchmark()
|
| /Linux-v5.10/Documentation/bpf/ |
| D | ringbuf.rst | 146 This reserve/commit schema allows a natural way for multiple producers, either
148 independent records and work with them without blocking other producers. This
162 - producer counter denotes amount of data reserved by all producers.
182 already committed. It is thus possible for slow producers to temporarily hold
186 speeds up as well) implementation of both producers and consumers is how data
|
| /Linux-v5.10/Documentation/gpu/ |
| D | afbc.rst | 16 producers and consumers.
|
| /Linux-v5.10/Documentation/core-api/ |
| D | circular-buffers.rst | 19 producer and just one consumer. It is possible to handle multiple producers by
|
| /Linux-v5.10/tools/memory-model/Documentation/ |
| D | litmus-tests.txt | 315 synchronize between ring-buffer producers and consumers. In the example
|
