#3561

Committed 19 Dec 2024 03:15AM UTC coverage: 58.812% (-1.3%) from 60.124%

Build # #3561

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

Merge pull request #29213 from taosdata/merge/mainto3.0

merge: from main to 3.0 branch

Run Details

130770 of 287658 branches covered (45.46%)

Branch coverage included in aggregate %.

32 of 78 new or added lines in 4 files covered. (41.03%)

7347 existing lines in 166 files now uncovered.

205356 of 283866 relevant lines covered (72.34%)

7187865.64 hits per line

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

77.48

/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) {	518,171,651✔
26	if (elemSize == 0) {	518,171,651!
UNCOV 27	terrno = TSDB_CODE_INVALID_PARA;	×
UNCOV 28	return NULL;	×
29	}
30
31	if (size < TARRAY_MIN_SIZE) {	518,171,651✔
32	size = TARRAY_MIN_SIZE;	107,865,721✔
33	}
34
35	SArray* pArray = taosMemoryMalloc(sizeof(SArray));	518,171,651!
36	if (pArray == NULL) {	521,911,260!
37	return NULL;	×
38	}
39
40	pArray->size = 0;	521,911,260✔
41	pArray->pData = taosMemoryCalloc(size, elemSize);	521,911,260!
42	if (pArray->pData == NULL) {	526,305,457!
43	taosMemoryFree(pArray);	×
44	return NULL;	×
45	}
46
47	pArray->capacity = size;	526,305,457✔
48	pArray->elemSize = elemSize;	526,305,457✔
49	return pArray;	526,305,457✔
50	}
51
52	SArray* taosArrayInit_s(size_t elemSize, size_t initialSize) {	489,194✔
53	SArray* pArray = taosMemoryMalloc(sizeof(SArray));	489,194!
54	if (pArray == NULL) {	489,224!
55	return NULL;	×
56	}
57
58	pArray->size = initialSize;	489,224✔
59	pArray->pData = taosMemoryCalloc(initialSize, elemSize);	489,224!
60	if (pArray->pData == NULL) {	489,219!
61	taosMemoryFree(pArray);	×
62	return NULL;	×
63	}
64
65	pArray->capacity = initialSize;	489,219✔
66	pArray->elemSize = elemSize;	489,219✔
67	return pArray;	489,219✔
68	}
69
70	static int32_t taosArrayResize(SArray* pArray) {	14✔
71	size_t size = pArray->capacity;	14✔
72	size = (size << 1u);	14✔
73
74	void* tmp = taosMemoryRealloc(pArray->pData, size * pArray->elemSize);	14!
75	if (tmp == NULL) { // reallocate failed, the original buffer remains	14!
76	return terrno;	×
77	}
78
79	pArray->pData = tmp;	14✔
80	pArray->capacity = size;	14✔
81
82	return 0;	14✔
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;	5,854,946✔
88	if (newCap * pArray->elemSize > BOUNDARY_SIZE) {	5,854,946!
89	factor = BOUNDARY_SMALL_FACTOR;	×
90	}
91
92	size_t tsize = (pArray->capacity * factor);	5,854,946✔
93	while (newCap > tsize) {	5,961,187✔
94	size_t newSize = (tsize * factor);	106,241✔
95	tsize = (newSize == tsize) ? (tsize + 2) : newSize;	106,241!
96	}
97
98	char* p = taosMemoryRealloc(pArray->pData, tsize * pArray->elemSize);	5,854,946✔
99	if (p == NULL) {	5,856,519!
100	return terrno;	×
101	}
102
103	pArray->pData = p;	5,856,519✔
104	pArray->capacity = tsize;	5,856,519✔
105	}
106	return 0;	2,147,483,647✔
107	}
108
109	void* taosArrayAddBatch(SArray* pArray, const void* pData, int32_t nEles) {	1,776,491,189✔
110	if (pData == NULL) {	1,776,491,189!
UNCOV 111	terrno = TSDB_CODE_INVALID_PARA;	×
UNCOV 112	return NULL;	×
113	}
114
115	int32_t code = taosArrayEnsureCap(pArray, pArray->size + nEles);	1,776,491,189✔
116	if (code) {	1,775,405,357!
117	terrno = code;	×
118	return NULL;	×
119	}
120
121	void* dst = TARRAY_GET_ELEM(pArray, pArray->size);	1,776,825,091✔
122	memcpy(dst, pData, pArray->elemSize * nEles);	1,776,825,091✔
123
124	pArray->size += nEles;	1,776,825,091✔
125	return dst;	1,776,825,091✔
126	}
127
128	void taosArrayRemoveDuplicate(SArray* pArray, __compar_fn_t comparFn, void (fp)(void)) {	52,275✔
129	size_t size = pArray->size;	52,275✔
130	if (size <= 1) {	52,275✔
131	return;	51,863✔
132	}
133
134	int32_t pos = 0;	412✔
135	for (int32_t i = 1; i < size; ++i) {	1,995✔
136	char* p1 = taosArrayGet(pArray, pos);	1,583✔
137	char* p2 = taosArrayGet(pArray, i);	1,583✔
138
139	if (comparFn(p1, p2) == 0) {	1,583✔
140	// do nothing
141	} else {
142	if (pos + 1 != i) {	1,489✔
143	void* p = taosArrayGet(pArray, pos + 1);	157✔
144	if (fp != NULL) {	157!
UNCOV 145	fp(p);	×
146	}
147
148	taosArraySet(pArray, pos + 1, p2);	157✔
149	memset(TARRAY_GET_ELEM(pArray, i), 0, pArray->elemSize);	157✔
150	pos += 1;	157✔
151	} else {
152	pos += 1;	1,332✔
153	}
154	}
155	}
156
157	if (fp != NULL) {	412✔
158	for (int32_t i = pos + 1; i < pArray->size; ++i) {	93✔
159	void* p = taosArrayGet(pArray, i);	1✔
160	fp(p);	1✔
161	}
162	}
163
164	pArray->size = pos + 1;	463✔
165	}
166
167	void* taosArrayAddAll(SArray* pArray, const SArray* pInput) {	361,795✔
168	if (pInput) {	361,795✔
169	return taosArrayAddBatch(pArray, pInput->pData, (int32_t)taosArrayGetSize(pInput));	359,468✔
170	} else {
171	terrno = TSDB_CODE_INVALID_PARA;	2,327✔
172	return NULL;	2,375✔
173	}
174	}
175
176	void* taosArrayReserve(SArray* pArray, int32_t num) {	643,337,205✔
177	int32_t code = taosArrayEnsureCap(pArray, pArray->size + num);	643,337,205✔
178	if (code) {	642,976,758!
179	terrno = code;	×
180	return NULL;	×
181	}
182
183	void* dst = TARRAY_GET_ELEM(pArray, pArray->size);	643,517,619✔
184	pArray->size += num;	643,517,619✔
185
186	memset(dst, 0, num * pArray->elemSize);	643,517,619✔
187
188	return dst;	643,517,619✔
189	}
190
191	void* taosArrayPop(SArray* pArray) {	18,913,749✔
192	if (pArray->size == 0) {	18,913,749✔
193	return NULL;	209,166✔
194	}
195
196	pArray->size -= 1;	18,704,583✔
197	return TARRAY_GET_ELEM(pArray, pArray->size);	18,704,583✔
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);	640!
209	terrno = TSDB_CODE_OUT_OF_RANGE;	640✔
210	return NULL;	640✔
211	}
212
213	return TARRAY_GET_ELEM(pArray, index);	2,147,483,647✔
214	}
215
216	void* taosArrayGetP(const SArray* pArray, size_t index) {	547,000,982✔
217	void** p = taosArrayGet(pArray, index);	547,000,982✔
218	if (p == NULL) {	545,240,455!
UNCOV 219	return NULL;	×
220	}
221	return *p;	545,240,455✔
222	}
223
224	void* taosArrayGetLast(const SArray* pArray) {	68,672,431✔
225	if (pArray->size == 0) {	68,672,431!
UNCOV 226	terrno = TSDB_CODE_INVALID_PARA;	×
UNCOV 227	return NULL;	×
228	}
229
230	return TARRAY_GET_ELEM(pArray, pArray->size - 1);	68,672,431✔
231	}
232
233	size_t taosArrayGetSize(const SArray* pArray) {	2,147,483,647✔
234	if (pArray == NULL) {	2,147,483,647✔
235	return 0;	122,965,003✔
236	}
237	return TARRAY_SIZE(pArray);	2,147,483,647✔
238	}
239
240	void* taosArrayInsert(SArray* pArray, size_t index, const void* pData) {	7,537,589✔
241	if (pArray == NULL \|\| pData == NULL) {	7,537,589!
242	terrno = TSDB_CODE_INVALID_PARA;	×
UNCOV 243	return NULL;	×
244	}
245
246	if (index >= pArray->size) {	7,537,601✔
247	return taosArrayPush(pArray, pData);	7,536,919✔
248	}
249
250	if (pArray->size >= pArray->capacity) {	673✔
251	int32_t ret = taosArrayResize(pArray);	14✔
252	if (ret < 0) {	14✔
253	terrno = ret;	7✔
254	return NULL;	×
255	}
256	}
257
258	void* dst = TARRAY_GET_ELEM(pArray, index);	666✔
259
260	int32_t remain = (int32_t)(pArray->size - index);	666✔
261	memmove((char)dst + pArray->elemSize, (char)dst, pArray->elemSize * remain);	666✔
262	memcpy(dst, pData, pArray->elemSize);	666✔
263
264	pArray->size += 1;	666✔
265
266	return dst;	666✔
267	}
268
269	void taosArraySet(SArray* pArray, size_t index, void* pData) {	19,138,065✔
270	if (index < pArray->size) {	19,138,065!
271	memcpy(TARRAY_GET_ELEM(pArray, index), pData, pArray->elemSize);	19,139,535✔
272	}
273	}	19,138,065✔
274
275	void taosArrayPopFrontBatch(SArray* pArray, size_t cnt) {	10,618✔
276	if (cnt > pArray->size) {	10,618!
UNCOV 277	cnt = pArray->size;	×
278	}
279
280	pArray->size = pArray->size - cnt;	10,618✔
281	if (pArray->size == 0 \|\| cnt == 0) {	10,618✔
282	return;	10,496✔
283	}
284	memmove(pArray->pData, (char)pArray->pData + cnt pArray->elemSize, pArray->size * pArray->elemSize);	122✔
285	}
286
287	void taosArrayPopTailBatch(SArray* pArray, size_t cnt) {	89,064✔
288	if (cnt >= pArray->size) {	89,064✔
289	cnt = pArray->size;	54,499✔
290	}
291
292	pArray->size = pArray->size - cnt;	89,064✔
293	}	89,064✔
294
295	void taosArrayRemove(SArray* pArray, size_t index) {	2,913,051✔
296	if (!(index < pArray->size)) {	2,913,051!
297	return;	×
298	}
299
300	if (index == pArray->size - 1) {	2,913,051✔
301	void* t = taosArrayPop(pArray);	763,298✔
302	return;	763,292✔
303	}
304
305	size_t remain = pArray->size - index - 1;	2,149,753✔
306	memmove((char)pArray->pData + index pArray->elemSize, (char)pArray->pData + (index + 1) pArray->elemSize,	2,149,753✔
307	remain * pArray->elemSize);	2,149,753✔
308	pArray->size -= 1;	2,149,753✔
309	}
310
311	void taosArrayRemoveBatch(SArray* pArray, size_t index, size_t num, FDelete fp) {	175,601✔
312	if (index + num <= pArray->size) {	175,601!
313	if (fp) {	175,610✔
314	for (int32_t i = 0; i < num; i++) {	347,738✔
315	fp(taosArrayGet(pArray, index + i));	174,142✔
316	}
317	}
318
319	memmove((char)pArray->pData + index pArray->elemSize, (char)pArray->pData + (index + num) pArray->elemSize,	175,613✔
320	(pArray->size - index - num) * pArray->elemSize);	175,613✔
321	pArray->size -= num;	175,613✔
322	}
323	}	175,604✔
324
UNCOV 325	SArray* taosArrayFromList(const void* src, size_t size, size_t elemSize) {	×
UNCOV 326	if (elemSize <= 0) {	×
327	terrno = TSDB_CODE_INVALID_PARA;	×
328	return NULL;	×
329	}
330
UNCOV 331	SArray* pDst = taosArrayInit(size, elemSize);	×
UNCOV 332	if (pDst) {	×
UNCOV 333	memcpy(pDst->pData, src, elemSize * size);	×
UNCOV 334	pDst->size = size;	×
335	}
336
UNCOV 337	return pDst;	×
338	}
339
340	SArray* taosArrayDup(const SArray* pSrc, __array_item_dup_fn_t fn) {	2,805,134✔
341	if (NULL == pSrc) {	2,805,134✔
342	terrno = TSDB_CODE_INVALID_PARA;	7,677✔
343	return NULL;	7,677✔
344	}
345
346	if (pSrc->size == 0) { // empty array list	2,797,457✔
347	return taosArrayInit(8, pSrc->elemSize);	44,492✔
348	}
349
350	SArray* dst = taosArrayInit(pSrc->size, pSrc->elemSize);	2,752,965✔
351
352	if (dst) {	2,753,238!
353	if (fn == NULL) {	2,753,245✔
354	memcpy(dst->pData, pSrc->pData, pSrc->elemSize * pSrc->size);	2,752,033✔
355	} else {
356	for (int32_t i = 0; i < pSrc->size; ++i) {	3,297✔
357	void* p = fn(taosArrayGetP(pSrc, i));	2,132✔
358	memcpy(((char)dst->pData) + i dst->elemSize, &p, dst->elemSize);	2,085✔
359	}
360	}
361
362	dst->size = pSrc->size;	2,753,198✔
363	}
364
365	return dst;	2,753,191✔
366	}
367
368	void taosArrayClear(SArray* pArray) {	74,840,244✔
369	if (pArray == NULL) return;	74,840,244✔
370	pArray->size = 0;	66,602,937✔
371	}
372
373	void taosArrayClearEx(SArray* pArray, void (fp)(void)) {	3,827,868✔
374	if (pArray == NULL) return;	3,827,868!
375	if (fp == NULL) {	3,827,868!
UNCOV 376	pArray->size = 0;	×
UNCOV 377	return;	×
378	}
379
380	for (int32_t i = 0; i < pArray->size; ++i) {	132,676,629✔
381	fp(TARRAY_GET_ELEM(pArray, i));	128,786,933✔
382	}
383
384	pArray->size = 0;	3,889,696✔
385	}
386	void taosArrayClearP(SArray* pArray, void (fp)(void)) {	189✔
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) {	189!
397	if (NULL == fp) {	189!
398	for (int32_t i = 0; i < pArray->size; i++) {	192✔
399	taosMemoryFree((void*)TARRAY_GET_ELEM(pArray, i));	3!
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);	189✔
408	}	189✔
409
410	void taosArrayDestroy(SArray* pArray) {	965,260,151✔
411	if (pArray) {	965,260,151✔
412	taosMemoryFree(pArray->pData);	529,135,666!
413	taosMemoryFree(pArray);	530,915,889!
414	}
415	}	966,398,861✔
416
417	void taosArrayDestroyP(SArray* pArray, FDelete fp) {	133,221,510✔
418	if (pArray) {	133,221,510✔
419	if (NULL == fp) {	129,612,058✔
420	for (int32_t i = 0; i < pArray->size; i++) {	3,838,703✔
421	taosMemoryFree((void*)TARRAY_GET_ELEM(pArray, i));	2,532,396✔
422	}
423	} else {
424	for (int32_t i = 0; i < pArray->size; i++) {	258,943,185✔
425	fp((void*)TARRAY_GET_ELEM(pArray, i));	130,207,952✔
426	}
427	}
428	taosArrayDestroy(pArray);	130,041,540✔
429	}
430	}	133,619,490✔
431
432	void taosArrayDestroyEx(SArray* pArray, FDelete fp) {	121,489,841✔
433	if (pArray == NULL) {	121,489,841✔
434	return;	79,998,563✔
435	}
436
437	if (fp == NULL) {	41,491,278✔
438	taosArrayDestroy(pArray);	369,008✔
439	return;	369,010✔
440	}
441
442	for (int32_t i = 0; i < pArray->size; ++i) {	140,519,672✔
443	fp(TARRAY_GET_ELEM(pArray, i));	99,397,490✔
444	}
445
446	taosArrayDestroy(pArray);	41,122,182✔
447	}
448
449	void taosArraySort(SArray* pArray, __compar_fn_t compar) {	3,423,652✔
450	taosSort(pArray->pData, pArray->size, pArray->elemSize, compar);	3,423,652✔
451	}	3,423,725✔
452
453	int32_t taosArrayMSort(SArray* pArray, __compar_fn_t compar) {	9,301✔
454	return taosMergeSort(pArray->pData, pArray->size, pArray->elemSize, compar);	9,301✔
455	}
456
457	void* taosArraySearch(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {	15,029,379✔
458	return taosbsearch(key, pArray->pData, pArray->size, pArray->elemSize, comparFn, flags);	15,029,379✔
459	}
460
461	int32_t taosArraySearchIdx(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {	1,482,670✔
462	void* item = taosArraySearch(pArray, key, comparFn, flags);	1,482,670✔
463	return item == NULL ? -1 : (int32_t)((char)item - (char)pArray->pData) / pArray->elemSize;	1,482,827✔
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
524	int32_t taosEncodeArray(void** buf, const SArray* pArray, FEncode encode) {	3,786✔
525	int32_t tlen = 0;	3,786✔
526	int32_t sz = pArray->size;	3,786✔
527	tlen += taosEncodeFixedI32(buf, sz);	3,786✔
528	for (int32_t i = 0; i < sz; i++) {	11,120✔
529	void* data = taosArrayGetP(pArray, i);	7,334✔
530	tlen += encode(buf, data);	7,334✔
531	}
532	return tlen;	3,786✔
533	}
534
535	void* taosDecodeArray(const void* buf, SArray** pArray, FDecode decode, int32_t dataSz, int8_t sver) {	1,713!
536	int32_t sz;
537	buf = taosDecodeFixedI32(buf, &sz);	1,713✔
538	pArray = taosArrayInit(sz, sizeof(void));	1,713✔
539	if (*pArray == NULL) {	1,713!
540	return NULL;	×
541	}
542	for (int32_t i = 0; i < sz; i++) {	4,995✔
543	void* data = taosMemoryCalloc(1, dataSz);	3,282!
544	if (data == NULL) {	3,282!
545	return NULL;	×
546	}
547
548	buf = decode(buf, data, sver);	3,282✔
549
550	if (taosArrayPush(*pArray, &data) == NULL) {	6,564!
551	taosMemoryFree(data);	×
552	return NULL;	×
553	}
554	}
555	return (void*)buf;	1,713✔
556	}
557
558	// todo remove it
559	// order array<type *>
UNCOV 560	int32_t taosArraySortPWithExt(SArray* pArray, __ext_compar_fn_t fn, const void* param) {	×
UNCOV 561	return taosqsort(pArray->pData, pArray->size, pArray->elemSize, param, fn);	×
562	}
563
564	void taosArraySwap(SArray* a, SArray* b) {	44✔
565	if (a == NULL \|\| b == NULL) return;	44!
566	size_t t = a->size;	44✔
567	a->size = b->size;	44✔
568	b->size = t;	44✔
569
570	uint32_t cap = a->capacity;	44✔
571	a->capacity = b->capacity;	44✔
572	b->capacity = cap;	44✔
573
574	uint32_t elem = a->elemSize;	44✔
575	a->elemSize = b->elemSize;	44✔
576	b->elemSize = elem;	44✔
577
578	void* data = a->pData;	44✔
579	a->pData = b->pData;	44✔
580	b->pData = data;	44✔
581	}

taosdata / TDengine / #3561

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