GLAST/LAT >
DAQ and FSW >
FSW >
Doxygen Index >
QSE / V1-6-4
Constituent: qseprint     Tag: sun-gcc
Interface Data Structures File List Data Fields Globals
QSE_map.xx-xxx-xxx.h File Reference
QSE_map, generic implementation. More...
#include <strings.h>
Include dependency graph for QSE_map.xx-xxx-xxx.h:
This graph shows which files directly or indirectly include this file:
|
Functions |
static __inline int | QSE_mapScanf (QSE_map map) |
| Finds the first set bit (LSB = bit 0) in the specified map.
|
static __inline int | QSE_mapScanr (QSE_map map) |
| Finds the first set bit (LSB = bit 0) in the specified map The scan is a reverse scan, from left (MSB) to right (LSB).
|
static __inline int | QSE_mapScanF (QSE_map map) |
| Finds the first set bit (MSB = bit 0) in the specified map.
|
static __inline int | QSE_mapScanR (QSE_map map) |
| Finds the first set bit (MSB = bit 0) in the specified map The scan is a reverse scan, from left (MSB) to right (LSB).
|
Detailed Description
QSE_map, generic implementation.
- Author:
- JJRussell - russell@slac.stanford.edu
CVS $Id: QSE_map.xx-xxx-xxx.h,v 1.2 2006/02/22 01:24:42 russell Exp $
Function Documentation
static __inline int QSE_mapScanF |
( |
QSE_map |
map |
) |
[static] |
|
|
Finds the first set bit (MSB = bit 0) in the specified map.
- Returns:
- Returns the bit number of the first set bit
- Overview
- This routine scans a 32 bit longword from right (LSB) to left (MSB) looking for the first bit set. If it finds a bit it returns a value in the range 0-31. The routine is not protected against 0 as an input and the result is undefined.
- Generic
- The generic implementation is a straighforward piece of C code, that scans LSB to MSB for the first set bit.
|
static __inline int QSE_mapScanf |
( |
QSE_map |
map |
) |
[static] |
|
|
Finds the first set bit (LSB = bit 0) in the specified map.
- Returns:
- Returns the bit number of the first set bit
- Overview
- This routine scans a 32 bit longword from right (LSB) to left (MSB) looking for the first bit set. If it finds a bit it returns a value in the range 0-31. The routine is not protected against 0 as an input and the result is undefined.
- Generic
- The generic implementation is a straighforward piece of C code, that scans LSB to MSB for the first set bit.
|
static __inline int QSE_mapScanR |
( |
QSE_map |
map |
) |
[static] |
|
|
Finds the first set bit (MSB = bit 0) in the specified map The scan is a reverse scan, from left (MSB) to right (LSB).
- Returns:
- Returns the bit number of the first set bit
- Overview
- This routine scans a 32 bit longword from left (MSB) to right (MSB) looking for the first bit set. If it finds a bit it returns a value in the range 0-31. The routine is not protected against 0 as an input and the result is undefined.
- Generic
- The generic implementation is a straighforward piece of C code, that scans LSB to MSB for the first set bit.
|
static __inline int QSE_mapScanr |
( |
QSE_map |
map |
) |
[static] |
|
|
Finds the first set bit (LSB = bit 0) in the specified map The scan is a reverse scan, from left (MSB) to right (LSB).
- Returns:
- Returns the bit number of the first set bit
- Overview
- This routine scans a 32 bit longword from left (MSB) to right (MSB) looking for the first bit set. If it finds a bit it returns a value in the range 0-31. The routine is not protected against 0 as an input and the result is undefined.
- Generic
- The generic implementation is a straighforward piece of C code, that scans LSB to MSB for the first set bit.
|
Generated on Tue Jul 17 04:26:26 2007 by
1.4.4