summaryrefslogtreecommitdiffstats
path: root/src/H5S.c
blob: c371e4bbfb8eea3942e58246ea8cfcd171b4f2b4 (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
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
/****************************************************************************
* NCSA HDF								   *
* Software Development Group						   *
* National Center for Supercomputing Applications			   *
* University of Illinois at Urbana-Champaign				   *
* 605 E. Springfield, Champaign IL 61820				   *
*									   *
* For conditions of distribution and use, see the accompanying		   *
* hdf/COPYING file.							   *
*									   *
****************************************************************************/

#ifdef RCSID
static char		RcsId[] = "@(#)$Revision$";
#endif

/* $Id$ */

#include <H5private.h>		/* Generic Functions			  */
#include <H5Aprivate.h>		/* Atom Functions		  */
#include <H5Eprivate.h>		/* Error handling		  */
#include <H5MMprivate.h>	/* Memory Management functions		  */
#include <H5Oprivate.h>		/*object headers		  */
#include <H5Sprivate.h>		/* Data-space functions			  */

/* Interface initialization */
#define PABLO_MASK	H5S_mask
#define INTERFACE_INIT	H5S_init_interface
static intn		interface_initialize_g = FALSE;
static herr_t		H5S_init_interface(void);
static void		H5S_term_interface(void);


/*--------------------------------------------------------------------------
NAME
   H5S_init_interface -- Initialize interface-specific information
USAGE
    herr_t H5S_init_interface()
   
RETURNS
   SUCCEED/FAIL
DESCRIPTION
    Initializes any interface-specific data or routines.

--------------------------------------------------------------------------*/
static herr_t
H5S_init_interface(void)
{
    herr_t		    ret_value = SUCCEED;
    FUNC_ENTER(H5S_init_interface, FAIL);

    /* Initialize the atom group for the file IDs */
    if ((ret_value = H5A_init_group(H5_DATASPACE, H5A_DATASPACEID_HASHSIZE,
				    H5S_RESERVED_ATOMS,
				    (herr_t (*)(void *)) H5S_close)) != FAIL) {
	ret_value = H5_add_exit(&H5S_term_interface);
    }
    FUNC_LEAVE(ret_value);
}


/*--------------------------------------------------------------------------
 NAME
    H5S_term_interface
 PURPOSE
    Terminate various H5S objects
 USAGE
    void H5S_term_interface()
 RETURNS
    SUCCEED/FAIL
 DESCRIPTION
    Release the atom group and any other resources allocated.
 GLOBAL VARIABLES
 COMMENTS, BUGS, ASSUMPTIONS
     Can't report errors...
 EXAMPLES
 REVISION LOG
--------------------------------------------------------------------------*/
static void
H5S_term_interface(void)
{
    H5A_destroy_group(H5_DATASPACE);
}

/*-------------------------------------------------------------------------
 * Function:	H5Screate_simple
 *
 * Purpose:	Creates a new simple data space object and opens it for
 *		access. The DIMS argument is the size of the simple dataset
 *		and the MAXDIMS argument is the upper limit on the size of
 *		the dataset.  MAXDIMS may be the null pointer in which case
 *		the upper limit is the same as DIMS.  If an element of
 *		MAXDIMS is H5S_UNLIMITED then the corresponding dimension is
 *		unlimited, otherwise no element of MAXDIMS should be smaller
 *		than the corresponding element of DIMS.
 *
 * Return:	Success:	The ID for the new simple data space object.
 *
 *		Failure:	FAIL
 *
 * Errors:
 *
 * Programmer:	Quincey Koziol
 *		Tuesday, January  27, 1998
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
hid_t
H5Screate_simple(int rank, const size_t *dims, const size_t *maxdims)
{
    H5S_t	*ds = NULL;
    hid_t	ret_value = FAIL;
    int		i;

    FUNC_ENTER(H5Screate, FAIL);

    /* Check arguments */
    if (rank<0) {
	HRETURN_ERROR (H5E_ARGS, H5E_BADVALUE, FAIL,
		       "dimensionality cannot be negative");
    }
    if (!dims) {
	HRETURN_ERROR (H5E_ARGS, H5E_BADVALUE, FAIL,
		       "no dimensions specified");
    }
    if (maxdims) {
	for (i=0; i<rank; i++) {
	    if (H5S_UNLIMITED!=maxdims[i] && maxdims[i]<dims[i]) {
		HRETURN_ERROR (H5E_ARGS, H5E_BADVALUE, FAIL,
			       "maxdims is smaller than dims");
	    }
	}
    }

    /* Create a new data space */
    ds = H5MM_xcalloc(1, sizeof(H5S_t));
#ifdef LATER /* QAK */
    if(rank>0)	/* for creating simple dataspace */
      {
#endif /* LATER */
	ds->type = H5S_SIMPLE;
	ds->hslab_def = FALSE;	  /* no hyperslab defined currently */

	/* Initialize rank and dimensions */
	ds->u.simple.rank = rank;

	ds->u.simple.size = H5MM_xcalloc(1, rank*sizeof(size_t));
	HDmemcpy(ds->u.simple.size, dims, rank*sizeof(size_t));

	if (maxdims) {
	    ds->u.simple.max = H5MM_xcalloc(1, rank*sizeof(size_t));
	    HDmemcpy (ds->u.simple.max, maxdims, rank*sizeof(size_t));
	}
#ifdef LATER /* QAK */
      } /* end if */
    else /* rank==0, for scalar data space */
      {
	ds->type = H5S_SCALAR;
      } /* end else */
#endif /* LATER */
    
    /* Register the new data space and get an ID for it */
    if ((ret_value = H5A_register(H5_DATASPACE, ds)) < 0) {
	HGOTO_ERROR(H5E_ATOM, H5E_CANTREGISTER, FAIL,
		    "unable to register data space for ID");
    }

 done:
    if (ret_value < 0) {
	H5MM_xfree(ds);
    }
    FUNC_LEAVE(ret_value);
}

