Symbol: btstack
fs/jfs/jfs_btree.h
111
#define BT_CLR(btstack)\
fs/jfs/jfs_btree.h
112
(btstack)->top = (btstack)->stack
fs/jfs/jfs_btree.h
114
#define BT_STACK_FULL(btstack)\
fs/jfs/jfs_btree.h
115
( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1]))
fs/jfs/jfs_btree.h
125
#define BT_POP(btstack)\
fs/jfs/jfs_btree.h
126
( (btstack)->top == (btstack)->stack ? NULL : --(btstack)->top )
fs/jfs/jfs_btree.h
128
#define BT_STACK(btstack)\
fs/jfs/jfs_btree.h
129
( (btstack)->top == (btstack)->stack ? NULL : (btstack)->top )
fs/jfs/jfs_btree.h
131
static inline void BT_STACK_DUMP(struct btstack *btstack)
fs/jfs/jfs_btree.h
137
(long long)btstack->stack[i].bn,
fs/jfs/jfs_btree.h
138
btstack->stack[i].index);
fs/jfs/jfs_dtree.c
1039
if ((rc = dtExtendPage(tid, ip, split, btstack))) {
fs/jfs/jfs_dtree.c
1071
n = btstack->nsplit;
fs/jfs/jfs_dtree.c
1120
while ((parent = BT_POP(btstack)) != NULL) {
fs/jfs/jfs_dtree.c
138
struct dtsplit * split, struct btstack * btstack);
fs/jfs/jfs_dtree.c
144
struct dtsplit * split, struct btstack * btstack);
fs/jfs/jfs_dtree.c
150
dtpage_t * fp, struct btstack * btstack);
fs/jfs/jfs_dtree.c
154
static int dtReadFirst(struct inode *ip, struct btstack * btstack);
fs/jfs/jfs_dtree.c
157
loff_t * offset, struct btstack * btstack);
fs/jfs/jfs_dtree.c
1636
struct inode *ip, struct dtsplit * split, struct btstack * btstack)
fs/jfs/jfs_dtree.c
1665
parent = BT_POP(btstack);
fs/jfs/jfs_dtree.c
2083
struct btstack btstack;
fs/jfs/jfs_dtree.c
2099
if ((rc = dtSearch(ip, key, ino, &btstack, flag)))
fs/jfs/jfs_dtree.c
2103
DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
fs/jfs/jfs_dtree.c
2149
rc = dtDeleteUp(tid, ip, mp, p, &btstack);
fs/jfs/jfs_dtree.c
2231
struct metapage * fmp, dtpage_t * fp, struct btstack * btstack)
fs/jfs/jfs_dtree.c
2299
while ((parent = BT_POP(btstack)) != NULL) {
fs/jfs/jfs_dtree.c
2727
struct btstack btstack;
fs/jfs/jfs_dtree.c
2829
if ((rc = dtReadFirst(ip, &btstack)))
fs/jfs/jfs_dtree.c
2832
DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
fs/jfs/jfs_dtree.c
2871
if ((rc = dtReadNext(ip, &ctx->pos, &btstack))) {
fs/jfs/jfs_dtree.c
2878
DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
fs/jfs/jfs_dtree.c
3057
static int dtReadFirst(struct inode *ip, struct btstack * btstack)
fs/jfs/jfs_dtree.c
3068
BT_CLR(btstack); /* reset stack */
fs/jfs/jfs_dtree.c
3085
btsp = btstack->top;
fs/jfs/jfs_dtree.c
3096
if (BT_STACK_FULL(btstack)) {
fs/jfs/jfs_dtree.c
3099
BT_STACK_DUMP(btstack);
fs/jfs/jfs_dtree.c
3103
BT_PUSH(btstack, bn, 0);
fs/jfs/jfs_dtree.c
3137
struct btstack * btstack)
fs/jfs/jfs_dtree.c
3157
if ((rc = dtReadFirst(ip, btstack)))
fs/jfs/jfs_dtree.c
3161
DT_GETSEARCH(ip, btstack->top, bn, mp, p, index);
fs/jfs/jfs_dtree.c
3217
btsp = btstack->top;
fs/jfs/jfs_dtree.c
3293
btsp = btstack->top;
fs/jfs/jfs_dtree.c
4249
struct btstack btstack;
fs/jfs/jfs_dtree.c
4262
if ((rc = dtSearch(ip, key, orig_ino, &btstack, flag)))
fs/jfs/jfs_dtree.c
4266
DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
fs/jfs/jfs_dtree.c
566
struct btstack * btstack, int flag)
fs/jfs/jfs_dtree.c
598
BT_CLR(btstack); /* reset stack */
fs/jfs/jfs_dtree.c
601
btstack->nsplit = 1;
fs/jfs/jfs_dtree.c
695
btsp = btstack->top;
fs/jfs/jfs_dtree.c
744
btsp = btstack->top;
fs/jfs/jfs_dtree.c
766
if (BT_STACK_FULL(btstack)) {
fs/jfs/jfs_dtree.c
771
BT_STACK_DUMP(btstack);
fs/jfs/jfs_dtree.c
775
btstack->nsplit++;
fs/jfs/jfs_dtree.c
778
BT_PUSH(btstack, bn, index);
fs/jfs/jfs_dtree.c
813
struct component_name * name, ino_t * fsn, struct btstack * btstack)
fs/jfs/jfs_dtree.c
834
DT_GETSEARCH(ip, btstack->top, bn, mp, p, index);
fs/jfs/jfs_dtree.c
868
rc = dtSplitUp(tid, ip, &split, btstack);
fs/jfs/jfs_dtree.c
924
struct inode *ip, struct dtsplit * split, struct btstack * btstack)
fs/jfs/jfs_dtree.h
244
ino_t * data, struct btstack * btstack, int flag);
fs/jfs/jfs_dtree.h
247
ino_t * ino, struct btstack * btstack);
fs/jfs/jfs_xtree.c
1362
struct btstack btstack; /* traverse stack */
fs/jfs/jfs_xtree.c
1372
if ((rc = xtSearch(ip, xoff - 1, NULL, &cmp, &btstack, XT_INSERT)))
fs/jfs/jfs_xtree.c
1376
XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
fs/jfs/jfs_xtree.c
142
struct btstack btstack;
fs/jfs/jfs_xtree.c
1431
if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
fs/jfs/jfs_xtree.c
1521
struct btstack btstack; /* traverse stack */
fs/jfs/jfs_xtree.c
1537
if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))
fs/jfs/jfs_xtree.c
1541
XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);
fs/jfs/jfs_xtree.c
168
if ((rc = xtSearch(ip, lstart, &next, &cmp, &btstack, 0))) {
fs/jfs/jfs_xtree.c
1725
if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
fs/jfs/jfs_xtree.c
180
XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
fs/jfs/jfs_xtree.c
1830
if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))
fs/jfs/jfs_xtree.c
1834
XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);
fs/jfs/jfs_xtree.c
1878
if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
fs/jfs/jfs_xtree.c
1967
struct btstack btstack; /* traverse stack */
fs/jfs/jfs_xtree.c
1991
if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))
fs/jfs/jfs_xtree.c
1995
XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
fs/jfs/jfs_xtree.c
2023
nsplit = btstack.nsplit;
fs/jfs/jfs_xtree.c
2057
if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {
fs/jfs/jfs_xtree.c
2213
struct btstack btstack;
fs/jfs/jfs_xtree.c
2272
BT_CLR(&btstack);
fs/jfs/jfs_xtree.c
232
int *cmpp, struct btstack * btstack, int flag)
fs/jfs/jfs_xtree.c
248
BT_CLR(btstack);
fs/jfs/jfs_xtree.c
250
btstack->nsplit = 0;
fs/jfs/jfs_xtree.c
2517
if ((parent = BT_POP(&btstack)) == NULL)
fs/jfs/jfs_xtree.c
2691
if (BT_STACK_FULL(&btstack)) {
fs/jfs/jfs_xtree.c
2696
BT_PUSH(&btstack, bn, index);
fs/jfs/jfs_xtree.c
2761
struct btstack btstack;
fs/jfs/jfs_xtree.c
2781
BT_CLR(&btstack);
fs/jfs/jfs_xtree.c
2785
rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0);
fs/jfs/jfs_xtree.c
2789
XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
fs/jfs/jfs_xtree.c
2847
if ((parent = BT_POP(&btstack)) == NULL)
fs/jfs/jfs_xtree.c
2891
if (BT_STACK_FULL(&btstack)) {
fs/jfs/jfs_xtree.c
2896
BT_PUSH(&btstack, bn, index);
fs/jfs/jfs_xtree.c
346
btstack->nsplit = nsplit;
fs/jfs/jfs_xtree.c
350
btsp = btstack->top;
fs/jfs/jfs_xtree.c
393
btstack->nsplit = nsplit;
fs/jfs/jfs_xtree.c
397
btsp = btstack->top;
fs/jfs/jfs_xtree.c
451
btstack->nsplit = nsplit;
fs/jfs/jfs_xtree.c
455
btsp = btstack->top;
fs/jfs/jfs_xtree.c
493
if (BT_STACK_FULL(btstack)) {
fs/jfs/jfs_xtree.c
498
BT_PUSH(btstack, bn, index);
fs/jfs/jfs_xtree.c
538
struct btstack btstack; /* traverse stack */
fs/jfs/jfs_xtree.c
556
if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))
fs/jfs/jfs_xtree.c
560
XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
fs/jfs/jfs_xtree.c
608
if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {
fs/jfs/jfs_xtree.c
680
struct inode *ip, struct xtsplit * split, struct btstack * btstack)
fs/jfs/jfs_xtree.c
754
nsplit = btstack->nsplit;
fs/jfs/jfs_xtree.c
813
while ((parent = BT_POP(btstack)) != NULL) {
fs/jfs/jfs_xtree.c
85
struct btstack * btstack, int flag);
fs/jfs/jfs_xtree.c
89
struct xtsplit * split, struct btstack * btstack);
fs/jfs/namei.c
1018
rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE);
fs/jfs/namei.c
1021
rc = dtInsert(tid, dip, &dname, &ino, &btstack);
fs/jfs/namei.c
1073
struct btstack btstack;
fs/jfs/namei.c
1114
rc = dtSearch(old_dir, &old_dname, &ino, &btstack, JFS_LOOKUP);
fs/jfs/namei.c
1123
rc = dtSearch(new_dir, &new_dname, &ino, &btstack, JFS_LOOKUP);
fs/jfs/namei.c
114
if ((rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE))) {
fs/jfs/namei.c
1217
rc = dtSearch(new_dir, &new_dname, &ino, &btstack,
fs/jfs/namei.c
1226
rc = dtInsert(tid, new_dir, &new_dname, &ino, &btstack);
fs/jfs/namei.c
1362
struct btstack btstack;
fs/jfs/namei.c
138
if ((rc = dtInsert(tid, dip, &dname, &ino, &btstack))) {
fs/jfs/namei.c
1402
if ((rc = dtSearch(dir, &dname, &ino, &btstack, JFS_CREATE))) {
fs/jfs/namei.c
1413
if ((rc = dtInsert(tid, dir, &dname, &ino, &btstack))) {
fs/jfs/namei.c
1454
struct btstack btstack;
fs/jfs/namei.c
1464
rc = dtSearch(dip, &key, &inum, &btstack, JFS_LOOKUP);
fs/jfs/namei.c
204
struct btstack btstack;
fs/jfs/namei.c
247
if ((rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE))) {
fs/jfs/namei.c
271
if ((rc = dtInsert(tid, dip, &dname, &ino, &btstack))) {
fs/jfs/namei.c
71
struct btstack btstack;
fs/jfs/namei.c
795
struct btstack btstack;
fs/jfs/namei.c
820
if ((rc = dtSearch(dir, &dname, &ino, &btstack, JFS_CREATE)))
fs/jfs/namei.c
827
if ((rc = dtInsert(tid, dir, &dname, &ino, &btstack)))
fs/jfs/namei.c
887
struct btstack btstack;