• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

taosdata / TDengine / #3608

12 Feb 2025 05:57AM UTC coverage: 63.066% (+1.4%) from 61.715%
#3608

push

travis-ci

web-flow
Merge pull request #29746 from taosdata/merge/mainto3.02

merge: from main to 3.0 branch

140199 of 286257 branches covered (48.98%)

Branch coverage included in aggregate %.

89 of 161 new or added lines in 18 files covered. (55.28%)

3211 existing lines in 190 files now uncovered.

218998 of 283298 relevant lines covered (77.3%)

5949310.66 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

73.36
/source/libs/stream/src/streamQueue.c
1
/*
2
 * Copyright (c) 2019 TAOS Data, Inc. <jhtao@taosdata.com>
3
 *
4
 * This program is free software: you can use, redistribute, and/or modify
5
 * it under the terms of the GNU Affero General Public License, version 3
6
 * or later ("AGPL"), as published by the Free Software Foundation.
7
 *
8
 * This program is distributed in the hope that it will be useful, but WITHOUT
9
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10
 * FITNESS FOR A PARTICULAR PURPOSE.
11
 *
12
 * You should have received a copy of the GNU Affero General Public License
13
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
14
 */
15

16
#include "streamInt.h"
17

18
#define MAX_STREAM_EXEC_BATCH_NUM 32
19
#define MAX_SMOOTH_BURST_RATIO    5  // 5 sec
20

21
// todo refactor:
22
// read data from input queue
23
typedef struct SQueueReader {
24
  SStreamQueue* pQueue;
25
  int32_t       taskLevel;
26
  int32_t       maxBlocks;     // maximum block in one batch
27
  int32_t       waitDuration;  // maximum wait time to format several block into a batch to process, unit: ms
28
} SQueueReader;
29

30
#define streamQueueCurItem(_q) ((_q)->qItem)
31

32
static bool streamTaskExtractAvailableToken(STokenBucket* pBucket, const char* id);
33
static void streamTaskPutbackToken(STokenBucket* pBucket);
34
static void streamTaskConsumeQuota(STokenBucket* pBucket, int32_t bytes);
35

36
static void streamQueueCleanup(SStreamQueue* pQueue) {
17,710✔
37
  SStreamQueueItem* qItem = NULL;
17,710✔
38
  while (1) {
39
    streamQueueNextItem(pQueue, &qItem);
17,805✔
40
    if (qItem == NULL) {
17,805✔
41
      break;
17,710✔
42
    }
43
    streamFreeQitem(qItem);
95✔
44
  }
45
  pQueue->status = STREAM_QUEUE__SUCESS;
17,710✔
46
}
17,710✔
47

48
int32_t streamQueueOpen(int64_t cap, SStreamQueue** pQ) {
18,005✔
49
  *pQ = NULL;
18,005✔
50
  int32_t code = 0;
18,005✔
51

52
  SStreamQueue* pQueue = taosMemoryCalloc(1, sizeof(SStreamQueue));
18,005!
53
  if (pQueue == NULL) {
18,005!
54
    return terrno;
×
55
  }
56

57
  code = taosOpenQueue(&pQueue->pQueue);
18,005✔
58
  if (code) {
18,006!
59
    taosMemoryFreeClear(pQueue);
×
60
    return code;
×
61
  }
62

63
  code = taosAllocateQall(&pQueue->qall);
18,006✔
64
  if (code) {
18,006!
65
    taosCloseQueue(pQueue->pQueue);
×
66
    taosMemoryFree(pQueue);
×
67
    return code;
×
68
  }
69

70
  pQueue->status = STREAM_QUEUE__SUCESS;
18,006✔
71
  taosSetQueueCapacity(pQueue->pQueue, cap);
18,006✔
72
  taosSetQueueMemoryCapacity(pQueue->pQueue, cap * 1024);
18,006✔
73

74
  *pQ = pQueue;
18,006✔
75
  return code;
18,006✔
76
}
77

