summaryrefslogtreecommitdiff
path: root/mysys/my_bit.c
diff options
context:
space:
mode:
authorsergefp@mysql.com <>2004-05-13 01:38:40 +0400
committersergefp@mysql.com <>2004-05-13 01:38:40 +0400
commita46d7542c94eb5848231324a043ddccffbc552b0 (patch)
tree34118ff1da06b90ade9507174ddccf92c228286a /mysys/my_bit.c
parentb2efad935b38bfcf8177837082e3946c60ba8328 (diff)
downloadmariadb-git-a46d7542c94eb5848231324a043ddccffbc552b0.tar.gz
This is first cset for WL#1394 "Optimize index merge when all involved index ranges include only values with equal keys"
The main idea is to exploit the fact that key scans for "key=const" return ordered sequences of rowids.
Diffstat (limited to 'mysys/my_bit.c')
-rw-r--r--mysys/my_bit.c5
1 files changed, 5 insertions, 0 deletions
diff --git a/mysys/my_bit.c b/mysys/my_bit.c
index 55dd72f5f76..01c9b5ea68d 100644
--- a/mysys/my_bit.c
+++ b/mysys/my_bit.c
@@ -71,3 +71,8 @@ uint my_count_bits(ulonglong v)
#endif
}
+uint my_count_bits_ushort(ushort v)
+{
+ return nbits[v];
+}
+