C宏问题:重新定义函数/结构

Question

给出以下代码(它是一个为列表数据结构生成代码的宏,基于所包含的类型).

list.h

#ifndef _LIST_H
#define _LIST_H

#ifdef __cplusplus
extern "C" {
#endif

#define LIST_TEMPLATE_INIT(type) \
    typedef struct __list_s_##type { \
        struct __list_s_##type *next; \
        type value; \
    } __list_##type; \
\
    __list_##type * __list_##type##_malloc(type value){ \
        __list_##type * list = NULL; \
        list = malloc(sizeof(*list)); \
        list->value = value; \
        return list; \
    }\
\
    void __list_##type##_free(__list_##type *list){\
        __list_##type * back = list;\
        while(list=list->next){\
            free(back);\
            back = list;\
        }\
    }
#define LIST_TYPE(type) __list_##type
#define LIST_MALLOC(type,value) __list_##type##_malloc(value)
#define LIST_FREE(type,list) __list_##type##_free(list)
#define LIST_DATA(list) (list->value)

#ifdef __cplusplus
}
#endif

#endif /* _LIST_H */

以下是上述代码的工作原理:

#include <stdio.h>
#include <stdlib.h>
#include "list.h"

/*
 * 
 */
LIST_TEMPLATE_INIT(int)
int main(int argc, char** argv)
{
 LIST_TYPE(int)* list = NULL;
 list = LIST_MALLOC(int, 5);
 printf("%d",LIST_DATA(list));
 LIST_FREE(int,list);
 return (0);
}

我的问题是,有可能以LIST_TEMPLATE_INIT(int)一种分散的方式以某种方式调用:,尽可能多次调用吗？

现在的问题是调用LIST_TEMPLATE_INIT(int)另一个文件会引发编译错误(因为函数重新定义):

错误示例:

error: redefinition of ‘struct __list_s_int’
 error: redefinition of ‘struct __list_s_int’
error: conflicting types for ‘__list_int’
note: previous declaration of ‘__list_int’ was here
error: conflicting types for ‘__list_int_malloc’
note: previous definition of ‘__list_int_malloc’ was here
error: conflicting types for ‘__list_int_free’
note: previous definition of ‘__list_int_free’ was here

Answer 1

我建议创建不同的宏来声明和定义列表结构,然后为每个使用单独的头文件和源文件:

list.h:

#ifndef _LIST_H    
#define _LIST_H    

#define LIST_TEMPLATE_DECLARE(type)                   \
    struct __list_##type;                             \
    typedef struct __list_##type __list_##type;       \
    struct __list_##type {                            \
        struct __list_##type * next;                  \
        type value;                                   \
    };                                                \
                                                      \
__list_##type * __list_##type##_malloc(type value);   \
void __list_##type##_free(__list_##type * list);

#define LIST_TEMPLATE_DEFINE(type)                    \
__list_##type * __list_##type##_malloc(type value) {  \
    __list_##type * list = NULL;                      \
    list = malloc(sizeof(*list));                     \
    list->value = value;                              \
    return list;                                      \
}                                                     \
void __list_##type##_free(__list_##type * list) {     \
    __list_##type * back = list;                      \
    while(list=list->next){                           \
        free(back);                                   \
        back = list;                                  \
    }                                                 \
}

#define LIST_TYPE(type) __list_##type    
#define LIST_MALLOC(type,value) __list_##type##_malloc(value)    
#define LIST_FREE(type,list) __list_##type##_free(list)    
#define LIST_DATA(list) (list->value)    

#endif /* _LIST_H */    

int_list.h:

#ifndef INT_LIST_H_
#define INT_LIST_H_

#include "list.h"
LIST_TEMPLATE_DECLARE(int)

#endif /* INT_LIST_H_ */

int_list.c:

#include "int_list.h"

LIST_TEMPLATE_DEFINE(int)

other.c:

#include "int_list.h"

int some_function(int argc, char** argv)
{
    LIST_TYPE(int)* list = NULL;
    list = LIST_MALLOC(int, 5);
    printf("%d",LIST_DATA(list));
    LIST_FREE(int,list);
    return (0);
}