78
void streamQueueClose(SStreamQueue* pQueue, int32_t taskId) {
17,710✔
79
  stDebug("s-task:0x%x free the queue:%p, items in queue:%d", taskId, pQueue->pQueue,
17,710✔
80
          taosQueueItemSize(pQueue->pQueue));
81
  streamQueueCleanup(pQueue);
17,710✔
82

83
  taosFreeQall(pQueue->qall);
17,710✔
84
  taosCloseQueue(pQueue->pQueue);
17,710✔
85
  taosMemoryFree(pQueue);
17,710!
86
}
17,710✔
87

88
void streamQueueNextItem(SStreamQueue* pQueue, SStreamQueueItem** pItem) {
175,716✔
89
  *pItem = NULL;
175,716✔
90
  int8_t flag = atomic_exchange_8(&pQueue->status, STREAM_QUEUE__PROCESSING);
175,716✔
91

92
  if (flag == STREAM_QUEUE__FAILED) {
175,717✔
93
    *pItem = streamQueueCurItem(pQueue);
2,176✔
94
  } else {
95
    pQueue->qItem = NULL;
173,541✔
96
    (void) taosGetQitem(pQueue->qall, &pQueue->qItem);
173,541✔
97
    if (pQueue->qItem == NULL) {
173,542✔
98
      (void) taosReadAllQitems(pQueue->pQueue, pQueue->qall);
120,574✔
99
      (void) taosGetQitem(pQueue->qall, &pQueue->qItem);
120,574✔
100
    }
101

102
    *pItem = streamQueueCurItem(pQueue);
173,542✔
103
  }
104
}
175,718✔
105

106
void streamQueueProcessSuccess(SStreamQueue* queue) {
70,250✔
107
  if (atomic_load_8(&queue->status) != STREAM_QUEUE__PROCESSING) {
70,250!
108
    stError("invalid queue status:%d, expect:%d", atomic_load_8(&queue->status), STREAM_QUEUE__PROCESSING);
×
109
    return;
×
110
  }
111

112
  queue->qItem = NULL;
70,250✔
113
  atomic_store_8(&queue->status, STREAM_QUEUE__SUCESS);
70,250✔
114
}
115

116
void streamQueueProcessFail(SStreamQueue* queue) {
2,176✔
117
  if (atomic_load_8(&queue->status) != STREAM_QUEUE__PROCESSING) {
2,176!
118
    stError("invalid queue status:%d, expect:%d", atomic_load_8(&queue->status), STREAM_QUEUE__PROCESSING);
×
119
    return;
×
120
  }
121
  atomic_store_8(&queue->status, STREAM_QUEUE__FAILED);
2,176✔
122
}
123

124
bool streamQueueIsFull(const SStreamQueue* pQueue) {
194,618✔
125
  int32_t numOfItems = streamQueueGetNumOfItems(pQueue);
194,618✔
126
  if (numOfItems >= STREAM_TASK_QUEUE_CAPACITY) {
194,617!
UNCOV
127
    return true;
×
128
  }
129

130
  return (SIZE_IN_MiB(taosQueueMemorySize(pQueue->pQueue)) >= STREAM_TASK_QUEUE_CAPACITY_IN_SIZE);
194,617✔
131
}
132

133
int32_t streamQueueGetNumOfItems(const SStreamQueue* pQueue) {
384,770✔
134
  int32_t numOfItems1 = taosQueueItemSize(pQueue->pQueue);
384,770✔
135
  int32_t numOfItems2 = taosQallItemSize(pQueue->qall);
384,778✔
136

137
  return numOfItems1 + numOfItems2;
384,776✔
138
}
139

140
int32_t streamQueueGetNumOfUnAccessedItems(const SStreamQueue* pQueue) {
20,345✔
141
  int32_t numOfItems1 = taosQueueItemSize(pQueue->pQueue);
20,345✔
142
  int32_t numOfItems2 = taosQallUnAccessedItemSize(pQueue->qall);
20,345✔
143

144
  return numOfItems1 + numOfItems2;
20,345✔
145
}
146

147
int32_t streamQueueGetItemSize(const SStreamQueue* pQueue) {
23,070✔
148
  return taosQueueMemorySize(pQueue->pQueue) + taosQallUnAccessedMemSize(pQueue->qall);
23,070✔
149
}
150

151
int32_t streamQueueItemGetSize(const SStreamQueueItem* pItem) {
70,250✔
152
  STaosQnode* p = (STaosQnode*)((char*)pItem - sizeof(STaosQnode));
70,250✔
153
  return p->dataSize;
70,250✔
154
}
155

