1
1
openmpi/test/class/ompi_fifo.c
Rich Graham 59f339f06b add test for ompi_fifo functions.
This commit was SVN r2328.
2004-08-27 16:31:27 +00:00

222 строки
5.9 KiB
C

/*
* $HEADER$
*/
#include <stdlib.h>
#include "support.h"
#include "mca/mpool/mpool.h"
static void *malloc_noalign(size_t size, size_t dummy) {
return malloc(size);
}
#include "class/ompi_fifo.h"
/* simple allocator for some simple tests */
mca_mpool_base_module_t pool = {
NULL, /* component structure */
NULL, /* mca_mpool_base_module_address_fn_t */
malloc_noalign, /* mca_mpool_base_module_alloc_fn_t */
realloc, /* ca_mpool_base_module_realloc_fn_t */
free, /*mca_mpool_base_module_free_fn_t */
NULL, /* mca_mpool_base_module_register_fn_t */
NULL, /* mca_mpool_base_module_deregister_fn_t */
NULL /* mca_mpool_base_module_finalize_fn_t */
};
int main(int argc, char **argv) {
/* local variables */
ompi_fifo_t fifo;
int i,j,size_of_fifo,lazy_free,return_status,error_cnt,loop_cnt;
void *ptr;
cb_slot_t *slot_data;
size_t cnt;
/* get queue size */
size_of_fifo=atoi(argv[1]);
lazy_free=atoi(argv[2]);
loop_cnt=atoi(argv[3]);
/* init result tracking */
test_init("ompi_circular_buffer_fifo");
/* init fifo */
return_status=ompi_fifo_init(size_of_fifo,lazy_free,0,0,0,&fifo,
&pool);
/* check to see that retrun status is success */
if( OMPI_SUCCESS == return_status ) {
test_success();
} else {
test_failure(" ompi_fifo_init \n");
}
/* populate fifo */
error_cnt=0;
for( i=0 ; i < loop_cnt*ompi_cb_fifo_size( (ompi_cb_fifo_t *)
&(fifo.head->cb_fifo)); i++ ) {
return_status=ompi_fifo_write_to_head((void *)(i+5),
(ompi_fifo_t *)&(fifo));
if( OMPI_CB_ERROR == return_status ) {
test_failure(" ompi_cb_fifo_write_to_head\n");
error_cnt++;
}
}
if( 0 == error_cnt ) {
test_success();
}
/* pop items off the queue */
error_cnt=0;
for( i=0 ; i < loop_cnt*ompi_cb_fifo_size( (ompi_cb_fifo_t *)
&(fifo.head->cb_fifo)); i++ ) {
ptr=ompi_fifo_read_from_tail(&fifo);
if( (void *)(i+5) != ptr ) {
test_failure(" ompi_cb_fifo_read_from_tail\n");
error_cnt++;
}
}
if( 0 == error_cnt ) {
test_success();
}
/* free fifo */
return_status=ompi_fifo_free(&fifo,&pool);
if( OMPI_SUCCESS == return_status ) {
test_success();
} else {
test_failure(" ompi_fifo_free \n");
}
/*
* test slot reservation
*/
cnt=sizeof(cb_slot_t)*loop_cnt;
cnt*=fifo.head->cb_fifo.size;
slot_data=malloc(cnt);
if( !slot_data ) {
test_failure(" can't allocate memory for slot_data");
goto ERRORS;
}
/* init fifo */
return_status=ompi_fifo_init(size_of_fifo,lazy_free,0,0,0,&fifo,
&pool);
/* check to see that retrun status is success */
if( OMPI_SUCCESS == return_status ) {
test_success();
} else {
test_failure(" ompi_fifo_init \n");
}
/* reserve slot fifo */
error_cnt=0;
for( i=0 ; i < loop_cnt*ompi_cb_fifo_size( (ompi_cb_fifo_t *)
&(fifo.head->cb_fifo)); i++ ) {
slot_data[i]=ompi_fifo_get_slot((ompi_fifo_t *)&(fifo));
if( 0 > slot_data[i].index ) {
test_failure(" ompi_fifo_get_slot \n");
error_cnt++;
}
}
if( 0 == error_cnt ) {
test_success();
}
/* populate the reserved slots */
error_cnt=0;
for( i=0 ; i < loop_cnt*ompi_cb_fifo_size( (ompi_cb_fifo_t *)
&(fifo.head->cb_fifo)); i++ ) {
return_status=ompi_fifo_write_to_slot(&(slot_data[i]),
(void *)(i+5) );
if( OMPI_CB_ERROR == return_status ) {
test_failure(" ompi_fifo_write_to_slot \n");
error_cnt++;
}
}
if( 0 == error_cnt ) {
test_success();
}
/* pop items off the queue */
error_cnt=0;
for( i=0 ; i < loop_cnt*ompi_cb_fifo_size( (ompi_cb_fifo_t *)
&(fifo.head->cb_fifo)); i++ ) {
ptr=ompi_fifo_read_from_tail(&fifo);
if( (void *)(i+5) != ptr ) {
test_failure(" ompi_cb_fifo_read_from_tail II\n");
error_cnt++;
}
}
if( 0 == error_cnt ) {
test_success();
}
/* free fifo */
return_status=ompi_fifo_free(&fifo,&pool);
if( OMPI_SUCCESS == return_status ) {
test_success();
} else {
test_failure(" ompi_fifo_free II\n");
}
/*
* re-use slots
*/
/* init fifo */
return_status=ompi_fifo_init(size_of_fifo,lazy_free,0,0,0,&fifo,
&pool);
/* check to see that retrun status is success */
if( OMPI_SUCCESS == return_status ) {
test_success();
} else {
test_failure(" ompi_fifo_init \n");
}
/* populate fifo */
for( j=0 ; j < loop_cnt ; j++ ) {
error_cnt=0;
for( i=0 ; i < ompi_cb_fifo_size( (ompi_cb_fifo_t *)
&(fifo.head->cb_fifo)); i++ ) {
return_status=ompi_fifo_write_to_head((void *)((i+5)*(j+1)),
(ompi_fifo_t *)&(fifo));
if( OMPI_CB_ERROR == return_status ) {
test_failure(" ompi_cb_fifo_write_to_head\n");
error_cnt++;
}
}
if( 0 == error_cnt ) {
test_success();
}
/* pop items off the queue */
error_cnt=0;
for( i=0 ; i < ompi_cb_fifo_size( (ompi_cb_fifo_t *)
&(fifo.head->cb_fifo)); i++ ) {
ptr=ompi_fifo_read_from_tail(&fifo);
if( (void *)((i+5)*(j+1)) != ptr ) {
test_failure(" ompi_cb_fifo_read_from_tail\n");
error_cnt++;
}
}
if( 0 == error_cnt ) {
test_success();
}
}
/* free fifo */
return_status=ompi_fifo_free(&fifo,&pool);
if( OMPI_SUCCESS == return_status ) {
test_success();
} else {
test_failure(" ompi_fifo_free \n");
}
ERRORS:
/* finalize result tracking */
return test_finalize();
}