summaryrefslogtreecommitdiffstats
path: root/conversion/vff.cc
blob: 25b58f7b1d79a3e4b0fb445387429dd155026831 (plain)
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
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
/*
* This file is part of rasdaman community.
*
* Rasdaman community is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Rasdaman community is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with rasdaman community.  If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2003, 2004, 2005, 2006, 2007, 2008, 2009 Peter Baumann /
rasdaman GmbH.
*
* For more information please see <http://www.rasdaman.org>
* or contact Peter Baumann via <baumann@rasdaman.com>.
/
/**
 * FILE: vff.cc
 *
 * MODULE:  conversion
 *
 * CLASSES: r_Conv_VFF
 *
 * COMMENTS:
 *
 * Provides interface to convert data to VFF and back.
 *
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>

#include <iostream>
#include <strstream>

#include "raslib/rminit.hh"
#include "raslib/endian.hh"
#include "raslib/miterd.hh"
#include "raslib/odmgtypes.hh"
#include "raslib/parseparams.hh"
#include "conversion/vff.hh"


// file magic
const char *r_Conv_VFF::fileMagic = "ncaa";

// keyword enumerators, must be kept in sync with keywords
enum vff_keyword_e {
  vffkey_rank = 0,
  vffkey_type,
  vffkey_format,
  vffkey_size,
  vffkey_origin,
  vffkey_extent,
  vffkey_aspect,
  vffkey_bands,
  vffkey_bits,
  vffkey_value,
  vffkey_endian,
  vffkey_dorder,
  vffkey_NUMBER
};

// Keywords
const char *r_Conv_VFF::keywords[] = {
  // mandatory
  "rank",
  "type",
  "format",
  "size",
  "origin",
  "extent",
  "aspect",
  "bands",
  "bits",
  // optional
  "value",
  "endianness",
  "data_order"
};

// values
const char *r_Conv_VFF::kval_Raster = "raster";
const char *r_Conv_VFF::kval_Slice = "slice";
const char *r_Conv_VFF::kval_LEndian = "little_endian";
const char *r_Conv_VFF::kval_BEndian = "big_endian";

// default data order
const char *r_Conv_VFF::dfltDataOrder2 = "xy";
const char *r_Conv_VFF::dfltDataOrder3 = "yzx";

// default dimension order
const char *r_Conv_VFF::dfltDimOrder2 = "xy";
const char *r_Conv_VFF::dfltDimOrder3 = "yzx";

// end of header
const char r_Conv_VFF::endOfHeader = 0x0c;

// method names
const char *r_Conv_VFF::method_convTo = "r_Conv_VFF::convertTo()";
const char *r_Conv_VFF::method_convFrom = "r_Conv_VFF::convertFrom()";


r_Conv_VFF::r_Conv_VFF( const char *src, const r_Minterval &interv, int tp ) throw(r_Error)
: r_Convertor(src, interv, tp)
{
  initVFF();
}


r_Conv_VFF::r_Conv_VFF( const char *src, const r_Minterval &interv, const r_Type *tp ) throw(r_Error)
: r_Convertor(src, interv, tp, true)
{
  initVFF();
}


r_Conv_VFF::~r_Conv_VFF( void )
{
  if (dorderParam != NULL)
    delete [] dorderParam;
  if (dimOrderParam != NULL)
    delete [] dimOrderParam;
}


void r_Conv_VFF::initVFF( void )
{
  dorderParam = NULL;
  dimOrderParam = NULL;
  dfltEndianness = 0;	// big endian

  if (params == NULL)
    params = new r_Parse_Params;

  params->add("dorder", &dorderParam, r_Parse_Params::param_type_string);
  params->add("dimorder", &dimOrderParam, r_Parse_Params::param_type_string);
  params->add("vffendian", &dfltEndianness, r_Parse_Params::param_type_int);
}


void r_Conv_VFF::skip_white( const char *&str )
{
  while ((*str != endOfHeader) && (isspace((unsigned int)(*str)))) str++;
}

void r_Conv_VFF::write_interval( const char *keyname, std::ostream &str, const r_Minterval &iv, const unsigned int *order, r_Range inc )
{
  r_Dimension i;
  str << keyname << '=' << (iv[order[0]].high() - iv[order[0]].low() + inc);
  for (i=1; i<iv.dimension(); i++)
    str << ' ' << (iv[order[i]].high() - iv[order[i]].low() + inc);
  str << ";\n";
}

void r_Conv_VFF::write_origin( const char *keyname, std::ostream &str, const r_Minterval &iv, const unsigned int *order )
{
  r_Dimension i;
  str << keyname << '=' << iv[order[0]].low();
  for (i=1; i<iv.dimension(); i++)
    str << ' ' << iv[order[i]].low();
  str << ";\n";
}

const char *r_Conv_VFF::read_vector( r_Dimension dim, const char *str, double *&vec )
{
  if (dim == 0)
    return NULL;

  vec = new double[dim];
  r_Dimension i;

  for (i=0; i<dim; i++)
  {
    const char *rest;
    vec[i] = strtod(str, (char**)&rest);
    if (str == rest)
      break;
    str = rest;
  }
  if (i < dim)
  {
    delete [] vec;
    vec = NULL;
    return NULL;
  }
  return str;
}

const char *r_Conv_VFF::read_string( const char *str, char *dest, bool allowSpace )
{
  const char *d = str;
  char *b = dest;

  while (*d != ';')
  {
    if ((allowSpace == 1) && (isspace((unsigned int)(*d))))
      break;
    *b++ = *d++;
  }
  *b++ = '\0';
  return d;
}

const char *r_Conv_VFF::get_endian_id( void )
{
  return ((r_Endian::get_endianness() == r_Endian::r_Endian_Big) ? kval_BEndian : kval_LEndian);
}


const char *r_Conv_VFF::get_default_order( r_Dimension dim )
{
  return (dim == 2) ? dfltDataOrder2 : dfltDataOrder3;
}


const char *r_Conv_VFF::get_default_dim_order( r_Dimension dim )
{
  return (dim == 2) ? dfltDimOrder2 : dfltDimOrder3;
}


int r_Conv_VFF::parse_data_order( r_Dimension dim, const char *dstr, unsigned int *order )
{
  unsigned char *mapped = new unsigned char[dim];
  unsigned int i;

  memset(mapped, 0, dim);
  for (i=0; i<dim; i++)
  {
    unsigned int map;

    switch (dstr[i])
    {
      case 'x':
	map = 1; break;
      case 'y':
	map = 2; break;
      case 'z':
	map = 3; break;
      default:
	map = 0; break;
    }

    if ((map == 0) || (mapped[map-1] != 0))
      break;

    order[i] = map-1;
    mapped[map-1] = 1;
    //cout << order[i] << endl;
  }

  delete [] mapped;

  if (i < dim)
  {
    RMInit::logOut << "r_Conv_VFF::parse_data_order(): descriptor " << dstr
		   << " inconsistent, revert to defaults" << endl;

    return parse_data_order(dim, get_default_order(dim), order);
  }
  
  return 0;
}


unsigned int *r_Conv_VFF::get_dimension_order( r_Dimension dim ) const
{
  unsigned int *order = new unsigned int[dim];
  char dimOrder[8];

  // Anders Ledberg: Karolinska reader _always_ uses yzx as dimension order
  if (dimOrderParam == NULL)
    strncpy(dimOrder, get_default_dim_order(dim), 8);
  else
    strncpy(dimOrder, dimOrderParam, 8);

  dimOrder[7] = '\0';
  parse_data_order(dim, dimOrder, order);

  return order;
}


const char *r_Conv_VFF::get_default_endianness( void ) const
{
  return (dfltEndianness == 0) ? kval_BEndian : kval_LEndian;
}


r_convDesc &r_Conv_VFF::convertTo( const char *options ) throw(r_Error)
{
  r_Dimension dim;
  int bits, typeSize;
  char header[1024]; // and ``640k should be enough for everyone''...
  char dataOrder[8];

  dim = desc.srcInterv.dimension();
  if ((dim < 2) || (dim > 3))
  {
    r_Error err(r_Error::r_Error_General);
    throw(err);
  }

  switch (desc.baseType)
  {
    case ctype_bool:
    case ctype_char:
    case ctype_int8:
    case ctype_uint8:
      bits = 8; typeSize = 1; break;
    case ctype_int16:
    case ctype_uint16:
      bits = 16; typeSize = 2; break;
    case ctype_int32:
    case ctype_uint32:
      bits = 32; typeSize = 4; break;
    default:
      r_Error err(r_Error::r_Error_General);
      throw(err);
      break;
  }
  //cout << "TYPE " << desc.baseType << ", SIZE " << typeSize << endl;

  if (options != NULL)
    params->process(options);

  if (dorderParam != NULL)
    strcpy(dataOrder, dorderParam);
  else
    strcpy(dataOrder, get_default_order(dim));

  std::ostrstream memstr(header, 1024);
  
  // order of dimensions in vectors
  unsigned int *dimOrder = get_dimension_order(dim);

  // write header
  memstr << fileMagic << '\n';
  memstr << keywords[vffkey_rank] << '=' << dim << ";\n";
  memstr << keywords[vffkey_type] << '=' << kval_Raster << ";\n";
  memstr << keywords[vffkey_format] << '=' << kval_Slice << ";\n";
  // the dimensions are still ordered like in the VFF file, only the internal
  // linearization differs!
  write_interval(keywords[vffkey_size], memstr, desc.srcInterv, dimOrder, 1);
  write_origin(keywords[vffkey_origin], memstr, desc.srcInterv, dimOrder);
  write_interval(keywords[vffkey_extent], memstr, desc.srcInterv, dimOrder);
  if (dim == 2)
  {
    // FIXME, aspect should be modelled too
    memstr << keywords[vffkey_aspect] << "=1.0 1.0;\n";
  }
  else
  {
    // FIXME, ditto
    memstr << keywords[vffkey_aspect] << "=1.0 1.0 1.0;\n";
  }
  
  // only suypport one band ATM
  memstr << keywords[vffkey_bands] << "=1;\n";
  memstr << keywords[vffkey_bits] << '=' << bits << ";\n";
  memstr << keywords[vffkey_endian] << '=' << get_endian_id() << ";\n";
  memstr << keywords[vffkey_dorder] << '=' << dataOrder << ";\n";
  memstr << '\n' << endOfHeader << '\n' << '\0';

  unsigned long headerSize, dataSize, totalSize;

  headerSize = strlen(header);
  dataSize = desc.srcInterv.cell_count() * typeSize;
  totalSize = headerSize + dataSize;

  if ((desc.dest = (char*)mystore.storage_alloc(headerSize + dataSize)) == NULL)
  {
    r_Error err(r_Error::r_Error_General);
    throw(err);
  }
  memcpy(desc.dest, header, headerSize);

  // treat all dimensions alike thanks to generic iterators
  
  // source iterator, iterate in user order
  r_MiterDirect iter((void*)desc.src, desc.srcInterv, desc.srcInterv, typeSize, 1);
  unsigned int *order, *steps;

  order = new unsigned int[dim];
  steps = new unsigned int[dim];

  for (unsigned int i=0; i<dim; i++)
    steps[i] = 1;
    
  parse_data_order(dim, dataOrder, order);

  // note: dest may not be aligned to a position conforming to its base type,
  // so copy byte-wise.
  unsigned char *dptr = (unsigned char*)(desc.dest + headerSize);
  switch (typeSize)
  {
    case 1:
      {
	while (iter.isDone() == 0)
	{
	  *dptr = *((const unsigned char*)iter.getData(order));
	  iter.iterateUserOrder(order, steps);
	  dptr++;
	}
      }
      break;
    case 2:
      {
	while (iter.isDone() == 0)
	{
	  const unsigned char *sptr = (const unsigned char*)iter.getData(order);
	  dptr[0] = sptr[0];
	  dptr[1] = sptr[1];
	  //cout << iter << ':' << (long)((const char*)sptr-desc.src) << ':' << (unsigned short)((sptr[0] << 8) | (sptr[1])) << ' ';
	  iter.iterateUserOrder(order, steps);
	  dptr+=2;
	}
      }
      break;
    case 4:
      {
	while (iter.isDone() == 0)
	{
	  const unsigned char *sptr = (const unsigned char*)iter.getData(order);
	  dptr[0] = sptr[0];
	  dptr[1] = sptr[1];
	  dptr[2] = sptr[2];
	  dptr[3] = sptr[3];
	  iter.iterateUserOrder(order, steps);
	  dptr+=4;
	}
      }
      break;
    default:
      break;
  }

  delete [] steps;
  delete [] order;
  delete [] dimOrder;
  
  desc.destInterv = r_Minterval(1);
  desc.destInterv << r_Sinterval((r_Range)0, (r_Range)totalSize-1);
  desc.destType = r_Type::get_any_type("char");

  return desc;
}


r_convDesc &r_Conv_VFF::convertFrom( const char *options ) throw(r_Error)
{
  const char *header = desc.src;
  unsigned char *keysRead;
  unsigned int i;
  r_Dimension dim=0;
  int bits, bands;
  double *vecSize, *vecOrigin, *vecValue;
  char endian[32];
  char dataOrder[8];

  if (strncmp(header, fileMagic, strlen(fileMagic)) != 0)
  {
    r_Error err(r_Error::r_Error_General);
    throw(err);
  }

  keysRead = new unsigned char[vffkey_NUMBER];
  memset(keysRead, 0, vffkey_NUMBER);

  header += strlen(fileMagic);
  skip_white(header);

  vecSize = NULL;
  vecOrigin = NULL;
  vecValue = NULL;

  strcpy(endian, get_default_endianness());

  if (options != NULL)
    params->process(options);

  // no order -- check later if one was defined and init it _after_ we know the rank
  dataOrder[0] = '\0';

  do
  {
    if (*header != endOfHeader);
    {
      const char *rest;
      double *vecTemp;

      for (i=0; i<(unsigned int)vffkey_NUMBER; i++)
      {
	if (strncmp(header, keywords[i], strlen(keywords[i])) == 0)
	  break;
      }

      if (i == vffkey_NUMBER)
      {
	// skip unknown keywords
	while ((*header != ';') && (*header != endOfHeader))
	  header++;
	if (*header == ';')
	  header++;
      }
      else
      {
	//cout << "KEY " << keywords[i] << endl;

	keysRead[i] = 1;

	header += strlen(keywords[i]);
	skip_white(header);

	if (*header != '=')
	  break;

	header++;
	skip_white(header);

	rest = header;
	switch ((vff_keyword_e)i)
	{
	  case vffkey_rank:
	    dim = strtol(header, (char**)&rest, 10);
	    if ((rest == header) || (dim < 2) || (dim > 3))
	    {
	      RMInit::logOut << method_convFrom << ": bad rank " << dim << endl;
	      rest = NULL;
	    }
	    break;
	  case vffkey_type:
	    if (strncmp(header, kval_Raster, strlen(kval_Raster)) == 0)
	      rest = header + strlen(kval_Raster);
	    else
	    {
	      RMInit::logOut << method_convFrom << ": bad type" << endl;
	      rest = NULL;
	    }
	    break;
	  case vffkey_format:
	    if (strncmp(header, kval_Slice, strlen(kval_Slice)) == 0)
	      rest = header + strlen(kval_Slice);
	    else
	    {
	      RMInit::logOut << method_convFrom << ": bad format" << endl;
	      rest = NULL;
	    }
	    break;
	  case vffkey_size:
	    rest = read_vector(dim, header, vecSize);
	    break;
	  case vffkey_origin:
	    rest = read_vector(dim, header, vecOrigin);
	    break;
	  case vffkey_extent:
	    // extent just parsed, otherwise ignored
	    rest = read_vector(dim, header, vecTemp);
	    delete [] vecTemp;
	    break;
	  case vffkey_aspect:
	    // FIXME: aspect ignored
	    rest = read_vector(dim, header, vecTemp);
	    delete [] vecTemp;
	    break;
	  case vffkey_bands:
	    bands = strtol(header, (char**)&rest, 10);
	    if ((rest == header) || (bands != 1))
	    {
	      RMInit::logOut << method_convFrom << ": bad number of bands " << bands << endl;
	      rest = NULL;
	    }
	    break;
	  case vffkey_bits:
	    bits = strtol(header, (char**)&rest, 10);
	    if ((rest == header) || ((bits != 8) && (bits != 16) && (bits != 32)))
	    {
	      RMInit::logOut << method_convFrom << ": bad number of bits " << bits << endl;
	      rest = NULL;
	    }
	    break;
	  case vffkey_value:
	    // FIXME: values ignored
	    rest = read_vector(2, header, vecValue);
	    break;
	  case vffkey_endian:
	    rest = read_string(header, endian);
	    break;
	  case vffkey_dorder:
	    rest = read_string(header, dataOrder);
	    break;
	  default:
	    break;
	}
	if (rest == NULL)
	  break;

	header = rest;
	skip_white(header);
	if (*header == ';')
	  header++;
      }
    }
    skip_white(header);
  }
  while (*header != endOfHeader);

  // was there a data order? no ==> init either used-defined or default
  if (dataOrder[0] == '\0')
  {
    if (dorderParam != NULL)
      strcpy(dataOrder, dorderParam);
    else
      strcpy(dataOrder, get_default_order(dim));
  }
  
  //cout << "RANK " << dim << ", BANDS " << bands << ", BITS " << bits << endl;

  // check whether all mandatory keywords are present
  for (i=0; i<(unsigned int)vffkey_value; i++)
  {
    if (keysRead[i] == 0)
    {
      header = NULL;
      break;
    }
  }

  if ((header == NULL) || (*header != endOfHeader))
  {
    // parse error
    RMInit::logOut << method_convFrom << ": PARSE ERROR" << endl;

    delete [] keysRead;

    if (vecSize != NULL)
      delete [] vecSize;
    if (vecOrigin != NULL)
      delete [] vecOrigin;
    if (vecValue != NULL)
      delete [] vecValue;

    r_Error err(r_Error::r_Error_General);
    throw(err);
  }

  // after this instruction, header points to the linefeed
  header++;
  // after this instruction, header points to the data
  header++;

  desc.destInterv = r_Minterval(dim);
  
  // order of dimensions in vectors
  unsigned int *dimOrder = get_dimension_order(dim);
  
  // the order of the dimensions is the same, only the linearization differs
  for (i=0; i<dim; i++)
  {
    // the old method didn't work for high<0 (wrong rounding direction)
    r_Range low, width;
    low = (r_Range)(vecOrigin[i]);
    width = (r_Range)(vecSize[i]);
    //cout << "SIZE " << dimOrder[i] << ": " << width << ", ORG " << low << endl;
    desc.destInterv[dimOrder[i]] = r_Sinterval(low, low+width-1);
  }
  //cout << desc.destInterv << endl;

  delete [] vecOrigin;
  delete [] vecSize;

  int typeSize = (bits>>3);
  unsigned long dataSize = desc.destInterv.cell_count() * typeSize;
  //cout << "Type size " << typeSize << ", dim " << dim << endl;

  if ((desc.dest = (char*)mystore.storage_alloc(dataSize)) == NULL)
  {
    delete [] keysRead;

    if (vecValue != NULL)
      delete [] vecValue;

    r_Error err(r_Error::r_Error_General);
    throw(err);
  }
  
  // treat all dimensions alike

  // must copy byte-by-byte because the source data may not be aligned!
  r_MiterDirect iter(desc.dest, desc.destInterv, desc.destInterv, typeSize, 1);
  unsigned int *order, *steps;
  const unsigned char *sptr = (const unsigned char *)header;

  order = new unsigned int[dim];
  steps = new unsigned int[dim];

  for (i=0; i<dim; i++)
    steps[i] = 1;

  parse_data_order(dim, dataOrder, order);

  switch (typeSize)
  {
    case 1:
      while (iter.isDone() == 0)
      {
	*((r_Char*)iter.getData(order)) = *sptr;
	iter.iterateUserOrder(order, steps);
	sptr++;
      }
      break;
    case 2:
      while (iter.isDone() == 0)
      {
	unsigned char *dptr = (unsigned char*)iter.getData(order);
	dptr[0] = sptr[0];
	dptr[1] = sptr[1];
	//cout << iter << ':' << (long)((char*)dptr - desc.dest) << ':' << (long)((char*)sptr - header) << ':' << (unsigned short)((sptr[0] << 8) | sptr[1]) << ' ';
	iter.iterateUserOrder(order, steps);
	sptr+=2;
      }
      break;
    case 4:
      while (iter.isDone() == 0)
      {
	unsigned char *dptr = (unsigned char*)iter.getData(order);
	dptr[0] = sptr[0];
	dptr[1] = sptr[1];
	dptr[2] = sptr[2];
	dptr[3] = sptr[3];
	iter.iterateUserOrder(order, steps);
	sptr+=4;
      }
      break;
    default:
      break;
  }

  delete [] order;
  delete [] steps;
  delete [] dimOrder;

  switch (typeSize)
  {
    case 1:
      desc.destType = get_external_type(ctype_char);
      break;
    case 2:
      desc.destType = get_external_type(ctype_uint16);
      if (strcmp(endian, get_endian_id()) != 0)
	r_Endian::swap_array(dataSize, (const r_UShort*)desc.dest, (r_UShort*)desc.dest);
      break;
    case 4:
      desc.destType = get_external_type(ctype_uint32);
      if (strcmp(endian, get_endian_id()) != 0)
	r_Endian::swap_array(dataSize, (const r_ULong*)desc.dest, (r_ULong*)desc.dest);
      break;
    default:
      break;
  }

  //desc.destType->print_status();

  if (vecValue != NULL)
    delete [] vecValue;

  delete [] keysRead;

  return desc;
}


const char *r_Conv_VFF::get_name( void ) const
{
  return format_name_vff;
}


r_Data_Format r_Conv_VFF::get_data_format( void ) const
{
  return r_VFF;
}


r_Convertor *r_Conv_VFF::clone( void ) const
{
  return new r_Conv_VFF(desc.src, desc.srcInterv, desc.baseType);
}