1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401
|
/*
BINOBJ.C
Implement functions for generic blocks of data.
$Id: binobj.c,v 1.1 1993/08/27 18:32:09 munro Exp $
*/
/* Copyright (c) 1994. The Regents of the University of California.
All rights reserved. */
#include "bcast.h"
#include "defmem.h"
#include "pstdlib.h"
#include <string.h>
extern void FreeMemberList(Member *member, long n);
/*--------------------------------------------------------------------------*/
/* Set up a block allocator which grabs space for 64 scalar array objects
at a time. Since Array contains an ops pointer, the alignment
of an Array must be at least as strict as a void*. */
static MemryBlock arrayBlock= {0, 0, sizeof(Array),
64*sizeof(Array)};
Array *NewArray(StructDef *base, Dimension *dims)
{
long number= TotalNumber(dims);
long size= base->size;
Array *array= (number*size>2*sizeof(double))?
p_malloc(sizeof(Array)+number*size) : NextUnit(&arrayBlock);
array->references= 0;
array->ops= base->dataOps;
array->type.base= Ref(base);
array->type.dims= Ref(dims);
array->type.number= number;
/* Dangerous to try to initialize things with copy -- could leave
junk in padding between struct members, which prevents comparison
operations from working properly. On the other hand, an array
will normally be filled when it is initialized, so setting
everything to 0 first may be a substantial performance penalty... */
/* base->Copy(base, array->value.c, array->value.c, number);
is NOT legal, since this is used by FreeArray to deallocate
valid strings or pointers
On the other hand,
memset(array->value.c, 0, size*number);
is gratuitous in the case of non-pointer objects */
if (base->Copy!=&CopyX) memset(array->value.c, 0, size*number);
return array;
}
void FreeArray(void *v) /* ******* Use Unref(array) ******* */
{
Array *array= v;
long number;
long size;
StructDef *base;
if (!array) return;
base= array->type.base;
number= TotalNumber(array->type.dims);
size= base->size;
base->Copy(base, array->value.c, array->value.c, number);
Unref(base);
FreeDimension(array->type.dims);
if (number*size>2*sizeof(double)) p_free(array);
else FreeUnit(&arrayBlock, array);
}
/* Set up a block allocator which grabs space for 16 StructDefs
at a time. Since StructDef contains an ops pointer, the alignment
of a StructDef must be at least as strict as a void*. */
static MemryBlock sdefBlock= {0, 0, sizeof(StructDef),
16*sizeof(StructDef)};
StructDef *NewStructDef(IOStream *file, long index)
{
StructDef *base= NextUnit(&sdefBlock);
base->references= 0;
base->ops= yOpsStructDef;
base->dataOps= 0; /* set by InstallStruct to validate */
base->size= 0;
base->alignment= 0;
base->table.nItems= 0;
base->table.maxItems= 0;
base->table.names= 0;
base->table.nSlots= 0;
base->table.items= 0;
base->members= 0;
base->offsets= 0;
base->Copy= &CopyX;
base->file= file; /* NOT Ref(file), since file owns base->reference */
base->index= index;
base->addressType= 0;
base->model= 0;
base->Convert= 0;
base->order= 0;
base->fpLayout= 0;
return base;
}
void FreeStructDef(void *v) /* *** Use Unref(base) *** */
{
StructDef *base= v;
if (!base->table.nItems && !base->file && base->index<=8) {
base->references= 0;
YError("(BUG?) attempt to free StructDef of basic data type");
}
FreeMemberList(base->members, base->table.nItems);
HashClear(&base->table);
p_free(base->members);
p_free(base->offsets);
Unref(base->model);
/* NO Unref(base->file), see NewStructDef above */
FreeFPLayout(base->fpLayout);
FreeUnit(&sdefBlock, base);
}
void FreeMemberList(Member *member, long n)
{
while (n > 0) {
Unref(member->base);
FreeDimension(member->dims);
member++;
n--;
}
}
/* Set up a block allocator which grabs space for 256 shape objects
at a time. */
union FourLongs {
/* Since each of these structs contain a pointer, the
alignment of a FourLongs must be at least as strict as a void*. */
Dimension d;
Strider q;
};
static MemryBlock fourBlock= {0, 0, sizeof(union FourLongs),
256*sizeof(union FourLongs)};
int yForceOrigin= 1;
Dimension *NewDimension(long number, long origin, Dimension *next)
{
Dimension *dims= NextUnit(&fourBlock);
dims->next= next; /* THINK CAREFULLY -- usually don't want Ref(next) */
dims->number= number;
dims->origin= origin;
dims->references= 0;
return dims;
}
void FreeDimension(Dimension *dims)
{
if (dims && --dims->references<0) {
FreeDimension(dims->next);
FreeUnit(&fourBlock, dims);
}
}
Strider *NewStrider(long stride, long number)
{
Strider *strider= NextUnit(&fourBlock);
strider->next= 0;
strider->stride= stride;
strider->number= number;
strider->indexList= 0;
return strider;
}
void FreeStrider(Strider *strider)
{
if (strider) {
FreeStrider(strider->next);
Unref(strider->indexList);
FreeUnit(&fourBlock, strider);
}
}
/*--------------------------------------------------------------------------*/
Dimension *tmpDims= 0;
long TotalNumber(const Dimension *dims)
{
long number= 1;
while (dims) {
number*= dims->number;
dims= dims->next;
}
return number;
}
int CountDims(const Dimension *dims)
{
int count;
for (count=0 ; dims ; dims= dims->next) count++;
return count;
}
/* Note-- like NewDimension, CopyDims does NOT do Ref(next) */
Dimension *CopyDims(Dimension *dims, Dimension *next, int copyOrigin)
{
if (dims)
return NewDimension(dims->number, copyOrigin? dims->origin : 1L,
CopyDims(dims->next, next, copyOrigin));
else
return next;
}
Strider *CopyStrider(Strider *strider, Strider *next)
{
Strider *s;
if (!strider) return next;
s= NewStrider(strider->stride, strider->number);
s->next= CopyStrider(strider->next, next);
s->indexList= Ref(strider->indexList);
return s;
}
/*--------------------------------------------------------------------------*/
/* The offsetof macro may be defined in <stddef.h> (it is ANSI standard). */
/* #define offsetof(structure, member) ((long)&(((structure*)0)->member))
(does not work on Crays) */
#ifndef offsetof
#define offsetof(structure, member) \
((long)((char *)&(((structure*)0)->member) - (char *)0))
#endif
void *Pointee(void *pointer)
{
if (pointer) return (char *)pointer - offsetof(Array, value);
else return &nilDB;
}
/*--------------------------------------------------------------------------*/
/* Here are the four possibilities for the StructDef->Copy function.
Note that they function properly when s==t on input-- namely,
Copy(base, address, address, n) will properly initialize all pointers
to 0 without any other initialization. */
void CopyX(StructDef *base, void *s, const void *t, long n)
{
/* memcpy is a serious performance bottleneck for basic data types
-- this is a kludge to work around the fact that I misused
&CopyX as a flag in a couple of places in the code
many C compilers need hand unrolled loops */
if (s!=t) {
if (base==&doubleStruct) {
double *ss= s;
const double *tt= t;
long i;
for (i=0 ; i<(n&7) ; i++) ss[i]= tt[i];
for ( ; i<n ; i+=8) {
ss[i ]= tt[i];
ss[i+1]= tt[i+1];
ss[i+2]= tt[i+2];
ss[i+3]= tt[i+3];
ss[i+4]= tt[i+4];
ss[i+5]= tt[i+5];
ss[i+6]= tt[i+6];
ss[i+7]= tt[i+7];
}
} else if (base==&longStruct) {
long *ss= s;
const long *tt= t;
long i;
for (i=0 ; i<(n&7) ; i++) ss[i]= tt[i];
for ( ; i<n ; i+=8) {
ss[i ]= tt[i];
ss[i+1]= tt[i+1];
ss[i+2]= tt[i+2];
ss[i+3]= tt[i+3];
ss[i+4]= tt[i+4];
ss[i+5]= tt[i+5];
ss[i+6]= tt[i+6];
ss[i+7]= tt[i+7];
}
} else if (base==&intStruct) {
int *ss= s;
const int *tt= t;
long i;
for (i=0 ; i<(n&7) ; i++) ss[i]= tt[i];
for ( ; i<n ; i+=8) {
ss[i ]= tt[i];
ss[i+1]= tt[i+1];
ss[i+2]= tt[i+2];
ss[i+3]= tt[i+3];
ss[i+4]= tt[i+4];
ss[i+5]= tt[i+5];
ss[i+6]= tt[i+6];
ss[i+7]= tt[i+7];
}
} else if (base==&floatStruct) {
float *ss= s;
const float *tt= t;
long i;
for (i=0 ; i<(n&7) ; i++) ss[i]= tt[i];
for ( ; i<n ; i+=8) {
ss[i ]= tt[i];
ss[i+1]= tt[i+1];
ss[i+2]= tt[i+2];
ss[i+3]= tt[i+3];
ss[i+4]= tt[i+4];
ss[i+5]= tt[i+5];
ss[i+6]= tt[i+6];
ss[i+7]= tt[i+7];
}
} else {
memcpy(s, t, n*base->size);
}
}
}
typedef char *charPtr;
/* ARGSUSED */
void CopyQ(StructDef *base, void *s, const void *t, long n)
{
char **dst= s;
const charPtr *src= (const charPtr *)t;
while (n--) {
p_free(*dst);
*dst= 0;
*dst++= p_strcpy(*src++);
}
}
typedef void *voidPtr;
/* ARGSUSED */
void CopyP(StructDef *base, void *s, const void *t, long n)
{
void **dst= s;
const voidPtr *src= (const voidPtr *)t;
void *oldArray;
while (n--) {
if ((oldArray= *dst)) {
*dst= 0; /* Unref might take some time, delete reference first */
oldArray= Pointee(oldArray);
Unref((Array *)oldArray);
}
if (*src) { /* Can't take this branch if dst==src. */
oldArray= Pointee(*dst++= *src++);
((Array *)oldArray)->references++;
} else {
*dst++= 0;
src++;
}
}
}
void CopyS(StructDef *base, void *s, const void *t, long n)
{
long size= base->size;
long nItems= base->table.nItems;
long off, *offsets= base->offsets;
Member *members= base->members;
char *dst= s;
const char *src= t;
int initializing= (s==t);
StructDef *subBase;
long m, subTotal, subSize;
Copier *SubCopy;
/* outer loop is on number of items */
while (n--) {
/* inner loop is on base structure members */
for (m=0 ; m<nItems ; /* m++ in loop body */) {
subBase= members[m].base;
SubCopy= subBase->Copy;
/* skip initialization of direct data */
if (initializing && SubCopy==CopyX) { m++; continue; }
subTotal= members[m].number;
off= offsets[m++];
/* include contiguous members of the same type to avoid multiple
calls to SubCopy */
subSize= subBase->size;
while (m<nItems && members[m].base==subBase &&
offsets[m]==off+subSize*subTotal) {
subTotal+= members[m].number;
m++;
}
/* copy member or contiguous members (possibly recursive) */
SubCopy(subBase, dst+off, src+off, subTotal);
}
/* end of loop on structure members */
dst+= size;
src+= size;
} /* end of loop on number of items */
}
/*--------------------------------------------------------------------------*/
|