fs/jfs/jfs_btree.h

142

#define BT_GETSEARCH(IP, LEAF, BN, MP, TYPE, P, INDEX, ROOT)\

fs/jfs/jfs_btree.h

144

BN = (LEAF)->bn;\

fs/jfs/jfs_btree.h

145

MP = (LEAF)->mp;\

fs/jfs/jfs_btree.h

150

INDEX = (LEAF)->index;\

fs/jfs/jfs_dtree.c

134

#define DT_GETSEARCH(IP, LEAF, BN, MP, P, INDEX) \

fs/jfs/jfs_dtree.c

135

BT_GETSEARCH(IP, LEAF, BN, MP, dtpage_t, P, INDEX, i_dtroot)

fs/jfs/jfs_xtree.c

55

#define XT_GETSEARCH(IP, LEAF, BN, MP, P, INDEX) \

fs/jfs/jfs_xtree.c

56

BT_GETSEARCH(IP, LEAF, BN, MP, xtpage_t, P, INDEX, i_xtroot)

fs/unicode/mkutf8data.c

1071

if (tree->childnode == LEAF)

fs/unicode/mkutf8data.c

1103

if (n->rightnode == LEAF)

fs/unicode/mkutf8data.c

1107

if (n->leftnode == LEAF)

fs/unicode/mkutf8data.c

1147

if (node->leftnode == LEAF) {

fs/unicode/mkutf8data.c

1159

if (node->rightnode == LEAF) {

fs/unicode/mkutf8data.c

1209

if (tree->childnode == LEAF) {

fs/unicode/mkutf8data.c

1273

if (node->leftnode == LEAF) {

fs/unicode/mkutf8data.c

1290

if (node->rightnode == LEAF) {

fs/unicode/mkutf8data.c

175

#define LEAF_GEN(LEAF) ((LEAF)[0])

fs/unicode/mkutf8data.c

176

#define LEAF_CCC(LEAF) ((LEAF)[1])

fs/unicode/mkutf8data.c

177

#define LEAF_STR(LEAF) ((const char*)((LEAF) + 2))

fs/unicode/mkutf8data.c

393

} else if (node->rightnode == LEAF) {

fs/unicode/mkutf8data.c

402

} else if (node->leftnode == LEAF) {

fs/unicode/mkutf8data.c

429

if (tree->childnode == LEAF) {

fs/unicode/mkutf8data.c

452

if (node->leftnode == LEAF) {

fs/unicode/mkutf8data.c

466

if (node->rightnode == LEAF) {

fs/unicode/mkutf8data.c

564

node->rightnode = LEAF;

fs/unicode/mkutf8data.c

566

node->leftnode = LEAF;

fs/unicode/mkutf8data.c

583

tree->childnode = LEAF;

fs/unicode/mkutf8data.c

586

parent->leftnode = LEAF;

fs/unicode/mkutf8data.c

595

parent->rightnode = LEAF;

fs/unicode/mkutf8data.c

671

if (tree->childnode == LEAF)

fs/unicode/mkutf8data.c

681

if (node->leftnode == LEAF)

fs/unicode/mkutf8data.c

683

if (node->rightnode == LEAF)

fs/unicode/mkutf8data.c

702

if (left->leftnode == LEAF)

fs/unicode/mkutf8data.c

704

else if (left->rightnode == LEAF)

fs/unicode/mkutf8data.c

716

if (right->leftnode == LEAF)

fs/unicode/mkutf8data.c

718

else if (right->rightnode == LEAF)

fs/unicode/mkutf8data.c

827

if (tree->childnode == LEAF)

fs/unicode/mkutf8data.c

837

if (node->leftnode == LEAF) {

fs/unicode/mkutf8data.c

855

if (node->rightnode == LEAF) {

fs/unicode/mkutf8data.c

885

if (node->leftnode == LEAF) {

fs/unicode/mkutf8data.c

907

if (node->rightnode == LEAF) {

fs/unicode/mkutf8data.c

960

if (tree->childnode == LEAF) {

fs/unicode/mkutf8data.c

980

if (node->leftnode == LEAF) {

fs/unicode/mkutf8data.c

995

if (node->rightnode == LEAF) {

fs/unicode/utf8-norm.c

186

#define LEAF_GEN(LEAF) ((LEAF)[0])

fs/unicode/utf8-norm.c

187

#define LEAF_CCC(LEAF) ((LEAF)[1])

fs/unicode/utf8-norm.c

188

#define LEAF_STR(LEAF) ((const char *)((LEAF) + 2))