📄 btr0pcur.c
字号:
/* If optimistic restoration did not succeed, open the cursor anew */ heap = mem_heap_create(256); tree = btr_cur_get_tree(btr_pcur_get_btr_cur(cursor)); tuple = dict_tree_build_data_tuple(tree, cursor->old_rec, cursor->old_n_fields, heap); /* Save the old search mode of the cursor */ old_mode = cursor->search_mode; if (UNIV_LIKELY(cursor->rel_pos == BTR_PCUR_ON)) { mode = PAGE_CUR_LE; } else if (cursor->rel_pos == BTR_PCUR_AFTER) { mode = PAGE_CUR_G; } else { ut_ad(cursor->rel_pos == BTR_PCUR_BEFORE); mode = PAGE_CUR_L; } btr_pcur_open_with_no_init(btr_pcur_get_btr_cur(cursor)->index, tuple, mode, latch_mode, cursor, 0, mtr); /* Restore the old search mode */ cursor->search_mode = old_mode; if (cursor->rel_pos == BTR_PCUR_ON && btr_pcur_is_on_user_rec(cursor, mtr) && 0 == cmp_dtuple_rec(tuple, btr_pcur_get_rec(cursor), rec_get_offsets(btr_pcur_get_rec(cursor), btr_pcur_get_btr_cur(cursor)->index, NULL, ULINT_UNDEFINED, &heap))) { /* We have to store the NEW value for the modify clock, since the cursor can now be on a different page! But we can retain the value of old_rec */ cursor->block_when_stored = buf_block_align(btr_pcur_get_page(cursor)); cursor->modify_clock = buf_block_get_modify_clock(cursor->block_when_stored); cursor->old_stored = BTR_PCUR_OLD_STORED; mem_heap_free(heap); return(TRUE); } mem_heap_free(heap); /* We have to store new position information, modify_clock etc., to the cursor because it can now be on a different page, the record under it may have been removed, etc. */ btr_pcur_store_position(cursor, mtr); return(FALSE);}/******************************************************************If the latch mode of the cursor is BTR_LEAF_SEARCH or BTR_LEAF_MODIFY,releases the page latch and bufferfix reserved by the cursor.NOTE! In the case of BTR_LEAF_MODIFY, there should not exist changesmade by the current mini-transaction to the data protected by thecursor latch, as then the latch must not be released until mtr_commit. */voidbtr_pcur_release_leaf(/*==================*/ btr_pcur_t* cursor, /* in: persistent cursor */ mtr_t* mtr) /* in: mtr */{ page_t* page; ut_a(cursor->pos_state == BTR_PCUR_IS_POSITIONED); ut_ad(cursor->latch_mode != BTR_NO_LATCHES); page = btr_cur_get_page(btr_pcur_get_btr_cur(cursor)); btr_leaf_page_release(page, cursor->latch_mode, mtr); cursor->latch_mode = BTR_NO_LATCHES; cursor->pos_state = BTR_PCUR_WAS_POSITIONED;}/*************************************************************Moves the persistent cursor to the first record on the next page. Releases thelatch on the current page, and bufferunfixes it. Note that there must not bemodifications on the current page, as then the x-latch can be released only inmtr_commit. */voidbtr_pcur_move_to_next_page(/*=======================*/ btr_pcur_t* cursor, /* in: persistent cursor; must be on the last record of the current page */ mtr_t* mtr) /* in: mtr */{ ulint next_page_no; ulint space; page_t* page; page_t* next_page; ut_a(cursor->pos_state == BTR_PCUR_IS_POSITIONED); ut_ad(cursor->latch_mode != BTR_NO_LATCHES); ut_ad(btr_pcur_is_after_last_on_page(cursor, mtr)); cursor->old_stored = BTR_PCUR_OLD_NOT_STORED; page = btr_pcur_get_page(cursor); next_page_no = btr_page_get_next(page, mtr); space = buf_frame_get_space_id(page); ut_ad(next_page_no != FIL_NULL); next_page = btr_page_get(space, next_page_no, cursor->latch_mode, mtr); ut_a(page_is_comp(next_page) == page_is_comp(page)); buf_block_align(next_page)->check_index_page_at_flush = TRUE; btr_leaf_page_release(page, cursor->latch_mode, mtr); page_cur_set_before_first(next_page, btr_pcur_get_page_cur(cursor)); page_check_dir(next_page);}/*************************************************************Moves the persistent cursor backward if it is on the first record of the page.Commits mtr. Note that to prevent a possible deadlock, the operationfirst stores the position of the cursor, commits mtr, acquires the necessarylatches and restores the cursor position again before returning. Thealphabetical position of the cursor is guaranteed to be sensible onreturn, but it may happen that the cursor is not positioned on the lastrecord of any page, because the structure of the tree may have changedduring the time when the cursor had no latches. */voidbtr_pcur_move_backward_from_page(/*=============================*/ btr_pcur_t* cursor, /* in: persistent cursor, must be on the first record of the current page */ mtr_t* mtr) /* in: mtr */{ ulint prev_page_no; ulint space; page_t* page; page_t* prev_page; ulint latch_mode; ulint latch_mode2; ut_a(cursor->pos_state == BTR_PCUR_IS_POSITIONED); ut_ad(cursor->latch_mode != BTR_NO_LATCHES); ut_ad(btr_pcur_is_before_first_on_page(cursor, mtr)); ut_ad(!btr_pcur_is_before_first_in_tree(cursor, mtr)); latch_mode = cursor->latch_mode; if (latch_mode == BTR_SEARCH_LEAF) { latch_mode2 = BTR_SEARCH_PREV; } else if (latch_mode == BTR_MODIFY_LEAF) { latch_mode2 = BTR_MODIFY_PREV; } else { latch_mode2 = 0; /* To eliminate compiler warning */ ut_error; } btr_pcur_store_position(cursor, mtr); mtr_commit(mtr); mtr_start(mtr); btr_pcur_restore_position(latch_mode2, cursor, mtr); page = btr_pcur_get_page(cursor); prev_page_no = btr_page_get_prev(page, mtr); space = buf_frame_get_space_id(page); if (btr_pcur_is_before_first_on_page(cursor, mtr) && (prev_page_no != FIL_NULL)) { prev_page = btr_pcur_get_btr_cur(cursor)->left_page; btr_leaf_page_release(page, latch_mode, mtr); page_cur_set_after_last(prev_page, btr_pcur_get_page_cur(cursor)); } else if (prev_page_no != FIL_NULL) { /* The repositioned cursor did not end on an infimum record on a page. Cursor repositioning acquired a latch also on the previous page, but we do not need the latch: release it. */ prev_page = btr_pcur_get_btr_cur(cursor)->left_page; btr_leaf_page_release(prev_page, latch_mode, mtr); } cursor->latch_mode = latch_mode; cursor->old_stored = BTR_PCUR_OLD_NOT_STORED;}/*************************************************************Moves the persistent cursor to the previous record in the tree. If no recordsare left, the cursor stays 'before first in tree'. */iboolbtr_pcur_move_to_prev(/*==================*/ /* out: TRUE if the cursor was not before first in tree */ btr_pcur_t* cursor, /* in: persistent cursor; NOTE that the function may release the page latch */ mtr_t* mtr) /* in: mtr */{ ut_ad(cursor->pos_state == BTR_PCUR_IS_POSITIONED); ut_ad(cursor->latch_mode != BTR_NO_LATCHES); cursor->old_stored = BTR_PCUR_OLD_NOT_STORED; if (btr_pcur_is_before_first_on_page(cursor, mtr)) { if (btr_pcur_is_before_first_in_tree(cursor, mtr)) { return(FALSE); } btr_pcur_move_backward_from_page(cursor, mtr); return(TRUE); } btr_pcur_move_to_prev_on_page(cursor, mtr); return(TRUE);}/******************************************************************If mode is PAGE_CUR_G or PAGE_CUR_GE, opens a persistent cursor on the firstuser record satisfying the search condition, in the case PAGE_CUR_L orPAGE_CUR_LE, on the last user record. If no such user record exists, thenin the first case sets the cursor after last in tree, and in the latter casebefore first in tree. The latching mode must be BTR_SEARCH_LEAF orBTR_MODIFY_LEAF. */voidbtr_pcur_open_on_user_rec(/*======================*/ dict_index_t* index, /* in: index */ dtuple_t* tuple, /* in: tuple on which search done */ ulint mode, /* in: PAGE_CUR_L, ... */ ulint latch_mode, /* in: BTR_SEARCH_LEAF or BTR_MODIFY_LEAF */ btr_pcur_t* cursor, /* in: memory buffer for persistent cursor */ mtr_t* mtr) /* in: mtr */{ btr_pcur_open(index, tuple, mode, latch_mode, cursor, mtr); if ((mode == PAGE_CUR_GE) || (mode == PAGE_CUR_G)) { if (btr_pcur_is_after_last_on_page(cursor, mtr)) { btr_pcur_move_to_next_user_rec(cursor, mtr); } } else { ut_ad((mode == PAGE_CUR_LE) || (mode == PAGE_CUR_L)); /* Not implemented yet */ ut_error; }}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -