uchar *safe_hash_search(SAFE_HASH *hash, const uchar *key, uint length, uchar *def) { uchar *result; DBUG_ENTER("safe_hash_search"); mysql_rwlock_rdlock(&hash->mutex); result= my_hash_search(&hash->hash, key, length); mysql_rwlock_unlock(&hash->mutex); if (!result) result= def; else result= ((SAFE_HASH_ENTRY*) result)->data; DBUG_PRINT("exit",("data: 0x%lx", (long) result)); DBUG_RETURN(result); }
int mi_rsame(MI_INFO *info, uchar *record, int inx) { DBUG_ENTER("mi_rsame"); if (inx != -1 && ! mi_is_key_active(info->s->state.key_map, inx)) { set_my_errno(HA_ERR_WRONG_INDEX); DBUG_RETURN(HA_ERR_WRONG_INDEX); } if (info->lastpos == HA_OFFSET_ERROR || info->update & HA_STATE_DELETED) { set_my_errno(HA_ERR_KEY_NOT_FOUND); DBUG_RETURN(HA_ERR_KEY_NOT_FOUND); /* No current record */ } info->update&= (HA_STATE_CHANGED | HA_STATE_ROW_CHANGED); /* Read row from data file */ if (fast_mi_readinfo(info)) DBUG_RETURN(my_errno()); if (inx >= 0) { info->lastinx=inx; info->lastkey_length=_mi_make_key(info,(uint) inx,info->lastkey,record, info->lastpos); if (info->s->concurrent_insert) mysql_rwlock_rdlock(&info->s->key_root_lock[inx]); (void) _mi_search(info,info->s->keyinfo+inx,info->lastkey, USE_WHOLE_KEY, SEARCH_SAME, info->s->state.key_root[inx]); if (info->s->concurrent_insert) mysql_rwlock_unlock(&info->s->key_root_lock[inx]); } if (!(*info->read_record)(info,info->lastpos,record)) DBUG_RETURN(0); if (my_errno() == HA_ERR_RECORD_DELETED) set_my_errno(HA_ERR_KEY_NOT_FOUND); DBUG_RETURN(my_errno()); } /* mi_rsame */
int mi_rnext(MI_INFO *info, uchar *buf, int inx) { int error,changed; uint flag; uint update_mask= HA_STATE_NEXT_FOUND; DBUG_ENTER("mi_rnext"); if ((inx = _mi_check_index(info,inx)) < 0) DBUG_RETURN(my_errno); flag=SEARCH_BIGGER; /* Read next */ if (info->lastpos == HA_OFFSET_ERROR && info->update & HA_STATE_PREV_FOUND) flag=0; /* Read first */ if (fast_mi_readinfo(info)) DBUG_RETURN(my_errno); if (info->s->concurrent_insert) mysql_rwlock_rdlock(&info->s->key_root_lock[inx]); changed=_mi_test_if_changed(info); if (!flag) { switch(info->s->keyinfo[inx].key_alg){ #ifdef HAVE_RTREE_KEYS case HA_KEY_ALG_RTREE: error=rtree_get_first(info,inx,info->lastkey_length); break; #endif case HA_KEY_ALG_BTREE: default: error=_mi_search_first(info,info->s->keyinfo+inx, info->s->state.key_root[inx]); break; } /* "search first" failed. This means we have no pivot for "search next", or in other words MI_INFO::lastkey is likely uninitialized. Normally SQL layer would never request "search next" if "search first" failed. But HANDLER may do anything. As mi_rnext() without preceeding mi_rkey()/mi_rfirst() equals to mi_rfirst(), we must restore original state as if failing mi_rfirst() was not called. */ if (error) update_mask|= HA_STATE_PREV_FOUND; } else { switch (info->s->keyinfo[inx].key_alg) { #ifdef HAVE_RTREE_KEYS case HA_KEY_ALG_RTREE: /* Note that rtree doesn't support that the table may be changed since last call, so we do need to skip rows inserted by other threads like in btree */ error= rtree_get_next(info,inx,info->lastkey_length); break; #endif case HA_KEY_ALG_BTREE: default: if (!changed) error= _mi_search_next(info,info->s->keyinfo+inx,info->lastkey, info->lastkey_length,flag, info->s->state.key_root[inx]); else error= _mi_search(info,info->s->keyinfo+inx,info->lastkey, USE_WHOLE_KEY,flag, info->s->state.key_root[inx]); } } if (info->s->concurrent_insert) { if (!error) { while (info->lastpos >= info->state->data_file_length) { /* Skip rows inserted by other threads since we got a lock */ if ((error=_mi_search_next(info,info->s->keyinfo+inx, info->lastkey, info->lastkey_length, SEARCH_BIGGER, info->s->state.key_root[inx]))) break; } } mysql_rwlock_unlock(&info->s->key_root_lock[inx]); } /* Don't clear if database-changed */ info->update&= (HA_STATE_CHANGED | HA_STATE_ROW_CHANGED); info->update|= update_mask; if (error) { if (my_errno == HA_ERR_KEY_NOT_FOUND) my_errno=HA_ERR_END_OF_FILE; } else if (!buf) { DBUG_RETURN(info->lastpos==HA_OFFSET_ERROR ? my_errno : 0); } else if (!(*info->read_record)(info,info->lastpos,buf)) { info->update|= HA_STATE_AKTIV; /* Record is read */ DBUG_RETURN(0); } DBUG_PRINT("error",("Got error: %d, errno: %d",error, my_errno)); DBUG_RETURN(my_errno); } /* mi_rnext */
int mi_rnext_same(MI_INFO *info, uchar *buf) { int error; uint inx,not_used[2]; MI_KEYDEF *keyinfo; DBUG_ENTER("mi_rnext_same"); if ((int) (inx=info->lastinx) < 0 || info->lastpos == HA_OFFSET_ERROR) { set_my_errno(HA_ERR_WRONG_INDEX); DBUG_RETURN(HA_ERR_WRONG_INDEX); } keyinfo=info->s->keyinfo+inx; if (fast_mi_readinfo(info)) DBUG_RETURN(my_errno()); if (info->s->concurrent_insert) mysql_rwlock_rdlock(&info->s->key_root_lock[inx]); switch (keyinfo->key_alg) { case HA_KEY_ALG_RTREE: if ((error=rtree_find_next(info,inx, myisam_read_vec[info->last_key_func]))) { error=1; set_my_errno(HA_ERR_END_OF_FILE); info->lastpos= HA_OFFSET_ERROR; break; } break; case HA_KEY_ALG_BTREE: default: if (info->set_rnext_same_key) { /* First rnext_same and lastkey is filled in mi_rkey */ memcpy(info->rnext_same_key, info->lastkey, info->last_rkey_length); info->set_rnext_same_key= FALSE; } for (;;) { if ((error=_mi_search_next(info,keyinfo,info->lastkey, info->lastkey_length,SEARCH_BIGGER, info->s->state.key_root[inx]))) break; if (ha_key_cmp(keyinfo->seg, info->lastkey, info->rnext_same_key, info->last_rkey_length, SEARCH_FIND, not_used)) { error=1; set_my_errno(HA_ERR_END_OF_FILE); info->lastpos= HA_OFFSET_ERROR; break; } /* Skip rows that are inserted by other threads since we got a lock */ if (info->lastpos < info->state->data_file_length && (!info->index_cond_func || mi_check_index_cond(info, inx, buf))) break; } } if (info->s->concurrent_insert) mysql_rwlock_unlock(&info->s->key_root_lock[inx]); /* Don't clear if database-changed */ info->update&= (HA_STATE_CHANGED | HA_STATE_ROW_CHANGED); info->update|= HA_STATE_NEXT_FOUND; if (error) { if (my_errno() == HA_ERR_KEY_NOT_FOUND) set_my_errno(HA_ERR_END_OF_FILE); } else if (!buf) { DBUG_RETURN(info->lastpos==HA_OFFSET_ERROR ? my_errno() : 0); } else if (!(*info->read_record)(info,info->lastpos,buf)) { info->update|= HA_STATE_AKTIV; /* Record is read */ DBUG_RETURN(0); } DBUG_RETURN(my_errno()); } /* mi_rnext_same */
int mi_rprev(MI_INFO *info, uchar *buf, int inx) { int error,changed; register uint flag; MYISAM_SHARE *share=info->s; DBUG_ENTER("mi_rprev"); if ((inx = _mi_check_index(info,inx)) < 0) DBUG_RETURN(my_errno); flag=SEARCH_SMALLER; /* Read previous */ if (info->lastpos == HA_OFFSET_ERROR && info->update & HA_STATE_NEXT_FOUND) flag=0; /* Read last */ if (fast_mi_readinfo(info)) DBUG_RETURN(my_errno); changed=_mi_test_if_changed(info); if (share->concurrent_insert) mysql_rwlock_rdlock(&share->key_root_lock[inx]); if (!flag) error=_mi_search_last(info, share->keyinfo+inx, share->state.key_root[inx]); else if (!changed) error=_mi_search_next(info,share->keyinfo+inx,info->lastkey, info->lastkey_length,flag, share->state.key_root[inx]); else error=_mi_search(info,share->keyinfo+inx,info->lastkey, USE_WHOLE_KEY, flag, share->state.key_root[inx]); if (share->concurrent_insert) { if (!error) { while (info->lastpos >= info->state->data_file_length) { /* Skip rows that are inserted by other threads since we got a lock */ if ((error=_mi_search_next(info,share->keyinfo+inx,info->lastkey, info->lastkey_length, SEARCH_SMALLER, share->state.key_root[inx]))) break; } } mysql_rwlock_unlock(&share->key_root_lock[inx]); } info->update&= (HA_STATE_CHANGED | HA_STATE_ROW_CHANGED); info->update|= HA_STATE_PREV_FOUND; if (error) { if (my_errno == HA_ERR_KEY_NOT_FOUND) my_errno=HA_ERR_END_OF_FILE; } else if (!buf) { DBUG_RETURN(info->lastpos==HA_OFFSET_ERROR ? my_errno : 0); } else if (!(*info->read_record)(info,info->lastpos,buf)) { info->update|= HA_STATE_AKTIV; /* Record is read */ DBUG_RETURN(0); } DBUG_RETURN(my_errno); } /* mi_rprev */
int maria_rprev(MARIA_HA *info, uchar *buf, int inx) { int error,changed; register uint flag; MARIA_SHARE *share= info->s; MARIA_KEYDEF *keyinfo; ICP_RESULT icp_res= ICP_MATCH; DBUG_ENTER("maria_rprev"); if ((inx = _ma_check_index(info,inx)) < 0) DBUG_RETURN(my_errno); flag=SEARCH_SMALLER; /* Read previous */ if (info->cur_row.lastpos == HA_OFFSET_ERROR && info->update & HA_STATE_NEXT_FOUND) flag=0; /* Read last */ if (fast_ma_readinfo(info)) DBUG_RETURN(my_errno); keyinfo= share->keyinfo + inx; changed= _ma_test_if_changed(info); if (share->lock_key_trees) mysql_rwlock_rdlock(&keyinfo->root_lock); if (!flag) error= _ma_search_last(info, keyinfo, share->state.key_root[inx]); else if (!changed) error= _ma_search_next(info, &info->last_key, flag | info->last_key.flag, share->state.key_root[inx]); else error= _ma_search(info, &info->last_key, flag | info->last_key.flag, share->state.key_root[inx]); if (!error) { my_off_t cur_keypage= info->last_keypage; while (!(*share->row_is_visible)(info) || ((icp_res= ma_check_index_cond(info, inx, buf)) == ICP_NO_MATCH)) { /* If we are at the last (i.e. first?) key on the key page, allow writers to access the index. */ if (info->last_keypage != cur_keypage) { cur_keypage= info->last_keypage; if (ma_yield_and_check_if_killed(info, inx)) { error= 1; break; } } /* Skip rows that are inserted by other threads since we got a lock */ if ((error= _ma_search_next(info, &info->last_key, SEARCH_SMALLER, share->state.key_root[inx]))) break; } } if (share->lock_key_trees) mysql_rwlock_unlock(&keyinfo->root_lock); info->update&= (HA_STATE_CHANGED | HA_STATE_ROW_CHANGED); info->update|= HA_STATE_PREV_FOUND; if (error || icp_res != ICP_MATCH) { fast_ma_writeinfo(info); if (my_errno == HA_ERR_KEY_NOT_FOUND) my_errno= HA_ERR_END_OF_FILE; } else if (!buf) { fast_ma_writeinfo(info); DBUG_RETURN(info->cur_row.lastpos == HA_OFFSET_ERROR ? my_errno : 0); } else if (!(*info->read_record)(info, buf, info->cur_row.lastpos)) { info->update|= HA_STATE_AKTIV; /* Record is read */ DBUG_RETURN(0); } DBUG_RETURN(my_errno); } /* maria_rprev */
int maria_rnext(MARIA_HA *info, uchar *buf, int inx) { int error,changed; uint flag; MARIA_SHARE *share= info->s; MARIA_KEYDEF *keyinfo; ICP_RESULT icp_res= ICP_MATCH; uint update_mask= HA_STATE_NEXT_FOUND; DBUG_ENTER("maria_rnext"); if ((inx = _ma_check_index(info,inx)) < 0) DBUG_RETURN(my_errno); flag=SEARCH_BIGGER; /* Read next */ if (info->cur_row.lastpos == HA_OFFSET_ERROR && info->update & HA_STATE_PREV_FOUND) flag=0; /* Read first */ if (fast_ma_readinfo(info)) DBUG_RETURN(my_errno); keyinfo= share->keyinfo + inx; if (share->lock_key_trees) mysql_rwlock_rdlock(&keyinfo->root_lock); changed= _ma_test_if_changed(info); if (!flag) { switch (keyinfo->key_alg){ #ifdef HAVE_RTREE_KEYS case HA_KEY_ALG_RTREE: error=maria_rtree_get_first(info, inx, info->last_key.data_length + info->last_key.ref_length); break; #endif case HA_KEY_ALG_BTREE: default: error= _ma_search_first(info, keyinfo, share->state.key_root[inx]); break; } /* "search first" failed. This means we have no pivot for "search next", or in other words MI_INFO::lastkey is likely uninitialized. Normally SQL layer would never request "search next" if "search first" failed. But HANDLER may do anything. As mi_rnext() without preceding mi_rkey()/mi_rfirst() equals to mi_rfirst(), we must restore original state as if failing mi_rfirst() was not called. */ if (error) update_mask|= HA_STATE_PREV_FOUND; } else { switch (keyinfo->key_alg) { #ifdef HAVE_RTREE_KEYS case HA_KEY_ALG_RTREE: /* Note that rtree doesn't support that the table may be changed since last call, so we do need to skip rows inserted by other threads like in btree */ error= maria_rtree_get_next(info, inx, info->last_key.data_length + info->last_key.ref_length); break; #endif case HA_KEY_ALG_BTREE: default: if (!changed) error= _ma_search_next(info, &info->last_key, flag | info->last_key.flag, share->state.key_root[inx]); else error= _ma_search(info, &info->last_key, flag | info->last_key.flag, share->state.key_root[inx]); } } if (!error) { while (!(*share->row_is_visible)(info) || ((icp_res= ma_check_index_cond(info, inx, buf)) == ICP_NO_MATCH)) { /* If we are at the last key on the key page, allow writers to access the index. */ if (info->int_keypos >= info->int_maxpos && ma_yield_and_check_if_killed(info, inx)) { /* my_errno is set by ma_yield_and_check_if_killed() */ error= 1; break; } /* Skip rows inserted by other threads since we got a lock */ if ((error= _ma_search_next(info, &info->last_key, SEARCH_BIGGER, share->state.key_root[inx]))) break; } } if (share->lock_key_trees) mysql_rwlock_unlock(&keyinfo->root_lock); /* Don't clear if database-changed */ info->update&= (HA_STATE_CHANGED | HA_STATE_ROW_CHANGED); info->update|= update_mask; if (error || icp_res != ICP_MATCH) { fast_ma_writeinfo(info); if (my_errno == HA_ERR_KEY_NOT_FOUND) my_errno= HA_ERR_END_OF_FILE; } else if (!buf) { fast_ma_writeinfo(info); DBUG_RETURN(info->cur_row.lastpos == HA_OFFSET_ERROR ? my_errno : 0); } else if (!(*info->read_record)(info, buf, info->cur_row.lastpos)) { info->update|= HA_STATE_AKTIV; /* Record is read */ DBUG_RETURN(0); } DBUG_PRINT("error",("Got error: %d, errno: %d",error, my_errno)); DBUG_RETURN(my_errno); } /* maria_rnext */