Lines Matching refs:tb_path
41 bi->bi_bh = PATH_PLAST_BUFFER(tb->tb_path);
42 bi->bi_parent = PATH_H_PPARENT(tb->tb_path, 0);
43 bi->bi_position = PATH_H_POSITION(tb->tb_path, 1);
79 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
80 int item_pos = PATH_LAST_POSITION(tb->tb_path);
97 if (!PATH_H_POSITION(tb->tb_path, 1))
99 PATH_H_PPARENT(tb->tb_path, 0), 0);
111 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
112 int item_pos = PATH_LAST_POSITION(tb->tb_path);
114 int pos_in_item = tb->tb_path->pos_in_item;
148 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
155 if (tb->FR[0] == PATH_H_PPARENT(tb->tb_path, 0)) {
160 if (PATH_H_POSITION(tb->tb_path, 1) == 0 &&
241 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
249 RFALSE(!tb->blknum[0] && !PATH_H_PPARENT(tb->tb_path, 0),
417 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
536 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
626 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
711 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
762 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
840 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
884 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
926 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
1016 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
1071 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
1145 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
1197 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
1264 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
1281 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
1315 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
1387 struct buffer_head *tbS0 = PATH_PLAST_BUFFER(tb->tb_path);
1395 tb->item_pos = PATH_LAST_POSITION(tb->tb_path),
1396 tb->pos_in_item = tb->tb_path->pos_in_item,
1581 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1);
1583 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL,
1585 h, tb->FL[h], h, PATH_H_PPARENT(tb->tb_path, h));
1595 int Sh_position = PATH_H_POSITION(tb->tb_path, h + 1);
1597 RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL,
1599 h, PATH_H_PPARENT(tb->tb_path, h), h, tb->FR[h]);
1601 if (Sh_position == B_NR_ITEMS(PATH_H_PPARENT(tb->tb_path, h)))
1675 retval |= locked_or_not_in_tree(tb, PATH_PLAST_BUFFER(tb->tb_path),
1677 check_leaf(PATH_PLAST_BUFFER(tb->tb_path));
1704 if (PATH_H_PBUFFER(tb->tb_path, 1) &&
1705 (B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)) !=
1706 (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) -
1707 dc_size(B_N_CHILD(PATH_H_PBUFFER(tb->tb_path, 1),
1708 PATH_H_POSITION(tb->tb_path, 1)))))) {
1709 int left = B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0));
1710 int right = (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) -
1711 dc_size(B_N_CHILD(PATH_H_PBUFFER(tb->tb_path, 1),
1712 PATH_H_POSITION(tb->tb_path,
1716 "B_FREE_SPACE (PATH_H_PBUFFER(tb->tb_path,0)) = %d; "
1719 MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)),
1720 PATH_H_PBUFFER(tb->tb_path, 1),
1721 PATH_H_POSITION(tb->tb_path, 1),
1723 (PATH_H_PBUFFER(tb->tb_path, 1),
1724 PATH_H_POSITION(tb->tb_path, 1))),
1734 check_leaf(PATH_PLAST_BUFFER(tb->tb_path));
1743 check_internal_node(tb->tb_sb, PATH_H_PBUFFER(tb->tb_path, h),
1797 print_tb(flag, PATH_LAST_POSITION(tb->tb_path),
1798 tb->tb_path->pos_in_item, tb, "check");
1887 child_pos = PATH_H_B_ITEM_ORDER(tb->tb_path, 0) +