85 		    struct btstack * btstack, int flag);
89 		     struct xtsplit * split, struct btstack * btstack);
142 	struct btstack btstack;  in xtLookup()  local
168 	if ((rc = xtSearch(ip, lstart, &next, &cmp, &btstack, 0))) {  in xtLookup()
180 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);  in xtLookup()
232 		    int *cmpp, struct btstack * btstack, int flag)  in xtSearch()  argument
248 	BT_CLR(btstack);  in xtSearch()
250 	btstack->nsplit = 0;  in xtSearch()
346 				btstack->nsplit = nsplit;  in xtSearch()
350 			btsp = btstack->top;  in xtSearch()
393 						btstack->nsplit = nsplit;  in xtSearch()
397 					btsp = btstack->top;  in xtSearch()
451 				btstack->nsplit = nsplit;  in xtSearch()
455 			btsp = btstack->top;  in xtSearch()
493 		if (BT_STACK_FULL(btstack)) {  in xtSearch()
498 		BT_PUSH(btstack, bn, index);  in xtSearch()
538 	struct btstack btstack;	/* traverse stack */  in xtInsert()  local
556 	if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))  in xtInsert()
560 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);  in xtInsert()
608 		if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {  in xtInsert()
680 	  struct inode *ip, struct xtsplit * split, struct btstack * btstack)  in xtSplitUp()  argument
754 		nsplit = btstack->nsplit;  in xtSplitUp()
813 	while ((parent = BT_POP(btstack)) != NULL) {  in xtSplitUp()
1362 	struct btstack btstack;	/* traverse stack */  in xtExtend()  local
1372 	if ((rc = xtSearch(ip, xoff - 1, NULL, &cmp, &btstack, XT_INSERT)))  in xtExtend()
1376 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);  in xtExtend()
1431 		if ((rc = xtSplitUp(tid, ip, &split, &btstack)))  in xtExtend()
1521 	struct btstack btstack;	/* traverse stack */  in xtUpdate()  local
1537 	if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))  in xtUpdate()
1541 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);  in xtUpdate()
1725 		if ((rc = xtSplitUp(tid, ip, &split, &btstack)))  in xtUpdate()
1830 		if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))  in xtUpdate()
1834 		XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);  in xtUpdate()
1878 		if ((rc = xtSplitUp(tid, ip, &split, &btstack)))  in xtUpdate()
1967 	struct btstack btstack;	/* traverse stack */  in xtAppend()  local
1991 	if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))  in xtAppend()
1995 	XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);  in xtAppend()
2023 	nsplit = btstack.nsplit;  in xtAppend()
2057 	if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {  in xtAppend()
2213 	struct btstack btstack;  in xtTruncate()  local
2272 	BT_CLR(&btstack);  in xtTruncate()
2517 	if ((parent = BT_POP(&btstack)) == NULL)  in xtTruncate()
2691 	if (BT_STACK_FULL(&btstack)) {  in xtTruncate()
2696 	BT_PUSH(&btstack, bn, index);  in xtTruncate()
2761 	struct btstack btstack;  in xtTruncate_pmap()  local
2781 	BT_CLR(&btstack);  in xtTruncate_pmap()
2785 		rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0);  in xtTruncate_pmap()
2789 		XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);  in xtTruncate_pmap()
2847 	if ((parent = BT_POP(&btstack)) == NULL)  in xtTruncate_pmap()
2891 	if (BT_STACK_FULL(&btstack)) {  in xtTruncate_pmap()
2896 	BT_PUSH(&btstack, bn, index);  in xtTruncate_pmap()