#4908

Committed 30 Dec 2025 10:52AM UTC coverage: 65.386% (-0.2%) from 65.541%

Build # #4908

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

enh: drop multi-stream (#33962)

Run Details

60 of 106 new or added lines in 4 files covered. (56.6%)

1330 existing lines in 113 files now uncovered.

193461 of 295877 relevant lines covered (65.39%)

115765274.47 hits per line

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

67.52

/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 taosArrayRemoveP(SArray* pArray, size_t index, void (*fp)(void*)){
  if (!(index < pArray->size)) {
    return;
  }

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

  void* p = taosArrayGetP(pArray, index);
  if (fp) {
    fp(p);
  }

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

taosdata / TDengine / #4908

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