1 /* Copyright (c) 2002, 2004-2006 MySQL AB
2    Use is subject to license terms
3 
4    This program is free software; you can redistribute it and/or modify
5    it under the terms of the GNU General Public License, version 2.0,
6    as published by the Free Software Foundation.
7 
8    This program is also distributed with certain software (including
9    but not limited to OpenSSL) that is licensed under separate terms,
10    as designated in a particular file or component or in included license
11    documentation.  The authors of MySQL hereby grant you an additional
12    permission to link the program and your derivative works with the
13    separately licensed software that they have included with MySQL.
14 
15    This program is distributed in the hope that it will be useful,
16    but WITHOUT ANY WARRANTY; without even the implied warranty of
17    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
18    GNU General Public License, version 2.0, for more details.
19 
20    You should have received a copy of the GNU General Public License
21    along with this program; if not, write to the Free Software
22    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA */
23 
24 #ifndef _rt_index_h
25 #define _rt_index_h
26 
27 #ifdef HAVE_RTREE_KEYS
28 
29 #define rt_PAGE_FIRST_KEY(page, nod_flag) (page + 2 + nod_flag)
30 #define rt_PAGE_NEXT_KEY(key, key_length, nod_flag) (key + key_length + \
31               (nod_flag ? nod_flag : info->s->base.rec_reflength))
32 #define rt_PAGE_END(page) (page + mi_getint(page))
33 
34 #define rt_PAGE_MIN_SIZE(block_length) ((uint)(block_length) / 3)
35 
36 int rtree_insert(MI_INFO *info, uint keynr, uchar *key, uint key_length);
37 int rtree_delete(MI_INFO *info, uint keynr, uchar *key, uint key_length);
38 
39 int rtree_find_first(MI_INFO *info, uint keynr, uchar *key, uint key_length,
40                     uint search_flag);
41 int rtree_find_next(MI_INFO *info, uint keynr, uint search_flag);
42 
43 int rtree_get_first(MI_INFO *info, uint keynr, uint key_length);
44 int rtree_get_next(MI_INFO *info, uint keynr, uint key_length);
45 
46 ha_rows rtree_estimate(MI_INFO *info, uint keynr, uchar *key,
47                        uint key_length, uint flag);
48 
49 int rtree_split_page(MI_INFO *info, MI_KEYDEF *keyinfo, uchar *page, uchar *key,
50                     uint key_length, my_off_t *new_page_offs);
51 
52 #endif /*HAVE_RTREE_KEYS*/
53 #endif /* _rt_index_h */
54