156
void streamQueueItemIncSize(const SStreamQueueItem* pItem, int32_t size) {
46,581✔
157
  STaosQnode* p = (STaosQnode*)((char*)pItem - sizeof(STaosQnode));
46,581✔
158
  p->dataSize += size;
46,581✔
159
}
46,581✔
160

161
const char* streamQueueItemGetTypeStr(int32_t type) {
50,172✔
162
  switch (type) {
50,172✔
163
    case STREAM_INPUT__CHECKPOINT:
2,810✔
164
      return "checkpoint";
2,810✔
165
    case STREAM_INPUT__CHECKPOINT_TRIGGER:
13,058✔
166
      return "checkpoint-trigger";
13,058✔
167
    case STREAM_INPUT__TRANS_STATE:
12,717✔
168
      return "trans-state";
12,717✔
169
    case STREAM_INPUT__REF_DATA_BLOCK:
3,883✔
170
      return "ref-block";
3,883✔
171
    default:
17,704✔
172
      return "datablock";
17,704✔
173
  }
174
}
175

176
EExtractDataCode streamTaskGetDataFromInputQ(SStreamTask* pTask, SStreamQueueItem** pInput, int32_t* numOfBlocks,
70,142✔
177
                                             int32_t* blockSize) {
178
  const char* id = pTask->id.idStr;
70,142✔
179
  int32_t     taskLevel = pTask->info.taskLevel;
70,142✔
180

181
  *pInput = NULL;
70,142✔
182
  *numOfBlocks = 0;
70,142✔
183
  *blockSize = 0;
70,142✔
184

185
  // no available token in bucket for sink task, let's wait for a little bit
186
  if (taskLevel == TASK_LEVEL__SINK && (!streamTaskExtractAvailableToken(pTask->outputInfo.pTokenBucket, id))) {
70,142!
187
    stDebug("s-task:%s no available token in bucket for sink data, wait for 10ms", id);
×
188
    return EXEC_AFTER_IDLE;
×
189
  }
190

191
  while (1) {
69,588✔
192
    if (streamTaskShouldPause(pTask) || streamTaskShouldStop(pTask)) {
139,730!
193
      stDebug("s-task:%s task should pause, extract input blocks:%d", id, *numOfBlocks);
×
194
      return EXEC_CONTINUE;
70,142✔
195
    }
196

197
    SStreamQueueItem* qItem = NULL;
139,730✔
198
    streamQueueNextItem(pTask->inputq.queue, (SStreamQueueItem**)&qItem);
139,730✔
199
    if (qItem == NULL) {
139,730✔
200
      // restore the token to bucket
201
      if (*numOfBlocks > 0) {
52,816✔
202
        *blockSize = streamQueueItemGetSize(*pInput);
20,831✔
203
        if (taskLevel == TASK_LEVEL__SINK) {
20,831✔
204
          streamTaskConsumeQuota(pTask->outputInfo.pTokenBucket, *blockSize);
5,534✔
205
        }
206
      } else {
207
        streamTaskPutbackToken(pTask->outputInfo.pTokenBucket);
31,985✔
208
      }
209

210
      return EXEC_CONTINUE;
52,816✔
211
    }
212

213
    // do not merge blocks for sink node and check point data block
214
    int8_t type = qItem->type;
86,914✔
215
    if (type == STREAM_INPUT__CHECKPOINT || type == STREAM_INPUT__CHECKPOINT_TRIGGER ||
86,914✔
216
        type == STREAM_INPUT__TRANS_STATE || type == STREAM_INPUT__REF_DATA_BLOCK) {
72,865✔
217
      const char* p = streamQueueItemGetTypeStr(type);
16,528✔
218

219
      if (*pInput == NULL) {
16,528✔
220
        stDebug("s-task:%s %s msg extracted, start to process immediately", id, p);
14,488✔
221

222
        // restore the token to bucket in case of checkpoint/trans-state msg
223
        streamTaskPutbackToken(pTask->outputInfo.pTokenBucket);
14,488✔
224
        *blockSize = 0;
14,488✔
225
        *numOfBlocks = 1;
14,488✔
226
        *pInput = qItem;
14,488✔
227
        return EXEC_CONTINUE;
14,488✔
228
      } else {  // previous existed blocks needs to be handle, before handle the checkpoint msg block
229
        stDebug("s-task:%s %s msg extracted, handle previous blocks, numOfBlocks:%d", id, p, *numOfBlocks);
2,040!
230
        *blockSize = streamQueueItemGetSize(*pInput);
2,040✔
231
        if (taskLevel == TASK_LEVEL__SINK) {
2,040✔
232
          streamTaskConsumeQuota(pTask->outputInfo.pTokenBucket, *blockSize);
778✔
233
        }
234

235
        streamQueueProcessFail(pTask->inputq.queue);
2,040✔
236
        return EXEC_CONTINUE;
2,040✔
237
      }
238
    } else {
239
      if (*pInput == NULL) {
70,386✔
240
        *pInput = qItem;
23,669✔
241
      } else { // merge current block failed, let's handle the already merged blocks.
242
        void*   newRet = NULL;
46,717✔
243
        int32_t code = streamQueueMergeQueueItem(*pInput, qItem, (SStreamQueueItem**)&newRet);
46,717✔
244
        if (newRet == NULL) {
46,717✔
245
          if (code != -1) {
136!
246
            stError("s-task:%s failed to merge blocks from inputQ, numOfBlocks:%d, code:%s", id, *numOfBlocks,
×
247
                    tstrerror(code));
248
          }
249

250
          *blockSize = streamQueueItemGetSize(*pInput);
136✔
251
          if (taskLevel == TASK_LEVEL__SINK) {
136!
252
            streamTaskConsumeQuota(pTask->outputInfo.pTokenBucket, *blockSize);
×
253
          }
254

255
          streamQueueProcessFail(pTask->inputq.queue);
136✔
256
          return EXEC_CONTINUE;
136✔
257
        }
258

259
        *pInput = newRet;
46,581✔
260
      }
261

262
      *numOfBlocks += 1;
70,250✔
263
      streamQueueProcessSuccess(pTask->inputq.queue);
70,250✔
264

265
      if (*numOfBlocks >= MAX_STREAM_EXEC_BATCH_NUM) {
70,250✔
266
        stDebug("s-task:%s batch size limit:%d reached, start to process blocks", id, MAX_STREAM_EXEC_BATCH_NUM);
662✔
267

268
        *blockSize = streamQueueItemGetSize(*pInput);
662✔
269
        if (taskLevel == TASK_LEVEL__SINK) {
662✔
270
          streamTaskConsumeQuota(pTask->outputInfo.pTokenBucket, *blockSize);
4✔
271
        }
272

273
        return EXEC_CONTINUE;
662✔
274
      }
275
    }
276
  }
277
}
278

