• Main Page
  • Classes
  • Files
  • File List

/Users/yzchen/ns/ns-allinone-2.33/ns-2.33/routealgo/rbitmap.h

00001 
00002 /*
00003  * rbitmap.h
00004  * Copyright (C) 2000 by the University of Southern California
00005  * $Id: rbitmap.h,v 1.4 2005/08/25 18:58:11 johnh Exp $
00006  *
00007  * This program is free software; you can redistribute it and/or
00008  * modify it under the terms of the GNU General Public License,
00009  * version 2, as published by the Free Software Foundation.
00010  *
00011  * This program is distributed in the hope that it will be useful,
00012  * but WITHOUT ANY WARRANTY; without even the implied warranty of
00013  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
00014  * GNU General Public License for more details.
00015  *
00016  * You should have received a copy of the GNU General Public License along
00017  * with this program; if not, write to the Free Software Foundation, Inc.,
00018  * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
00019  *
00020  *
00021  * The copyright of this module includes the following
00022  * linking-with-specific-other-licenses addition:
00023  *
00024  * In addition, as a special exception, the copyright holders of
00025  * this module give you permission to combine (via static or
00026  * dynamic linking) this module with free software programs or
00027  * libraries that are released under the GNU LGPL and with code
00028  * included in the standard release of ns-2 under the Apache 2.0
00029  * license or under otherwise-compatible licenses with advertising
00030  * requirements (or modified versions of such code, with unchanged
00031  * license).  You may copy and distribute such a system following the
00032  * terms of the GNU GPL for this module and the licenses of the
00033  * other code concerned, provided that you include the source code of
00034  * that other code when and as the GNU GPL requires distribution of
00035  * source code.
00036  *
00037  * Note that people who make modified versions of this module
00038  * are not obligated to grant this special exception for their
00039  * modified versions; it is their choice whether to do so.  The GNU
00040  * General Public License gives permission to release a modified
00041  * version without this exception; this exception also makes it
00042  * possible to release a modified version which carries forward this
00043  * exception.
00044  *
00045  */
00046 
00047 /*
00048  * Define a bitmap object
00049  * contributed to ns
00050  * George Riley, Georgia Tech, Winter 2000
00051  */
00052 
00053 // Creates a bitmap object.  The 'entries' can be more than one bit,
00054 // but default to one bit.  Bits per entry can't be more than 32.
00055 // Entries DO NOT span words, for ease of coding
00056 
00057 #ifndef __BITMAP_H__
00058 #define __BITMAP_H__
00059 
00060 #include <iostream>
00061 #include <sys/types.h>
00062 
00063 const unsigned  int BITS_ULONG = 32;
00064 
00065 class BitMap {
00066   public :
00067     BitMap      ( );
00068     BitMap      ( u_long Size, u_long BitsPerEntry = 1);
00069     ~BitMap     () {if (m_Words > 1) delete [] m_pM; }
00070     void   Set  ( u_long Which, u_long Value = 1);
00071     void   Clear( u_long Which);
00072     u_long Get  ( u_long Which);  // Return the specified entry
00073     size_t Size ( void );         // Return storage used
00074     void   Log  ( ostream& os);   // Log to ostream
00075     void DBPrint();
00076     static u_long FindBPE( u_long );
00077     static size_t EstimateSize( u_long Size, u_long BitsPerEntry);
00078     //    friend ostream& operator<<(ostream&, const BitMap* ); // Output a bitmap
00079   private :
00080     u_long* GetWordAddress(u_long Which); // Get a pointer to the word needed
00081     u_long  GetBitMask(u_long Which);     // Get a bit mask to the needed bits
00082     short   GetShiftCount( u_long Which); // Get a shift count for position
00083     void    Validate(u_long Which);       // Validate which not too large
00084     u_long  m_Size; // how many entries
00085     u_long  m_BPE;  // Bits per entry
00086     u_long  m_Words;// Number of words needed for bitmap
00087     short   m_EPW;  // Entries per word
00088     u_long* m_pM; // Pointer to the actual map (or the data if < 32 bits)
00089 };
00090 
00091 #endif

Generated on Tue Aug 10 2010 16:16:08 for ns-2.33 by  doxygen 1.7.1