宏是由预处理器直接文本替换展开的,编译器不知道宏的存在 ,宏定义时出现的语法错误只能被编译器检测
函数是由编译器直接编译的实体,调用行为由编译器决定
预处理器不会对宏定义进行语法检查只是简单的文本替换,编译器不知道宏表达式的存在
编译器会对函数进行更加严格的类型检查, 宏是文本替换,参数无法进行类型检查 , 可以用函数完成的功能绝对不用宏
宏的效率比函数要高,因为是直接展开,无调用开销 ,函数调用时会创建活动记录,效率不如宏
宏能够接受任何类型的参数,效率高,易出错 ,函数的参数必须是固定类型,效率稍低,不易出错
宏没有类型和作用域概念,宏表达式中不能出现递归定义
#define _SUM_(n) ((n > 0) ? (_SUM_(n-1) + n): 0) //error
int s = _SUM_(10);
// 容易出错的宏定义
#include <stdio.h>
#define _SUM_(a, b) (a) + (b)
#define _MIN_(a, b) ((a) < (b) ? (a) : (b))
#define _DIM_(a) sizeof(a)/sizeof(*a)
#define _ADD_(a, b) a + b
#define _MUL_(a, b) a * b
#define _MIN_(a, b) ((a) < (b) ? (a) : (b))
int main()
{
int a = 1;
int b = 2;
int c[4] = {0};
int s1 = _SUM_(a, b);
int s2 = _SUM_(a, b) * _SUM_(a, b); // ???
int m = _MIN_(a++, b);
int d = _DIM_(c);
int i = 1;
int j = 10;
printf("s1 = %d\n", s1);
printf("s2 = %d\n", s2);
printf("m = %d\n", m);
printf("d = %d\n", d);
printf("%d\n", _MUL_(_ADD_(1, 2), _ADD_(3, 4)));
printf("%d\n", _MIN_(i++, j));
return 0;
}
强大的内置宏
#include <stdio.h>
#include <malloc.h>
#define MALLOC(type, x) (type*)malloc(sizeof(type)*x)
#define FREE(p) (free(p), p=NULL)
#define LOG(s) printf("[%s] {%s:%d} %s \n", __DATE__, __FILE__, __LINE__, s)
#define FOREACH(i, m) for(i=0; i<m; i++)
#define BEGIN {
#define END }
int main()
{
int x = 0;
int* p = MALLOC(int, 5);
LOG("Begin to run main code...");
FOREACH(x, 5)
BEGIN
p[x] = x;
END
FOREACH(x, 5)
BEGIN
printf("%d\n", p[x]);
END
FREE(p);
LOG("End");
return 0;
}
宏的强大之处,这些宏都是无法用函数替代的
宏的妙用 :用于生成一些常规性的代码 封装函数,加上类型信息
#include <stdio.h>
#include <malloc.h>
#define MALLOC(type, x) (type*)malloc(sizeof(type)*x)
#define FREE(p) (free(p), p=NULL)
#define LOG_INT(i) printf("%s = %d\n", #i, i)
#define LOG_CHAR(c) printf("%s = %c\n", #c, c)
#define LOG_FLOAT(f) printf("%s = %f\n", #f, f)
#define LOG_POINTER(p) printf("%s = %p\n", #p, p)
#define LOG_STRING(s) printf("%s = %s\n", #s, s)
#define FOREACH(i, n) while(1) { int i = 0, l = n; for(i=0; i < l; i++)
#define BEGIN {
#define END } break; }
int main()
{
int* pi = MALLOC(int, 5);
char* str = "D.T.Software";
LOG_STRING(str);
LOG_POINTER(pi);
FOREACH(k, 5)
BEGIN
pi[k] = k + 1;
END
FOREACH(n, 5)
BEGIN
int value = pi[n]; //while(1)break保证了可以n替换为k
LOG_INT(value);
END
FREE(pi);
LOG_POINTER(pi);
return 0;
}