279
int32_t streamTaskPutDataIntoInputQ(SStreamTask* pTask, SStreamQueueItem* pItem) {
84,819✔
280
  int8_t      type = pItem->type;
84,819✔
281
  STaosQueue* pQueue = pTask->inputq.queue->pQueue;
84,819✔
282
  int32_t     total = streamQueueGetNumOfItems(pTask->inputq.queue) + 1;
84,819✔
283

284
  if (type == STREAM_INPUT__DATA_SUBMIT) {
84,821✔
285
    SStreamDataSubmit* px = (SStreamDataSubmit*)pItem;
56,061✔
286
    if ((pTask->info.taskLevel == TASK_LEVEL__SOURCE) && streamQueueIsFull(pTask->inputq.queue)) {
56,061!
UNCOV
287
      double size = SIZE_IN_MiB(taosQueueMemorySize(pQueue));
×
UNCOV
288
      stTrace(
×
289
          "s-task:%s inputQ is full, capacity(size:%d num:%dMiB), current(blocks:%d, size:%.2fMiB) stop to push data",
290
          pTask->id.idStr, STREAM_TASK_QUEUE_CAPACITY, STREAM_TASK_QUEUE_CAPACITY_IN_SIZE, total, size);
UNCOV
291
      streamDataSubmitDestroy(px);
×
UNCOV
292
      return TSDB_CODE_STREAM_INPUTQ_FULL;
×
293
    }
294

295
    int32_t msgLen = px->submit.msgLen;
56,061✔
296
    int64_t ver = px->submit.ver;
56,061✔
297

298
    int32_t code = taosWriteQitem(pQueue, pItem);
56,061✔
299
    if (code != TSDB_CODE_SUCCESS) {
56,061!
300
      streamDataSubmitDestroy(px);
×
301
      return code;
×
302
    }
303

304
    double size = SIZE_IN_MiB(taosQueueMemorySize(pQueue));
56,061✔
305

306
    // use the local variable to avoid the pItem be freed by other threads, since it has been put into queue already.
307
    stDebug("s-task:%s submit enqueue msgLen:%d ver:%" PRId64 ", total in queue:%d, size:%.2fMiB", pTask->id.idStr,
56,061✔
308
            msgLen, ver, total, size + SIZE_IN_MiB(msgLen));
309
  } else if (type == STREAM_INPUT__DATA_BLOCK || type == STREAM_INPUT__REF_DATA_BLOCK) {
39,715✔
310
    if (streamQueueIsFull(pTask->inputq.queue)) {
10,955!
311
      double size = SIZE_IN_MiB(taosQueueMemorySize(pQueue));
×
312

313
      stTrace("s-task:%s input queue is full, capacity:%d size:%d MiB, current(blocks:%d, size:%.2fMiB) abort",
×
314
              pTask->id.idStr, STREAM_TASK_QUEUE_CAPACITY, STREAM_TASK_QUEUE_CAPACITY_IN_SIZE, total, size);
315
      streamFreeQitem(pItem);
×
316
      return TSDB_CODE_STREAM_INPUTQ_FULL;
×
317
    }
318

319
    int32_t code = taosWriteQitem(pQueue, pItem);
10,955✔
320
    if (code != TSDB_CODE_SUCCESS) {
10,955!
321
      streamFreeQitem(pItem);
×
322
      return code;
×
323
    }
324

325
    double size = SIZE_IN_MiB(taosQueueMemorySize(pQueue));
10,955✔
326
    stDebug("s-task:%s blockdata enqueue, total in queue:%d, size:%.2fMiB", pTask->id.idStr, total, size);
10,955✔
327
  } else if (type == STREAM_INPUT__CHECKPOINT || type == STREAM_INPUT__CHECKPOINT_TRIGGER ||
17,805✔
328
             type == STREAM_INPUT__TRANS_STATE || type == STREAM_INPUT__DATA_RETRIEVE) {
18,253✔
329
    int32_t code = taosWriteQitem(pQueue, pItem);
13,574✔
330
    if (code != TSDB_CODE_SUCCESS) {
13,574!
331
      streamFreeQitem(pItem);
×
332
      return code;
×
333
    }
334

335
    double size = SIZE_IN_MiB(taosQueueMemorySize(pQueue));
13,574✔
336
    stDebug("s-task:%s level:%d %s blockdata enqueue, total in queue:%d, size:%.2fMiB", pTask->id.idStr,
13,574✔
337
            pTask->info.taskLevel, streamQueueItemGetTypeStr(type), total, size);
338
  } else if (type == STREAM_INPUT__GET_RES) {
4,231!
339
    // use the default memory limit, refactor later.
340
    int32_t code = taosWriteQitem(pQueue, pItem);
4,231✔
341
    if (code != TSDB_CODE_SUCCESS) {
4,231!
342
      streamFreeQitem(pItem);
×
343
      return code;
×
344
    }
345

346
    double size = SIZE_IN_MiB(taosQueueMemorySize(pQueue));
4,231✔
347
    stDebug("s-task:%s data res enqueue, current(blocks:%d, size:%.2fMiB)", pTask->id.idStr, total, size);
4,231!
348
  } else {
349
    stError("s-task:%s invalid type:%d to put in inputQ", pTask->id.idStr, type);
×
350
    return TSDB_CODE_INVALID_PARA;
×
351
  }
352

353
  if (type != STREAM_INPUT__GET_RES && type != STREAM_INPUT__CHECKPOINT && type != STREAM_INPUT__CHECKPOINT_TRIGGER &&
84,821✔
354
      (pTask->info.delaySchedParam != 0)) {
73,353✔
355
    (void)atomic_val_compare_exchange_8(&pTask->schedInfo.status, TASK_TRIGGER_STATUS__INACTIVE,
10,103✔
356
                                        TASK_TRIGGER_STATUS__MAY_ACTIVE);
357
    stDebug("s-task:%s new data arrived, active the sched-trigger, triggerStatus:%d", pTask->id.idStr,
10,103!
358
            pTask->schedInfo.status);
359
  }
360

361
  return 0;
84,821✔
362
}
363

