Macro recursive expansion to a sequence

前端 未结 3 1645
Happy的楠姐
Happy的楠姐 2020-12-09 13:43

Is it possible to define a C/C++ macro \"BUILD(a, i)\" which expands to \"x[0], x[1], x[2], ..., x[i]\" ? Like in

#define BUILD(x,          


        
相关标签:
3条回答
  • 2020-12-09 14:06

    Ok, I had the same problem, My aim was to print all the values of an array of N bytes using macros. I assume you had pretty much the same problem. If this was the case, this solution should suit future similar problems.

    #define HEX_ARRAY_AS_STR(array, len) \
        ({ \
            int print_counter = 0; \
            print_buf = calloc(len*3+1, 1); \
            char *tmp_print_buf = print_buf; \
            uint8_t *array_flower = array;  \
            while(print_counter++ < (len)){ \
                sprintf(tmp_print_buf, "%02X ", *(array_flower)++); \
                tmp_print_buf += 3; \
            } \
            print_buf; \
        })
    
    #define eprintf(...) \
        do{ \
            char *print_buf; \
            printf(__VA_ARGS__); \
            if(print_buf) \
                free(print_buf); \
        }while(0)
    
    int 
    main(int argc, char *argv[])
    {
        uint8_t sample[] = {0,1,2,3,4,5,6,7};
        eprintf("%s\n", HEX_ARRAY_AS_STR(sample, 8));
        return 0; 
    }
    
    0 讨论(0)
  • 2020-12-09 14:18

    It is possible, but you have to do some manual work and have an upper limit.

    #define BUILD0(x) x[0]
    #define BUILD1(x) BUILD0(x), x[1]
    #define BUILD2(x) BUILD1(x), x[2]
    #define BUILD3(x) BUILD2(x), x[3]
    #define BUILD(x, i) BUILD##i(x)
    

    And note that i should be an integer literal, not a constant computed value.

    BTW, the preprocessor is more powerful than what is usually though, but the use of that power is quite tricky. Boost provides a library which eases some things, including iteration. See Boost Preprocessor Library. There is another library for such things, but its name escapes me at the moment.

    Edit: The boost preprocessor library uses a similar technique. With additional tricks to solve some corner cases problems, share implementation macros between higher level facilities, work around compiler bugs, etc... the usual boost complexity which is normal in the context of a general purpose library but which at times prevents easy understanding of the implementation principles. Probably the most noticeable trick is to add an indirection level so that if the second parameter can be a macro, it is expanded. I.e. with

    #define BUILD_(x, i) BUILD##i(x)
    #define BUILD(x, i) BUILD_(x, i)
    

    one can make the call

    #define FOO 42
    BUILD(x, FOO)
    

    which isn't possible with what I exposed.

    0 讨论(0)
  • 2020-12-09 14:18

    No, it isn't - macros cannot be recursive. And the macros you posted are not variadic, which means "having different numbers of parameters".

    0 讨论(0)
提交回复
热议问题