C/C++编程Trick

1. 数组名和数组名解引用等同.

    #include <stdio.h> #define LIST_MAX 10 typedef int node; typedef node node_list[LIST_MAX]; void test(node node_list[]) { printf("Inside test(): list: 0x%0X/n", node_list); return ; } int main() { int a[10]; printf("a= 0x%0X, &a=0x%0X/n", a, &a); // Array nanme a is equal to &a. node_list list; printf("list: 0x%0X, &list: 0x%0X/n", list, &list); test(list); // equal to test((node *)&list); return 0; } 

 

2. Windows下的回车为"/r/n" (0b0a), Linux下的回车为"/n"(0a). '/r'在Linux下显示为^M，可以由Ctrl+V+M键得到，由:%s/^M//g或dos2unix去除.

 

3. 指针的指针和2维数组互换.

    #include <stdio.h> #include <stdlib.h> /* malloc */ /* test p2p to 2d-array */ int main(int argc, char *argv[]) { if (argc != 3) { printf("Usage: %s row_value column_value /n", argv[0]); return -1; } int row = atoi(argv[1]); int column = atoi(argv[2]); int **a; // equal to a[row][column]. a = (int **)malloc(row * sizeof(int *)); int i, j; for (i=0; i<row; i++) *(a+i) = (int *)malloc(column * sizeof(int)); for (i=0; i<row; i++) for (j=0; j<column; j++) { a[i][j] = 1; } for (i=0; i<row; i++) { for (j=0; j<column; j++) { printf("%d ", a[i][j]); } printf("/n"); } for (i=0; i<row; i++) free(*(a+i)); free(a); return 0; }

 

4. 得到结构体成员offset，由成员指针得到结构体entry.

    #include <stdio.h> #define kstruct_offset(type, member) / (int)(&((type*)0)->member) /* Note: since kstruct_offset() is counted by byte, so substracting must be 1 byte step. */ #define kstruct_get_entry(ptr, type, member) / (type*)((char*)ptr - kstruct_offset(type, member)) typedef struct _node_t { char a; int b; int c; int d; } node_t; typedef struct _wrapper_node_t { int data; int count; node_t node; } wrapper_node_t; int main() { wrapper_node_t wnode[10]; printf("offset: %d/n", kstruct_offset(node_t, c)); if (kstruct_get_entry(&(wnode[4].node), wrapper_node_t, node) == &wnode[4]) printf("pointer equal./n"); else printf("pointer not equal!./n"); return 0; }