Lines Matching refs:bt
36 void n_init(node *np, btree *bt, int type, int height)
38 np->bt = bt;
60 btree *bt = np->bt;
63 if (bt->hdr.bthFree == 0)
70 while (num < bt->hdr.bthNNodes && BMTST(bt->map, num))
73 if (num == bt->hdr.bthNNodes)
81 BMSET(bt->map, num);
82 --bt->hdr.bthFree;
84 bt->flags |= HFS_UPDATE_BTHDR;
95 btree *bt = np->bt;
97 BMCLR(bt->map, np->nnum);
98 ++bt->hdr.bthFree;
100 bt->flags |= HFS_UPDATE_BTHDR;
149 btree *bt = np->bt;
161 comp = bt->compare(rec, key);
176 void n_index(btree *bt, unsigned char *key, unsigned long nnum,
179 if (bt == &bt->f.vol->cat)
289 n_index(right.bt, HFS_NODEREC(right, 0), right.nnum, record, reclen);
293 if (left->bt->hdr.bthLNode == left->nnum)
295 left->bt->hdr.bthLNode = right.nnum;
296 left->bt->flags |= HFS_UPDATE_BTHDR;
303 n.bt = right.bt;
390 if (right->bt->hdr.bthLNode == right->nnum)
392 right->bt->hdr.bthLNode = left->nnum;
393 right->bt->flags |= HFS_UPDATE_BTHDR;
400 n.bt = right->bt;
436 left.bt = np->bt;
454 n_index(np->bt, HFS_NODEREC(*np, 0), np->nnum, record, 0);