Searched refs:producers (Results 1 – 8 of 8) sorted by relevance
| /linux/virt/lib/ |
| A D | irqbypass.c | 25 static LIST_HEAD(producers);
100 list_for_each_entry(tmp, &producers, node) { in irq_bypass_register_producer()
116 list_add(&producer->node, &producers); in irq_bypass_register_producer()
150 list_for_each_entry(tmp, &producers, node) { in irq_bypass_unregister_producer()
203 list_for_each_entry(producer, &producers, node) { in irq_bypass_register_consumer()
250 list_for_each_entry(producer, &producers, node) { in irq_bypass_unregister_consumer()
|
| /linux/tools/testing/selftests/bpf/ |
| A D | bench.c | 342 pthread_t *producers; member
421 state.producers = calloc(env.producer_cnt, sizeof(*state.producers)); in setup_benchmark()
425 if (!state.producers || !state.consumers || !state.results) in setup_benchmark()
453 err = pthread_create(&state.producers[i], NULL, in setup_benchmark()
461 set_thread_affinity(state.producers[i], in setup_benchmark()
|
| /linux/Documentation/bpf/ |
| A 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/Documentation/gpu/ |
| A D | afbc.rst | 16 producers and consumers.
|
| /linux/Documentation/core-api/ |
| A D | circular-buffers.rst | 19 producer and just one consumer. It is possible to handle multiple producers by
|
| /linux/tools/memory-model/Documentation/ |
| A D | litmus-tests.txt | 315 synchronize between ring-buffer producers and consumers. In the example
|
| /linux/ |
| A D | System.map | 159560 ffff8000120c8158 d producers
|
| A D | .tmp_System.map | 159560 ffff8000120c8158 d producers
|
Completed in 358 milliseconds