• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

taosdata / TDengine / #3531

19 Nov 2024 10:42AM UTC coverage: 60.213% (-0.006%) from 60.219%
#3531

push

travis-ci

web-flow
Merge pull request #28777 from taosdata/fix/3.0/TD-32366

fix:TD-32366/stmt add geometry datatype check

118529 of 252344 branches covered (46.97%)

Branch coverage included in aggregate %.

7 of 48 new or added lines in 3 files covered. (14.58%)

2282 existing lines in 115 files now uncovered.

199096 of 275161 relevant lines covered (72.36%)

6067577.83 hits per line

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

77.53
/source/util/src/tarray.c
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) {
390,670,186✔
26
  if (elemSize == 0) {
390,670,186!
27
    terrno = TSDB_CODE_INVALID_PARA;
×
28
    return NULL;
×
29
  }
30

31
  if (size < TARRAY_MIN_SIZE) {
390,670,186✔
32
    size = TARRAY_MIN_SIZE;
76,279,421✔
33
  }
34

35
  SArray* pArray = taosMemoryMalloc(sizeof(SArray));
390,670,186✔
36
  if (pArray == NULL) {
390,543,601!
37
    return NULL;
×
38
  }
39

40
  pArray->size = 0;
390,543,601✔
41
  pArray->pData = taosMemoryCalloc(size, elemSize);
390,543,601✔
42
  if (pArray->pData == NULL) {
395,205,598!
UNCOV
43
    taosMemoryFree(pArray);
×
UNCOV
44
    return NULL;
×
45
  }
46

47
  pArray->capacity = size;
395,308,639✔
48
  pArray->elemSize = elemSize;
395,308,639✔
49
  return pArray;
395,308,639✔
50
}
51

52
SArray* taosArrayInit_s(size_t elemSize, size_t initialSize) {
1,436,561✔
53
  SArray* pArray = taosMemoryMalloc(sizeof(SArray));
1,436,561✔
54
  if (pArray == NULL) {
1,436,564!
55
    return NULL;
×
56
  }
57

58
  pArray->size = initialSize;
1,436,564✔
59
  pArray->pData = taosMemoryCalloc(initialSize, elemSize);
1,436,564✔
60
  if (pArray->pData == NULL) {
1,436,563✔
61
    taosMemoryFree(pArray);
1✔
62
    return NULL;
×
63
  }
64

65
  pArray->capacity = initialSize;
1,436,562✔
66
  pArray->elemSize = elemSize;
1,436,562✔
67
  return pArray;
1,436,562✔
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;
6,712,538✔
88
    if (newCap * pArray->elemSize > BOUNDARY_SIZE) {
6,712,538!
89
      factor = BOUNDARY_SMALL_FACTOR;
×
90
    }
91

92
    size_t tsize = (pArray->capacity * factor);
6,712,538✔
93
    while (newCap > tsize) {
6,815,442✔
94
      size_t newSize = (tsize * factor);
102,904✔
95
      tsize = (newSize == tsize) ? (tsize + 2) : newSize;
102,904!
96
    }
97

98
    char* p = taosMemoryRealloc(pArray->pData, tsize * pArray->elemSize);
6,712,538✔
99
    if (p == NULL) {
6,720,167!
100
      return terrno;
×
101
    }
102

103
    pArray->pData = p;
6,720,344✔
104
    pArray->capacity = tsize;
6,720,344✔
105
  }
106
  return 0;
2,147,483,647✔
107
}
108

109
void* taosArrayAddBatch(SArray* pArray, const void* pData, int32_t nEles) {
1,963,934,447✔
110
  if (pData == NULL) {
1,963,934,447!
111
    terrno = TSDB_CODE_INVALID_PARA;
×
112
    return NULL;
×
113
  }
114

115
  int32_t code = taosArrayEnsureCap(pArray, pArray->size + nEles);
1,963,934,447✔
116
  if (code) {
1,961,586,595!
117
    terrno = code;
×
118
    return NULL;
×
119
  }
120

121
  void* dst = TARRAY_GET_ELEM(pArray, pArray->size);
1,998,350,248✔
122
  memcpy(dst, pData, pArray->elemSize * nEles);
1,998,350,248✔
123

124
  pArray->size += nEles;
1,998,350,248✔
125
  return dst;
1,998,350,248✔
126
}
127