/*-------------------------------------------------------------------------
 * Function:	H5Sclose
 *
 * Purpose:	Release access to a data space object.
 *
 * Return:	Success:	SUCCEED
 *
 *		Failure:	FAIL
 *
 * Errors:
 *
 * Programmer:	Robb Matzke
 *		Tuesday, December  9, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
herr_t
H5Sclose(hid_t space_id)
{
    FUNC_ENTER(H5Sclose, FAIL);

    /* Check args */
    if (H5_DATASPACE != H5A_group(space_id) ||
	NULL == H5A_object(space_id)) {
	HRETURN_ERROR(H5E_ARGS, H5E_BADTYPE, FAIL, "not a data space");
    }
    /* When the reference count reaches zero the resources are freed */
    if (H5A_dec_ref(space_id) < 0) {
	HRETURN_ERROR(H5E_ATOM, H5E_BADATOM, FAIL, "problem freeing id");
    }
    FUNC_LEAVE(SUCCEED);
}

/*-------------------------------------------------------------------------
 * Function:	H5S_close
 *
 * Purpose:	Releases all memory associated with a data space.
 *
 * Return:	Success:	SUCCEED
 *
 *		Failure:	FAIL
 *
 * Programmer:	Robb Matzke
 *		Tuesday, December  9, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
herr_t
H5S_close(H5S_t *ds)
{
    FUNC_ENTER(H5S_close, FAIL);

    assert(ds);

    switch (ds->type) {
    case H5S_SCALAR:
	/*void */
	break;

    case H5S_SIMPLE:
	H5MM_xfree(ds->u.simple.size);
	H5MM_xfree(ds->u.simple.max);
	H5MM_xfree(ds->u.simple.perm);
	break;

    case H5S_COMPLEX:
	/* nothing */
	break;

    default:
	assert("unknown data space type" && 0);
	break;
    }
    if(ds->hslab_def==TRUE) {
	H5MM_xfree(ds->h.start);
	H5MM_xfree(ds->h.count);
	H5MM_xfree(ds->h.stride);
    } /* end if */
    H5MM_xfree(ds);

    FUNC_LEAVE(SUCCEED);
}

/*-------------------------------------------------------------------------
 * Function:	H5Scopy
 *
 * Purpose:	Copies a dataspace.
 *
 * Return:	Success:	ID of the new dataspace
 *
 *		Failure:	FAIL
 *
 * Programmer:	Robb Matzke
 *		Friday, January 30, 1998
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
hid_t
H5Scopy (hid_t space_id)
{
    H5S_t	*src = NULL;
    H5S_t	*dst = NULL;
    hid_t	ret_value = FAIL;
    
    FUNC_ENTER (H5Scopy, FAIL);

    /* Check args */
    if (H5_DATASPACE!=H5A_group (space_id) ||
	NULL==(src=H5A_object (space_id))) {
	HRETURN_ERROR (H5E_ARGS, H5E_BADTYPE, FAIL, "not a data space");
    }

    /* Copy */
    if (NULL==(dst=H5S_copy (src))) {
	HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, FAIL,
		       "unable to copy data space");
    }

    /* Atomize */
    if ((ret_value=H5A_register (H5_DATASPACE, dst))<0) {
	HRETURN_ERROR (H5E_ATOM, H5E_CANTREGISTER, FAIL,
		       "unable to register data space atom");
    }

    FUNC_LEAVE (ret_value);
}


/*-------------------------------------------------------------------------
 * Function:	H5S_copy
 *
 * Purpose:	Copies a data space.
 *
 * Return:	Success:	A pointer to a new copy of SRC
 *
 *		Failure:	NULL
 *
 * Programmer:	Robb Matzke
 *		Thursday, December  4, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
H5S_t *
H5S_copy(const H5S_t *src)
{
    H5S_t		   *dst = NULL;
    int			    i;

    FUNC_ENTER(H5S_copy, NULL);

    dst = H5MM_xmalloc(sizeof(H5S_t));
    *dst = *src;

    switch (dst->type) {
    case H5S_SCALAR:
	/*void */
	break;

    case H5S_SIMPLE:
	if (dst->u.simple.size) {
	    dst->u.simple.size = H5MM_xmalloc(dst->u.simple.rank *
					      sizeof(dst->u.simple.size[0]));
	    for (i = 0; i < dst->u.simple.rank; i++) {
		dst->u.simple.size[i] = src->u.simple.size[i];
	    }
	}
	if (dst->u.simple.max) {
	    dst->u.simple.max = H5MM_xmalloc(dst->u.simple.rank *
					     sizeof(dst->u.simple.max[0]));
	    for (i = 0; i < dst->u.simple.rank; i++) {
		dst->u.simple.max[i] = src->u.simple.max[i];
	    }
	}
	if (dst->u.simple.perm) {
	    dst->u.simple.perm = H5MM_xmalloc(dst->u.simple.rank *
					      sizeof(dst->u.simple.perm[0]));
	    for (i = 0; i < dst->u.simple.rank; i++) {
		dst->u.simple.perm[i] = src->u.simple.perm[i];
	    }
	}
	break;

    case H5S_COMPLEX:
	/*void */
	break;

    default:
	assert("unknown data space type" && 0);
	break;
    }

    FUNC_LEAVE(dst);
}

