ExtensibleBitmap.h

/*
 * Copyright (c) 2008-2014, Pedigree Developers
 *
 * Please see the CONTRIB file in the root of the source tree for a full
 * list of contributors.
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */
 
#ifndef EXTENSIBLE_BITMAP_H
#define EXTENSIBLE_BITMAP_H
 
#include "pedigree/kernel/compiler.h"
#include "pedigree/kernel/processor/types.h"
 
class EXPORTED_PUBLIC ExtensibleBitmap {
  friend class CacheMemoryTestPeer;
 
 public:
  ExtensibleBitmap();
  ExtensibleBitmap(const ExtensibleBitmap& other);
  ~ExtensibleBitmap();
 
  ExtensibleBitmap& operator=(const ExtensibleBitmap& other);
 
  //
  // Public interface.
  //
  void set(size_t n);
  void clear(size_t n);
  bool test(size_t n) const;
  inline size_t getFirstSet() const {
    return m_nFirstSetBit;
  }
  inline size_t getFirstClear() {
    while (test(m_nFirstClearBit)) {
      m_nFirstClearBit++;
    }
    return m_nFirstClearBit;
  }
  inline size_t getLastSet() const {
    return m_nLastSetBit;
  }
  inline size_t getLastClear() const {
    return m_nLastClearBit;
  }
 
 private:
  uintptr_t m_StaticMap;
 
  uint8_t* m_pDynamicMap;
 
  size_t m_DynamicMapSize;
 
  size_t m_nMaxBit;
 
  size_t m_nFirstSetBit;
  size_t m_nFirstClearBit;
  size_t m_nLastSetBit;
  size_t m_nLastClearBit;
};
 
#endif