#3653

Committed 14 Mar 2025 08:10AM UTC coverage: 22.565% (-41.0%) from 63.596%

Build # #3653

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

feat(keep): support keep on super table level. (#30097)

* Feat: support use keep while create super table.

* Test(keep): add test for create super table with keep option.

* Feat(keep): Add tmsg for create keep.

* Feat(keep): support alter table option keep.

* Fix(keep): Add baisc test for alter table option.

* Fix(keep): memory leek.

* Feat(keep): add keep to metaEntry&metaCache and fix earliestTs with stn keep.

* Test(keep): add some cases for select with stb keep.

* Fix: fix ci core while alter stb.

* Feat(keep): delete expired data in super table level.

* Feat: remove get stb keep while query.

* Fix : build error.

* Revert "Fix : build error."

This reverts commit 0ed66e4e8.

* Revert "Feat(keep): delete expired data in super table level."

This reverts commit 36330f6b4.

* Fix : build errors.

* Feat : support restart taosd.

* Fix : alter table comment problems.

* Test : add tests for super table keep.

* Fix: change sdb stb reserve size.

* Test: add more tests.

* Feat: Disable normal tables and sub tables from setting the keep parameter

* Fix: add more checks to avoid unknown address.

* Docs: Add docs for stable keep.

* Fix: some review changes.

* Fix: review errors.

Run Details

49248 of 302527 branches covered (16.28%)

Branch coverage included in aggregate %.

53 of 99 new or added lines in 12 files covered. (53.54%)

155872 existing lines in 443 files now uncovered.

87359 of 302857 relevant lines covered (28.84%)

570004.22 hits per line

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

63.69

/source/util/src/tarray.c

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

#define _DEFAULT_SOURCE
#include "tarray.h"
#include "tcoding.h"

// todo refactor API
#define BOUNDARY_SIZE         1024 * 1024 * 1024  // 1G
#define BOUNDARY_SMALL_FACTOR 1.2
#define BOUNDARY_BIG_FACTOR   2

SArray* taosArrayInit(size_t size, size_t elemSize) {
  if (elemSize == 0) {
    terrno = TSDB_CODE_INVALID_PARA;
    return NULL;
  }

  if (size < TARRAY_MIN_SIZE) {
    size = TARRAY_MIN_SIZE;
  }

  SArray* pArray = taosMemoryMalloc(sizeof(SArray));
  if (pArray == NULL) {
    return NULL;
  }

  pArray->size = 0;
  pArray->pData = taosMemoryCalloc(size, elemSize);
  if (pArray->pData == NULL) {
    taosMemoryFree(pArray);
    return NULL;
  }

  pArray->capacity = size;
  pArray->elemSize = elemSize;
  return pArray;
}

SArray* taosArrayInit_s(size_t elemSize, size_t initialSize) {
  SArray* pArray = taosMemoryMalloc(sizeof(SArray));
  if (pArray == NULL) {
    return NULL;
  }

  pArray->size = initialSize;
  pArray->pData = taosMemoryCalloc(initialSize, elemSize);
  if (pArray->pData == NULL) {
    taosMemoryFree(pArray);
    return NULL;
  }

  pArray->capacity = initialSize;
  pArray->elemSize = elemSize;
  return pArray;
}

static int32_t taosArrayResize(SArray* pArray) {
  size_t size = pArray->capacity;
  size = (size << 1u);

  void* tmp = taosMemoryRealloc(pArray->pData, size * pArray->elemSize);
  if (tmp == NULL) {  // reallocate failed, the original buffer remains
    return terrno;
  }

  pArray->pData = tmp;
  pArray->capacity = size;

  return 0;
}

int32_t taosArrayEnsureCap(SArray* pArray, size_t newCap) {
  if (newCap > pArray->capacity) {
    float factor = BOUNDARY_BIG_FACTOR;
    if (newCap * pArray->elemSize > BOUNDARY_SIZE) {
      factor = BOUNDARY_SMALL_FACTOR;
    }

    size_t tsize = (pArray->capacity * factor);
    while (newCap > tsize) {
      size_t newSize = (tsize * factor);
      tsize = (newSize == tsize) ? (tsize + 2) : newSize;
    }

    char* p = taosMemoryRealloc(pArray->pData, tsize * pArray->elemSize);
    if (p == NULL) {
      return terrno;
    }

    pArray->pData = p;
    pArray->capacity = tsize;
  }
  return 0;
}

void* taosArrayAddBatch(SArray* pArray, const void* pData, int32_t nEles) {
  if (pData == NULL) {
    terrno = TSDB_CODE_INVALID_PARA;
    return NULL;
  }

  int32_t code = taosArrayEnsureCap(pArray, pArray->size + nEles);
  if (code) {
    terrno = code;
    return NULL;
  }

  void* dst = TARRAY_GET_ELEM(pArray, pArray->size);
  memcpy(dst, pData, pArray->elemSize * nEles);

  pArray->size += nEles;
  return dst;
}

void taosArrayRemoveDuplicate(SArray* pArray, __compar_fn_t comparFn, void (*fp)(void*)) {
  size_t size = pArray->size;
  if (size <= 1) {
    return;
  }

  int32_t pos = 0;
  for (int32_t i = 1; i < size; ++i) {
    char* p1 = taosArrayGet(pArray, pos);
    char* p2 = taosArrayGet(pArray, i);

    if (comparFn(p1, p2) == 0) {
      // do nothing
    } else {
      if (pos + 1 != i) {
        void* p = taosArrayGet(pArray, pos + 1);
        if (fp != NULL) {
          fp(p);
        }

        taosArraySet(pArray, pos + 1, p2);
        memset(TARRAY_GET_ELEM(pArray, i), 0, pArray->elemSize);
        pos += 1;
      } else {
        pos += 1;
      }
    }
  }

  if (fp != NULL) {
    for (int32_t i = pos + 1; i < pArray->size; ++i) {
      void* p = taosArrayGet(pArray, i);
      fp(p);
    }
  }

  pArray->size = pos + 1;
}

void* taosArrayAddAll(SArray* pArray, const SArray* pInput) {
  if (pInput) {
    return taosArrayAddBatch(pArray, pInput->pData, (int32_t)taosArrayGetSize(pInput));
  } else {
    terrno = TSDB_CODE_INVALID_PARA;
    return NULL;
  }
}

void* taosArrayReserve(SArray* pArray, int32_t num) {
  int32_t code = taosArrayEnsureCap(pArray, pArray->size + num);
  if (code) {
    terrno = code;
    return NULL;
  }

  void* dst = TARRAY_GET_ELEM(pArray, pArray->size);
  pArray->size += num;

  memset(dst, 0, num * pArray->elemSize);

  return dst;
}

void* taosArrayPop(SArray* pArray) {
  if (pArray->size == 0) {
    return NULL;
  }

  pArray->size -= 1;
  return TARRAY_GET_ELEM(pArray, pArray->size);
}

void* taosArrayGet(const SArray* pArray, size_t index) {
  if (NULL == pArray) {
    terrno = TSDB_CODE_INVALID_PARA;
    uError("failed to return value from array of null ptr");
    return NULL;
  }

  if (index >= pArray->size) {
    uError("index is out of range, current:%" PRIzu " max:%" PRIzu, index, pArray->size);
    terrno = TSDB_CODE_OUT_OF_RANGE;
    return NULL;
  }

  return TARRAY_GET_ELEM(pArray, index);
}

void* taosArrayGetP(const SArray* pArray, size_t index) {
  void** p = taosArrayGet(pArray, index);
  if (p == NULL) {
    return NULL;
  }
  return *p;
}

void* taosArrayGetLast(const SArray* pArray) {
  if (pArray->size == 0) {
    terrno = TSDB_CODE_INVALID_PARA;
    return NULL;
  }

  return TARRAY_GET_ELEM(pArray, pArray->size - 1);
}

size_t taosArrayGetSize(const SArray* pArray) {
  if (pArray == NULL) {
    return 0;
  }
  return TARRAY_SIZE(pArray);
}

void* taosArrayInsert(SArray* pArray, size_t index, const void* pData) {
  if (pArray == NULL || pData == NULL) {
    terrno = TSDB_CODE_INVALID_PARA;
    return NULL;
  }

  if (index >= pArray->size) {
    return taosArrayPush(pArray, pData);
  }

  if (pArray->size >= pArray->capacity) {
    int32_t ret = taosArrayResize(pArray);
    if (ret < 0) {
      terrno = ret;
      return NULL;
    }
  }

  void* dst = TARRAY_GET_ELEM(pArray, index);

  int32_t remain = (int32_t)(pArray->size - index);
  memmove((char*)dst + pArray->elemSize, (char*)dst, pArray->elemSize * remain);
  memcpy(dst, pData, pArray->elemSize);

  pArray->size += 1;

  return dst;
}

void taosArraySet(SArray* pArray, size_t index, void* pData) {
  if (index < pArray->size) {
    memcpy(TARRAY_GET_ELEM(pArray, index), pData, pArray->elemSize);
  }
}

void taosArrayPopFrontBatch(SArray* pArray, size_t cnt) {
  if (cnt > pArray->size) {
    cnt = pArray->size;
  }

  pArray->size = pArray->size - cnt;
  if (pArray->size == 0 || cnt == 0) {
    return;
  }
  memmove(pArray->pData, (char*)pArray->pData + cnt * pArray->elemSize, pArray->size * pArray->elemSize);
}

void taosArrayPopTailBatch(SArray* pArray, size_t cnt) {
  if (cnt >= pArray->size) {
    cnt = pArray->size;
  }

  pArray->size = pArray->size - cnt;
}

void taosArrayRemove(SArray* pArray, size_t index) {
  if (!(index < pArray->size)) {
    return;
  }

  if (index == pArray->size - 1) {
    void* t = taosArrayPop(pArray);
    return;
  }

  size_t remain = pArray->size - index - 1;
  memmove((char*)pArray->pData + index * pArray->elemSize, (char*)pArray->pData + (index + 1) * pArray->elemSize,
          remain * pArray->elemSize);
  pArray->size -= 1;
}

void taosArrayRemoveBatch(SArray* pArray, size_t index, size_t num, FDelete fp) {
  if (index + num <= pArray->size) {
    if (fp) {
      for (int32_t i = 0; i < num; i++) {
        fp(taosArrayGet(pArray, index + i));
      }
    }

    memmove((char*)pArray->pData + index * pArray->elemSize, (char*)pArray->pData + (index + num) * pArray->elemSize,
            (pArray->size - index - num) * pArray->elemSize);
    pArray->size -= num;
  }
}

SArray* taosArrayFromList(const void* src, size_t size, size_t elemSize) {
  if (elemSize <= 0) {
    terrno = TSDB_CODE_INVALID_PARA;
    return NULL;
  }

  SArray* pDst = taosArrayInit(size, elemSize);
  if (pDst) {
    memcpy(pDst->pData, src, elemSize * size);
    pDst->size = size;
  }

  return pDst;
}

SArray* taosArrayDup(const SArray* pSrc, __array_item_dup_fn_t fn) {
  if (NULL == pSrc) {
    terrno = TSDB_CODE_INVALID_PARA;
    return NULL;
  }

  if (pSrc->size == 0) {  // empty array list
    return taosArrayInit(8, pSrc->elemSize);
  }

  SArray* dst = taosArrayInit(pSrc->size, pSrc->elemSize);

  if (dst) {
    if (fn == NULL) {
      memcpy(dst->pData, pSrc->pData, pSrc->elemSize * pSrc->size);
    } else {
      for (int32_t i = 0; i < pSrc->size; ++i) {
        void* p = fn(taosArrayGetP(pSrc, i));
        memcpy(((char*)dst->pData) + i * dst->elemSize, &p, dst->elemSize);
      }
    }

    dst->size = pSrc->size;
  }

  return dst;
}

void taosArrayClear(SArray* pArray) {
  if (pArray == NULL) return;
  pArray->size = 0;
}

void taosArrayClearEx(SArray* pArray, void (*fp)(void*)) {
  if (pArray == NULL) return;
  if (fp == NULL) {
    pArray->size = 0;
    return;
  }

  for (int32_t i = 0; i < pArray->size; ++i) {
    fp(TARRAY_GET_ELEM(pArray, i));
  }

  pArray->size = 0;
}
void taosArrayClearP(SArray* pArray, void (*fp)(void*)) {
  // if (pArray == NULL) return;
  // if (fp == NULL) {
  //   pArray->size = 0;
  //   return;
  // }

  // for (int32_t i = 0; i < pArray->size; ++i) {
  //   fp(TARRAY_GET_ELEM(pArray, i));
  // }
  if (pArray) {
    if (NULL == fp) {
      for (int32_t i = 0; i < pArray->size; i++) {
        taosMemoryFree(*(void**)TARRAY_GET_ELEM(pArray, i));
      }
    } else {
      for (int32_t i = 0; i < pArray->size; i++) {
        fp(*(void**)TARRAY_GET_ELEM(pArray, i));
      }
    }
  }
  taosArrayClear(pArray);
}

void taosArrayDestroy(SArray* pArray) {
  if (pArray) {
    taosMemoryFree(pArray->pData);
    taosMemoryFree(pArray);
  }
}

void taosArrayDestroyP(SArray* pArray, FDelete fp) {
  if (pArray) {
    if (NULL == fp) {
      for (int32_t i = 0; i < pArray->size; i++) {
        taosMemoryFree(*(void**)TARRAY_GET_ELEM(pArray, i));
      }
    } else {
      for (int32_t i = 0; i < pArray->size; i++) {
        fp(*(void**)TARRAY_GET_ELEM(pArray, i));
      }
    }
    taosArrayDestroy(pArray);
  }
}

void taosArrayDestroyEx(SArray* pArray, FDelete fp) {
  if (pArray == NULL) {
    return;
  }

  if (fp == NULL) {
    taosArrayDestroy(pArray);
    return;
  }

  for (int32_t i = 0; i < pArray->size; ++i) {
    fp(TARRAY_GET_ELEM(pArray, i));
  }

  taosArrayDestroy(pArray);
}

void taosArraySort(SArray* pArray, __compar_fn_t compar) {
  taosSort(pArray->pData, pArray->size, pArray->elemSize, compar);
}

int32_t taosArrayMSort(SArray* pArray, __compar_fn_t compar) {
  return taosMergeSort(pArray->pData, pArray->size, pArray->elemSize, compar);
}

void* taosArraySearch(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {
  return taosbsearch(key, pArray->pData, pArray->size, pArray->elemSize, comparFn, flags);
}

int32_t taosArraySearchIdx(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {
  void* item = taosArraySearch(pArray, key, comparFn, flags);
  return item == NULL ? -1 : (int32_t)((char*)item - (char*)pArray->pData) / pArray->elemSize;
}

#ifdef BUILD_NO_CALL
static int32_t taosArrayPartition(SArray* pArray, int32_t i, int32_t j, __ext_compar_fn_t fn, const void* userData) {
  void* key = taosArrayGetP(pArray, i);
  while (i < j) {
    while (i < j && fn(taosArrayGetP(pArray, j), key, userData) >= 0) {
      j--;
    }
    if (i < j) {
      void* a = taosArrayGetP(pArray, j);
      taosArraySet(pArray, i, &a);
    }
    while (i < j && fn(taosArrayGetP(pArray, i), key, userData) <= 0) {
      i++;
    }
    if (i < j) {
      void* a = taosArrayGetP(pArray, i);
      taosArraySet(pArray, j, &a);
    }
  }
  taosArraySet(pArray, i, &key);
  return i;
}

static void taosArrayQuicksortImpl(SArray* pArray, int32_t low, int32_t high, __ext_compar_fn_t fn, const void* param) {
  if (low < high) {
    int32_t idx = taosArrayPartition(pArray, low, high, fn, param);
    taosArrayQuicksortImpl(pArray, low, idx - 1, fn, param);
    taosArrayQuicksortImpl(pArray, idx + 1, high, fn, param);
  }
}

static void taosArrayQuickSort(SArray* pArray, __ext_compar_fn_t fn, const void* param) {
  if (pArray->size <= 1) {
    return;
  }
  taosArrayQuicksortImpl(pArray, 0, (int32_t)(taosArrayGetSize(pArray) - 1), fn, param);
}

static void taosArrayInsertSort(SArray* pArray, __ext_compar_fn_t fn, const void* param) {
  if (pArray->size <= 1) {
    return;
  }

  for (int32_t i = 1; i <= pArray->size - 1; ++i) {
    for (int32_t j = i; j > 0; --j) {
      if (fn(taosArrayGetP(pArray, j), taosArrayGetP(pArray, j - 1), param) == -1) {
        void* a = taosArrayGetP(pArray, j);
        void* b = taosArrayGetP(pArray, j - 1);
        taosArraySet(pArray, j - 1, &a);
        taosArraySet(pArray, j, &b);
      } else {
        break;
      }
    }
  }
}
#endif

int32_t taosEncodeArray(void** buf, const SArray* pArray, FEncode encode) {
  int32_t tlen = 0;
  int32_t sz = pArray->size;
  tlen += taosEncodeFixedI32(buf, sz);
  for (int32_t i = 0; i < sz; i++) {
    void* data = taosArrayGetP(pArray, i);
    tlen += encode(buf, data);
  }
  return tlen;
}

void* taosDecodeArray(const void* buf, SArray** pArray, FDecode decode, int32_t dataSz, int8_t sver) {
  int32_t sz;
  buf = taosDecodeFixedI32(buf, &sz);
  *pArray = taosArrayInit(sz, sizeof(void*));
  if (*pArray == NULL) {
    return NULL;
  }
  for (int32_t i = 0; i < sz; i++) {
    void* data = taosMemoryCalloc(1, dataSz);
    if (data == NULL) {
      return NULL;
    }

    buf = decode(buf, data, sver);

    if (taosArrayPush(*pArray, &data) == NULL) {
      taosMemoryFree(data);
      return NULL;
    }
  }
  return (void*)buf;
}

// todo remove it
// order array<type *>
int32_t taosArraySortPWithExt(SArray* pArray, __ext_compar_fn_t fn, const void* param) {
  return taosqsort(pArray->pData, pArray->size, pArray->elemSize, param, fn);
}

void taosArraySwap(SArray* a, SArray* b) {
  if (a == NULL || b == NULL) return;
  size_t t = a->size;
  a->size = b->size;
  b->size = t;

  uint32_t cap = a->capacity;
  a->capacity = b->capacity;
  b->capacity = cap;

  uint32_t elem = a->elemSize;
  a->elemSize = b->elemSize;
  b->elemSize = elem;

  void* data = a->pData;
  a->pData = b->pData;
  b->pData = data;
}

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	#define _DEFAULT_SOURCE
17	#include "tarray.h"
18	#include "tcoding.h"
19
20	// todo refactor API
21	#define BOUNDARY_SIZE 1024 * 1024 * 1024 // 1G
22	#define BOUNDARY_SMALL_FACTOR 1.2
23	#define BOUNDARY_BIG_FACTOR 2
24
25	SArray* taosArrayInit(size_t size, size_t elemSize) {	5,311,305✔
26	if (elemSize == 0) {	5,311,305✔
27	terrno = TSDB_CODE_INVALID_PARA;	1✔
28	return NULL;	1✔
29	}
30
31	if (size < TARRAY_MIN_SIZE) {	5,311,304✔
32	size = TARRAY_MIN_SIZE;	100,425✔
33	}
34
35	SArray* pArray = taosMemoryMalloc(sizeof(SArray));	5,311,304!
36	if (pArray == NULL) {	5,311,304!
37	return NULL;	×
38	}
39
40	pArray->size = 0;	5,311,304✔
41	pArray->pData = taosMemoryCalloc(size, elemSize);	5,311,304!
42	if (pArray->pData == NULL) {	5,311,304!
43	taosMemoryFree(pArray);	×
44	return NULL;	×
45	}
46
47	pArray->capacity = size;	5,311,304✔
48	pArray->elemSize = elemSize;	5,311,304✔
49	return pArray;	5,311,304✔
50	}
51
52	SArray* taosArrayInit_s(size_t elemSize, size_t initialSize) {	21✔
53	SArray* pArray = taosMemoryMalloc(sizeof(SArray));	21!
54	if (pArray == NULL) {	21!
55	return NULL;	×
56	}
57
58	pArray->size = initialSize;	21✔
59	pArray->pData = taosMemoryCalloc(initialSize, elemSize);	21!
60	if (pArray->pData == NULL) {	21!
61	taosMemoryFree(pArray);	×
62	return NULL;	×
63	}
64
65	pArray->capacity = initialSize;	21✔
66	pArray->elemSize = elemSize;	21✔
67	return pArray;	21✔
68	}
69
UNCOV 70	static int32_t taosArrayResize(SArray* pArray) {	×
UNCOV 71	size_t size = pArray->capacity;	×
UNCOV 72	size = (size << 1u);	×
73
UNCOV 74	void* tmp = taosMemoryRealloc(pArray->pData, size * pArray->elemSize);	×
UNCOV 75	if (tmp == NULL) { // reallocate failed, the original buffer remains	×
76	return terrno;	×
77	}
78
UNCOV 79	pArray->pData = tmp;	×
UNCOV 80	pArray->capacity = size;	×
81
UNCOV 82	return 0;	×
83	}
84
85	int32_t taosArrayEnsureCap(SArray* pArray, size_t newCap) {	212,684,568✔
86	if (newCap > pArray->capacity) {	212,684,568✔
87	float factor = BOUNDARY_BIG_FACTOR;	1,996,906✔
88	if (newCap * pArray->elemSize > BOUNDARY_SIZE) {	1,996,906!
89	factor = BOUNDARY_SMALL_FACTOR;	×
90	}
91
92	size_t tsize = (pArray->capacity * factor);	1,996,906✔
93	while (newCap > tsize) {	2,002,676✔
94	size_t newSize = (tsize * factor);	5,770✔
95	tsize = (newSize == tsize) ? (tsize + 2) : newSize;	5,770!
96	}
97
98	char* p = taosMemoryRealloc(pArray->pData, tsize * pArray->elemSize);	1,996,906!
99	if (p == NULL) {	1,996,906!
100	return terrno;	×
101	}
102
103	pArray->pData = p;	1,996,906✔
104	pArray->capacity = tsize;	1,996,906✔
105	}
106	return 0;	212,684,568✔
107	}
108
109	void* taosArrayAddBatch(SArray* pArray, const void* pData, int32_t nEles) {	212,684,348✔
110	if (pData == NULL) {	212,684,348✔
111	terrno = TSDB_CODE_INVALID_PARA;	1✔
112	return NULL;	1✔
113	}
114
115	int32_t code = taosArrayEnsureCap(pArray, pArray->size + nEles);	212,684,347✔
116	if (code) {	212,684,347✔
117	terrno = code;	2✔
118	return NULL;	×
119	}
120
121	void* dst = TARRAY_GET_ELEM(pArray, pArray->size);	212,684,345✔
122	memcpy(dst, pData, pArray->elemSize * nEles);	212,684,345✔
123
124	pArray->size += nEles;	212,684,345✔
125	return dst;	212,684,345✔
126	}
127
128	void taosArrayRemoveDuplicate(SArray* pArray, __compar_fn_t comparFn, void (fp)(void)) {	10,565✔
129	size_t size = pArray->size;	10,565✔
130	if (size <= 1) {	10,565✔
131	return;	5,018✔
132	}
133
134	int32_t pos = 0;	5,547✔
135	for (int32_t i = 1; i < size; ++i) {	622,454✔
136	char* p1 = taosArrayGet(pArray, pos);	616,907✔
137	char* p2 = taosArrayGet(pArray, i);	616,907✔
138
139	if (comparFn(p1, p2) == 0) {	616,907✔
140	// do nothing
141	} else {
142	if (pos + 1 != i) {	520,110✔
143	void* p = taosArrayGet(pArray, pos + 1);	14,516✔
144	if (fp != NULL) {	14,516✔
145	fp(p);	3✔
146	}
147
148	taosArraySet(pArray, pos + 1, p2);	14,516✔
149	memset(TARRAY_GET_ELEM(pArray, i), 0, pArray->elemSize);	14,516✔
150	pos += 1;	14,516✔
151	} else {
152	pos += 1;	505,594✔
153	}
154	}
155	}
156
157	if (fp != NULL) {	5,547✔
158	for (int32_t i = pos + 1; i < pArray->size; ++i) {	11✔
159	void* p = taosArrayGet(pArray, i);	10✔
160	fp(p);	10✔
161	}
162	}
163
164	pArray->size = pos + 1;	5,547✔
165	}
166
167	void* taosArrayAddAll(SArray* pArray, const SArray* pInput) {	10,624✔
168	if (pInput) {	10,624!
169	return taosArrayAddBatch(pArray, pInput->pData, (int32_t)taosArrayGetSize(pInput));	10,624✔
170	} else {
UNCOV 171	terrno = TSDB_CODE_INVALID_PARA;	×
UNCOV 172	return NULL;	×
173	}
174	}
175
176	void* taosArrayReserve(SArray* pArray, int32_t num) {	207✔
177	int32_t code = taosArrayEnsureCap(pArray, pArray->size + num);	207✔
178	if (code) {	207!
179	terrno = code;	×
180	return NULL;	×
181	}
182
183	void* dst = TARRAY_GET_ELEM(pArray, pArray->size);	207✔
184	pArray->size += num;	207✔
185
186	memset(dst, 0, num * pArray->elemSize);	207✔
187
188	return dst;	207✔
189	}
190
191	void* taosArrayPop(SArray* pArray) {	1,695,321✔
192	if (pArray->size == 0) {	1,695,321✔
193	return NULL;	56✔
194	}
195
196	pArray->size -= 1;	1,695,265✔
197	return TARRAY_GET_ELEM(pArray, pArray->size);	1,695,265✔
198	}
199
200	void* taosArrayGet(const SArray* pArray, size_t index) {	317,039,327✔
201	if (NULL == pArray) {	317,039,327✔
202	terrno = TSDB_CODE_INVALID_PARA;	52✔
203	uError("failed to return value from array of null ptr");	52!
204	return NULL;	52✔
205	}
206
207	if (index >= pArray->size) {	317,039,275✔
208	uError("index is out of range, current:%" PRIzu " max:%" PRIzu, index, pArray->size);	29!
209	terrno = TSDB_CODE_OUT_OF_RANGE;	29✔
210	return NULL;	29✔
211	}
212
213	return TARRAY_GET_ELEM(pArray, index);	317,039,246✔
214	}
215
216	void* taosArrayGetP(const SArray* pArray, size_t index) {	2,137,842✔
217	void** p = taosArrayGet(pArray, index);	2,137,842✔
218	if (p == NULL) {	2,137,795✔
219	return NULL;	1✔
220	}
221	return *p;	2,137,794✔
222	}
223
224	void* taosArrayGetLast(const SArray* pArray) {	3,333✔
225	if (pArray->size == 0) {	3,333✔
226	terrno = TSDB_CODE_INVALID_PARA;	1✔
227	return NULL;	1✔
228	}
229
230	return TARRAY_GET_ELEM(pArray, pArray->size - 1);	3,332✔
231	}
232
233	size_t taosArrayGetSize(const SArray* pArray) {	239,272,547✔
234	if (pArray == NULL) {	239,272,547✔
235	return 0;	13,544✔
236	}
237	return TARRAY_SIZE(pArray);	239,259,003✔
238	}
239
240	void* taosArrayInsert(SArray* pArray, size_t index, const void* pData) {	2,357✔
241	if (pArray == NULL \|\| pData == NULL) {	2,357!
242	terrno = TSDB_CODE_INVALID_PARA;	1✔
243	return NULL;	1✔
244	}
245
246	if (index >= pArray->size) {	2,356!
247	return taosArrayPush(pArray, pData);	2,356✔
248	}
249
UNCOV 250	if (pArray->size >= pArray->capacity) {	×
UNCOV 251	int32_t ret = taosArrayResize(pArray);	×
UNCOV 252	if (ret < 0) {	×
UNCOV 253	terrno = ret;	×
254	return NULL;	×
255	}
256	}
257
UNCOV 258	void* dst = TARRAY_GET_ELEM(pArray, index);	×
259
UNCOV 260	int32_t remain = (int32_t)(pArray->size - index);	×
UNCOV 261	memmove((char)dst + pArray->elemSize, (char)dst, pArray->elemSize * remain);	×
UNCOV 262	memcpy(dst, pData, pArray->elemSize);	×
263
UNCOV 264	pArray->size += 1;	×
265
UNCOV 266	return dst;	×
267	}
268
269	void taosArraySet(SArray* pArray, size_t index, void* pData) {	15,019✔
270	if (index < pArray->size) {	15,019!
271	memcpy(TARRAY_GET_ELEM(pArray, index), pData, pArray->elemSize);	15,019✔
272	}
273	}	15,019✔
274
275	void taosArrayPopFrontBatch(SArray* pArray, size_t cnt) {	6✔
276	if (cnt > pArray->size) {	6✔
277	cnt = pArray->size;	1✔
278	}
279
280	pArray->size = pArray->size - cnt;	6✔
281	if (pArray->size == 0 \|\| cnt == 0) {	6!
282	return;	1✔
283	}
284	memmove(pArray->pData, (char)pArray->pData + cnt pArray->elemSize, pArray->size * pArray->elemSize);	5✔
285	}
286
287	void taosArrayPopTailBatch(SArray* pArray, size_t cnt) {	53✔
288	if (cnt >= pArray->size) {	53✔
289	cnt = pArray->size;	37✔
290	}
291
292	pArray->size = pArray->size - cnt;	53✔
293	}	53✔
294
295	void taosArrayRemove(SArray* pArray, size_t index) {	104✔
296	if (!(index < pArray->size)) {	104!
297	return;	×
298	}
299
300	if (index == pArray->size - 1) {	104✔
301	void* t = taosArrayPop(pArray);	62✔
302	return;	62✔
303	}
304
305	size_t remain = pArray->size - index - 1;	42✔
306	memmove((char)pArray->pData + index pArray->elemSize, (char)pArray->pData + (index + 1) pArray->elemSize,	42✔
307	remain * pArray->elemSize);	42✔
308	pArray->size -= 1;	42✔
309	}
310
UNCOV 311	void taosArrayRemoveBatch(SArray* pArray, size_t index, size_t num, FDelete fp) {	×
UNCOV 312	if (index + num <= pArray->size) {	×
UNCOV 313	if (fp) {	×
UNCOV 314	for (int32_t i = 0; i < num; i++) {	×
UNCOV 315	fp(taosArrayGet(pArray, index + i));	×
316	}
317	}
318
UNCOV 319	memmove((char)pArray->pData + index pArray->elemSize, (char)pArray->pData + (index + num) pArray->elemSize,	×
UNCOV 320	(pArray->size - index - num) * pArray->elemSize);	×
UNCOV 321	pArray->size -= num;	×
322	}
UNCOV 323	}	×
324
325	SArray* taosArrayFromList(const void* src, size_t size, size_t elemSize) {	1✔
326	if (elemSize <= 0) {	1!
327	terrno = TSDB_CODE_INVALID_PARA;	×
328	return NULL;	×
329	}
330
331	SArray* pDst = taosArrayInit(size, elemSize);	1✔
332	if (pDst) {	1!
333	memcpy(pDst->pData, src, elemSize * size);	1✔
334	pDst->size = size;	1✔
335	}
336
337	return pDst;	1✔
338	}
339
340	SArray* taosArrayDup(const SArray* pSrc, __array_item_dup_fn_t fn) {	335✔
341	if (NULL == pSrc) {	335!
UNCOV 342	terrno = TSDB_CODE_INVALID_PARA;	×
UNCOV 343	return NULL;	×
344	}
345
346	if (pSrc->size == 0) { // empty array list	335✔
347	return taosArrayInit(8, pSrc->elemSize);	32✔
348	}
349
350	SArray* dst = taosArrayInit(pSrc->size, pSrc->elemSize);	303✔
351
352	if (dst) {	303!
353	if (fn == NULL) {	303!
354	memcpy(dst->pData, pSrc->pData, pSrc->elemSize * pSrc->size);	303✔
355	} else {
UNCOV 356	for (int32_t i = 0; i < pSrc->size; ++i) {	×
UNCOV 357	void* p = fn(taosArrayGetP(pSrc, i));	×
UNCOV 358	memcpy(((char)dst->pData) + i dst->elemSize, &p, dst->elemSize);	×
359	}
360	}
361
362	dst->size = pSrc->size;	303✔
363	}
364
365	return dst;	303✔
366	}
367
368	void taosArrayClear(SArray* pArray) {	612,092✔
369	if (pArray == NULL) return;	612,092✔
370	pArray->size = 0;	612,047✔
371	}
372
373	void taosArrayClearEx(SArray* pArray, void (fp)(void)) {	85✔
374	if (pArray == NULL) return;	85!
375	if (fp == NULL) {	85✔
376	pArray->size = 0;	1✔
377	return;	1✔
378	}
379
380	for (int32_t i = 0; i < pArray->size; ++i) {	157✔
381	fp(TARRAY_GET_ELEM(pArray, i));	73✔
382	}
383
384	pArray->size = 0;	84✔
385	}
386	void taosArrayClearP(SArray* pArray, void (fp)(void)) {	14✔
387	// if (pArray == NULL) return;
388	// if (fp == NULL) {
389	// pArray->size = 0;
390	// return;
391	// }
392
393	// for (int32_t i = 0; i < pArray->size; ++i) {
394	// fp(TARRAY_GET_ELEM(pArray, i));
395	// }
396	if (pArray) {	14!
397	if (NULL == fp) {	14!
398	for (int32_t i = 0; i < pArray->size; i++) {	25✔
399	taosMemoryFree((void*)TARRAY_GET_ELEM(pArray, i));	11!
400	}
401	} else {
402	for (int32_t i = 0; i < pArray->size; i++) {	×
403	fp((void*)TARRAY_GET_ELEM(pArray, i));	×
404	}
405	}
406	}
407	taosArrayClear(pArray);	14✔
408	}	14✔
409
410	void taosArrayDestroy(SArray* pArray) {	5,424,793✔
411	if (pArray) {	5,424,793✔
412	taosMemoryFree(pArray->pData);	5,310,027!
413	taosMemoryFree(pArray);	5,310,027!
414	}
415	}	5,424,794✔
416
417	void taosArrayDestroyP(SArray* pArray, FDelete fp) {	5,869✔
418	if (pArray) {	5,869✔
419	if (NULL == fp) {	54✔
420	for (int32_t i = 0; i < pArray->size; i++) {	52✔
421	taosMemoryFree((void*)TARRAY_GET_ELEM(pArray, i));	8!
422	}
423	} else {
424	for (int32_t i = 0; i < pArray->size; i++) {	15✔
425	fp((void*)TARRAY_GET_ELEM(pArray, i));	5✔
426	}
427	}
428	taosArrayDestroy(pArray);	54✔
429	}
430	}	5,869✔
431
432	void taosArrayDestroyEx(SArray* pArray, FDelete fp) {	27,336✔
433	if (pArray == NULL) {	27,336✔
434	return;	20,613✔
435	}
436
437	if (fp == NULL) {	6,723✔
438	taosArrayDestroy(pArray);	77✔
439	return;	77✔
440	}
441
442	for (int32_t i = 0; i < pArray->size; ++i) {	15,285✔
443	fp(TARRAY_GET_ELEM(pArray, i));	8,639✔
444	}
445
446	taosArrayDestroy(pArray);	6,646✔
447	}
448
449	void taosArraySort(SArray* pArray, __compar_fn_t compar) {	43,612✔
450	taosSort(pArray->pData, pArray->size, pArray->elemSize, compar);	43,612✔
451	}	43,612✔
452
UNCOV 453	int32_t taosArrayMSort(SArray* pArray, __compar_fn_t compar) {	×
UNCOV 454	return taosMergeSort(pArray->pData, pArray->size, pArray->elemSize, compar);	×
455	}
456
457	void* taosArraySearch(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {	3,417✔
458	return taosbsearch(key, pArray->pData, pArray->size, pArray->elemSize, comparFn, flags);	3,417✔
459	}
460
461	int32_t taosArraySearchIdx(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {	69✔
462	void* item = taosArraySearch(pArray, key, comparFn, flags);	69✔
463	return item == NULL ? -1 : (int32_t)((char)item - (char)pArray->pData) / pArray->elemSize;	69✔
464	}
465
466	#ifdef BUILD_NO_CALL
467	static int32_t taosArrayPartition(SArray* pArray, int32_t i, int32_t j, __ext_compar_fn_t fn, const void* userData) {
468	void* key = taosArrayGetP(pArray, i);
469	while (i < j) {
470	while (i < j && fn(taosArrayGetP(pArray, j), key, userData) >= 0) {
471	j--;
472	}
473	if (i < j) {
474	void* a = taosArrayGetP(pArray, j);
475	taosArraySet(pArray, i, &a);
476	}
477	while (i < j && fn(taosArrayGetP(pArray, i), key, userData) <= 0) {
478	i++;
479	}
480	if (i < j) {
481	void* a = taosArrayGetP(pArray, i);
482	taosArraySet(pArray, j, &a);
483	}
484	}
485	taosArraySet(pArray, i, &key);
486	return i;
487	}
488
489	static void taosArrayQuicksortImpl(SArray* pArray, int32_t low, int32_t high, __ext_compar_fn_t fn, const void* param) {
490	if (low < high) {
491	int32_t idx = taosArrayPartition(pArray, low, high, fn, param);
492	taosArrayQuicksortImpl(pArray, low, idx - 1, fn, param);
493	taosArrayQuicksortImpl(pArray, idx + 1, high, fn, param);
494	}
495	}
496
497	static void taosArrayQuickSort(SArray* pArray, __ext_compar_fn_t fn, const void* param) {
498	if (pArray->size <= 1) {
499	return;
500	}
501	taosArrayQuicksortImpl(pArray, 0, (int32_t)(taosArrayGetSize(pArray) - 1), fn, param);
502	}
503
504	static void taosArrayInsertSort(SArray* pArray, __ext_compar_fn_t fn, const void* param) {
505	if (pArray->size <= 1) {
506	return;
507	}
508
509	for (int32_t i = 1; i <= pArray->size - 1; ++i) {
510	for (int32_t j = i; j > 0; --j) {
511	if (fn(taosArrayGetP(pArray, j), taosArrayGetP(pArray, j - 1), param) == -1) {
512	void* a = taosArrayGetP(pArray, j);
513	void* b = taosArrayGetP(pArray, j - 1);
514	taosArraySet(pArray, j - 1, &a);
515	taosArraySet(pArray, j, &b);
516	} else {
517	break;
518	}
519	}
520	}
521	}
522	#endif
523
UNCOV 524	int32_t taosEncodeArray(void** buf, const SArray* pArray, FEncode encode) {	×
UNCOV 525	int32_t tlen = 0;	×
UNCOV 526	int32_t sz = pArray->size;	×
UNCOV 527	tlen += taosEncodeFixedI32(buf, sz);	×
UNCOV 528	for (int32_t i = 0; i < sz; i++) {	×
UNCOV 529	void* data = taosArrayGetP(pArray, i);	×
UNCOV 530	tlen += encode(buf, data);	×
531	}
UNCOV 532	return tlen;	×
533	}
534
UNCOV 535	void* taosDecodeArray(const void* buf, SArray** pArray, FDecode decode, int32_t dataSz, int8_t sver) {	×
536	int32_t sz;
UNCOV 537	buf = taosDecodeFixedI32(buf, &sz);	×
UNCOV 538	pArray = taosArrayInit(sz, sizeof(void));	×
UNCOV 539	if (*pArray == NULL) {	×
540	return NULL;	×
541	}
UNCOV 542	for (int32_t i = 0; i < sz; i++) {	×
UNCOV 543	void* data = taosMemoryCalloc(1, dataSz);	×
UNCOV 544	if (data == NULL) {	×
545	return NULL;	×
546	}
547
UNCOV 548	buf = decode(buf, data, sver);	×
549
UNCOV 550	if (taosArrayPush(*pArray, &data) == NULL) {	×
551	taosMemoryFree(data);	×
552	return NULL;	×
553	}
554	}
UNCOV 555	return (void*)buf;	×
556	}
557
558	// todo remove it
559	// order array<type *>
560	int32_t taosArraySortPWithExt(SArray* pArray, __ext_compar_fn_t fn, const void* param) {	1✔
561	return taosqsort(pArray->pData, pArray->size, pArray->elemSize, param, fn);	1✔
562	}
563
UNCOV 564	void taosArraySwap(SArray* a, SArray* b) {	×
UNCOV 565	if (a == NULL \|\| b == NULL) return;	×
UNCOV 566	size_t t = a->size;	×
UNCOV 567	a->size = b->size;	×
UNCOV 568	b->size = t;	×
569
UNCOV 570	uint32_t cap = a->capacity;	×
UNCOV 571	a->capacity = b->capacity;	×
UNCOV 572	b->capacity = cap;	×
573
UNCOV 574	uint32_t elem = a->elemSize;	×
UNCOV 575	a->elemSize = b->elemSize;	×
UNCOV 576	b->elemSize = elem;	×
577
UNCOV 578	void* data = a->pData;	×
UNCOV 579	a->pData = b->pData;	×
UNCOV 580	b->pData = data;	×
581	}

taosdata / TDengine / #3653

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

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