btstack 125 fs/jfs/jfs_btree.h (btstack)->top = (btstack)->stack
btstack 128 fs/jfs/jfs_btree.h ( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1]))
btstack 139 fs/jfs/jfs_btree.h ( (btstack)->top == (btstack)->stack ? NULL : --(btstack)->top )
btstack 142 fs/jfs/jfs_btree.h ( (btstack)->top == (btstack)->stack ? NULL : (btstack)->top )
btstack 150 fs/jfs/jfs_btree.h (long long)btstack->stack[i].bn,
btstack 151 fs/jfs/jfs_btree.h btstack->stack[i].index);
btstack 611 fs/jfs/jfs_dtree.c BT_CLR(btstack); /* reset stack */
btstack 614 fs/jfs/jfs_dtree.c btstack->nsplit = 1;
btstack 703 fs/jfs/jfs_dtree.c btsp = btstack->top;
btstack 752 fs/jfs/jfs_dtree.c btsp = btstack->top;
btstack 774 fs/jfs/jfs_dtree.c if (BT_STACK_FULL(btstack)) {
btstack 779 fs/jfs/jfs_dtree.c BT_STACK_DUMP(btstack);
btstack 783 fs/jfs/jfs_dtree.c btstack->nsplit++;
btstack 786 fs/jfs/jfs_dtree.c BT_PUSH(btstack, bn, index);
btstack 842 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack->top, bn, mp, p, index);
btstack 874 fs/jfs/jfs_dtree.c rc = dtSplitUp(tid, ip, &split, btstack);
btstack 1046 fs/jfs/jfs_dtree.c if ((rc = dtExtendPage(tid, ip, split, btstack))) {
btstack 1078 fs/jfs/jfs_dtree.c n = btstack->nsplit;
btstack 1127 fs/jfs/jfs_dtree.c while ((parent = BT_POP(btstack)) != NULL) {
btstack 1671 fs/jfs/jfs_dtree.c parent = BT_POP(btstack);
btstack 2087 fs/jfs/jfs_dtree.c struct btstack btstack;
btstack 2103 fs/jfs/jfs_dtree.c if ((rc = dtSearch(ip, key, ino, &btstack, flag)))
btstack 2107 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 2153 fs/jfs/jfs_dtree.c rc = dtDeleteUp(tid, ip, mp, p, &btstack);
btstack 2303 fs/jfs/jfs_dtree.c while ((parent = BT_POP(btstack)) != NULL) {
btstack 2450 fs/jfs/jfs_dtree.c struct btstack btstack;
btstack 2471 fs/jfs/jfs_dtree.c rc = dtSearchNode(ip, lmxaddr, opxd, &btstack);
btstack 2476 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
btstack 2652 fs/jfs/jfs_dtree.c BT_CLR(btstack); /* reset stack */
btstack 2704 fs/jfs/jfs_dtree.c btsp = btstack->top;
btstack 3018 fs/jfs/jfs_dtree.c struct btstack btstack;
btstack 3114 fs/jfs/jfs_dtree.c if ((rc = dtReadFirst(ip, &btstack)))
btstack 3117 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 3160 fs/jfs/jfs_dtree.c if ((rc = dtReadNext(ip, &filp->f_pos, &btstack))) {
btstack 3167 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 3343 fs/jfs/jfs_dtree.c BT_CLR(btstack); /* reset stack */
btstack 3360 fs/jfs/jfs_dtree.c btsp = btstack->top;
btstack 3371 fs/jfs/jfs_dtree.c if (BT_STACK_FULL(btstack)) {
btstack 3374 fs/jfs/jfs_dtree.c BT_STACK_DUMP(btstack);
btstack 3378 fs/jfs/jfs_dtree.c BT_PUSH(btstack, bn, 0);
btstack 3425 fs/jfs/jfs_dtree.c if ((rc = dtReadFirst(ip, btstack)))
btstack 3429 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack->top, bn, mp, p, index);
btstack 3485 fs/jfs/jfs_dtree.c btsp = btstack->top;
btstack 3561 fs/jfs/jfs_dtree.c btsp = btstack->top;
btstack 4517 fs/jfs/jfs_dtree.c struct btstack btstack;
btstack 4530 fs/jfs/jfs_dtree.c if ((rc = dtSearch(ip, key, orig_ino, &btstack, flag)))
btstack 4534 fs/jfs/jfs_dtree.c DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 149 fs/jfs/jfs_xtree.c struct btstack btstack;
btstack 178 fs/jfs/jfs_xtree.c if ((rc = xtSearch(ip, lstart, &next, &cmp, &btstack, 0))) {
btstack 190 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 251 fs/jfs/jfs_xtree.c struct btstack btstack;
btstack 285 fs/jfs/jfs_xtree.c if ((rc = xtSearch(ip, lstart, NULL, &cmp, &btstack, 0)))
btstack 296 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 517 fs/jfs/jfs_xtree.c BT_CLR(btstack);
btstack 519 fs/jfs/jfs_xtree.c btstack->nsplit = 0;
btstack 615 fs/jfs/jfs_xtree.c btstack->nsplit = nsplit;
btstack 619 fs/jfs/jfs_xtree.c btsp = btstack->top;
btstack 662 fs/jfs/jfs_xtree.c btstack->nsplit = nsplit;
btstack 666 fs/jfs/jfs_xtree.c btsp = btstack->top;
btstack 720 fs/jfs/jfs_xtree.c btstack->nsplit = nsplit;
btstack 724 fs/jfs/jfs_xtree.c btsp = btstack->top;
btstack 762 fs/jfs/jfs_xtree.c if (BT_STACK_FULL(btstack)) {
btstack 767 fs/jfs/jfs_xtree.c BT_PUSH(btstack, bn, index);
btstack 807 fs/jfs/jfs_xtree.c struct btstack btstack; /* traverse stack */
btstack 825 fs/jfs/jfs_xtree.c if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))
btstack 829 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 877 fs/jfs/jfs_xtree.c if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {
btstack 1023 fs/jfs/jfs_xtree.c nsplit = btstack->nsplit;
btstack 1082 fs/jfs/jfs_xtree.c while ((parent = BT_POP(btstack)) != NULL) {
btstack 1630 fs/jfs/jfs_xtree.c struct btstack btstack; /* traverse stack */
btstack 1640 fs/jfs/jfs_xtree.c if ((rc = xtSearch(ip, xoff - 1, NULL, &cmp, &btstack, XT_INSERT)))
btstack 1644 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 1699 fs/jfs/jfs_xtree.c if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
btstack 1793 fs/jfs/jfs_xtree.c struct btstack btstack; /* traverse stack */
btstack 1807 fs/jfs/jfs_xtree.c if ((rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, XT_INSERT)))
btstack 1811 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 1865 fs/jfs/jfs_xtree.c if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
btstack 1973 fs/jfs/jfs_xtree.c struct btstack btstack; /* traverse stack */
btstack 1989 fs/jfs/jfs_xtree.c if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))
btstack 1993 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);
btstack 2198 fs/jfs/jfs_xtree.c if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
btstack 2303 fs/jfs/jfs_xtree.c if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))
btstack 2307 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);
btstack 2352 fs/jfs/jfs_xtree.c if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
btstack 2441 fs/jfs/jfs_xtree.c struct btstack btstack; /* traverse stack */
btstack 2465 fs/jfs/jfs_xtree.c if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))
btstack 2469 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 2497 fs/jfs/jfs_xtree.c nsplit = btstack.nsplit;
btstack 2531 fs/jfs/jfs_xtree.c if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {
btstack 2603 fs/jfs/jfs_xtree.c struct btstack btstack;
btstack 2615 fs/jfs/jfs_xtree.c if ((rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0)))
btstack 2618 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 2635 fs/jfs/jfs_xtree.c return (xtDeleteUp(tid, ip, mp, p, &btstack));
btstack 2722 fs/jfs/jfs_xtree.c while ((parent = BT_POP(btstack)) != NULL) {
btstack 2842 fs/jfs/jfs_xtree.c struct btstack btstack; /* traverse stack */
btstack 2864 fs/jfs/jfs_xtree.c rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0);
btstack 2869 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
btstack 2885 fs/jfs/jfs_xtree.c rc = xtSearchNode(ip, oxad, &cmp, &btstack, 0);
btstack 2890 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
btstack 2970 fs/jfs/jfs_xtree.c if ((rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0)))
btstack 2973 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
btstack 3166 fs/jfs/jfs_xtree.c BT_CLR(btstack);
btstack 3218 fs/jfs/jfs_xtree.c btsp = btstack->top;
btstack 3434 fs/jfs/jfs_xtree.c struct btstack btstack;
btstack 3493 fs/jfs/jfs_xtree.c BT_CLR(&btstack);
btstack 3738 fs/jfs/jfs_xtree.c if ((parent = BT_POP(&btstack)) == NULL)
btstack 3912 fs/jfs/jfs_xtree.c if (BT_STACK_FULL(&btstack)) {
btstack 3917 fs/jfs/jfs_xtree.c BT_PUSH(&btstack, bn, index);
btstack 3982 fs/jfs/jfs_xtree.c struct btstack btstack;
btstack 4002 fs/jfs/jfs_xtree.c BT_CLR(&btstack);
btstack 4006 fs/jfs/jfs_xtree.c rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0);
btstack 4010 fs/jfs/jfs_xtree.c XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack 4069 fs/jfs/jfs_xtree.c if ((parent = BT_POP(&btstack)) == NULL)
btstack 4113 fs/jfs/jfs_xtree.c if (BT_STACK_FULL(&btstack)) {
btstack 4118 fs/jfs/jfs_xtree.c BT_PUSH(&btstack, bn, index);
btstack 82 fs/jfs/namei.c struct btstack btstack;
btstack 121 fs/jfs/namei.c if ((rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE))) {
btstack 145 fs/jfs/namei.c if ((rc = dtInsert(tid, dip, &dname, &ino, &btstack))) {
btstack 210 fs/jfs/namei.c struct btstack btstack;
btstack 255 fs/jfs/namei.c if ((rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE))) {
btstack 279 fs/jfs/namei.c if ((rc = dtInsert(tid, dip, &dname, &ino, &btstack))) {
btstack 792 fs/jfs/namei.c struct btstack btstack;
btstack 815 fs/jfs/namei.c if ((rc = dtSearch(dir, &dname, &ino, &btstack, JFS_CREATE)))
btstack 822 fs/jfs/namei.c if ((rc = dtInsert(tid, dir, &dname, &ino, &btstack)))
btstack 881 fs/jfs/namei.c struct btstack btstack;
btstack 1009 fs/jfs/namei.c rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE);
btstack 1012 fs/jfs/namei.c rc = dtInsert(tid, dip, &dname, &ino, &btstack);
btstack 1063 fs/jfs/namei.c struct btstack btstack;
btstack 1096 fs/jfs/namei.c rc = dtSearch(old_dir, &old_dname, &ino, &btstack, JFS_LOOKUP);
btstack 1105 fs/jfs/namei.c rc = dtSearch(new_dir, &new_dname, &ino, &btstack, JFS_LOOKUP);
btstack 1201 fs/jfs/namei.c rc = dtSearch(new_dir, &new_dname, &ino, &btstack,
btstack 1210 fs/jfs/namei.c rc = dtInsert(tid, new_dir, &new_dname, &ino, &btstack);
btstack 1343 fs/jfs/namei.c struct btstack btstack;
btstack 1382 fs/jfs/namei.c if ((rc = dtSearch(dir, &dname, &ino, &btstack, JFS_CREATE))) {
btstack 1393 fs/jfs/namei.c if ((rc = dtInsert(tid, dir, &dname, &ino, &btstack))) {
btstack 1434 fs/jfs/namei.c struct btstack btstack;
btstack 1454 fs/jfs/namei.c rc = dtSearch(dip, &key, &inum, &btstack, JFS_LOOKUP);