diff --git a/CMakeLists.txt b/CMakeLists.txt index 6a33b60..a2fcf5c 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -11,6 +11,12 @@ set (GOOGLETEST_PATH ${CMAKE_SOURCE_DIR}/3rd/googletest-1.12.1/googletest) set (GTEST_ROOT_DIR ${GOOGLETEST_PATH}) set (GBENCH_ROOT_DIR ${CMAKE_SOURCE_DIR}/3rd/benchmark-1.8.2) +# set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -Wl,--stack_size,16777216") +#set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -Wl,-z,stack-size=8192") + +set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -g -O0 -fsanitize=address") +set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -g -O0 -fsanitize=address") + include_directories( src ${GTEST_ROOT_DIR} diff --git a/src/HashedWheelTimer.cpp b/src/HashedWheelTimer.cpp index 223894f..3a0c8b6 100644 --- a/src/HashedWheelTimer.cpp +++ b/src/HashedWheelTimer.cpp @@ -9,8 +9,9 @@ #include "Logging.h" const int WHEEL_SIZE = 512; -const int64_t TICK_DURATION = 100; // milliseconds -const int64_t TIME_UNIT = 10; // 10ms +const int64_t TICK_DURATION = 1; // 确定位置 milliseconds，2个都为1时，精度最高，ms级别 +const int64_t TIME_UNIT = 1; // 1 ms 可以理解为精度 tick 数* unit == update持续时间 + HashedWheelTimer::HashedWheelTimer() { @@ -97,7 +98,7 @@ int HashedWheelTimer::Update(int64_t now) int HashedWheelTimer::tick() { int64_t deadline = started_at_ + TICK_DURATION * (ticks_ + 1); - int idx = ticks_ % (WHEEL_SIZE - 1); + int idx = ticks_ % (WHEEL_SIZE); HashedWheelBucket* bucket = wheel_[idx]; std::vector expired; bucket->ExpireTimeouts(deadline, expired); diff --git a/src/list_impl.h b/src/list_impl.h index c8f8732..774772e 100644 --- a/src/list_impl.h +++ b/src/list_impl.h @@ -3,7 +3,7 @@ #pragma once #include - +#include /** * container_of - cast a member of a structure out to the containing structure @@ -17,46 +17,131 @@ #define container_of(ptr, type, member) ((type *)((char *)(ptr) - offsetof(type, member))) #endif +struct list_head { + list_head* next = NULL; + list_head* prev = NULL; +}; -/** - * list_entry - get the struct for this entry - * @ptr: the &struct list_head pointer. - * @type: the type of the struct this is embedded in. - * @member: the name of the list_struct within the struct. +/* + * Architectures might want to move the poison pointer offset + * into some well-recognized area such as 0xdead000000000000, + * that is also not mappable by user-space exploits: + */ +#define POISON_POINTER_DELTA 0 + +/* + * These are non-NULL pointers that will result in page faults + * under normal circumstances, used to verify that nobody uses + * non-initialized list entries. + */ +#define LIST_POISON1 (void *)( 0x100 + POISON_POINTER_DELTA) +#define LIST_POISON2 (void *)( 0x200 + POISON_POINTER_DELTA) + +/* + * Simple doubly linked list implementation. + * + * Some of the internal functions ("__xxx") are useful when + * manipulating whole lists rather than single entries, as + * sometimes we already know the next/prev entries and we can + * generate better code by using them directly rather than + * using the generic single-entry routines. + */ + +#define LIST_HEAD_INIT(name) { &(name), &(name) } + +#define LIST_HEAD(name) \ + struct list_head name = LIST_HEAD_INIT(name) + +static inline void INIT_LIST_HEAD(struct list_head *list) +{ + list->next = list; + list->prev = list; +} + +/* + * Insert a new entry between two known consecutive entries. + * + * This is only for internal list manipulation where we know + * the prev/next entries already! */ -#ifndef list_entry -#define list_entry(ptr, type, member) container_of(ptr, type, member) +#ifndef CONFIG_DEBUG_LIST +static inline void __list_add(struct list_head *cur, + struct list_head *prev, + struct list_head *next) +{ + next->prev = cur; + cur->next = next; + cur->prev = prev; + prev->next = cur; +} +#else +extern void __list_add(struct list_head *cur, + struct list_head *prev, + struct list_head *next); #endif - /** - * list_first_entry - get the first element from a list - * @ptr: the list head to take the element from. - * @type: the type of the struct this is embedded in. - * @member: the name of the list_struct within the struct. - * - * Note, that list is expected to be not empty. - */ -#define list_first_entry(ptr, type, member) list_entry((ptr)->next, type, member) +/** + * list_add - add a new entry + * @new: new entry to be added + * @head: list head to add it after + * + * Insert a new entry after the specified head. + * This is good for implementing stacks. + */ +static inline void list_add(struct list_head *cur, struct list_head *head) +{ + __list_add(cur, head, head->next); +} -struct list_head { - list_head* next = NULL; - list_head* prev = NULL; -}; +/** + * list_add_tail - add a new entry + * @new: new entry to be added + * @head: list head to add it before + * + * Insert a new entry before the specified head. + * This is useful for implementing queues. + */ +static inline void list_add_tail(struct list_head *cur, struct list_head *head) +{ + __list_add(cur, head->prev, head); +} -inline void INIT_LIST_HEAD(list_head* list) { - list->next = list; - list->prev = list; +/* + * Delete a list entry by making the prev/next entries + * point to each other. + * + * This is only for internal list manipulation where we know + * the prev/next entries already! + */ +static inline void __list_del(struct list_head * prev, struct list_head * next) +{ + next->prev = prev; + prev->next = next; } /** - * list_empty - tests whether a list is empty - * @head: the list to test. + * list_del - deletes entry from list. + * @entry: the element to delete from the list. + * Note: list_empty() on entry does not return true after this, the entry is + * in an undefined state. */ -inline int list_empty(const struct list_head* head) +#ifndef CONFIG_DEBUG_LIST +static inline void __list_del_entry(struct list_head *entry) +{ + __list_del(entry->prev, entry->next); +} + +static inline void list_del(struct list_head *entry) { - return head->next == head; + __list_del(entry->prev, entry->next); + entry->next = (list_head*)LIST_POISON1; + entry->prev = (list_head*)LIST_POISON2; } +#else +extern void __list_del_entry(struct list_head *entry); +extern void list_del(struct list_head *entry); +#endif /** * list_replace - replace old entry by new one @@ -65,71 +150,467 @@ inline int list_empty(const struct list_head* head) * * If @old was empty, it will be overwritten. */ -inline void list_replace(list_head* old, list_head* new_) +static inline void list_replace(struct list_head *old, + struct list_head *cur) { - new_->next = old->next; - new_->next->prev = new_; - new_->prev = old->prev; - new_->prev->next = new_; + cur->next = old->next; + cur->next->prev = cur; + cur->prev = old->prev; + cur->prev->next = cur; } -inline void list_replace_init(list_head* old, list_head* new_) { - list_replace(old, new_); - INIT_LIST_HEAD(old); +static inline void list_replace_init(struct list_head *old, + struct list_head *cur) +{ + list_replace(old, cur); + INIT_LIST_HEAD(old); } -/* - * Insert a new entry between two known consecutive entries. +/** + * list_del_init - deletes entry from list and reinitialize it. + * @entry: the element to delete from the list. + */ +static inline void list_del_init(struct list_head *entry) +{ + __list_del_entry(entry); + INIT_LIST_HEAD(entry); +} + +/** + * list_move - delete from one list and add as another's head + * @list: the entry to move + * @head: the head that will precede our entry + */ +static inline void list_move(struct list_head *list, struct list_head *head) +{ + __list_del_entry(list); + list_add(list, head); +} + +/** + * list_move_tail - delete from one list and add as another's tail + * @list: the entry to move + * @head: the head that will follow our entry + */ +static inline void list_move_tail(struct list_head *list, + struct list_head *head) +{ + __list_del_entry(list); + list_add_tail(list, head); +} + +/** + * list_is_last - tests whether @list is the last entry in list @head + * @list: the entry to test + * @head: the head of the list + */ +static inline int list_is_last(const struct list_head *list, + const struct list_head *head) +{ + return list->next == head; +} + +/** + * list_empty - tests whether a list is empty + * @head: the list to test. + */ +static inline int list_empty(const struct list_head *head) +{ + return head->next == head; +} + +/** + * list_empty_careful - tests whether a list is empty and not being modified + * @head: the list to test * - * This is only for internal list manipulation where we know - * the prev/next entries already! + * Description: + * tests whether a list is empty _and_ checks that no other CPU might be + * in the process of modifying either member (next or prev) + * + * NOTE: using list_empty_careful() without synchronization + * can only be safe if the only activity that can happen + * to the list entry is list_del_init(). Eg. it cannot be used + * if another CPU could re-list_add() it. */ -inline void __list_add(list_head* new_, list_head* prev, list_head* next) { - next->prev = new_; - new_->next = next; - new_->prev = prev; - prev->next = new_; +static inline int list_empty_careful(const struct list_head *head) +{ + struct list_head *next = head->next; + return (next == head) && (next == head->prev); } -/* - * Delete a list entry by making the prev/next entries - * point to each other. +/** + * list_rotate_left - rotate the list to the left + * @head: the head of the list + */ +static inline void list_rotate_left(struct list_head *head) +{ + struct list_head *first; + + if (!list_empty(head)) { + first = head->next; + list_move_tail(first, head); + } +} + +/** + * list_is_singular - tests whether a list has just one entry. + * @head: the list to test. + */ +static inline int list_is_singular(const struct list_head *head) +{ + return !list_empty(head) && (head->next == head->prev); +} + +static inline void __list_cut_position(struct list_head *list, + struct list_head *head, struct list_head *entry) +{ + struct list_head *new_first = entry->next; + list->next = head->next; + list->next->prev = list; + list->prev = entry; + entry->next = list; + head->next = new_first; + new_first->prev = head; +} + +/** + * list_cut_position - cut a list into two + * @list: a new list to add all removed entries + * @head: a list with entries + * @entry: an entry within head, could be the head itself + * and if so we won't cut the list * - * This is only for internal list manipulation where we know - * the prev/next entries already! + * This helper moves the initial part of @head, up to and + * including @entry, from @head to @list. You should + * pass on @entry an element you know is on @head. @list + * should be an empty list or a list you do not care about + * losing its data. + * + */ +static inline void list_cut_position(struct list_head *list, + struct list_head *head, struct list_head *entry) +{ + if (list_empty(head)) + return; + if (list_is_singular(head) && + (head->next != entry && head != entry)) + return; + if (entry == head) + INIT_LIST_HEAD(list); + else + __list_cut_position(list, head, entry); +} + +static inline void __list_splice(const struct list_head *list, + struct list_head *prev, + struct list_head *next) +{ + struct list_head *first = list->next; + struct list_head *last = list->prev; + + first->prev = prev; + prev->next = first; + + last->next = next; + next->prev = last; +} + +/** + * list_splice - join two lists, this is designed for stacks + * @list: the new list to add. + * @head: the place to add it in the first list. */ -inline void __list_del(list_head* prev, list_head* next) +static inline void list_splice(const struct list_head *list, + struct list_head *head) { - next->prev = prev; - prev->next = next; + if (!list_empty(list)) + __list_splice(list, head, head->next); } /** - * list_add_tail - add a new entry - * @new: new entry to be added - * @head: list head to add it before + * list_splice_tail - join two lists, each list being a queue + * @list: the new list to add. + * @head: the place to add it in the first list. + */ +static inline void list_splice_tail(struct list_head *list, + struct list_head *head) +{ + if (!list_empty(list)) + __list_splice(list, head->prev, head); +} + +/** + * list_splice_init - join two lists and reinitialise the emptied list. + * @list: the new list to add. + * @head: the place to add it in the first list. * - * Insert a new entry before the specified head. - * This is useful for implementing queues. + * The list at @list is reinitialised */ -inline void list_add_tail(struct list_head* new_, struct list_head* head) +static inline void list_splice_init(struct list_head *list, + struct list_head *head) { - __list_add(new_, head->prev, head); + if (!list_empty(list)) { + __list_splice(list, head, head->next); + INIT_LIST_HEAD(list); + } } +/** + * list_splice_tail_init - join two lists and reinitialise the emptied list + * @list: the new list to add. + * @head: the place to add it in the first list. + * + * Each of the lists is a queue. + * The list at @list is reinitialised + */ +static inline void list_splice_tail_init(struct list_head *list, + struct list_head *head) +{ + if (!list_empty(list)) { + __list_splice(list, head->prev, head); + INIT_LIST_HEAD(list); + } +} -/* - * Architectures might want to move the poison pointer offset - * into some well-recognized area such as 0xdead000000000000, - * that is also not mappable by user-space exploits: +/** + * list_entry - get the struct for this entry + * @ptr: the &struct list_head pointer. + * @type: the type of the struct this is embedded in. + * @member: the name of the list_struct within the struct. */ -#define POISON_POINTER_DELTA 0 +#define list_entry(ptr, type, member) \ + container_of(ptr, type, member) +/** + * list_first_entry - get the first element from a list + * @ptr: the list head to take the element from. + * @type: the type of the struct this is embedded in. + * @member: the name of the list_struct within the struct. + * + * Note, that list is expected to be not empty. + */ +#define list_first_entry(ptr, type, member) \ + list_entry((ptr)->next, type, member) -/* - * These are non-NULL pointers that will result in page faults - * under normal circumstances, used to verify that nobody uses - * non-initialized list entries. +/** + * list_first_entry_or_null - get the first element from a list + * @ptr: the list head to take the element from. + * @type: the type of the struct this is embedded in. + * @member: the name of the list_struct within the struct. + * + * Note that if the list is empty, it returns NULL. + */ +#define list_first_entry_or_null(ptr, type, member) \ + (!list_empty(ptr) ? list_first_entry(ptr, type, member) : NULL) + +/** + * list_next_entry - get the next element in list + * @pos: the type * to cursor + * @member: the name of the list_struct within the struct. + */ +#define list_next_entry(pos, member) \ + list_entry((pos)->member.next, typeof(*(pos)), member) + +/** + * list_prev_entry - get the prev element in list + * @pos: the type * to cursor + * @member: the name of the list_struct within the struct. + */ +#define list_prev_entry(pos, member) \ + list_entry((pos)->member.prev, typeof(*(pos)), member) + +/** + * list_for_each - iterate over a list + * @pos: the &struct list_head to use as a loop cursor. + * @head: the head for your list. + */ +#define list_for_each(pos, head) \ + for (pos = (head)->next; pos != (head); pos = pos->next) + +/** + * __list_for_each - iterate over a list + * @pos: the &struct list_head to use as a loop cursor. + * @head: the head for your list. + * + * This variant doesn't differ from list_for_each() any more. + * We don't do prefetching in either case. + */ +#define __list_for_each(pos, head) \ + for (pos = (head)->next; pos != (head); pos = pos->next) + +/** + * list_for_each_prev - iterate over a list backwards + * @pos: the &struct list_head to use as a loop cursor. + * @head: the head for your list. + */ +#define list_for_each_prev(pos, head) \ + for (pos = (head)->prev; pos != (head); pos = pos->prev) + +/** + * list_for_each_safe - iterate over a list safe against removal of list entry + * @pos: the &struct list_head to use as a loop cursor. + * @n: another &struct list_head to use as temporary storage + * @head: the head for your list. + */ +#define list_for_each_safe(pos, n, head) \ + for (pos = (head)->next, n = pos->next; pos != (head); \ + pos = n, n = pos->next) + +/** + * list_for_each_prev_safe - iterate over a list backwards safe against removal of list entry + * @pos: the &struct list_head to use as a loop cursor. + * @n: another &struct list_head to use as temporary storage + * @head: the head for your list. + */ +#define list_for_each_prev_safe(pos, n, head) \ + for (pos = (head)->prev, n = pos->prev; \ + pos != (head); \ + pos = n, n = pos->prev) + +/** + * list_for_each_entry - iterate over list of given type + * @pos: the type * to use as a loop cursor. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry(pos, head, member) \ + for (pos = list_entry((head)->next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = list_entry(pos->member.next, typeof(*pos), member)) + +/** + * list_for_each_entry_reverse - iterate backwards over list of given type. + * @pos: the type * to use as a loop cursor. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry_reverse(pos, head, member) \ + for (pos = list_entry((head)->prev, typeof(*pos), member); \ + &pos->member != (head); \ + pos = list_entry(pos->member.prev, typeof(*pos), member)) + +/** + * list_prepare_entry - prepare a pos entry for use in list_for_each_entry_continue() + * @pos: the type * to use as a start point + * @head: the head of the list + * @member: the name of the list_struct within the struct. + * + * Prepares a pos entry for use as a start point in list_for_each_entry_continue(). + */ +#define list_prepare_entry(pos, head, member) \ + ((pos) ? : list_entry(head, typeof(*pos), member)) + +/** + * list_for_each_entry_continue - continue iteration over list of given type + * @pos: the type * to use as a loop cursor. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + * + * Continue to iterate over list of given type, continuing after + * the current position. + */ +#define list_for_each_entry_continue(pos, head, member) \ + for (pos = list_entry(pos->member.next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = list_entry(pos->member.next, typeof(*pos), member)) + +/** + * list_for_each_entry_continue_reverse - iterate backwards from the given point + * @pos: the type * to use as a loop cursor. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + * + * Start to iterate over list of given type backwards, continuing after + * the current position. + */ +#define list_for_each_entry_continue_reverse(pos, head, member) \ + for (pos = list_entry(pos->member.prev, typeof(*pos), member); \ + &pos->member != (head); \ + pos = list_entry(pos->member.prev, typeof(*pos), member)) + +/** + * list_for_each_entry_from - iterate over list of given type from the current point + * @pos: the type * to use as a loop cursor. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + * + * Iterate over list of given type, continuing from current position. + */ +#define list_for_each_entry_from(pos, head, member) \ + for (; &pos->member != (head); \ + pos = list_entry(pos->member.next, typeof(*pos), member)) + +/** + * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry + * @pos: the type * to use as a loop cursor. + * @n: another type * to use as temporary storage + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry_safe(pos, n, head, member) \ + for (pos = list_entry((head)->next, typeof(*pos), member), \ + n = list_entry(pos->member.next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = n, n = list_entry(n->member.next, typeof(*n), member)) + +/** + * list_for_each_entry_safe_continue - continue list iteration safe against removal + * @pos: the type * to use as a loop cursor. + * @n: another type * to use as temporary storage + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + * + * Iterate over list of given type, continuing after current point, + * safe against removal of list entry. + */ +#define list_for_each_entry_safe_continue(pos, n, head, member) \ + for (pos = list_entry(pos->member.next, typeof(*pos), member), \ + n = list_entry(pos->member.next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = n, n = list_entry(n->member.next, typeof(*n), member)) + +/** + * list_for_each_entry_safe_from - iterate over list from current point safe against removal + * @pos: the type * to use as a loop cursor. + * @n: another type * to use as temporary storage + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + * + * Iterate over list of given type from current point, safe against + * removal of list entry. + */ +#define list_for_each_entry_safe_from(pos, n, head, member) \ + for (n = list_entry(pos->member.next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = n, n = list_entry(n->member.next, typeof(*n), member)) + +/** + * list_for_each_entry_safe_reverse - iterate backwards over list safe against removal + * @pos: the type * to use as a loop cursor. + * @n: another type * to use as temporary storage + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + * + * Iterate backwards over list of given type, safe against removal + * of list entry. + */ +#define list_for_each_entry_safe_reverse(pos, n, head, member) \ + for (pos = list_entry((head)->prev, typeof(*pos), member), \ + n = list_entry(pos->member.prev, typeof(*pos), member); \ + &pos->member != (head); \ + pos = n, n = list_entry(n->member.prev, typeof(*n), member)) + +/** + * list_safe_reset_next - reset a stale list_for_each_entry_safe loop + * @pos: the loop cursor used in the list_for_each_entry_safe loop + * @n: temporary storage used in list_for_each_entry_safe + * @member: the name of the list_struct within the struct. + * + * list_safe_reset_next is not safe to use in general if the list may be + * modified concurrently (eg. the lock is dropped in the loop body). An + * exception to this is if the cursor element (pos) is pinned in the list, + * and list_safe_reset_next is called after re-taking the lock and before + * completing the current iteration of the loop body. */ -#define LIST_POISON1 (0x00100100 + POISON_POINTER_DELTA) -#define LIST_POISON2 (0x00200200 + POISON_POINTER_DELTA) +#define list_safe_reset_next(pos, n, member) \ + n = list_entry(pos->member.next, typeof(*pos), member) \ No newline at end of file diff --git a/src/timer_list.cpp b/src/timer_list.cpp index 265629a..33d372d 100644 --- a/src/timer_list.cpp +++ b/src/timer_list.cpp @@ -1,6 +1,8 @@ // Distributed under GPLv3 license, see accompanying files LICENSE #include "timer_list.h" + +#include #include void init_timers(struct tvec_base* base, int64_t clock) @@ -158,31 +160,24 @@ int del_timer(struct timer_list* timer) static int cascade(struct tvec_base* base, struct tvec* tv, int index) { /* cascade all the timers from tv up one level */ - struct list_head tv_list; - - list_replace_init(tv->vec + index, &tv_list); - - /* - * We are removing _all_ timers from the list, so we - * don't have to detach them individually. - */ - timer_list* timer = list_entry(tv_list.next, timer_list, entry); - timer_list* tmp = list_entry(timer->entry.next, timer_list, entry); - - while (&timer->entry != &tv_list) - { - timer = tmp; - tmp = list_entry(tmp->entry.next, timer_list, entry); - // BUG_ON(tbase_get_base(timer->base) != base); - /* No accounting, while moving them */ - __internal_add_timer(base, timer); - } - - return index; + struct timer_list *timer, *tmp; + struct list_head tv_list; + + list_replace_init(tv->vec + index, &tv_list); + + /* + * We are removing _all_ timers from the list, so we + * don't have to detach them individually. + */ + list_for_each_entry_safe(timer, tmp, &tv_list, entry) { + // BUG_ON(tbase_get_base(timer->base) != base); + /* No accounting, while moving them */ + __internal_add_timer(base, timer); + } + + return index; } - - #define INDEX(N) ((base->timer_clk >> (TVR_BITS + (N) * TVN_BITS)) & TVN_MASK) int run_timers(struct tvec_base* base, int64_t clock) @@ -202,13 +197,13 @@ int run_timers(struct tvec_base* base, int64_t clock) } ++base->timer_clk; list_replace_init(base->tv1.vec + index, &work_list); - + while (!list_empty(head)) { struct timer_list* timer = list_first_entry(head, timer_list, entry); auto fn = timer->function; base->running_timer = timer; detach_expired_timer(timer, base); - + assert(fn); fn(timer); diff --git a/test/main.cpp b/test/main.cpp index 41b9f8d..ea260cc 100644 --- a/test/main.cpp +++ b/test/main.cpp @@ -7,25 +7,51 @@ #include #include +#include +#include "TimerBase.h" +#include "Clock.h" int main(int argc, char* argv[]) { - srand((int)time(NULL)); + // srand((int)time(NULL)); - testing::InitGoogleTest(&argc, argv); + // testing::InitGoogleTest(&argc, argv); - int r = RUN_ALL_TESTS(); - if (r == 1) { - return 1; - } + // int r = RUN_ALL_TESTS(); + // if (r == 1) { + // return 1; + // } + + // printf("start run benchmarks\n"); + // benchmark::Initialize(&argc, argv); + // if (benchmark::ReportUnrecognizedArguments(argc, argv)) { + // return 1; + // } + // benchmark::RunSpecifiedBenchmarks(); + // benchmark::Shutdown(); + + int64_t deadline = Clock::CurrentTimeMillis(); + auto timer = CreateTimer(TimerSchedType::TIMER_HH_WHEEL); + std::vector times = {15,10,5,3,2,10,5,3,2,1,2,1,1,2000}; + auto delay = 0; + std::cout << " start " << Clock::CurrentTimeMillis() << std::endl; + uint32_t duration = 0; + for (int i = 0; i < times.size(); i++) { + + duration += times[uint32_t(delay)%times.size()]; + std::cout << " duration " << duration << " cur ms: " << Clock::CurrentTimeMillis() << std::endl; + int tid = timer->Start(duration, []() { - printf("start run benchmarks\n"); - benchmark::Initialize(&argc, argv); - if (benchmark::ReportUnrecognizedArguments(argc, argv)) { - return 1; + std::cout << "client send 1111111 " << Clock::CurrentTimeMillis() << std::endl; + + + }); + delay += 1; + } + for (int i = 0; i <= duration*30; i++) { + timer->Update(Clock::CurrentTimeMillis()); + std::this_thread::sleep_for(std::chrono::nanoseconds(500 * 1000)); } - benchmark::RunSpecifiedBenchmarks(); - benchmark::Shutdown(); return 0; }