/*-------------------------------------------------------------------------
 * Function:	H5Sget_npoints
 *
 * Purpose:	Determines how many data points a data set has.
 *
 * Return:	Success:	Number of data points in the data set.
 *
 *		Failure:	0
 *
 * Programmer:	Robb Matzke
 *		Tuesday, December  9, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
size_t
H5Sget_npoints(hid_t space_id)
{
    H5S_t		   *ds = NULL;
    size_t		    ret_value = 0;

    FUNC_ENTER(H5Sget_npoints, 0);

    /* Check args */
    if (H5_DATASPACE != H5A_group(space_id) ||
	NULL == (ds = H5A_object(space_id))) {
	HRETURN_ERROR(H5E_ARGS, H5E_BADTYPE, 0, "not a data space");
    }
    ret_value = H5S_get_npoints(ds);

    FUNC_LEAVE(ret_value);
}


/*-------------------------------------------------------------------------
 * Function:	H5S_get_npoints
 *
 * Purpose:	Determines how many data points a data set has.
 *
 * Return:	Success:	Number of data points in the data set.
 *
 *		Failure:	0
 *
 * Programmer:	Robb Matzke
 *		Tuesday, December  9, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
size_t
H5S_get_npoints(const H5S_t *ds)
{
    size_t		    ret_value = 0;
    intn		    i;

    FUNC_ENTER(H5S_get_npoints, 0);

    /* check args */
    assert(ds);

    switch (ds->type) {
    case H5S_SCALAR:
	ret_value = 1;
	break;

    case H5S_SIMPLE:
	/*
	 * Count the elements selected by the hypeslab if there is one,
	 * otherwise count all the elements.
	 */
	if (ds->hslab_def) {
	    for (ret_value=1, i=0; i<ds->u.simple.rank; i++) {
		ret_value *= ds->h.count[i];
	    }
	} else {
	    for (ret_value=1, i=0; i<ds->u.simple.rank; i++) {
		ret_value *= ds->u.simple.size[i];
	    }
	}
	break;

    case H5S_COMPLEX:
	HRETURN_ERROR(H5E_DATASPACE, H5E_UNSUPPORTED, 0,
		      "complex data spaces are not supported yet");

    default:
	assert("unknown data space class" && 0);
	HRETURN_ERROR(H5E_DATASPACE, H5E_UNSUPPORTED, 0,
		      "internal error (unknown data space class)");
    }

    FUNC_LEAVE(ret_value);
}

/*-------------------------------------------------------------------------
 * Function:	H5S_get_npoints_max
 *
 * Purpose:	Determines the maximum number of data points a data space may
 *		have.  If the `max' array is null then the maximum number of
 *		data points is the same as the current number of data points
 *		without regard to the hyperslab.  If any element of the `max'
 *		array is zero then the maximum possible size is returned.
 *
 * Return:	Success:	Maximum number of data points the data space
 *				may have.
 *
 *		Failure:	0
 *
 * Programmer:	Robb Matzke
 *		Tuesday, December  9, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
size_t
H5S_get_npoints_max(const H5S_t *ds)
{
    size_t		    ret_value = 0;
    intn		    i;

    FUNC_ENTER(H5S_get_npoints_max, 0);

    /* check args */
    assert(ds);

    switch (ds->type) {
    case H5S_SCALAR:
	ret_value = 1;
	break;

    case H5S_SIMPLE:
	if (ds->u.simple.max) {
	    for (ret_value=1, i=0; i<ds->u.simple.rank; i++) {
		if (H5S_UNLIMITED==ds->u.simple.max[i]) {
		    ret_value = (size_t)(-1L);
		    break;
		} else {
		    ret_value *= ds->u.simple.max[i];
		}
	    }
	} else {
	    for (ret_value=1, i=0; i<ds->u.simple.rank; i++) {
		ret_value *= ds->u.simple.size[i];
	    }
	}
	break;

    case H5S_COMPLEX:
	HRETURN_ERROR(H5E_DATASPACE, H5E_UNSUPPORTED, 0,
		      "complex data spaces are not supported yet");

    default:
	assert("unknown data space class" && 0);
	HRETURN_ERROR(H5E_DATASPACE, H5E_UNSUPPORTED, 0,
		      "internal error (unknown data space class)");
    }

    FUNC_LEAVE(ret_value);
}


