btstack           111 fs/jfs/jfs_btree.h #define BT_CLR(btstack)\
btstack           112 fs/jfs/jfs_btree.h 	(btstack)->top = (btstack)->stack
btstack           114 fs/jfs/jfs_btree.h #define BT_STACK_FULL(btstack)\
btstack           115 fs/jfs/jfs_btree.h 	( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1]))
btstack           125 fs/jfs/jfs_btree.h #define BT_POP(btstack)\
btstack           126 fs/jfs/jfs_btree.h 	( (btstack)->top == (btstack)->stack ? NULL : --(btstack)->top )
btstack           128 fs/jfs/jfs_btree.h #define BT_STACK(btstack)\
btstack           129 fs/jfs/jfs_btree.h 	( (btstack)->top == (btstack)->stack ? NULL : (btstack)->top )
btstack           131 fs/jfs/jfs_btree.h static inline void BT_STACK_DUMP(struct btstack *btstack)
btstack           137 fs/jfs/jfs_btree.h 		       (long long)btstack->stack[i].bn,
btstack           138 fs/jfs/jfs_btree.h 		       btstack->stack[i].index);
btstack           140 fs/jfs/jfs_dtree.c 		     struct dtsplit * split, struct btstack * btstack);
btstack           146 fs/jfs/jfs_dtree.c 			struct dtsplit * split, struct btstack * btstack);
btstack           152 fs/jfs/jfs_dtree.c 		      dtpage_t * fp, struct btstack * btstack);
btstack           156 fs/jfs/jfs_dtree.c static int dtReadFirst(struct inode *ip, struct btstack * btstack);
btstack           159 fs/jfs/jfs_dtree.c 		      loff_t * offset, struct btstack * btstack);
btstack           568 fs/jfs/jfs_dtree.c 	     struct btstack * btstack, int flag)
btstack           600 fs/jfs/jfs_dtree.c 	BT_CLR(btstack);	/* reset stack */
btstack           603 fs/jfs/jfs_dtree.c 	btstack->nsplit = 1;
btstack           692 fs/jfs/jfs_dtree.c 					btsp = btstack->top;
btstack           741 fs/jfs/jfs_dtree.c 			btsp = btstack->top;
btstack           763 fs/jfs/jfs_dtree.c 		if (BT_STACK_FULL(btstack)) {
btstack           768 fs/jfs/jfs_dtree.c 			BT_STACK_DUMP(btstack);
btstack           772 fs/jfs/jfs_dtree.c 		btstack->nsplit++;
btstack           775 fs/jfs/jfs_dtree.c 		BT_PUSH(btstack, bn, index);
btstack           810 fs/jfs/jfs_dtree.c 	 struct component_name * name, ino_t * fsn, struct btstack * btstack)
btstack           831 fs/jfs/jfs_dtree.c 	DT_GETSEARCH(ip, btstack->top, bn, mp, p, index);
btstack           863 fs/jfs/jfs_dtree.c 		rc = dtSplitUp(tid, ip, &split, btstack);
btstack           919 fs/jfs/jfs_dtree.c 	  struct inode *ip, struct dtsplit * split, struct btstack * btstack)
btstack          1034 fs/jfs/jfs_dtree.c 		if ((rc = dtExtendPage(tid, ip, split, btstack))) {
btstack          1066 fs/jfs/jfs_dtree.c 	n = btstack->nsplit;
btstack          1115 fs/jfs/jfs_dtree.c 	while ((parent = BT_POP(btstack)) != NULL) {
btstack          1631 fs/jfs/jfs_dtree.c 	     struct inode *ip, struct dtsplit * split, struct btstack * btstack)
btstack          1660 fs/jfs/jfs_dtree.c 	parent = BT_POP(btstack);
btstack          2078 fs/jfs/jfs_dtree.c 	struct btstack btstack;
btstack          2094 fs/jfs/jfs_dtree.c 	if ((rc = dtSearch(ip, key, ino, &btstack, flag)))
btstack          2098 fs/jfs/jfs_dtree.c 	DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack          2144 fs/jfs/jfs_dtree.c 		rc = dtDeleteUp(tid, ip, mp, p, &btstack);
btstack          2226 fs/jfs/jfs_dtree.c 	   struct metapage * fmp, dtpage_t * fp, struct btstack * btstack)
btstack          2294 fs/jfs/jfs_dtree.c 	while ((parent = BT_POP(btstack)) != NULL) {
btstack          2441 fs/jfs/jfs_dtree.c 	struct btstack btstack;
btstack          2462 fs/jfs/jfs_dtree.c 	rc = dtSearchNode(ip, lmxaddr, opxd, &btstack);
btstack          2467 fs/jfs/jfs_dtree.c 	DT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
btstack          2631 fs/jfs/jfs_dtree.c 			struct btstack * btstack)
btstack          2643 fs/jfs/jfs_dtree.c 	BT_CLR(btstack);	/* reset stack */
btstack          2695 fs/jfs/jfs_dtree.c 			btsp = btstack->top;
btstack          3009 fs/jfs/jfs_dtree.c 	struct btstack btstack;
btstack          3111 fs/jfs/jfs_dtree.c 			if ((rc = dtReadFirst(ip, &btstack)))
btstack          3114 fs/jfs/jfs_dtree.c 			DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack          3153 fs/jfs/jfs_dtree.c 		if ((rc = dtReadNext(ip, &ctx->pos, &btstack))) {
btstack          3160 fs/jfs/jfs_dtree.c 		DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack          3330 fs/jfs/jfs_dtree.c static int dtReadFirst(struct inode *ip, struct btstack * btstack)
btstack          3341 fs/jfs/jfs_dtree.c 	BT_CLR(btstack);	/* reset stack */
btstack          3358 fs/jfs/jfs_dtree.c 			btsp = btstack->top;
btstack          3369 fs/jfs/jfs_dtree.c 		if (BT_STACK_FULL(btstack)) {
btstack          3372 fs/jfs/jfs_dtree.c 			BT_STACK_DUMP(btstack);
btstack          3376 fs/jfs/jfs_dtree.c 		BT_PUSH(btstack, bn, 0);
btstack          3403 fs/jfs/jfs_dtree.c 		      struct btstack * btstack)
btstack          3423 fs/jfs/jfs_dtree.c 	if ((rc = dtReadFirst(ip, btstack)))
btstack          3427 fs/jfs/jfs_dtree.c 	DT_GETSEARCH(ip, btstack->top, bn, mp, p, index);
btstack          3483 fs/jfs/jfs_dtree.c 	btsp = btstack->top;
btstack          3559 fs/jfs/jfs_dtree.c 	btsp = btstack->top;
btstack          4515 fs/jfs/jfs_dtree.c 	struct btstack btstack;
btstack          4528 fs/jfs/jfs_dtree.c 	if ((rc = dtSearch(ip, key, orig_ino, &btstack, flag)))
btstack          4532 fs/jfs/jfs_dtree.c 	DT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack           244 fs/jfs/jfs_dtree.h 		    ino_t * data, struct btstack * btstack, int flag);
btstack           247 fs/jfs/jfs_dtree.h 		    ino_t * ino, struct btstack * btstack);
btstack           105 fs/jfs/jfs_xtree.c 		    struct btstack * btstack, int flag);
btstack           109 fs/jfs/jfs_xtree.c 		     struct xtsplit * split, struct btstack * btstack);
btstack           119 fs/jfs/jfs_xtree.c 		      xtpage_t * fp, struct btstack * btstack);
btstack           123 fs/jfs/jfs_xtree.c 			int *cmpp, struct btstack * btstack, int flag);
btstack           137 fs/jfs/jfs_xtree.c 	struct btstack btstack;
btstack           163 fs/jfs/jfs_xtree.c 	if ((rc = xtSearch(ip, lstart, &next, &cmp, &btstack, 0))) {
btstack           175 fs/jfs/jfs_xtree.c 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack           227 fs/jfs/jfs_xtree.c 		    int *cmpp, struct btstack * btstack, int flag)
btstack           244 fs/jfs/jfs_xtree.c 	BT_CLR(btstack);
btstack           246 fs/jfs/jfs_xtree.c 	btstack->nsplit = 0;
btstack           342 fs/jfs/jfs_xtree.c 				btstack->nsplit = nsplit;
btstack           346 fs/jfs/jfs_xtree.c 			btsp = btstack->top;
btstack           389 fs/jfs/jfs_xtree.c 						btstack->nsplit = nsplit;
btstack           393 fs/jfs/jfs_xtree.c 					btsp = btstack->top;
btstack           447 fs/jfs/jfs_xtree.c 				btstack->nsplit = nsplit;
btstack           451 fs/jfs/jfs_xtree.c 			btsp = btstack->top;
btstack           489 fs/jfs/jfs_xtree.c 		if (BT_STACK_FULL(btstack)) {
btstack           494 fs/jfs/jfs_xtree.c 		BT_PUSH(btstack, bn, index);
btstack           534 fs/jfs/jfs_xtree.c 	struct btstack btstack;	/* traverse stack */
btstack           552 fs/jfs/jfs_xtree.c 	if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))
btstack           556 fs/jfs/jfs_xtree.c 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack           604 fs/jfs/jfs_xtree.c 		if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {
btstack           676 fs/jfs/jfs_xtree.c 	  struct inode *ip, struct xtsplit * split, struct btstack * btstack)
btstack           750 fs/jfs/jfs_xtree.c 		nsplit = btstack->nsplit;
btstack           809 fs/jfs/jfs_xtree.c 	while ((parent = BT_POP(btstack)) != NULL) {
btstack          1358 fs/jfs/jfs_xtree.c 	struct btstack btstack;	/* traverse stack */
btstack          1368 fs/jfs/jfs_xtree.c 	if ((rc = xtSearch(ip, xoff - 1, NULL, &cmp, &btstack, XT_INSERT)))
btstack          1372 fs/jfs/jfs_xtree.c 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack          1427 fs/jfs/jfs_xtree.c 		if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
btstack          1521 fs/jfs/jfs_xtree.c 	struct btstack btstack;	/* traverse stack */
btstack          1535 fs/jfs/jfs_xtree.c 	if ((rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, XT_INSERT)))
btstack          1539 fs/jfs/jfs_xtree.c 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack          1592 fs/jfs/jfs_xtree.c 		if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
btstack          1700 fs/jfs/jfs_xtree.c 	struct btstack btstack;	/* traverse stack */
btstack          1716 fs/jfs/jfs_xtree.c 	if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))
btstack          1720 fs/jfs/jfs_xtree.c 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);
btstack          1925 fs/jfs/jfs_xtree.c 		if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
btstack          2030 fs/jfs/jfs_xtree.c 		if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))
btstack          2034 fs/jfs/jfs_xtree.c 		XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);
btstack          2078 fs/jfs/jfs_xtree.c 		if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
btstack          2167 fs/jfs/jfs_xtree.c 	struct btstack btstack;	/* traverse stack */
btstack          2191 fs/jfs/jfs_xtree.c 	if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))
btstack          2195 fs/jfs/jfs_xtree.c 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack          2223 fs/jfs/jfs_xtree.c 	nsplit = btstack.nsplit;
btstack          2257 fs/jfs/jfs_xtree.c 	if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {
btstack          2329 fs/jfs/jfs_xtree.c 	struct btstack btstack;
btstack          2341 fs/jfs/jfs_xtree.c 	if ((rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0)))
btstack          2344 fs/jfs/jfs_xtree.c 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack          2361 fs/jfs/jfs_xtree.c 		return (xtDeleteUp(tid, ip, mp, p, &btstack));
btstack          2398 fs/jfs/jfs_xtree.c 	   struct metapage * fmp, xtpage_t * fp, struct btstack * btstack)
btstack          2448 fs/jfs/jfs_xtree.c 	while ((parent = BT_POP(btstack)) != NULL) {
btstack          2568 fs/jfs/jfs_xtree.c 	struct btstack btstack;	/* traverse stack */
btstack          2590 fs/jfs/jfs_xtree.c 		rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0);
btstack          2595 fs/jfs/jfs_xtree.c 		XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
btstack          2611 fs/jfs/jfs_xtree.c 		rc = xtSearchNode(ip, oxad, &cmp, &btstack, 0);
btstack          2616 fs/jfs/jfs_xtree.c 		XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
btstack          2696 fs/jfs/jfs_xtree.c 		if ((rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0)))
btstack          2699 fs/jfs/jfs_xtree.c 		XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
btstack          2879 fs/jfs/jfs_xtree.c 			int *cmpp, struct btstack * btstack, int flag)
btstack          2892 fs/jfs/jfs_xtree.c 	BT_CLR(btstack);
btstack          2944 fs/jfs/jfs_xtree.c 					btsp = btstack->top;
btstack          3160 fs/jfs/jfs_xtree.c 	struct btstack btstack;
btstack          3219 fs/jfs/jfs_xtree.c 	BT_CLR(&btstack);
btstack          3464 fs/jfs/jfs_xtree.c 	if ((parent = BT_POP(&btstack)) == NULL)
btstack          3638 fs/jfs/jfs_xtree.c 	if (BT_STACK_FULL(&btstack)) {
btstack          3643 fs/jfs/jfs_xtree.c 	BT_PUSH(&btstack, bn, index);
btstack          3708 fs/jfs/jfs_xtree.c 	struct btstack btstack;
btstack          3728 fs/jfs/jfs_xtree.c 	BT_CLR(&btstack);
btstack          3732 fs/jfs/jfs_xtree.c 		rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0);
btstack          3736 fs/jfs/jfs_xtree.c 		XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
btstack          3794 fs/jfs/jfs_xtree.c 	if ((parent = BT_POP(&btstack)) == NULL)
btstack          3838 fs/jfs/jfs_xtree.c 	if (BT_STACK_FULL(&btstack)) {
btstack          3843 fs/jfs/jfs_xtree.c 	BT_PUSH(&btstack, bn, index);
btstack            70 fs/jfs/namei.c 	struct btstack btstack;
btstack           113 fs/jfs/namei.c 	if ((rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE))) {
btstack           137 fs/jfs/namei.c 	if ((rc = dtInsert(tid, dip, &dname, &ino, &btstack))) {
btstack           202 fs/jfs/namei.c 	struct btstack btstack;
btstack           245 fs/jfs/namei.c 	if ((rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE))) {
btstack           269 fs/jfs/namei.c 	if ((rc = dtInsert(tid, dip, &dname, &ino, &btstack))) {
btstack           792 fs/jfs/namei.c 	struct btstack btstack;
btstack           812 fs/jfs/namei.c 	if ((rc = dtSearch(dir, &dname, &ino, &btstack, JFS_CREATE)))
btstack           819 fs/jfs/namei.c 	if ((rc = dtInsert(tid, dir, &dname, &ino, &btstack)))
btstack           879 fs/jfs/namei.c 	struct btstack btstack;
btstack          1010 fs/jfs/namei.c 	rc = dtSearch(dip, &dname, &ino, &btstack, JFS_CREATE);
btstack          1013 fs/jfs/namei.c 		rc = dtInsert(tid, dip, &dname, &ino, &btstack);
btstack          1065 fs/jfs/namei.c 	struct btstack btstack;
btstack          1106 fs/jfs/namei.c 	rc = dtSearch(old_dir, &old_dname, &ino, &btstack, JFS_LOOKUP);
btstack          1115 fs/jfs/namei.c 	rc = dtSearch(new_dir, &new_dname, &ino, &btstack, JFS_LOOKUP);
btstack          1209 fs/jfs/namei.c 		rc = dtSearch(new_dir, &new_dname, &ino, &btstack,
btstack          1218 fs/jfs/namei.c 		rc = dtInsert(tid, new_dir, &new_dname, &ino, &btstack);
btstack          1351 fs/jfs/namei.c 	struct btstack btstack;
btstack          1391 fs/jfs/namei.c 	if ((rc = dtSearch(dir, &dname, &ino, &btstack, JFS_CREATE))) {
btstack          1402 fs/jfs/namei.c 	if ((rc = dtInsert(tid, dir, &dname, &ino, &btstack))) {
btstack          1443 fs/jfs/namei.c 	struct btstack btstack;
btstack          1453 fs/jfs/namei.c 	rc = dtSearch(dip, &key, &inum, &btstack, JFS_LOOKUP);