~drizzle-trunk/drizzle/development

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/* -*- mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-
 *  vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
 *
 *  Copyright (C) 2008 Sun Microsystems
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; version 2 of the License.
 *
 *  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 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
 */

#ifndef _SQL_BITMAP_H_
#define _SQL_BITMAP_H_

#include <drizzled/global.h>
#include <drizzled/definitions.h>
#include <drizzled/util/test.h>

#include <bitset>

#define BIT_NONE (~(uint32_t) 0)

typedef uint64_t table_map;          /* Used for table bits in join */
typedef uint32_t nesting_map;  /* Used for flags of nesting constructs */

/*
  Used to identify NESTED_JOIN structures within a join (applicable only to
  structures that have not been simplified away and embed more the one
  element)
*/
typedef uint64_t nested_join_map; /* Needed by sql_select.h and table.h */

/*
 * Finds the first bit that is not set and sets
 * it.
 *
 * @param the bitmap to work with
 */
uint32_t setNextBit(std::bitset<MAX_FIELDS> &bitmap);

/*
 * Returns the position of the first bit in the
 * given bitmap which is not set. If every bit is set
 * in the bitmap, return BIT_NONE.
 *
 * @param the bitmap to work with
 */
uint32_t getFirstBitPos(const std::bitset<MAX_FIELDS> &bitmap);

/*
 * Returns true if there is any overlapping bits between
 * the 2 given bitmaps.
 *
 * @param the first bitmap to work with
 * @param the second bitmap to work with
 */
bool isBitmapOverlapping(const std::bitset<MAX_FIELDS> &map1, const std::bitset<MAX_FIELDS> &map2);

#endif /* _SQL_BITMAP_H_ */