/*-------------------------------------------------------------------------
 * Function:	H5Sget_ndims
 *
 * Purpose:	Determines the dimensionality of a data space.
 *
 * Return:	Success:	The number of dimensions in a data space.
 *
 *		Failure:	FAIL
 *
 * Programmer:	Robb Matzke
 *		Thursday, December 11, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
int
H5Sget_ndims(hid_t space_id)
{
    H5S_t		   *ds = NULL;
    intn		   ret_value = 0;

    FUNC_ENTER(H5Sget_ndims, FAIL);

    /* Check args */
    if (H5_DATASPACE != H5A_group(space_id) ||
	NULL == (ds = H5A_object(space_id))) {
	HRETURN_ERROR(H5E_ARGS, H5E_BADTYPE, FAIL, "not a data space");
    }
    ret_value = H5S_get_ndims(ds);

    FUNC_LEAVE(ret_value);
}

/*-------------------------------------------------------------------------
 * Function:	H5S_get_ndims
 *
 * Purpose:	Returns the number of dimensions in a data space.
 *
 * Return:	Success:	Non-negative number of dimensions.  Zero
 *				implies a scalar.
 *
 *		Failure:	FAIL
 *
 * Programmer:	Robb Matzke
 *		Thursday, December 11, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
intn
H5S_get_ndims(const H5S_t *ds)
{
    intn		    ret_value = FAIL;

    FUNC_ENTER(H5S_get_ndims, FAIL);

    /* check args */
    assert(ds);

    switch (ds->type) {
    case H5S_SCALAR:
	ret_value = 0;
	break;

    case H5S_SIMPLE:
	ret_value = ds->u.simple.rank;
	break;

    case H5S_COMPLEX:
	HRETURN_ERROR(H5E_DATASPACE, H5E_UNSUPPORTED, FAIL,
		      "complex data spaces are not supported yet");

    default:
	assert("unknown data space class" && 0);
	HRETURN_ERROR(H5E_DATASPACE, H5E_UNSUPPORTED, FAIL,
		      "internal error (unknown data space class)");
    }

    FUNC_LEAVE(ret_value);
}

/*-------------------------------------------------------------------------
 * Function:	H5Sget_dims
 *
 * Purpose:	Returns the size in each dimension of a data space DS through
 *		the DIMS argument.
 *
 * Return:	Success:	Number of dimensions, the same value as
 *				returned by H5Sget_ndims().
 *
 *		Failure:	FAIL
 *
 * Programmer:	Robb Matzke
 *		Thursday, December 11, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
int
H5Sget_dims(hid_t space_id, size_t dims[]/*out*/)
{

    H5S_t		   *ds = NULL;
    intn		   ret_value = 0;

    FUNC_ENTER(H5Sget_dims, FAIL);

    /* Check args */
    if (H5_DATASPACE != H5A_group(space_id) ||
	NULL == (ds = H5A_object(space_id))) {
	HRETURN_ERROR(H5E_ARGS, H5E_BADTYPE, FAIL, "not a data space");
    }
    if (!dims) {
	HRETURN_ERROR(H5E_ARGS, H5E_BADVALUE, FAIL, "no output buffer");
    }
    ret_value = H5S_get_dims(ds, dims, NULL);

    FUNC_LEAVE(ret_value);
}

/*-------------------------------------------------------------------------
 * Function:	H5S_get_dims
 *
 * Purpose:	Returns the size in each dimension of a data space.  This
 *		function may not be meaningful for all types of data spaces.
 *
 * Return:	Success:	Number of dimensions.  Zero implies scalar.
 *
 *		Failure:	FAIL
 *
 * Programmer:	Robb Matzke
 *		Thursday, December 11, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
intn
H5S_get_dims(const H5S_t *ds, size_t dims[], size_t max_dims[])
{
    intn		ret_value = FAIL;
    intn		i;

    FUNC_ENTER(H5S_get_dims, FAIL);

    /* check args */
    assert(ds);
    assert(dims);

    switch (ds->type) {
    case H5S_SCALAR:
	ret_value = 0;
	break;

    case H5S_SIMPLE:
	ret_value = ds->u.simple.rank;
	for (i=0; i<ret_value; i++) {
	    if (dims) dims[i] = ds->u.simple.size[i];
	    if (max_dims) {
		if (ds->u.simple.max) {
		    max_dims[i] = ds->u.simple.max[i];
		} else {
		    max_dims[i] = ds->u.simple.size[i];
		}
	    }
	}
	break;

    case H5S_COMPLEX:
	HRETURN_ERROR(H5E_DATASPACE, H5E_UNSUPPORTED, FAIL,
		      "complex data spaces are not supported yet");

    default:
	assert("unknown data space class" && 0);
	HRETURN_ERROR(H5E_DATASPACE, H5E_UNSUPPORTED, FAIL,
		      "internal error (unknown data space class)");
    }

    FUNC_LEAVE(ret_value);
}

