#4772

Committed 01 Oct 2025 04:06AM UTC coverage: 58.689% (+0.07%) from 58.619%

Build # #4772

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

Merge pull request #33171 from taosdata/merge/3.3.6tomain

merge: from 3.3.6 to main branch

Run Details

139575 of 302743 branches covered (46.1%)

Branch coverage included in aggregate %.

15 of 20 new or added lines in 2 files covered. (75.0%)

1111 existing lines in 24 files now uncovered.

210882 of 294403 relevant lines covered (71.63%)

24473444.99 hits per line

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

72.59

/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(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) {	1,193,554,642✔
26	if (elemSize == 0) {	1,193,554,642✔
27	terrno = TSDB_CODE_INVALID_PARA;	3✔
28	return NULL;	3✔
29	}
30
31	if (size < TARRAY_MIN_SIZE) {	1,193,554,639✔
32	size = TARRAY_MIN_SIZE;	329,538,360✔
33	}
34
35	SArray* pArray = taosMemoryMalloc(sizeof(SArray));	1,193,554,639✔
36	if (pArray == NULL) {	1,187,019,357!
37	return NULL;	×
38	}
39
40	pArray->size = 0;	1,187,019,357✔
41	pArray->pData = taosMemoryCalloc(size, elemSize);	1,187,019,357!
42	if (pArray->pData == NULL) {	1,201,991,006!
43	taosMemoryFree(pArray);	×
44	return NULL;	×
45	}
46
47	pArray->capacity = size;	1,201,991,006✔
48	pArray->elemSize = elemSize;	1,201,991,006✔
49	return pArray;	1,201,991,006✔
50	}
51
52	SArray* taosArrayInit_s(size_t elemSize, size_t initialSize) {	3,328,732✔
53	SArray* pArray = taosMemoryMalloc(sizeof(SArray));	3,328,732!
54	if (pArray == NULL) {	3,328,983!
55	return NULL;	×
56	}
57
58	pArray->size = initialSize;	3,328,983✔
59	pArray->pData = taosMemoryCalloc(initialSize, elemSize);	3,328,983!
60	if (pArray->pData == NULL) {	3,328,981!
61	taosMemoryFree(pArray);	×
62	return NULL;	×
63	}
64
65	pArray->capacity = initialSize;	3,328,981✔
66	pArray->elemSize = elemSize;	3,328,981✔
67	return pArray;	3,328,981✔
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;	71,281,337✔
88	if (newCap * pArray->elemSize > BOUNDARY_SIZE) {	71,281,337!
89	factor = BOUNDARY_SMALL_FACTOR;	×
90	}
91
92	size_t tsize = (pArray->capacity * factor);	71,281,337✔
93	while (newCap > tsize) {	72,185,490✔
94	size_t newSize = (tsize * factor);	904,153✔
95	tsize = (newSize == tsize) ? (tsize + 2) : newSize;	904,153!
96	}
97
98	char* p = taosMemoryRealloc(pArray->pData, tsize * pArray->elemSize);	71,281,337✔
99	if (p == NULL) {	71,320,165!
100	return terrno;	×
101	}
102
103	pArray->pData = p;	71,320,165✔
104	pArray->capacity = tsize;	71,320,165✔
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;	3✔
112	return NULL;	3✔
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;	×
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)) {	1,877,521✔
129	size_t size = pArray->size;	1,877,521✔
130	if (size <= 1) {	1,877,521✔
131	return;	1,830,813✔
132	}
133
134	int32_t pos = 0;	46,708✔
135	for (int32_t i = 1; i < size; ++i) {	2,051,508✔
136	char* p1 = taosArrayGet(pArray, pos);	2,004,857✔
137	char* p2 = taosArrayGet(pArray, i);	2,004,793✔
138
139	if (comparFn(p1, p2) == 0) {	2,004,793✔
140	// do nothing
141	} else {
142	if (pos + 1 != i) {	1,708,908✔
143	void* p = taosArrayGet(pArray, pos + 1);	47,044✔
144	if (fp != NULL) {	47,044✔
145	fp(p);	9✔
146	}
147
148	taosArraySet(pArray, pos + 1, p2);	47,044✔
149	memset(TARRAY_GET_ELEM(pArray, i), 0, pArray->elemSize);	47,044✔
150	pos += 1;	47,044✔
151	} else {
152	pos += 1;	1,661,864✔
153	}
154	}
155	}
156
157	if (fp != NULL) {	46,651✔
158	for (int32_t i = pos + 1; i < pArray->size; ++i) {	1,243✔
159	void* p = taosArrayGet(pArray, i);	30✔
160	fp(p);	30✔
161	}
162	}
163
164	pArray->size = pos + 1;	47,857✔
165	}
166
167	void* taosArrayAddAll(SArray* pArray, const SArray* pInput) {	7,005,351✔
168	if (pInput) {	7,005,351✔
169	return taosArrayAddBatch(pArray, pInput->pData, (int32_t)taosArrayGetSize(pInput));	6,993,960✔
170	} else {
171	terrno = TSDB_CODE_INVALID_PARA;	11,391✔
172	return NULL;	11,834✔
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;	×
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) {	102,275,278✔
192	if (pArray->size == 0) {	102,275,278✔
193	return NULL;	1,546,148✔
194	}
195
196	pArray->size -= 1;	100,729,130✔
197	return TARRAY_GET_ELEM(pArray, pArray->size);	100,729,130✔
198	}
199
200	void* taosArrayGet(const SArray* pArray, size_t index) {	2,147,483,647✔
201	if (NULL == pArray) {	2,147,483,647✔
202	terrno = TSDB_CODE_INVALID_PARA;	156✔
203	uError("failed to return value from array of null ptr");	156!
204	return NULL;	156✔
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);	338!
209	terrno = TSDB_CODE_OUT_OF_RANGE;	338✔
210	return NULL;	338✔
211	}
212
213	return TARRAY_GET_ELEM(pArray, index);	2,147,483,647✔
214	}
215
216	void* taosArrayGetP(const SArray* pArray, size_t index) {	1,661,029,550✔
217	void** p = taosArrayGet(pArray, index);	1,661,029,550✔
218	if (p == NULL) {	1,643,391,158✔
219	return NULL;	15✔
220	}
221	return *p;	1,643,391,143✔
222	}
223
224	void* taosArrayGetLast(const SArray* pArray) {	132,086,606✔
225	if (pArray->size == 0) {	132,086,606✔
226	terrno = TSDB_CODE_INVALID_PARA;	14,855✔
227	return NULL;	14,855✔
228	}
229
230	return TARRAY_GET_ELEM(pArray, pArray->size - 1);	132,071,751✔
231	}
232
233	size_t taosArrayGetSize(const SArray* pArray) {	2,147,483,647✔
234	if (pArray == NULL) {	2,147,483,647✔
235	return 0;	281,978,893✔
236	}
237	return TARRAY_SIZE(pArray);	2,147,483,647✔
238	}
239
240	void* taosArrayInsert(SArray* pArray, size_t index, const void* pData) {	1,614,596✔
241	if (pArray == NULL \|\| pData == NULL) {	1,614,596!
242	terrno = TSDB_CODE_INVALID_PARA;	×
243	return NULL;	3✔
244	}
245
246	if (index >= pArray->size) {	1,614,683✔
247	return taosArrayPush(pArray, pData);	1,614,125✔
248	}
249
250	if (pArray->size >= pArray->capacity) {	571!
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);	609✔
259
260	int32_t remain = (int32_t)(pArray->size - index);	609✔
261	memmove((char)dst + pArray->elemSize, (char)dst, pArray->elemSize * remain);	609✔
262	memcpy(dst, pData, pArray->elemSize);	609✔
263
264	pArray->size += 1;	609✔
265
266	return dst;	609✔
267	}
268
269	void taosArraySet(SArray* pArray, size_t index, void* pData) {	156,931,457✔
270	if (index < pArray->size) {	156,931,457!
271	memcpy(TARRAY_GET_ELEM(pArray, index), pData, pArray->elemSize);	156,935,658✔
272	}
273	}	156,931,457✔
274
275	void taosArrayPopFrontBatch(SArray* pArray, size_t cnt) {	64,279✔
276	if (cnt > pArray->size) {	64,279✔
277	cnt = pArray->size;	3✔
278	}
279
280	pArray->size = pArray->size - cnt;	64,279✔
281	if (pArray->size == 0 \|\| cnt == 0) {	64,279✔
282	return;	33,502✔
283	}
284	memmove(pArray->pData, (char)pArray->pData + cnt pArray->elemSize, pArray->size * pArray->elemSize);	30,777✔
285	}
286
287	void taosArrayPopTailBatch(SArray* pArray, size_t cnt) {	127,203✔
288	if (cnt >= pArray->size) {	127,203✔
289	cnt = pArray->size;	127,200✔
290	}
291
292	pArray->size = pArray->size - cnt;	127,203✔
293	}	127,203✔
294
295	void taosArrayRemove(SArray* pArray, size_t index) {	23,733,531✔
296	if (!(index < pArray->size)) {	23,733,531!
297	return;	×
298	}
299
300	if (index == pArray->size - 1) {	23,733,531✔
301	void* t = taosArrayPop(pArray);	6,214,907✔
302	return;	6,214,684✔
303	}
304
305	size_t remain = pArray->size - index - 1;	17,518,624✔
306	memmove((char)pArray->pData + index pArray->elemSize, (char)pArray->pData + (index + 1) pArray->elemSize,	17,518,624✔
307	remain * pArray->elemSize);	17,518,624✔
308	pArray->size -= 1;	17,518,624✔
309	}
310
311	void taosArrayRemoveBatch(SArray* pArray, size_t index, size_t num, FDelete fp) {	1,448,405✔
312	if(num == 0) {	1,448,405!
313	return;	×
314	}
315	if (index + num <= pArray->size) {	1,448,405!
316	if (fp) {	1,448,410!
317	for (int32_t i = 0; i < num; i++) {	3,108,130✔
318	fp(taosArrayGet(pArray, index + i));	1,659,717✔
319	}
320	}
321
322	memmove((char)pArray->pData + index pArray->elemSize, (char)pArray->pData + (index + num) pArray->elemSize,	1,448,412✔
323	(pArray->size - index - num) * pArray->elemSize);	1,448,412✔
324	pArray->size -= num;	1,448,412✔
325	}
326	}
327
328	SArray* taosArrayFromList(const void* src, size_t size, size_t elemSize) {	3✔
329	if (elemSize <= 0) {	3!
330	terrno = TSDB_CODE_INVALID_PARA;	×
331	return NULL;	×
332	}
333
334	SArray* pDst = taosArrayInit(size, elemSize);	3✔
335	if (pDst) {	3!
336	memcpy(pDst->pData, src, elemSize * size);	3✔
337	pDst->size = size;	3✔
338	}
339
340	return pDst;	3✔
341	}
342
343	SArray* taosArrayDup(const SArray* pSrc, __array_item_dup_fn_t fn) {	14,545,910✔
344	if (NULL == pSrc) {	14,545,910✔
345	terrno = TSDB_CODE_INVALID_PARA;	153,822✔
346	return NULL;	153,822✔
347	}
348
349	if (pSrc->size == 0) { // empty array list	14,392,088✔
350	return taosArrayInit(8, pSrc->elemSize);	144,890✔
351	}
352
353	SArray* dst = taosArrayInit(pSrc->size, pSrc->elemSize);	14,247,198✔
354
355	if (dst) {	14,250,433!
356	if (fn == NULL) {	14,250,522✔
357	memcpy(dst->pData, pSrc->pData, pSrc->elemSize * pSrc->size);	14,250,122✔
358	} else {
UNCOV 359	for (int32_t i = 0; i < pSrc->size; ++i) {	×
360	void* p = fn(taosArrayGetP(pSrc, i));	405✔
361	memcpy(((char)dst->pData) + i dst->elemSize, &p, dst->elemSize);	×
362	}
363	}
364
365	dst->size = pSrc->size;	14,249,492✔
366	}
367
368	return dst;	14,249,403✔
369	}
370
371	void taosArrayClear(SArray* pArray) {	892,954,721✔
372	if (pArray == NULL) return;	892,954,721✔
373	pArray->size = 0;	812,478,170✔
374	}
375
376	void taosArrayClearEx(SArray* pArray, void (fp)(void)) {	3,387,075✔
377	if (pArray == NULL) return;	3,387,075✔
378	if (fp == NULL) {	3,336,675✔
379	pArray->size = 0;	3✔
380	return;	3✔
381	}
382
383	for (int32_t i = 0; i < pArray->size; ++i) {	11,093,998✔
384	fp(TARRAY_GET_ELEM(pArray, i));	7,757,262✔
385	}
386
387	pArray->size = 0;	3,336,736✔
388	}
389	void taosArrayClearP(SArray* pArray, void (fp)(void)) {	13,242✔
390	// if (pArray == NULL) return;
391	// if (fp == NULL) {
392	// pArray->size = 0;
393	// return;
394	// }
395
396	// for (int32_t i = 0; i < pArray->size; ++i) {
397	// fp(TARRAY_GET_ELEM(pArray, i));
398	// }
399	if (pArray) {	13,242!
400	if (NULL == fp) {	13,242✔
401	for (int32_t i = 0; i < pArray->size; i++) {	907✔
402	taosMemoryFree((void*)TARRAY_GET_ELEM(pArray, i));	33!
403	}
404	} else {
405	for (int32_t i = 0; i < pArray->size; i++) {	41,376✔
406	fp((void*)TARRAY_GET_ELEM(pArray, i));	29,008✔
407	}
408	}
409	}
410	taosArrayClear(pArray);	13,242✔
411	}	13,242✔
412
413	void taosArrayDestroy(SArray* pArray) {	2,147,483,647✔
414	if (pArray) {	2,147,483,647✔
415	taosMemoryFree(pArray->pData);	1,209,806,046!
416	taosMemoryFree(pArray);	1,213,198,513!
417	}
418	}	2,147,483,647✔
419
420	void taosArrayDestroyP(SArray* pArray, FDelete fp) {	10,397,716✔
421	if (pArray) {	10,397,716✔
422	if (NULL == fp) {	8,950,805✔
423	for (int32_t i = 0; i < pArray->size; i++) {	16,562,041✔
424	taosMemoryFree((void*)TARRAY_GET_ELEM(pArray, i));	8,446,842✔
425	}
426	} else {
427	for (int32_t i = 0; i < pArray->size; i++) {	1,450,379✔
428	fp((void*)TARRAY_GET_ELEM(pArray, i));	614,137✔
429	}
430	}
431	taosArrayDestroy(pArray);	8,951,441✔
432	}
433	}	10,398,417✔
434
435	void taosArrayDestroyEx(SArray* pArray, FDelete fp) {	273,078,540✔
436	if (pArray == NULL) {	273,078,540✔
437	return;	130,402,563✔
438	}
439
440	if (fp == NULL) {	142,675,977✔
441	taosArrayDestroy(pArray);	349,057✔
442	return;	349,067✔
443	}
444
445	for (int32_t i = 0; i < pArray->size; ++i) {	416,193,922✔
446	fp(TARRAY_GET_ELEM(pArray, i));	273,870,935✔
447	}
448
449	taosArrayDestroy(pArray);	142,322,987✔
450	}
451
452	void taosArraySort(SArray* pArray, __compar_fn_t compar) {	8,517,381✔
453	taosSort(pArray->pData, pArray->size, pArray->elemSize, compar);	8,517,381✔
454	}	8,522,192✔
455
456	int32_t taosArrayMSort(SArray* pArray, __compar_fn_t compar) {	73,562✔
457	return taosMergeSort(pArray->pData, pArray->size, pArray->elemSize, compar);	73,562✔
458	}
459
460	void* taosArraySearch(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {	43,380,164✔
461	return taosbsearch(key, pArray->pData, pArray->size, pArray->elemSize, comparFn, flags);	43,380,164✔
462	}
463
464	int32_t taosArraySearchIdx(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {	19,228,097✔
465	void* item = taosArraySearch(pArray, key, comparFn, flags);	19,228,097✔
466	return item == NULL ? -1 : (int32_t)((char)item - (char)pArray->pData) / pArray->elemSize;	19,228,756✔
467	}
468
469	#ifdef BUILD_NO_CALL
470	static int32_t taosArrayPartition(SArray* pArray, int32_t i, int32_t j, __ext_compar_fn_t fn, const void* userData) {
471	void* key = taosArrayGetP(pArray, i);
472	while (i < j) {
473	while (i < j && fn(taosArrayGetP(pArray, j), key, userData) >= 0) {
474	j--;
475	}
476	if (i < j) {
477	void* a = taosArrayGetP(pArray, j);
478	taosArraySet(pArray, i, &a);
479	}
480	while (i < j && fn(taosArrayGetP(pArray, i), key, userData) <= 0) {
481	i++;
482	}
483	if (i < j) {
484	void* a = taosArrayGetP(pArray, i);
485	taosArraySet(pArray, j, &a);
486	}
487	}
488	taosArraySet(pArray, i, &key);
489	return i;
490	}
491
492	static void taosArrayQuicksortImpl(SArray* pArray, int32_t low, int32_t high, __ext_compar_fn_t fn, const void* param) {
493	if (low < high) {
494	int32_t idx = taosArrayPartition(pArray, low, high, fn, param);
495	taosArrayQuicksortImpl(pArray, low, idx - 1, fn, param);
496	taosArrayQuicksortImpl(pArray, idx + 1, high, fn, param);
497	}
498	}
499
500	static void taosArrayQuickSort(SArray* pArray, __ext_compar_fn_t fn, const void* param) {
501	if (pArray->size <= 1) {
502	return;
503	}
504	taosArrayQuicksortImpl(pArray, 0, (int32_t)(taosArrayGetSize(pArray) - 1), fn, param);
505	}
506
507	static void taosArrayInsertSort(SArray* pArray, __ext_compar_fn_t fn, const void* param) {
508	if (pArray->size <= 1) {
509	return;
510	}
511
512	for (int32_t i = 1; i <= pArray->size - 1; ++i) {
513	for (int32_t j = i; j > 0; --j) {
514	if (fn(taosArrayGetP(pArray, j), taosArrayGetP(pArray, j - 1), param) == -1) {
515	void* a = taosArrayGetP(pArray, j);
516	void* b = taosArrayGetP(pArray, j - 1);
517	taosArraySet(pArray, j - 1, &a);
518	taosArraySet(pArray, j, &b);
519	} else {
520	break;
521	}
522	}
523	}
524	}
525	#endif
526
527	int32_t taosEncodeArray(void** buf, const SArray* pArray, FEncode encode) {	×
528	int32_t tlen = 0;	×
529	int32_t sz = pArray->size;	×
530	tlen += taosEncodeFixedI32(buf, sz);	×
531	for (int32_t i = 0; i < sz; i++) {	×
532	void* data = taosArrayGetP(pArray, i);	×
533	tlen += encode(buf, data);	×
534	}
535	return tlen;	×
536	}
537
538	void* taosDecodeArray(const void* buf, SArray** pArray, FDecode decode, int32_t dataSz, int8_t sver) {	×
539	int32_t sz;
540	buf = taosDecodeFixedI32(buf, &sz);	×
541	pArray = taosArrayInit(sz, sizeof(void));	×
542	if (*pArray == NULL) {	×
543	return NULL;	×
544	}
545	for (int32_t i = 0; i < sz; i++) {	×
546	void* data = taosMemoryCalloc(1, dataSz);	×
547	if (data == NULL) {	×
548	return NULL;	×
549	}
550
551	buf = decode(buf, data, sver);	×
552
553	if (taosArrayPush(*pArray, &data) == NULL) {	×
554	taosMemoryFree(data);	×
555	return NULL;	×
556	}
557	}
558	return (void*)buf;	×
559	}
560
561	// todo remove it
562	// order array<type *>
563	int32_t taosArraySortPWithExt(SArray* pArray, __ext_compar_fn_t fn, const void* param) {	3✔
564	return taosqsort(pArray->pData, pArray->size, pArray->elemSize, param, fn);	3✔
565	}
566
567	void taosArraySwap(SArray* a, SArray* b) {	×
568	if (a == NULL \|\| b == NULL) return;	×
569	size_t t = a->size;	×
570	a->size = b->size;	×
571	b->size = t;	×
572
573	uint32_t cap = a->capacity;	×
574	a->capacity = b->capacity;	×
575	b->capacity = cap;	×
576
577	uint32_t elem = a->elemSize;	×
578	a->elemSize = b->elemSize;	×
579	b->elemSize = elem;	×
580
581	void* data = a->pData;	×
582	a->pData = b->pData;	×
583	b->pData = data;	×
584	}

taosdata / TDengine / #4772

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