128
void taosArrayRemoveDuplicate(SArray* pArray, __compar_fn_t comparFn, void (*fp)(void*)) {
39,262✔
129
  size_t size = pArray->size;
39,262✔
130
  if (size <= 1) {
39,262✔
131
    return;
38,794✔
132
  }
133

134
  int32_t pos = 0;
468✔
135
  for (int32_t i = 1; i < size; ++i) {
5,645✔
136
    char* p1 = taosArrayGet(pArray, pos);
5,177✔
137
    char* p2 = taosArrayGet(pArray, i);
5,177✔
138

139
    if (comparFn(p1, p2) == 0) {
5,177✔
140
      // do nothing
141
    } else {
142
      if (pos + 1 != i) {
5,113✔
143
        void* p = taosArrayGet(pArray, pos + 1);
77✔
144
        if (fp != NULL) {
77!
145
          fp(p);
×
146
        }
147

148
        taosArraySet(pArray, pos + 1, p2);
77✔
149
        memset(TARRAY_GET_ELEM(pArray, i), 0, pArray->elemSize);
77✔
150
        pos += 1;
77✔
151
      } else {
152
        pos += 1;
5,036✔
153
      }
154
    }
155
  }
156

157
  if (fp != NULL) {
468✔
158
    for (int32_t i = pos + 1; i < pArray->size; ++i) {
78✔
159
      void* p = taosArrayGet(pArray, i);
1✔
160
      fp(p);
1✔
161
    }
162
  }
163

164
  pArray->size = pos + 1;
502✔
165
}
166

167
void* taosArrayAddAll(SArray* pArray, const SArray* pInput) {
308,368✔
168
  if (pInput) {
308,368✔
169
    return taosArrayAddBatch(pArray, pInput->pData, (int32_t)taosArrayGetSize(pInput));
301,705✔
170
  } else {
171
    terrno = TSDB_CODE_INVALID_PARA;
6,663✔
172
    return NULL;
6,701✔
173
  }
174
}
175

176
void* taosArrayReserve(SArray* pArray, int32_t num) {
326,140,496✔
177
  int32_t code = taosArrayEnsureCap(pArray, pArray->size + num);
326,140,496✔
178
  if (code) {
325,955,189!
179
    terrno = code;
×
180
    return NULL;
×
181
  }
182

183
  void* dst = TARRAY_GET_ELEM(pArray, pArray->size);
326,035,120✔
184
  pArray->size += num;
326,035,120✔
185

186
  memset(dst, 0, num * pArray->elemSize);
326,035,120✔
187

188
  return dst;
326,035,120✔
189
}
190

191
void* taosArrayPop(SArray* pArray) {
13,740,681✔
192
  if (pArray->size == 0) {
13,740,681✔
193
    return NULL;
137,416✔
194
  }
195

196
  pArray->size -= 1;
13,603,265✔
197
  return TARRAY_GET_ELEM(pArray, pArray->size);
13,603,265✔
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);
3,801!
209
    terrno = TSDB_CODE_OUT_OF_RANGE;
3,801✔
210
    return NULL;
3,801✔
211
  }
212

213
  return TARRAY_GET_ELEM(pArray, index);
2,147,483,647✔
214
}
215

216
void* taosArrayGetP(const SArray* pArray, size_t index) {
409,917,369✔
217
  void** p = taosArrayGet(pArray, index);
409,917,369✔
218
  if (p == NULL) {
410,787,587!
219
    return NULL;
×
220
  }
221
  return *p;
410,787,587✔
222
}
223

224
void* taosArrayGetLast(const SArray* pArray) {
111,393,635✔
225
  if (pArray->size == 0) {
111,393,635!
226
    terrno = TSDB_CODE_INVALID_PARA;
×
227
    return NULL;
×
228
  }
229

230
  return TARRAY_GET_ELEM(pArray, pArray->size - 1);
111,393,635✔
231
}
232

233
size_t taosArrayGetSize(const SArray* pArray) {
2,147,483,647✔
234
  if (pArray == NULL) {
2,147,483,647✔
235
    return 0;
62,135,232✔
236
  }
237
  return TARRAY_SIZE(pArray);
2,147,483,647✔
238
}
239

240
void* taosArrayInsert(SArray* pArray, size_t index, const void* pData) {
8,950,396✔
241
  if (pArray == NULL || pData == NULL) {
8,950,396!
242
    terrno = TSDB_CODE_INVALID_PARA;
×
243
    return NULL;
×
244
  }
245

246
  if (index >= pArray->size) {
8,950,401✔
247
    return taosArrayPush(pArray, pData);
8,949,088✔
248
  }
249

250
  if (pArray->size >= pArray->capacity) {
1,295!
251
    int32_t ret = taosArrayResize(pArray);
×
252
    if (ret < 0) {
×
UNCOV
253
      terrno = ret;
×
254
      return NULL;
×
255
    }
256
  }
257

258
  void* dst = TARRAY_GET_ELEM(pArray, index);
1,296✔
259

260
  int32_t remain = (int32_t)(pArray->size - index);
1,296✔
261
  memmove((char*)dst + pArray->elemSize, (char*)dst, pArray->elemSize * remain);
1,296✔
262
  memcpy(dst, pData, pArray->elemSize);
1,296✔
263

264
  pArray->size += 1;
1,296✔
265

266
  return dst;
1,296✔
267
}
268

