Lines Matching refs:FL
806 brelse(tb->FL[i]);
813 tb->FL[i] = NULL;
921 (l = tb->FL[h]) == NULL)
967 if (!tb->FL[h])
975 !B_IS_IN_TREE(tb->FL[h]) ||
977 !buffer_uptodate(tb->FL[h]),
978 "vs-8165: F[h] (%b) or FL[h] (%b) is invalid",
979 father, tb->FL[h]);
985 left_neighbor_position = (father == tb->FL[h]) ?
986 tb->lkey[h] : B_NR_ITEMS(tb->FL[h]);
989 B_N_CHILD_NUM(tb->FL[h], left_neighbor_position);
1014 * current node, that is calculate the left/right (FL[h]/FR[h]) neighbor
1165 * F[path_offset], FL[path_offset], FR[path_offset], CFL[path_offset],
1187 brelse(tb->FL[h]);
1191 tb->FL[h] = NULL;
1198 /* Get parent FL[path_offset] of L[path_offset]. */
1212 * Note that CFL[path_offset] not equal FL[path_offset] and
1222 brelse(tb->FL[h]);
1223 tb->FL[h] = curf; /* New initialization of FL[h]. */
1229 "PAP-8195: FL (%b) or CFL (%b) is invalid", curf, curcf);
1794 0) ? B_NR_ITEMS(tb->FL[h]) : n - 1;
1795 n = dc_size(B_N_CHILD(tb->FL[h], order_L)) /
1856 0) ? B_NR_ITEMS(tb->FL[h]) : n - 1;
1857 n = dc_size(B_N_CHILD(tb->FL[h], order_L)) / (DC_SIZE +
1892 RFALSE(!tb->FL[h] && !tb->FR[h], "vs-8235: trying to borrow for root");
1990 RFALSE(!tb->FL[h],
1991 "vs-8245: dc_check_balance_leaf: FL[h] must exist");
2167 RFALSE(bh == tb->FL[h] &&
2173 tb->FL[h]) ? tb->lkey[h] : B_NR_ITEMS(tb->
2174 FL[h]);
2175 son_number = B_N_CHILD_NUM(tb->FL[h], child_position);
2187 RFALSE(!B_IS_IN_TREE(tb->FL[h]) ||
2188 child_position > B_NR_ITEMS(tb->FL[h]) ||
2189 B_N_CHILD_NUM(tb->FL[h], child_position) !=
2195 dc_size(B_N_CHILD(tb->FL[0], child_position)),
2418 if (!locked && tb->FL[i]) {
2420 tb->FL[i],
2421 "FL", i);
2423 (tb->tb_sb, tb->FL[i]))
2424 locked = tb->FL[i];
2739 tb->FL[i]);
2752 brelse(tb->FL[i]);
2759 tb->FL[i] = NULL;
2788 reiserfs_restore_prepared_buffer(tb->tb_sb, tb->FL[i]);
2795 brelse(tb->FL[i]);