Searched refs:yield (Results 1 – 17 of 17) sorted by relevance
| /f-stack/freebsd/contrib/openzfs/tests/zfs-tests/tests/functional/channel_program/lua_core/ |
| H A D | tst.lib_coroutine.lua | 91 coroutine.yield(n) 107 for i=2,n do coroutine.yield(i) end 115 if n%p ~= 0 then coroutine.yield(n) end 138 coroutine.yield(20) 167 coroutine.yield(3) 185 if k == 0 then coroutine.yield(a) 208 coroutine.yield(f) 227 coroutine.yield(10, 20) 229 coroutine.yield(23) 250 coroutine.yield(3) [all …]
|
| /f-stack/app/redis-5.0.5/deps/lua/test/ |
| H A D | sieve.lua | 7 for i=2,n do coroutine.yield(i) end 17 if math.mod(n, p) ~= 0 then coroutine.yield(n) end
|
| H A D | fibfor.lua | 7 coroutine.yield(a)
|
| /f-stack/dpdk/drivers/net/vdev_netvsc/ |
| H A D | vdev_netvsc.c | 71 char yield[256]; /**< PCI sub-device arguments. */ member 328 char in[RTE_MAX(sizeof(ctx->yield), 256u)]; in vdev_netvsc_sysfs_readlink() 373 char buf[RTE_MAX(sizeof(ctx->yield), 256u)]; in vdev_netvsc_device_probe() 409 if (strcmp(addr, ctx->yield)) in vdev_netvsc_device_probe() 436 memcpy(ctx->yield, addr, len + 1); in vdev_netvsc_device_probe() 580 ctx->yield[0] = '\0'; in vdev_netvsc_netvsc_probe()
|
| /f-stack/freebsd/contrib/device-tree/Bindings/net/ |
| H A D | broadcom-bcm87xx.txt | 13 he result to yield the new register value. If the third cell has a
|
| /f-stack/freebsd/contrib/device-tree/Bindings/power/ |
| H A D | domain-idle-state.yaml | 44 state will yield power benefits, after overcoming the overhead while
|
| /f-stack/freebsd/kern/ |
| H A D | capabilities.conf | 778 yield
|
| /f-stack/dpdk/doc/guides/howto/ |
| H A D | flow_bifurcation.rst | 12 movement during the traffic split. This can yield better performance with
|
| /f-stack/freebsd/sys/ |
| H A D | syscall.mk | 198 yield.o \
|
| /f-stack/freebsd/contrib/device-tree/Bindings/bus/ |
| H A D | qcom,ebi2.txt | 81 value is actually 1, so a value of 0 will still yield 1 recovery cycle.
|
| /f-stack/dpdk/doc/guides/sample_app_ug/ |
| H A D | performance_thread.rst | 43 operation should not be expected to yield useful performance and is considered 307 This design means that L-threads that have no work, can yield the CPU to other 711 ``lthread_set_affinity()`` is similar to a yield apart from the fact that the 838 a yield to a particular L-thread will be N times the context switch time. 967 (e.g. yield, sleep, or block on a different lock, or on a condition variable). 1031 of some other loop that does in fact yield, if this is possible.
|
| /f-stack/app/redis-5.0.5/deps/jemalloc/include/jemalloc/internal/ |
| H A D | jemalloc_internal_defs.h.in | 33 * order to yield to another virtual CPU.
|
| /f-stack/freebsd/contrib/openzfs/include/sys/ |
| H A D | zfs_context.h | 226 #define kpreempt(x) yield()
|
| /f-stack/dpdk/doc/guides/prog_guide/ |
| H A D | rte_flow.rst | 230 ``spec`` and ``last``, which may yield unexpected results if not used 3396 yield a large number of hidden flow rules. It is thus suggested to only
|
| H A D | env_abstraction_layer.rst | 886 subtracted from the address of the dummy header to yield the address of the
|
| H A D | qos_framework.rst | 425 packet priority in order to yield the enqueue/drop decision for a specific packet
|
| /f-stack/dpdk/doc/guides/testpmd_app_ug/ |
| H A D | testpmd_funcs.rst | 3515 These yield identical results::
|