269
void taosArraySet(SArray* pArray, size_t index, void* pData) {
83,856,954✔
270
  if (index < pArray->size) {
83,856,954!
271
    memcpy(TARRAY_GET_ELEM(pArray, index), pData, pArray->elemSize);
83,865,377✔
272
  }
273
}
83,856,954✔
274

275
void taosArrayPopFrontBatch(SArray* pArray, size_t cnt) {
25,353✔
276
  if (cnt > pArray->size) {
25,353!
277
    cnt = pArray->size;
×
278
  }
279

280
  pArray->size = pArray->size - cnt;
25,353✔
281
  if (pArray->size == 0 || cnt == 0) {
25,353✔
282
    return;
24,905✔
283
  }
284
  memmove(pArray->pData, (char*)pArray->pData + cnt * pArray->elemSize, pArray->size * pArray->elemSize);
448✔
285
}
286

287
void taosArrayPopTailBatch(SArray* pArray, size_t cnt) {
95,759✔
288
  if (cnt >= pArray->size) {
95,759✔
289
    cnt = pArray->size;
60,299✔
290
  }
291

292
  pArray->size = pArray->size - cnt;
95,759✔
293
}
95,759✔
294

295
void taosArrayRemove(SArray* pArray, size_t index) {
3,763,633✔
296
  if (!(index < pArray->size)) {
3,763,633!
297
    return;
×
298
  }
299

300
  if (index == pArray->size - 1) {
3,763,633✔
301
    void* t = taosArrayPop(pArray);
910,906✔
302
    return;
910,905✔
303
  }
304

305
  size_t remain = pArray->size - index - 1;
2,852,727✔
306
  memmove((char*)pArray->pData + index * pArray->elemSize, (char*)pArray->pData + (index + 1) * pArray->elemSize,
2,852,727✔
307
          remain * pArray->elemSize);
2,852,727✔
308
  pArray->size -= 1;
2,852,727✔
309
}
310

311
void taosArrayRemoveBatch(SArray* pArray, size_t index, size_t num, FDelete fp) {
179,175✔
312
  if (index + num <= pArray->size) {
179,175!
313
    if (fp) {
179,184✔
314
      for (int32_t i = 0; i < num; i++) {
358,302✔
315
        fp(taosArrayGet(pArray, index + i));
179,540✔
316
      }
317
    }
318

319
    memmove((char*)pArray->pData + index * pArray->elemSize, (char*)pArray->pData + (index + num) * pArray->elemSize,
179,181✔
320
            (pArray->size - index - num) * pArray->elemSize);
179,181✔
321
    pArray->size -= num;
179,181✔
322
  }
323
}
179,172✔
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) {
3,115,280✔
341
  if (NULL == pSrc) {
3,115,280✔
342
    terrno = TSDB_CODE_INVALID_PARA;
9,732✔
343
    return NULL;
9,732✔
344
  }
345

346
  if (pSrc->size == 0) {  // empty array list
3,105,548✔
347
    return taosArrayInit(8, pSrc->elemSize);
54,275✔
348
  }
349

350
  SArray* dst = taosArrayInit(pSrc->size, pSrc->elemSize);
3,051,273✔
351

352
  if (dst) {
3,051,500!
353
    if (fn == NULL) {
3,051,507✔
354
      memcpy(dst->pData, pSrc->pData, pSrc->elemSize * pSrc->size);
3,050,117✔
355
    } else {
356
      for (int32_t i = 0; i < pSrc->size; ++i) {
4,070✔
357
        void* p = fn(taosArrayGetP(pSrc, i));
2,637✔
358
        memcpy(((char*)dst->pData) + i * dst->elemSize, &p, dst->elemSize);
2,680✔
359
      }
360
    }
361

362
    dst->size = pSrc->size;
3,051,550✔
363
  }
364

365
  return dst;
3,051,543✔
366
}
367

368
void taosArrayClear(SArray* pArray) {
132,808,128✔
369
  if (pArray == NULL) return;
132,808,128✔
370
  pArray->size = 0;
112,443,892✔
371
}
372

373
void taosArrayClearEx(SArray* pArray, void (*fp)(void*)) {
4,229,027✔
374
  if (pArray == NULL) return;
4,229,027!
375
  if (fp == NULL) {
4,229,027!
376
    pArray->size = 0;
×
377
    return;
×
378
  }
379

380
  for (int32_t i = 0; i < pArray->size; ++i) {
132,883,837✔
381
    fp(TARRAY_GET_ELEM(pArray, i));
128,613,660✔
382
  }
383

384
  pArray->size = 0;
4,270,177✔
385
}
386
void taosArrayClearP(SArray* pArray, void (*fp)(void*)) {
1,364✔
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) {
1,364!
397
    for (int32_t i = 0; i < pArray->size; i++) {
1,370✔
398
      fp(*(void**)TARRAY_GET_ELEM(pArray, i));
6✔
399
    }
400
  }
401
  taosArrayClear(pArray);
1,364✔
402
}
1,364✔
403

404
void taosArrayDestroy(SArray* pArray) {
731,378,436✔
405
  if (pArray) {
731,378,436✔
406
    taosMemoryFree(pArray->pData);
397,170,690✔
407
    taosMemoryFree(pArray);
397,257,505✔
408
  }
409
}
731,223,481✔
410

411
void taosArrayDestroyP(SArray* pArray, FDelete fp) {
133,959,891✔
412
  if (pArray) {
133,959,891✔
413
    for (int32_t i = 0; i < pArray->size; i++) {
263,162,348✔
414
      fp(*(void**)TARRAY_GET_ELEM(pArray, i));
132,663,840✔
415
    }
416
    taosArrayDestroy(pArray);
130,498,508✔
417
  }
418
}
134,687,254✔
419

420
void taosArrayDestroyEx(SArray* pArray, FDelete fp) {
58,997,426✔
421
  if (pArray == NULL) {
58,997,426✔
422
    return;
31,953,377✔
423
  }
424

425
  if (fp == NULL) {
27,044,049✔
426
    taosArrayDestroy(pArray);
466,505✔
427
    return;
466,505✔
428
  }
429

430
  for (int32_t i = 0; i < pArray->size; ++i) {
141,131,067✔
431
    fp(TARRAY_GET_ELEM(pArray, i));
114,555,197✔
432
  }
433

434
  taosArrayDestroy(pArray);
26,575,870✔
435
}
436

437
void taosArraySort(SArray* pArray, __compar_fn_t compar) {
3,507,443✔
438
  taosSort(pArray->pData, pArray->size, pArray->elemSize, compar);
3,507,443✔
439
}
3,507,532✔
440

441
int32_t taosArrayMSort(SArray* pArray, __compar_fn_t compar) {
17,992✔
442
  return taosMergeSort(pArray->pData, pArray->size, pArray->elemSize, compar);
17,992✔
443
}
444

445
void* taosArraySearch(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {
6,484,634✔
446
  return taosbsearch(key, pArray->pData, pArray->size, pArray->elemSize, comparFn, flags);
6,484,634✔
447
}
448

449
int32_t taosArraySearchIdx(const SArray* pArray, const void* key, __compar_fn_t comparFn, int32_t flags) {
3,051,956✔
450
  void* item = taosArraySearch(pArray, key, comparFn, flags);
3,051,956✔
451
  return item == NULL ? -1 : (int32_t)((char*)item - (char*)pArray->pData) / pArray->elemSize;
3,050,796✔
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,250✔
513
  int32_t tlen = 0;
5,250✔
514
  int32_t sz = pArray->size;
5,250✔
515
  tlen += taosEncodeFixedI32(buf, sz);
5,250✔
516
  for (int32_t i = 0; i < sz; i++) {
14,140✔
517
    void* data = taosArrayGetP(pArray, i);
8,890✔
518
    tlen += encode(buf, data);
8,890✔
519
  }
520
  return tlen;
5,250✔
521
}
522

523
void* taosDecodeArray(const void* buf, SArray** pArray, FDecode decode, int32_t dataSz, int8_t sver) {
2,057!
524
  int32_t sz;
525
  buf = taosDecodeFixedI32(buf, &sz);
2,057✔
526
  *pArray = taosArrayInit(sz, sizeof(void*));
2,057✔
527
  if (*pArray == NULL) {
2,057!
528
    return NULL;
×
529
  }
530
  for (int32_t i = 0; i < sz; i++) {
5,908✔
531
    void* data = taosMemoryCalloc(1, dataSz);
3,851✔
532
    if (data == NULL) {
3,851!
533
      return NULL;
×
534
    }
535

536
    buf = decode(buf, data, sver);
3,851✔
537

538
    if (taosArrayPush(*pArray, &data) == NULL) {
7,702!
539
      taosMemoryFree(data);
×
540
      return NULL;
×
541
    }
542
  }
543
  return (void*)buf;
2,057✔
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) {
20✔
553
  if (a == NULL || b == NULL) return;
20!
554
  size_t t = a->size;
20✔
555
  a->size = b->size;
20✔
556
  b->size = t;
20✔
557

558
  uint32_t cap = a->capacity;
20✔
559
  a->capacity = b->capacity;
20✔
560
  b->capacity = cap;
20✔
561

562
  uint32_t elem = a->elemSize;
20✔
563
  a->elemSize = b->elemSize;
20✔
564
  b->elemSize = elem;
20✔
565

566
  void* data = a->pData;
20✔
567
  a->pData = b->pData;
20✔
568
  b->pData = data;
20✔
569
}
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc