You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

SnowWorkerM1.c 5.4 kB

4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161
  1. /*
  2. * 版权属于:yitter(yitter@126.com)
  3. * 代码翻译:amuluowin
  4. * 代码修订:yitter
  5. * 开源地址:https://gitee.com/yitter/idgenerator
  6. */
  7. #include <malloc.h>
  8. #include <stdlib.h>
  9. #include <stdbool.h>
  10. #include <sys/time.h>
  11. #include "SnowWorkerM1.h"
  12. pthread_mutex_t ThreadMutex = PTHREAD_MUTEX_INITIALIZER;
  13. static void EndOverCostAction(uint64_t useTimeTick, SnowFlakeWorker *worker);
  14. static uint64_t NextOverCostId(SnowFlakeWorker *worker);
  15. static uint64_t NextNormalId(SnowFlakeWorker *worker);
  16. static uint64_t CalcId(SnowFlakeWorker *worker);
  17. static uint64_t CalcTurnBackId(SnowFlakeWorker *worker);
  18. static inline void EndOverCostAction(uint64_t useTimeTick, SnowFlakeWorker *worker) {
  19. if (worker->_TermIndex > 10000) {
  20. worker->_TermIndex = 0;
  21. }
  22. }
  23. static inline uint64_t NextOverCostId(SnowFlakeWorker *worker) {
  24. uint64_t currentTimeTick = GetCurrentTimeTick(worker);
  25. if (currentTimeTick > worker->_LastTimeTick) {
  26. EndOverCostAction(currentTimeTick, worker);
  27. worker->_LastTimeTick = currentTimeTick;
  28. worker->_CurrentSeqNumber = worker->MinSeqNumber;
  29. worker->_IsOverCost = false;
  30. worker->_OverCostCountInOneTerm = 0;
  31. worker->_GenCountInOneTerm = 0;
  32. return CalcId(worker);
  33. }
  34. if (worker->_OverCostCountInOneTerm > worker->TopOverCostCount) {
  35. EndOverCostAction(currentTimeTick, worker);
  36. worker->_LastTimeTick = GetNextTimeTick(worker);
  37. worker->_CurrentSeqNumber = worker->MinSeqNumber;
  38. worker->_IsOverCost = false;
  39. worker->_OverCostCountInOneTerm = 0;
  40. worker->_GenCountInOneTerm = 0;
  41. return CalcId(worker);
  42. }
  43. if (worker->_CurrentSeqNumber > worker->MaxSeqNumber) {
  44. worker->_LastTimeTick++;
  45. worker->_CurrentSeqNumber = worker->MinSeqNumber;
  46. worker->_IsOverCost = true;
  47. worker->_OverCostCountInOneTerm++;
  48. worker->_GenCountInOneTerm++;
  49. return CalcId(worker);
  50. }
  51. worker->_GenCountInOneTerm++;
  52. return CalcId(worker);
  53. }
  54. static inline uint64_t NextNormalId(SnowFlakeWorker *worker) {
  55. uint64_t currentTimeTick = GetCurrentTimeTick(worker);
  56. if (currentTimeTick < worker->_LastTimeTick) {
  57. if (worker->_TurnBackTimeTick < 1) {
  58. worker->_TurnBackTimeTick = worker->_LastTimeTick - 1;
  59. worker->_TurnBackIndex++;
  60. if (worker->_TurnBackIndex > 4) {
  61. worker->_TurnBackIndex = 1;
  62. }
  63. }
  64. return CalcTurnBackId(worker);
  65. }
  66. if (worker->_TurnBackTimeTick > 0) {
  67. worker->_TurnBackTimeTick = 0;
  68. }
  69. if (currentTimeTick > worker->_LastTimeTick) {
  70. worker->_LastTimeTick = currentTimeTick;
  71. worker->_CurrentSeqNumber = worker->MinSeqNumber;
  72. return CalcId(worker);
  73. }
  74. if (worker->_CurrentSeqNumber > worker->MaxSeqNumber) {
  75. worker->_TermIndex++;
  76. worker->_LastTimeTick++;
  77. worker->_CurrentSeqNumber = worker->MinSeqNumber;
  78. worker->_IsOverCost = true;
  79. worker->_OverCostCountInOneTerm = 1;
  80. worker->_GenCountInOneTerm = 1;
  81. return CalcId(worker);
  82. }
  83. return CalcId(worker);
  84. }
  85. static inline uint64_t CalcId(SnowFlakeWorker *worker) {
  86. uint64_t result = (worker->_LastTimeTick << worker->_TimestampShift) | (worker->WorkerId << worker->SeqBitLength) |
  87. (worker->_CurrentSeqNumber);
  88. worker->_CurrentSeqNumber++;
  89. return result;
  90. }
  91. static inline uint64_t CalcTurnBackId(SnowFlakeWorker *worker) {
  92. uint64_t result = (worker->_LastTimeTick << worker->_TimestampShift) | (worker->WorkerId << worker->SeqBitLength) |
  93. (worker->_TurnBackTimeTick);
  94. worker->_TurnBackTimeTick--;
  95. return result;
  96. }
  97. extern SnowFlakeWorker *NewSnowFlakeWorker() {
  98. SnowFlakeWorker *worker = (SnowFlakeWorker *) malloc(sizeof(SnowFlakeWorker));
  99. worker->_IsOverCost = false;
  100. worker->_LastTimeTick = 0;
  101. worker->_TurnBackTimeTick = 0;
  102. worker->_TurnBackIndex = 0;
  103. worker->_OverCostCountInOneTerm = 0;
  104. worker->_GenCountInOneTerm = 0;
  105. worker->_TermIndex = 0;
  106. return worker;
  107. }
  108. extern uint64_t WorkerM1NextId(SnowFlakeWorker *worker) {
  109. pthread_mutex_lock(&ThreadMutex);
  110. uint64_t id = worker->_IsOverCost ? NextOverCostId(worker) : NextNormalId(worker);
  111. pthread_mutex_unlock(&ThreadMutex);
  112. return id;
  113. }
  114. extern uint64_t GetCurrentTimeTick(SnowFlakeWorker *worker) {
  115. struct timeval tv;
  116. gettimeofday(&tv, NULL);
  117. return ((uint64_t) tv.tv_sec * 1000 + tv.tv_usec / 1000 - worker->BaseTime);
  118. }
  119. extern uint64_t GetCurrentTime() {
  120. struct timeval tv;
  121. gettimeofday(&tv, NULL);
  122. return ((uint64_t) (tv.tv_sec)) * 1000 + tv.tv_usec / 1000;
  123. //static struct timeb t1;
  124. // ftime(&t1);
  125. // return (uint64_t) ((t1.time * 1000 + t1.millitm));
  126. }
  127. extern uint64_t GetCurrentMicroTime() {
  128. struct timeval tv;
  129. gettimeofday(&tv, NULL);
  130. return ((uint64_t) tv.tv_sec * 1000000 + tv.tv_usec);
  131. }
  132. extern uint64_t GetNextTimeTick(SnowFlakeWorker *worker) {
  133. uint64_t tempTimeTicker = GetCurrentTimeTick(worker);
  134. while (tempTimeTicker <= worker->_LastTimeTick) {
  135. tempTimeTicker = GetCurrentTimeTick(worker);
  136. }
  137. return tempTimeTicker;
  138. }

雪花算法中非常好用的数字ID生成器