1
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
2
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
4
* Copyright (C) 2009 Sun Microsystems
8
* Padraig O'Sullivan <osullivan.padraig@gmail.com>
10
* This program is free software; you can redistribute it and/or modify
11
* it under the terms of the GNU General Public License as published by
12
* the Free Software Foundation; either version 2 of the License, or
13
* (at your option) any later version.
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 for more details.
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 St, Fifth Floor, Boston, MA 02110-1301 USA
28
* Implementation of helper methods for working with
29
* bitsets and methods for thread-safe bitsets.
32
#include "drizzled/sql_bitmap.h"
38
void ThreadSafeBitset::resetBit(uint32_t pos)
40
pthread_mutex_lock(&mutex);
42
pthread_mutex_unlock(&mutex);
45
uint32_t ThreadSafeBitset::setNextBit()
48
pthread_mutex_lock(&mutex);
49
if ((bit_found= getFirstBitPos(bitmap)) != MY_BIT_NONE)
50
bitmap.set(bit_found);
51
pthread_mutex_unlock(&mutex);
55
uint32_t getFirstBitPos(const bitset<MAX_FIELDS> &bitmap)
57
uint32_t first_bit= MY_BIT_NONE;
58
for (int idx= 0; idx < MAX_FIELDS; idx++)
60
if (!bitmap.test(idx))
69
bool isBitmapSubset(const bitset<MAX_FIELDS> *map1, const bitset<MAX_FIELDS> *map2)
71
bitset<MAX_FIELDS> tmp1= *map2;
72
bitset<MAX_FIELDS> tmp2= *map1 & tmp1.flip();
76
bool isBitmapOverlapping(const bitset<MAX_FIELDS> *map1, const bitset<MAX_FIELDS> *map2)
78
bitset<MAX_FIELDS> tmp= *map1 & *map2;