/*-------------------------------------------------------------------------
 * Function:	H5S_modify
 *
 * Purpose:	Updates a data space by writing a message to an object
 *		header.
 *
 * Return:	Success:	SUCCEED
 *
 *		Failure:	FAIL
 *
 * Programmer:	Robb Matzke
 *		Tuesday, December  9, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
herr_t
H5S_modify(H5G_entry_t *ent, const H5S_t *ds)
{
    FUNC_ENTER(H5S_modify, FAIL);

    assert(ent);
    assert(ds);

    switch (ds->type) {
    case H5S_SCALAR:
	HRETURN_ERROR(H5E_DATASPACE, H5E_UNSUPPORTED, FAIL,
		      "scalar data spaces are not implemented yet");

    case H5S_SIMPLE:
	if (H5O_modify(ent, H5O_SDSPACE, 0, 0, &(ds->u.simple)) < 0) {
	    HRETURN_ERROR(H5E_DATASPACE, H5E_CANTINIT, FAIL,
			  "can't update simple data space message");
	}
	break;

    case H5S_COMPLEX:
	HRETURN_ERROR(H5E_DATASPACE, H5E_UNSUPPORTED, FAIL,
		      "complex data spaces are not implemented yet");

    default:
	assert("unknown data space class" && 0);
	break;
    }

    FUNC_LEAVE(SUCCEED);
}

/*-------------------------------------------------------------------------
 * Function:	H5S_read
 *
 * Purpose:	Reads the data space from an object header.
 *
 * Return:	Success:	Pointer to a new data space.
 *
 *		Failure:	NULL
 *
 * Programmer:	Robb Matzke
 *		Tuesday, December  9, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
H5S_t *
H5S_read(H5F_t *f, H5G_entry_t *ent)
{
    H5S_t		   *ds = NULL;

    FUNC_ENTER(H5S_read, NULL);

    /* check args */
    assert(f);
    assert(ent);

    ds = H5MM_xcalloc(1, sizeof(H5S_t));

    if (H5O_read(ent, H5O_SDSPACE, 0, &(ds->u.simple))) {
	ds->type = H5S_SIMPLE;

    } else {
	ds->type = H5S_SCALAR;
    }

    FUNC_LEAVE(ds);
}

/*-------------------------------------------------------------------------
 * Function:	H5S_cmp
 *
 * Purpose:	Compares two data spaces.
 *
 * Return:	Success:	0 if DS1 and DS2 are the same.
 *				<0 if DS1 is less than DS2.
 *				>0 if DS1 is greater than DS2.
 *
 *		Failure:	0, never fails
 *
 * Programmer:	Robb Matzke
 *		Wednesday, December 10, 1997
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
intn
H5S_cmp(const H5S_t *ds1, const H5S_t *ds2)
{
    intn		    i;

    FUNC_ENTER(H5S_cmp, 0);

    /* check args */
    assert(ds1);
    assert(ds2);

    /* compare */
    if (ds1->type < ds2->type)
	HRETURN(-1);
    if (ds1->type > ds2->type)
	HRETURN(1);

    switch (ds1->type) {
    case H5S_SIMPLE:
	if (ds1->u.simple.rank < ds2->u.simple.rank)
	    HRETURN(-1);
	if (ds1->u.simple.rank > ds2->u.simple.rank)
	    HRETURN(1);

	for (i = 0; i < ds1->u.simple.rank; i++) {
	    if (ds1->u.simple.size[i] < ds2->u.simple.size[i])
		HRETURN(-1);
	    if (ds1->u.simple.size[i] > ds2->u.simple.size[i])
		HRETURN(1);
	}

	/* don't compare max dimensions */

	for (i = 0; i < ds1->u.simple.rank; i++) {
	    if ((ds1->u.simple.perm ? ds1->u.simple.perm[i] : i) <
		(ds2->u.simple.perm ? ds2->u.simple.perm[i] : i))
		HRETURN(-1);
	    if ((ds1->u.simple.perm ? ds2->u.simple.perm[i] : i) >
		(ds2->u.simple.perm ? ds2->u.simple.perm[i] : i))
		HRETURN(1);
	}

	/* Check if we should compare hyperslab definitions */
	if(ds1->hslab_def==TRUE && ds2->hslab_def==TRUE) {
	    for (i = 0; i < ds1->u.simple.rank; i++) {
		if (ds1->h.start[i] < ds2->h.start[i])
		    HRETURN(-1);
		if (ds1->h.start[i] > ds2->h.start[i])
		    HRETURN(1);
		if (ds1->h.count[i] < ds2->h.count[i])
		    HRETURN(-1);
		if (ds1->h.count[i] > ds2->h.count[i])
		    HRETURN(1);
		if (ds1->h.stride[i] < ds2->h.stride[i])
		    HRETURN(-1);
		if (ds1->h.stride[i] > ds2->h.stride[i])
		    HRETURN(1);
	    }
	} else {
	    if(ds1->hslab_def!=ds2->hslab_def)
		HRETURN(ds1->hslab_def==TRUE ? 1 : -1);
	}

	break;

    default:
	assert("not implemented yet" && 0);
    }

    FUNC_LEAVE(0);
}


/*--------------------------------------------------------------------------
 NAME
    H5S_is_simple
 PURPOSE
    Check if a dataspace is simple (internal)
 USAGE
    hbool_t H5S_is_simple(sdim)
	H5S_t *sdim;		IN: Pointer to dataspace object to query
 RETURNS
    TRUE/FALSE/FAIL
 DESCRIPTION
	This function determines the if a dataspace is "simple". ie. if it
    has orthogonal, evenly spaced dimensions.
--------------------------------------------------------------------------*/
hbool_t
H5S_is_simple(const H5S_t *sdim)
{
    hbool_t		    ret_value = FAIL;

    FUNC_ENTER(H5S_is_simple, FAIL);

    /* Check args and all the boring stuff. */
    assert(sdim);
    ret_value = sdim->type == H5S_SIMPLE ? TRUE : FALSE;      /* Currently all dataspaces are simple, but check anyway */

    FUNC_LEAVE(ret_value);
}


