#3548

Committed 04 Dec 2024 01:03PM UTC coverage: 59.846% (-0.8%) from 60.691%

Build # #3548

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

Merge pull request #29033 from taosdata/fix/calculate-vnode-memory-used

fix/calculate-vnode-memory-used

Run Details

118484 of 254183 branches covered (46.61%)

Branch coverage included in aggregate %.

199691 of 277471 relevant lines covered (71.97%)

18794141.86 hits per line

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

76.4

/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) {
    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) {
    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) {	858,494,661✔
26	if (elemSize == 0) {	858,494,661!
27	terrno = TSDB_CODE_INVALID_PARA;	×
28	return NULL;	×
29	}
30
31	if (size < TARRAY_MIN_SIZE) {	858,494,661✔
32	size = TARRAY_MIN_SIZE;	205,818,014✔
33	}
34
35	SArray* pArray = taosMemoryMalloc(sizeof(SArray));	858,494,661✔
36	if (pArray == NULL) {	858,825,034!
37	return NULL;	×
38	}
39
40	pArray->size = 0;	858,825,034✔
41	pArray->pData = taosMemoryCalloc(size, elemSize);	858,825,034✔
42	if (pArray->pData == NULL) {	867,724,664✔
43	taosMemoryFree(pArray);	455,834✔
44	return NULL;	×
45	}
46
47	pArray->capacity = size;	867,268,830✔
48	pArray->elemSize = elemSize;	867,268,830✔
49	return pArray;	867,268,830✔
50	}
51
52	SArray* taosArrayInit_s(size_t elemSize, size_t initialSize) {	2,417,810✔
53	SArray* pArray = taosMemoryMalloc(sizeof(SArray));	2,417,810✔
54	if (pArray == NULL) {	2,417,938!
55	return NULL;	×
56	}
57
58	pArray->size = initialSize;	2,417,938✔
59	pArray->pData = taosMemoryCalloc(initialSize, elemSize);	2,417,938✔
60	if (pArray->pData == NULL) {	2,417,929!
61	taosMemoryFree(pArray);	×
62	return NULL;	×
63	}
64
65	pArray->capacity = initialSize;	2,417,935✔
66	pArray->elemSize = elemSize;	2,417,935✔
67	return pArray;	2,417,935✔
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;	34,844,826✔
88	if (newCap * pArray->elemSize > BOUNDARY_SIZE) {	34,844,826!
89	factor = BOUNDARY_SMALL_FACTOR;	×
90	}
91
92	size_t tsize = (pArray->capacity * factor);	34,844,826✔
93	while (newCap > tsize) {	35,317,455✔
94	size_t newSize = (tsize * factor);	472,629✔
95	tsize = (newSize == tsize) ? (tsize + 2) : newSize;	472,629!
96	}
97
98	char* p = taosMemoryRealloc(pArray->pData, tsize * pArray->elemSize);	34,844,826✔
99	if (p == NULL) {	34,849,331!
100	return terrno;	×
101	}
102
103	pArray->pData = p;	34,851,069✔
104	pArray->capacity = tsize;	34,851,069✔
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;	×
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)) {	934,534✔
129	size_t size = pArray->size;	934,534✔
130	if (size <= 1) {	934,534!
131	return;	934,752✔
132	}
133
134	int32_t pos = 0;	×
135	for (int32_t i = 1; i < size; ++i) {	1,319!
136	char* p1 = taosArrayGet(pArray, pos);	1,537✔
137	char* p2 = taosArrayGet(pArray, i);	1,537✔
138
139	if (comparFn(p1, p2) == 0) {	1,537✔
140	// do nothing
141	} else {
142	if (pos + 1 != i) {	1,463✔
143	void* p = taosArrayGet(pArray, pos + 1);	92✔
144	if (fp != NULL) {	92!
145	fp(p);	×
146	}
147
148	taosArraySet(pArray, pos + 1, p2);	92✔
149	memset(TARRAY_GET_ELEM(pArray, i), 0, pArray->elemSize);	92✔
150	pos += 1;	92✔
151	} else {
152	pos += 1;	1,371✔
153	}
154	}
155	}
156
157	if (fp != NULL) {	×
158	for (int32_t i = pos + 1; i < pArray->size; ++i) {	702✔
159	void* p = taosArrayGet(pArray, i);	1✔
160	fp(p);	1✔
161	}
162	}
163
164	pArray->size = pos + 1;	440✔
165	}
166
167	void* taosArrayAddAll(SArray* pArray, const SArray* pInput) {	3,175,410✔
168	if (pInput) {	3,175,410✔
169	return taosArrayAddBatch(pArray, pInput->pData, (int32_t)taosArrayGetSize(pInput));	3,171,365✔
170	} else {
171	terrno = TSDB_CODE_INVALID_PARA;	4,045✔
172	return NULL;	4,451✔
173	}
174	}
175
176	void* taosArrayReserve(SArray* pArray, int32_t num) {	1,636,646,166✔
177	int32_t code = taosArrayEnsureCap(pArray, pArray->size + num);	1,636,646,166✔
178	if (code) {	1,635,954,182!
179	terrno = code;	×
180	return NULL;	×
181	}
182
183	void* dst = TARRAY_GET_ELEM(pArray, pArray->size);	1,636,570,286✔
184	pArray->size += num;	1,636,570,286✔
185
186	memset(dst, 0, num * pArray->elemSize);	1,636,570,286✔
187
188	return dst;	1,636,570,286✔
189	}
190
191	void* taosArrayPop(SArray* pArray) {	58,210,913✔
192	if (pArray->size == 0) {	58,210,913✔
193	return NULL;	1,053,346✔
194	}
195
196	pArray->size -= 1;	57,157,567✔
197	return TARRAY_GET_ELEM(pArray, pArray->size);	57,157,567✔
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;	×
203	uError("failed to return value from array of null ptr");	×
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);	610!
209	terrno = TSDB_CODE_OUT_OF_RANGE;	610✔
210	return NULL;	610✔
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,264,875,640✔
217	void** p = taosArrayGet(pArray, index);	1,264,875,640✔
218	if (p == NULL) {	1,262,871,680!
219	return NULL;	×
220	}
221	return *p;	1,262,871,680✔
222	}
223
224	void* taosArrayGetLast(const SArray* pArray) {	147,966,412✔
225	if (pArray->size == 0) {	147,966,412!
226	terrno = TSDB_CODE_INVALID_PARA;	×
227	return NULL;	×
228	}
229
230	return TARRAY_GET_ELEM(pArray, pArray->size - 1);	147,966,412✔
231	}
232
233	size_t taosArrayGetSize(const SArray* pArray) {	2,147,483,647✔
234	if (pArray == NULL) {	2,147,483,647✔
235	return 0;	175,432,835✔
236	}
237	return TARRAY_SIZE(pArray);	2,147,483,647✔
238	}
239
240	void* taosArrayInsert(SArray* pArray, size_t index, const void* pData) {	8,584,738✔
241	if (pArray == NULL \|\| pData == NULL) {	8,584,738!
242	terrno = TSDB_CODE_INVALID_PARA;	×
243	return NULL;	×
244	}
245
246	if (index >= pArray->size) {	8,584,777✔
247	return taosArrayPush(pArray, pData);	8,584,069✔
248	}
249
250	if (pArray->size >= pArray->capacity) {	699!
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);	705✔
259
260	int32_t remain = (int32_t)(pArray->size - index);	705✔
261	memmove((char)dst + pArray->elemSize, (char)dst, pArray->elemSize * remain);	705✔
262	memcpy(dst, pData, pArray->elemSize);	705✔
263
264	pArray->size += 1;	705✔
265
266	return dst;	705✔
267	}
268
269	void taosArraySet(SArray* pArray, size_t index, void* pData) {	131,669,571✔
270	if (index < pArray->size) {	131,669,571!
271	memcpy(TARRAY_GET_ELEM(pArray, index), pData, pArray->elemSize);	131,686,603✔
272	}
273	}	131,669,571✔
274
275	void taosArrayPopFrontBatch(SArray* pArray, size_t cnt) {	29,058✔
276	if (cnt > pArray->size) {	29,058!
277	cnt = pArray->size;	×
278	}
279
280	pArray->size = pArray->size - cnt;	29,058✔
281	if (pArray->size == 0 \|\| cnt == 0) {	29,058✔
282	return;	28,844✔
283	}
284	memmove(pArray->pData, (char)pArray->pData + cnt pArray->elemSize, pArray->size * pArray->elemSize);	214✔
285	}
286
287	void taosArrayPopTailBatch(SArray* pArray, size_t cnt) {	176,937✔
288	if (cnt >= pArray->size) {	176,937✔
289	cnt = pArray->size;	141,577✔
290	}
291
292	pArray->size = pArray->size - cnt;	176,937✔
293	}	176,937✔
294
295	void taosArrayRemove(SArray* pArray, size_t index) {	13,327,918✔
296	if (!(index < pArray->size)) {	13,327,918!
297	return;	×
298	}
299
300	if (index == pArray->size - 1) {	13,327,918✔
301	void* t = taosArrayPop(pArray);	3,592,475✔
302	return;	3,592,269✔
303	}
304
305	size_t remain = pArray->size - index - 1;	9,735,443✔
306	memmove((char)pArray->pData + index pArray->elemSize, (char)pArray->pData + (index + 1) pArray->elemSize,	9,735,443✔
307	remain * pArray->elemSize);	9,735,443✔
308	pArray->size -= 1;	9,735,443✔
309	}
310
311	void taosArrayRemoveBatch(SArray* pArray, size_t index, size_t num, FDelete fp) {	736,274✔
312	if (index + num <= pArray->size) {	736,274!
313	if (fp) {	736,285✔
314	for (int32_t i = 0; i < num; i++) {	1,471,004✔
315	fp(taosArrayGet(pArray, index + i));	735,890✔
316	}
317	}
318
319	memmove((char)pArray->pData + index pArray->elemSize, (char)pArray->pData + (index + num) pArray->elemSize,	736,277✔
320	(pArray->size - index - num) * pArray->elemSize);	736,277✔
321	pArray->size -= num;	736,277✔
322	}
323	}	736,266✔
324
325	SArray* taosArrayFromList(const void* src, size_t size, size_t elemSize) {	×
326	if (elemSize <= 0) {	×
327	terrno = TSDB_CODE_INVALID_PARA;	×
328	return NULL;	×
329	}
330
331	SArray* pDst = taosArrayInit(size, elemSize);	×
332	if (pDst) {	×
333	memcpy(pDst->pData, src, elemSize * size);	×
334	pDst->size = size;	×
335	}
336
337	return pDst;	×
338	}
339
340	SArray* taosArrayDup(const SArray* pSrc, __array_item_dup_fn_t fn) {	9,463,142✔
341	if (NULL == pSrc) {	9,463,142✔
342	terrno = TSDB_CODE_INVALID_PARA;	88,858✔
343	return NULL;	88,858✔
344	}
345
346	if (pSrc->size == 0) { // empty array list	9,374,284✔
347	return taosArrayInit(8, pSrc->elemSize);	51,300✔
348	}
349
350	SArray* dst = taosArrayInit(pSrc->size, pSrc->elemSize);	9,322,984✔
351
352	if (dst) {	9,325,702!
353	if (fn == NULL) {	9,325,819✔
354	memcpy(dst->pData, pSrc->pData, pSrc->elemSize * pSrc->size);	9,324,476✔
355	} else {
356	for (int32_t i = 0; i < pSrc->size; ++i) {	3,514✔
357	void* p = fn(taosArrayGetP(pSrc, i));	2,295✔
358	memcpy(((char)dst->pData) + i dst->elemSize, &p, dst->elemSize);	2,171✔
359	}
360	}
361
362	dst->size = pSrc->size;	9,325,695✔
363	}
364
365	return dst;	9,325,578✔
366	}
367
368	void taosArrayClear(SArray* pArray) {	590,019,764✔
369	if (pArray == NULL) return;	590,019,764✔
370	pArray->size = 0;	552,829,330✔
371	}
372
373	void taosArrayClearEx(SArray* pArray, void (fp)(void)) {	4,984,990✔
374	if (pArray == NULL) return;	4,984,990!
375	if (fp == NULL) {	4,984,990!
376	pArray->size = 0;	×
377	return;	×
378	}
379
380	for (int32_t i = 0; i < pArray->size; ++i) {	134,902,397✔
381	fp(TARRAY_GET_ELEM(pArray, i));	129,858,805✔
382	}
383
384	pArray->size = 0;	5,043,592✔
385	}
386	void taosArrayClearP(SArray* pArray, void (fp)(void)) {	463✔
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) {	463!
397	for (int32_t i = 0; i < pArray->size; i++) {	469✔
398	fp((void*)TARRAY_GET_ELEM(pArray, i));	6✔
399	}
400	}
401	taosArrayClear(pArray);	463✔
402	}	463✔
403
404	void taosArrayDestroy(SArray* pArray) {	1,886,840,930✔
405	if (pArray) {	1,886,840,930✔
406	taosMemoryFree(pArray->pData);	870,148,711✔
407	taosMemoryFree(pArray);	871,896,675✔
408	}
409	}	1,886,404,850✔
410
411	void taosArrayDestroyP(SArray* pArray, FDelete fp) {	137,329,938✔
412	if (pArray) {	137,329,938✔
413	for (int32_t i = 0; i < pArray->size; i++) {	269,734,933✔
414	fp((void*)TARRAY_GET_ELEM(pArray, i));	135,991,202✔
415	}
416	taosArrayDestroy(pArray);	133,743,731✔
417	}
418	}	137,948,545✔
419
420	void taosArrayDestroyEx(SArray* pArray, FDelete fp) {	174,882,290✔
421	if (pArray == NULL) {	174,882,290✔
422	return;	89,028,807✔
423	}
424
425	if (fp == NULL) {	85,853,483✔
426	taosArrayDestroy(pArray);	525,723✔
427	return;	525,734✔
428	}
429
430	for (int32_t i = 0; i < pArray->size; ++i) {	238,462,227✔
431	fp(TARRAY_GET_ELEM(pArray, i));	153,139,108✔
432	}
433
434	taosArrayDestroy(pArray);	85,323,119✔
435	}
436
437	void taosArraySort(SArray* pArray, __compar_fn_t compar) {	5,239,099✔
438	taosSort(pArray->pData, pArray->size, pArray->elemSize, compar);	5,239,099✔
439	}	5,238,717✔
440
441	int32_t taosArrayMSort(SArray* pArray, __compar_fn_t compar) {	34,233✔
442	return taosMergeSort(pArray->pData, pArray->size, pArray->elemSize, compar);	34,233✔
443	}
444
445	void* taosArraySearch(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {	23,233,610✔
446	return taosbsearch(key, pArray->pData, pArray->size, pArray->elemSize, comparFn, flags);	23,233,610✔
447	}
448
449	int32_t taosArraySearchIdx(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {	9,272,334✔
450	void* item = taosArraySearch(pArray, key, comparFn, flags);	9,272,334✔
451	return item == NULL ? -1 : (int32_t)((char)item - (char)pArray->pData) / pArray->elemSize;	9,274,432✔
452	}
453
454	#ifdef BUILD_NO_CALL
455	static int32_t taosArrayPartition(SArray* pArray, int32_t i, int32_t j, __ext_compar_fn_t fn, const void* userData) {
456	void* key = taosArrayGetP(pArray, i);
457	while (i < j) {
458	while (i < j && fn(taosArrayGetP(pArray, j), key, userData) >= 0) {
459	j--;
460	}
461	if (i < j) {
462	void* a = taosArrayGetP(pArray, j);
463	taosArraySet(pArray, i, &a);
464	}
465	while (i < j && fn(taosArrayGetP(pArray, i), key, userData) <= 0) {
466	i++;
467	}
468	if (i < j) {
469	void* a = taosArrayGetP(pArray, i);
470	taosArraySet(pArray, j, &a);
471	}
472	}
473	taosArraySet(pArray, i, &key);
474	return i;
475	}
476
477	static void taosArrayQuicksortImpl(SArray* pArray, int32_t low, int32_t high, __ext_compar_fn_t fn, const void* param) {
478	if (low < high) {
479	int32_t idx = taosArrayPartition(pArray, low, high, fn, param);
480	taosArrayQuicksortImpl(pArray, low, idx - 1, fn, param);
481	taosArrayQuicksortImpl(pArray, idx + 1, high, fn, param);
482	}
483	}
484
485	static void taosArrayQuickSort(SArray* pArray, __ext_compar_fn_t fn, const void* param) {
486	if (pArray->size <= 1) {
487	return;
488	}
489	taosArrayQuicksortImpl(pArray, 0, (int32_t)(taosArrayGetSize(pArray) - 1), fn, param);
490	}
491
492	static void taosArrayInsertSort(SArray* pArray, __ext_compar_fn_t fn, const void* param) {
493	if (pArray->size <= 1) {
494	return;
495	}
496
497	for (int32_t i = 1; i <= pArray->size - 1; ++i) {
498	for (int32_t j = i; j > 0; --j) {
499	if (fn(taosArrayGetP(pArray, j), taosArrayGetP(pArray, j - 1), param) == -1) {
500	void* a = taosArrayGetP(pArray, j);
501	void* b = taosArrayGetP(pArray, j - 1);
502	taosArraySet(pArray, j - 1, &a);
503	taosArraySet(pArray, j, &b);
504	} else {
505	break;
506	}
507	}
508	}
509	}
510	#endif
511
512	int32_t taosEncodeArray(void** buf, const SArray* pArray, FEncode encode) {	5,042✔
513	int32_t tlen = 0;	5,042✔
514	int32_t sz = pArray->size;	5,042✔
515	tlen += taosEncodeFixedI32(buf, sz);	5,042✔
516	for (int32_t i = 0; i < sz; i++) {	13,152✔
517	void* data = taosArrayGetP(pArray, i);	8,110✔
518	tlen += encode(buf, data);	8,110✔
519	}
520	return tlen;	5,042✔
521	}
522
523	void* taosDecodeArray(const void* buf, SArray** pArray, FDecode decode, int32_t dataSz, int8_t sver) {	1,956!
524	int32_t sz;
525	buf = taosDecodeFixedI32(buf, &sz);	1,956✔
526	pArray = taosArrayInit(sz, sizeof(void));	1,956✔
527	if (*pArray == NULL) {	1,956!
528	return NULL;	×
529	}
530	for (int32_t i = 0; i < sz; i++) {	5,431✔
531	void* data = taosMemoryCalloc(1, dataSz);	3,475✔
532	if (data == NULL) {	3,475!
533	return NULL;	×
534	}
535
536	buf = decode(buf, data, sver);	3,475✔
537
538	if (taosArrayPush(*pArray, &data) == NULL) {	6,950!
539	taosMemoryFree(data);	×
540	return NULL;	×
541	}
542	}
543	return (void*)buf;	1,956✔
544	}
545
546	// todo remove it
547	// order array<type *>
548	int32_t taosArraySortPWithExt(SArray* pArray, __ext_compar_fn_t fn, const void* param) {	×
549	return taosqsort(pArray->pData, pArray->size, pArray->elemSize, param, fn);	×
550	}
551
552	void taosArraySwap(SArray* a, SArray* b) {	35✔
553	if (a == NULL \|\| b == NULL) return;	35!
554	size_t t = a->size;	35✔
555	a->size = b->size;	35✔
556	b->size = t;	35✔
557
558	uint32_t cap = a->capacity;	35✔
559	a->capacity = b->capacity;	35✔
560	b->capacity = cap;	35✔
561
562	uint32_t elem = a->elemSize;	35✔
563	a->elemSize = b->elemSize;	35✔
564	b->elemSize = elem;	35✔
565
566	void* data = a->pData;	35✔
567	a->pData = b->pData;	35✔
568	b->pData = data;	35✔
569	}

taosdata / TDengine / #3548

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