Shuhei Matsumoto 4748ebef40 thread: Cache the closest timed poller into thread ... When we introduce RB tree, getting the closest timed poller is not O(1) but O(log N). To mitigate such delay, cache the closest timed poller into thread, and update the cache when its content is changed. Add unit test cases for this change. They will also clarify the current behavior of spdk_poller_unregister() and spdk_poller_pause() for timed pollers. Signed-off-by: Shuhei Matsumoto <shuhei.matsumoto.xt@hitachi.com> Change-Id: Ibb98a54c261859a3210034038d3953e5c93ef8aa Reviewed-on: https://review.spdk.io/gerrit/c/spdk/spdk/+/7720 Tested-by: SPDK CI Jenkins <sys_sgci@intel.com> Reviewed-by: Jim Harris <james.r.harris@intel.com> Reviewed-by: Konrad Sztyber <konrad.sztyber@intel.com> Reviewed-by: Aleksey Marchuk <alexeymar@mellanox.com> Community-CI: Mellanox Build Bot		2021-05-14 10:08:02 +00:00
..
.gitignore	thread: Move threading abstraction code out of util	2018-06-12 15:24:07 +00:00
Makefile	test/unit: remove duplicate mk/spdk.common.mk includes	2019-02-11 09:30:27 +00:00
thread_ut.c	thread: Cache the closest timed poller into thread	2021-05-14 10:08:02 +00:00