summaryrefslogtreecommitdiff
path: root/include/my_bitmap.h
diff options
context:
space:
mode:
authorMonty <monty@mariadb.org>2017-07-05 18:20:06 +0300
committerMonty <monty@mariadb.org>2017-12-03 13:58:34 +0200
commit8eeb689e9fc57afe19a8dbff354b5f9f167867a9 (patch)
tree91a28b5f61e402ba64be1283c1d84c98a0a24f0f /include/my_bitmap.h
parentd5268a610af093e1bf7c0fc2f0d1aabd040766ad (diff)
downloadmariadb-git-8eeb689e9fc57afe19a8dbff354b5f9f167867a9.tar.gz
Adding multi_range_read support to partitions
Other things: - Cleanup of allocated bitmaps done in open(), which simplifies init_partition_bitmaps() - Add needed defines in ha_spider.cc to enable new spider code - Fixed some DBUG_PRINT() to be consistent with normal code - Removed end space - The changes in test cases partition_innodb, partition_range, partition_pruning etc are becasue partitions can now more exactly calculate the number of rows in a range. Contains spider patches: 014,015,023,033,035,037,040,042,044,045,049,050,051,053,059
Diffstat (limited to 'include/my_bitmap.h')
-rw-r--r--include/my_bitmap.h2
1 files changed, 2 insertions, 0 deletions
diff --git a/include/my_bitmap.h b/include/my_bitmap.h
index 3e242280be4..14197955f9a 100644
--- a/include/my_bitmap.h
+++ b/include/my_bitmap.h
@@ -45,6 +45,8 @@ extern "C" {
/* compatibility functions */
#define bitmap_init(A,B,C,D) my_bitmap_init(A,B,C,D)
#define bitmap_free(A) my_bitmap_free(A)
+/* Reset memory. Faster then doing a full bzero */
+#define my_bitmap_clear(A) ((A)->bitmap= 0)
extern void create_last_word_mask(MY_BITMAP *map);
extern my_bool my_bitmap_init(MY_BITMAP *map, my_bitmap_map *buf, uint n_bits,