364
int32_t streamTaskPutTranstateIntoInputQ(SStreamTask* pTask) {
1,404✔
365
  int32_t           code = 0;
1,404✔
366
  SStreamDataBlock* pTranstate = NULL;
1,404✔
367
  SSDataBlock*      pBlock = NULL;
1,404✔
368

369
  code = taosAllocateQitem(sizeof(SStreamDataBlock), DEF_QITEM, sizeof(SSDataBlock), (void**)&pTranstate);
1,404✔
370
  if (code) {
1,404!
371
    return code;
×
372
  }
373

374
  pBlock = taosMemoryCalloc(1, sizeof(SSDataBlock));
1,404!
375
  if (pBlock == NULL) {
1,404!
376
    code = terrno;
×
377
    goto _err;
×
378
  }
379

380
  pTranstate->type = STREAM_INPUT__TRANS_STATE;
1,404✔
381

382
  pBlock->info.type = STREAM_TRANS_STATE;
1,404✔
383
  pBlock->info.rows = 1;
1,404✔
384
  pBlock->info.childId = pTask->info.selfChildId;
1,404✔
385

386
  pTranstate->blocks = taosArrayInit(4, sizeof(SSDataBlock));  // pBlock;
1,404✔
387
  if (pTranstate->blocks == NULL) {
1,404!
388
    code = terrno;
×
389
    goto _err;
×
390
  }
391

392
  void* p = taosArrayPush(pTranstate->blocks, pBlock);
1,404✔
393
  if (p == NULL) {
1,404!
394
    code = terrno;
×
395
    goto _err;
×
396
  }
397

398
  taosMemoryFree(pBlock);
1,404!
399
  if (streamTaskPutDataIntoInputQ(pTask, (SStreamQueueItem*)pTranstate) < 0) {
1,404!
400
    code = TSDB_CODE_OUT_OF_MEMORY;
×
401
    goto _err;
×
402
  }
403

404
  pTask->status.appendTranstateBlock = true;
1,404✔
405
  return TSDB_CODE_SUCCESS;
1,404✔
406

407
_err:
×
408
  taosMemoryFree(pBlock);
×
409
  taosFreeQitem(pTranstate);
×
410
  return code;
×
411
}
412

413
// the result should be put into the outputQ in any cases, the result may be lost otherwise.
414
int32_t streamTaskPutDataIntoOutputQ(SStreamTask* pTask, SStreamDataBlock* pBlock) {
8,064✔
415
  STaosQueue* pQueue = pTask->outputq.queue->pQueue;
8,064✔
416
  int32_t     code = taosWriteQitem(pQueue, pBlock);
8,064✔
417

418
  int32_t total = streamQueueGetNumOfItems(pTask->outputq.queue);
8,064✔
419
  double  size = SIZE_IN_MiB(taosQueueMemorySize(pQueue));
8,064✔
420
  if (code != 0) {
8,064!
421
    stError("s-task:%s failed to put res into outputQ, outputQ items:%d, size:%.2fMiB code:%s, result lost",
×
422
            pTask->id.idStr, total + 1, size, tstrerror(code));
423
  } else {
424
    if (streamQueueIsFull(pTask->outputq.queue)) {
8,064!
425
      stWarn(
×
426
          "s-task:%s outputQ is full(outputQ items:%d, size:%.2fMiB), set the output status BLOCKING, wait for 500ms "
427
          "after handle this batch of blocks",
428
          pTask->id.idStr, total, size);
429
    } else {
430
      stDebug("s-task:%s data put into outputQ, outputQ items:%d, size:%.2fMiB", pTask->id.idStr, total, size);
8,064✔
431
    }
432
  }
433

434
  return code;
8,064✔
435
}
436

