freelist.h 1.7 KB
Newer Older
H
more  
Hongze Cheng 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59
/*
 * 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/>.
 */

#ifndef _TD_UTIL_FREELIST_H_
#define _TD_UTIL_FREELIST_H_

#include "os.h"
#include "tlist.h"

#ifdef __cplusplus
extern "C" {
#endif

struct SFreeListNode {
  TD_SLIST_NODE(SFreeListNode);
  char payload[];
};

typedef TD_SLIST(SFreeListNode) SFreeList;

#define TFL_MALLOC(SIZE, LIST)                                 \
  ({                                                           \
    void *ptr = malloc((SIZE) + sizeof(struct SFreeListNode)); \
    if (ptr) {                                                 \
      TD_SLIST_PUSH((LIST), (struct SFreeListNode *)ptr);      \
      ptr = ((struct SFreeListNode *)ptr)->payload;            \
    }                                                          \
    ptr;                                                       \
  })

#define tFreeListInit(pFL) TD_SLIST_INIT(pFL)

static FORCE_INLINE void tFreeListClear(SFreeList *pFL) {
  struct SFreeListNode *pNode;
  for (;;) {
    pNode = TD_SLIST_HEAD(pFL);
    if (pNode == NULL) break;
    TD_SLIST_POP(pFL);
    free(pNode);
  }
}

#ifdef __cplusplus
}
#endif

#endif /*_TD_UTIL_FREELIST_H_*/