C++ 怎麼生成 4096 個函數？

#define EVAL(...) EVAL1(EVAL1(EVAL1(EVAL1(__VA_ARGS__))))
#define EVAL1(...) EVAL2(EVAL2(EVAL2(EVAL2(__VA_ARGS__))))
#define EVAL2(...) EVAL3(EVAL3(EVAL3(EVAL3(__VA_ARGS__))))
#define EVAL3(...) EVAL4(EVAL4(EVAL4(EVAL4(__VA_ARGS__))))
#define EVAL4(...) EVAL5(EVAL5(EVAL5(EVAL5(__VA_ARGS__))))
#define EVAL5(...) EVAL6(EVAL6(EVAL6(EVAL6(__VA_ARGS__))))
#define EVAL6(...) __VA_ARGS__

#define CAT(a, ...) PRIMITIVE_CAT(a, __VA_ARGS__)
#define PRIMITIVE_CAT(a, ...) a ## __VA_ARGS__

#define INC(x) PRIMITIVE_CAT(INC_, x)
#define INC_0 1
#define INC_1 2
#define INC_2 3
#define INC_3 4
#define INC_4 5
#define INC_5 6
#define INC_6 7
#define INC_7 8
#define INC_8 9
#define INC_9 9

#define DEC(x) PRIMITIVE_CAT(DEC_, x)
#define DEC_0 0
#define DEC_1 0
#define DEC_2 1
#define DEC_3 2
#define DEC_4 3
#define DEC_5 4
#define DEC_6 5
#define DEC_7 6
#define DEC_8 7
#define DEC_9 8

#define CHECK_N(x, n, ...) n
#define CHECK(...) CHECK_N(__VA_ARGS__, 0,)

#define NOT(x) CHECK(PRIMITIVE_CAT(NOT_, x))
#define NOT_0 ~,1,

#define COMPL(b) PRIMITIVE_CAT(COMPL_, b)
#define COMPL_0 1
#define COMPL_1 0

#define BOOL(x) COMPL(NOT(x))

#define IIF(c) PRIMITIVE_CAT(IIF_, c)
#define IIF_0(t, ...) __VA_ARGS__
#define IIF_1(t, ...) t

#define IF(c) IIF(BOOL(c))

#define EAT(...)
#define EXPAND(...) __VA_ARGS__
#define WHEN(c) IF(c)(EXPAND, EAT)

#define REPEAT(count, macro, ...)
WHEN(count)
(
OBSTRUCT(REPEAT_INDIRECT) ()
(
DEC(count), macro, __VA_ARGS__
)
OBSTRUCT(macro)
(
DEC(count), __VA_ARGS__
)
)

#define REPEAT_INDIRECT() REPEAT

#define NUMBER 3

#define M(i, _) int f_##i() { return i; }
EVAL(REPEAT(NUMBER, M, ~))

#include &

int main() {
typedef int (*fun)();

fun f[NUMBER];

#undef M
#define M(i, _) f[i] = f_##i;
EVAL(REPEAT(NUMBER, M, ~))

#define _F0 __asm mov eax, __COUNTER__ __asm ret
#define _F1 _F0 _F0 _F0 _F0 _F0 _F0 _F0 _F0
#define _F2 _F1 _F1 _F1 _F1 _F1 _F1 _F1 _F1
#define _F3 _F2 _F2 _F2 _F2 _F2 _F2 _F2 _F2
#define _F4 _F3 _F3 _F3 _F3 _F3 _F3 _F3 _F3

enum {
CODE_LENGTH = 16,
REQ_NUM = 4096,
MAGIC_NUM = 0x43C2,
};

typedef struct {
char bitcodes[CODE_LENGTH];
} func_mem_t;

typedef int (*func_ptr_t)(void);

int base_func(void){
return MAGIC_NUM;
}

func_mem_t func_mem_arr[REQ_NUM];
func_ptr_t func_arr[REQ_NUM];

size_t search_number_offset(void){
func_mem_t mem_buf;
memcpy(mem_buf, base_func, CODE_LENGTH);

size_t start_place;
int magic_key=MAGIC_NUM;
for (start_place = 0; start_place+sizeof(int) &<= CODE_LENGTH; ++start_place) if (memcmp(mem_buf.bitcodes+start_place, magic_key, sizeof(int))==0) return start_place; return CODE_LENGTH; } size_t number_offset; void generate_funcs(void){ int i; for (i = 0; i &< REQ_NUM; ++i){ memcpy(func_mem_arr+i, base_func, CODE_LENGTH); memcpy(func_mem_arr[i].bitcodes+number_offset, i, sizeof(int)); func_arr[i]=(func_ptr_t)func_mem_arr[i]; } } int main(int argc, char **argv){ number_offset=search_number_offset(); if (number_offset == CODE_LENGTH){ fprintf(stderr, "The method used in this program fails. "); return 0; } generate_funcs(); int input_num; scanf("%d", input_num); while (input_num&>=0input_num&

更新：上面那個別看了，雖然勉強可移植但用了擴展語法。

#include &
#include &