LEAF              142 fs/jfs/jfs_btree.h #define BT_GETSEARCH(IP, LEAF, BN, MP, TYPE, P, INDEX, ROOT)\
LEAF              144 fs/jfs/jfs_btree.h 	BN = (LEAF)->bn;\
LEAF              145 fs/jfs/jfs_btree.h 	MP = (LEAF)->mp;\
LEAF              150 fs/jfs/jfs_btree.h 	INDEX = (LEAF)->index;\
LEAF              133 fs/jfs/jfs_dtree.c #define DT_GETSEARCH(IP, LEAF, BN, MP, P, INDEX) \
LEAF              134 fs/jfs/jfs_dtree.c 	BT_GETSEARCH(IP, LEAF, BN, MP, dtpage_t, P, INDEX, i_dtroot)
LEAF               75 fs/jfs/jfs_xtree.c #define XT_GETSEARCH(IP, LEAF, BN, MP, P, INDEX) \
LEAF               76 fs/jfs/jfs_xtree.c 	BT_GETSEARCH(IP, LEAF, BN, MP, xtpage_t, P, INDEX, i_xtroot)
LEAF              175 fs/unicode/mkutf8data.c #define LEAF_GEN(LEAF)	((LEAF)[0])
LEAF              176 fs/unicode/mkutf8data.c #define LEAF_CCC(LEAF)	((LEAF)[1])
LEAF              177 fs/unicode/mkutf8data.c #define LEAF_STR(LEAF)	((const char*)((LEAF) + 2))
LEAF              393 fs/unicode/mkutf8data.c 			} else if (node->rightnode == LEAF) {
LEAF              402 fs/unicode/mkutf8data.c 			} else if (node->leftnode == LEAF) {
LEAF              429 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF) {
LEAF              452 fs/unicode/mkutf8data.c 					if (node->leftnode == LEAF) {
LEAF              466 fs/unicode/mkutf8data.c 					if (node->rightnode == LEAF) {
LEAF              564 fs/unicode/mkutf8data.c 			node->rightnode = LEAF;
LEAF              566 fs/unicode/mkutf8data.c 			node->leftnode = LEAF;
LEAF              583 fs/unicode/mkutf8data.c 			tree->childnode = LEAF;
LEAF              586 fs/unicode/mkutf8data.c 			parent->leftnode = LEAF;
LEAF              595 fs/unicode/mkutf8data.c 			parent->rightnode = LEAF;
LEAF              671 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF)
LEAF              681 fs/unicode/mkutf8data.c 		if (node->leftnode == LEAF)
LEAF              683 fs/unicode/mkutf8data.c 		if (node->rightnode == LEAF)
LEAF              702 fs/unicode/mkutf8data.c 			if (left->leftnode == LEAF)
LEAF              704 fs/unicode/mkutf8data.c 			else if (left->rightnode == LEAF)
LEAF              716 fs/unicode/mkutf8data.c 			if (right->leftnode == LEAF)
LEAF              718 fs/unicode/mkutf8data.c 			else if (right->rightnode == LEAF)
LEAF              827 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF)
LEAF              837 fs/unicode/mkutf8data.c 			if (node->leftnode == LEAF) {
LEAF              855 fs/unicode/mkutf8data.c 			if (node->rightnode == LEAF) {
LEAF              885 fs/unicode/mkutf8data.c 			if (node->leftnode == LEAF) {
LEAF              907 fs/unicode/mkutf8data.c 			if (node->rightnode == LEAF) {
LEAF              960 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF) {
LEAF              980 fs/unicode/mkutf8data.c 				if (node->leftnode == LEAF) {
LEAF              995 fs/unicode/mkutf8data.c 				if (node->rightnode == LEAF) {
LEAF             1071 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF)
LEAF             1103 fs/unicode/mkutf8data.c 							if (n->rightnode == LEAF)
LEAF             1107 fs/unicode/mkutf8data.c 							if (n->leftnode == LEAF)
LEAF             1147 fs/unicode/mkutf8data.c 				if (node->leftnode == LEAF) {
LEAF             1159 fs/unicode/mkutf8data.c 				if (node->rightnode == LEAF) {
LEAF             1209 fs/unicode/mkutf8data.c 	if (tree->childnode == LEAF) {
LEAF             1273 fs/unicode/mkutf8data.c 				if (node->leftnode == LEAF) {
LEAF             1290 fs/unicode/mkutf8data.c 				if (node->rightnode == LEAF) {
LEAF              203 fs/unicode/utf8-norm.c #define LEAF_GEN(LEAF)	((LEAF)[0])
LEAF              204 fs/unicode/utf8-norm.c #define LEAF_CCC(LEAF)	((LEAF)[1])
LEAF              205 fs/unicode/utf8-norm.c #define LEAF_STR(LEAF)	((const char *)((LEAF) + 2))