mirror of
https://github.com/emqx/neuron.git
synced 2026-10-21 08:45:47 +08:00
fengzero
61 lines
2.0 KiB
C
61 lines
2.0 KiB
C
/**
|
|
* NEURON IIoT System for Industry 4.0
|
|
* Copyright (C) 2020-2021 EMQ Technologies Co., Ltd All rights reserved.
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 3 of the License, or (at your option) any later version.
|
|
*
|
|
* 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. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with this program; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
config_ **/
|
|
|
|
#ifndef _NEU_UT_EXTEND_H_
|
|
#define _NEU_UT_EXTEND_H_
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "utarray.h"
|
|
#include "uthash.h"
|
|
#include "utlist.h"
|
|
|
|
static inline UT_array *utarray_clone(UT_array *array)
|
|
{
|
|
UT_array *result = (UT_array *) calloc(1, sizeof(UT_array));
|
|
|
|
result->i = array->i;
|
|
result->n = array->n;
|
|
result->icd = array->icd;
|
|
result->d = (char *) calloc(1, array->n * array->icd.sz);
|
|
memcpy(result->d, array->d, array->n * array->icd.sz);
|
|
|
|
return result;
|
|
}
|
|
|
|
#define utarray_foreach(array, type, elem) \
|
|
for (type elem = (type) utarray_front(array); elem != NULL; \
|
|
elem = (type) utarray_next(array, elem))
|
|
|
|
#define utarray_reverse_foreach(array, type, elem) \
|
|
for (type elem = (type) utarray_back(array); elem != NULL; \
|
|
elem = (type) utarray_prev(array, elem))
|
|
|
|
#define DL_LAST(head) ((head) != NULL) ? (head)->prev : NULL;
|
|
#define DL_PREV(el) ((el) != NULL) ? (el)->prev : NULL;
|
|
|
|
#define DL_REVERSE_FOREACH(head, tail, el) \
|
|
(tail) = DL_LAST(head); \
|
|
(el) = (tail); \
|
|
do
|
|
|
|
#define DL_REVERSE_FOREACH_END(head, tail, el) \
|
|
while (((el) = (el)->prev) != (head))
|
|
|
|
#endif |