437
int32_t streamTaskInitTokenBucket(STokenBucket* pBucket, int32_t numCap, int32_t numRate, float quotaRate,
9,003✔
438
                                  const char* id) {
439
  if (numCap < 10 || numRate < 10 || pBucket == NULL) {
9,003!
440
    stError("failed to init sink task bucket, cap:%d, rate:%d", numCap, numRate);
×
441
    return TSDB_CODE_INVALID_PARA;
×
442
  }
443

444
  pBucket->numCapacity = numCap;
9,003✔
445
  pBucket->numOfToken = numCap;
9,003✔
446
  pBucket->numRate = numRate;
9,003✔
447

448
  pBucket->quotaRate = quotaRate;
9,003✔
449
  pBucket->quotaCapacity = quotaRate * MAX_SMOOTH_BURST_RATIO;
9,003✔
450
  pBucket->quotaRemain = pBucket->quotaCapacity;
9,003✔
451

452
  pBucket->tokenFillTimestamp = taosGetTimestampMs();
9,003✔
453
  pBucket->quotaFillTimestamp = taosGetTimestampMs();
9,003✔
454
  stDebug("s-task:%s sink quotaRate:%.2fMiB, numRate:%d", id, quotaRate, numRate);
9,003✔
455
  return TSDB_CODE_SUCCESS;
9,003✔
456
}
457

458
static void fillTokenBucket(STokenBucket* pBucket, const char* id) {
26,368✔
459
  int64_t now = taosGetTimestampMs();
26,368✔
460

461
  int64_t deltaToken = now - pBucket->tokenFillTimestamp;
26,368✔
462
  if (pBucket->numOfToken < 0) {
26,368!
463
    return;
×
464
  }
465

466
  int32_t incNum = (deltaToken / 1000.0) * pBucket->numRate;
26,368✔
467
  if (incNum > 0) {
26,368✔
468
    pBucket->numOfToken = TMIN(pBucket->numOfToken + incNum, pBucket->numCapacity);
13,607✔
469
    pBucket->tokenFillTimestamp = now;
13,607✔
470
  }
471

472
  // increase the new available quota as time goes on
473
  int64_t deltaQuota = now - pBucket->quotaFillTimestamp;
26,368✔
474
  double  incSize = (deltaQuota / 1000.0) * pBucket->quotaRate;
26,368✔
475
  if (incSize > 0) {
26,368✔
476
    pBucket->quotaRemain = TMIN(pBucket->quotaRemain + incSize, pBucket->quotaCapacity);
17,967✔
477
    pBucket->quotaFillTimestamp = now;
17,967✔
478
  }
479

480
  if (incNum > 0 || incSize > 0) {
26,368✔
481
    stTrace("token/quota available, token:%d inc:%d, token_TsDelta:%" PRId64
17,967✔
482
            ", quota:%.2fMiB inc:%.3fMiB quotaTs:%" PRId64 " now:%" PRId64 "ms, %s",
483
            pBucket->numOfToken, incNum, deltaToken, pBucket->quotaRemain, incSize, deltaQuota, now, id);
484
  }
485
}
486

487
bool streamTaskExtractAvailableToken(STokenBucket* pBucket, const char* id) {
26,368✔
488
  fillTokenBucket(pBucket, id);
26,368✔
489

490
  if (pBucket->numOfToken > 0) {
26,368!
491
    if (pBucket->quotaRemain > 0) {
26,368!
492
      pBucket->numOfToken -= 1;
26,368✔
493
      return true;
26,368✔
494
    } else {  // no available size quota now
495
      return false;
×
496
    }
497
  } else {
498
    return false;
×
499
  }
500
}
501

502
void streamTaskPutbackToken(STokenBucket* pBucket) {
46,473✔
503
  pBucket->numOfToken = TMIN(pBucket->numOfToken + 1, pBucket->numCapacity);
46,473✔
504
}
46,473✔
505

506
// size in KB
507
void streamTaskConsumeQuota(STokenBucket* pBucket, int32_t bytes) { pBucket->quotaRemain -= SIZE_IN_MiB(bytes); }
6,316✔
508

509
void streamTaskInputFail(SStreamTask* pTask) { atomic_store_8(&pTask->inputq.status, TASK_INPUT_STATUS__FAILED); }
×
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc