Home
last modified time | relevance | path

Searched refs:LEAF (Results 1 – 5 of 5) sorted by relevance

/fs/unicode/
A Dmkutf8data.c175 #define LEAF_GEN(LEAF) ((LEAF)[0]) argument
176 #define LEAF_CCC(LEAF) ((LEAF)[1]) argument
177 #define LEAF_STR(LEAF) ((const char*)((LEAF) + 2)) argument
343 #define LEAF 0 macro
564 node->rightnode = LEAF; in insert()
566 node->leftnode = LEAF; in insert()
583 tree->childnode = LEAF; in insert()
586 parent->leftnode = LEAF; in insert()
595 parent->rightnode = LEAF; in insert()
671 if (tree->childnode == LEAF) in prune()
[all …]
A Dutf8-norm.c186 #define LEAF_GEN(LEAF) ((LEAF)[0]) argument
187 #define LEAF_CCC(LEAF) ((LEAF)[1]) argument
188 #define LEAF_STR(LEAF) ((const char *)((LEAF) + 2)) argument
/fs/jfs/
A Djfs_btree.h142 #define BT_GETSEARCH(IP, LEAF, BN, MP, TYPE, P, INDEX, ROOT)\ argument
144 BN = (LEAF)->bn;\
145 MP = (LEAF)->mp;\
150 INDEX = (LEAF)->index;\
A Djfs_xtree.c55 #define XT_GETSEARCH(IP, LEAF, BN, MP, P, INDEX) \ argument
56 BT_GETSEARCH(IP, LEAF, BN, MP, xtpage_t, P, INDEX, i_xtroot)
A Djfs_dtree.c134 #define DT_GETSEARCH(IP, LEAF, BN, MP, P, INDEX) \ argument
135 BT_GETSEARCH(IP, LEAF, BN, MP, dtpage_t, P, INDEX, i_dtroot)

Completed in 20 milliseconds