- Now that we don't need it anymore, blast away
ompi/class/ompi_bitmap.[ch] -- may always be restored from svn again... This commit was SVN r20710.
Этот коммит содержится в:
Rainer Keller
@ -1,249 +0,0 @@
|
|||||||
/*
|
|
||||||
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
|
|
||||||
* University Research and Technology
|
|
||||||
* Corporation. All rights reserved.
|
|
||||||
* Copyright (c) 2004-2005 The University of Tennessee and The University
|
|
||||||
* of Tennessee Research Foundation. All rights
|
|
||||||
* reserved.
|
|
||||||
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
|
|
||||||
* University of Stuttgart. All rights reserved.
|
|
||||||
* Copyright (c) 2004-2005 The Regents of the University of California.
|
|
||||||
* All rights reserved.
|
|
||||||
* Copyright (c) 2007 Cisco Systems, Inc. All rights reserved.
|
|
||||||
* $COPYRIGHT$
|
|
||||||
*
|
|
||||||
* Additional copyrights may follow
|
|
||||||
*
|
|
||||||
* $HEADER$
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include "ompi_config.h"
|
|
||||||
|
|
||||||
#include <stdio.h>
|
|
||||||
|
|
||||||
#include "ompi/constants.h"
|
|
||||||
#include "ompi/class/ompi_bitmap.h"
|
|
||||||
|
|
||||||
|
|
||||||
#define SIZE_OF_CHAR ((int) (sizeof(char) * 8))
|
|
||||||
|
|
||||||
static void ompi_bitmap_construct(ompi_bitmap_t *bm);
|
|
||||||
static void ompi_bitmap_destruct(ompi_bitmap_t *bm);
|
|
||||||
|
|
||||||
OBJ_CLASS_INSTANCE(ompi_bitmap_t, opal_object_t,
|
|
||||||
ompi_bitmap_construct, ompi_bitmap_destruct);
|
|
||||||
|
|
||||||
|
|
||||||
static void
|
|
||||||
ompi_bitmap_construct(ompi_bitmap_t *bm)
|
|
||||||
{
|
|
||||||
bm->array_size = 0;
|
|
||||||
bm->bitmap = NULL;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
static void
|
|
||||||
ompi_bitmap_destruct(ompi_bitmap_t *bm)
|
|
||||||
{
|
|
||||||
if (NULL != bm->bitmap) {
|
|
||||||
free(bm->bitmap);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
int
|
|
||||||
ompi_bitmap_init(ompi_bitmap_t *bm, int size)
|
|
||||||
{
|
|
||||||
int actual_size;
|
|
||||||
|
|
||||||
if ((size <= 0) || (size > OMPI_FORTRAN_HANDLE_MAX) || (NULL == bm)) {
|
|
||||||
return OMPI_ERR_BAD_PARAM;
|
|
||||||
}
|
|
||||||
|
|
||||||
actual_size = size / SIZE_OF_CHAR;
|
|
||||||
actual_size += (size % SIZE_OF_CHAR == 0) ? 0 : 1;
|
|
||||||
bm->array_size = actual_size;
|
|
||||||
bm->bitmap = (unsigned char *) malloc(actual_size);
|
|
||||||
if (NULL == bm->bitmap) {
|
|
||||||
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
||||||
}
|
|
||||||
|
|
||||||
ompi_bitmap_clear_all_bits(bm);
|
|
||||||
return OMPI_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
int
|
|
||||||
ompi_bitmap_set_bit(ompi_bitmap_t *bm, int bit)
|
|
||||||
{
|
|
||||||
int index, offset, new_size, i;
|
|
||||||
size_t new_size_large;
|
|
||||||
|
|
||||||
if ((bit < 0) || (bit > OMPI_FORTRAN_HANDLE_MAX) || (NULL == bm)) {
|
|
||||||
return OMPI_ERR_BAD_PARAM;
|
|
||||||
}
|
|
||||||
|
|
||||||
index = bit / SIZE_OF_CHAR;
|
|
||||||
offset = bit % SIZE_OF_CHAR;
|
|
||||||
|
|
||||||
if (index >= bm->array_size) {
|
|
||||||
|
|
||||||
/* If we're already full, return "No vacancy!" */
|
|
||||||
|
|
||||||
if (bm->array_size >= OMPI_FORTRAN_HANDLE_MAX) {
|
|
||||||
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* We need to allocate more space for the bitmap, since we are
|
|
||||||
out of range. We don't throw any error here, because this is
|
|
||||||
valid and we simply expand the bitmap */
|
|
||||||
|
|
||||||
new_size_large = (index / bm->array_size + 1 ) * bm->array_size;
|
|
||||||
|
|
||||||
/* Check to be sure that we still have less than
|
|
||||||
OMPI_FORTRAN_HANDLE_MAX bits */
|
|
||||||
|
|
||||||
if (new_size_large > OMPI_FORTRAN_HANDLE_MAX) {
|
|
||||||
new_size_large = OMPI_FORTRAN_HANDLE_MAX;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Note that new_size is guaranteed to be <=
|
|
||||||
OMPI_FORTRAN_HANDLE_MAX, which is guaranteed to fit in a
|
|
||||||
[signed] int. */
|
|
||||||
|
|
||||||
new_size = (int) new_size_large;
|
|
||||||
|
|
||||||
/* New size is just a multiple of the original size to fit in
|
|
||||||
the index. */
|
|
||||||
|
|
||||||
bm->bitmap = (unsigned char *) realloc(bm->bitmap, (int) new_size);
|
|
||||||
if (NULL == bm->bitmap) {
|
|
||||||
return OMPI_ERR_OUT_OF_RESOURCE;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* zero out the new elements */
|
|
||||||
for (i = bm->array_size; i < new_size; ++i) {
|
|
||||||
bm->bitmap[i] = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Update the array_size */
|
|
||||||
bm->array_size = new_size;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Now set the bit */
|
|
||||||
bm->bitmap[index] |= (1 << offset);
|
|
||||||
|
|
||||||
return OMPI_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
int
|
|
||||||
ompi_bitmap_clear_bit(ompi_bitmap_t *bm, int bit)
|
|
||||||
{
|
|
||||||
int index, offset;
|
|
||||||
|
|
||||||
if ((bit < 0) || NULL == bm || (bit >= (bm->array_size * SIZE_OF_CHAR))) {
|
|
||||||
return OMPI_ERR_BAD_PARAM;
|
|
||||||
}
|
|
||||||
|
|
||||||
index = bit / SIZE_OF_CHAR;
|
|
||||||
offset = bit % SIZE_OF_CHAR;
|
|
||||||
|
|
||||||
if (index >= bm->array_size) {
|
|
||||||
return OMPI_ERR_BAD_PARAM;
|
|
||||||
}
|
|
||||||
|
|
||||||
bm->bitmap[index] &= ~(1 << offset);
|
|
||||||
return OMPI_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
int
|
|
||||||
ompi_bitmap_is_set_bit(ompi_bitmap_t *bm, int bit)
|
|
||||||
{
|
|
||||||
int index, offset;
|
|
||||||
|
|
||||||
if ((bit < 0) || NULL == bm || (bit >= (bm->array_size * SIZE_OF_CHAR))) {
|
|
||||||
return OMPI_ERR_BAD_PARAM;
|
|
||||||
}
|
|
||||||
|
|
||||||
index = bit / SIZE_OF_CHAR;
|
|
||||||
offset = bit % SIZE_OF_CHAR;
|
|
||||||
|
|
||||||
if (index >= bm->array_size) {
|
|
||||||
return OMPI_ERR_BAD_PARAM;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (0 != (bm->bitmap[index] & (1 << offset))) {
|
|
||||||
return (int) true;
|
|
||||||
}
|
|
||||||
|
|
||||||
return (int) false;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
int
|
|
||||||
ompi_bitmap_clear_all_bits(ompi_bitmap_t *bm)
|
|
||||||
{
|
|
||||||
if (NULL == bm) {
|
|
||||||
return OMPI_ERR_BAD_PARAM;
|
|
||||||
}
|
|
||||||
|
|
||||||
memset(bm->bitmap, 0, bm->array_size);
|
|
||||||
return OMPI_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
int
|
|
||||||
ompi_bitmap_set_all_bits(ompi_bitmap_t *bm)
|
|
||||||
{
|
|
||||||
int i;
|
|
||||||
|
|
||||||
if (NULL == bm) {
|
|
||||||
return OMPI_ERR_BAD_PARAM;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (i = 0; i < bm->array_size; ++i) {
|
|
||||||
bm->bitmap[i] = ~((char) 0);
|
|
||||||
}
|
|
||||||
return OMPI_SUCCESS;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
int
|
|
||||||
ompi_bitmap_find_and_set_first_unset_bit(ompi_bitmap_t *bm, int *position)
|
|
||||||
{
|
|
||||||
int i = 0;
|
|
||||||
unsigned char temp;
|
|
||||||
unsigned char all_ones = 0xff;
|
|
||||||
|
|
||||||
if (NULL == bm) {
|
|
||||||
return OMPI_ERR_BAD_PARAM;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Neglect all which don't have an unset bit */
|
|
||||||
*position = 0;
|
|
||||||
while((i < bm->array_size) && (bm->bitmap[i] == all_ones)) {
|
|
||||||
++i;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (i == bm->array_size) {
|
|
||||||
/* increase the bitmap size then */
|
|
||||||
*position = bm->array_size * SIZE_OF_CHAR;
|
|
||||||
return ompi_bitmap_set_bit(bm, *position);
|
|
||||||
}
|
|
||||||
|
|
||||||
/* This one has an unset bit, find its bit number */
|
|
||||||
|
|
||||||
temp = bm->bitmap[i];
|
|
||||||
while (temp & 0x1) {
|
|
||||||
++(*position);
|
|
||||||
temp >>= 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
/* Now set the bit number */
|
|
||||||
bm->bitmap[i] |= (bm->bitmap[i] + 1);
|
|
||||||
|
|
||||||
(*position) += i * SIZE_OF_CHAR;
|
|
||||||
return OMPI_SUCCESS;
|
|
||||||
}
|
|
||||||
@ -1,161 +0,0 @@
|
|||||||
/* -*- Mode: C; c-basic-offset:4 ; -*- */
|
|
||||||
/*
|
|
||||||
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
|
|
||||||
* University Research and Technology
|
|
||||||
* Corporation. All rights reserved.
|
|
||||||
* Copyright (c) 2004-2007 The University of Tennessee and The University
|
|
||||||
* of Tennessee Research Foundation. All rights
|
|
||||||
* reserved.
|
|
||||||
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
|
|
||||||
* University of Stuttgart. All rights reserved.
|
|
||||||
* Copyright (c) 2004-2005 The Regents of the University of California.
|
|
||||||
* All rights reserved.
|
|
||||||
* Copyright (c) 2007 Cisco Systems, Inc. All rights reserved.
|
|
||||||
* $COPYRIGHT$
|
|
||||||
*
|
|
||||||
* Additional copyrights may follow
|
|
||||||
*
|
|
||||||
* $HEADER$
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
/** @file
|
|
||||||
*
|
|
||||||
* A bitmap implementation. The bits start off with 0, so this bitmap
|
|
||||||
* has bits numbered as bit 0, bit 1, bit 2 and so on. This bitmap
|
|
||||||
* has auto-expansion capabilities, that is once the size is set
|
|
||||||
* during init, it can be automatically expanded by setting the bit
|
|
||||||
* beyond the current size. But note, this is allowed just when the
|
|
||||||
* bit is set -- so the valid functions are set_bit and
|
|
||||||
* find_and_set_bit. Other functions like clear, if passed a bit
|
|
||||||
* outside the initialized range will result in an error.
|
|
||||||
*
|
|
||||||
* Since these bitmaps are only used to track fortran handles (which
|
|
||||||
* MPI defines to be int's), it is assumed that we can never have more
|
|
||||||
* than OMPI_FORTRAN_HANDLE_MAX (which is min(INT_MAX, fortran
|
|
||||||
* INTEGER max)).
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
|
|
||||||
#ifndef OMPI_BITMAP_H
|
|
||||||
#define OMPI_BITMAP_H
|
|
||||||
|
|
||||||
#include "ompi_config.h"
|
|
||||||
|
|
||||||
#include <string.h>
|
|
||||||
|
|
||||||
#include "ompi/types.h"
|
|
||||||
#include "opal/class/opal_object.h"
|
|
||||||
|
|
||||||
#if defined(c_plusplus) || defined(__cplusplus)
|
|
||||||
extern "C" {
|
|
||||||
#endif
|
|
||||||
struct ompi_bitmap_t {
|
|
||||||
opal_object_t super; /**< Subclass of opal_object_t */
|
|
||||||
unsigned char *bitmap; /**< The actual bitmap array of characters */
|
|
||||||
int array_size; /**< The actual array size that maintains the bitmap */
|
|
||||||
};
|
|
||||||
|
|
||||||
typedef struct ompi_bitmap_t ompi_bitmap_t;
|
|
||||||
|
|
||||||
OMPI_DECLSPEC OBJ_CLASS_DECLARATION(ompi_bitmap_t);
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Initializes the bitmap and sets its size. This must be called
|
|
||||||
* before the bitmap can be actually used
|
|
||||||
*
|
|
||||||
* @param bitmap The input bitmap (IN)
|
|
||||||
* @param size The initial size of the bitmap in terms of bits (IN)
|
|
||||||
* @return OMPI error code or success
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
OMPI_DECLSPEC int ompi_bitmap_init (ompi_bitmap_t *bm, int size);
|
|
||||||
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Set a bit of the bitmap. If the bit asked for is beyond the current
|
|
||||||
* size of the bitmap, then the bitmap is extended to accomodate the
|
|
||||||
* bit
|
|
||||||
*
|
|
||||||
* @param bitmap The input bitmap (IN)
|
|
||||||
* @param bit The bit which is to be set (IN)
|
|
||||||
* @return OMPI error code or success
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
OMPI_DECLSPEC int ompi_bitmap_set_bit(ompi_bitmap_t *bm, int bit);
|
|
||||||
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Clear/unset a bit of the bitmap. If the bit is beyond the current
|
|
||||||
* size of the bitmap, an error is returned
|
|
||||||
*
|
|
||||||
* @param bitmap The input bitmap (IN)
|
|
||||||
* @param bit The bit which is to be cleared (IN)
|
|
||||||
* @return OMPI error code if the bit is out of range, else success
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
OMPI_DECLSPEC int ompi_bitmap_clear_bit(ompi_bitmap_t *bm, int bit);
|
|
||||||
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Find out if a bit is set in the bitmap
|
|
||||||
*
|
|
||||||
* @param bitmap The input bitmap (IN)
|
|
||||||
* @param bit The bit which is to be checked (IN)
|
|
||||||
* @return OMPI error code if the bit is out of range
|
|
||||||
* 1 if the bit is set
|
|
||||||
* 0 if the bit is not set
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
OMPI_DECLSPEC int ompi_bitmap_is_set_bit(ompi_bitmap_t *bm, int bit);
|
|
||||||
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Find the first clear bit in the bitmap and set it
|
|
||||||
*
|
|
||||||
* @param bitmap The input bitmap (IN)
|
|
||||||
* @param position Position of the first clear bit (OUT)
|
|
||||||
|
|
||||||
* @return err OMPI_SUCCESS on success
|
|
||||||
*/
|
|
||||||
OMPI_DECLSPEC int ompi_bitmap_find_and_set_first_unset_bit(ompi_bitmap_t *bm,
|
|
||||||
int *position);
|
|
||||||
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Clear all bits in the bitmap
|
|
||||||
*
|
|
||||||
* @param bitmap The input bitmap (IN)
|
|
||||||
* @return OMPI error code if bm is NULL
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
OMPI_DECLSPEC int ompi_bitmap_clear_all_bits(ompi_bitmap_t *bm);
|
|
||||||
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Set all bits in the bitmap
|
|
||||||
* @param bitmap The input bitmap (IN)
|
|
||||||
* @return OMPI error code if bm is NULL
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
OMPI_DECLSPEC int ompi_bitmap_set_all_bits(ompi_bitmap_t *bm);
|
|
||||||
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Gives the current size (number of bits) in the bitmap. This is the
|
|
||||||
* legal (accessible) number of bits
|
|
||||||
*
|
|
||||||
* @param bitmap The input bitmap (IN)
|
|
||||||
* @return OMPI error code if bm is NULL
|
|
||||||
*
|
|
||||||
*/
|
|
||||||
static inline int ompi_bitmap_size(ompi_bitmap_t *bm)
|
|
||||||
{
|
|
||||||
return (NULL == bm) ? 0 : (bm->array_size * ((int) (sizeof(char) * 8)));
|
|
||||||
}
|
|
||||||
|
|
||||||
#if defined(c_plusplus) || defined(__cplusplus)
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#endif
|
|
||||||
@ -31,9 +31,6 @@
|
|||||||
|
|
||||||
/*
|
/*
|
||||||
* @file Array of elements maintained by value.
|
* @file Array of elements maintained by value.
|
||||||
*
|
|
||||||
* See ompi_bitmap.h for an explanation of why there is a split
|
|
||||||
* between OMPI and ORTE for this generic class.
|
|
||||||
*/
|
*/
|
||||||
#if defined(c_plusplus) || defined(__cplusplus)
|
#if defined(c_plusplus) || defined(__cplusplus)
|
||||||
extern "C" {
|
extern "C" {
|
||||||
|
|||||||
Ссылка в новой задаче
Block a user