Lines Matching refs:btstack
105 struct btstack * btstack, int flag);
109 struct xtsplit * split, struct btstack * btstack);
119 xtpage_t * fp, struct btstack * btstack);
123 int *cmpp, struct btstack * btstack, int flag);
137 struct btstack btstack;
163 if ((rc = xtSearch(ip, lstart, &next, &cmp, &btstack, 0))) {
175 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
218 * btstack - traverse stack;
222 * btstack contains (bn, index) of search path traversed to the entry.
227 int *cmpp, struct btstack * btstack, int flag)
244 BT_CLR(btstack);
246 btstack->nsplit = 0;
342 btstack->nsplit = nsplit;
346 btsp = btstack->top;
389 btstack->nsplit = nsplit;
393 btsp = btstack->top;
447 btstack->nsplit = nsplit;
451 btsp = btstack->top;
489 if (BT_STACK_FULL(btstack)) {
494 BT_PUSH(btstack, bn, index);
534 struct btstack btstack; /* traverse stack */
552 if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))
556 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
604 if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {
670 * btstack - traverse stack from xtSearch()
676 struct inode *ip, struct xtsplit * split, struct btstack * btstack)
750 nsplit = btstack->nsplit;
809 while ((parent = BT_POP(btstack)) != NULL) {
1358 struct btstack btstack; /* traverse stack */
1368 if ((rc = xtSearch(ip, xoff - 1, NULL, &cmp, &btstack, XT_INSERT)))
1372 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
1427 if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
1521 struct btstack btstack; /* traverse stack */
1535 if ((rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, XT_INSERT)))
1539 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
1592 if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
1700 struct btstack btstack; /* traverse stack */
1716 if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))
1720 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);
1925 if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
2030 if ((rc = xtSearch(ip, nxoff, NULL, &cmp, &btstack, XT_INSERT)))
2034 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index0);
2078 if ((rc = xtSplitUp(tid, ip, &split, &btstack)))
2167 struct btstack btstack; /* traverse stack */
2191 if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))
2195 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
2223 nsplit = btstack.nsplit;
2257 if ((rc = xtSplitUp(tid, ip, &split, &btstack))) {
2329 struct btstack btstack;
2341 if ((rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0)))
2344 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
2361 return (xtDeleteUp(tid, ip, mp, p, &btstack));
2398 struct metapage * fmp, xtpage_t * fp, struct btstack * btstack)
2448 while ((parent = BT_POP(btstack)) != NULL) {
2568 struct btstack btstack; /* traverse stack */
2590 rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0);
2595 XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
2611 rc = xtSearchNode(ip, oxad, &cmp, &btstack, 0);
2616 XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
2696 if ((rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0)))
2699 XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
2870 * btstack - traverse stack;
2874 * btstack contains (bn, index) of search path traversed to the entry.
2879 int *cmpp, struct btstack * btstack, int flag)
2892 BT_CLR(btstack);
2944 btsp = btstack->top;
3160 struct btstack btstack;
3219 BT_CLR(&btstack);
3464 if ((parent = BT_POP(&btstack)) == NULL)
3638 if (BT_STACK_FULL(&btstack)) {
3643 BT_PUSH(&btstack, bn, index);
3708 struct btstack btstack;
3728 BT_CLR(&btstack);
3732 rc = xtSearch(ip, xoff, NULL, &cmp, &btstack, 0);
3736 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
3794 if ((parent = BT_POP(&btstack)) == NULL)
3838 if (BT_STACK_FULL(&btstack)) {
3843 BT_PUSH(&btstack, bn, index);