105 		    struct btstack * btstack, int flag);
109 		     struct xtsplit * split, struct btstack * btstack);
126 	struct btstack btstack;  in xtLookup()  local
152 	if ((rc = xtSearch(ip, lstart, &next, &cmp, &btstack, 0))) {  in xtLookup()
164 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);  in xtLookup()
216 		    int *cmpp, struct btstack * btstack, int flag)  in xtSearch()  argument
233 	BT_CLR(btstack);  in xtSearch()
235 	btstack->nsplit = 0;  in xtSearch()
331 				btstack->nsplit = nsplit;  in xtSearch()
335 			btsp = btstack->top;  in xtSearch()
378 						btstack->nsplit = nsplit;  in xtSearch()
382 					btsp = btstack->top;  in xtSearch()
436 				btstack->nsplit = nsplit;  in xtSearch()
440 			btsp = btstack->top;  in xtSearch()
478 		if (BT_STACK_FULL(btstack)) {  in xtSearch()
483 		BT_PUSH(btstack, bn, index);  in xtSearch()
523 	struct btstack btstack;	/* traverse stack */  in xtInsert()  local
541 	if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))  in xtInsert()
545 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);  in xtInsert()
593 		if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {  in xtInsert()
665 	  struct inode *ip, struct xtsplit * split, struct btstack * btstack)  in xtSplitUp()  argument
739 		nsplit = btstack->nsplit;  in xtSplitUp()
798 	while ((parent = BT_POP(btstack)) != NULL) {  in xtSplitUp()
1347 	struct btstack btstack;	/* traverse stack */  in xtExtend()  local
1357 	if ((rc = xtSearch(ip, xoff - 1, NULL, &cmp, &btstack, XT_INSERT)))  in xtExtend()
1361 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);  in xtExtend()
1416 		if ((rc = xtSplitUp(tid, ip, &split, &btstack)))  in xtExtend()
1506 	struct btstack btstack;	/* traverse stack */  in xtUpdate()  local
1522 	if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))  in xtUpdate()
1526 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);  in xtUpdate()
1710 		if ((rc = xtSplitUp(tid, ip, &split, &btstack)))  in xtUpdate()
1815 		if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))  in xtUpdate()
1819 		XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);  in xtUpdate()
1863 		if ((rc = xtSplitUp(tid, ip, &split, &btstack)))  in xtUpdate()
1952 	struct btstack btstack;	/* traverse stack */  in xtAppend()  local
1976 	if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))  in xtAppend()
1980 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);  in xtAppend()
2008 	nsplit = btstack.nsplit;  in xtAppend()
2042 	if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {  in xtAppend()
2199 	struct btstack btstack;  in xtTruncate()  local
2258 	BT_CLR(&btstack);  in xtTruncate()
2503 	if ((parent = BT_POP(&btstack)) == NULL)  in xtTruncate()
2677 	if (BT_STACK_FULL(&btstack)) {  in xtTruncate()
2682 	BT_PUSH(&btstack, bn, index);  in xtTruncate()
2747 	struct btstack btstack;  in xtTruncate_pmap()  local
2767 	BT_CLR(&btstack);  in xtTruncate_pmap()
2771 		rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0);  in xtTruncate_pmap()
2775 		XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);  in xtTruncate_pmap()
2833 	if ((parent = BT_POP(&btstack)) == NULL)  in xtTruncate_pmap()
2877 	if (BT_STACK_FULL(&btstack)) {  in xtTruncate_pmap()
2882 	BT_PUSH(&btstack, bn, index);  in xtTruncate_pmap()