greenplumn SparseData 源码
greenplumn SparseData 代码
文件路径：/gpcontrib/gp_sparse_vector/SparseData.h
/*-------------------------------------------------------------------------
*
* SparseData.h
* Declarations/definitions for "SparseData" functions.
*
* SparseData provides array storage for repetitive data as commonly found in
* numerical analysis of sparse arrays and matrices. Sequential duplicate
* values in the array are represented in an index structure that stores the
* count of the number of times a given value is duplicated. All storage is
* allocated with palloc().
*
* NOTES
* The SparseData structure is an in-memory structure and so must be serialized
* into a persisted structure like a VARLENA when leaving a GP / Postgres
* function. This implies a COPY from the SparseData to the VARLENA.
*
* Copyright (c) 2010, Greenplum Software
* Portions Copyright (c) 2013-Present VMware, Inc. or its affiliates.
*
*
* IDENTIFICATION
* gpcontrib/gp_sparse_vector/SparseData.h
*
*-------------------------------------------------------------------------
*/
#ifndef SPARSEDATA_H
#define SPARSEDATA_H
#include <math.h>
#include <string.h>
#include "postgres.h"
#include "lib/stringinfo.h"
#include "utils/array.h"
#include "catalog/pg_type.h"
#define ABS(a) (((a) < 0) ? -(a) : (a))
#define MIN(a,b) (((a) < (b)) ? (a) : (b))
#define MAX(a,b) (((a) > (b)) ? (a) : (b))
#define CEIL(a,b) ( ((a)+(b)-1) / (b) )
#define BCAP(a) ( ((a) != 0) ? 1 : 0 )
/*
* Calculate the size of the integer count in an RLE index provided the pointer
* to the start of the count entry
*
* Note that if the ptr is NULL, a zero size is returned
*/
#define int8compstoragesize(ptr) \
(((ptr) == NULL) ? 0 : (((*((char *)(ptr)) < 0) ? 1 : (1 + *((char *)(ptr))))) )
/*------------------------------------------------------------------------------
* SparseData holds information about a sparse array of values
*------------------------------------------------------------------------------
*/
typedef struct SparseDataStruct
{
/* The native type of the data entries */
Oid type_of_data;
// enum
// {
// BIT,BYTE,INT16,INT32,INT64,FLOAT32,FLOAT64,COMPLEX32,COMPLEX64
// BYTE,INT16,INT32,INT64,FLOAT32,FLOAT64
// } type_of_data;
int unique_value_count; /* The number of unique values in the data
array */
int total_value_count; /* The total number of values, including
duplicates */
StringInfo vals; /* The unique number values are stored here as a
stream of bytes */
StringInfo index; /* A count of each value is stored in the index */
} SparseDataStruct;
typedef SparseDataStruct *SparseData;
/* Calculate the size of a serialized SparseData based on the actual consumed
* length of the StringInfo data and StringInfoData structures.
*/
/*------------------------------------------------------------------------------
* Serialized SparseData
*------------------------------------------------------------------------------
* SparseDataStruct Contents
* StringInfoData Contents for "vals"
* StringInfoData Contents for "index"
* data contents for "vals" (size is vals->maxlen)
* data contents for "index" (size is index->maxlen)
*
* The vals and index fields are serialized as StringInfoData, then the
* data contents are serialized at the end.
*
* Since two StringInfoData structs together are 64-bit aligned, there's
* no need for padding.
*
* For reference, here is the format of the StringInfoData:
* char * dataptr;
* -> a placeholder in the serialized version, is filled
* when the serialized version is used in-place
* int len;
* int maxlen;
* int cursor;
*/
#define SIZEOF_SPARSEDATAHDR (sizeof(SparseDataStruct)+4)
/* Size of the sparse data structure minus the dynamic variables, plus two integers
* describing the length of the data area and index
* Takes a SparseData argument
*/
#define SIZEOF_SPARSEDATASERIAL(x) (SIZEOF_SPARSEDATAHDR + \
(2*sizeof(StringInfoData))+ \
(x)->vals->maxlen + (x)->index->maxlen)
/*
* The following take a serialized SparseData as an argument and return
* pointers to locations inside.
*/
#define SDATA_DATA_SINFO(x) ((char *)(x)+SIZEOF_SPARSEDATAHDR)
#define SDATA_INDEX_SINFO(x) (SDATA_DATA_SINFO(x)+sizeof(StringInfoData))
#define SDATA_DATA_SIZE(x) (((StringInfo)SDATA_DATA_SINFO(x))->maxlen)
#define SDATA_INDEX_SIZE(x) (((StringInfo)SDATA_INDEX_SINFO(x))->maxlen)
#define SDATA_VALS_PTR(x) (SDATA_INDEX_SINFO(x)+sizeof(StringInfoData))
#define SDATA_INDEX_PTR(x) (SDATA_VALS_PTR(x)+SDATA_DATA_SIZE(x))
#define SDATA_UNIQUE_VALCNT(x) (((SparseData)(x))->unique_value_count)
#define SDATA_TOTAL_VALCNT(x) (((SparseData)(x))->total_value_count)
#define SDATA_IS_SCALAR(x) (((((x)->unique_value_count)==((x)->total_value_count))&&((x)->total_value_count==1)) ? 1 : 0)
int64 *sdata_index_to_int64arr(SparseData sdata);
void serializeSparseData(char *target, SparseData source);
SparseData makeEmptySparseData(void);
SparseData makeInplaceSparseData(char *vals, char *index,
int datasize, int indexsize, Oid datatype,
int unique_value_count, int total_value_count);
SparseData makeSparseDataCopy(SparseData source_sdata);
SparseData makeSparseDataFromDouble(double scalar,int64 dimension);
SparseData makeSparseData(void);
void freeSparseData(SparseData sdata);
void freeSparseDataAndData(SparseData sdata);
SparseData float8arr_to_sdata(double *array, int count);
SparseData arr_to_sdata(char *array, size_t width, Oid type_of_data, int count);
double *sdata_to_float8arr(SparseData sdata);
StringInfo copyStringInfo(StringInfo source_sinfo);
StringInfo makeStringInfoFromData(char *data,int len);
static inline void int8_to_compword(int64 num, char entry[9]);
static inline size_t
size_of_type(Oid type)
{
switch (type)
{
case FLOAT4OID:
return(4);
case FLOAT8OID:
return(8);
case CHAROID:
return(1);
case INT2OID:
return(2);
case INT4OID:
return(4);
case INT8OID:
return(8);
}
return(1);
}
static inline void append_to_rle_index(StringInfo index, int64 run_len)
{
char bytes[]={0,0,0,0,0,0,0,0,0}; /* 9 bytes into which the compressed
int8 value is written */
int8_to_compword(run_len,bytes); /* create compressed version of
int8 value */
appendBinaryStringInfo(index,bytes,int8compstoragesize(bytes));
}
static inline void add_run_to_sdata(char *run_val, int64 run_len, size_t width,
SparseData sdata)
{
StringInfo index = sdata->index;
StringInfo vals = sdata->vals;
appendBinaryStringInfo(vals,run_val,width);
append_to_rle_index(index, run_len);
sdata->unique_value_count++;
sdata->total_value_count+=run_len;
}
/*------------------------------------------------------------------------------
* Each integer count in the RLE index is stored in a number of bytes determined
* by it's size. The larger the integer count, the larger the size of storage.
* Following is the map of count maximums to storage size:
* Range Storage
* --------- -----------------------------------------
* 0 - 127 signed char stores the negative count
*
* All higher than 127 have two parts, the description byte
* and the count word
*
* description byte signed char stores the number of bytes in the
* count word one of 1,2,4 or 8
*
* 128 - 32767 count word is 2 bytes, signed int16_t
* 32768 - 2147483648 count word is 4 bytes, signed int32_t
* 2147483648 - max count word is 8 bytes, signed int64
*------------------------------------------------------------------------------
*/
/*
* Transform an int64 value to an RLE entry. The entry is placed in the
* provided entry[] array and will have a variable size depending on the value.
*/
static inline void int8_to_compword(int64 num, char entry[9])
{
int16_t num_2;
int32_t num_4;
if (num < 128) {
entry[0] = -(char)num;
} else if (num < 32768) {
entry[0] = 2;
num_2 = (int16_t)num;
entry[1] = *( char *)(&num_2) ;
entry[2] = *((char *)(&num_2)+1);
} else if (num < 2147483648) {
entry[0] = 4;
num_4 = (int32_t)num;
entry[1] = *( char *)(&num_4) ;
entry[2] = *((char *)(&num_4)+1);
entry[3] = *((char *)(&num_4)+2);
entry[4] = *((char *)(&num_4)+3);
} else {
entry[0] = 8;
entry[1] = *( char *)(&num) ;
entry[2] = *((char *)(&num)+1);
entry[3] = *((char *)(&num)+2);
entry[4] = *((char *)(&num)+3);
entry[5] = *((char *)(&num)+4);
entry[6] = *((char *)(&num)+5);
entry[7] = *((char *)(&num)+6);
entry[8] = *((char *)(&num)+7);
}
}
/*
* Transform a count entry into an int64 value when provided with a pointer
* to an entry.
*/
static inline int64 compword_to_int8(const char *entry)
{
char size = int8compstoragesize(entry);
int16_t num_2;
char *numptr2 = (char *)(&num_2);
int32_t num_4;
char *numptr4 = (char *)(&num_4);
int64 num;
char *numptr8 = (char *)(&num);
switch(size) {
case 0: //Null entry, return a run length of 1
return(1);
break;
case 1:
num = -(entry[0]);
break;
case 3:
numptr2[0] = entry[1];
numptr2[1] = entry[2];
num = num_2;
break;
case 5:
numptr4[0] = entry[1];
numptr4[1] = entry[2];
numptr4[2] = entry[3];
numptr4[3] = entry[4];
num = num_4;
break;
case 9:
numptr8[0] = entry[1];
numptr8[1] = entry[2];
numptr8[2] = entry[3];
numptr8[3] = entry[4];
numptr8[4] = entry[5];
numptr8[5] = entry[6];
numptr8[6] = entry[7];
numptr8[7] = entry[8];
break;
}
return num;
}
/*------------------------------------------------------------------------------
* Multiplication, Addition, Division by scalars
*------------------------------------------------------------------------------
*/
#define typref(type,ptr) (*((type *)(ptr)))
#define valref(type,val,i) (((type *)(val)->vals->data)[(i)])
#define valsquare(val) (val*val)
#define valcube(val) (val*valsquare(val))
#define valquad(val) (valsquare(valsquare(val)))
#define apply_const_to_sdata(sdata,i,op,scalar) \
switch ((sdata)->type_of_data) \
{ \
case FLOAT4OID: \
valref(float,sdata,i) op typref(float,scalar); \
break; \
case FLOAT8OID: \
valref(float8,sdata,i) op typref(float8,scalar); \
break; \
case CHAROID: \
valref(char,sdata,i) op typref(char,scalar); \
break; \
case INT2OID: \
valref(int16,sdata,i) op typref(int16,scalar); \
break; \
case INT4OID: \
valref(int32,sdata,i) op typref(int32,scalar); \
break; \
case INT8OID: \
valref(int64,sdata,i) op typref(int64,scalar); \
break; \
}
#define apply_scalar_left_to_sdata(sdata,i,op,scalar) \
switch ((sdata)->type_of_data) \
{ \
case FLOAT4OID: \
valref(float,sdata,i) = \
typref(float,scalar) op valref(float,sdata,i); \
break; \
case FLOAT8OID: \
valref(float8,sdata,i) = \
typref(float8,scalar) op valref(float8,sdata,i); \
break; \
case CHAROID: \
valref(char,sdata,i) = \
typref(char,scalar) op valref(char,sdata,i); \
break; \
case INT2OID: \
valref(int16,sdata,i) = \
typref(int16,scalar) op valref(int16_t,sdata,i); \
break; \
case INT4OID: \
valref(int32,sdata,i) = \
typref(int32,scalar) op valref(int32_t,sdata,i); \
break; \
case INT8OID: \
valref(int64,sdata,i) = \
typref(int64,scalar) op valref(int64,sdata,i); \
break; \
}
#define accum_sdata_result(result,left,i,op,right,j) \
switch ((left)->type_of_data) \
{ \
case FLOAT4OID: \
typref(float,result) = \
valref(float,left,i) op \
valref(float,right,j); \
break; \
case FLOAT8OID: \
typref(float8,result) = \
valref(float8,left,i) op \
valref(float8,right,j); \
break; \
case CHAROID: \
typref(char,result) = \
valref(char,left,i) op \
valref(char,right,j); \
break; \
case INT2OID: \
typref(int16,result) = \
valref(int16,left,i) op \
valref(int16,right,j); \
break; \
case INT4OID: \
typref(int32,result) = \
valref(int32,left,i) op \
valref(int32,right,j); \
break; \
case INT8OID: \
typref(int64,result) = \
valref(int64,left,i) op \
valref(int64,right,j); \
break; \
}
#define apply_function_sdata_scalar(result,func,left,i,scalar) \
switch ((left)->type_of_data) \
{ \
case FLOAT4OID: \
valref(float,result,i) =\
func(valref(float,left,i),typref(float,scalar)); \
break; \
case FLOAT8OID: \
valref(float8,result,i) =\
func(valref(float8,left,i),typref(float8,scalar)); \
break; \
case CHAROID: \
valref(char,result,i) =\
func(valref(char,left,i),typref(char,scalar)); \
break; \
case INT2OID: \
valref(int16,result,i) =\
func(valref(int16,left,i),typref(int16,scalar)); \
break; \
case INT4OID: \
valref(int32,result,i) =\
func(valref(int32,left,i),typref(int32,scalar)); \
break; \
case INT8OID: \
valref(int64,result,i) =\
func(valref(int64,left,i),typref(int64,scalar)); \
break; \
}
#define apply_square_sdata(result,left,i) \
switch ((left)->type_of_data) \
{ \
case FLOAT4OID: \
valref(float,result,i) = \
valsquare(valref(float,left,i)); \
break; \
case FLOAT8OID: \
valref(float8,result,i) = \
valsquare(valref(float8,left,i));\
break; \
case CHAROID: \
valref(char,result,i) = \
valsquare(valref(char,left,i));\
break; \
case INT2OID: \
valref(int16_t,result,i) = \
valsquare(valref(int16_t,left,i));\
break; \
case INT4OID: \
valref(int32_t,result,i) = \
valsquare(valref(int32_t,left,i));\
break; \
case INT8OID: \
valref(int64,result,i) = \
valsquare(valref(int64,left,i));\
break; \
}
#define apply_cube_sdata(result,left,i) \
switch ((left)->type_of_data) \
{ \
case FLOAT4OID: \
valref(float,result,i) = \
valcube(valref(float,left,i)); \
break; \
case FLOAT8OID: \
valref(float8,result,i) = \
valcube(valref(float8,left,i));\
break; \
case CHAROID: \
valref(char,result,i) = \
valcube(valref(char,left,i));\
break; \
case INT2OID: \
valref(int16_t,result,i) = \
valcube(valref(int16_t,left,i));\
break; \
case INT4OID: \
valref(int32_t,result,i) = \
valcube(valref(int32_t,left,i));\
break; \
case INT8OID: \
valref(int64,result,i) = \
valcube(valref(int64,left,i));\
break; \
}
#define apply_quad_sdata(result,left,i) \
switch ((left)->type_of_data) \
{ \
case FLOAT4OID: \
valref(float,result,i) = \
valquad(valref(float,left,i)); \
break; \
case FLOAT8OID: \
valref(float8,result,i) = \
valquad(valref(float8,left,i));\
break; \
case CHAROID: \
valref(char,result,i) = \
valquad(valref(char,left,i));\
break; \
case INT2OID: \
valref(int16_t,result,i) = \
valquad(valref(int16_t,left,i));\
break; \
case INT4OID: \
valref(int32_t,result,i) = \
valquad(valref(int32_t,left,i));\
break; \
case INT8OID: \
valref(int64,result,i) = \
valquad(valref(int64,left,i));\
break; \
}
static inline void
check_sdata_dimensions(SparseData left, SparseData right)
{
if (left->total_value_count != right->total_value_count)
{
ereport(ERROR,
(errcode(ERRCODE_INVALID_PARAMETER_VALUE),
errmsg("operation undefined when dimension of left and right vectors are not the same")));
}
}
/*
* Do one of subtract, add, multiply, or divide depending on
* the value of operation one of (0,1,2,3).
*
* The "direction" argument is either 1 or 2 depending on
* whether the scalar is on the left (1) or right (2)
*/
static inline void op_sdata_by_scalar_inplace(int operation,
char *scalar, SparseData sdata, int direction)
{
if (direction == 2) //scalar is on the right
{
for(int i=0; i<sdata->unique_value_count; i++)
{
switch(operation)
{
case 0:
apply_const_to_sdata(sdata,i,-=,scalar)
break;
case 1:
apply_const_to_sdata(sdata,i,+=,scalar)
break;
case 2:
apply_const_to_sdata(sdata,i,*=,scalar)
break;
case 3:
apply_const_to_sdata(sdata,i,/=,scalar)
break;
}
}
} else { //scalar is on the left
for(int i=0; i<sdata->unique_value_count; i++)
{
switch(operation)
{
case 0:
apply_scalar_left_to_sdata(sdata,i,-,scalar)
break;
case 1:
apply_scalar_left_to_sdata(sdata,i,+,scalar)
break;
case 2:
apply_scalar_left_to_sdata(sdata,i,*,scalar)
break;
case 3:
apply_scalar_left_to_sdata(sdata,i,/,scalar)
break;
}
}
}
}
static inline SparseData op_sdata_by_scalar_copy(int operation,
char *scalar, SparseData source_sdata, int direction) {
SparseData sdata = makeSparseDataCopy(source_sdata);
op_sdata_by_scalar_inplace(operation,scalar,sdata,direction);
return sdata;
}
/*
* Exponentiate an sdata left argument with a right scalar
*/
static inline SparseData pow_sdata_by_scalar(SparseData sdata,
char *scalar)
{
SparseData result = makeSparseDataCopy(sdata);
for(int i=0; i<sdata->unique_value_count; i++)
apply_function_sdata_scalar(result,pow,sdata,i,scalar)
return(result);
}
static inline SparseData square_sdata(SparseData sdata)
{
SparseData result = makeSparseDataCopy(sdata);
for(int i=0; i<sdata->unique_value_count; i++)
apply_square_sdata(result,sdata,i)
return(result);
}
static inline SparseData cube_sdata(SparseData sdata)
{
SparseData result = makeSparseDataCopy(sdata);
for(int i=0; i<sdata->unique_value_count; i++)
apply_cube_sdata(result,sdata,i)
return(result);
}
static inline SparseData quad_sdata(SparseData sdata)
{
SparseData result = makeSparseDataCopy(sdata);
for(int i=0; i<sdata->unique_value_count; i++)
apply_quad_sdata(result,sdata,i)
return(result);
}
static inline bool sparsedata_eq(SparseData left, SparseData right)
{
if ((left->total_value_count != right->total_value_count) ||
(left->unique_value_count != right->unique_value_count))
return(0);
/*
* We'll take a two phase approach to enhance speed:
* Check the unique values for equivalence, then check the run lengths
*/
if (memcmp(left->vals->data,right->vals->data,left->vals->len))
{
return(0);
}
if (memcmp(left->index->data,right->index->data,left->index->len))
{
return(0);
}
return(1);
}
static inline double sum_sdata_values_double(SparseData sdata)
{
double accum=0.;
char *ix = sdata->index->data;
double *vals = (double *)sdata->vals->data;
int64 run_length;
for (int i=0;i<sdata->unique_value_count;i++)
{
run_length = compword_to_int8(ix);
accum += vals[i]*run_length;
ix+=int8compstoragesize(ix);
}
return (accum);
}
static inline double l2norm_sdata_values_double(SparseData sdata)
{
double accum=0.;
char *ix = sdata->index->data;
double *vals = (double *)sdata->vals->data;
int64 run_length;
for (int i=0;i<sdata->unique_value_count;i++)
{
run_length = compword_to_int8(ix);
accum += (vals[i]*vals[i])*run_length;
ix+=int8compstoragesize(ix);
}
accum = sqrt(accum);
return (accum);
}
static inline double l1norm_sdata_values_double(SparseData sdata)
{
double accum=0.;
char *ix = sdata->index->data;
double *vals = (double *)sdata->vals->data;
int64 run_length;
for (int i=0;i<sdata->unique_value_count;i++)
{
run_length = compword_to_int8(ix);
accum += ABS(vals[i])*run_length;
ix+=int8compstoragesize(ix);
}
return (accum);
}
/*------------------------------------------------------------------------------
* Addition, Scalar Product, Division between SparseData arrays
*
* There are a few factors to consider:
* - The dimension of the left and right arguments must be the same
* - We employ an algorithm that does the computation on the compressed contents
* which creates a new SparseData array
* - "operation" is one of 0,1,2,3 for subtraction, addition, multiplication or
* division
*------------------------------------------------------------------------------
*/
static inline SparseData op_sdata_by_sdata(int operation,SparseData left,
SparseData right)
{
SparseData sdata = makeSparseData();
/*
* Loop over the contents of the left array, operating on elements
* of the right array and append a new value to the sdata when a
* new unique value is generated.
*
* We will manage two cursors, one for each of left and right arrays
*/
char *liptr=left->index->data;
char *riptr=right->index->data;
int left_run_length, right_run_length;
char *new_value,*last_new_value;
int tot_run_length=-1;
left_run_length = compword_to_int8(liptr);
right_run_length = compword_to_int8(riptr);
int left_lst=0,right_lst=0;
int left_nxt=left_run_length,right_nxt=right_run_length;
int nextpos = MIN(left_nxt,right_nxt),lastpos=0;
int i=0,j=0;
size_t width = size_of_type(left->type_of_data);
check_sdata_dimensions(left,right);
new_value = (char *)palloc(width);
last_new_value = (char *)palloc(width);
if ((operation > 3)|| (operation < 0))
ereport(ERROR,
(errcode(ERRCODE_INVALID_PARAMETER_VALUE),
errmsg("operation not in range 0-3")));
while (1)
{
// printf("i,j,left_nxt,right_nxt,nextpos=%d,%d,%d,%d,%d\n",i,j,nextpos,left_nxt,right_nxt);
switch (operation)
{
case 0:
accum_sdata_result(new_value,left,i,-,right,j)
break;
case 1:
default:
accum_sdata_result(new_value,left,i,+,right,j)
break;
case 2:
accum_sdata_result(new_value,left,i,*,right,j)
break;
case 3:
accum_sdata_result(new_value,left,i,/,right,j)
break;
}
/*
* Potentially add a new run, depending on whether this is a different
* value from the previous calculation. It may be that this calculation
* has produced an identical value to the previous, in which case we store
* it up, waiting for a new value to happen.
*/
if (tot_run_length==-1)
{
memcpy(last_new_value,new_value,width);
tot_run_length=0;
}
if (memcmp(new_value,last_new_value,width))
{
add_run_to_sdata(last_new_value,tot_run_length,sizeof(float8),sdata);
tot_run_length = 0;
memcpy(last_new_value,new_value,width);
}
tot_run_length += (nextpos-lastpos);
// printf("New_value,runlength = %f,%d\n",new_value,nextpos-lastpos);
if ((left_nxt==right_nxt)&&(left_nxt==(left->total_value_count))) {
// printf("STOPPING: i,j,left_nxt,right_nxt,nextpos=%d,%d,%d,%d,%d\n",i,j,nextpos,left_nxt,right_nxt);
break;
} else if (left_nxt==right_nxt) {
i++;j++;
left_lst=left_nxt;right_lst=right_nxt;
liptr+=int8compstoragesize(liptr);
riptr+=int8compstoragesize(riptr);
} else if (nextpos==left_nxt) {
i++;
left_lst=left_nxt;
liptr+=int8compstoragesize(liptr);
} else if (nextpos==right_nxt) {
j++;
right_lst=right_nxt;
riptr+=int8compstoragesize(riptr);
}
left_run_length = compword_to_int8(liptr);
right_run_length = compword_to_int8(riptr);
left_nxt=left_run_length+left_lst;
right_nxt=right_run_length+right_lst;
lastpos=nextpos;
nextpos = MIN(left_nxt,right_nxt);
// printf("nextpos,leftmax = %d,%d\n",nextpos,left->total_value_count);
}
/*
* Add the last run if we ended with a repeating value
*/
if (tot_run_length!=0)
add_run_to_sdata(new_value,tot_run_length,sizeof(float8),sdata);
/*
* Set the return data type
*/
sdata->type_of_data = left->type_of_data;
pfree(new_value);
pfree(last_new_value);
return sdata;
}
/*------------------------------------------------------------------------------
* macros that will test test whether a given double
* value is in the normal range or is in the special range (denormals,
* exceptions).
*------------------------------------------------------------------------------
*/
/* Anything between LOW and HIGH is a denormal or exception */
#define SPEC_MASK_HIGH 0xFFF0000000000000
#define SPEC_MASK_LOW 0x7FF0000000000000
#define MASKTEST(x,y) (((x)&(y))==x) /* MASKTEST checks for the presents of
the bits in x in the input y */
/* The input to MASKTEST_double should be an int64 mask and a (double *) to be
* tested
*/
#define MASKTEST_double(x,y) MASKTEST((x),*((int64 *)(&(y))))
#define DBL_IS_A_SPECIAL(x) \
(MASKTEST_double(SPEC_MASK_HIGH,(x)) || MASKTEST_double(SPEC_MASK_LOW,(x)) \
|| ((x) == 0.))
#endif /* SPARSEDATA_H */
相关信息
相关文章
0
赞
热门推荐
-
2、 - 优质文章
-
3、 gate.io
-
6、 golang
-
8、 openharmony