task_queue.go 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424
  1. package task_queue
  2. import (
  3. "errors"
  4. "fmt"
  5. "github.com/allanpk716/ChineseSubFinder/internal/pkg/settings"
  6. "github.com/allanpk716/ChineseSubFinder/internal/types/task_queue"
  7. taskQueue2 "github.com/allanpk716/ChineseSubFinder/internal/types/task_queue"
  8. "github.com/dgraph-io/badger/v3"
  9. "github.com/emirpasic/gods/maps/treemap"
  10. "github.com/sirupsen/logrus"
  11. "sync"
  12. "time"
  13. )
  14. type TaskQueue struct {
  15. queueName string
  16. settings *settings.Settings
  17. log *logrus.Logger
  18. taskPriorityMapList []*treemap.Map
  19. taskKeyMap *treemap.Map
  20. queueLock sync.Mutex // 公用这个锁
  21. }
  22. func NewTaskQueue(queueName string, settings *settings.Settings, log *logrus.Logger) *TaskQueue {
  23. tq := &TaskQueue{queueName: queueName, settings: settings, log: log,
  24. taskPriorityMapList: make([]*treemap.Map, 0),
  25. taskKeyMap: treemap.NewWithStringComparator(),
  26. }
  27. for i := 0; i <= taskPriorityCount; i++ {
  28. tq.taskPriorityMapList = append(tq.taskPriorityMapList, treemap.NewWithStringComparator())
  29. }
  30. tq.read()
  31. return tq
  32. }
  33. func (t *TaskQueue) QueueName() string {
  34. return t.queueName
  35. }
  36. func (t *TaskQueue) Clear() error {
  37. defer t.queueLock.Unlock()
  38. t.queueLock.Lock()
  39. err := GetDb().Update(
  40. func(tx *badger.Txn) error {
  41. var err error
  42. for i := 0; i <= taskPriorityCount; i++ {
  43. key := []byte(MergeBucketAndKeyName(BucketNamePrefixVideoSubDownloadQueue,
  44. fmt.Sprintf("%s_%d", t.queueName, i)))
  45. // 因为已经查询了一次,确保一定存在,所以直接更新+1,TTL 多加 5s 确保今天过去,暂时去除 TTL uint32(restOfDaySecond.Seconds())+5
  46. if err = tx.Delete(key); err != nil {
  47. return err
  48. }
  49. }
  50. return nil
  51. })
  52. if err != nil {
  53. return err
  54. }
  55. for i := 0; i <= taskPriorityCount; i++ {
  56. t.taskPriorityMapList[i].Clear()
  57. }
  58. t.taskKeyMap.Clear()
  59. return nil
  60. }
  61. // Size 队列的长度,对外暴露,有锁
  62. func (t *TaskQueue) Size() int {
  63. defer t.queueLock.Unlock()
  64. t.queueLock.Lock()
  65. return t.taskKeyMap.Size()
  66. }
  67. func (t *TaskQueue) checkPriority(oneJob taskQueue2.OneJob) taskQueue2.OneJob {
  68. if oneJob.TaskPriority > taskPriorityCount {
  69. oneJob.TaskPriority = taskPriorityCount
  70. }
  71. if oneJob.TaskPriority < 0 {
  72. oneJob.TaskPriority = 0
  73. }
  74. return oneJob
  75. }
  76. func (t *TaskQueue) degrade(oneJob taskQueue2.OneJob) taskQueue2.OneJob {
  77. oneJob.TaskPriority -= 1
  78. return t.checkPriority(oneJob)
  79. }
  80. // Add 放入元素,放入的时候会根据 TaskPriority 进行归类,存在的不会新增和更新
  81. func (t *TaskQueue) Add(oneJob task_queue.OneJob) (bool, error) {
  82. defer t.queueLock.Unlock()
  83. t.queueLock.Lock()
  84. if t.isExist(oneJob.Id) == true {
  85. return false, nil
  86. }
  87. // 检查权限范围
  88. oneJob = t.checkPriority(oneJob)
  89. // 插入到统一的 KeyMap
  90. t.taskKeyMap.Put(oneJob.Id, oneJob.TaskPriority)
  91. // 分配到具体的优先级 map 中
  92. t.taskPriorityMapList[oneJob.TaskPriority].Put(oneJob.Id, oneJob)
  93. err := t.save(oneJob.TaskPriority)
  94. if err != nil {
  95. return false, err
  96. }
  97. return true, nil
  98. }
  99. // Update 更新素,不存在则会失败
  100. func (t *TaskQueue) Update(oneJob task_queue.OneJob) (bool, error) {
  101. defer t.queueLock.Unlock()
  102. t.queueLock.Lock()
  103. if t.isExist(oneJob.Id) == false {
  104. return false, nil
  105. }
  106. // 自动更新时间
  107. oneJob.UpdateTime = time.Now()
  108. // 这里需要判断是否有优先级的 Update,如果有就需要把之前缓存的表给更新
  109. // 然后再插入到新的表中
  110. taskPriorityIndex, _ := t.taskKeyMap.Get(oneJob.Id)
  111. // 检查权限范围
  112. oneJob = t.checkPriority(oneJob)
  113. if oneJob.TaskPriority != taskPriorityIndex {
  114. // 优先级修改
  115. // 先删除原有的优先级
  116. t.taskPriorityMapList[taskPriorityIndex.(int)].Remove(oneJob.Id)
  117. err := t.save(taskPriorityIndex.(int))
  118. if err != nil {
  119. return false, err
  120. }
  121. }
  122. // 插入到统一的 KeyMap
  123. t.taskKeyMap.Put(oneJob.Id, oneJob.TaskPriority)
  124. // 分配到具体的优先级 map 中
  125. t.taskPriorityMapList[oneJob.TaskPriority].Put(oneJob.Id, oneJob)
  126. err := t.save(oneJob.TaskPriority)
  127. if err != nil {
  128. return false, err
  129. }
  130. return true, nil
  131. }
  132. // AutoDetectUpdateJobStatus 根据任务的生命周期图,进行自动判断更新,见《任务的生命周期》流程图
  133. func (t *TaskQueue) AutoDetectUpdateJobStatus(oneJob task_queue.OneJob, inErr error) {
  134. defer t.queueLock.Unlock()
  135. t.queueLock.Lock()
  136. // 检查权限范围
  137. oneJob = t.checkPriority(oneJob)
  138. if inErr == nil {
  139. // 没有错误就是完成
  140. oneJob.JobStatus = taskQueue2.Done
  141. } else {
  142. // 超过了时间限制,默认是 90 天, A.Before(B) : A < B
  143. if oneJob.AddedTime.AddDate(0, 0, t.settings.AdvancedSettings.TaskQueue.ExpirationTime).Before(time.Now()) == true {
  144. // 超过 90 天了
  145. oneJob.JobStatus = taskQueue2.Failed
  146. } else {
  147. // 还在 90 天内
  148. // 是否是首次,那么就看它的 Level 是否是在 5,然后 retry == 0
  149. if oneJob.TaskPriority == DefaultTaskPriorityLevel && oneJob.RetryTimes == 0 {
  150. // 需要重置到 L6
  151. oneJob.RetryTimes = 0
  152. oneJob.TaskPriority = FirstRetryTaskPriorityLevel
  153. } else {
  154. if oneJob.RetryTimes > t.settings.AdvancedSettings.TaskQueue.MaxRetryTimes {
  155. // 超过重试次数会进行一次降级,然后重置这个次数
  156. oneJob.RetryTimes = 0
  157. oneJob = t.degrade(oneJob)
  158. }
  159. }
  160. // 强制为 waiting
  161. oneJob.JobStatus = taskQueue2.Waiting
  162. }
  163. // 传入的错误需要放进来
  164. oneJob.ErrorInfo = inErr.Error()
  165. }
  166. bok, err := t.Update(oneJob)
  167. if err != nil {
  168. t.log.Errorln("AutoDetectUpdateJobStatus", oneJob.VideoFPath, err)
  169. return
  170. }
  171. if bok == false {
  172. t.log.Warningln("AutoDetectUpdateJobStatus ==", oneJob.VideoFPath, "Job.ID", oneJob.Id, "Not Found")
  173. return
  174. }
  175. }
  176. // GetOneWaitingJob 获取一个元素,按优先级,0 - taskPriorityCount 的级别去拿去任务,不会移除任务
  177. func (t *TaskQueue) GetOneWaitingJob() (bool, task_queue.OneJob, error) {
  178. defer t.queueLock.Unlock()
  179. t.queueLock.Lock()
  180. // 如果队列里面没有东西,则返回 false
  181. if t.isEmpty() == true {
  182. return false, task_queue.OneJob{}, nil
  183. }
  184. found := false
  185. tOneJob := task_queue.OneJob{}
  186. for TaskPriority := 0; TaskPriority <= taskPriorityCount; TaskPriority++ {
  187. t.taskPriorityMapList[TaskPriority].Each(func(key interface{}, value interface{}) {
  188. tOneJob = value.(task_queue.OneJob)
  189. if tOneJob.JobStatus == task_queue.Waiting {
  190. // 找到就返回
  191. found = true
  192. return
  193. }
  194. })
  195. if found == true {
  196. return true, tOneJob, nil
  197. }
  198. }
  199. return false, tOneJob, nil
  200. }
  201. func (t *TaskQueue) GetJobsByStatus(status task_queue.JobStatus) (bool, []task_queue.OneJob, error) {
  202. defer t.queueLock.Unlock()
  203. t.queueLock.Lock()
  204. outOneJobs := make([]task_queue.OneJob, 0)
  205. // 如果队列里面没有东西,则返回 false
  206. if t.isEmpty() == true {
  207. return false, nil, nil
  208. }
  209. for TaskPriority := 0; TaskPriority <= taskPriorityCount; TaskPriority++ {
  210. t.taskPriorityMapList[TaskPriority].Each(func(key interface{}, value interface{}) {
  211. tOneJob := task_queue.OneJob{}
  212. tOneJob = value.(task_queue.OneJob)
  213. if tOneJob.JobStatus == status {
  214. // 找到加入列表
  215. outOneJobs = append(outOneJobs, tOneJob)
  216. }
  217. })
  218. }
  219. return true, outOneJobs, nil
  220. }
  221. // GetJobsByPriorityAndStatus 根据任务优先级和状态获取任务列表
  222. func (t *TaskQueue) GetJobsByPriorityAndStatus(taskPriority int, status task_queue.JobStatus) (bool, []task_queue.OneJob, error) {
  223. defer t.queueLock.Unlock()
  224. t.queueLock.Lock()
  225. outOneJobs := make([]task_queue.OneJob, 0)
  226. // 如果队列里面没有东西,则返回 false
  227. if t.isEmpty() == true {
  228. return false, nil, nil
  229. }
  230. t.taskPriorityMapList[taskPriority].Each(func(key interface{}, value interface{}) {
  231. tOneJob := task_queue.OneJob{}
  232. tOneJob = value.(task_queue.OneJob)
  233. if tOneJob.JobStatus == status {
  234. // 找到加入列表
  235. outOneJobs = append(outOneJobs, tOneJob)
  236. }
  237. })
  238. return true, outOneJobs, nil
  239. }
  240. // Del 删除一个元素
  241. func (t *TaskQueue) Del(jobId string) (bool, error) {
  242. defer t.queueLock.Unlock()
  243. t.queueLock.Lock()
  244. if t.isExist(jobId) == false {
  245. return false, nil
  246. }
  247. taskPriority, bok := t.taskKeyMap.Get(jobId)
  248. if bok == false {
  249. return false, nil
  250. }
  251. t.taskKeyMap.Remove(jobId)
  252. t.taskPriorityMapList[taskPriority.(int)].Remove(jobId)
  253. err := t.save(taskPriority.(int))
  254. if err != nil {
  255. return false, err
  256. }
  257. return true, nil
  258. }
  259. func (t *TaskQueue) read() {
  260. err := GetDb().View(
  261. func(tx *badger.Txn) error {
  262. var err error
  263. for i := 0; i <= taskPriorityCount; i++ {
  264. key := []byte(MergeBucketAndKeyName(BucketNamePrefixVideoSubDownloadQueue,
  265. fmt.Sprintf("%s_%d", t.queueName, i)))
  266. var item *badger.Item
  267. item, err = tx.Get(key)
  268. if err != nil {
  269. if IsErrOk(err) == true {
  270. return nil
  271. }
  272. return err
  273. }
  274. valCopy, err := item.ValueCopy(nil)
  275. if err != nil {
  276. return err
  277. }
  278. err = t.taskPriorityMapList[i].FromJSON(valCopy)
  279. if err != nil {
  280. return err
  281. }
  282. }
  283. return nil
  284. })
  285. if err != nil {
  286. t.log.Panicln(err)
  287. }
  288. // 需要把几个优先级的map中的key汇总
  289. for i := 0; i < taskPriorityCount; i++ {
  290. t.taskPriorityMapList[i].Each(func(key interface{}, value interface{}) {
  291. t.taskKeyMap.Put(key, i)
  292. })
  293. }
  294. }
  295. // save 需要把改变的数据保持到 K/V 数据库中,这个没有锁,所以需要在 Sync 中使用,不对外开放
  296. func (t *TaskQueue) save(taskPriority int) error {
  297. err := GetDb().Update(
  298. func(tx *badger.Txn) error {
  299. var err error
  300. key := []byte(MergeBucketAndKeyName(BucketNamePrefixVideoSubDownloadQueue,
  301. fmt.Sprintf("%s_%d", t.queueName, taskPriority)))
  302. if err != nil {
  303. return err
  304. }
  305. b, err := t.taskPriorityMapList[taskPriority].ToJSON()
  306. if err != nil {
  307. return err
  308. }
  309. e := badger.NewEntry(key, b)
  310. err = tx.SetEntry(e)
  311. if err != nil {
  312. return err
  313. }
  314. return nil
  315. })
  316. if err != nil {
  317. return err
  318. }
  319. return nil
  320. }
  321. // isExist 是否已经存在,对内,无锁
  322. func (t *TaskQueue) isExist(jobID string) bool {
  323. _, bok := t.taskKeyMap.Get(jobID)
  324. return bok
  325. }
  326. // IsExist 是否已经存在,对外,有锁
  327. func (t *TaskQueue) IsExist(jobID string) bool {
  328. defer t.queueLock.Unlock()
  329. t.queueLock.Lock()
  330. _, bok := t.taskKeyMap.Get(jobID)
  331. return bok
  332. }
  333. // isEmpty 对内,无锁
  334. func (t *TaskQueue) isEmpty() bool {
  335. return t.taskKeyMap.Empty()
  336. }
  337. const (
  338. taskPriorityCount = 10
  339. DefaultTaskPriorityLevel = 5
  340. FirstRetryTaskPriorityLevel = 6
  341. )
  342. var (
  343. ErrNotSubFound = errors.New("Not Sub Found")
  344. )