Searched refs:CFL (Results 1 - 8 of 8) sorted by relevance

/linux-4.4.14/arch/x86/um/vdso/
H A DMakefile40 CFL := $(PROFILING) -mcmodel=small -fPIC -O2 -fasynchronous-unwind-tables -m64 \ macro
44 $(vobjs): KBUILD_CFLAGS += $(CFL)
/linux-4.4.14/fs/reiserfs/
H A Dibalance.c50 *cf = tb->CFL[h]; internal_define_dest_src_infos()
63 *cf = tb->CFL[h]; internal_define_dest_src_infos()
544 /* insert lkey[h]-th key from CFL[h] to left neighbor L[h] */ internal_shift1_left()
590 if (tb->CFL[h]) internal_shift_right()
591 replace_key(tb, cf, d_key_position, tb->CFL[h], internal_shift_right()
746 internal_shift_left(INTERNAL_SHIFT_FROM_S_TO_L, tb, h, tb->lnum[h]); /*tb->L[h], tb->CFL[h], tb->lkey[h], tb->S[h], tb->lnum[h]); */ balance_internal_when_delete()
762 RFALSE(tb->L[h] == NULL || tb->CFL[h] == NULL, replace_lkey()
763 "L[h](%p) and CFL[h](%p) must exist in replace_lkey", replace_lkey()
764 tb->L[h], tb->CFL[h]); replace_lkey()
769 memcpy(internal_key(tb->CFL[h], tb->lkey[h]), key, KEY_SIZE); replace_lkey()
771 do_balance_mark_internal_dirty(tb, tb->CFL[h], 0); replace_lkey()
857 * check how many of new items fall into L[h] or CFL[h] after balance_internal()
862 /* new items don't fall into L[h] or CFL[h] */ balance_internal()
886 * some items fall into L[h] or CFL[h], balance_internal()
H A Ddo_balan.c93 if (!item_pos && tb->CFL[0]) { balance_leaf_when_delete_del()
95 replace_key(tb, tb->CFL[0], tb->lkey[0], tbS0, 0); balance_leaf_when_delete_del()
98 replace_key(tb, tb->CFL[0], tb->lkey[0], balance_leaf_when_delete_del()
103 RFALSE(!item_pos && !tb->CFL[0], balance_leaf_when_delete_del()
104 "PAP-12020: tb->CFL[0]==%p, tb->L[0]==%p", tb->CFL[0], balance_leaf_when_delete_del()
130 RFALSE(!item_pos && !pos_in_item && !tb->CFL[0], balance_leaf_when_delete_cut()
131 "PAP-12030: can not change delimiting key. CFL[0]=%p", balance_leaf_when_delete_cut()
132 tb->CFL[0]); balance_leaf_when_delete_cut()
134 if (!item_pos && !pos_in_item && tb->CFL[0]) balance_leaf_when_delete_cut()
135 replace_key(tb, tb->CFL[0], tb->lkey[0], tbS0, 0); balance_leaf_when_delete_cut()
162 replace_key(tb, tb->CFL[0], balance_leaf_when_delete_left()
496 left_delim_key = internal_key(tb->CFL[0], tb->lkey[0]); balance_leaf_paste_left_shift()
1282 if (tb->CFL[0]) /* can be 0 in reiserfsck */ balance_leaf_finish_node_insert()
1283 replace_key(tb, tb->CFL[0], tb->lkey[0], tbS0, 0); balance_leaf_finish_node_insert()
1311 RFALSE(!tb->CFL[0] || !tb->L[0], balance_leaf_finish_node_paste_dirent()
1312 "PAP-12270: CFL[0]/L[0] must be specified"); balance_leaf_finish_node_paste_dirent()
1313 if (tb->CFL[0]) balance_leaf_finish_node_paste_dirent()
1314 replace_key(tb, tb->CFL[0], tb->lkey[0], balance_leaf_finish_node_paste_dirent()
1448 if (tb->CFL[0]) { balance_leaf()
1452 copy_key(internal_key(tb->CFL[0], tb->lkey[0]), balance_leaf()
1454 do_balance_mark_internal_dirty(tb, tb->CFL[0], 0); balance_leaf()
1677 retval |= locked_or_not_in_tree(tb, tb->CFL[0], "CFL[0]"); check_before_balancing()
H A Dfix_node.c810 brelse(tb->CFL[i]); free_buffers_in_tb()
817 tb->CFL[i] = NULL; free_buffers_in_tb()
1167 * F[path_offset], FL[path_offset], FR[path_offset], CFL[path_offset],
1190 brelse(tb->CFL[h]); get_parents()
1194 tb->CFL[h] = NULL; get_parents()
1214 * Note that CFL[path_offset] not equal FL[path_offset] and get_parents()
1215 * CFL[path_offset] not equal F[path_offset]. get_parents()
1226 brelse(tb->CFL[h]); get_parents()
1227 tb->CFL[h] = curcf; /* New initialization of CFL[h]. */ get_parents()
1231 "PAP-8195: FL (%b) or CFL (%b) is invalid", curf, curcf); get_parents()
2431 if (!locked && tb->CFL[i]) { wait_tb_buffers_until_unlocked()
2433 tb->CFL[i], wait_tb_buffers_until_unlocked()
2434 "CFL", i); wait_tb_buffers_until_unlocked()
2436 (tb->tb_sb, tb->CFL[i])) wait_tb_buffers_until_unlocked()
2437 locked = tb->CFL[i]; wait_tb_buffers_until_unlocked()
2748 CFL[i]); fix_nodes()
2758 brelse(tb->CFL[i]); fix_nodes()
2765 tb->CFL[i] = NULL; fix_nodes()
2794 reiserfs_restore_prepared_buffer(tb->tb_sb, tb->CFL[i]); unfix_nodes()
2801 brelse(tb->CFL[i]); unfix_nodes()
H A Dprints.c635 "* h * S * L * R * F * FL * FR * CFL * CFR *\n", store_print_tb()
665 (tb->CFL[h]) ? (long long)(tb->CFL[h]-> store_print_tb()
H A Dlbalance.c769 replace_key(tb, tb->CFL[0], tb->lkey[0], leaf_shift_left()
773 /* replace lkey in CFL[0] by 0-th key from S[0]; */ leaf_shift_left()
774 replace_key(tb, tb->CFL[0], tb->lkey[0], S0, 0); leaf_shift_left()
H A Dreiserfs.h2423 struct buffer_head *CFL[MAX_HEIGHT]; member in struct:tree_balance
2451 * S[h] to its item number within the node CFL[h]
/linux-4.4.14/arch/x86/entry/vdso/
H A DMakefile67 CFL := $(PROFILING) -mcmodel=small -fPIC -O2 -fasynchronous-unwind-tables -m64 \ macro
72 $(vobjs): KBUILD_CFLAGS += $(CFL)

Completed in 331 milliseconds