Home
last modified time | relevance | path

Searched refs:btstack (Results 1 – 3 of 3) sorted by relevance

/linux/fs/jfs/
H A Djfs_btree.h105 struct btstack { struct
111 #define BT_CLR(btstack)\ argument
112 (btstack)->top = (btstack)->stack
114 #define BT_STACK_FULL(btstack)\ argument
115 ( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1]))
125 #define BT_POP(btstack)\ argument
126 ( (btstack)->top == (btstack)->stack ? NULL : --(btstack)->top )
128 #define BT_STACK(btstack)\ argument
129 ( (btstack)->top == (btstack)->stack ? NULL : (btstack)->top )
131 static inline void BT_STACK_DUMP(struct btstack *btstack) in BT_STACK_DUMP() argument
[all …]
H A Djfs_dtree.c141 struct dtsplit * split, struct btstack * btstack);
147 struct dtsplit * split, struct btstack * btstack);
153 dtpage_t * fp, struct btstack * btstack);
157 static int dtReadFirst(struct inode *ip, struct btstack * btstack);
160 loff_t * offset, struct btstack * btstack);
569 struct btstack * btstack, int flag) in dtSearch() argument
601 BT_CLR(btstack); /* reset stack */ in dtSearch()
604 btstack->nsplit = 1; in dtSearch()
698 btsp = btstack->top; in dtSearch()
747 btsp = btstack->top; in dtSearch()
[all …]
H A Djfs_dtree.h244 ino_t * data, struct btstack * btstack, int flag);
247 ino_t * ino, struct btstack * btstack);