74 lines
2.5 KiB
C++
74 lines
2.5 KiB
C++
/* Copyright (c) 2000, 2024, Oracle and/or its affiliates.
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License, version 2.0,
|
|
as published by the Free Software Foundation.
|
|
|
|
This program is designed to work with certain software (including
|
|
but not limited to OpenSSL) that is licensed under separate terms,
|
|
as designated in a particular file or component or in included license
|
|
documentation. The authors of MySQL hereby grant you an additional
|
|
permission to link the program and your derivative works with the
|
|
separately licensed software that they have either included with
|
|
the program or referenced in the documentation.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License, version 2.0, for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
|
|
|
|
#include "sql/range_optimizer/geometry_index_range_scan.h"
|
|
|
|
#include <stddef.h>
|
|
|
|
#include "my_base.h"
|
|
#include "my_dbug.h"
|
|
#include "sql/handler.h"
|
|
#include "sql/range_optimizer/range_optimizer.h"
|
|
|
|
/* Get next for geometrical indexes */
|
|
|
|
int GeometryIndexRangeScanIterator::Read() {
|
|
DBUG_TRACE;
|
|
|
|
for (;;) {
|
|
if (last_range) {
|
|
// Already read through key
|
|
int result = file->ha_index_next_same(
|
|
table()->record[0], last_range->min_key, last_range->min_length);
|
|
if (result == 0) {
|
|
if (m_examined_rows != nullptr) {
|
|
++*m_examined_rows;
|
|
}
|
|
return 0;
|
|
}
|
|
if (result != HA_ERR_END_OF_FILE) return HandleError(result);
|
|
}
|
|
|
|
const size_t count = ranges.size() - (cur_range - ranges.begin());
|
|
if (count == 0) {
|
|
/* Ranges have already been used up before. None is left for read. */
|
|
last_range = nullptr;
|
|
return -1;
|
|
}
|
|
last_range = *(cur_range++);
|
|
|
|
int result = file->ha_index_read_map(
|
|
table()->record[0], last_range->min_key, last_range->min_keypart_map,
|
|
last_range->rkey_func_flag);
|
|
if (result == 0) {
|
|
if (m_examined_rows != nullptr) {
|
|
++*m_examined_rows;
|
|
}
|
|
return 0;
|
|
}
|
|
if (int error_code = HandleError(result); error_code != -1) {
|
|
return error_code;
|
|
}
|
|
last_range = nullptr; // Not found, to next range
|
|
}
|
|
}
|