/*--------------------------------------------------------------------------
 NAME
    H5Sis_simple
 PURPOSE
    Check if a dataspace is simple
 USAGE
    hbool_t H5Sis_simple(sid)
	hid_t sid;	      IN: ID of dataspace object to query
 RETURNS
    TRUE/FALSE/FAIL
 DESCRIPTION
	This function determines the if a dataspace is "simple". ie. if it
    has orthogonal, evenly spaced dimensions.
--------------------------------------------------------------------------*/
hbool_t 
H5Sis_simple(hid_t sid)
{
    H5S_t		   *space = NULL;	/* dataspace to modify */
    hbool_t		    ret_value = FAIL;

    FUNC_ENTER(H5Sis_simple, FAIL);

    /* Check args and all the boring stuff. */
    if ((space = H5A_object(sid)) == NULL)
	HGOTO_ERROR(H5E_ATOM, H5E_BADATOM, FAIL, "not a data space");

    ret_value = H5S_is_simple(space);

  done:
    if (ret_value == FAIL) {   /* Error condition cleanup */

    }				/* end if */
    /* Normal function cleanup */
    FUNC_LEAVE(ret_value);
}


/*--------------------------------------------------------------------------
 NAME
    H5Sset_space
 PURPOSE
    Determine the size of a dataspace
 USAGE
    herr_t H5Sset_space(sid, rank, dims)
	hid_t sid;	      IN: Dataspace object to query
	intn rank;	      IN: # of dimensions for the dataspace
	const size_t *dims;   IN: Size of each dimension for the dataspace
 RETURNS
    SUCCEED/FAIL
 DESCRIPTION
	This function sets the number and size of each dimension in the
    dataspace.	Setting RANK to a value of zero allows scalar objects to be
    created.  Dimensions are specified from slowest to fastest changing in the
    DIMS array (i.e. 'C' order).  Setting the size of a dimension to zero
    indicates that the dimension is of unlimited size and should be allowed to
    expand.  Currently, only the first dimension in the array (the slowest) may
    be unlimited in size.
--------------------------------------------------------------------------*/
herr_t
H5Sset_space(hid_t sid, int rank, const size_t *dims)
{
    H5S_t		   *space = NULL;	/* dataspace to modify */
    intn		    u;	/* local counting variable */
    herr_t		    ret_value = SUCCEED;

    FUNC_ENTER(H5Sset_space, FAIL);

    /* Check args */
    if ((space = H5A_object(sid)) == NULL)
	HRETURN_ERROR(H5E_ATOM, H5E_BADATOM, FAIL, "not a data space");
    if (rank > 0 && dims == NULL)
	HRETURN_ERROR(H5E_ARGS, H5E_BADVALUE, FAIL, "no dimensions specified");
    if (rank<0)
	HRETURN_ERROR (H5E_ARGS, H5E_BADVALUE, FAIL, "invalid rank");
    if (dims) {
	for (u=0; u<rank; u++) {
	    if (dims[u]<=0) {
		HRETURN_ERROR (H5E_ARGS, H5E_BADVALUE, FAIL,
			       "invalid dimension size");
	    }
	}
    }

    /* shift out of the previous state to a "simple" dataspace */
    switch (space->type) {
    case H5S_SCALAR:
    case H5S_SIMPLE:
	/* do nothing */
	break;

    case H5S_COMPLEX:
	/*
	 * eventually this will destroy whatever "complex" dataspace info
	 * is retained, right now it's an error
	 */
	/* Fall through to report error */

    default:
	HRETURN_ERROR(H5E_DATASPACE, H5E_BADVALUE, FAIL,
		      "unknown data space class");
    }
    space->type = H5S_SIMPLE;

    /* Reset hyperslab definition, if one is defined */
    if(space->hslab_def==TRUE) {
	H5MM_xfree(space->h.start);
	H5MM_xfree(space->h.count);
	H5MM_xfree(space->h.stride);
	space->hslab_def=FALSE;
    }

    if (rank == 0) {		/* scalar variable */
	space->type = H5S_SCALAR;
	space->u.simple.rank = 0;	/* set to scalar rank */
	if (space->u.simple.size != NULL)
	    space->u.simple.size = H5MM_xfree(space->u.simple.size);
	if (space->u.simple.max != NULL)
	    space->u.simple.max = H5MM_xfree(space->u.simple.max);
	if (space->u.simple.perm != NULL)
	    space->u.simple.max = H5MM_xfree(space->u.simple.perm);
    } else {
	/* Free the old space for now */
	if (space->u.simple.size != NULL)
	    space->u.simple.size = H5MM_xfree(space->u.simple.size);
	if (space->u.simple.max != NULL)
	    space->u.simple.max = H5MM_xfree(space->u.simple.max);
	if (space->u.simple.perm != NULL)
	    space->u.simple.perm = H5MM_xfree(space->u.simple.perm);

	/* Set the rank and copy the dims */
	space->u.simple.rank = rank;
	space->u.simple.size = H5MM_xcalloc(rank, sizeof(size_t));
	HDmemcpy(space->u.simple.size, dims, sizeof(size_t) * rank);

    }
    FUNC_LEAVE(ret_value);
}

/*--------------------------------------------------------------------------
 NAME
    H5Sset_hyperslab
 PURPOSE
    Select a hyperslab from a simple dataspace
 USAGE
    herr_t H5Sset_hyperslab(sid, start, count, stride)
	hid_t sid;	      IN: Dataspace object to select hyperslab from
	const int *start;  IN: Starting location for hyperslab to select
	const size_t *count;  IN: Number of elements in hyperslab
	const size_t *stride; IN: Packing of elements in hyperslab
 RETURNS
    SUCCEED/FAIL
 DESCRIPTION
	This function selects a hyperslab from a simple dataspace.  The stride
    array may be used to sub-sample the hyperslab chosen, a value of 1 in each
    position of the stride array selects contiguous elements in the array,
    a value of 2 selects every other element, etc.  If the stride parameter is
    set to NULL, a contiguous hyperslab is chosen.  The values in the start and
    count arrays may be negative, to allow for selecting hyperslabs in chunked
    datasets which extend in arbitrary directions.
--------------------------------------------------------------------------*/
herr_t
H5Sset_hyperslab(hid_t sid, const int *start, const size_t *count, const size_t *stride)
{
    H5S_t		   *space = NULL;	/* dataspace to modify */
    size_t		   *tmp_stride=NULL;	/* temp. copy of stride */
    intn		    u;	/* local counting variable */
    herr_t		    ret_value = SUCCEED;

    FUNC_ENTER(H5Sset_hyperslab, FAIL);

    /* Get the object */
    if (H5_DATASPACE != H5A_group(sid) || (space = H5A_object(sid)) == NULL)
	HGOTO_ERROR(H5E_ATOM, H5E_BADATOM, FAIL, "not a data space");
    if (start == NULL || count==NULL)
	HGOTO_ERROR(H5E_ARGS, H5E_BADVALUE, FAIL,
		    "invalid hyperslab selected");

    /* We can't modify other types of dataspaces currently, so error out */
    if (space->type!=H5S_SIMPLE)
	HGOTO_ERROR(H5E_DATASPACE, H5E_BADVALUE, FAIL,
		    "unknown dataspace type");

    /* Set up stride values for later use */
    tmp_stride= H5MM_xmalloc(space->u.simple.rank*sizeof(tmp_stride[0]));
    for (u=0; u<space->u.simple.rank; u++) {
	tmp_stride[u] = stride ? stride[u] : 1;
    }

    /* Range check arguments */
    for (u=0; u<space->u.simple.rank; u++) {
	if (start[u]<0 || start[u]>=space->u.simple.size[u]) {
	    HGOTO_ERROR(H5E_DATASPACE, H5E_BADRANGE, FAIL,
			"hyperslab bounds out of range");
	}
	if (start[u]<0 ||
	    start[u]+(count[u]*tmp_stride[u])>space->u.simple.size[u]) {
	    HGOTO_ERROR(H5E_DATASPACE, H5E_BADRANGE, FAIL,
			"hyperslab bounds out of range");
	}
    }

    /* Allocate space for the hyperslab information */
    if (NULL==space->h.start) {
	space->h.start= H5MM_xcalloc(space->u.simple.rank,sizeof(intn));
	space->h.count= H5MM_xcalloc(space->u.simple.rank,sizeof(size_t));
	space->h.stride= H5MM_xcalloc(space->u.simple.rank,sizeof(size_t));
    }

    /* Build hyperslab */
    for(u=0; u<space->u.simple.rank; u++) {
	space->h.start[u] = start[u];
	space->h.count[u] = count[u];
	space->h.stride[u] = tmp_stride[u];
    }
    space->hslab_def=TRUE;

done:
    if (ret_value == FAIL) {	/* Error condition cleanup */

    }				/* end if */

    /* Normal function cleanup */
    H5MM_xfree(tmp_stride);
    FUNC_LEAVE(ret_value);
}

/*-------------------------------------------------------------------------
 * Function:	H5Sget_hyperslab
 *
 * Purpose:	Retrieves information about the hyperslab from a simple data
 *		space.	If no hyperslab has been defined then the hyperslab
 *		is the same as the entire array.
 *
 * Return:	Success:	Hyperslab dimensionality.
 *
 *		Failure:	FAIL
 *
 * Programmer:	Robb Matzke
 *		Wednesday, January 28, 1998
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
int
H5Sget_hyperslab (hid_t sid, int offset[]/*out*/, size_t size[]/*out*/,
		  size_t stride[]/*out*/)
{
    const H5S_t	*ds = NULL;
    intn	ret_value = FAIL;
    
    FUNC_ENTER (H5Sget_hyperslab, FAIL);

    /* Check args */
    if (H5_DATASPACE!=H5A_group (sid) || NULL==(ds=H5A_object (sid))) {
	HRETURN_ERROR (H5E_ARGS, H5E_BADTYPE, FAIL, "not a data space");
    }

    /* Get hyperslab info */
    if ((ret_value=H5S_get_hyperslab (ds, offset, size, stride))<0) {
	HRETURN_ERROR (H5E_DATASPACE, H5E_CANTINIT, FAIL,
		       "unable to retrieve hyperslab information");
    }

    FUNC_LEAVE (ret_value);
}

/*-------------------------------------------------------------------------
 * Function:	H5S_get_hyperslab
 *
 * Purpose:	Retrieves information about the hyperslab from a simple data
 *		space.	If no hyperslab has been defined then the hyperslab
 *		is the same as the entire array.
 *
 * Return:	Success:	Hyperslab dimensionality.
 *
 *		Failure:	FAIL
 *
 * Programmer:	Robb Matzke
 *		Wednesday, January 28, 1998
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
intn
H5S_get_hyperslab (const H5S_t *ds, int offset[]/*out*/,
		   size_t size[]/*out*/, size_t stride[]/*out*/)
{
    intn		i;
    intn		ret_value = FAIL;
    
    FUNC_ENTER (H5S_get_hyperslab, FAIL);

    /* Check args */
    assert (ds);
    switch (ds->type) {
    case H5S_SCALAR:
	break;

    case H5S_SIMPLE:
	if (ds->hslab_def) {
	    for (i=0; i<ds->u.simple.rank; i++) {
		if (offset) offset[i] = ds->h.start[i];
		if (size) size[i] = ds->h.count[i];
		if (stride) stride[i] = ds->h.stride[i];
	    }
	} else {
	    for (i=0; i<ds->u.simple.rank; i++) {
		if (offset) offset[i] = 0;
		if (size) size[i] = ds->u.simple.size[i];
		if (stride) stride[i] = 1;
	    }
	}
	ret_value = ds->u.simple.rank;
	break;

    case H5S_COMPLEX:	/*fall through*/
    default:
	HRETURN_ERROR (H5E_DATASPACE, H5E_UNSUPPORTED, FAIL,
		       "hyperslabs not supported for this type of space");
    }

    FUNC_LEAVE (ret_value);
}


/*-------------------------------------------------------------------------
 * Function:	H5S_find
 *
 * Purpose:	Given two data spaces (MEM_SPACE and FILE_SPACE) this
 *		function locates the data space conversion functions and
 *		initializes CONV to point to them.  The CONV contains
 *		function pointers for converting in either direction.
 *
 * Return:	Success:	Pointer to a data space conversion callback
 *				list.
 *
 *		Failure:	NULL
 *
 * Programmer:	Robb Matzke
 *		Wednesday, January 21, 1998
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
const H5S_conv_t *
H5S_find (const H5S_t *mem_space, const H5S_t *file_space)
{
    static H5S_conv_t		_conv;
    static const H5S_conv_t	*conv = NULL;
    
    FUNC_ENTER (H5S_find, NULL);

    /* Check args */
    assert (mem_space && H5S_SIMPLE==mem_space->type);
    assert (file_space && H5S_SIMPLE==file_space->type);

    /*
     * We can't do conversion if the source and destination select a
     * different number of data points.
     */
    if (H5S_get_npoints (mem_space) != H5S_get_npoints (file_space)) {
	HRETURN_ERROR (H5E_DATASPACE, H5E_BADRANGE, NULL,
		       "memory and file data spaces are different sizes");
    }

    /*
     * Initialize pointers.  This will eventually be a table lookup based
     * on the source and destination data spaces, similar to H5T_find(), but
     * for now we only support simple data spaces.
     */
    if (!conv) {
	_conv.init = H5S_simp_init;
	_conv.fgath = H5S_simp_fgath;
	_conv.mscat = H5S_simp_mscat;
	_conv.mgath = H5S_simp_mgath;
	_conv.fscat = H5S_simp_fscat;
	_conv.read = H5S_simp_read;
	_conv.write = H5S_simp_write;
	conv = &_conv;
    }
    
    FUNC_LEAVE (conv);
}

/*-------------------------------------------------------------------------
 * Function:	H5S_extend
 *
 * Purpose:	Extend the dimensions of a data space.
 *
 * Return:	Success:	Number of dimensions whose size increased.
 *
 *		Failure:	FAIL
 *
 * Programmer:	Robb Matzke
 *		Friday, January 30, 1998
 *
 * Modifications:
 *
 *-------------------------------------------------------------------------
 */
intn
H5S_extend (H5S_t *space, const size_t *size)
{
    intn		i, ret_value=0;
    
    FUNC_ENTER (H5S_extend, FAIL);

    /* Check args */
    assert (space && H5S_SIMPLE==space->type);
    assert (size);

    for (i=0; i<space->u.simple.rank; i++) {
	if (space->u.simple.size[i]<size[i]) {
	    if (space->u.simple.max &&
		H5S_UNLIMITED!=space->u.simple.max[i] &&
		space->u.simple.max[i]<size[i]) {
		HRETURN_ERROR (H5E_ARGS, H5E_BADVALUE, FAIL,
			       "dimension cannot be increased");
	    }
	    ret_value++;
	}
    }

    /* Update */
    if (ret_value) {
	for (i=0; i<space->u.simple.rank; i++) {
	    if (space->u.simple.size[i]<size[i]) {
		space->u.simple.size[i] = size[i];
	    }
	}
    }

    FUNC_LEAVE (ret_value);
}