PageRenderTime 1616ms CodeModel.GetById 29ms RepoModel.GetById 8ms app.codeStats 2ms

/other/netcdf_write_matrix/src/nc_test/test_get.c

https://github.com/jbeezley/wrf-fire
C | 6251 lines | 5857 code | 148 blank | 246 comment | 1944 complexity | 22a84c44940594b76318a681103f5c92 MD5 | raw file
Possible License(s): AGPL-1.0 
    

  1. /* Do not edit this file. It is produced from the corresponding .m4 source */
    2. 

  2. /*********************************************************************
    3. 

  3.  *   Copyright 1996, UCAR/Unidata
    4. 

  4.  *   See netcdf/COPYRIGHT file for copying and redistribution conditions.
    5. 

  5.  *   $Id: test_get.m4,v 1.16 2005/03/08 03:04:19 ed Exp $
    6. 

  6.  *********************************************************************/
    7. 

  7. 

  8. 

  9. #include "tests.h"
    10. 

  10. 

  11. 

  12. void
    13. 

  13. test_nc_get_var1_text(void)
    14. 

  14. {
    15. 

  15.     int ncid;
    16. 

  16.     int i;
    17. 

  17.     int j;
    18. 

  18.     int err;
    19. 

  19.     int nok = 0;      /* count of valid comparisons */
    20. 

  20.     size_t index[MAX_RANK];
    21. 

  21.     double expect;
    22. 

  22.     int canConvert;     /* Both text or both numeric */
    23. 

  23.     text value;
    24. 

  24. 

  25.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    26. 

  26.     IF (err)
    27. 

  27. 	error("nc_open: %s", nc_strerror(err));
    28. 

  28.     for (i = 0; i < NVARS; i++) {
    29. 

  29.         canConvert = (var_type[i] == NC_CHAR) == (NCT_TEXT == NCT_TEXT);
    30. 

  30. 	for (j = 0; j < var_rank[i]; j++)
    31. 

  31. 	    index[j] = 0;
    32. 

  32.         err = nc_get_var1_text(BAD_ID, i, index, &value);
    33. 

  33.         IF (err != NC_EBADID)
    34. 

  34. 	    error("bad ncid: status = %d", err);
    35. 

  35.         err = nc_get_var1_text(ncid, BAD_VARID, index, &value);
    36. 

  36.         IF (err != NC_ENOTVAR)
    37. 

  37. 	    error("bad var id: status = %d", err);
    38. 

  38. 	for (j = 0; j < var_rank[i]; j++) {
    39. 

  39. 	    index[j] = var_shape[i][j];
    40. 

  40. 	    err = nc_get_var1_text(ncid, i, index, &value);
    41. 

  41. 	    if(!canConvert) {
    42. 

  42. 		IF(err != NC_ECHAR)
    43. 

  43. 			error("conversion: status = %d", err);
    44. 

  44. 	    } else IF (err != NC_EINVALCOORDS)
    45. 

  45. 		error("bad index: status = %d", err);
    46. 

  46. 	    index[j] = 0;
    47. 

  47. 	}
    48. 

  48. 	for (j = 0; j < var_nels[i]; j++) {
    49. 

  49. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    50. 

  50. 	    IF (err)
    51. 

  51. 		error("error in toMixedBase 1");
    52. 

  52. 	    expect = hash4( var_type[i], var_rank[i], index, NCT_TEXT );
    53. 

  53. 	    if (var_rank[i] == 0 && i%2 )
    54. 

  54. 		err = nc_get_var1_text(ncid, i, NULL, &value);
    55. 

  55. 	    else
    56. 

  56. 		err = nc_get_var1_text(ncid, i, index, &value);
    57. 

  57.             if (canConvert) {
    58. 

  58. 		if (inRange3(expect,var_type[i], NCT_TEXT)) {
    59. 

  59. 		    if (expect >= text_min && expect <= text_max) {
    60. 

  60. 			IF (err) {
    61. 

  61. 			    error("%s", nc_strerror(err));
    62. 

  62. 			} else {
    63. 

  63. 			    IF (!equal(value,expect,var_type[i],NCT_TEXT)) {
    64. 

  64. 				error("expected: %G, got: %G", expect,
    65. 

  65. 				    (double) value);
    66. 

  66. 			    } else {
    67. 

  67. 				nok++;
    68. 

  68. 			    }
    69. 

  69. 			}
    70. 

  70. 		    } else {
    71. 

  71. 			IF (err != NC_ERANGE)
    72. 

  72. 			    error("Range error: status = %d", err);
    73. 

  73. 		    }
    74. 

  74.                 } else {
    75. 

  75.                     IF (err != 0 && err != NC_ERANGE)
    76. 

  76.                         error("OK or Range error: status = %d", err);
    77. 

  77. 		}
    78. 

  78. 	    } else {
    79. 

  79. 		IF (err != NC_ECHAR)
    80. 

  80. 		    error("wrong type: status = %d", err);
    81. 

  81. 	    }
    82. 

  82. 	}
    83. 

  83.     }
    84. 

  84.     err = nc_close(ncid);
    85. 

  85.     IF (err)
    86. 

  86. 	error("nc_close: %s", nc_strerror(err));
    87. 

  87.     print_nok(nok);
    88. 

  88. }
    89. 

  89. 

  90. void
    91. 

  91. test_nc_get_var1_uchar(void)
    92. 

  92. {
    93. 

  93.     int ncid;
    94. 

  94.     int i;
    95. 

  95.     int j;
    96. 

  96.     int err;
    97. 

  97.     int nok = 0;      /* count of valid comparisons */
    98. 

  98.     size_t index[MAX_RANK];
    99. 

  99.     double expect;
    100. 

  100.     int canConvert;     /* Both text or both numeric */
    101. 

  101.     uchar value;
    102. 

  102. 

  103.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    104. 

  104.     IF (err)
    105. 

  105. 	error("nc_open: %s", nc_strerror(err));
    106. 

  106.     for (i = 0; i < NVARS; i++) {
    107. 

  107.         canConvert = (var_type[i] == NC_CHAR) == (NCT_UCHAR == NCT_TEXT);
    108. 

  108. 	for (j = 0; j < var_rank[i]; j++)
    109. 

  109. 	    index[j] = 0;
    110. 

  110.         err = nc_get_var1_uchar(BAD_ID, i, index, &value);
    111. 

  111.         IF (err != NC_EBADID)
    112. 

  112. 	    error("bad ncid: status = %d", err);
    113. 

  113.         err = nc_get_var1_uchar(ncid, BAD_VARID, index, &value);
    114. 

  114.         IF (err != NC_ENOTVAR)
    115. 

  115. 	    error("bad var id: status = %d", err);
    116. 

  116. 	for (j = 0; j < var_rank[i]; j++) {
    117. 

  117. 	    index[j] = var_shape[i][j];
    118. 

  118. 	    err = nc_get_var1_uchar(ncid, i, index, &value);
    119. 

  119. 	    if(!canConvert) {
    120. 

  120. 		IF(err != NC_ECHAR)
    121. 

  121. 			error("conversion: status = %d", err);
    122. 

  122. 	    } else IF (err != NC_EINVALCOORDS)
    123. 

  123. 		error("bad index: status = %d", err);
    124. 

  124. 	    index[j] = 0;
    125. 

  125. 	}
    126. 

  126. 	for (j = 0; j < var_nels[i]; j++) {
    127. 

  127. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    128. 

  128. 	    IF (err)
    129. 

  129. 		error("error in toMixedBase 1");
    130. 

  130. 	    expect = hash4( var_type[i], var_rank[i], index, NCT_UCHAR );
    131. 

  131. 	    if (var_rank[i] == 0 && i%2 )
    132. 

  132. 		err = nc_get_var1_uchar(ncid, i, NULL, &value);
    133. 

  133. 	    else
    134. 

  134. 		err = nc_get_var1_uchar(ncid, i, index, &value);
    135. 

  135.             if (canConvert) {
    136. 

  136. 		if (inRange3(expect,var_type[i], NCT_UCHAR)) {
    137. 

  137. 		    if (expect >= uchar_min && expect <= uchar_max) {
    138. 

  138. 			IF (err) {
    139. 

  139. 			    error("%s", nc_strerror(err));
    140. 

  140. 			} else {
    141. 

  141. 			    IF (!equal(value,expect,var_type[i],NCT_UCHAR)) {
    142. 

  142. 				error("expected: %G, got: %G", expect,
    143. 

  143. 				    (double) value);
    144. 

  144. 			    } else {
    145. 

  145. 				nok++;
    146. 

  146. 			    }
    147. 

  147. 			}
    148. 

  148. 		    } else {
    149. 

  149. 			IF (err != NC_ERANGE)
    150. 

  150. 			    error("Range error: status = %d", err);
    151. 

  151. 		    }
    152. 

  152.                 } else {
    153. 

  153.                     IF (err != 0 && err != NC_ERANGE)
    154. 

  154.                         error("OK or Range error: status = %d", err);
    155. 

  155. 		}
    156. 

  156. 	    } else {
    157. 

  157. 		IF (err != NC_ECHAR)
    158. 

  158. 		    error("wrong type: status = %d", err);
    159. 

  159. 	    }
    160. 

  160. 	}
    161. 

  161.     }
    162. 

  162.     err = nc_close(ncid);
    163. 

  163.     IF (err)
    164. 

  164. 	error("nc_close: %s", nc_strerror(err));
    165. 

  165.     print_nok(nok);
    166. 

  166. }
    167. 

  167. 

  168. void
    169. 

  169. test_nc_get_var1_schar(void)
    170. 

  170. {
    171. 

  171.     int ncid;
    172. 

  172.     int i;
    173. 

  173.     int j;
    174. 

  174.     int err;
    175. 

  175.     int nok = 0;      /* count of valid comparisons */
    176. 

  176.     size_t index[MAX_RANK];
    177. 

  177.     double expect;
    178. 

  178.     int canConvert;     /* Both text or both numeric */
    179. 

  179.     schar value;
    180. 

  180. 

  181.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    182. 

  182.     IF (err)
    183. 

  183. 	error("nc_open: %s", nc_strerror(err));
    184. 

  184.     for (i = 0; i < NVARS; i++) {
    185. 

  185.         canConvert = (var_type[i] == NC_CHAR) == (NCT_SCHAR == NCT_TEXT);
    186. 

  186. 	for (j = 0; j < var_rank[i]; j++)
    187. 

  187. 	    index[j] = 0;
    188. 

  188.         err = nc_get_var1_schar(BAD_ID, i, index, &value);
    189. 

  189.         IF (err != NC_EBADID)
    190. 

  190. 	    error("bad ncid: status = %d", err);
    191. 

  191.         err = nc_get_var1_schar(ncid, BAD_VARID, index, &value);
    192. 

  192.         IF (err != NC_ENOTVAR)
    193. 

  193. 	    error("bad var id: status = %d", err);
    194. 

  194. 	for (j = 0; j < var_rank[i]; j++) {
    195. 

  195. 	    index[j] = var_shape[i][j];
    196. 

  196. 	    err = nc_get_var1_schar(ncid, i, index, &value);
    197. 

  197. 	    if(!canConvert) {
    198. 

  198. 		IF(err != NC_ECHAR)
    199. 

  199. 			error("conversion: status = %d", err);
    200. 

  200. 	    } else IF (err != NC_EINVALCOORDS)
    201. 

  201. 		error("bad index: status = %d", err);
    202. 

  202. 	    index[j] = 0;
    203. 

  203. 	}
    204. 

  204. 	for (j = 0; j < var_nels[i]; j++) {
    205. 

  205. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    206. 

  206. 	    IF (err)
    207. 

  207. 		error("error in toMixedBase 1");
    208. 

  208. 	    expect = hash4( var_type[i], var_rank[i], index, NCT_SCHAR );
    209. 

  209. 	    if (var_rank[i] == 0 && i%2 )
    210. 

  210. 		err = nc_get_var1_schar(ncid, i, NULL, &value);
    211. 

  211. 	    else
    212. 

  212. 		err = nc_get_var1_schar(ncid, i, index, &value);
    213. 

  213.             if (canConvert) {
    214. 

  214. 		if (inRange3(expect,var_type[i], NCT_SCHAR)) {
    215. 

  215. 		    if (expect >= schar_min && expect <= schar_max) {
    216. 

  216. 			IF (err) {
    217. 

  217. 			    error("%s", nc_strerror(err));
    218. 

  218. 			} else {
    219. 

  219. 			    IF (!equal(value,expect,var_type[i],NCT_SCHAR)) {
    220. 

  220. 				error("expected: %G, got: %G", expect,
    221. 

  221. 				    (double) value);
    222. 

  222. 			    } else {
    223. 

  223. 				nok++;
    224. 

  224. 			    }
    225. 

  225. 			}
    226. 

  226. 		    } else {
    227. 

  227. 			IF (err != NC_ERANGE)
    228. 

  228. 			    error("Range error: status = %d", err);
    229. 

  229. 		    }
    230. 

  230.                 } else {
    231. 

  231.                     IF (err != 0 && err != NC_ERANGE)
    232. 

  232.                         error("OK or Range error: status = %d", err);
    233. 

  233. 		}
    234. 

  234. 	    } else {
    235. 

  235. 		IF (err != NC_ECHAR)
    236. 

  236. 		    error("wrong type: status = %d", err);
    237. 

  237. 	    }
    238. 

  238. 	}
    239. 

  239.     }
    240. 

  240.     err = nc_close(ncid);
    241. 

  241.     IF (err)
    242. 

  242. 	error("nc_close: %s", nc_strerror(err));
    243. 

  243.     print_nok(nok);
    244. 

  244. }
    245. 

  245. 

  246. void
    247. 

  247. test_nc_get_var1_short(void)
    248. 

  248. {
    249. 

  249.     int ncid;
    250. 

  250.     int i;
    251. 

  251.     int j;
    252. 

  252.     int err;
    253. 

  253.     int nok = 0;      /* count of valid comparisons */
    254. 

  254.     size_t index[MAX_RANK];
    255. 

  255.     double expect;
    256. 

  256.     int canConvert;     /* Both text or both numeric */
    257. 

  257.     short value;
    258. 

  258. 

  259.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    260. 

  260.     IF (err)
    261. 

  261. 	error("nc_open: %s", nc_strerror(err));
    262. 

  262.     for (i = 0; i < NVARS; i++) {
    263. 

  263.         canConvert = (var_type[i] == NC_CHAR) == (NCT_SHORT == NCT_TEXT);
    264. 

  264. 	for (j = 0; j < var_rank[i]; j++)
    265. 

  265. 	    index[j] = 0;
    266. 

  266.         err = nc_get_var1_short(BAD_ID, i, index, &value);
    267. 

  267.         IF (err != NC_EBADID)
    268. 

  268. 	    error("bad ncid: status = %d", err);
    269. 

  269.         err = nc_get_var1_short(ncid, BAD_VARID, index, &value);
    270. 

  270.         IF (err != NC_ENOTVAR)
    271. 

  271. 	    error("bad var id: status = %d", err);
    272. 

  272. 	for (j = 0; j < var_rank[i]; j++) {
    273. 

  273. 	    index[j] = var_shape[i][j];
    274. 

  274. 	    err = nc_get_var1_short(ncid, i, index, &value);
    275. 

  275. 	    if(!canConvert) {
    276. 

  276. 		IF(err != NC_ECHAR)
    277. 

  277. 			error("conversion: status = %d", err);
    278. 

  278. 	    } else IF (err != NC_EINVALCOORDS)
    279. 

  279. 		error("bad index: status = %d", err);
    280. 

  280. 	    index[j] = 0;
    281. 

  281. 	}
    282. 

  282. 	for (j = 0; j < var_nels[i]; j++) {
    283. 

  283. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    284. 

  284. 	    IF (err)
    285. 

  285. 		error("error in toMixedBase 1");
    286. 

  286. 	    expect = hash4( var_type[i], var_rank[i], index, NCT_SHORT );
    287. 

  287. 	    if (var_rank[i] == 0 && i%2 )
    288. 

  288. 		err = nc_get_var1_short(ncid, i, NULL, &value);
    289. 

  289. 	    else
    290. 

  290. 		err = nc_get_var1_short(ncid, i, index, &value);
    291. 

  291.             if (canConvert) {
    292. 

  292. 		if (inRange3(expect,var_type[i], NCT_SHORT)) {
    293. 

  293. 		    if (expect >= short_min && expect <= short_max) {
    294. 

  294. 			IF (err) {
    295. 

  295. 			    error("%s", nc_strerror(err));
    296. 

  296. 			} else {
    297. 

  297. 			    IF (!equal(value,expect,var_type[i],NCT_SHORT)) {
    298. 

  298. 				error("expected: %G, got: %G", expect,
    299. 

  299. 				    (double) value);
    300. 

  300. 			    } else {
    301. 

  301. 				nok++;
    302. 

  302. 			    }
    303. 

  303. 			}
    304. 

  304. 		    } else {
    305. 

  305. 			IF (err != NC_ERANGE)
    306. 

  306. 			    error("Range error: status = %d", err);
    307. 

  307. 		    }
    308. 

  308.                 } else {
    309. 

  309.                     IF (err != 0 && err != NC_ERANGE)
    310. 

  310.                         error("OK or Range error: status = %d", err);
    311. 

  311. 		}
    312. 

  312. 	    } else {
    313. 

  313. 		IF (err != NC_ECHAR)
    314. 

  314. 		    error("wrong type: status = %d", err);
    315. 

  315. 	    }
    316. 

  316. 	}
    317. 

  317.     }
    318. 

  318.     err = nc_close(ncid);
    319. 

  319.     IF (err)
    320. 

  320. 	error("nc_close: %s", nc_strerror(err));
    321. 

  321.     print_nok(nok);
    322. 

  322. }
    323. 

  323. 

  324. void
    325. 

  325. test_nc_get_var1_int(void)
    326. 

  326. {
    327. 

  327.     int ncid;
    328. 

  328.     int i;
    329. 

  329.     int j;
    330. 

  330.     int err;
    331. 

  331.     int nok = 0;      /* count of valid comparisons */
    332. 

  332.     size_t index[MAX_RANK];
    333. 

  333.     double expect;
    334. 

  334.     int canConvert;     /* Both text or both numeric */
    335. 

  335.     int value;
    336. 

  336. 

  337.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    338. 

  338.     IF (err)
    339. 

  339. 	error("nc_open: %s", nc_strerror(err));
    340. 

  340.     for (i = 0; i < NVARS; i++) {
    341. 

  341.         canConvert = (var_type[i] == NC_CHAR) == (NCT_INT == NCT_TEXT);
    342. 

  342. 	for (j = 0; j < var_rank[i]; j++)
    343. 

  343. 	    index[j] = 0;
    344. 

  344.         err = nc_get_var1_int(BAD_ID, i, index, &value);
    345. 

  345.         IF (err != NC_EBADID)
    346. 

  346. 	    error("bad ncid: status = %d", err);
    347. 

  347.         err = nc_get_var1_int(ncid, BAD_VARID, index, &value);
    348. 

  348.         IF (err != NC_ENOTVAR)
    349. 

  349. 	    error("bad var id: status = %d", err);
    350. 

  350. 	for (j = 0; j < var_rank[i]; j++) {
    351. 

  351. 	    index[j] = var_shape[i][j];
    352. 

  352. 	    err = nc_get_var1_int(ncid, i, index, &value);
    353. 

  353. 	    if(!canConvert) {
    354. 

  354. 		IF(err != NC_ECHAR)
    355. 

  355. 			error("conversion: status = %d", err);
    356. 

  356. 	    } else IF (err != NC_EINVALCOORDS)
    357. 

  357. 		error("bad index: status = %d", err);
    358. 

  358. 	    index[j] = 0;
    359. 

  359. 	}
    360. 

  360. 	for (j = 0; j < var_nels[i]; j++) {
    361. 

  361. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    362. 

  362. 	    IF (err)
    363. 

  363. 		error("error in toMixedBase 1");
    364. 

  364. 	    expect = hash4( var_type[i], var_rank[i], index, NCT_INT );
    365. 

  365. 	    if (var_rank[i] == 0 && i%2 )
    366. 

  366. 		err = nc_get_var1_int(ncid, i, NULL, &value);
    367. 

  367. 	    else
    368. 

  368. 		err = nc_get_var1_int(ncid, i, index, &value);
    369. 

  369.             if (canConvert) {
    370. 

  370. 		if (inRange3(expect,var_type[i], NCT_INT)) {
    371. 

  371. 		    if (expect >= int_min && expect <= int_max) {
    372. 

  372. 			IF (err) {
    373. 

  373. 			    error("%s", nc_strerror(err));
    374. 

  374. 			} else {
    375. 

  375. 			    IF (!equal(value,expect,var_type[i],NCT_INT)) {
    376. 

  376. 				error("expected: %G, got: %G", expect,
    377. 

  377. 				    (double) value);
    378. 

  378. 			    } else {
    379. 

  379. 				nok++;
    380. 

  380. 			    }
    381. 

  381. 			}
    382. 

  382. 		    } else {
    383. 

  383. 			IF (err != NC_ERANGE)
    384. 

  384. 			    error("Range error: status = %d", err);
    385. 

  385. 		    }
    386. 

  386.                 } else {
    387. 

  387.                     IF (err != 0 && err != NC_ERANGE)
    388. 

  388.                         error("OK or Range error: status = %d", err);
    389. 

  389. 		}
    390. 

  390. 	    } else {
    391. 

  391. 		IF (err != NC_ECHAR)
    392. 

  392. 		    error("wrong type: status = %d", err);
    393. 

  393. 	    }
    394. 

  394. 	}
    395. 

  395.     }
    396. 

  396.     err = nc_close(ncid);
    397. 

  397.     IF (err)
    398. 

  398. 	error("nc_close: %s", nc_strerror(err));
    399. 

  399.     print_nok(nok);
    400. 

  400. }
    401. 

  401. 

  402. void
    403. 

  403. test_nc_get_var1_long(void)
    404. 

  404. {
    405. 

  405.     int ncid;
    406. 

  406.     int i;
    407. 

  407.     int j;
    408. 

  408.     int err;
    409. 

  409.     int nok = 0;      /* count of valid comparisons */
    410. 

  410.     size_t index[MAX_RANK];
    411. 

  411.     double expect;
    412. 

  412.     int canConvert;     /* Both text or both numeric */
    413. 

  413.     long value;
    414. 

  414. 

  415.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    416. 

  416.     IF (err)
    417. 

  417. 	error("nc_open: %s", nc_strerror(err));
    418. 

  418.     for (i = 0; i < NVARS; i++) {
    419. 

  419.         canConvert = (var_type[i] == NC_CHAR) == (NCT_LONG == NCT_TEXT);
    420. 

  420. 	for (j = 0; j < var_rank[i]; j++)
    421. 

  421. 	    index[j] = 0;
    422. 

  422.         err = nc_get_var1_long(BAD_ID, i, index, &value);
    423. 

  423.         IF (err != NC_EBADID)
    424. 

  424. 	    error("bad ncid: status = %d", err);
    425. 

  425.         err = nc_get_var1_long(ncid, BAD_VARID, index, &value);
    426. 

  426.         IF (err != NC_ENOTVAR)
    427. 

  427. 	    error("bad var id: status = %d", err);
    428. 

  428. 	for (j = 0; j < var_rank[i]; j++) {
    429. 

  429. 	    index[j] = var_shape[i][j];
    430. 

  430. 	    err = nc_get_var1_long(ncid, i, index, &value);
    431. 

  431. 	    if(!canConvert) {
    432. 

  432. 		IF(err != NC_ECHAR)
    433. 

  433. 			error("conversion: status = %d", err);
    434. 

  434. 	    } else IF (err != NC_EINVALCOORDS)
    435. 

  435. 		error("bad index: status = %d", err);
    436. 

  436. 	    index[j] = 0;
    437. 

  437. 	}
    438. 

  438. 	for (j = 0; j < var_nels[i]; j++) {
    439. 

  439. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    440. 

  440. 	    IF (err)
    441. 

  441. 		error("error in toMixedBase 1");
    442. 

  442. 	    expect = hash4( var_type[i], var_rank[i], index, NCT_LONG );
    443. 

  443. 	    if (var_rank[i] == 0 && i%2 )
    444. 

  444. 		err = nc_get_var1_long(ncid, i, NULL, &value);
    445. 

  445. 	    else
    446. 

  446. 		err = nc_get_var1_long(ncid, i, index, &value);
    447. 

  447.             if (canConvert) {
    448. 

  448. 		if (inRange3(expect,var_type[i], NCT_LONG)) {
    449. 

  449. 		    if (expect >= long_min && expect <= long_max) {
    450. 

  450. 			IF (err) {
    451. 

  451. 			    error("%s", nc_strerror(err));
    452. 

  452. 			} else {
    453. 

  453. 			    IF (!equal(value,expect,var_type[i],NCT_LONG)) {
    454. 

  454. 				error("expected: %G, got: %G", expect,
    455. 

  455. 				    (double) value);
    456. 

  456. 			    } else {
    457. 

  457. 				nok++;
    458. 

  458. 			    }
    459. 

  459. 			}
    460. 

  460. 		    } else {
    461. 

  461. 			IF (err != NC_ERANGE)
    462. 

  462. 			    error("Range error: status = %d", err);
    463. 

  463. 		    }
    464. 

  464.                 } else {
    465. 

  465.                     IF (err != 0 && err != NC_ERANGE)
    466. 

  466.                         error("OK or Range error: status = %d", err);
    467. 

  467. 		}
    468. 

  468. 	    } else {
    469. 

  469. 		IF (err != NC_ECHAR)
    470. 

  470. 		    error("wrong type: status = %d", err);
    471. 

  471. 	    }
    472. 

  472. 	}
    473. 

  473.     }
    474. 

  474.     err = nc_close(ncid);
    475. 

  475.     IF (err)
    476. 

  476. 	error("nc_close: %s", nc_strerror(err));
    477. 

  477.     print_nok(nok);
    478. 

  478. }
    479. 

  479. 

  480. void
    481. 

  481. test_nc_get_var1_float(void)
    482. 

  482. {
    483. 

  483.     int ncid;
    484. 

  484.     int i;
    485. 

  485.     int j;
    486. 

  486.     int err;
    487. 

  487.     int nok = 0;      /* count of valid comparisons */
    488. 

  488.     size_t index[MAX_RANK];
    489. 

  489.     double expect;
    490. 

  490.     int canConvert;     /* Both text or both numeric */
    491. 

  491.     float value;
    492. 

  492. 

  493.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    494. 

  494.     IF (err)
    495. 

  495. 	error("nc_open: %s", nc_strerror(err));
    496. 

  496.     for (i = 0; i < NVARS; i++) {
    497. 

  497.         canConvert = (var_type[i] == NC_CHAR) == (NCT_FLOAT == NCT_TEXT);
    498. 

  498. 	for (j = 0; j < var_rank[i]; j++)
    499. 

  499. 	    index[j] = 0;
    500. 

  500.         err = nc_get_var1_float(BAD_ID, i, index, &value);
    501. 

  501.         IF (err != NC_EBADID)
    502. 

  502. 	    error("bad ncid: status = %d", err);
    503. 

  503.         err = nc_get_var1_float(ncid, BAD_VARID, index, &value);
    504. 

  504.         IF (err != NC_ENOTVAR)
    505. 

  505. 	    error("bad var id: status = %d", err);
    506. 

  506. 	for (j = 0; j < var_rank[i]; j++) {
    507. 

  507. 	    index[j] = var_shape[i][j];
    508. 

  508. 	    err = nc_get_var1_float(ncid, i, index, &value);
    509. 

  509. 	    if(!canConvert) {
    510. 

  510. 		IF(err != NC_ECHAR)
    511. 

  511. 			error("conversion: status = %d", err);
    512. 

  512. 	    } else IF (err != NC_EINVALCOORDS)
    513. 

  513. 		error("bad index: status = %d", err);
    514. 

  514. 	    index[j] = 0;
    515. 

  515. 	}
    516. 

  516. 	for (j = 0; j < var_nels[i]; j++) {
    517. 

  517. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    518. 

  518. 	    IF (err)
    519. 

  519. 		error("error in toMixedBase 1");
    520. 

  520. 	    expect = hash4( var_type[i], var_rank[i], index, NCT_FLOAT );
    521. 

  521. 	    if (var_rank[i] == 0 && i%2 )
    522. 

  522. 		err = nc_get_var1_float(ncid, i, NULL, &value);
    523. 

  523. 	    else
    524. 

  524. 		err = nc_get_var1_float(ncid, i, index, &value);
    525. 

  525.             if (canConvert) {
    526. 

  526. 		if (inRange3(expect,var_type[i], NCT_FLOAT)) {
    527. 

  527. 		    if (expect >= float_min && expect <= float_max) {
    528. 

  528. 			IF (err) {
    529. 

  529. 			    error("%s", nc_strerror(err));
    530. 

  530. 			} else {
    531. 

  531. 			    IF (!equal(value,expect,var_type[i],NCT_FLOAT)) {
    532. 

  532. 				error("expected: %G, got: %G", expect,
    533. 

  533. 				    (double) value);
    534. 

  534. 			    } else {
    535. 

  535. 				nok++;
    536. 

  536. 			    }
    537. 

  537. 			}
    538. 

  538. 		    } else {
    539. 

  539. 			IF (err != NC_ERANGE)
    540. 

  540. 			    error("Range error: status = %d", err);
    541. 

  541. 		    }
    542. 

  542.                 } else {
    543. 

  543.                     IF (err != 0 && err != NC_ERANGE)
    544. 

  544.                         error("OK or Range error: status = %d", err);
    545. 

  545. 		}
    546. 

  546. 	    } else {
    547. 

  547. 		IF (err != NC_ECHAR)
    548. 

  548. 		    error("wrong type: status = %d", err);
    549. 

  549. 	    }
    550. 

  550. 	}
    551. 

  551.     }
    552. 

  552.     err = nc_close(ncid);
    553. 

  553.     IF (err)
    554. 

  554. 	error("nc_close: %s", nc_strerror(err));
    555. 

  555.     print_nok(nok);
    556. 

  556. }
    557. 

  557. 

  558. void
    559. 

  559. test_nc_get_var1_double(void)
    560. 

  560. {
    561. 

  561.     int ncid;
    562. 

  562.     int i;
    563. 

  563.     int j;
    564. 

  564.     int err;
    565. 

  565.     int nok = 0;      /* count of valid comparisons */
    566. 

  566.     size_t index[MAX_RANK];
    567. 

  567.     double expect;
    568. 

  568.     int canConvert;     /* Both text or both numeric */
    569. 

  569.     double value;
    570. 

  570. 

  571.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    572. 

  572.     IF (err)
    573. 

  573. 	error("nc_open: %s", nc_strerror(err));
    574. 

  574.     for (i = 0; i < NVARS; i++) {
    575. 

  575.         canConvert = (var_type[i] == NC_CHAR) == (NCT_DOUBLE == NCT_TEXT);
    576. 

  576. 	for (j = 0; j < var_rank[i]; j++)
    577. 

  577. 	    index[j] = 0;
    578. 

  578.         err = nc_get_var1_double(BAD_ID, i, index, &value);
    579. 

  579.         IF (err != NC_EBADID)
    580. 

  580. 	    error("bad ncid: status = %d", err);
    581. 

  581.         err = nc_get_var1_double(ncid, BAD_VARID, index, &value);
    582. 

  582.         IF (err != NC_ENOTVAR)
    583. 

  583. 	    error("bad var id: status = %d", err);
    584. 

  584. 	for (j = 0; j < var_rank[i]; j++) {
    585. 

  585. 	    index[j] = var_shape[i][j];
    586. 

  586. 	    err = nc_get_var1_double(ncid, i, index, &value);
    587. 

  587. 	    if(!canConvert) {
    588. 

  588. 		IF(err != NC_ECHAR)
    589. 

  589. 			error("conversion: status = %d", err);
    590. 

  590. 	    } else IF (err != NC_EINVALCOORDS)
    591. 

  591. 		error("bad index: status = %d", err);
    592. 

  592. 	    index[j] = 0;
    593. 

  593. 	}
    594. 

  594. 	for (j = 0; j < var_nels[i]; j++) {
    595. 

  595. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    596. 

  596. 	    IF (err)
    597. 

  597. 		error("error in toMixedBase 1");
    598. 

  598. 	    expect = hash4( var_type[i], var_rank[i], index, NCT_DOUBLE );
    599. 

  599. 	    if (var_rank[i] == 0 && i%2 )
    600. 

  600. 		err = nc_get_var1_double(ncid, i, NULL, &value);
    601. 

  601. 	    else
    602. 

  602. 		err = nc_get_var1_double(ncid, i, index, &value);
    603. 

  603.             if (canConvert) {
    604. 

  604. 		if (inRange3(expect,var_type[i], NCT_DOUBLE)) {
    605. 

  605. 		    if (expect >= double_min && expect <= double_max) {
    606. 

  606. 			IF (err) {
    607. 

  607. 			    error("%s", nc_strerror(err));
    608. 

  608. 			} else {
    609. 

  609. 			    IF (!equal(value,expect,var_type[i],NCT_DOUBLE)) {
    610. 

  610. 				error("expected: %G, got: %G", expect,
    611. 

  611. 				    (double) value);
    612. 

  612. 			    } else {
    613. 

  613. 				nok++;
    614. 

  614. 			    }
    615. 

  615. 			}
    616. 

  616. 		    } else {
    617. 

  617. 			IF (err != NC_ERANGE)
    618. 

  618. 			    error("Range error: status = %d", err);
    619. 

  619. 		    }
    620. 

  620.                 } else {
    621. 

  621.                     IF (err != 0 && err != NC_ERANGE)
    622. 

  622.                         error("OK or Range error: status = %d", err);
    623. 

  623. 		}
    624. 

  624. 	    } else {
    625. 

  625. 		IF (err != NC_ECHAR)
    626. 

  626. 		    error("wrong type: status = %d", err);
    627. 

  627. 	    }
    628. 

  628. 	}
    629. 

  629.     }
    630. 

  630.     err = nc_close(ncid);
    631. 

  631.     IF (err)
    632. 

  632. 	error("nc_close: %s", nc_strerror(err));
    633. 

  633.     print_nok(nok);
    634. 

  634. }
    635. 

  635. 

  636. 

  637. 

  638. 

  639. void
    640. 

  640. test_nc_get_var_text(void)
    641. 

  641. {
    642. 

  642.     int ncid;
    643. 

  643.     int i;
    644. 

  644.     int j;
    645. 

  645.     int err;
    646. 

  646.     int allInExtRange;	/* all values within external range? */
    647. 

  647.     int allInIntRange;	/* all values within internal range? */
    648. 

  648.     int nels;
    649. 

  649.     int nok = 0;      /* count of valid comparisons */
    650. 

  650.     size_t index[MAX_RANK];
    651. 

  651.     int canConvert;     /* Both text or both numeric */
    652. 

  652.     text value[MAX_NELS];
    653. 

  653.     double expect[MAX_NELS];
    654. 

  654. 

  655.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    656. 

  656.     IF (err)
    657. 

  657. 	error("nc_open: %s", nc_strerror(err));
    658. 

  658.     for (i = 0; i < NVARS; i++) {
    659. 

  659.         canConvert = (var_type[i] == NC_CHAR) == (NCT_TEXT == NCT_TEXT);
    660. 

  660.         assert(var_rank[i] <= MAX_RANK);
    661. 

  661.         assert(var_nels[i] <= MAX_NELS);
    662. 

  662.         err = nc_get_var_text(BAD_ID, i, value);
    663. 

  663.         IF (err != NC_EBADID)
    664. 

  664. 	    error("bad ncid: status = %d", err);
    665. 

  665.         err = nc_get_var_text(ncid, BAD_VARID, value);
    666. 

  666.         IF (err != NC_ENOTVAR)
    667. 

  667. 	    error("bad var id: status = %d", err);
    668. 

  668. 

  669. 	nels = 1;
    670. 

  670. 	for (j = 0; j < var_rank[i]; j++) {
    671. 

  671. 	    nels *= var_shape[i][j];
    672. 

  672. 	}
    673. 

  673. 	allInExtRange = allInIntRange = 1;
    674. 

  674. 	for (j = 0; j < nels; j++) {
    675. 

  675. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    676. 

  676. 	    IF (err)
    677. 

  677. 		error("error in toMixedBase 1");
    678. 

  678. 	    expect[j] = hash4(var_type[i], var_rank[i], index, NCT_TEXT);
    679. 

  679. 	    if (inRange3(expect[j],var_type[i], NCT_TEXT)) {
    680. 

  680. 		allInIntRange = allInIntRange && expect[j] >= text_min
    681. 

  681. 			    && expect[j] <= text_max;
    682. 

  682. 	    } else {
    683. 

  683. 		allInExtRange = 0;
    684. 

  684. 	    }
    685. 

  685. 	}
    686. 

  686. 	err = nc_get_var_text(ncid, i, value);
    687. 

  687. 	if (canConvert) {
    688. 

  688. 	    if (allInExtRange) {
    689. 

  689. 		if (allInIntRange) {
    690. 

  690. 		    IF (err)
    691. 

  691. 			error("%s", nc_strerror(err));
    692. 

  692. 		} else {
    693. 

  693. 		    IF (err != NC_ERANGE)
    694. 

  694. 			error("Range error: status = %d", err);
    695. 

  695. 		}
    696. 

  696. 	    } else {
    697. 

  697. 		IF (err != 0 && err != NC_ERANGE)
    698. 

  698. 		    error("OK or Range error: status = %d", err);
    699. 

  699. 	    }
    700. 

  700. 	    for (j = 0; j < nels; j++) {
    701. 

  701. 		if (inRange3(expect[j],var_type[i],NCT_TEXT)
    702. 

  702. 			&& expect[j] >= text_min && expect[j] <= text_max) {
    703. 

  703. 		    IF (!equal(value[j],expect[j],var_type[i],NCT_TEXT)){
    704. 

  704. 			error("value read not that expected");
    705. 

  705. 			if (verbose) {
    706. 

  706. 			    error("\n");
    707. 

  707. 			    error("varid: %d, ", i);
    708. 

  708. 			    error("var_name: %s, ", var_name[i]);
    709. 

  709. 			    error("element number: %d ", j);
    710. 

  710. 			    error("expect: %g", expect[j]);
    711. 

  711. 			    error("got: %g", (double) value[j]);
    712. 

  712. 			}
    713. 

  713. 		    } else {
    714. 

  714. 			nok++;
    715. 

  715. 		    }
    716. 

  716. 		}
    717. 

  717. 	    }
    718. 

  718. 	} else {
    719. 

  719. 	    IF (nels > 0 && err != NC_ECHAR)
    720. 

  720. 		error("wrong type: status = %d", err);
    721. 

  721. 	}
    722. 

  722.     }
    723. 

  723.     err = nc_close(ncid);
    724. 

  724.     IF (err)
    725. 

  725. 	error("nc_close: %s", nc_strerror(err));
    726. 

  726.     print_nok(nok);
    727. 

  727. }
    728. 

  728. 

  729. void
    730. 

  730. test_nc_get_var_uchar(void)
    731. 

  731. {
    732. 

  732.     int ncid;
    733. 

  733.     int i;
    734. 

  734.     int j;
    735. 

  735.     int err;
    736. 

  736.     int allInExtRange;	/* all values within external range? */
    737. 

  737.     int allInIntRange;	/* all values within internal range? */
    738. 

  738.     int nels;
    739. 

  739.     int nok = 0;      /* count of valid comparisons */
    740. 

  740.     size_t index[MAX_RANK];
    741. 

  741.     int canConvert;     /* Both text or both numeric */
    742. 

  742.     uchar value[MAX_NELS];
    743. 

  743.     double expect[MAX_NELS];
    744. 

  744. 

  745.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    746. 

  746.     IF (err)
    747. 

  747. 	error("nc_open: %s", nc_strerror(err));
    748. 

  748.     for (i = 0; i < NVARS; i++) {
    749. 

  749.         canConvert = (var_type[i] == NC_CHAR) == (NCT_UCHAR == NCT_TEXT);
    750. 

  750.         assert(var_rank[i] <= MAX_RANK);
    751. 

  751.         assert(var_nels[i] <= MAX_NELS);
    752. 

  752.         err = nc_get_var_uchar(BAD_ID, i, value);
    753. 

  753.         IF (err != NC_EBADID)
    754. 

  754. 	    error("bad ncid: status = %d", err);
    755. 

  755.         err = nc_get_var_uchar(ncid, BAD_VARID, value);
    756. 

  756.         IF (err != NC_ENOTVAR)
    757. 

  757. 	    error("bad var id: status = %d", err);
    758. 

  758. 

  759. 	nels = 1;
    760. 

  760. 	for (j = 0; j < var_rank[i]; j++) {
    761. 

  761. 	    nels *= var_shape[i][j];
    762. 

  762. 	}
    763. 

  763. 	allInExtRange = allInIntRange = 1;
    764. 

  764. 	for (j = 0; j < nels; j++) {
    765. 

  765. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    766. 

  766. 	    IF (err)
    767. 

  767. 		error("error in toMixedBase 1");
    768. 

  768. 	    expect[j] = hash4(var_type[i], var_rank[i], index, NCT_UCHAR);
    769. 

  769. 	    if (inRange3(expect[j],var_type[i], NCT_UCHAR)) {
    770. 

  770. 		allInIntRange = allInIntRange && expect[j] >= uchar_min
    771. 

  771. 			    && expect[j] <= uchar_max;
    772. 

  772. 	    } else {
    773. 

  773. 		allInExtRange = 0;
    774. 

  774. 	    }
    775. 

  775. 	}
    776. 

  776. 	err = nc_get_var_uchar(ncid, i, value);
    777. 

  777. 	if (canConvert) {
    778. 

  778. 	    if (allInExtRange) {
    779. 

  779. 		if (allInIntRange) {
    780. 

  780. 		    IF (err)
    781. 

  781. 			error("%s", nc_strerror(err));
    782. 

  782. 		} else {
    783. 

  783. 		    IF (err != NC_ERANGE)
    784. 

  784. 			error("Range error: status = %d", err);
    785. 

  785. 		}
    786. 

  786. 	    } else {
    787. 

  787. 		IF (err != 0 && err != NC_ERANGE)
    788. 

  788. 		    error("OK or Range error: status = %d", err);
    789. 

  789. 	    }
    790. 

  790. 	    for (j = 0; j < nels; j++) {
    791. 

  791. 		if (inRange3(expect[j],var_type[i],NCT_UCHAR)
    792. 

  792. 			&& expect[j] >= uchar_min && expect[j] <= uchar_max) {
    793. 

  793. 		    IF (!equal(value[j],expect[j],var_type[i],NCT_UCHAR)){
    794. 

  794. 			error("value read not that expected");
    795. 

  795. 			if (verbose) {
    796. 

  796. 			    error("\n");
    797. 

  797. 			    error("varid: %d, ", i);
    798. 

  798. 			    error("var_name: %s, ", var_name[i]);
    799. 

  799. 			    error("element number: %d ", j);
    800. 

  800. 			    error("expect: %g", expect[j]);
    801. 

  801. 			    error("got: %g", (double) value[j]);
    802. 

  802. 			}
    803. 

  803. 		    } else {
    804. 

  804. 			nok++;
    805. 

  805. 		    }
    806. 

  806. 		}
    807. 

  807. 	    }
    808. 

  808. 	} else {
    809. 

  809. 	    IF (nels > 0 && err != NC_ECHAR)
    810. 

  810. 		error("wrong type: status = %d", err);
    811. 

  811. 	}
    812. 

  812.     }
    813. 

  813.     err = nc_close(ncid);
    814. 

  814.     IF (err)
    815. 

  815. 	error("nc_close: %s", nc_strerror(err));
    816. 

  816.     print_nok(nok);
    817. 

  817. }
    818. 

  818. 

  819. void
    820. 

  820. test_nc_get_var_schar(void)
    821. 

  821. {
    822. 

  822.     int ncid;
    823. 

  823.     int i;
    824. 

  824.     int j;
    825. 

  825.     int err;
    826. 

  826.     int allInExtRange;	/* all values within external range? */
    827. 

  827.     int allInIntRange;	/* all values within internal range? */
    828. 

  828.     int nels;
    829. 

  829.     int nok = 0;      /* count of valid comparisons */
    830. 

  830.     size_t index[MAX_RANK];
    831. 

  831.     int canConvert;     /* Both text or both numeric */
    832. 

  832.     schar value[MAX_NELS];
    833. 

  833.     double expect[MAX_NELS];
    834. 

  834. 

  835.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    836. 

  836.     IF (err)
    837. 

  837. 	error("nc_open: %s", nc_strerror(err));
    838. 

  838.     for (i = 0; i < NVARS; i++) {
    839. 

  839.         canConvert = (var_type[i] == NC_CHAR) == (NCT_SCHAR == NCT_TEXT);
    840. 

  840.         assert(var_rank[i] <= MAX_RANK);
    841. 

  841.         assert(var_nels[i] <= MAX_NELS);
    842. 

  842.         err = nc_get_var_schar(BAD_ID, i, value);
    843. 

  843.         IF (err != NC_EBADID)
    844. 

  844. 	    error("bad ncid: status = %d", err);
    845. 

  845.         err = nc_get_var_schar(ncid, BAD_VARID, value);
    846. 

  846.         IF (err != NC_ENOTVAR)
    847. 

  847. 	    error("bad var id: status = %d", err);
    848. 

  848. 

  849. 	nels = 1;
    850. 

  850. 	for (j = 0; j < var_rank[i]; j++) {
    851. 

  851. 	    nels *= var_shape[i][j];
    852. 

  852. 	}
    853. 

  853. 	allInExtRange = allInIntRange = 1;
    854. 

  854. 	for (j = 0; j < nels; j++) {
    855. 

  855. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    856. 

  856. 	    IF (err)
    857. 

  857. 		error("error in toMixedBase 1");
    858. 

  858. 	    expect[j] = hash4(var_type[i], var_rank[i], index, NCT_SCHAR);
    859. 

  859. 	    if (inRange3(expect[j],var_type[i], NCT_SCHAR)) {
    860. 

  860. 		allInIntRange = allInIntRange && expect[j] >= schar_min
    861. 

  861. 			    && expect[j] <= schar_max;
    862. 

  862. 	    } else {
    863. 

  863. 		allInExtRange = 0;
    864. 

  864. 	    }
    865. 

  865. 	}
    866. 

  866. 	err = nc_get_var_schar(ncid, i, value);
    867. 

  867. 	if (canConvert) {
    868. 

  868. 	    if (allInExtRange) {
    869. 

  869. 		if (allInIntRange) {
    870. 

  870. 		    IF (err)
    871. 

  871. 			error("%s", nc_strerror(err));
    872. 

  872. 		} else {
    873. 

  873. 		    IF (err != NC_ERANGE)
    874. 

  874. 			error("Range error: status = %d", err);
    875. 

  875. 		}
    876. 

  876. 	    } else {
    877. 

  877. 		IF (err != 0 && err != NC_ERANGE)
    878. 

  878. 		    error("OK or Range error: status = %d", err);
    879. 

  879. 	    }
    880. 

  880. 	    for (j = 0; j < nels; j++) {
    881. 

  881. 		if (inRange3(expect[j],var_type[i],NCT_SCHAR)
    882. 

  882. 			&& expect[j] >= schar_min && expect[j] <= schar_max) {
    883. 

  883. 		    IF (!equal(value[j],expect[j],var_type[i],NCT_SCHAR)){
    884. 

  884. 			error("value read not that expected");
    885. 

  885. 			if (verbose) {
    886. 

  886. 			    error("\n");
    887. 

  887. 			    error("varid: %d, ", i);
    888. 

  888. 			    error("var_name: %s, ", var_name[i]);
    889. 

  889. 			    error("element number: %d ", j);
    890. 

  890. 			    error("expect: %g", expect[j]);
    891. 

  891. 			    error("got: %g", (double) value[j]);
    892. 

  892. 			}
    893. 

  893. 		    } else {
    894. 

  894. 			nok++;
    895. 

  895. 		    }
    896. 

  896. 		}
    897. 

  897. 	    }
    898. 

  898. 	} else {
    899. 

  899. 	    IF (nels > 0 && err != NC_ECHAR)
    900. 

  900. 		error("wrong type: status = %d", err);
    901. 

  901. 	}
    902. 

  902.     }
    903. 

  903.     err = nc_close(ncid);
    904. 

  904.     IF (err)
    905. 

  905. 	error("nc_close: %s", nc_strerror(err));
    906. 

  906.     print_nok(nok);
    907. 

  907. }
    908. 

  908. 

  909. void
    910. 

  910. test_nc_get_var_short(void)
    911. 

  911. {
    912. 

  912.     int ncid;
    913. 

  913.     int i;
    914. 

  914.     int j;
    915. 

  915.     int err;
    916. 

  916.     int allInExtRange;	/* all values within external range? */
    917. 

  917.     int allInIntRange;	/* all values within internal range? */
    918. 

  918.     int nels;
    919. 

  919.     int nok = 0;      /* count of valid comparisons */
    920. 

  920.     size_t index[MAX_RANK];
    921. 

  921.     int canConvert;     /* Both text or both numeric */
    922. 

  922.     short value[MAX_NELS];
    923. 

  923.     double expect[MAX_NELS];
    924. 

  924. 

  925.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    926. 

  926.     IF (err)
    927. 

  927. 	error("nc_open: %s", nc_strerror(err));
    928. 

  928.     for (i = 0; i < NVARS; i++) {
    929. 

  929.         canConvert = (var_type[i] == NC_CHAR) == (NCT_SHORT == NCT_TEXT);
    930. 

  930.         assert(var_rank[i] <= MAX_RANK);
    931. 

  931.         assert(var_nels[i] <= MAX_NELS);
    932. 

  932.         err = nc_get_var_short(BAD_ID, i, value);
    933. 

  933.         IF (err != NC_EBADID)
    934. 

  934. 	    error("bad ncid: status = %d", err);
    935. 

  935.         err = nc_get_var_short(ncid, BAD_VARID, value);
    936. 

  936.         IF (err != NC_ENOTVAR)
    937. 

  937. 	    error("bad var id: status = %d", err);
    938. 

  938. 

  939. 	nels = 1;
    940. 

  940. 	for (j = 0; j < var_rank[i]; j++) {
    941. 

  941. 	    nels *= var_shape[i][j];
    942. 

  942. 	}
    943. 

  943. 	allInExtRange = allInIntRange = 1;
    944. 

  944. 	for (j = 0; j < nels; j++) {
    945. 

  945. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    946. 

  946. 	    IF (err)
    947. 

  947. 		error("error in toMixedBase 1");
    948. 

  948. 	    expect[j] = hash4(var_type[i], var_rank[i], index, NCT_SHORT);
    949. 

  949. 	    if (inRange3(expect[j],var_type[i], NCT_SHORT)) {
    950. 

  950. 		allInIntRange = allInIntRange && expect[j] >= short_min
    951. 

  951. 			    && expect[j] <= short_max;
    952. 

  952. 	    } else {
    953. 

  953. 		allInExtRange = 0;
    954. 

  954. 	    }
    955. 

  955. 	}
    956. 

  956. 	err = nc_get_var_short(ncid, i, value);
    957. 

  957. 	if (canConvert) {
    958. 

  958. 	    if (allInExtRange) {
    959. 

  959. 		if (allInIntRange) {
    960. 

  960. 		    IF (err)
    961. 

  961. 			error("%s", nc_strerror(err));
    962. 

  962. 		} else {
    963. 

  963. 		    IF (err != NC_ERANGE)
    964. 

  964. 			error("Range error: status = %d", err);
    965. 

  965. 		}
    966. 

  966. 	    } else {
    967. 

  967. 		IF (err != 0 && err != NC_ERANGE)
    968. 

  968. 		    error("OK or Range error: status = %d", err);
    969. 

  969. 	    }
    970. 

  970. 	    for (j = 0; j < nels; j++) {
    971. 

  971. 		if (inRange3(expect[j],var_type[i],NCT_SHORT)
    972. 

  972. 			&& expect[j] >= short_min && expect[j] <= short_max) {
    973. 

  973. 		    IF (!equal(value[j],expect[j],var_type[i],NCT_SHORT)){
    974. 

  974. 			error("value read not that expected");
    975. 

  975. 			if (verbose) {
    976. 

  976. 			    error("\n");
    977. 

  977. 			    error("varid: %d, ", i);
    978. 

  978. 			    error("var_name: %s, ", var_name[i]);
    979. 

  979. 			    error("element number: %d ", j);
    980. 

  980. 			    error("expect: %g", expect[j]);
    981. 

  981. 			    error("got: %g", (double) value[j]);
    982. 

  982. 			}
    983. 

  983. 		    } else {
    984. 

  984. 			nok++;
    985. 

  985. 		    }
    986. 

  986. 		}
    987. 

  987. 	    }
    988. 

  988. 	} else {
    989. 

  989. 	    IF (nels > 0 && err != NC_ECHAR)
    990. 

  990. 		error("wrong type: status = %d", err);
    991. 

  991. 	}
    992. 

  992.     }
    993. 

  993.     err = nc_close(ncid);
    994. 

  994.     IF (err)
    995. 

  995. 	error("nc_close: %s", nc_strerror(err));
    996. 

  996.     print_nok(nok);
    997. 

  997. }
    998. 

  998. 

  999. void
    1000. 

  1000. test_nc_get_var_int(void)
    1001. 

  1001. {
    1002. 

  1002.     int ncid;
    1003. 

  1003.     int i;
    1004. 

  1004.     int j;
    1005. 

  1005.     int err;
    1006. 

  1006.     int allInExtRange;	/* all values within external range? */
    1007. 

  1007.     int allInIntRange;	/* all values within internal range? */
    1008. 

  1008.     int nels;
    1009. 

  1009.     int nok = 0;      /* count of valid comparisons */
    1010. 

  1010.     size_t index[MAX_RANK];
    1011. 

  1011.     int canConvert;     /* Both text or both numeric */
    1012. 

  1012.     int value[MAX_NELS];
    1013. 

  1013.     double expect[MAX_NELS];
    1014. 

  1014. 

  1015.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    1016. 

  1016.     IF (err)
    1017. 

  1017. 	error("nc_open: %s", nc_strerror(err));
    1018. 

  1018.     for (i = 0; i < NVARS; i++) {
    1019. 

  1019.         canConvert = (var_type[i] == NC_CHAR) == (NCT_INT == NCT_TEXT);
    1020. 

  1020.         assert(var_rank[i] <= MAX_RANK);
    1021. 

  1021.         assert(var_nels[i] <= MAX_NELS);
    1022. 

  1022.         err = nc_get_var_int(BAD_ID, i, value);
    1023. 

  1023.         IF (err != NC_EBADID)
    1024. 

  1024. 	    error("bad ncid: status = %d", err);
    1025. 

  1025.         err = nc_get_var_int(ncid, BAD_VARID, value);
    1026. 

  1026.         IF (err != NC_ENOTVAR)
    1027. 

  1027. 	    error("bad var id: status = %d", err);
    1028. 

  1028. 

  1029. 	nels = 1;
    1030. 

  1030. 	for (j = 0; j < var_rank[i]; j++) {
    1031. 

  1031. 	    nels *= var_shape[i][j];
    1032. 

  1032. 	}
    1033. 

  1033. 	allInExtRange = allInIntRange = 1;
    1034. 

  1034. 	for (j = 0; j < nels; j++) {
    1035. 

  1035. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    1036. 

  1036. 	    IF (err)
    1037. 

  1037. 		error("error in toMixedBase 1");
    1038. 

  1038. 	    expect[j] = hash4(var_type[i], var_rank[i], index, NCT_INT);
    1039. 

  1039. 	    if (inRange3(expect[j],var_type[i], NCT_INT)) {
    1040. 

  1040. 		allInIntRange = allInIntRange && expect[j] >= int_min
    1041. 

  1041. 			    && expect[j] <= int_max;
    1042. 

  1042. 	    } else {
    1043. 

  1043. 		allInExtRange = 0;
    1044. 

  1044. 	    }
    1045. 

  1045. 	}
    1046. 

  1046. 	err = nc_get_var_int(ncid, i, value);
    1047. 

  1047. 	if (canConvert) {
    1048. 

  1048. 	    if (allInExtRange) {
    1049. 

  1049. 		if (allInIntRange) {
    1050. 

  1050. 		    IF (err)
    1051. 

  1051. 			error("%s", nc_strerror(err));
    1052. 

  1052. 		} else {
    1053. 

  1053. 		    IF (err != NC_ERANGE)
    1054. 

  1054. 			error("Range error: status = %d", err);
    1055. 

  1055. 		}
    1056. 

  1056. 	    } else {
    1057. 

  1057. 		IF (err != 0 && err != NC_ERANGE)
    1058. 

  1058. 		    error("OK or Range error: status = %d", err);
    1059. 

  1059. 	    }
    1060. 

  1060. 	    for (j = 0; j < nels; j++) {
    1061. 

  1061. 		if (inRange3(expect[j],var_type[i],NCT_INT)
    1062. 

  1062. 			&& expect[j] >= int_min && expect[j] <= int_max) {
    1063. 

  1063. 		    IF (!equal(value[j],expect[j],var_type[i],NCT_INT)){
    1064. 

  1064. 			error("value read not that expected");
    1065. 

  1065. 			if (verbose) {
    1066. 

  1066. 			    error("\n");
    1067. 

  1067. 			    error("varid: %d, ", i);
    1068. 

  1068. 			    error("var_name: %s, ", var_name[i]);
    1069. 

  1069. 			    error("element number: %d ", j);
    1070. 

  1070. 			    error("expect: %g", expect[j]);
    1071. 

  1071. 			    error("got: %g", (double) value[j]);
    1072. 

  1072. 			}
    1073. 

  1073. 		    } else {
    1074. 

  1074. 			nok++;
    1075. 

  1075. 		    }
    1076. 

  1076. 		}
    1077. 

  1077. 	    }
    1078. 

  1078. 	} else {
    1079. 

  1079. 	    IF (nels > 0 && err != NC_ECHAR)
    1080. 

  1080. 		error("wrong type: status = %d", err);
    1081. 

  1081. 	}
    1082. 

  1082.     }
    1083. 

  1083.     err = nc_close(ncid);
    1084. 

  1084.     IF (err)
    1085. 

  1085. 	error("nc_close: %s", nc_strerror(err));
    1086. 

  1086.     print_nok(nok);
    1087. 

  1087. }
    1088. 

  1088. 

  1089. void
    1090. 

  1090. test_nc_get_var_long(void)
    1091. 

  1091. {
    1092. 

  1092.     int ncid;
    1093. 

  1093.     int i;
    1094. 

  1094.     int j;
    1095. 

  1095.     int err;
    1096. 

  1096.     int allInExtRange;	/* all values within external range? */
    1097. 

  1097.     int allInIntRange;	/* all values within internal range? */
    1098. 

  1098.     int nels;
    1099. 

  1099.     int nok = 0;      /* count of valid comparisons */
    1100. 

  1100.     size_t index[MAX_RANK];
    1101. 

  1101.     int canConvert;     /* Both text or both numeric */
    1102. 

  1102.     long value[MAX_NELS];
    1103. 

  1103.     double expect[MAX_NELS];
    1104. 

  1104. 

  1105.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    1106. 

  1106.     IF (err)
    1107. 

  1107. 	error("nc_open: %s", nc_strerror(err));
    1108. 

  1108.     for (i = 0; i < NVARS; i++) {
    1109. 

  1109.         canConvert = (var_type[i] == NC_CHAR) == (NCT_LONG == NCT_TEXT);
    1110. 

  1110.         assert(var_rank[i] <= MAX_RANK);
    1111. 

  1111.         assert(var_nels[i] <= MAX_NELS);
    1112. 

  1112.         err = nc_get_var_long(BAD_ID, i, value);
    1113. 

  1113.         IF (err != NC_EBADID)
    1114. 

  1114. 	    error("bad ncid: status = %d", err);
    1115. 

  1115.         err = nc_get_var_long(ncid, BAD_VARID, value);
    1116. 

  1116.         IF (err != NC_ENOTVAR)
    1117. 

  1117. 	    error("bad var id: status = %d", err);
    1118. 

  1118. 

  1119. 	nels = 1;
    1120. 

  1120. 	for (j = 0; j < var_rank[i]; j++) {
    1121. 

  1121. 	    nels *= var_shape[i][j];
    1122. 

  1122. 	}
    1123. 

  1123. 	allInExtRange = allInIntRange = 1;
    1124. 

  1124. 	for (j = 0; j < nels; j++) {
    1125. 

  1125. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    1126. 

  1126. 	    IF (err)
    1127. 

  1127. 		error("error in toMixedBase 1");
    1128. 

  1128. 	    expect[j] = hash4(var_type[i], var_rank[i], index, NCT_LONG);
    1129. 

  1129. 	    if (inRange3(expect[j],var_type[i], NCT_LONG)) {
    1130. 

  1130. 		allInIntRange = allInIntRange && expect[j] >= long_min
    1131. 

  1131. 			    && expect[j] <= long_max;
    1132. 

  1132. 	    } else {
    1133. 

  1133. 		allInExtRange = 0;
    1134. 

  1134. 	    }
    1135. 

  1135. 	}
    1136. 

  1136. 	err = nc_get_var_long(ncid, i, value);
    1137. 

  1137. 	if (canConvert) {
    1138. 

  1138. 	    if (allInExtRange) {
    1139. 

  1139. 		if (allInIntRange) {
    1140. 

  1140. 		    IF (err)
    1141. 

  1141. 			error("%s", nc_strerror(err));
    1142. 

  1142. 		} else {
    1143. 

  1143. 		    IF (err != NC_ERANGE)
    1144. 

  1144. 			error("Range error: status = %d", err);
    1145. 

  1145. 		}
    1146. 

  1146. 	    } else {
    1147. 

  1147. 		IF (err != 0 && err != NC_ERANGE)
    1148. 

  1148. 		    error("OK or Range error: status = %d", err);
    1149. 

  1149. 	    }
    1150. 

  1150. 	    for (j = 0; j < nels; j++) {
    1151. 

  1151. 		if (inRange3(expect[j],var_type[i],NCT_LONG)
    1152. 

  1152. 			&& expect[j] >= long_min && expect[j] <= long_max) {
    1153. 

  1153. 		    IF (!equal(value[j],expect[j],var_type[i],NCT_LONG)){
    1154. 

  1154. 			error("value read not that expected");
    1155. 

  1155. 			if (verbose) {
    1156. 

  1156. 			    error("\n");
    1157. 

  1157. 			    error("varid: %d, ", i);
    1158. 

  1158. 			    error("var_name: %s, ", var_name[i]);
    1159. 

  1159. 			    error("element number: %d ", j);
    1160. 

  1160. 			    error("expect: %g", expect[j]);
    1161. 

  1161. 			    error("got: %g", (double) value[j]);
    1162. 

  1162. 			}
    1163. 

  1163. 		    } else {
    1164. 

  1164. 			nok++;
    1165. 

  1165. 		    }
    1166. 

  1166. 		}
    1167. 

  1167. 	    }
    1168. 

  1168. 	} else {
    1169. 

  1169. 	    IF (nels > 0 && err != NC_ECHAR)
    1170. 

  1170. 		error("wrong type: status = %d", err);
    1171. 

  1171. 	}
    1172. 

  1172.     }
    1173. 

  1173.     err = nc_close(ncid);
    1174. 

  1174.     IF (err)
    1175. 

  1175. 	error("nc_close: %s", nc_strerror(err));
    1176. 

  1176.     print_nok(nok);
    1177. 

  1177. }
    1178. 

  1178. 

  1179. void
    1180. 

  1180. test_nc_get_var_float(void)
    1181. 

  1181. {
    1182. 

  1182.     int ncid;
    1183. 

  1183.     int i;
    1184. 

  1184.     int j;
    1185. 

  1185.     int err;
    1186. 

  1186.     int allInExtRange;	/* all values within external range? */
    1187. 

  1187.     int allInIntRange;	/* all values within internal range? */
    1188. 

  1188.     int nels;
    1189. 

  1189.     int nok = 0;      /* count of valid comparisons */
    1190. 

  1190.     size_t index[MAX_RANK];
    1191. 

  1191.     int canConvert;     /* Both text or both numeric */
    1192. 

  1192.     float value[MAX_NELS];
    1193. 

  1193.     double expect[MAX_NELS];
    1194. 

  1194. 

  1195.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    1196. 

  1196.     IF (err)
    1197. 

  1197. 	error("nc_open: %s", nc_strerror(err));
    1198. 

  1198.     for (i = 0; i < NVARS; i++) {
    1199. 

  1199.         canConvert = (var_type[i] == NC_CHAR) == (NCT_FLOAT == NCT_TEXT);
    1200. 

  1200.         assert(var_rank[i] <= MAX_RANK);
    1201. 

  1201.         assert(var_nels[i] <= MAX_NELS);
    1202. 

  1202.         err = nc_get_var_float(BAD_ID, i, value);
    1203. 

  1203.         IF (err != NC_EBADID)
    1204. 

  1204. 	    error("bad ncid: status = %d", err);
    1205. 

  1205.         err = nc_get_var_float(ncid, BAD_VARID, value);
    1206. 

  1206.         IF (err != NC_ENOTVAR)
    1207. 

  1207. 	    error("bad var id: status = %d", err);
    1208. 

  1208. 

  1209. 	nels = 1;
    1210. 

  1210. 	for (j = 0; j < var_rank[i]; j++) {
    1211. 

  1211. 	    nels *= var_shape[i][j];
    1212. 

  1212. 	}
    1213. 

  1213. 	allInExtRange = allInIntRange = 1;
    1214. 

  1214. 	for (j = 0; j < nels; j++) {
    1215. 

  1215. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    1216. 

  1216. 	    IF (err)
    1217. 

  1217. 		error("error in toMixedBase 1");
    1218. 

  1218. 	    expect[j] = hash4(var_type[i], var_rank[i], index, NCT_FLOAT);
    1219. 

  1219. 	    if (inRange3(expect[j],var_type[i], NCT_FLOAT)) {
    1220. 

  1220. 		allInIntRange = allInIntRange && expect[j] >= float_min
    1221. 

  1221. 			    && expect[j] <= float_max;
    1222. 

  1222. 	    } else {
    1223. 

  1223. 		allInExtRange = 0;
    1224. 

  1224. 	    }
    1225. 

  1225. 	}
    1226. 

  1226. 	err = nc_get_var_float(ncid, i, value);
    1227. 

  1227. 	if (canConvert) {
    1228. 

  1228. 	    if (allInExtRange) {
    1229. 

  1229. 		if (allInIntRange) {
    1230. 

  1230. 		    IF (err)
    1231. 

  1231. 			error("%s", nc_strerror(err));
    1232. 

  1232. 		} else {
    1233. 

  1233. 		    IF (err != NC_ERANGE)
    1234. 

  1234. 			error("Range error: status = %d", err);
    1235. 

  1235. 		}
    1236. 

  1236. 	    } else {
    1237. 

  1237. 		IF (err != 0 && err != NC_ERANGE)
    1238. 

  1238. 		    error("OK or Range error: status = %d", err);
    1239. 

  1239. 	    }
    1240. 

  1240. 	    for (j = 0; j < nels; j++) {
    1241. 

  1241. 		if (inRange3(expect[j],var_type[i],NCT_FLOAT)
    1242. 

  1242. 			&& expect[j] >= float_min && expect[j] <= float_max) {
    1243. 

  1243. 		    IF (!equal(value[j],expect[j],var_type[i],NCT_FLOAT)){
    1244. 

  1244. 			error("value read not that expected");
    1245. 

  1245. 			if (verbose) {
    1246. 

  1246. 			    error("\n");
    1247. 

  1247. 			    error("varid: %d, ", i);
    1248. 

  1248. 			    error("var_name: %s, ", var_name[i]);
    1249. 

  1249. 			    error("element number: %d ", j);
    1250. 

  1250. 			    error("expect: %g", expect[j]);
    1251. 

  1251. 			    error("got: %g", (double) value[j]);
    1252. 

  1252. 			}
    1253. 

  1253. 		    } else {
    1254. 

  1254. 			nok++;
    1255. 

  1255. 		    }
    1256. 

  1256. 		}
    1257. 

  1257. 	    }
    1258. 

  1258. 	} else {
    1259. 

  1259. 	    IF (nels > 0 && err != NC_ECHAR)
    1260. 

  1260. 		error("wrong type: status = %d", err);
    1261. 

  1261. 	}
    1262. 

  1262.     }
    1263. 

  1263.     err = nc_close(ncid);
    1264. 

  1264.     IF (err)
    1265. 

  1265. 	error("nc_close: %s", nc_strerror(err));
    1266. 

  1266.     print_nok(nok);
    1267. 

  1267. }
    1268. 

  1268. 

  1269. void
    1270. 

  1270. test_nc_get_var_double(void)
    1271. 

  1271. {
    1272. 

  1272.     int ncid;
    1273. 

  1273.     int i;
    1274. 

  1274.     int j;
    1275. 

  1275.     int err;
    1276. 

  1276.     int allInExtRange;	/* all values within external range? */
    1277. 

  1277.     int allInIntRange;	/* all values within internal range? */
    1278. 

  1278.     int nels;
    1279. 

  1279.     int nok = 0;      /* count of valid comparisons */
    1280. 

  1280.     size_t index[MAX_RANK];
    1281. 

  1281.     int canConvert;     /* Both text or both numeric */
    1282. 

  1282.     double value[MAX_NELS];
    1283. 

  1283.     double expect[MAX_NELS];
    1284. 

  1284. 

  1285.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    1286. 

  1286.     IF (err)
    1287. 

  1287. 	error("nc_open: %s", nc_strerror(err));
    1288. 

  1288.     for (i = 0; i < NVARS; i++) {
    1289. 

  1289.         canConvert = (var_type[i] == NC_CHAR) == (NCT_DOUBLE == NCT_TEXT);
    1290. 

  1290.         assert(var_rank[i] <= MAX_RANK);
    1291. 

  1291.         assert(var_nels[i] <= MAX_NELS);
    1292. 

  1292.         err = nc_get_var_double(BAD_ID, i, value);
    1293. 

  1293.         IF (err != NC_EBADID)
    1294. 

  1294. 	    error("bad ncid: status = %d", err);
    1295. 

  1295.         err = nc_get_var_double(ncid, BAD_VARID, value);
    1296. 

  1296.         IF (err != NC_ENOTVAR)
    1297. 

  1297. 	    error("bad var id: status = %d", err);
    1298. 

  1298. 

  1299. 	nels = 1;
    1300. 

  1300. 	for (j = 0; j < var_rank[i]; j++) {
    1301. 

  1301. 	    nels *= var_shape[i][j];
    1302. 

  1302. 	}
    1303. 

  1303. 	allInExtRange = allInIntRange = 1;
    1304. 

  1304. 	for (j = 0; j < nels; j++) {
    1305. 

  1305. 	    err = toMixedBase(j, var_rank[i], var_shape[i], index);
    1306. 

  1306. 	    IF (err)
    1307. 

  1307. 		error("error in toMixedBase 1");
    1308. 

  1308. 	    expect[j] = hash4(var_type[i], var_rank[i], index, NCT_DOUBLE);
    1309. 

  1309. 	    if (inRange3(expect[j],var_type[i], NCT_DOUBLE)) {
    1310. 

  1310. 		allInIntRange = allInIntRange && expect[j] >= double_min
    1311. 

  1311. 			    && expect[j] <= double_max;
    1312. 

  1312. 	    } else {
    1313. 

  1313. 		allInExtRange = 0;
    1314. 

  1314. 	    }
    1315. 

  1315. 	}
    1316. 

  1316. 	err = nc_get_var_double(ncid, i, value);
    1317. 

  1317. 	if (canConvert) {
    1318. 

  1318. 	    if (allInExtRange) {
    1319. 

  1319. 		if (allInIntRange) {
    1320. 

  1320. 		    IF (err)
    1321. 

  1321. 			error("%s", nc_strerror(err));
    1322. 

  1322. 		} else {
    1323. 

  1323. 		    IF (err != NC_ERANGE)
    1324. 

  1324. 			error("Range error: status = %d", err);
    1325. 

  1325. 		}
    1326. 

  1326. 	    } else {
    1327. 

  1327. 		IF (err != 0 && err != NC_ERANGE)
    1328. 

  1328. 		    error("OK or Range error: status = %d", err);
    1329. 

  1329. 	    }
    1330. 

  1330. 	    for (j = 0; j < nels; j++) {
    1331. 

  1331. 		if (inRange3(expect[j],var_type[i],NCT_DOUBLE)
    1332. 

  1332. 			&& expect[j] >= double_min && expect[j] <= double_max) {
    1333. 

  1333. 		    IF (!equal(value[j],expect[j],var_type[i],NCT_DOUBLE)){
    1334. 

  1334. 			error("value read not that expected");
    1335. 

  1335. 			if (verbose) {
    1336. 

  1336. 			    error("\n");
    1337. 

  1337. 			    error("varid: %d, ", i);
    1338. 

  1338. 			    error("var_name: %s, ", var_name[i]);
    1339. 

  1339. 			    error("element number: %d ", j);
    1340. 

  1340. 			    error("expect: %g", expect[j]);
    1341. 

  1341. 			    error("got: %g", (double) value[j]);
    1342. 

  1342. 			}
    1343. 

  1343. 		    } else {
    1344. 

  1344. 			nok++;
    1345. 

  1345. 		    }
    1346. 

  1346. 		}
    1347. 

  1347. 	    }
    1348. 

  1348. 	} else {
    1349. 

  1349. 	    IF (nels > 0 && err != NC_ECHAR)
    1350. 

  1350. 		error("wrong type: status = %d", err);
    1351. 

  1351. 	}
    1352. 

  1352.     }
    1353. 

  1353.     err = nc_close(ncid);
    1354. 

  1354.     IF (err)
    1355. 

  1355. 	error("nc_close: %s", nc_strerror(err));
    1356. 

  1356.     print_nok(nok);
    1357. 

  1357. }
    1358. 

  1358. 

  1359. 

  1360. 

  1361. 

  1362. void
    1363. 

  1363. test_nc_get_vara_text(void)
    1364. 

  1364. {
    1365. 

  1365.     int ncid;
    1366. 

  1366.     int d;
    1367. 

  1367.     int i;
    1368. 

  1368.     int j;
    1369. 

  1369.     int k;
    1370. 

  1370.     int err;
    1371. 

  1371.     int allInExtRange;	/* all values within external range? */
    1372. 

  1372.     int allInIntRange;	/* all values within internal range? */
    1373. 

  1373.     int nels;
    1374. 

  1374.     int nslabs;
    1375. 

  1375.     int nok = 0;      /* count of valid comparisons */
    1376. 

  1376.     size_t start[MAX_RANK];
    1377. 

  1377.     size_t edge[MAX_RANK];
    1378. 

  1378.     size_t index[MAX_RANK];
    1379. 

  1379.     size_t mid[MAX_RANK];
    1380. 

  1380.     int canConvert;     /* Both text or both numeric */
    1381. 

  1381.     text value[MAX_NELS];
    1382. 

  1382.     double expect[MAX_NELS];
    1383. 

  1383. 

  1384.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    1385. 

  1385.     IF (err)
    1386. 

  1386. 	error("nc_open: %s", nc_strerror(err));
    1387. 

  1387.     for (i = 0; i < NVARS; i++) {
    1388. 

  1388.         canConvert = (var_type[i] == NC_CHAR) == (NCT_TEXT == NCT_TEXT);
    1389. 

  1389.         assert(var_rank[i] <= MAX_RANK);
    1390. 

  1390.         assert(var_nels[i] <= MAX_NELS);
    1391. 

  1391. 	for (j = 0; j < var_rank[i]; j++) {
    1392. 

  1392. 	    start[j] = 0;
    1393. 

  1393. 	    edge[j] = 1;
    1394. 

  1394. 	}
    1395. 

  1395.         err = nc_get_vara_text(BAD_ID, i, start, edge, value);
    1396. 

  1396.         IF (err != NC_EBADID)
    1397. 

  1397. 	    error("bad ncid: status = %d", err);
    1398. 

  1398.         err = nc_get_vara_text(ncid, BAD_VARID, start, edge, value);
    1399. 

  1399.         IF (err != NC_ENOTVAR)
    1400. 

  1400. 	    error("bad var id: status = %d", err);
    1401. 

  1401. 	for (j = 0; j < var_rank[i]; j++) {
    1402. 

  1402. 	    start[j] = var_shape[i][j];
    1403. 

  1403. 	    err = nc_get_vara_text(ncid, i, start, edge, value);
    1404. 

  1404.             IF (canConvert && err != NC_EINVALCOORDS)
    1405. 

  1405.                 error("bad index: status = %d", err);
    1406. 

  1406. 	    start[j] = 0;
    1407. 

  1407. 	    edge[j] = var_shape[i][j] + 1;
    1408. 

  1408. 	    err = nc_get_vara_text(ncid, i, start, edge, value);
    1409. 

  1409.             IF (canConvert && err != NC_EEDGE)
    1410. 

  1410. 		error("bad edge: status = %d", err);
    1411. 

  1411. 	    edge[j] = 1;
    1412. 

  1412. 	}
    1413. 

  1413.             /* Check non-scalars for correct error returned even when */
    1414. 

  1414.             /* there is nothing to get (edge[j]==0) */
    1415. 

  1415. 	if(var_rank[i] > 0) {
    1416. 

  1416. 	    for (j = 0; j < var_rank[i]; j++) {
    1417. 

  1417. 		edge[j] = 0;
    1418. 

  1418. 	    }
    1419. 

  1419. 	    err = nc_get_vara_text(BAD_ID, i, start, edge, value);
    1420. 

  1420. 	    IF (err != NC_EBADID) 
    1421. 

  1421. 		error("bad ncid: status = %d", err);
    1422. 

  1422. 	    err = nc_get_vara_text(ncid, BAD_VARID, start, edge, value);
    1423. 

  1423. 	    IF (err != NC_ENOTVAR) 
    1424. 

  1424. 		error("bad var id: status = %d", err);
    1425. 

  1425. 	    for (j = 0; j < var_rank[i]; j++) {
    1426. 

  1426. 		if (var_dimid[i][j] > 0) {		/* skip record dim */
    1427. 

  1427. 		    start[j] = var_shape[i][j];
    1428. 

  1428. 		    err = nc_get_vara_text(ncid, i, start, edge, value);
    1429. 

  1429. 		    IF (canConvert && err != NC_EINVALCOORDS)
    1430. 

  1430. 			error("bad start: status = %d", err);
    1431. 

  1431. 		    start[j] = 0;
    1432. 

  1432. 		}
    1433. 

  1433. 	    }
    1434. 

  1434. 	    err = nc_get_vara_text(ncid, i, start, edge, value);
    1435. 

  1435. 	    if (canConvert) {
    1436. 

  1436. 		IF (err) 
    1437. 

  1437. 		    error("%s", nc_strerror(err));
    1438. 

  1438. 	    } else {
    1439. 

  1439. 		IF (err != NC_ECHAR)
    1440. 

  1440. 		    error("wrong type: status = %d", err);
    1441. 

  1441. 	    }
    1442. 

  1442. 	    for (j = 0; j < var_rank[i]; j++) {
    1443. 

  1443. 		edge[j] = 1;
    1444. 

  1444. 	    }
    1445. 

  1445. 	}            /* Choose a random point dividing each dim into 2 parts */
    1446. 

  1446.             /* get 2^rank (nslabs) slabs so defined */
    1447. 

  1447.         nslabs = 1;
    1448. 

  1448.         for (j = 0; j < var_rank[i]; j++) {
    1449. 

  1449.             mid[j] = roll( var_shape[i][j] );
    1450. 

  1450.             nslabs *= 2;
    1451. 

  1451.         }
    1452. 

  1452.             /* bits of k determine whether to get lower or upper part of dim */
    1453. 

  1453.         for (k = 0; k < nslabs; k++) {
    1454. 

  1454.             nels = 1;
    1455. 

  1455.             for (j = 0; j < var_rank[i]; j++) {
    1456. 

  1456.                 if ((k >> j) & 1) {
    1457. 

  1457.                     start[j] = 0;
    1458. 

  1458.                     edge[j] = mid[j];
    1459. 

  1459.                 }else{
    1460. 

  1460.                     start[j] = mid[j];
    1461. 

  1461.                     edge[j] = var_shape[i][j] - mid[j];
    1462. 

  1462.                 }
    1463. 

  1463.                 nels *= edge[j];
    1464. 

  1464.             }
    1465. 

  1465. 	    allInExtRange = allInIntRange = 1;
    1466. 

  1466.             for (j = 0; j < nels; j++) {
    1467. 

  1467.                 err = toMixedBase(j, var_rank[i], edge, index);
    1468. 

  1468.                 IF (err)
    1469. 

  1469.                     error("error in toMixedBase 1");
    1470. 

  1470.                 for (d = 0; d < var_rank[i]; d++)
    1471. 

  1471.                     index[d] += start[d];
    1472. 

  1472.                 expect[j] = hash4(var_type[i], var_rank[i], index, NCT_TEXT);
    1473. 

  1473. 		if (inRange3(expect[j],var_type[i], NCT_TEXT)) {
    1474. 

  1474. 		    allInIntRange = allInIntRange && expect[j] >= text_min
    1475. 

  1475. 				&& expect[j] <= text_max;
    1476. 

  1476. 		} else {
    1477. 

  1477. 		    allInExtRange = 0;
    1478. 

  1478. 		}
    1479. 

  1479. 	    }
    1480. 

  1480.             if (var_rank[i] == 0 && i%2)
    1481. 

  1481. 		err = nc_get_vara_text(ncid, i, NULL, NULL, value);
    1482. 

  1482. 	    else
    1483. 

  1483. 		err = nc_get_vara_text(ncid, i, start, edge, value);
    1484. 

  1484.             if (canConvert) {
    1485. 

  1485. 		if (allInExtRange) {
    1486. 

  1486. 		    if (allInIntRange) {
    1487. 

  1487. 			IF (err)
    1488. 

  1488. 			    error("%s", nc_strerror(err));
    1489. 

  1489. 		    } else {
    1490. 

  1490. 			IF (err != NC_ERANGE)
    1491. 

  1491. 			    error("Range error: status = %d", err);
    1492. 

  1492. 		    }
    1493. 

  1493. 		} else {
    1494. 

  1494. 		    IF (err != 0 && err != NC_ERANGE)
    1495. 

  1495. 			error("OK or Range error: status = %d", err);
    1496. 

  1496. 		}
    1497. 

  1497. 		for (j = 0; j < nels; j++) {
    1498. 

  1498. 		    if (inRange3(expect[j],var_type[i],NCT_TEXT)
    1499. 

  1499. 			    && expect[j] >= text_min && expect[j] <= text_max) {
    1500. 

  1500. 			IF (!equal(value[j],expect[j],var_type[i],NCT_TEXT)){
    1501. 

  1501. 			    error("value read not that expected");
    1502. 

  1502. 			    if (verbose) {
    1503. 

  1503. 				error("\n");
    1504. 

  1504. 				error("varid: %d, ", i);
    1505. 

  1505. 				error("var_name: %s, ", var_name[i]);
    1506. 

  1506. 				error("element number: %d ", j);
    1507. 

  1507. 				error("expect: %g", expect[j]);
    1508. 

  1508. 				error("got: %g", (double) value[j]);
    1509. 

  1509. 			    }
    1510. 

  1510. 			} else {
    1511. 

  1511. 			    nok++;
    1512. 

  1512. 			}
    1513. 

  1513. 		    }
    1514. 

  1514. 		}
    1515. 

  1515.             } else {
    1516. 

  1516.                 IF (nels > 0 && err != NC_ECHAR)
    1517. 

  1517.                     error("wrong type: status = %d", err);
    1518. 

  1518.             }
    1519. 

  1519.         }
    1520. 

  1520.     }
    1521. 

  1521.     err = nc_close(ncid);
    1522. 

  1522.     IF (err)
    1523. 

  1523. 	error("nc_close: %s", nc_strerror(err));
    1524. 

  1524.     print_nok(nok);
    1525. 

  1525. }
    1526. 

  1526. 

  1527. void
    1528. 

  1528. test_nc_get_vara_uchar(void)
    1529. 

  1529. {
    1530. 

  1530.     int ncid;
    1531. 

  1531.     int d;
    1532. 

  1532.     int i;
    1533. 

  1533.     int j;
    1534. 

  1534.     int k;
    1535. 

  1535.     int err;
    1536. 

  1536.     int allInExtRange;	/* all values within external range? */
    1537. 

  1537.     int allInIntRange;	/* all values within internal range? */
    1538. 

  1538.     int nels;
    1539. 

  1539.     int nslabs;
    1540. 

  1540.     int nok = 0;      /* count of valid comparisons */
    1541. 

  1541.     size_t start[MAX_RANK];
    1542. 

  1542.     size_t edge[MAX_RANK];
    1543. 

  1543.     size_t index[MAX_RANK];
    1544. 

  1544.     size_t mid[MAX_RANK];
    1545. 

  1545.     int canConvert;     /* Both text or both numeric */
    1546. 

  1546.     uchar value[MAX_NELS];
    1547. 

  1547.     double expect[MAX_NELS];
    1548. 

  1548. 

  1549.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    1550. 

  1550.     IF (err)
    1551. 

  1551. 	error("nc_open: %s", nc_strerror(err));
    1552. 

  1552.     for (i = 0; i < NVARS; i++) {
    1553. 

  1553.         canConvert = (var_type[i] == NC_CHAR) == (NCT_UCHAR == NCT_TEXT);
    1554. 

  1554.         assert(var_rank[i] <= MAX_RANK);
    1555. 

  1555.         assert(var_nels[i] <= MAX_NELS);
    1556. 

  1556. 	for (j = 0; j < var_rank[i]; j++) {
    1557. 

  1557. 	    start[j] = 0;
    1558. 

  1558. 	    edge[j] = 1;
    1559. 

  1559. 	}
    1560. 

  1560.         err = nc_get_vara_uchar(BAD_ID, i, start, edge, value);
    1561. 

  1561.         IF (err != NC_EBADID)
    1562. 

  1562. 	    error("bad ncid: status = %d", err);
    1563. 

  1563.         err = nc_get_vara_uchar(ncid, BAD_VARID, start, edge, value);
    1564. 

  1564.         IF (err != NC_ENOTVAR)
    1565. 

  1565. 	    error("bad var id: status = %d", err);
    1566. 

  1566. 	for (j = 0; j < var_rank[i]; j++) {
    1567. 

  1567. 	    start[j] = var_shape[i][j];
    1568. 

  1568. 	    err = nc_get_vara_uchar(ncid, i, start, edge, value);
    1569. 

  1569.             IF (canConvert && err != NC_EINVALCOORDS)
    1570. 

  1570.                 error("bad index: status = %d", err);
    1571. 

  1571. 	    start[j] = 0;
    1572. 

  1572. 	    edge[j] = var_shape[i][j] + 1;
    1573. 

  1573. 	    err = nc_get_vara_uchar(ncid, i, start, edge, value);
    1574. 

  1574.             IF (canConvert && err != NC_EEDGE)
    1575. 

  1575. 		error("bad edge: status = %d", err);
    1576. 

  1576. 	    edge[j] = 1;
    1577. 

  1577. 	}
    1578. 

  1578.             /* Check non-scalars for correct error returned even when */
    1579. 

  1579.             /* there is nothing to get (edge[j]==0) */
    1580. 

  1580. 	if(var_rank[i] > 0) {
    1581. 

  1581. 	    for (j = 0; j < var_rank[i]; j++) {
    1582. 

  1582. 		edge[j] = 0;
    1583. 

  1583. 	    }
    1584. 

  1584. 	    err = nc_get_vara_uchar(BAD_ID, i, start, edge, value);
    1585. 

  1585. 	    IF (err != NC_EBADID) 
    1586. 

  1586. 		error("bad ncid: status = %d", err);
    1587. 

  1587. 	    err = nc_get_vara_uchar(ncid, BAD_VARID, start, edge, value);
    1588. 

  1588. 	    IF (err != NC_ENOTVAR) 
    1589. 

  1589. 		error("bad var id: status = %d", err);
    1590. 

  1590. 	    for (j = 0; j < var_rank[i]; j++) {
    1591. 

  1591. 		if (var_dimid[i][j] > 0) {		/* skip record dim */
    1592. 

  1592. 		    start[j] = var_shape[i][j];
    1593. 

  1593. 		    err = nc_get_vara_uchar(ncid, i, start, edge, value);
    1594. 

  1594. 		    IF (canConvert && err != NC_EINVALCOORDS)
    1595. 

  1595. 			error("bad start: status = %d", err);
    1596. 

  1596. 		    start[j] = 0;
    1597. 

  1597. 		}
    1598. 

  1598. 	    }
    1599. 

  1599. 	    err = nc_get_vara_uchar(ncid, i, start, edge, value);
    1600. 

  1600. 	    if (canConvert) {
    1601. 

  1601. 		IF (err) 
    1602. 

  1602. 		    error("%s", nc_strerror(err));
    1603. 

  1603. 	    } else {
    1604. 

  1604. 		IF (err != NC_ECHAR)
    1605. 

  1605. 		    error("wrong type: status = %d", err);
    1606. 

  1606. 	    }
    1607. 

  1607. 	    for (j = 0; j < var_rank[i]; j++) {
    1608. 

  1608. 		edge[j] = 1;
    1609. 

  1609. 	    }
    1610. 

  1610. 	}            /* Choose a random point dividing each dim into 2 parts */
    1611. 

  1611.             /* get 2^rank (nslabs) slabs so defined */
    1612. 

  1612.         nslabs = 1;
    1613. 

  1613.         for (j = 0; j < var_rank[i]; j++) {
    1614. 

  1614.             mid[j] = roll( var_shape[i][j] );
    1615. 

  1615.             nslabs *= 2;
    1616. 

  1616.         }
    1617. 

  1617.             /* bits of k determine whether to get lower or upper part of dim */
    1618. 

  1618.         for (k = 0; k < nslabs; k++) {
    1619. 

  1619.             nels = 1;
    1620. 

  1620.             for (j = 0; j < var_rank[i]; j++) {
    1621. 

  1621.                 if ((k >> j) & 1) {
    1622. 

  1622.                     start[j] = 0;
    1623. 

  1623.                     edge[j] = mid[j];
    1624. 

  1624.                 }else{
    1625. 

  1625.                     start[j] = mid[j];
    1626. 

  1626.                     edge[j] = var_shape[i][j] - mid[j];
    1627. 

  1627.                 }
    1628. 

  1628.                 nels *= edge[j];
    1629. 

  1629.             }
    1630. 

  1630. 	    allInExtRange = allInIntRange = 1;
    1631. 

  1631.             for (j = 0; j < nels; j++) {
    1632. 

  1632.                 err = toMixedBase(j, var_rank[i], edge, index);
    1633. 

  1633.                 IF (err)
    1634. 

  1634.                     error("error in toMixedBase 1");
    1635. 

  1635.                 for (d = 0; d < var_rank[i]; d++)
    1636. 

  1636.                     index[d] += start[d];
    1637. 

  1637.                 expect[j] = hash4(var_type[i], var_rank[i], index, NCT_UCHAR);
    1638. 

  1638. 		if (inRange3(expect[j],var_type[i], NCT_UCHAR)) {
    1639. 

  1639. 		    allInIntRange = allInIntRange && expect[j] >= uchar_min
    1640. 

  1640. 				&& expect[j] <= uchar_max;
    1641. 

  1641. 		} else {
    1642. 

  1642. 		    allInExtRange = 0;
    1643. 

  1643. 		}
    1644. 

  1644. 	    }
    1645. 

  1645.             if (var_rank[i] == 0 && i%2)
    1646. 

  1646. 		err = nc_get_vara_uchar(ncid, i, NULL, NULL, value);
    1647. 

  1647. 	    else
    1648. 

  1648. 		err = nc_get_vara_uchar(ncid, i, start, edge, value);
    1649. 

  1649.             if (canConvert) {
    1650. 

  1650. 		if (allInExtRange) {
    1651. 

  1651. 		    if (allInIntRange) {
    1652. 

  1652. 			IF (err)
    1653. 

  1653. 			    error("%s", nc_strerror(err));
    1654. 

  1654. 		    } else {
    1655. 

  1655. 			IF (err != NC_ERANGE)
    1656. 

  1656. 			    error("Range error: status = %d", err);
    1657. 

  1657. 		    }
    1658. 

  1658. 		} else {
    1659. 

  1659. 		    IF (err != 0 && err != NC_ERANGE)
    1660. 

  1660. 			error("OK or Range error: status = %d", err);
    1661. 

  1661. 		}
    1662. 

  1662. 		for (j = 0; j < nels; j++) {
    1663. 

  1663. 		    if (inRange3(expect[j],var_type[i],NCT_UCHAR)
    1664. 

  1664. 			    && expect[j] >= uchar_min && expect[j] <= uchar_max) {
    1665. 

  1665. 			IF (!equal(value[j],expect[j],var_type[i],NCT_UCHAR)){
    1666. 

  1666. 			    error("value read not that expected");
    1667. 

  1667. 			    if (verbose) {
    1668. 

  1668. 				error("\n");
    1669. 

  1669. 				error("varid: %d, ", i);
    1670. 

  1670. 				error("var_name: %s, ", var_name[i]);
    1671. 

  1671. 				error("element number: %d ", j);
    1672. 

  1672. 				error("expect: %g", expect[j]);
    1673. 

  1673. 				error("got: %g", (double) value[j]);
    1674. 

  1674. 			    }
    1675. 

  1675. 			} else {
    1676. 

  1676. 			    nok++;
    1677. 

  1677. 			}
    1678. 

  1678. 		    }
    1679. 

  1679. 		}
    1680. 

  1680.             } else {
    1681. 

  1681.                 IF (nels > 0 && err != NC_ECHAR)
    1682. 

  1682.                     error("wrong type: status = %d", err);
    1683. 

  1683.             }
    1684. 

  1684.         }
    1685. 

  1685.     }
    1686. 

  1686.     err = nc_close(ncid);
    1687. 

  1687.     IF (err)
    1688. 

  1688. 	error("nc_close: %s", nc_strerror(err));
    1689. 

  1689.     print_nok(nok);
    1690. 

  1690. }
    1691. 

  1691. 

  1692. void
    1693. 

  1693. test_nc_get_vara_schar(void)
    1694. 

  1694. {
    1695. 

  1695.     int ncid;
    1696. 

  1696.     int d;
    1697. 

  1697.     int i;
    1698. 

  1698.     int j;
    1699. 

  1699.     int k;
    1700. 

  1700.     int err;
    1701. 

  1701.     int allInExtRange;	/* all values within external range? */
    1702. 

  1702.     int allInIntRange;	/* all values within internal range? */
    1703. 

  1703.     int nels;
    1704. 

  1704.     int nslabs;
    1705. 

  1705.     int nok = 0;      /* count of valid comparisons */
    1706. 

  1706.     size_t start[MAX_RANK];
    1707. 

  1707.     size_t edge[MAX_RANK];
    1708. 

  1708.     size_t index[MAX_RANK];
    1709. 

  1709.     size_t mid[MAX_RANK];
    1710. 

  1710.     int canConvert;     /* Both text or both numeric */
    1711. 

  1711.     schar value[MAX_NELS];
    1712. 

  1712.     double expect[MAX_NELS];
    1713. 

  1713. 

  1714.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    1715. 

  1715.     IF (err)
    1716. 

  1716. 	error("nc_open: %s", nc_strerror(err));
    1717. 

  1717.     for (i = 0; i < NVARS; i++) {
    1718. 

  1718.         canConvert = (var_type[i] == NC_CHAR) == (NCT_SCHAR == NCT_TEXT);
    1719. 

  1719.         assert(var_rank[i] <= MAX_RANK);
    1720. 

  1720.         assert(var_nels[i] <= MAX_NELS);
    1721. 

  1721. 	for (j = 0; j < var_rank[i]; j++) {
    1722. 

  1722. 	    start[j] = 0;
    1723. 

  1723. 	    edge[j] = 1;
    1724. 

  1724. 	}
    1725. 

  1725.         err = nc_get_vara_schar(BAD_ID, i, start, edge, value);
    1726. 

  1726.         IF (err != NC_EBADID)
    1727. 

  1727. 	    error("bad ncid: status = %d", err);
    1728. 

  1728.         err = nc_get_vara_schar(ncid, BAD_VARID, start, edge, value);
    1729. 

  1729.         IF (err != NC_ENOTVAR)
    1730. 

  1730. 	    error("bad var id: status = %d", err);
    1731. 

  1731. 	for (j = 0; j < var_rank[i]; j++) {
    1732. 

  1732. 	    start[j] = var_shape[i][j];
    1733. 

  1733. 	    err = nc_get_vara_schar(ncid, i, start, edge, value);
    1734. 

  1734.             IF (canConvert && err != NC_EINVALCOORDS)
    1735. 

  1735.                 error("bad index: status = %d", err);
    1736. 

  1736. 	    start[j] = 0;
    1737. 

  1737. 	    edge[j] = var_shape[i][j] + 1;
    1738. 

  1738. 	    err = nc_get_vara_schar(ncid, i, start, edge, value);
    1739. 

  1739.             IF (canConvert && err != NC_EEDGE)
    1740. 

  1740. 		error("bad edge: status = %d", err);
    1741. 

  1741. 	    edge[j] = 1;
    1742. 

  1742. 	}
    1743. 

  1743.             /* Check non-scalars for correct error returned even when */
    1744. 

  1744.             /* there is nothing to get (edge[j]==0) */
    1745. 

  1745. 	if(var_rank[i] > 0) {
    1746. 

  1746. 	    for (j = 0; j < var_rank[i]; j++) {
    1747. 

  1747. 		edge[j] = 0;
    1748. 

  1748. 	    }
    1749. 

  1749. 	    err = nc_get_vara_schar(BAD_ID, i, start, edge, value);
    1750. 

  1750. 	    IF (err != NC_EBADID) 
    1751. 

  1751. 		error("bad ncid: status = %d", err);
    1752. 

  1752. 	    err = nc_get_vara_schar(ncid, BAD_VARID, start, edge, value);
    1753. 

  1753. 	    IF (err != NC_ENOTVAR) 
    1754. 

  1754. 		error("bad var id: status = %d", err);
    1755. 

  1755. 	    for (j = 0; j < var_rank[i]; j++) {
    1756. 

  1756. 		if (var_dimid[i][j] > 0) {		/* skip record dim */
    1757. 

  1757. 		    start[j] = var_shape[i][j];
    1758. 

  1758. 		    err = nc_get_vara_schar(ncid, i, start, edge, value);
    1759. 

  1759. 		    IF (canConvert && err != NC_EINVALCOORDS)
    1760. 

  1760. 			error("bad start: status = %d", err);
    1761. 

  1761. 		    start[j] = 0;
    1762. 

  1762. 		}
    1763. 

  1763. 	    }
    1764. 

  1764. 	    err = nc_get_vara_schar(ncid, i, start, edge, value);
    1765. 

  1765. 	    if (canConvert) {
    1766. 

  1766. 		IF (err) 
    1767. 

  1767. 		    error("%s", nc_strerror(err));
    1768. 

  1768. 	    } else {
    1769. 

  1769. 		IF (err != NC_ECHAR)
    1770. 

  1770. 		    error("wrong type: status = %d", err);
    1771. 

  1771. 	    }
    1772. 

  1772. 	    for (j = 0; j < var_rank[i]; j++) {
    1773. 

  1773. 		edge[j] = 1;
    1774. 

  1774. 	    }
    1775. 

  1775. 	}            /* Choose a random point dividing each dim into 2 parts */
    1776. 

  1776.             /* get 2^rank (nslabs) slabs so defined */
    1777. 

  1777.         nslabs = 1;
    1778. 

  1778.         for (j = 0; j < var_rank[i]; j++) {
    1779. 

  1779.             mid[j] = roll( var_shape[i][j] );
    1780. 

  1780.             nslabs *= 2;
    1781. 

  1781.         }
    1782. 

  1782.             /* bits of k determine whether to get lower or upper part of dim */
    1783. 

  1783.         for (k = 0; k < nslabs; k++) {
    1784. 

  1784.             nels = 1;
    1785. 

  1785.             for (j = 0; j < var_rank[i]; j++) {
    1786. 

  1786.                 if ((k >> j) & 1) {
    1787. 

  1787.                     start[j] = 0;
    1788. 

  1788.                     edge[j] = mid[j];
    1789. 

  1789.                 }else{
    1790. 

  1790.                     start[j] = mid[j];
    1791. 

  1791.                     edge[j] = var_shape[i][j] - mid[j];
    1792. 

  1792.                 }
    1793. 

  1793.                 nels *= edge[j];
    1794. 

  1794.             }
    1795. 

  1795. 	    allInExtRange = allInIntRange = 1;
    1796. 

  1796.             for (j = 0; j < nels; j++) {
    1797. 

  1797.                 err = toMixedBase(j, var_rank[i], edge, index);
    1798. 

  1798.                 IF (err)
    1799. 

  1799.                     error("error in toMixedBase 1");
    1800. 

  1800.                 for (d = 0; d < var_rank[i]; d++)
    1801. 

  1801.                     index[d] += start[d];
    1802. 

  1802.                 expect[j] = hash4(var_type[i], var_rank[i], index, NCT_SCHAR);
    1803. 

  1803. 		if (inRange3(expect[j],var_type[i], NCT_SCHAR)) {
    1804. 

  1804. 		    allInIntRange = allInIntRange && expect[j] >= schar_min
    1805. 

  1805. 				&& expect[j] <= schar_max;
    1806. 

  1806. 		} else {
    1807. 

  1807. 		    allInExtRange = 0;
    1808. 

  1808. 		}
    1809. 

  1809. 	    }
    1810. 

  1810.             if (var_rank[i] == 0 && i%2)
    1811. 

  1811. 		err = nc_get_vara_schar(ncid, i, NULL, NULL, value);
    1812. 

  1812. 	    else
    1813. 

  1813. 		err = nc_get_vara_schar(ncid, i, start, edge, value);
    1814. 

  1814.             if (canConvert) {
    1815. 

  1815. 		if (allInExtRange) {
    1816. 

  1816. 		    if (allInIntRange) {
    1817. 

  1817. 			IF (err)
    1818. 

  1818. 			    error("%s", nc_strerror(err));
    1819. 

  1819. 		    } else {
    1820. 

  1820. 			IF (err != NC_ERANGE)
    1821. 

  1821. 			    error("Range error: status = %d", err);
    1822. 

  1822. 		    }
    1823. 

  1823. 		} else {
    1824. 

  1824. 		    IF (err != 0 && err != NC_ERANGE)
    1825. 

  1825. 			error("OK or Range error: status = %d", err);
    1826. 

  1826. 		}
    1827. 

  1827. 		for (j = 0; j < nels; j++) {
    1828. 

  1828. 		    if (inRange3(expect[j],var_type[i],NCT_SCHAR)
    1829. 

  1829. 			    && expect[j] >= schar_min && expect[j] <= schar_max) {
    1830. 

  1830. 			IF (!equal(value[j],expect[j],var_type[i],NCT_SCHAR)){
    1831. 

  1831. 			    error("value read not that expected");
    1832. 

  1832. 			    if (verbose) {
    1833. 

  1833. 				error("\n");
    1834. 

  1834. 				error("varid: %d, ", i);
    1835. 

  1835. 				error("var_name: %s, ", var_name[i]);
    1836. 

  1836. 				error("element number: %d ", j);
    1837. 

  1837. 				error("expect: %g", expect[j]);
    1838. 

  1838. 				error("got: %g", (double) value[j]);
    1839. 

  1839. 			    }
    1840. 

  1840. 			} else {
    1841. 

  1841. 			    nok++;
    1842. 

  1842. 			}
    1843. 

  1843. 		    }
    1844. 

  1844. 		}
    1845. 

  1845.             } else {
    1846. 

  1846.                 IF (nels > 0 && err != NC_ECHAR)
    1847. 

  1847.                     error("wrong type: status = %d", err);
    1848. 

  1848.             }
    1849. 

  1849.         }
    1850. 

  1850.     }
    1851. 

  1851.     err = nc_close(ncid);
    1852. 

  1852.     IF (err)
    1853. 

  1853. 	error("nc_close: %s", nc_strerror(err));
    1854. 

  1854.     print_nok(nok);
    1855. 

  1855. }
    1856. 

  1856. 

  1857. void
    1858. 

  1858. test_nc_get_vara_short(void)
    1859. 

  1859. {
    1860. 

  1860.     int ncid;
    1861. 

  1861.     int d;
    1862. 

  1862.     int i;
    1863. 

  1863.     int j;
    1864. 

  1864.     int k;
    1865. 

  1865.     int err;
    1866. 

  1866.     int allInExtRange;	/* all values within external range? */
    1867. 

  1867.     int allInIntRange;	/* all values within internal range? */
    1868. 

  1868.     int nels;
    1869. 

  1869.     int nslabs;
    1870. 

  1870.     int nok = 0;      /* count of valid comparisons */
    1871. 

  1871.     size_t start[MAX_RANK];
    1872. 

  1872.     size_t edge[MAX_RANK];
    1873. 

  1873.     size_t index[MAX_RANK];
    1874. 

  1874.     size_t mid[MAX_RANK];
    1875. 

  1875.     int canConvert;     /* Both text or both numeric */
    1876. 

  1876.     short value[MAX_NELS];
    1877. 

  1877.     double expect[MAX_NELS];
    1878. 

  1878. 

  1879.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    1880. 

  1880.     IF (err)
    1881. 

  1881. 	error("nc_open: %s", nc_strerror(err));
    1882. 

  1882.     for (i = 0; i < NVARS; i++) {
    1883. 

  1883.         canConvert = (var_type[i] == NC_CHAR) == (NCT_SHORT == NCT_TEXT);
    1884. 

  1884.         assert(var_rank[i] <= MAX_RANK);
    1885. 

  1885.         assert(var_nels[i] <= MAX_NELS);
    1886. 

  1886. 	for (j = 0; j < var_rank[i]; j++) {
    1887. 

  1887. 	    start[j] = 0;
    1888. 

  1888. 	    edge[j] = 1;
    1889. 

  1889. 	}
    1890. 

  1890.         err = nc_get_vara_short(BAD_ID, i, start, edge, value);
    1891. 

  1891.         IF (err != NC_EBADID)
    1892. 

  1892. 	    error("bad ncid: status = %d", err);
    1893. 

  1893.         err = nc_get_vara_short(ncid, BAD_VARID, start, edge, value);
    1894. 

  1894.         IF (err != NC_ENOTVAR)
    1895. 

  1895. 	    error("bad var id: status = %d", err);
    1896. 

  1896. 	for (j = 0; j < var_rank[i]; j++) {
    1897. 

  1897. 	    start[j] = var_shape[i][j];
    1898. 

  1898. 	    err = nc_get_vara_short(ncid, i, start, edge, value);
    1899. 

  1899.             IF (canConvert && err != NC_EINVALCOORDS)
    1900. 

  1900.                 error("bad index: status = %d", err);
    1901. 

  1901. 	    start[j] = 0;
    1902. 

  1902. 	    edge[j] = var_shape[i][j] + 1;
    1903. 

  1903. 	    err = nc_get_vara_short(ncid, i, start, edge, value);
    1904. 

  1904.             IF (canConvert && err != NC_EEDGE)
    1905. 

  1905. 		error("bad edge: status = %d", err);
    1906. 

  1906. 	    edge[j] = 1;
    1907. 

  1907. 	}
    1908. 

  1908.             /* Check non-scalars for correct error returned even when */
    1909. 

  1909.             /* there is nothing to get (edge[j]==0) */
    1910. 

  1910. 	if(var_rank[i] > 0) {
    1911. 

  1911. 	    for (j = 0; j < var_rank[i]; j++) {
    1912. 

  1912. 		edge[j] = 0;
    1913. 

  1913. 	    }
    1914. 

  1914. 	    err = nc_get_vara_short(BAD_ID, i, start, edge, value);
    1915. 

  1915. 	    IF (err != NC_EBADID) 
    1916. 

  1916. 		error("bad ncid: status = %d", err);
    1917. 

  1917. 	    err = nc_get_vara_short(ncid, BAD_VARID, start, edge, value);
    1918. 

  1918. 	    IF (err != NC_ENOTVAR) 
    1919. 

  1919. 		error("bad var id: status = %d", err);
    1920. 

  1920. 	    for (j = 0; j < var_rank[i]; j++) {
    1921. 

  1921. 		if (var_dimid[i][j] > 0) {		/* skip record dim */
    1922. 

  1922. 		    start[j] = var_shape[i][j];
    1923. 

  1923. 		    err = nc_get_vara_short(ncid, i, start, edge, value);
    1924. 

  1924. 		    IF (canConvert && err != NC_EINVALCOORDS)
    1925. 

  1925. 			error("bad start: status = %d", err);
    1926. 

  1926. 		    start[j] = 0;
    1927. 

  1927. 		}
    1928. 

  1928. 	    }
    1929. 

  1929. 	    err = nc_get_vara_short(ncid, i, start, edge, value);
    1930. 

  1930. 	    if (canConvert) {
    1931. 

  1931. 		IF (err) 
    1932. 

  1932. 		    error("%s", nc_strerror(err));
    1933. 

  1933. 	    } else {
    1934. 

  1934. 		IF (err != NC_ECHAR)
    1935. 

  1935. 		    error("wrong type: status = %d", err);
    1936. 

  1936. 	    }
    1937. 

  1937. 	    for (j = 0; j < var_rank[i]; j++) {
    1938. 

  1938. 		edge[j] = 1;
    1939. 

  1939. 	    }
    1940. 

  1940. 	}            /* Choose a random point dividing each dim into 2 parts */
    1941. 

  1941.             /* get 2^rank (nslabs) slabs so defined */
    1942. 

  1942.         nslabs = 1;
    1943. 

  1943.         for (j = 0; j < var_rank[i]; j++) {
    1944. 

  1944.             mid[j] = roll( var_shape[i][j] );
    1945. 

  1945.             nslabs *= 2;
    1946. 

  1946.         }
    1947. 

  1947.             /* bits of k determine whether to get lower or upper part of dim */
    1948. 

  1948.         for (k = 0; k < nslabs; k++) {
    1949. 

  1949.             nels = 1;
    1950. 

  1950.             for (j = 0; j < var_rank[i]; j++) {
    1951. 

  1951.                 if ((k >> j) & 1) {
    1952. 

  1952.                     start[j] = 0;
    1953. 

  1953.                     edge[j] = mid[j];
    1954. 

  1954.                 }else{
    1955. 

  1955.                     start[j] = mid[j];
    1956. 

  1956.                     edge[j] = var_shape[i][j] - mid[j];
    1957. 

  1957.                 }
    1958. 

  1958.                 nels *= edge[j];
    1959. 

  1959.             }
    1960. 

  1960. 	    allInExtRange = allInIntRange = 1;
    1961. 

  1961.             for (j = 0; j < nels; j++) {
    1962. 

  1962.                 err = toMixedBase(j, var_rank[i], edge, index);
    1963. 

  1963.                 IF (err)
    1964. 

  1964.                     error("error in toMixedBase 1");
    1965. 

  1965.                 for (d = 0; d < var_rank[i]; d++)
    1966. 

  1966.                     index[d] += start[d];
    1967. 

  1967.                 expect[j] = hash4(var_type[i], var_rank[i], index, NCT_SHORT);
    1968. 

  1968. 		if (inRange3(expect[j],var_type[i], NCT_SHORT)) {
    1969. 

  1969. 		    allInIntRange = allInIntRange && expect[j] >= short_min
    1970. 

  1970. 				&& expect[j] <= short_max;
    1971. 

  1971. 		} else {
    1972. 

  1972. 		    allInExtRange = 0;
    1973. 

  1973. 		}
    1974. 

  1974. 	    }
    1975. 

  1975.             if (var_rank[i] == 0 && i%2)
    1976. 

  1976. 		err = nc_get_vara_short(ncid, i, NULL, NULL, value);
    1977. 

  1977. 	    else
    1978. 

  1978. 		err = nc_get_vara_short(ncid, i, start, edge, value);
    1979. 

  1979.             if (canConvert) {
    1980. 

  1980. 		if (allInExtRange) {
    1981. 

  1981. 		    if (allInIntRange) {
    1982. 

  1982. 			IF (err)
    1983. 

  1983. 			    error("%s", nc_strerror(err));
    1984. 

  1984. 		    } else {
    1985. 

  1985. 			IF (err != NC_ERANGE)
    1986. 

  1986. 			    error("Range error: status = %d", err);
    1987. 

  1987. 		    }
    1988. 

  1988. 		} else {
    1989. 

  1989. 		    IF (err != 0 && err != NC_ERANGE)
    1990. 

  1990. 			error("OK or Range error: status = %d", err);
    1991. 

  1991. 		}
    1992. 

  1992. 		for (j = 0; j < nels; j++) {
    1993. 

  1993. 		    if (inRange3(expect[j],var_type[i],NCT_SHORT)
    1994. 

  1994. 			    && expect[j] >= short_min && expect[j] <= short_max) {
    1995. 

  1995. 			IF (!equal(value[j],expect[j],var_type[i],NCT_SHORT)){
    1996. 

  1996. 			    error("value read not that expected");
    1997. 

  1997. 			    if (verbose) {
    1998. 

  1998. 				error("\n");
    1999. 

  1999. 				error("varid: %d, ", i);
    2000. 

  2000. 				error("var_name: %s, ", var_name[i]);
    2001. 

  2001. 				error("element number: %d ", j);
    2002. 

  2002. 				error("expect: %g", expect[j]);
    2003. 

  2003. 				error("got: %g", (double) value[j]);
    2004. 

  2004. 			    }
    2005. 

  2005. 			} else {
    2006. 

  2006. 			    nok++;
    2007. 

  2007. 			}
    2008. 

  2008. 		    }
    2009. 

  2009. 		}
    2010. 

  2010.             } else {
    2011. 

  2011.                 IF (nels > 0 && err != NC_ECHAR)
    2012. 

  2012.                     error("wrong type: status = %d", err);
    2013. 

  2013.             }
    2014. 

  2014.         }
    2015. 

  2015.     }
    2016. 

  2016.     err = nc_close(ncid);
    2017. 

  2017.     IF (err)
    2018. 

  2018. 	error("nc_close: %s", nc_strerror(err));
    2019. 

  2019.     print_nok(nok);
    2020. 

  2020. }
    2021. 

  2021. 

  2022. void
    2023. 

  2023. test_nc_get_vara_int(void)
    2024. 

  2024. {
    2025. 

  2025.     int ncid;
    2026. 

  2026.     int d;
    2027. 

  2027.     int i;
    2028. 

  2028.     int j;
    2029. 

  2029.     int k;
    2030. 

  2030.     int err;
    2031. 

  2031.     int allInExtRange;	/* all values within external range? */
    2032. 

  2032.     int allInIntRange;	/* all values within internal range? */
    2033. 

  2033.     int nels;
    2034. 

  2034.     int nslabs;
    2035. 

  2035.     int nok = 0;      /* count of valid comparisons */
    2036. 

  2036.     size_t start[MAX_RANK];
    2037. 

  2037.     size_t edge[MAX_RANK];
    2038. 

  2038.     size_t index[MAX_RANK];
    2039. 

  2039.     size_t mid[MAX_RANK];
    2040. 

  2040.     int canConvert;     /* Both text or both numeric */
    2041. 

  2041.     int value[MAX_NELS];
    2042. 

  2042.     double expect[MAX_NELS];
    2043. 

  2043. 

  2044.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    2045. 

  2045.     IF (err)
    2046. 

  2046. 	error("nc_open: %s", nc_strerror(err));
    2047. 

  2047.     for (i = 0; i < NVARS; i++) {
    2048. 

  2048.         canConvert = (var_type[i] == NC_CHAR) == (NCT_INT == NCT_TEXT);
    2049. 

  2049.         assert(var_rank[i] <= MAX_RANK);
    2050. 

  2050.         assert(var_nels[i] <= MAX_NELS);
    2051. 

  2051. 	for (j = 0; j < var_rank[i]; j++) {
    2052. 

  2052. 	    start[j] = 0;
    2053. 

  2053. 	    edge[j] = 1;
    2054. 

  2054. 	}
    2055. 

  2055.         err = nc_get_vara_int(BAD_ID, i, start, edge, value);
    2056. 

  2056.         IF (err != NC_EBADID)
    2057. 

  2057. 	    error("bad ncid: status = %d", err);
    2058. 

  2058.         err = nc_get_vara_int(ncid, BAD_VARID, start, edge, value);
    2059. 

  2059.         IF (err != NC_ENOTVAR)
    2060. 

  2060. 	    error("bad var id: status = %d", err);
    2061. 

  2061. 	for (j = 0; j < var_rank[i]; j++) {
    2062. 

  2062. 	    start[j] = var_shape[i][j];
    2063. 

  2063. 	    err = nc_get_vara_int(ncid, i, start, edge, value);
    2064. 

  2064.             IF (canConvert && err != NC_EINVALCOORDS)
    2065. 

  2065.                 error("bad index: status = %d", err);
    2066. 

  2066. 	    start[j] = 0;
    2067. 

  2067. 	    edge[j] = var_shape[i][j] + 1;
    2068. 

  2068. 	    err = nc_get_vara_int(ncid, i, start, edge, value);
    2069. 

  2069.             IF (canConvert && err != NC_EEDGE)
    2070. 

  2070. 		error("bad edge: status = %d", err);
    2071. 

  2071. 	    edge[j] = 1;
    2072. 

  2072. 	}
    2073. 

  2073.             /* Check non-scalars for correct error returned even when */
    2074. 

  2074.             /* there is nothing to get (edge[j]==0) */
    2075. 

  2075. 	if(var_rank[i] > 0) {
    2076. 

  2076. 	    for (j = 0; j < var_rank[i]; j++) {
    2077. 

  2077. 		edge[j] = 0;
    2078. 

  2078. 	    }
    2079. 

  2079. 	    err = nc_get_vara_int(BAD_ID, i, start, edge, value);
    2080. 

  2080. 	    IF (err != NC_EBADID) 
    2081. 

  2081. 		error("bad ncid: status = %d", err);
    2082. 

  2082. 	    err = nc_get_vara_int(ncid, BAD_VARID, start, edge, value);
    2083. 

  2083. 	    IF (err != NC_ENOTVAR) 
    2084. 

  2084. 		error("bad var id: status = %d", err);
    2085. 

  2085. 	    for (j = 0; j < var_rank[i]; j++) {
    2086. 

  2086. 		if (var_dimid[i][j] > 0) {		/* skip record dim */
    2087. 

  2087. 		    start[j] = var_shape[i][j];
    2088. 

  2088. 		    err = nc_get_vara_int(ncid, i, start, edge, value);
    2089. 

  2089. 		    IF (canConvert && err != NC_EINVALCOORDS)
    2090. 

  2090. 			error("bad start: status = %d", err);
    2091. 

  2091. 		    start[j] = 0;
    2092. 

  2092. 		}
    2093. 

  2093. 	    }
    2094. 

  2094. 	    err = nc_get_vara_int(ncid, i, start, edge, value);
    2095. 

  2095. 	    if (canConvert) {
    2096. 

  2096. 		IF (err) 
    2097. 

  2097. 		    error("%s", nc_strerror(err));
    2098. 

  2098. 	    } else {
    2099. 

  2099. 		IF (err != NC_ECHAR)
    2100. 

  2100. 		    error("wrong type: status = %d", err);
    2101. 

  2101. 	    }
    2102. 

  2102. 	    for (j = 0; j < var_rank[i]; j++) {
    2103. 

  2103. 		edge[j] = 1;
    2104. 

  2104. 	    }
    2105. 

  2105. 	}            /* Choose a random point dividing each dim into 2 parts */
    2106. 

  2106.             /* get 2^rank (nslabs) slabs so defined */
    2107. 

  2107.         nslabs = 1;
    2108. 

  2108.         for (j = 0; j < var_rank[i]; j++) {
    2109. 

  2109.             mid[j] = roll( var_shape[i][j] );
    2110. 

  2110.             nslabs *= 2;
    2111. 

  2111.         }
    2112. 

  2112.             /* bits of k determine whether to get lower or upper part of dim */
    2113. 

  2113.         for (k = 0; k < nslabs; k++) {
    2114. 

  2114.             nels = 1;
    2115. 

  2115.             for (j = 0; j < var_rank[i]; j++) {
    2116. 

  2116.                 if ((k >> j) & 1) {
    2117. 

  2117.                     start[j] = 0;
    2118. 

  2118.                     edge[j] = mid[j];
    2119. 

  2119.                 }else{
    2120. 

  2120.                     start[j] = mid[j];
    2121. 

  2121.                     edge[j] = var_shape[i][j] - mid[j];
    2122. 

  2122.                 }
    2123. 

  2123.                 nels *= edge[j];
    2124. 

  2124.             }
    2125. 

  2125. 	    allInExtRange = allInIntRange = 1;
    2126. 

  2126.             for (j = 0; j < nels; j++) {
    2127. 

  2127.                 err = toMixedBase(j, var_rank[i], edge, index);
    2128. 

  2128.                 IF (err)
    2129. 

  2129.                     error("error in toMixedBase 1");
    2130. 

  2130.                 for (d = 0; d < var_rank[i]; d++)
    2131. 

  2131.                     index[d] += start[d];
    2132. 

  2132.                 expect[j] = hash4(var_type[i], var_rank[i], index, NCT_INT);
    2133. 

  2133. 		if (inRange3(expect[j],var_type[i], NCT_INT)) {
    2134. 

  2134. 		    allInIntRange = allInIntRange && expect[j] >= int_min
    2135. 

  2135. 				&& expect[j] <= int_max;
    2136. 

  2136. 		} else {
    2137. 

  2137. 		    allInExtRange = 0;
    2138. 

  2138. 		}
    2139. 

  2139. 	    }
    2140. 

  2140.             if (var_rank[i] == 0 && i%2)
    2141. 

  2141. 		err = nc_get_vara_int(ncid, i, NULL, NULL, value);
    2142. 

  2142. 	    else
    2143. 

  2143. 		err = nc_get_vara_int(ncid, i, start, edge, value);
    2144. 

  2144.             if (canConvert) {
    2145. 

  2145. 		if (allInExtRange) {
    2146. 

  2146. 		    if (allInIntRange) {
    2147. 

  2147. 			IF (err)
    2148. 

  2148. 			    error("%s", nc_strerror(err));
    2149. 

  2149. 		    } else {
    2150. 

  2150. 			IF (err != NC_ERANGE)
    2151. 

  2151. 			    error("Range error: status = %d", err);
    2152. 

  2152. 		    }
    2153. 

  2153. 		} else {
    2154. 

  2154. 		    IF (err != 0 && err != NC_ERANGE)
    2155. 

  2155. 			error("OK or Range error: status = %d", err);
    2156. 

  2156. 		}
    2157. 

  2157. 		for (j = 0; j < nels; j++) {
    2158. 

  2158. 		    if (inRange3(expect[j],var_type[i],NCT_INT)
    2159. 

  2159. 			    && expect[j] >= int_min && expect[j] <= int_max) {
    2160. 

  2160. 			IF (!equal(value[j],expect[j],var_type[i],NCT_INT)){
    2161. 

  2161. 			    error("value read not that expected");
    2162. 

  2162. 			    if (verbose) {
    2163. 

  2163. 				error("\n");
    2164. 

  2164. 				error("varid: %d, ", i);
    2165. 

  2165. 				error("var_name: %s, ", var_name[i]);
    2166. 

  2166. 				error("element number: %d ", j);
    2167. 

  2167. 				error("expect: %g", expect[j]);
    2168. 

  2168. 				error("got: %g", (double) value[j]);
    2169. 

  2169. 			    }
    2170. 

  2170. 			} else {
    2171. 

  2171. 			    nok++;
    2172. 

  2172. 			}
    2173. 

  2173. 		    }
    2174. 

  2174. 		}
    2175. 

  2175.             } else {
    2176. 

  2176.                 IF (nels > 0 && err != NC_ECHAR)
    2177. 

  2177.                     error("wrong type: status = %d", err);
    2178. 

  2178.             }
    2179. 

  2179.         }
    2180. 

  2180.     }
    2181. 

  2181.     err = nc_close(ncid);
    2182. 

  2182.     IF (err)
    2183. 

  2183. 	error("nc_close: %s", nc_strerror(err));
    2184. 

  2184.     print_nok(nok);
    2185. 

  2185. }
    2186. 

  2186. 

  2187. void
    2188. 

  2188. test_nc_get_vara_long(void)
    2189. 

  2189. {
    2190. 

  2190.     int ncid;
    2191. 

  2191.     int d;
    2192. 

  2192.     int i;
    2193. 

  2193.     int j;
    2194. 

  2194.     int k;
    2195. 

  2195.     int err;
    2196. 

  2196.     int allInExtRange;	/* all values within external range? */
    2197. 

  2197.     int allInIntRange;	/* all values within internal range? */
    2198. 

  2198.     int nels;
    2199. 

  2199.     int nslabs;
    2200. 

  2200.     int nok = 0;      /* count of valid comparisons */
    2201. 

  2201.     size_t start[MAX_RANK];
    2202. 

  2202.     size_t edge[MAX_RANK];
    2203. 

  2203.     size_t index[MAX_RANK];
    2204. 

  2204.     size_t mid[MAX_RANK];
    2205. 

  2205.     int canConvert;     /* Both text or both numeric */
    2206. 

  2206.     long value[MAX_NELS];
    2207. 

  2207.     double expect[MAX_NELS];
    2208. 

  2208. 

  2209.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    2210. 

  2210.     IF (err)
    2211. 

  2211. 	error("nc_open: %s", nc_strerror(err));
    2212. 

  2212.     for (i = 0; i < NVARS; i++) {
    2213. 

  2213.         canConvert = (var_type[i] == NC_CHAR) == (NCT_LONG == NCT_TEXT);
    2214. 

  2214.         assert(var_rank[i] <= MAX_RANK);
    2215. 

  2215.         assert(var_nels[i] <= MAX_NELS);
    2216. 

  2216. 	for (j = 0; j < var_rank[i]; j++) {
    2217. 

  2217. 	    start[j] = 0;
    2218. 

  2218. 	    edge[j] = 1;
    2219. 

  2219. 	}
    2220. 

  2220.         err = nc_get_vara_long(BAD_ID, i, start, edge, value);
    2221. 

  2221.         IF (err != NC_EBADID)
    2222. 

  2222. 	    error("bad ncid: status = %d", err);
    2223. 

  2223.         err = nc_get_vara_long(ncid, BAD_VARID, start, edge, value);
    2224. 

  2224.         IF (err != NC_ENOTVAR)
    2225. 

  2225. 	    error("bad var id: status = %d", err);
    2226. 

  2226. 	for (j = 0; j < var_rank[i]; j++) {
    2227. 

  2227. 	    start[j] = var_shape[i][j];
    2228. 

  2228. 	    err = nc_get_vara_long(ncid, i, start, edge, value);
    2229. 

  2229.             IF (canConvert && err != NC_EINVALCOORDS)
    2230. 

  2230.                 error("bad index: status = %d", err);
    2231. 

  2231. 	    start[j] = 0;
    2232. 

  2232. 	    edge[j] = var_shape[i][j] + 1;
    2233. 

  2233. 	    err = nc_get_vara_long(ncid, i, start, edge, value);
    2234. 

  2234.             IF (canConvert && err != NC_EEDGE)
    2235. 

  2235. 		error("bad edge: status = %d", err);
    2236. 

  2236. 	    edge[j] = 1;
    2237. 

  2237. 	}
    2238. 

  2238.             /* Check non-scalars for correct error returned even when */
    2239. 

  2239.             /* there is nothing to get (edge[j]==0) */
    2240. 

  2240. 	if(var_rank[i] > 0) {
    2241. 

  2241. 	    for (j = 0; j < var_rank[i]; j++) {
    2242. 

  2242. 		edge[j] = 0;
    2243. 

  2243. 	    }
    2244. 

  2244. 	    err = nc_get_vara_long(BAD_ID, i, start, edge, value);
    2245. 

  2245. 	    IF (err != NC_EBADID) 
    2246. 

  2246. 		error("bad ncid: status = %d", err);
    2247. 

  2247. 	    err = nc_get_vara_long(ncid, BAD_VARID, start, edge, value);
    2248. 

  2248. 	    IF (err != NC_ENOTVAR) 
    2249. 

  2249. 		error("bad var id: status = %d", err);
    2250. 

  2250. 	    for (j = 0; j < var_rank[i]; j++) {
    2251. 

  2251. 		if (var_dimid[i][j] > 0) {		/* skip record dim */
    2252. 

  2252. 		    start[j] = var_shape[i][j];
    2253. 

  2253. 		    err = nc_get_vara_long(ncid, i, start, edge, value);
    2254. 

  2254. 		    IF (canConvert && err != NC_EINVALCOORDS)
    2255. 

  2255. 			error("bad start: status = %d", err);
    2256. 

  2256. 		    start[j] = 0;
    2257. 

  2257. 		}
    2258. 

  2258. 	    }
    2259. 

  2259. 	    err = nc_get_vara_long(ncid, i, start, edge, value);
    2260. 

  2260. 	    if (canConvert) {
    2261. 

  2261. 		IF (err) 
    2262. 

  2262. 		    error("%s", nc_strerror(err));
    2263. 

  2263. 	    } else {
    2264. 

  2264. 		IF (err != NC_ECHAR)
    2265. 

  2265. 		    error("wrong type: status = %d", err);
    2266. 

  2266. 	    }
    2267. 

  2267. 	    for (j = 0; j < var_rank[i]; j++) {
    2268. 

  2268. 		edge[j] = 1;
    2269. 

  2269. 	    }
    2270. 

  2270. 	}            /* Choose a random point dividing each dim into 2 parts */
    2271. 

  2271.             /* get 2^rank (nslabs) slabs so defined */
    2272. 

  2272.         nslabs = 1;
    2273. 

  2273.         for (j = 0; j < var_rank[i]; j++) {
    2274. 

  2274.             mid[j] = roll( var_shape[i][j] );
    2275. 

  2275.             nslabs *= 2;
    2276. 

  2276.         }
    2277. 

  2277.             /* bits of k determine whether to get lower or upper part of dim */
    2278. 

  2278.         for (k = 0; k < nslabs; k++) {
    2279. 

  2279.             nels = 1;
    2280. 

  2280.             for (j = 0; j < var_rank[i]; j++) {
    2281. 

  2281.                 if ((k >> j) & 1) {
    2282. 

  2282.                     start[j] = 0;
    2283. 

  2283.                     edge[j] = mid[j];
    2284. 

  2284.                 }else{
    2285. 

  2285.                     start[j] = mid[j];
    2286. 

  2286.                     edge[j] = var_shape[i][j] - mid[j];
    2287. 

  2287.                 }
    2288. 

  2288.                 nels *= edge[j];
    2289. 

  2289.             }
    2290. 

  2290. 	    allInExtRange = allInIntRange = 1;
    2291. 

  2291.             for (j = 0; j < nels; j++) {
    2292. 

  2292.                 err = toMixedBase(j, var_rank[i], edge, index);
    2293. 

  2293.                 IF (err)
    2294. 

  2294.                     error("error in toMixedBase 1");
    2295. 

  2295.                 for (d = 0; d < var_rank[i]; d++)
    2296. 

  2296.                     index[d] += start[d];
    2297. 

  2297.                 expect[j] = hash4(var_type[i], var_rank[i], index, NCT_LONG);
    2298. 

  2298. 		if (inRange3(expect[j],var_type[i], NCT_LONG)) {
    2299. 

  2299. 		    allInIntRange = allInIntRange && expect[j] >= long_min
    2300. 

  2300. 				&& expect[j] <= long_max;
    2301. 

  2301. 		} else {
    2302. 

  2302. 		    allInExtRange = 0;
    2303. 

  2303. 		}
    2304. 

  2304. 	    }
    2305. 

  2305.             if (var_rank[i] == 0 && i%2)
    2306. 

  2306. 		err = nc_get_vara_long(ncid, i, NULL, NULL, value);
    2307. 

  2307. 	    else
    2308. 

  2308. 		err = nc_get_vara_long(ncid, i, start, edge, value);
    2309. 

  2309.             if (canConvert) {
    2310. 

  2310. 		if (allInExtRange) {
    2311. 

  2311. 		    if (allInIntRange) {
    2312. 

  2312. 			IF (err)
    2313. 

  2313. 			    error("%s", nc_strerror(err));
    2314. 

  2314. 		    } else {
    2315. 

  2315. 			IF (err != NC_ERANGE)
    2316. 

  2316. 			    error("Range error: status = %d", err);
    2317. 

  2317. 		    }
    2318. 

  2318. 		} else {
    2319. 

  2319. 		    IF (err != 0 && err != NC_ERANGE)
    2320. 

  2320. 			error("OK or Range error: status = %d", err);
    2321. 

  2321. 		}
    2322. 

  2322. 		for (j = 0; j < nels; j++) {
    2323. 

  2323. 		    if (inRange3(expect[j],var_type[i],NCT_LONG)
    2324. 

  2324. 			    && expect[j] >= long_min && expect[j] <= long_max) {
    2325. 

  2325. 			IF (!equal(value[j],expect[j],var_type[i],NCT_LONG)){
    2326. 

  2326. 			    error("value read not that expected");
    2327. 

  2327. 			    if (verbose) {
    2328. 

  2328. 				error("\n");
    2329. 

  2329. 				error("varid: %d, ", i);
    2330. 

  2330. 				error("var_name: %s, ", var_name[i]);
    2331. 

  2331. 				error("element number: %d ", j);
    2332. 

  2332. 				error("expect: %g", expect[j]);
    2333. 

  2333. 				error("got: %g", (double) value[j]);
    2334. 

  2334. 			    }
    2335. 

  2335. 			} else {
    2336. 

  2336. 			    nok++;
    2337. 

  2337. 			}
    2338. 

  2338. 		    }
    2339. 

  2339. 		}
    2340. 

  2340.             } else {
    2341. 

  2341.                 IF (nels > 0 && err != NC_ECHAR)
    2342. 

  2342.                     error("wrong type: status = %d", err);
    2343. 

  2343.             }
    2344. 

  2344.         }
    2345. 

  2345.     }
    2346. 

  2346.     err = nc_close(ncid);
    2347. 

  2347.     IF (err)
    2348. 

  2348. 	error("nc_close: %s", nc_strerror(err));
    2349. 

  2349.     print_nok(nok);
    2350. 

  2350. }
    2351. 

  2351. 

  2352. void
    2353. 

  2353. test_nc_get_vara_float(void)
    2354. 

  2354. {
    2355. 

  2355.     int ncid;
    2356. 

  2356.     int d;
    2357. 

  2357.     int i;
    2358. 

  2358.     int j;
    2359. 

  2359.     int k;
    2360. 

  2360.     int err;
    2361. 

  2361.     int allInExtRange;	/* all values within external range? */
    2362. 

  2362.     int allInIntRange;	/* all values within internal range? */
    2363. 

  2363.     int nels;
    2364. 

  2364.     int nslabs;
    2365. 

  2365.     int nok = 0;      /* count of valid comparisons */
    2366. 

  2366.     size_t start[MAX_RANK];
    2367. 

  2367.     size_t edge[MAX_RANK];
    2368. 

  2368.     size_t index[MAX_RANK];
    2369. 

  2369.     size_t mid[MAX_RANK];
    2370. 

  2370.     int canConvert;     /* Both text or both numeric */
    2371. 

  2371.     float value[MAX_NELS];
    2372. 

  2372.     double expect[MAX_NELS];
    2373. 

  2373. 

  2374.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    2375. 

  2375.     IF (err)
    2376. 

  2376. 	error("nc_open: %s", nc_strerror(err));
    2377. 

  2377.     for (i = 0; i < NVARS; i++) {
    2378. 

  2378.         canConvert = (var_type[i] == NC_CHAR) == (NCT_FLOAT == NCT_TEXT);
    2379. 

  2379.         assert(var_rank[i] <= MAX_RANK);
    2380. 

  2380.         assert(var_nels[i] <= MAX_NELS);
    2381. 

  2381. 	for (j = 0; j < var_rank[i]; j++) {
    2382. 

  2382. 	    start[j] = 0;
    2383. 

  2383. 	    edge[j] = 1;
    2384. 

  2384. 	}
    2385. 

  2385.         err = nc_get_vara_float(BAD_ID, i, start, edge, value);
    2386. 

  2386.         IF (err != NC_EBADID)
    2387. 

  2387. 	    error("bad ncid: status = %d", err);
    2388. 

  2388.         err = nc_get_vara_float(ncid, BAD_VARID, start, edge, value);
    2389. 

  2389.         IF (err != NC_ENOTVAR)
    2390. 

  2390. 	    error("bad var id: status = %d", err);
    2391. 

  2391. 	for (j = 0; j < var_rank[i]; j++) {
    2392. 

  2392. 	    start[j] = var_shape[i][j];
    2393. 

  2393. 	    err = nc_get_vara_float(ncid, i, start, edge, value);
    2394. 

  2394.             IF (canConvert && err != NC_EINVALCOORDS)
    2395. 

  2395.                 error("bad index: status = %d", err);
    2396. 

  2396. 	    start[j] = 0;
    2397. 

  2397. 	    edge[j] = var_shape[i][j] + 1;
    2398. 

  2398. 	    err = nc_get_vara_float(ncid, i, start, edge, value);
    2399. 

  2399.             IF (canConvert && err != NC_EEDGE)
    2400. 

  2400. 		error("bad edge: status = %d", err);
    2401. 

  2401. 	    edge[j] = 1;
    2402. 

  2402. 	}
    2403. 

  2403.             /* Check non-scalars for correct error returned even when */
    2404. 

  2404.             /* there is nothing to get (edge[j]==0) */
    2405. 

  2405. 	if(var_rank[i] > 0) {
    2406. 

  2406. 	    for (j = 0; j < var_rank[i]; j++) {
    2407. 

  2407. 		edge[j] = 0;
    2408. 

  2408. 	    }
    2409. 

  2409. 	    err = nc_get_vara_float(BAD_ID, i, start, edge, value);
    2410. 

  2410. 	    IF (err != NC_EBADID) 
    2411. 

  2411. 		error("bad ncid: status = %d", err);
    2412. 

  2412. 	    err = nc_get_vara_float(ncid, BAD_VARID, start, edge, value);
    2413. 

  2413. 	    IF (err != NC_ENOTVAR) 
    2414. 

  2414. 		error("bad var id: status = %d", err);
    2415. 

  2415. 	    for (j = 0; j < var_rank[i]; j++) {
    2416. 

  2416. 		if (var_dimid[i][j] > 0) {		/* skip record dim */
    2417. 

  2417. 		    start[j] = var_shape[i][j];
    2418. 

  2418. 		    err = nc_get_vara_float(ncid, i, start, edge, value);
    2419. 

  2419. 		    IF (canConvert && err != NC_EINVALCOORDS)
    2420. 

  2420. 			error("bad start: status = %d", err);
    2421. 

  2421. 		    start[j] = 0;
    2422. 

  2422. 		}
    2423. 

  2423. 	    }
    2424. 

  2424. 	    err = nc_get_vara_float(ncid, i, start, edge, value);
    2425. 

  2425. 	    if (canConvert) {
    2426. 

  2426. 		IF (err) 
    2427. 

  2427. 		    error("%s", nc_strerror(err));
    2428. 

  2428. 	    } else {
    2429. 

  2429. 		IF (err != NC_ECHAR)
    2430. 

  2430. 		    error("wrong type: status = %d", err);
    2431. 

  2431. 	    }
    2432. 

  2432. 	    for (j = 0; j < var_rank[i]; j++) {
    2433. 

  2433. 		edge[j] = 1;
    2434. 

  2434. 	    }
    2435. 

  2435. 	}            /* Choose a random point dividing each dim into 2 parts */
    2436. 

  2436.             /* get 2^rank (nslabs) slabs so defined */
    2437. 

  2437.         nslabs = 1;
    2438. 

  2438.         for (j = 0; j < var_rank[i]; j++) {
    2439. 

  2439.             mid[j] = roll( var_shape[i][j] );
    2440. 

  2440.             nslabs *= 2;
    2441. 

  2441.         }
    2442. 

  2442.             /* bits of k determine whether to get lower or upper part of dim */
    2443. 

  2443.         for (k = 0; k < nslabs; k++) {
    2444. 

  2444.             nels = 1;
    2445. 

  2445.             for (j = 0; j < var_rank[i]; j++) {
    2446. 

  2446.                 if ((k >> j) & 1) {
    2447. 

  2447.                     start[j] = 0;
    2448. 

  2448.                     edge[j] = mid[j];
    2449. 

  2449.                 }else{
    2450. 

  2450.                     start[j] = mid[j];
    2451. 

  2451.                     edge[j] = var_shape[i][j] - mid[j];
    2452. 

  2452.                 }
    2453. 

  2453.                 nels *= edge[j];
    2454. 

  2454.             }
    2455. 

  2455. 	    allInExtRange = allInIntRange = 1;
    2456. 

  2456.             for (j = 0; j < nels; j++) {
    2457. 

  2457.                 err = toMixedBase(j, var_rank[i], edge, index);
    2458. 

  2458.                 IF (err)
    2459. 

  2459.                     error("error in toMixedBase 1");
    2460. 

  2460.                 for (d = 0; d < var_rank[i]; d++)
    2461. 

  2461.                     index[d] += start[d];
    2462. 

  2462.                 expect[j] = hash4(var_type[i], var_rank[i], index, NCT_FLOAT);
    2463. 

  2463. 		if (inRange3(expect[j],var_type[i], NCT_FLOAT)) {
    2464. 

  2464. 		    allInIntRange = allInIntRange && expect[j] >= float_min
    2465. 

  2465. 				&& expect[j] <= float_max;
    2466. 

  2466. 		} else {
    2467. 

  2467. 		    allInExtRange = 0;
    2468. 

  2468. 		}
    2469. 

  2469. 	    }
    2470. 

  2470.             if (var_rank[i] == 0 && i%2)
    2471. 

  2471. 		err = nc_get_vara_float(ncid, i, NULL, NULL, value);
    2472. 

  2472. 	    else
    2473. 

  2473. 		err = nc_get_vara_float(ncid, i, start, edge, value);
    2474. 

  2474.             if (canConvert) {
    2475. 

  2475. 		if (allInExtRange) {
    2476. 

  2476. 		    if (allInIntRange) {
    2477. 

  2477. 			IF (err)
    2478. 

  2478. 			    error("%s", nc_strerror(err));
    2479. 

  2479. 		    } else {
    2480. 

  2480. 			IF (err != NC_ERANGE)
    2481. 

  2481. 			    error("Range error: status = %d", err);
    2482. 

  2482. 		    }
    2483. 

  2483. 		} else {
    2484. 

  2484. 		    IF (err != 0 && err != NC_ERANGE)
    2485. 

  2485. 			error("OK or Range error: status = %d", err);
    2486. 

  2486. 		}
    2487. 

  2487. 		for (j = 0; j < nels; j++) {
    2488. 

  2488. 		    if (inRange3(expect[j],var_type[i],NCT_FLOAT)
    2489. 

  2489. 			    && expect[j] >= float_min && expect[j] <= float_max) {
    2490. 

  2490. 			IF (!equal(value[j],expect[j],var_type[i],NCT_FLOAT)){
    2491. 

  2491. 			    error("value read not that expected");
    2492. 

  2492. 			    if (verbose) {
    2493. 

  2493. 				error("\n");
    2494. 

  2494. 				error("varid: %d, ", i);
    2495. 

  2495. 				error("var_name: %s, ", var_name[i]);
    2496. 

  2496. 				error("element number: %d ", j);
    2497. 

  2497. 				error("expect: %g", expect[j]);
    2498. 

  2498. 				error("got: %g", (double) value[j]);
    2499. 

  2499. 			    }
    2500. 

  2500. 			} else {
    2501. 

  2501. 			    nok++;
    2502. 

  2502. 			}
    2503. 

  2503. 		    }
    2504. 

  2504. 		}
    2505. 

  2505.             } else {
    2506. 

  2506.                 IF (nels > 0 && err != NC_ECHAR)
    2507. 

  2507.                     error("wrong type: status = %d", err);
    2508. 

  2508.             }
    2509. 

  2509.         }
    2510. 

  2510.     }
    2511. 

  2511.     err = nc_close(ncid);
    2512. 

  2512.     IF (err)
    2513. 

  2513. 	error("nc_close: %s", nc_strerror(err));
    2514. 

  2514.     print_nok(nok);
    2515. 

  2515. }
    2516. 

  2516. 

  2517. void
    2518. 

  2518. test_nc_get_vara_double(void)
    2519. 

  2519. {
    2520. 

  2520.     int ncid;
    2521. 

  2521.     int d;
    2522. 

  2522.     int i;
    2523. 

  2523.     int j;
    2524. 

  2524.     int k;
    2525. 

  2525.     int err;
    2526. 

  2526.     int allInExtRange;	/* all values within external range? */
    2527. 

  2527.     int allInIntRange;	/* all values within internal range? */
    2528. 

  2528.     int nels;
    2529. 

  2529.     int nslabs;
    2530. 

  2530.     int nok = 0;      /* count of valid comparisons */
    2531. 

  2531.     size_t start[MAX_RANK];
    2532. 

  2532.     size_t edge[MAX_RANK];
    2533. 

  2533.     size_t index[MAX_RANK];
    2534. 

  2534.     size_t mid[MAX_RANK];
    2535. 

  2535.     int canConvert;     /* Both text or both numeric */
    2536. 

  2536.     double value[MAX_NELS];
    2537. 

  2537.     double expect[MAX_NELS];
    2538. 

  2538. 

  2539.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    2540. 

  2540.     IF (err)
    2541. 

  2541. 	error("nc_open: %s", nc_strerror(err));
    2542. 

  2542.     for (i = 0; i < NVARS; i++) {
    2543. 

  2543.         canConvert = (var_type[i] == NC_CHAR) == (NCT_DOUBLE == NCT_TEXT);
    2544. 

  2544.         assert(var_rank[i] <= MAX_RANK);
    2545. 

  2545.         assert(var_nels[i] <= MAX_NELS);
    2546. 

  2546. 	for (j = 0; j < var_rank[i]; j++) {
    2547. 

  2547. 	    start[j] = 0;
    2548. 

  2548. 	    edge[j] = 1;
    2549. 

  2549. 	}
    2550. 

  2550.         err = nc_get_vara_double(BAD_ID, i, start, edge, value);
    2551. 

  2551.         IF (err != NC_EBADID)
    2552. 

  2552. 	    error("bad ncid: status = %d", err);
    2553. 

  2553.         err = nc_get_vara_double(ncid, BAD_VARID, start, edge, value);
    2554. 

  2554.         IF (err != NC_ENOTVAR)
    2555. 

  2555. 	    error("bad var id: status = %d", err);
    2556. 

  2556. 	for (j = 0; j < var_rank[i]; j++) {
    2557. 

  2557. 	    start[j] = var_shape[i][j];
    2558. 

  2558. 	    err = nc_get_vara_double(ncid, i, start, edge, value);
    2559. 

  2559.             IF (canConvert && err != NC_EINVALCOORDS)
    2560. 

  2560.                 error("bad index: status = %d", err);
    2561. 

  2561. 	    start[j] = 0;
    2562. 

  2562. 	    edge[j] = var_shape[i][j] + 1;
    2563. 

  2563. 	    err = nc_get_vara_double(ncid, i, start, edge, value);
    2564. 

  2564.             IF (canConvert && err != NC_EEDGE)
    2565. 

  2565. 		error("bad edge: status = %d", err);
    2566. 

  2566. 	    edge[j] = 1;
    2567. 

  2567. 	}
    2568. 

  2568.             /* Check non-scalars for correct error returned even when */
    2569. 

  2569.             /* there is nothing to get (edge[j]==0) */
    2570. 

  2570. 	if(var_rank[i] > 0) {
    2571. 

  2571. 	    for (j = 0; j < var_rank[i]; j++) {
    2572. 

  2572. 		edge[j] = 0;
    2573. 

  2573. 	    }
    2574. 

  2574. 	    err = nc_get_vara_double(BAD_ID, i, start, edge, value);
    2575. 

  2575. 	    IF (err != NC_EBADID) 
    2576. 

  2576. 		error("bad ncid: status = %d", err);
    2577. 

  2577. 	    err = nc_get_vara_double(ncid, BAD_VARID, start, edge, value);
    2578. 

  2578. 	    IF (err != NC_ENOTVAR) 
    2579. 

  2579. 		error("bad var id: status = %d", err);
    2580. 

  2580. 	    for (j = 0; j < var_rank[i]; j++) {
    2581. 

  2581. 		if (var_dimid[i][j] > 0) {		/* skip record dim */
    2582. 

  2582. 		    start[j] = var_shape[i][j];
    2583. 

  2583. 		    err = nc_get_vara_double(ncid, i, start, edge, value);
    2584. 

  2584. 		    IF (canConvert && err != NC_EINVALCOORDS)
    2585. 

  2585. 			error("bad start: status = %d", err);
    2586. 

  2586. 		    start[j] = 0;
    2587. 

  2587. 		}
    2588. 

  2588. 	    }
    2589. 

  2589. 	    err = nc_get_vara_double(ncid, i, start, edge, value);
    2590. 

  2590. 	    if (canConvert) {
    2591. 

  2591. 		IF (err) 
    2592. 

  2592. 		    error("%s", nc_strerror(err));
    2593. 

  2593. 	    } else {
    2594. 

  2594. 		IF (err != NC_ECHAR)
    2595. 

  2595. 		    error("wrong type: status = %d", err);
    2596. 

  2596. 	    }
    2597. 

  2597. 	    for (j = 0; j < var_rank[i]; j++) {
    2598. 

  2598. 		edge[j] = 1;
    2599. 

  2599. 	    }
    2600. 

  2600. 	}            /* Choose a random point dividing each dim into 2 parts */
    2601. 

  2601.             /* get 2^rank (nslabs) slabs so defined */
    2602. 

  2602.         nslabs = 1;
    2603. 

  2603.         for (j = 0; j < var_rank[i]; j++) {
    2604. 

  2604.             mid[j] = roll( var_shape[i][j] );
    2605. 

  2605.             nslabs *= 2;
    2606. 

  2606.         }
    2607. 

  2607.             /* bits of k determine whether to get lower or upper part of dim */
    2608. 

  2608.         for (k = 0; k < nslabs; k++) {
    2609. 

  2609.             nels = 1;
    2610. 

  2610.             for (j = 0; j < var_rank[i]; j++) {
    2611. 

  2611.                 if ((k >> j) & 1) {
    2612. 

  2612.                     start[j] = 0;
    2613. 

  2613.                     edge[j] = mid[j];
    2614. 

  2614.                 }else{
    2615. 

  2615.                     start[j] = mid[j];
    2616. 

  2616.                     edge[j] = var_shape[i][j] - mid[j];
    2617. 

  2617.                 }
    2618. 

  2618.                 nels *= edge[j];
    2619. 

  2619.             }
    2620. 

  2620. 	    allInExtRange = allInIntRange = 1;
    2621. 

  2621.             for (j = 0; j < nels; j++) {
    2622. 

  2622.                 err = toMixedBase(j, var_rank[i], edge, index);
    2623. 

  2623.                 IF (err)
    2624. 

  2624.                     error("error in toMixedBase 1");
    2625. 

  2625.                 for (d = 0; d < var_rank[i]; d++)
    2626. 

  2626.                     index[d] += start[d];
    2627. 

  2627.                 expect[j] = hash4(var_type[i], var_rank[i], index, NCT_DOUBLE);
    2628. 

  2628. 		if (inRange3(expect[j],var_type[i], NCT_DOUBLE)) {
    2629. 

  2629. 		    allInIntRange = allInIntRange && expect[j] >= double_min
    2630. 

  2630. 				&& expect[j] <= double_max;
    2631. 

  2631. 		} else {
    2632. 

  2632. 		    allInExtRange = 0;
    2633. 

  2633. 		}
    2634. 

  2634. 	    }
    2635. 

  2635.             if (var_rank[i] == 0 && i%2)
    2636. 

  2636. 		err = nc_get_vara_double(ncid, i, NULL, NULL, value);
    2637. 

  2637. 	    else
    2638. 

  2638. 		err = nc_get_vara_double(ncid, i, start, edge, value);
    2639. 

  2639.             if (canConvert) {
    2640. 

  2640. 		if (allInExtRange) {
    2641. 

  2641. 		    if (allInIntRange) {
    2642. 

  2642. 			IF (err)
    2643. 

  2643. 			    error("%s", nc_strerror(err));
    2644. 

  2644. 		    } else {
    2645. 

  2645. 			IF (err != NC_ERANGE)
    2646. 

  2646. 			    error("Range error: status = %d", err);
    2647. 

  2647. 		    }
    2648. 

  2648. 		} else {
    2649. 

  2649. 		    IF (err != 0 && err != NC_ERANGE)
    2650. 

  2650. 			error("OK or Range error: status = %d", err);
    2651. 

  2651. 		}
    2652. 

  2652. 		for (j = 0; j < nels; j++) {
    2653. 

  2653. 		    if (inRange3(expect[j],var_type[i],NCT_DOUBLE)
    2654. 

  2654. 			    && expect[j] >= double_min && expect[j] <= double_max) {
    2655. 

  2655. 			IF (!equal(value[j],expect[j],var_type[i],NCT_DOUBLE)){
    2656. 

  2656. 			    error("value read not that expected");
    2657. 

  2657. 			    if (verbose) {
    2658. 

  2658. 				error("\n");
    2659. 

  2659. 				error("varid: %d, ", i);
    2660. 

  2660. 				error("var_name: %s, ", var_name[i]);
    2661. 

  2661. 				error("element number: %d ", j);
    2662. 

  2662. 				error("expect: %g", expect[j]);
    2663. 

  2663. 				error("got: %g", (double) value[j]);
    2664. 

  2664. 			    }
    2665. 

  2665. 			} else {
    2666. 

  2666. 			    nok++;
    2667. 

  2667. 			}
    2668. 

  2668. 		    }
    2669. 

  2669. 		}
    2670. 

  2670.             } else {
    2671. 

  2671.                 IF (nels > 0 && err != NC_ECHAR)
    2672. 

  2672.                     error("wrong type: status = %d", err);
    2673. 

  2673.             }
    2674. 

  2674.         }
    2675. 

  2675.     }
    2676. 

  2676.     err = nc_close(ncid);
    2677. 

  2677.     IF (err)
    2678. 

  2678. 	error("nc_close: %s", nc_strerror(err));
    2679. 

  2679.     print_nok(nok);
    2680. 

  2680. }
    2681. 

  2681. 

  2682. 

  2683. 

  2684. 

  2685. void
    2686. 

  2686. test_nc_get_vars_text(void)
    2687. 

  2687. {
    2688. 

  2688.     int ncid;
    2689. 

  2689.     int d;
    2690. 

  2690.     int i;
    2691. 

  2691.     int j;
    2692. 

  2692.     int k;
    2693. 

  2693.     int m;
    2694. 

  2694.     int err;
    2695. 

  2695.     int allInExtRange;	/* all values within external range? */
    2696. 

  2696.     int allInIntRange;	/* all values within internal range? */
    2697. 

  2697.     int nels;
    2698. 

  2698.     int nslabs;
    2699. 

  2699.     int nstarts;        /* number of different starts */
    2700. 

  2700.     int nok = 0;      /* count of valid comparisons */
    2701. 

  2701.     size_t start[MAX_RANK];
    2702. 

  2702.     size_t edge[MAX_RANK];
    2703. 

  2703.     size_t index[MAX_RANK];
    2704. 

  2704.     size_t index2[MAX_RANK];
    2705. 

  2705.     size_t mid[MAX_RANK];
    2706. 

  2706.     size_t count[MAX_RANK];
    2707. 

  2707.     size_t sstride[MAX_RANK];
    2708. 

  2708.     ptrdiff_t stride[MAX_RANK];
    2709. 

  2709.     int canConvert;     /* Both text or both numeric */
    2710. 

  2710.     text value[MAX_NELS];
    2711. 

  2711.     double expect[MAX_NELS];
    2712. 

  2712. 

  2713.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    2714. 

  2714.     IF (err)
    2715. 

  2715.         error("nc_open: %s", nc_strerror(err));
    2716. 

  2716.     for (i = 0; i < NVARS; i++) {
    2717. 

  2717.         canConvert = (var_type[i] == NC_CHAR) == (NCT_TEXT == NCT_TEXT);
    2718. 

  2718.         assert(var_rank[i] <= MAX_RANK);
    2719. 

  2719.         assert(var_nels[i] <= MAX_NELS);
    2720. 

  2720.         for (j = 0; j < var_rank[i]; j++) {
    2721. 

  2721.             start[j] = 0;
    2722. 

  2722.             edge[j] = 1;
    2723. 

  2723.             stride[j] = 1;
    2724. 

  2724.         }
    2725. 

  2725.         err = nc_get_vars_text(BAD_ID, i, start, edge, stride, value);
    2726. 

  2726.         IF (err != NC_EBADID)
    2727. 

  2727.             error("bad ncid: status = %d", err);
    2728. 

  2728.         err = nc_get_vars_text(ncid, BAD_VARID, start, edge, stride, value);
    2729. 

  2729.         IF (err != NC_ENOTVAR)
    2730. 

  2730.             error("bad var id: status = %d", err);
    2731. 

  2731.         for (j = 0; j < var_rank[i]; j++) {
    2732. 

  2732.             start[j] = var_shape[i][j];
    2733. 

  2733.             err = nc_get_vars_text(ncid, i, start, edge, stride, value);
    2734. 

  2734. 	  if(!canConvert) {
    2735. 

  2735. 		IF (err != NC_ECHAR)
    2736. 

  2736.                	    error("conversion: status = %d", err);
    2737. 

  2737. 	  } else {
    2738. 

  2738.             IF (err != NC_EINVALCOORDS)
    2739. 

  2739.                 error("bad index: status = %d", err);
    2740. 

  2740.             start[j] = 0;
    2741. 

  2741.             edge[j] = var_shape[i][j] + 1;
    2742. 

  2742.             err = nc_get_vars_text(ncid, i, start, edge, stride, value);
    2743. 

  2743.             IF (err != NC_EEDGE)
    2744. 

  2744.                 error("bad edge: status = %d", err);
    2745. 

  2745.             edge[j] = 1;
    2746. 

  2746.             stride[j] = 0;
    2747. 

  2747.             err = nc_get_vars_text(ncid, i, start, edge, stride, value);
    2748. 

  2748.             IF (err != NC_ESTRIDE)
    2749. 

  2749.                 error("bad stride: status = %d", err);
    2750. 

  2750.             stride[j] = 1;
    2751. 

  2751. 	  }
    2752. 

  2752.         }
    2753. 

  2753.             /* Choose a random point dividing each dim into 2 parts */
    2754. 

  2754.             /* get 2^rank (nslabs) slabs so defined */
    2755. 

  2755.         nslabs = 1;
    2756. 

  2756.         for (j = 0; j < var_rank[i]; j++) {
    2757. 

  2757.             mid[j] = roll( var_shape[i][j] );
    2758. 

  2758.             nslabs *= 2;
    2759. 

  2759.         }
    2760. 

  2760.             /* bits of k determine whether to get lower or upper part of dim */
    2761. 

  2761.             /* choose random stride from 1 to edge */
    2762. 

  2762.         for (k = 0; k < nslabs; k++) {
    2763. 

  2763.             nstarts = 1;
    2764. 

  2764.             for (j = 0; j < var_rank[i]; j++) {
    2765. 

  2765.                 if ((k >> j) & 1) {
    2766. 

  2766.                     start[j] = 0;
    2767. 

  2767.                     edge[j] = mid[j];
    2768. 

  2768.                 }else{
    2769. 

  2769.                     start[j] = mid[j];
    2770. 

  2770.                     edge[j] = var_shape[i][j] - mid[j];
    2771. 

  2771.                 }
    2772. 

  2772.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    2773. 

  2773.                 nstarts *= stride[j];
    2774. 

  2774.             }
    2775. 

  2775.             for (m = 0; m < nstarts; m++) {
    2776. 

  2776.                 err = toMixedBase(m, var_rank[i], sstride, index);
    2777. 

  2777.                 IF (err)
    2778. 

  2778.                     error("error in toMixedBase");
    2779. 

  2779.                 nels = 1;
    2780. 

  2780.                 for (j = 0; j < var_rank[i]; j++) {
    2781. 

  2781.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    2782. 

  2782.                     nels *= count[j];
    2783. 

  2783.                     index[j] += start[j];
    2784. 

  2784.                 }
    2785. 

  2785.                         /* Random choice of forward or backward */
    2786. 

  2786. /* TODO
    2787. 

  2787.                 if ( roll(2) ) {
    2788. 

  2788.                     for (j = 0; j < var_rank[i]; j++) {
    2789. 

  2789.                         index[j] += (count[j] - 1) * stride[j];
    2790. 

  2790.                         stride[j] = -stride[j];
    2791. 

  2791.                     }
    2792. 

  2792.                 }
    2793. 

  2793. */
    2794. 

  2794. 		allInExtRange = allInIntRange = 1;
    2795. 

  2795. 		for (j = 0; j < nels; j++) {
    2796. 

  2796. 		    err = toMixedBase(j, var_rank[i], count, index2);
    2797. 

  2797. 		    IF (err)
    2798. 

  2798. 			error("error in toMixedBase 1");
    2799. 

  2799. 		    for (d = 0; d < var_rank[i]; d++)
    2800. 

  2800. 			index2[d] = index[d] + index2[d] * stride[d];
    2801. 

  2801. 		    expect[j] = hash4(var_type[i], var_rank[i], index2, 
    2802. 

  2802. 			NCT_TEXT);
    2803. 

  2803. 		    if (inRange3(expect[j],var_type[i],NCT_TEXT)) {
    2804. 

  2804. 			allInIntRange = allInIntRange && expect[j] >= text_min
    2805. 

  2805. 			    && expect[j] <= text_max;
    2806. 

  2806. 		    } else {
    2807. 

  2807. 			allInExtRange = 0;
    2808. 

  2808. 		    }
    2809. 

  2809. 		}
    2810. 

  2810.                 if (var_rank[i] == 0 && i%2 )
    2811. 

  2811.                     err = nc_get_vars_text(ncid, i, NULL, NULL, NULL, value);
    2812. 

  2812.                 else
    2813. 

  2813.                     err = nc_get_vars_text(ncid, i, index, count, stride, value);
    2814. 

  2814. 		if (canConvert) {
    2815. 

  2815. 		    if (allInExtRange) {
    2816. 

  2816. 			if (allInIntRange) {
    2817. 

  2817. 			    IF (err)
    2818. 

  2818. 				error("%s", nc_strerror(err));
    2819. 

  2819. 			} else {
    2820. 

  2820. 			    IF (err != NC_ERANGE)
    2821. 

  2821. 				error("Range error: status = %d", err);
    2822. 

  2822. 			}
    2823. 

  2823. 		    } else {
    2824. 

  2824. 			IF (err != 0 && err != NC_ERANGE)
    2825. 

  2825. 			    error("OK or Range error: status = %d", err);
    2826. 

  2826. 		    }
    2827. 

  2827. 		    for (j = 0; j < nels; j++) {
    2828. 

  2828. 			if (inRange3(expect[j],var_type[i],NCT_TEXT)
    2829. 

  2829. 				&& expect[j] >= text_min && expect[j] <= text_max) {
    2830. 

  2830. 			    IF (!equal(value[j],expect[j],var_type[i],
    2831. 

  2831. 				    NCT_TEXT)){
    2832. 

  2832. 				error("value read not that expected");
    2833. 

  2833. 				if (verbose) {
    2834. 

  2834. 				    error("\n");
    2835. 

  2835. 				    error("varid: %d, ", i);
    2836. 

  2836. 				    error("var_name: %s, ", var_name[i]);
    2837. 

  2837. 				    error("element number: %d ", j);
    2838. 

  2838.                                     error("expect: %g, ", expect[j]);
    2839. 

  2839. 				    error("got: %g", (double) value[j]);
    2840. 

  2840. 				}
    2841. 

  2841. 			    } else {
    2842. 

  2842. 				nok++;
    2843. 

  2843. 			    }
    2844. 

  2844. 			}
    2845. 

  2845. 		    }
    2846. 

  2846. 		} else {
    2847. 

  2847. 		    IF (nels > 0 && err != NC_ECHAR)
    2848. 

  2848. 			error("wrong type: status = %d", err);
    2849. 

  2849. 		}
    2850. 

  2850. 	    }
    2851. 

  2851. 	}
    2852. 

  2852. 

  2853.     }
    2854. 

  2854.     err = nc_close(ncid);
    2855. 

  2855.     IF (err)
    2856. 

  2856.         error("nc_close: %s", nc_strerror(err));
    2857. 

  2857.     print_nok(nok);
    2858. 

  2858. }
    2859. 

  2859. 

  2860. void
    2861. 

  2861. test_nc_get_vars_uchar(void)
    2862. 

  2862. {
    2863. 

  2863.     int ncid;
    2864. 

  2864.     int d;
    2865. 

  2865.     int i;
    2866. 

  2866.     int j;
    2867. 

  2867.     int k;
    2868. 

  2868.     int m;
    2869. 

  2869.     int err;
    2870. 

  2870.     int allInExtRange;	/* all values within external range? */
    2871. 

  2871.     int allInIntRange;	/* all values within internal range? */
    2872. 

  2872.     int nels;
    2873. 

  2873.     int nslabs;
    2874. 

  2874.     int nstarts;        /* number of different starts */
    2875. 

  2875.     int nok = 0;      /* count of valid comparisons */
    2876. 

  2876.     size_t start[MAX_RANK];
    2877. 

  2877.     size_t edge[MAX_RANK];
    2878. 

  2878.     size_t index[MAX_RANK];
    2879. 

  2879.     size_t index2[MAX_RANK];
    2880. 

  2880.     size_t mid[MAX_RANK];
    2881. 

  2881.     size_t count[MAX_RANK];
    2882. 

  2882.     size_t sstride[MAX_RANK];
    2883. 

  2883.     ptrdiff_t stride[MAX_RANK];
    2884. 

  2884.     int canConvert;     /* Both text or both numeric */
    2885. 

  2885.     uchar value[MAX_NELS];
    2886. 

  2886.     double expect[MAX_NELS];
    2887. 

  2887. 

  2888.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    2889. 

  2889.     IF (err)
    2890. 

  2890.         error("nc_open: %s", nc_strerror(err));
    2891. 

  2891.     for (i = 0; i < NVARS; i++) {
    2892. 

  2892.         canConvert = (var_type[i] == NC_CHAR) == (NCT_UCHAR == NCT_TEXT);
    2893. 

  2893.         assert(var_rank[i] <= MAX_RANK);
    2894. 

  2894.         assert(var_nels[i] <= MAX_NELS);
    2895. 

  2895.         for (j = 0; j < var_rank[i]; j++) {
    2896. 

  2896.             start[j] = 0;
    2897. 

  2897.             edge[j] = 1;
    2898. 

  2898.             stride[j] = 1;
    2899. 

  2899.         }
    2900. 

  2900.         err = nc_get_vars_uchar(BAD_ID, i, start, edge, stride, value);
    2901. 

  2901.         IF (err != NC_EBADID)
    2902. 

  2902.             error("bad ncid: status = %d", err);
    2903. 

  2903.         err = nc_get_vars_uchar(ncid, BAD_VARID, start, edge, stride, value);
    2904. 

  2904.         IF (err != NC_ENOTVAR)
    2905. 

  2905.             error("bad var id: status = %d", err);
    2906. 

  2906.         for (j = 0; j < var_rank[i]; j++) {
    2907. 

  2907.             start[j] = var_shape[i][j];
    2908. 

  2908.             err = nc_get_vars_uchar(ncid, i, start, edge, stride, value);
    2909. 

  2909. 	  if(!canConvert) {
    2910. 

  2910. 		IF (err != NC_ECHAR)
    2911. 

  2911.                	    error("conversion: status = %d", err);
    2912. 

  2912. 	  } else {
    2913. 

  2913.             IF (err != NC_EINVALCOORDS)
    2914. 

  2914.                 error("bad index: status = %d", err);
    2915. 

  2915.             start[j] = 0;
    2916. 

  2916.             edge[j] = var_shape[i][j] + 1;
    2917. 

  2917.             err = nc_get_vars_uchar(ncid, i, start, edge, stride, value);
    2918. 

  2918.             IF (err != NC_EEDGE)
    2919. 

  2919.                 error("bad edge: status = %d", err);
    2920. 

  2920.             edge[j] = 1;
    2921. 

  2921.             stride[j] = 0;
    2922. 

  2922.             err = nc_get_vars_uchar(ncid, i, start, edge, stride, value);
    2923. 

  2923.             IF (err != NC_ESTRIDE)
    2924. 

  2924.                 error("bad stride: status = %d", err);
    2925. 

  2925.             stride[j] = 1;
    2926. 

  2926. 	  }
    2927. 

  2927.         }
    2928. 

  2928.             /* Choose a random point dividing each dim into 2 parts */
    2929. 

  2929.             /* get 2^rank (nslabs) slabs so defined */
    2930. 

  2930.         nslabs = 1;
    2931. 

  2931.         for (j = 0; j < var_rank[i]; j++) {
    2932. 

  2932.             mid[j] = roll( var_shape[i][j] );
    2933. 

  2933.             nslabs *= 2;
    2934. 

  2934.         }
    2935. 

  2935.             /* bits of k determine whether to get lower or upper part of dim */
    2936. 

  2936.             /* choose random stride from 1 to edge */
    2937. 

  2937.         for (k = 0; k < nslabs; k++) {
    2938. 

  2938.             nstarts = 1;
    2939. 

  2939.             for (j = 0; j < var_rank[i]; j++) {
    2940. 

  2940.                 if ((k >> j) & 1) {
    2941. 

  2941.                     start[j] = 0;
    2942. 

  2942.                     edge[j] = mid[j];
    2943. 

  2943.                 }else{
    2944. 

  2944.                     start[j] = mid[j];
    2945. 

  2945.                     edge[j] = var_shape[i][j] - mid[j];
    2946. 

  2946.                 }
    2947. 

  2947.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    2948. 

  2948.                 nstarts *= stride[j];
    2949. 

  2949.             }
    2950. 

  2950.             for (m = 0; m < nstarts; m++) {
    2951. 

  2951.                 err = toMixedBase(m, var_rank[i], sstride, index);
    2952. 

  2952.                 IF (err)
    2953. 

  2953.                     error("error in toMixedBase");
    2954. 

  2954.                 nels = 1;
    2955. 

  2955.                 for (j = 0; j < var_rank[i]; j++) {
    2956. 

  2956.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    2957. 

  2957.                     nels *= count[j];
    2958. 

  2958.                     index[j] += start[j];
    2959. 

  2959.                 }
    2960. 

  2960.                         /* Random choice of forward or backward */
    2961. 

  2961. /* TODO
    2962. 

  2962.                 if ( roll(2) ) {
    2963. 

  2963.                     for (j = 0; j < var_rank[i]; j++) {
    2964. 

  2964.                         index[j] += (count[j] - 1) * stride[j];
    2965. 

  2965.                         stride[j] = -stride[j];
    2966. 

  2966.                     }
    2967. 

  2967.                 }
    2968. 

  2968. */
    2969. 

  2969. 		allInExtRange = allInIntRange = 1;
    2970. 

  2970. 		for (j = 0; j < nels; j++) {
    2971. 

  2971. 		    err = toMixedBase(j, var_rank[i], count, index2);
    2972. 

  2972. 		    IF (err)
    2973. 

  2973. 			error("error in toMixedBase 1");
    2974. 

  2974. 		    for (d = 0; d < var_rank[i]; d++)
    2975. 

  2975. 			index2[d] = index[d] + index2[d] * stride[d];
    2976. 

  2976. 		    expect[j] = hash4(var_type[i], var_rank[i], index2, 
    2977. 

  2977. 			NCT_UCHAR);
    2978. 

  2978. 		    if (inRange3(expect[j],var_type[i],NCT_UCHAR)) {
    2979. 

  2979. 			allInIntRange = allInIntRange && expect[j] >= uchar_min
    2980. 

  2980. 			    && expect[j] <= uchar_max;
    2981. 

  2981. 		    } else {
    2982. 

  2982. 			allInExtRange = 0;
    2983. 

  2983. 		    }
    2984. 

  2984. 		}
    2985. 

  2985.                 if (var_rank[i] == 0 && i%2 )
    2986. 

  2986.                     err = nc_get_vars_uchar(ncid, i, NULL, NULL, NULL, value);
    2987. 

  2987.                 else
    2988. 

  2988.                     err = nc_get_vars_uchar(ncid, i, index, count, stride, value);
    2989. 

  2989. 		if (canConvert) {
    2990. 

  2990. 		    if (allInExtRange) {
    2991. 

  2991. 			if (allInIntRange) {
    2992. 

  2992. 			    IF (err)
    2993. 

  2993. 				error("%s", nc_strerror(err));
    2994. 

  2994. 			} else {
    2995. 

  2995. 			    IF (err != NC_ERANGE)
    2996. 

  2996. 				error("Range error: status = %d", err);
    2997. 

  2997. 			}
    2998. 

  2998. 		    } else {
    2999. 

  2999. 			IF (err != 0 && err != NC_ERANGE)
    3000. 

  3000. 			    error("OK or Range error: status = %d", err);
    3001. 

  3001. 		    }
    3002. 

  3002. 		    for (j = 0; j < nels; j++) {
    3003. 

  3003. 			if (inRange3(expect[j],var_type[i],NCT_UCHAR)
    3004. 

  3004. 				&& expect[j] >= uchar_min && expect[j] <= uchar_max) {
    3005. 

  3005. 			    IF (!equal(value[j],expect[j],var_type[i],
    3006. 

  3006. 				    NCT_UCHAR)){
    3007. 

  3007. 				error("value read not that expected");
    3008. 

  3008. 				if (verbose) {
    3009. 

  3009. 				    error("\n");
    3010. 

  3010. 				    error("varid: %d, ", i);
    3011. 

  3011. 				    error("var_name: %s, ", var_name[i]);
    3012. 

  3012. 				    error("element number: %d ", j);
    3013. 

  3013.                                     error("expect: %g, ", expect[j]);
    3014. 

  3014. 				    error("got: %g", (double) value[j]);
    3015. 

  3015. 				}
    3016. 

  3016. 			    } else {
    3017. 

  3017. 				nok++;
    3018. 

  3018. 			    }
    3019. 

  3019. 			}
    3020. 

  3020. 		    }
    3021. 

  3021. 		} else {
    3022. 

  3022. 		    IF (nels > 0 && err != NC_ECHAR)
    3023. 

  3023. 			error("wrong type: status = %d", err);
    3024. 

  3024. 		}
    3025. 

  3025. 	    }
    3026. 

  3026. 	}
    3027. 

  3027. 

  3028.     }
    3029. 

  3029.     err = nc_close(ncid);
    3030. 

  3030.     IF (err)
    3031. 

  3031.         error("nc_close: %s", nc_strerror(err));
    3032. 

  3032.     print_nok(nok);
    3033. 

  3033. }
    3034. 

  3034. 

  3035. void
    3036. 

  3036. test_nc_get_vars_schar(void)
    3037. 

  3037. {
    3038. 

  3038.     int ncid;
    3039. 

  3039.     int d;
    3040. 

  3040.     int i;
    3041. 

  3041.     int j;
    3042. 

  3042.     int k;
    3043. 

  3043.     int m;
    3044. 

  3044.     int err;
    3045. 

  3045.     int allInExtRange;	/* all values within external range? */
    3046. 

  3046.     int allInIntRange;	/* all values within internal range? */
    3047. 

  3047.     int nels;
    3048. 

  3048.     int nslabs;
    3049. 

  3049.     int nstarts;        /* number of different starts */
    3050. 

  3050.     int nok = 0;      /* count of valid comparisons */
    3051. 

  3051.     size_t start[MAX_RANK];
    3052. 

  3052.     size_t edge[MAX_RANK];
    3053. 

  3053.     size_t index[MAX_RANK];
    3054. 

  3054.     size_t index2[MAX_RANK];
    3055. 

  3055.     size_t mid[MAX_RANK];
    3056. 

  3056.     size_t count[MAX_RANK];
    3057. 

  3057.     size_t sstride[MAX_RANK];
    3058. 

  3058.     ptrdiff_t stride[MAX_RANK];
    3059. 

  3059.     int canConvert;     /* Both text or both numeric */
    3060. 

  3060.     schar value[MAX_NELS];
    3061. 

  3061.     double expect[MAX_NELS];
    3062. 

  3062. 

  3063.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    3064. 

  3064.     IF (err)
    3065. 

  3065.         error("nc_open: %s", nc_strerror(err));
    3066. 

  3066.     for (i = 0; i < NVARS; i++) {
    3067. 

  3067.         canConvert = (var_type[i] == NC_CHAR) == (NCT_SCHAR == NCT_TEXT);
    3068. 

  3068.         assert(var_rank[i] <= MAX_RANK);
    3069. 

  3069.         assert(var_nels[i] <= MAX_NELS);
    3070. 

  3070.         for (j = 0; j < var_rank[i]; j++) {
    3071. 

  3071.             start[j] = 0;
    3072. 

  3072.             edge[j] = 1;
    3073. 

  3073.             stride[j] = 1;
    3074. 

  3074.         }
    3075. 

  3075.         err = nc_get_vars_schar(BAD_ID, i, start, edge, stride, value);
    3076. 

  3076.         IF (err != NC_EBADID)
    3077. 

  3077.             error("bad ncid: status = %d", err);
    3078. 

  3078.         err = nc_get_vars_schar(ncid, BAD_VARID, start, edge, stride, value);
    3079. 

  3079.         IF (err != NC_ENOTVAR)
    3080. 

  3080.             error("bad var id: status = %d", err);
    3081. 

  3081.         for (j = 0; j < var_rank[i]; j++) {
    3082. 

  3082.             start[j] = var_shape[i][j];
    3083. 

  3083.             err = nc_get_vars_schar(ncid, i, start, edge, stride, value);
    3084. 

  3084. 	  if(!canConvert) {
    3085. 

  3085. 		IF (err != NC_ECHAR)
    3086. 

  3086.                	    error("conversion: status = %d", err);
    3087. 

  3087. 	  } else {
    3088. 

  3088.             IF (err != NC_EINVALCOORDS)
    3089. 

  3089.                 error("bad index: status = %d", err);
    3090. 

  3090.             start[j] = 0;
    3091. 

  3091.             edge[j] = var_shape[i][j] + 1;
    3092. 

  3092.             err = nc_get_vars_schar(ncid, i, start, edge, stride, value);
    3093. 

  3093.             IF (err != NC_EEDGE)
    3094. 

  3094.                 error("bad edge: status = %d", err);
    3095. 

  3095.             edge[j] = 1;
    3096. 

  3096.             stride[j] = 0;
    3097. 

  3097.             err = nc_get_vars_schar(ncid, i, start, edge, stride, value);
    3098. 

  3098.             IF (err != NC_ESTRIDE)
    3099. 

  3099.                 error("bad stride: status = %d", err);
    3100. 

  3100.             stride[j] = 1;
    3101. 

  3101. 	  }
    3102. 

  3102.         }
    3103. 

  3103.             /* Choose a random point dividing each dim into 2 parts */
    3104. 

  3104.             /* get 2^rank (nslabs) slabs so defined */
    3105. 

  3105.         nslabs = 1;
    3106. 

  3106.         for (j = 0; j < var_rank[i]; j++) {
    3107. 

  3107.             mid[j] = roll( var_shape[i][j] );
    3108. 

  3108.             nslabs *= 2;
    3109. 

  3109.         }
    3110. 

  3110.             /* bits of k determine whether to get lower or upper part of dim */
    3111. 

  3111.             /* choose random stride from 1 to edge */
    3112. 

  3112.         for (k = 0; k < nslabs; k++) {
    3113. 

  3113.             nstarts = 1;
    3114. 

  3114.             for (j = 0; j < var_rank[i]; j++) {
    3115. 

  3115.                 if ((k >> j) & 1) {
    3116. 

  3116.                     start[j] = 0;
    3117. 

  3117.                     edge[j] = mid[j];
    3118. 

  3118.                 }else{
    3119. 

  3119.                     start[j] = mid[j];
    3120. 

  3120.                     edge[j] = var_shape[i][j] - mid[j];
    3121. 

  3121.                 }
    3122. 

  3122.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    3123. 

  3123.                 nstarts *= stride[j];
    3124. 

  3124.             }
    3125. 

  3125.             for (m = 0; m < nstarts; m++) {
    3126. 

  3126.                 err = toMixedBase(m, var_rank[i], sstride, index);
    3127. 

  3127.                 IF (err)
    3128. 

  3128.                     error("error in toMixedBase");
    3129. 

  3129.                 nels = 1;
    3130. 

  3130.                 for (j = 0; j < var_rank[i]; j++) {
    3131. 

  3131.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    3132. 

  3132.                     nels *= count[j];
    3133. 

  3133.                     index[j] += start[j];
    3134. 

  3134.                 }
    3135. 

  3135.                         /* Random choice of forward or backward */
    3136. 

  3136. /* TODO
    3137. 

  3137.                 if ( roll(2) ) {
    3138. 

  3138.                     for (j = 0; j < var_rank[i]; j++) {
    3139. 

  3139.                         index[j] += (count[j] - 1) * stride[j];
    3140. 

  3140.                         stride[j] = -stride[j];
    3141. 

  3141.                     }
    3142. 

  3142.                 }
    3143. 

  3143. */
    3144. 

  3144. 		allInExtRange = allInIntRange = 1;
    3145. 

  3145. 		for (j = 0; j < nels; j++) {
    3146. 

  3146. 		    err = toMixedBase(j, var_rank[i], count, index2);
    3147. 

  3147. 		    IF (err)
    3148. 

  3148. 			error("error in toMixedBase 1");
    3149. 

  3149. 		    for (d = 0; d < var_rank[i]; d++)
    3150. 

  3150. 			index2[d] = index[d] + index2[d] * stride[d];
    3151. 

  3151. 		    expect[j] = hash4(var_type[i], var_rank[i], index2, 
    3152. 

  3152. 			NCT_SCHAR);
    3153. 

  3153. 		    if (inRange3(expect[j],var_type[i],NCT_SCHAR)) {
    3154. 

  3154. 			allInIntRange = allInIntRange && expect[j] >= schar_min
    3155. 

  3155. 			    && expect[j] <= schar_max;
    3156. 

  3156. 		    } else {
    3157. 

  3157. 			allInExtRange = 0;
    3158. 

  3158. 		    }
    3159. 

  3159. 		}
    3160. 

  3160.                 if (var_rank[i] == 0 && i%2 )
    3161. 

  3161.                     err = nc_get_vars_schar(ncid, i, NULL, NULL, NULL, value);
    3162. 

  3162.                 else
    3163. 

  3163.                     err = nc_get_vars_schar(ncid, i, index, count, stride, value);
    3164. 

  3164. 		if (canConvert) {
    3165. 

  3165. 		    if (allInExtRange) {
    3166. 

  3166. 			if (allInIntRange) {
    3167. 

  3167. 			    IF (err)
    3168. 

  3168. 				error("%s", nc_strerror(err));
    3169. 

  3169. 			} else {
    3170. 

  3170. 			    IF (err != NC_ERANGE)
    3171. 

  3171. 				error("Range error: status = %d", err);
    3172. 

  3172. 			}
    3173. 

  3173. 		    } else {
    3174. 

  3174. 			IF (err != 0 && err != NC_ERANGE)
    3175. 

  3175. 			    error("OK or Range error: status = %d", err);
    3176. 

  3176. 		    }
    3177. 

  3177. 		    for (j = 0; j < nels; j++) {
    3178. 

  3178. 			if (inRange3(expect[j],var_type[i],NCT_SCHAR)
    3179. 

  3179. 				&& expect[j] >= schar_min && expect[j] <= schar_max) {
    3180. 

  3180. 			    IF (!equal(value[j],expect[j],var_type[i],
    3181. 

  3181. 				    NCT_SCHAR)){
    3182. 

  3182. 				error("value read not that expected");
    3183. 

  3183. 				if (verbose) {
    3184. 

  3184. 				    error("\n");
    3185. 

  3185. 				    error("varid: %d, ", i);
    3186. 

  3186. 				    error("var_name: %s, ", var_name[i]);
    3187. 

  3187. 				    error("element number: %d ", j);
    3188. 

  3188.                                     error("expect: %g, ", expect[j]);
    3189. 

  3189. 				    error("got: %g", (double) value[j]);
    3190. 

  3190. 				}
    3191. 

  3191. 			    } else {
    3192. 

  3192. 				nok++;
    3193. 

  3193. 			    }
    3194. 

  3194. 			}
    3195. 

  3195. 		    }
    3196. 

  3196. 		} else {
    3197. 

  3197. 		    IF (nels > 0 && err != NC_ECHAR)
    3198. 

  3198. 			error("wrong type: status = %d", err);
    3199. 

  3199. 		}
    3200. 

  3200. 	    }
    3201. 

  3201. 	}
    3202. 

  3202. 

  3203.     }
    3204. 

  3204.     err = nc_close(ncid);
    3205. 

  3205.     IF (err)
    3206. 

  3206.         error("nc_close: %s", nc_strerror(err));
    3207. 

  3207.     print_nok(nok);
    3208. 

  3208. }
    3209. 

  3209. 

  3210. void
    3211. 

  3211. test_nc_get_vars_short(void)
    3212. 

  3212. {
    3213. 

  3213.     int ncid;
    3214. 

  3214.     int d;
    3215. 

  3215.     int i;
    3216. 

  3216.     int j;
    3217. 

  3217.     int k;
    3218. 

  3218.     int m;
    3219. 

  3219.     int err;
    3220. 

  3220.     int allInExtRange;	/* all values within external range? */
    3221. 

  3221.     int allInIntRange;	/* all values within internal range? */
    3222. 

  3222.     int nels;
    3223. 

  3223.     int nslabs;
    3224. 

  3224.     int nstarts;        /* number of different starts */
    3225. 

  3225.     int nok = 0;      /* count of valid comparisons */
    3226. 

  3226.     size_t start[MAX_RANK];
    3227. 

  3227.     size_t edge[MAX_RANK];
    3228. 

  3228.     size_t index[MAX_RANK];
    3229. 

  3229.     size_t index2[MAX_RANK];
    3230. 

  3230.     size_t mid[MAX_RANK];
    3231. 

  3231.     size_t count[MAX_RANK];
    3232. 

  3232.     size_t sstride[MAX_RANK];
    3233. 

  3233.     ptrdiff_t stride[MAX_RANK];
    3234. 

  3234.     int canConvert;     /* Both text or both numeric */
    3235. 

  3235.     short value[MAX_NELS];
    3236. 

  3236.     double expect[MAX_NELS];
    3237. 

  3237. 

  3238.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    3239. 

  3239.     IF (err)
    3240. 

  3240.         error("nc_open: %s", nc_strerror(err));
    3241. 

  3241.     for (i = 0; i < NVARS; i++) {
    3242. 

  3242.         canConvert = (var_type[i] == NC_CHAR) == (NCT_SHORT == NCT_TEXT);
    3243. 

  3243.         assert(var_rank[i] <= MAX_RANK);
    3244. 

  3244.         assert(var_nels[i] <= MAX_NELS);
    3245. 

  3245.         for (j = 0; j < var_rank[i]; j++) {
    3246. 

  3246.             start[j] = 0;
    3247. 

  3247.             edge[j] = 1;
    3248. 

  3248.             stride[j] = 1;
    3249. 

  3249.         }
    3250. 

  3250.         err = nc_get_vars_short(BAD_ID, i, start, edge, stride, value);
    3251. 

  3251.         IF (err != NC_EBADID)
    3252. 

  3252.             error("bad ncid: status = %d", err);
    3253. 

  3253.         err = nc_get_vars_short(ncid, BAD_VARID, start, edge, stride, value);
    3254. 

  3254.         IF (err != NC_ENOTVAR)
    3255. 

  3255.             error("bad var id: status = %d", err);
    3256. 

  3256.         for (j = 0; j < var_rank[i]; j++) {
    3257. 

  3257.             start[j] = var_shape[i][j];
    3258. 

  3258.             err = nc_get_vars_short(ncid, i, start, edge, stride, value);
    3259. 

  3259. 	  if(!canConvert) {
    3260. 

  3260. 		IF (err != NC_ECHAR)
    3261. 

  3261.                	    error("conversion: status = %d", err);
    3262. 

  3262. 	  } else {
    3263. 

  3263.             IF (err != NC_EINVALCOORDS)
    3264. 

  3264.                 error("bad index: status = %d", err);
    3265. 

  3265.             start[j] = 0;
    3266. 

  3266.             edge[j] = var_shape[i][j] + 1;
    3267. 

  3267.             err = nc_get_vars_short(ncid, i, start, edge, stride, value);
    3268. 

  3268.             IF (err != NC_EEDGE)
    3269. 

  3269.                 error("bad edge: status = %d", err);
    3270. 

  3270.             edge[j] = 1;
    3271. 

  3271.             stride[j] = 0;
    3272. 

  3272.             err = nc_get_vars_short(ncid, i, start, edge, stride, value);
    3273. 

  3273.             IF (err != NC_ESTRIDE)
    3274. 

  3274.                 error("bad stride: status = %d", err);
    3275. 

  3275.             stride[j] = 1;
    3276. 

  3276. 	  }
    3277. 

  3277.         }
    3278. 

  3278.             /* Choose a random point dividing each dim into 2 parts */
    3279. 

  3279.             /* get 2^rank (nslabs) slabs so defined */
    3280. 

  3280.         nslabs = 1;
    3281. 

  3281.         for (j = 0; j < var_rank[i]; j++) {
    3282. 

  3282.             mid[j] = roll( var_shape[i][j] );
    3283. 

  3283.             nslabs *= 2;
    3284. 

  3284.         }
    3285. 

  3285.             /* bits of k determine whether to get lower or upper part of dim */
    3286. 

  3286.             /* choose random stride from 1 to edge */
    3287. 

  3287.         for (k = 0; k < nslabs; k++) {
    3288. 

  3288.             nstarts = 1;
    3289. 

  3289.             for (j = 0; j < var_rank[i]; j++) {
    3290. 

  3290.                 if ((k >> j) & 1) {
    3291. 

  3291.                     start[j] = 0;
    3292. 

  3292.                     edge[j] = mid[j];
    3293. 

  3293.                 }else{
    3294. 

  3294.                     start[j] = mid[j];
    3295. 

  3295.                     edge[j] = var_shape[i][j] - mid[j];
    3296. 

  3296.                 }
    3297. 

  3297.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    3298. 

  3298.                 nstarts *= stride[j];
    3299. 

  3299.             }
    3300. 

  3300.             for (m = 0; m < nstarts; m++) {
    3301. 

  3301.                 err = toMixedBase(m, var_rank[i], sstride, index);
    3302. 

  3302.                 IF (err)
    3303. 

  3303.                     error("error in toMixedBase");
    3304. 

  3304.                 nels = 1;
    3305. 

  3305.                 for (j = 0; j < var_rank[i]; j++) {
    3306. 

  3306.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    3307. 

  3307.                     nels *= count[j];
    3308. 

  3308.                     index[j] += start[j];
    3309. 

  3309.                 }
    3310. 

  3310.                         /* Random choice of forward or backward */
    3311. 

  3311. /* TODO
    3312. 

  3312.                 if ( roll(2) ) {
    3313. 

  3313.                     for (j = 0; j < var_rank[i]; j++) {
    3314. 

  3314.                         index[j] += (count[j] - 1) * stride[j];
    3315. 

  3315.                         stride[j] = -stride[j];
    3316. 

  3316.                     }
    3317. 

  3317.                 }
    3318. 

  3318. */
    3319. 

  3319. 		allInExtRange = allInIntRange = 1;
    3320. 

  3320. 		for (j = 0; j < nels; j++) {
    3321. 

  3321. 		    err = toMixedBase(j, var_rank[i], count, index2);
    3322. 

  3322. 		    IF (err)
    3323. 

  3323. 			error("error in toMixedBase 1");
    3324. 

  3324. 		    for (d = 0; d < var_rank[i]; d++)
    3325. 

  3325. 			index2[d] = index[d] + index2[d] * stride[d];
    3326. 

  3326. 		    expect[j] = hash4(var_type[i], var_rank[i], index2, 
    3327. 

  3327. 			NCT_SHORT);
    3328. 

  3328. 		    if (inRange3(expect[j],var_type[i],NCT_SHORT)) {
    3329. 

  3329. 			allInIntRange = allInIntRange && expect[j] >= short_min
    3330. 

  3330. 			    && expect[j] <= short_max;
    3331. 

  3331. 		    } else {
    3332. 

  3332. 			allInExtRange = 0;
    3333. 

  3333. 		    }
    3334. 

  3334. 		}
    3335. 

  3335.                 if (var_rank[i] == 0 && i%2 )
    3336. 

  3336.                     err = nc_get_vars_short(ncid, i, NULL, NULL, NULL, value);
    3337. 

  3337.                 else
    3338. 

  3338.                     err = nc_get_vars_short(ncid, i, index, count, stride, value);
    3339. 

  3339. 		if (canConvert) {
    3340. 

  3340. 		    if (allInExtRange) {
    3341. 

  3341. 			if (allInIntRange) {
    3342. 

  3342. 			    IF (err)
    3343. 

  3343. 				error("%s", nc_strerror(err));
    3344. 

  3344. 			} else {
    3345. 

  3345. 			    IF (err != NC_ERANGE)
    3346. 

  3346. 				error("Range error: status = %d", err);
    3347. 

  3347. 			}
    3348. 

  3348. 		    } else {
    3349. 

  3349. 			IF (err != 0 && err != NC_ERANGE)
    3350. 

  3350. 			    error("OK or Range error: status = %d", err);
    3351. 

  3351. 		    }
    3352. 

  3352. 		    for (j = 0; j < nels; j++) {
    3353. 

  3353. 			if (inRange3(expect[j],var_type[i],NCT_SHORT)
    3354. 

  3354. 				&& expect[j] >= short_min && expect[j] <= short_max) {
    3355. 

  3355. 			    IF (!equal(value[j],expect[j],var_type[i],
    3356. 

  3356. 				    NCT_SHORT)){
    3357. 

  3357. 				error("value read not that expected");
    3358. 

  3358. 				if (verbose) {
    3359. 

  3359. 				    error("\n");
    3360. 

  3360. 				    error("varid: %d, ", i);
    3361. 

  3361. 				    error("var_name: %s, ", var_name[i]);
    3362. 

  3362. 				    error("element number: %d ", j);
    3363. 

  3363.                                     error("expect: %g, ", expect[j]);
    3364. 

  3364. 				    error("got: %g", (double) value[j]);
    3365. 

  3365. 				}
    3366. 

  3366. 			    } else {
    3367. 

  3367. 				nok++;
    3368. 

  3368. 			    }
    3369. 

  3369. 			}
    3370. 

  3370. 		    }
    3371. 

  3371. 		} else {
    3372. 

  3372. 		    IF (nels > 0 && err != NC_ECHAR)
    3373. 

  3373. 			error("wrong type: status = %d", err);
    3374. 

  3374. 		}
    3375. 

  3375. 	    }
    3376. 

  3376. 	}
    3377. 

  3377. 

  3378.     }
    3379. 

  3379.     err = nc_close(ncid);
    3380. 

  3380.     IF (err)
    3381. 

  3381.         error("nc_close: %s", nc_strerror(err));
    3382. 

  3382.     print_nok(nok);
    3383. 

  3383. }
    3384. 

  3384. 

  3385. void
    3386. 

  3386. test_nc_get_vars_int(void)
    3387. 

  3387. {
    3388. 

  3388.     int ncid;
    3389. 

  3389.     int d;
    3390. 

  3390.     int i;
    3391. 

  3391.     int j;
    3392. 

  3392.     int k;
    3393. 

  3393.     int m;
    3394. 

  3394.     int err;
    3395. 

  3395.     int allInExtRange;	/* all values within external range? */
    3396. 

  3396.     int allInIntRange;	/* all values within internal range? */
    3397. 

  3397.     int nels;
    3398. 

  3398.     int nslabs;
    3399. 

  3399.     int nstarts;        /* number of different starts */
    3400. 

  3400.     int nok = 0;      /* count of valid comparisons */
    3401. 

  3401.     size_t start[MAX_RANK];
    3402. 

  3402.     size_t edge[MAX_RANK];
    3403. 

  3403.     size_t index[MAX_RANK];
    3404. 

  3404.     size_t index2[MAX_RANK];
    3405. 

  3405.     size_t mid[MAX_RANK];
    3406. 

  3406.     size_t count[MAX_RANK];
    3407. 

  3407.     size_t sstride[MAX_RANK];
    3408. 

  3408.     ptrdiff_t stride[MAX_RANK];
    3409. 

  3409.     int canConvert;     /* Both text or both numeric */
    3410. 

  3410.     int value[MAX_NELS];
    3411. 

  3411.     double expect[MAX_NELS];
    3412. 

  3412. 

  3413.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    3414. 

  3414.     IF (err)
    3415. 

  3415.         error("nc_open: %s", nc_strerror(err));
    3416. 

  3416.     for (i = 0; i < NVARS; i++) {
    3417. 

  3417.         canConvert = (var_type[i] == NC_CHAR) == (NCT_INT == NCT_TEXT);
    3418. 

  3418.         assert(var_rank[i] <= MAX_RANK);
    3419. 

  3419.         assert(var_nels[i] <= MAX_NELS);
    3420. 

  3420.         for (j = 0; j < var_rank[i]; j++) {
    3421. 

  3421.             start[j] = 0;
    3422. 

  3422.             edge[j] = 1;
    3423. 

  3423.             stride[j] = 1;
    3424. 

  3424.         }
    3425. 

  3425.         err = nc_get_vars_int(BAD_ID, i, start, edge, stride, value);
    3426. 

  3426.         IF (err != NC_EBADID)
    3427. 

  3427.             error("bad ncid: status = %d", err);
    3428. 

  3428.         err = nc_get_vars_int(ncid, BAD_VARID, start, edge, stride, value);
    3429. 

  3429.         IF (err != NC_ENOTVAR)
    3430. 

  3430.             error("bad var id: status = %d", err);
    3431. 

  3431.         for (j = 0; j < var_rank[i]; j++) {
    3432. 

  3432.             start[j] = var_shape[i][j];
    3433. 

  3433.             err = nc_get_vars_int(ncid, i, start, edge, stride, value);
    3434. 

  3434. 	  if(!canConvert) {
    3435. 

  3435. 		IF (err != NC_ECHAR)
    3436. 

  3436.                	    error("conversion: status = %d", err);
    3437. 

  3437. 	  } else {
    3438. 

  3438.             IF (err != NC_EINVALCOORDS)
    3439. 

  3439.                 error("bad index: status = %d", err);
    3440. 

  3440.             start[j] = 0;
    3441. 

  3441.             edge[j] = var_shape[i][j] + 1;
    3442. 

  3442.             err = nc_get_vars_int(ncid, i, start, edge, stride, value);
    3443. 

  3443.             IF (err != NC_EEDGE)
    3444. 

  3444.                 error("bad edge: status = %d", err);
    3445. 

  3445.             edge[j] = 1;
    3446. 

  3446.             stride[j] = 0;
    3447. 

  3447.             err = nc_get_vars_int(ncid, i, start, edge, stride, value);
    3448. 

  3448.             IF (err != NC_ESTRIDE)
    3449. 

  3449.                 error("bad stride: status = %d", err);
    3450. 

  3450.             stride[j] = 1;
    3451. 

  3451. 	  }
    3452. 

  3452.         }
    3453. 

  3453.             /* Choose a random point dividing each dim into 2 parts */
    3454. 

  3454.             /* get 2^rank (nslabs) slabs so defined */
    3455. 

  3455.         nslabs = 1;
    3456. 

  3456.         for (j = 0; j < var_rank[i]; j++) {
    3457. 

  3457.             mid[j] = roll( var_shape[i][j] );
    3458. 

  3458.             nslabs *= 2;
    3459. 

  3459.         }
    3460. 

  3460.             /* bits of k determine whether to get lower or upper part of dim */
    3461. 

  3461.             /* choose random stride from 1 to edge */
    3462. 

  3462.         for (k = 0; k < nslabs; k++) {
    3463. 

  3463.             nstarts = 1;
    3464. 

  3464.             for (j = 0; j < var_rank[i]; j++) {
    3465. 

  3465.                 if ((k >> j) & 1) {
    3466. 

  3466.                     start[j] = 0;
    3467. 

  3467.                     edge[j] = mid[j];
    3468. 

  3468.                 }else{
    3469. 

  3469.                     start[j] = mid[j];
    3470. 

  3470.                     edge[j] = var_shape[i][j] - mid[j];
    3471. 

  3471.                 }
    3472. 

  3472.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    3473. 

  3473.                 nstarts *= stride[j];
    3474. 

  3474.             }
    3475. 

  3475.             for (m = 0; m < nstarts; m++) {
    3476. 

  3476.                 err = toMixedBase(m, var_rank[i], sstride, index);
    3477. 

  3477.                 IF (err)
    3478. 

  3478.                     error("error in toMixedBase");
    3479. 

  3479.                 nels = 1;
    3480. 

  3480.                 for (j = 0; j < var_rank[i]; j++) {
    3481. 

  3481.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    3482. 

  3482.                     nels *= count[j];
    3483. 

  3483.                     index[j] += start[j];
    3484. 

  3484.                 }
    3485. 

  3485.                         /* Random choice of forward or backward */
    3486. 

  3486. /* TODO
    3487. 

  3487.                 if ( roll(2) ) {
    3488. 

  3488.                     for (j = 0; j < var_rank[i]; j++) {
    3489. 

  3489.                         index[j] += (count[j] - 1) * stride[j];
    3490. 

  3490.                         stride[j] = -stride[j];
    3491. 

  3491.                     }
    3492. 

  3492.                 }
    3493. 

  3493. */
    3494. 

  3494. 		allInExtRange = allInIntRange = 1;
    3495. 

  3495. 		for (j = 0; j < nels; j++) {
    3496. 

  3496. 		    err = toMixedBase(j, var_rank[i], count, index2);
    3497. 

  3497. 		    IF (err)
    3498. 

  3498. 			error("error in toMixedBase 1");
    3499. 

  3499. 		    for (d = 0; d < var_rank[i]; d++)
    3500. 

  3500. 			index2[d] = index[d] + index2[d] * stride[d];
    3501. 

  3501. 		    expect[j] = hash4(var_type[i], var_rank[i], index2, 
    3502. 

  3502. 			NCT_INT);
    3503. 

  3503. 		    if (inRange3(expect[j],var_type[i],NCT_INT)) {
    3504. 

  3504. 			allInIntRange = allInIntRange && expect[j] >= int_min
    3505. 

  3505. 			    && expect[j] <= int_max;
    3506. 

  3506. 		    } else {
    3507. 

  3507. 			allInExtRange = 0;
    3508. 

  3508. 		    }
    3509. 

  3509. 		}
    3510. 

  3510.                 if (var_rank[i] == 0 && i%2 )
    3511. 

  3511.                     err = nc_get_vars_int(ncid, i, NULL, NULL, NULL, value);
    3512. 

  3512.                 else
    3513. 

  3513.                     err = nc_get_vars_int(ncid, i, index, count, stride, value);
    3514. 

  3514. 		if (canConvert) {
    3515. 

  3515. 		    if (allInExtRange) {
    3516. 

  3516. 			if (allInIntRange) {
    3517. 

  3517. 			    IF (err)
    3518. 

  3518. 				error("%s", nc_strerror(err));
    3519. 

  3519. 			} else {
    3520. 

  3520. 			    IF (err != NC_ERANGE)
    3521. 

  3521. 				error("Range error: status = %d", err);
    3522. 

  3522. 			}
    3523. 

  3523. 		    } else {
    3524. 

  3524. 			IF (err != 0 && err != NC_ERANGE)
    3525. 

  3525. 			    error("OK or Range error: status = %d", err);
    3526. 

  3526. 		    }
    3527. 

  3527. 		    for (j = 0; j < nels; j++) {
    3528. 

  3528. 			if (inRange3(expect[j],var_type[i],NCT_INT)
    3529. 

  3529. 				&& expect[j] >= int_min && expect[j] <= int_max) {
    3530. 

  3530. 			    IF (!equal(value[j],expect[j],var_type[i],
    3531. 

  3531. 				    NCT_INT)){
    3532. 

  3532. 				error("value read not that expected");
    3533. 

  3533. 				if (verbose) {
    3534. 

  3534. 				    error("\n");
    3535. 

  3535. 				    error("varid: %d, ", i);
    3536. 

  3536. 				    error("var_name: %s, ", var_name[i]);
    3537. 

  3537. 				    error("element number: %d ", j);
    3538. 

  3538.                                     error("expect: %g, ", expect[j]);
    3539. 

  3539. 				    error("got: %g", (double) value[j]);
    3540. 

  3540. 				}
    3541. 

  3541. 			    } else {
    3542. 

  3542. 				nok++;
    3543. 

  3543. 			    }
    3544. 

  3544. 			}
    3545. 

  3545. 		    }
    3546. 

  3546. 		} else {
    3547. 

  3547. 		    IF (nels > 0 && err != NC_ECHAR)
    3548. 

  3548. 			error("wrong type: status = %d", err);
    3549. 

  3549. 		}
    3550. 

  3550. 	    }
    3551. 

  3551. 	}
    3552. 

  3552. 

  3553.     }
    3554. 

  3554.     err = nc_close(ncid);
    3555. 

  3555.     IF (err)
    3556. 

  3556.         error("nc_close: %s", nc_strerror(err));
    3557. 

  3557.     print_nok(nok);
    3558. 

  3558. }
    3559. 

  3559. 

  3560. void
    3561. 

  3561. test_nc_get_vars_long(void)
    3562. 

  3562. {
    3563. 

  3563.     int ncid;
    3564. 

  3564.     int d;
    3565. 

  3565.     int i;
    3566. 

  3566.     int j;
    3567. 

  3567.     int k;
    3568. 

  3568.     int m;
    3569. 

  3569.     int err;
    3570. 

  3570.     int allInExtRange;	/* all values within external range? */
    3571. 

  3571.     int allInIntRange;	/* all values within internal range? */
    3572. 

  3572.     int nels;
    3573. 

  3573.     int nslabs;
    3574. 

  3574.     int nstarts;        /* number of different starts */
    3575. 

  3575.     int nok = 0;      /* count of valid comparisons */
    3576. 

  3576.     size_t start[MAX_RANK];
    3577. 

  3577.     size_t edge[MAX_RANK];
    3578. 

  3578.     size_t index[MAX_RANK];
    3579. 

  3579.     size_t index2[MAX_RANK];
    3580. 

  3580.     size_t mid[MAX_RANK];
    3581. 

  3581.     size_t count[MAX_RANK];
    3582. 

  3582.     size_t sstride[MAX_RANK];
    3583. 

  3583.     ptrdiff_t stride[MAX_RANK];
    3584. 

  3584.     int canConvert;     /* Both text or both numeric */
    3585. 

  3585.     long value[MAX_NELS];
    3586. 

  3586.     double expect[MAX_NELS];
    3587. 

  3587. 

  3588.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    3589. 

  3589.     IF (err)
    3590. 

  3590.         error("nc_open: %s", nc_strerror(err));
    3591. 

  3591.     for (i = 0; i < NVARS; i++) {
    3592. 

  3592.         canConvert = (var_type[i] == NC_CHAR) == (NCT_LONG == NCT_TEXT);
    3593. 

  3593.         assert(var_rank[i] <= MAX_RANK);
    3594. 

  3594.         assert(var_nels[i] <= MAX_NELS);
    3595. 

  3595.         for (j = 0; j < var_rank[i]; j++) {
    3596. 

  3596.             start[j] = 0;
    3597. 

  3597.             edge[j] = 1;
    3598. 

  3598.             stride[j] = 1;
    3599. 

  3599.         }
    3600. 

  3600.         err = nc_get_vars_long(BAD_ID, i, start, edge, stride, value);
    3601. 

  3601.         IF (err != NC_EBADID)
    3602. 

  3602.             error("bad ncid: status = %d", err);
    3603. 

  3603.         err = nc_get_vars_long(ncid, BAD_VARID, start, edge, stride, value);
    3604. 

  3604.         IF (err != NC_ENOTVAR)
    3605. 

  3605.             error("bad var id: status = %d", err);
    3606. 

  3606.         for (j = 0; j < var_rank[i]; j++) {
    3607. 

  3607.             start[j] = var_shape[i][j];
    3608. 

  3608.             err = nc_get_vars_long(ncid, i, start, edge, stride, value);
    3609. 

  3609. 	  if(!canConvert) {
    3610. 

  3610. 		IF (err != NC_ECHAR)
    3611. 

  3611.                	    error("conversion: status = %d", err);
    3612. 

  3612. 	  } else {
    3613. 

  3613.             IF (err != NC_EINVALCOORDS)
    3614. 

  3614.                 error("bad index: status = %d", err);
    3615. 

  3615.             start[j] = 0;
    3616. 

  3616.             edge[j] = var_shape[i][j] + 1;
    3617. 

  3617.             err = nc_get_vars_long(ncid, i, start, edge, stride, value);
    3618. 

  3618.             IF (err != NC_EEDGE)
    3619. 

  3619.                 error("bad edge: status = %d", err);
    3620. 

  3620.             edge[j] = 1;
    3621. 

  3621.             stride[j] = 0;
    3622. 

  3622.             err = nc_get_vars_long(ncid, i, start, edge, stride, value);
    3623. 

  3623.             IF (err != NC_ESTRIDE)
    3624. 

  3624.                 error("bad stride: status = %d", err);
    3625. 

  3625.             stride[j] = 1;
    3626. 

  3626. 	  }
    3627. 

  3627.         }
    3628. 

  3628.             /* Choose a random point dividing each dim into 2 parts */
    3629. 

  3629.             /* get 2^rank (nslabs) slabs so defined */
    3630. 

  3630.         nslabs = 1;
    3631. 

  3631.         for (j = 0; j < var_rank[i]; j++) {
    3632. 

  3632.             mid[j] = roll( var_shape[i][j] );
    3633. 

  3633.             nslabs *= 2;
    3634. 

  3634.         }
    3635. 

  3635.             /* bits of k determine whether to get lower or upper part of dim */
    3636. 

  3636.             /* choose random stride from 1 to edge */
    3637. 

  3637.         for (k = 0; k < nslabs; k++) {
    3638. 

  3638.             nstarts = 1;
    3639. 

  3639.             for (j = 0; j < var_rank[i]; j++) {
    3640. 

  3640.                 if ((k >> j) & 1) {
    3641. 

  3641.                     start[j] = 0;
    3642. 

  3642.                     edge[j] = mid[j];
    3643. 

  3643.                 }else{
    3644. 

  3644.                     start[j] = mid[j];
    3645. 

  3645.                     edge[j] = var_shape[i][j] - mid[j];
    3646. 

  3646.                 }
    3647. 

  3647.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    3648. 

  3648.                 nstarts *= stride[j];
    3649. 

  3649.             }
    3650. 

  3650.             for (m = 0; m < nstarts; m++) {
    3651. 

  3651.                 err = toMixedBase(m, var_rank[i], sstride, index);
    3652. 

  3652.                 IF (err)
    3653. 

  3653.                     error("error in toMixedBase");
    3654. 

  3654.                 nels = 1;
    3655. 

  3655.                 for (j = 0; j < var_rank[i]; j++) {
    3656. 

  3656.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    3657. 

  3657.                     nels *= count[j];
    3658. 

  3658.                     index[j] += start[j];
    3659. 

  3659.                 }
    3660. 

  3660.                         /* Random choice of forward or backward */
    3661. 

  3661. /* TODO
    3662. 

  3662.                 if ( roll(2) ) {
    3663. 

  3663.                     for (j = 0; j < var_rank[i]; j++) {
    3664. 

  3664.                         index[j] += (count[j] - 1) * stride[j];
    3665. 

  3665.                         stride[j] = -stride[j];
    3666. 

  3666.                     }
    3667. 

  3667.                 }
    3668. 

  3668. */
    3669. 

  3669. 		allInExtRange = allInIntRange = 1;
    3670. 

  3670. 		for (j = 0; j < nels; j++) {
    3671. 

  3671. 		    err = toMixedBase(j, var_rank[i], count, index2);
    3672. 

  3672. 		    IF (err)
    3673. 

  3673. 			error("error in toMixedBase 1");
    3674. 

  3674. 		    for (d = 0; d < var_rank[i]; d++)
    3675. 

  3675. 			index2[d] = index[d] + index2[d] * stride[d];
    3676. 

  3676. 		    expect[j] = hash4(var_type[i], var_rank[i], index2, 
    3677. 

  3677. 			NCT_LONG);
    3678. 

  3678. 		    if (inRange3(expect[j],var_type[i],NCT_LONG)) {
    3679. 

  3679. 			allInIntRange = allInIntRange && expect[j] >= long_min
    3680. 

  3680. 			    && expect[j] <= long_max;
    3681. 

  3681. 		    } else {
    3682. 

  3682. 			allInExtRange = 0;
    3683. 

  3683. 		    }
    3684. 

  3684. 		}
    3685. 

  3685.                 if (var_rank[i] == 0 && i%2 )
    3686. 

  3686.                     err = nc_get_vars_long(ncid, i, NULL, NULL, NULL, value);
    3687. 

  3687.                 else
    3688. 

  3688.                     err = nc_get_vars_long(ncid, i, index, count, stride, value);
    3689. 

  3689. 		if (canConvert) {
    3690. 

  3690. 		    if (allInExtRange) {
    3691. 

  3691. 			if (allInIntRange) {
    3692. 

  3692. 			    IF (err)
    3693. 

  3693. 				error("%s", nc_strerror(err));
    3694. 

  3694. 			} else {
    3695. 

  3695. 			    IF (err != NC_ERANGE)
    3696. 

  3696. 				error("Range error: status = %d", err);
    3697. 

  3697. 			}
    3698. 

  3698. 		    } else {
    3699. 

  3699. 			IF (err != 0 && err != NC_ERANGE)
    3700. 

  3700. 			    error("OK or Range error: status = %d", err);
    3701. 

  3701. 		    }
    3702. 

  3702. 		    for (j = 0; j < nels; j++) {
    3703. 

  3703. 			if (inRange3(expect[j],var_type[i],NCT_LONG)
    3704. 

  3704. 				&& expect[j] >= long_min && expect[j] <= long_max) {
    3705. 

  3705. 			    IF (!equal(value[j],expect[j],var_type[i],
    3706. 

  3706. 				    NCT_LONG)){
    3707. 

  3707. 				error("value read not that expected");
    3708. 

  3708. 				if (verbose) {
    3709. 

  3709. 				    error("\n");
    3710. 

  3710. 				    error("varid: %d, ", i);
    3711. 

  3711. 				    error("var_name: %s, ", var_name[i]);
    3712. 

  3712. 				    error("element number: %d ", j);
    3713. 

  3713.                                     error("expect: %g, ", expect[j]);
    3714. 

  3714. 				    error("got: %g", (double) value[j]);
    3715. 

  3715. 				}
    3716. 

  3716. 			    } else {
    3717. 

  3717. 				nok++;
    3718. 

  3718. 			    }
    3719. 

  3719. 			}
    3720. 

  3720. 		    }
    3721. 

  3721. 		} else {
    3722. 

  3722. 		    IF (nels > 0 && err != NC_ECHAR)
    3723. 

  3723. 			error("wrong type: status = %d", err);
    3724. 

  3724. 		}
    3725. 

  3725. 	    }
    3726. 

  3726. 	}
    3727. 

  3727. 

  3728.     }
    3729. 

  3729.     err = nc_close(ncid);
    3730. 

  3730.     IF (err)
    3731. 

  3731.         error("nc_close: %s", nc_strerror(err));
    3732. 

  3732.     print_nok(nok);
    3733. 

  3733. }
    3734. 

  3734. 

  3735. void
    3736. 

  3736. test_nc_get_vars_float(void)
    3737. 

  3737. {
    3738. 

  3738.     int ncid;
    3739. 

  3739.     int d;
    3740. 

  3740.     int i;
    3741. 

  3741.     int j;
    3742. 

  3742.     int k;
    3743. 

  3743.     int m;
    3744. 

  3744.     int err;
    3745. 

  3745.     int allInExtRange;	/* all values within external range? */
    3746. 

  3746.     int allInIntRange;	/* all values within internal range? */
    3747. 

  3747.     int nels;
    3748. 

  3748.     int nslabs;
    3749. 

  3749.     int nstarts;        /* number of different starts */
    3750. 

  3750.     int nok = 0;      /* count of valid comparisons */
    3751. 

  3751.     size_t start[MAX_RANK];
    3752. 

  3752.     size_t edge[MAX_RANK];
    3753. 

  3753.     size_t index[MAX_RANK];
    3754. 

  3754.     size_t index2[MAX_RANK];
    3755. 

  3755.     size_t mid[MAX_RANK];
    3756. 

  3756.     size_t count[MAX_RANK];
    3757. 

  3757.     size_t sstride[MAX_RANK];
    3758. 

  3758.     ptrdiff_t stride[MAX_RANK];
    3759. 

  3759.     int canConvert;     /* Both text or both numeric */
    3760. 

  3760.     float value[MAX_NELS];
    3761. 

  3761.     double expect[MAX_NELS];
    3762. 

  3762. 

  3763.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    3764. 

  3764.     IF (err)
    3765. 

  3765.         error("nc_open: %s", nc_strerror(err));
    3766. 

  3766.     for (i = 0; i < NVARS; i++) {
    3767. 

  3767.         canConvert = (var_type[i] == NC_CHAR) == (NCT_FLOAT == NCT_TEXT);
    3768. 

  3768.         assert(var_rank[i] <= MAX_RANK);
    3769. 

  3769.         assert(var_nels[i] <= MAX_NELS);
    3770. 

  3770.         for (j = 0; j < var_rank[i]; j++) {
    3771. 

  3771.             start[j] = 0;
    3772. 

  3772.             edge[j] = 1;
    3773. 

  3773.             stride[j] = 1;
    3774. 

  3774.         }
    3775. 

  3775.         err = nc_get_vars_float(BAD_ID, i, start, edge, stride, value);
    3776. 

  3776.         IF (err != NC_EBADID)
    3777. 

  3777.             error("bad ncid: status = %d", err);
    3778. 

  3778.         err = nc_get_vars_float(ncid, BAD_VARID, start, edge, stride, value);
    3779. 

  3779.         IF (err != NC_ENOTVAR)
    3780. 

  3780.             error("bad var id: status = %d", err);
    3781. 

  3781.         for (j = 0; j < var_rank[i]; j++) {
    3782. 

  3782.             start[j] = var_shape[i][j];
    3783. 

  3783.             err = nc_get_vars_float(ncid, i, start, edge, stride, value);
    3784. 

  3784. 	  if(!canConvert) {
    3785. 

  3785. 		IF (err != NC_ECHAR)
    3786. 

  3786.                	    error("conversion: status = %d", err);
    3787. 

  3787. 	  } else {
    3788. 

  3788.             IF (err != NC_EINVALCOORDS)
    3789. 

  3789.                 error("bad index: status = %d", err);
    3790. 

  3790.             start[j] = 0;
    3791. 

  3791.             edge[j] = var_shape[i][j] + 1;
    3792. 

  3792.             err = nc_get_vars_float(ncid, i, start, edge, stride, value);
    3793. 

  3793.             IF (err != NC_EEDGE)
    3794. 

  3794.                 error("bad edge: status = %d", err);
    3795. 

  3795.             edge[j] = 1;
    3796. 

  3796.             stride[j] = 0;
    3797. 

  3797.             err = nc_get_vars_float(ncid, i, start, edge, stride, value);
    3798. 

  3798.             IF (err != NC_ESTRIDE)
    3799. 

  3799.                 error("bad stride: status = %d", err);
    3800. 

  3800.             stride[j] = 1;
    3801. 

  3801. 	  }
    3802. 

  3802.         }
    3803. 

  3803.             /* Choose a random point dividing each dim into 2 parts */
    3804. 

  3804.             /* get 2^rank (nslabs) slabs so defined */
    3805. 

  3805.         nslabs = 1;
    3806. 

  3806.         for (j = 0; j < var_rank[i]; j++) {
    3807. 

  3807.             mid[j] = roll( var_shape[i][j] );
    3808. 

  3808.             nslabs *= 2;
    3809. 

  3809.         }
    3810. 

  3810.             /* bits of k determine whether to get lower or upper part of dim */
    3811. 

  3811.             /* choose random stride from 1 to edge */
    3812. 

  3812.         for (k = 0; k < nslabs; k++) {
    3813. 

  3813.             nstarts = 1;
    3814. 

  3814.             for (j = 0; j < var_rank[i]; j++) {
    3815. 

  3815.                 if ((k >> j) & 1) {
    3816. 

  3816.                     start[j] = 0;
    3817. 

  3817.                     edge[j] = mid[j];
    3818. 

  3818.                 }else{
    3819. 

  3819.                     start[j] = mid[j];
    3820. 

  3820.                     edge[j] = var_shape[i][j] - mid[j];
    3821. 

  3821.                 }
    3822. 

  3822.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    3823. 

  3823.                 nstarts *= stride[j];
    3824. 

  3824.             }
    3825. 

  3825.             for (m = 0; m < nstarts; m++) {
    3826. 

  3826.                 err = toMixedBase(m, var_rank[i], sstride, index);
    3827. 

  3827.                 IF (err)
    3828. 

  3828.                     error("error in toMixedBase");
    3829. 

  3829.                 nels = 1;
    3830. 

  3830.                 for (j = 0; j < var_rank[i]; j++) {
    3831. 

  3831.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    3832. 

  3832.                     nels *= count[j];
    3833. 

  3833.                     index[j] += start[j];
    3834. 

  3834.                 }
    3835. 

  3835.                         /* Random choice of forward or backward */
    3836. 

  3836. /* TODO
    3837. 

  3837.                 if ( roll(2) ) {
    3838. 

  3838.                     for (j = 0; j < var_rank[i]; j++) {
    3839. 

  3839.                         index[j] += (count[j] - 1) * stride[j];
    3840. 

  3840.                         stride[j] = -stride[j];
    3841. 

  3841.                     }
    3842. 

  3842.                 }
    3843. 

  3843. */
    3844. 

  3844. 		allInExtRange = allInIntRange = 1;
    3845. 

  3845. 		for (j = 0; j < nels; j++) {
    3846. 

  3846. 		    err = toMixedBase(j, var_rank[i], count, index2);
    3847. 

  3847. 		    IF (err)
    3848. 

  3848. 			error("error in toMixedBase 1");
    3849. 

  3849. 		    for (d = 0; d < var_rank[i]; d++)
    3850. 

  3850. 			index2[d] = index[d] + index2[d] * stride[d];
    3851. 

  3851. 		    expect[j] = hash4(var_type[i], var_rank[i], index2, 
    3852. 

  3852. 			NCT_FLOAT);
    3853. 

  3853. 		    if (inRange3(expect[j],var_type[i],NCT_FLOAT)) {
    3854. 

  3854. 			allInIntRange = allInIntRange && expect[j] >= float_min
    3855. 

  3855. 			    && expect[j] <= float_max;
    3856. 

  3856. 		    } else {
    3857. 

  3857. 			allInExtRange = 0;
    3858. 

  3858. 		    }
    3859. 

  3859. 		}
    3860. 

  3860.                 if (var_rank[i] == 0 && i%2 )
    3861. 

  3861.                     err = nc_get_vars_float(ncid, i, NULL, NULL, NULL, value);
    3862. 

  3862.                 else
    3863. 

  3863.                     err = nc_get_vars_float(ncid, i, index, count, stride, value);
    3864. 

  3864. 		if (canConvert) {
    3865. 

  3865. 		    if (allInExtRange) {
    3866. 

  3866. 			if (allInIntRange) {
    3867. 

  3867. 			    IF (err)
    3868. 

  3868. 				error("%s", nc_strerror(err));
    3869. 

  3869. 			} else {
    3870. 

  3870. 			    IF (err != NC_ERANGE)
    3871. 

  3871. 				error("Range error: status = %d", err);
    3872. 

  3872. 			}
    3873. 

  3873. 		    } else {
    3874. 

  3874. 			IF (err != 0 && err != NC_ERANGE)
    3875. 

  3875. 			    error("OK or Range error: status = %d", err);
    3876. 

  3876. 		    }
    3877. 

  3877. 		    for (j = 0; j < nels; j++) {
    3878. 

  3878. 			if (inRange3(expect[j],var_type[i],NCT_FLOAT)
    3879. 

  3879. 				&& expect[j] >= float_min && expect[j] <= float_max) {
    3880. 

  3880. 			    IF (!equal(value[j],expect[j],var_type[i],
    3881. 

  3881. 				    NCT_FLOAT)){
    3882. 

  3882. 				error("value read not that expected");
    3883. 

  3883. 				if (verbose) {
    3884. 

  3884. 				    error("\n");
    3885. 

  3885. 				    error("varid: %d, ", i);
    3886. 

  3886. 				    error("var_name: %s, ", var_name[i]);
    3887. 

  3887. 				    error("element number: %d ", j);
    3888. 

  3888.                                     error("expect: %g, ", expect[j]);
    3889. 

  3889. 				    error("got: %g", (double) value[j]);
    3890. 

  3890. 				}
    3891. 

  3891. 			    } else {
    3892. 

  3892. 				nok++;
    3893. 

  3893. 			    }
    3894. 

  3894. 			}
    3895. 

  3895. 		    }
    3896. 

  3896. 		} else {
    3897. 

  3897. 		    IF (nels > 0 && err != NC_ECHAR)
    3898. 

  3898. 			error("wrong type: status = %d", err);
    3899. 

  3899. 		}
    3900. 

  3900. 	    }
    3901. 

  3901. 	}
    3902. 

  3902. 

  3903.     }
    3904. 

  3904.     err = nc_close(ncid);
    3905. 

  3905.     IF (err)
    3906. 

  3906.         error("nc_close: %s", nc_strerror(err));
    3907. 

  3907.     print_nok(nok);
    3908. 

  3908. }
    3909. 

  3909. 

  3910. void
    3911. 

  3911. test_nc_get_vars_double(void)
    3912. 

  3912. {
    3913. 

  3913.     int ncid;
    3914. 

  3914.     int d;
    3915. 

  3915.     int i;
    3916. 

  3916.     int j;
    3917. 

  3917.     int k;
    3918. 

  3918.     int m;
    3919. 

  3919.     int err;
    3920. 

  3920.     int allInExtRange;	/* all values within external range? */
    3921. 

  3921.     int allInIntRange;	/* all values within internal range? */
    3922. 

  3922.     int nels;
    3923. 

  3923.     int nslabs;
    3924. 

  3924.     int nstarts;        /* number of different starts */
    3925. 

  3925.     int nok = 0;      /* count of valid comparisons */
    3926. 

  3926.     size_t start[MAX_RANK];
    3927. 

  3927.     size_t edge[MAX_RANK];
    3928. 

  3928.     size_t index[MAX_RANK];
    3929. 

  3929.     size_t index2[MAX_RANK];
    3930. 

  3930.     size_t mid[MAX_RANK];
    3931. 

  3931.     size_t count[MAX_RANK];
    3932. 

  3932.     size_t sstride[MAX_RANK];
    3933. 

  3933.     ptrdiff_t stride[MAX_RANK];
    3934. 

  3934.     int canConvert;     /* Both text or both numeric */
    3935. 

  3935.     double value[MAX_NELS];
    3936. 

  3936.     double expect[MAX_NELS];
    3937. 

  3937. 

  3938.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    3939. 

  3939.     IF (err)
    3940. 

  3940.         error("nc_open: %s", nc_strerror(err));
    3941. 

  3941.     for (i = 0; i < NVARS; i++) {
    3942. 

  3942.         canConvert = (var_type[i] == NC_CHAR) == (NCT_DOUBLE == NCT_TEXT);
    3943. 

  3943.         assert(var_rank[i] <= MAX_RANK);
    3944. 

  3944.         assert(var_nels[i] <= MAX_NELS);
    3945. 

  3945.         for (j = 0; j < var_rank[i]; j++) {
    3946. 

  3946.             start[j] = 0;
    3947. 

  3947.             edge[j] = 1;
    3948. 

  3948.             stride[j] = 1;
    3949. 

  3949.         }
    3950. 

  3950.         err = nc_get_vars_double(BAD_ID, i, start, edge, stride, value);
    3951. 

  3951.         IF (err != NC_EBADID)
    3952. 

  3952.             error("bad ncid: status = %d", err);
    3953. 

  3953.         err = nc_get_vars_double(ncid, BAD_VARID, start, edge, stride, value);
    3954. 

  3954.         IF (err != NC_ENOTVAR)
    3955. 

  3955.             error("bad var id: status = %d", err);
    3956. 

  3956.         for (j = 0; j < var_rank[i]; j++) {
    3957. 

  3957.             start[j] = var_shape[i][j];
    3958. 

  3958.             err = nc_get_vars_double(ncid, i, start, edge, stride, value);
    3959. 

  3959. 	  if(!canConvert) {
    3960. 

  3960. 		IF (err != NC_ECHAR)
    3961. 

  3961.                	    error("conversion: status = %d", err);
    3962. 

  3962. 	  } else {
    3963. 

  3963.             IF (err != NC_EINVALCOORDS)
    3964. 

  3964.                 error("bad index: status = %d", err);
    3965. 

  3965.             start[j] = 0;
    3966. 

  3966.             edge[j] = var_shape[i][j] + 1;
    3967. 

  3967.             err = nc_get_vars_double(ncid, i, start, edge, stride, value);
    3968. 

  3968.             IF (err != NC_EEDGE)
    3969. 

  3969.                 error("bad edge: status = %d", err);
    3970. 

  3970.             edge[j] = 1;
    3971. 

  3971.             stride[j] = 0;
    3972. 

  3972.             err = nc_get_vars_double(ncid, i, start, edge, stride, value);
    3973. 

  3973.             IF (err != NC_ESTRIDE)
    3974. 

  3974.                 error("bad stride: status = %d", err);
    3975. 

  3975.             stride[j] = 1;
    3976. 

  3976. 	  }
    3977. 

  3977.         }
    3978. 

  3978.             /* Choose a random point dividing each dim into 2 parts */
    3979. 

  3979.             /* get 2^rank (nslabs) slabs so defined */
    3980. 

  3980.         nslabs = 1;
    3981. 

  3981.         for (j = 0; j < var_rank[i]; j++) {
    3982. 

  3982.             mid[j] = roll( var_shape[i][j] );
    3983. 

  3983.             nslabs *= 2;
    3984. 

  3984.         }
    3985. 

  3985.             /* bits of k determine whether to get lower or upper part of dim */
    3986. 

  3986.             /* choose random stride from 1 to edge */
    3987. 

  3987.         for (k = 0; k < nslabs; k++) {
    3988. 

  3988.             nstarts = 1;
    3989. 

  3989.             for (j = 0; j < var_rank[i]; j++) {
    3990. 

  3990.                 if ((k >> j) & 1) {
    3991. 

  3991.                     start[j] = 0;
    3992. 

  3992.                     edge[j] = mid[j];
    3993. 

  3993.                 }else{
    3994. 

  3994.                     start[j] = mid[j];
    3995. 

  3995.                     edge[j] = var_shape[i][j] - mid[j];
    3996. 

  3996.                 }
    3997. 

  3997.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    3998. 

  3998.                 nstarts *= stride[j];
    3999. 

  3999.             }
    4000. 

  4000.             for (m = 0; m < nstarts; m++) {
    4001. 

  4001.                 err = toMixedBase(m, var_rank[i], sstride, index);
    4002. 

  4002.                 IF (err)
    4003. 

  4003.                     error("error in toMixedBase");
    4004. 

  4004.                 nels = 1;
    4005. 

  4005.                 for (j = 0; j < var_rank[i]; j++) {
    4006. 

  4006.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    4007. 

  4007.                     nels *= count[j];
    4008. 

  4008.                     index[j] += start[j];
    4009. 

  4009.                 }
    4010. 

  4010.                         /* Random choice of forward or backward */
    4011. 

  4011. /* TODO
    4012. 

  4012.                 if ( roll(2) ) {
    4013. 

  4013.                     for (j = 0; j < var_rank[i]; j++) {
    4014. 

  4014.                         index[j] += (count[j] - 1) * stride[j];
    4015. 

  4015.                         stride[j] = -stride[j];
    4016. 

  4016.                     }
    4017. 

  4017.                 }
    4018. 

  4018. */
    4019. 

  4019. 		allInExtRange = allInIntRange = 1;
    4020. 

  4020. 		for (j = 0; j < nels; j++) {
    4021. 

  4021. 		    err = toMixedBase(j, var_rank[i], count, index2);
    4022. 

  4022. 		    IF (err)
    4023. 

  4023. 			error("error in toMixedBase 1");
    4024. 

  4024. 		    for (d = 0; d < var_rank[i]; d++)
    4025. 

  4025. 			index2[d] = index[d] + index2[d] * stride[d];
    4026. 

  4026. 		    expect[j] = hash4(var_type[i], var_rank[i], index2, 
    4027. 

  4027. 			NCT_DOUBLE);
    4028. 

  4028. 		    if (inRange3(expect[j],var_type[i],NCT_DOUBLE)) {
    4029. 

  4029. 			allInIntRange = allInIntRange && expect[j] >= double_min
    4030. 

  4030. 			    && expect[j] <= double_max;
    4031. 

  4031. 		    } else {
    4032. 

  4032. 			allInExtRange = 0;
    4033. 

  4033. 		    }
    4034. 

  4034. 		}
    4035. 

  4035.                 if (var_rank[i] == 0 && i%2 )
    4036. 

  4036.                     err = nc_get_vars_double(ncid, i, NULL, NULL, NULL, value);
    4037. 

  4037.                 else
    4038. 

  4038.                     err = nc_get_vars_double(ncid, i, index, count, stride, value);
    4039. 

  4039. 		if (canConvert) {
    4040. 

  4040. 		    if (allInExtRange) {
    4041. 

  4041. 			if (allInIntRange) {
    4042. 

  4042. 			    IF (err)
    4043. 

  4043. 				error("%s", nc_strerror(err));
    4044. 

  4044. 			} else {
    4045. 

  4045. 			    IF (err != NC_ERANGE)
    4046. 

  4046. 				error("Range error: status = %d", err);
    4047. 

  4047. 			}
    4048. 

  4048. 		    } else {
    4049. 

  4049. 			IF (err != 0 && err != NC_ERANGE)
    4050. 

  4050. 			    error("OK or Range error: status = %d", err);
    4051. 

  4051. 		    }
    4052. 

  4052. 		    for (j = 0; j < nels; j++) {
    4053. 

  4053. 			if (inRange3(expect[j],var_type[i],NCT_DOUBLE)
    4054. 

  4054. 				&& expect[j] >= double_min && expect[j] <= double_max) {
    4055. 

  4055. 			    IF (!equal(value[j],expect[j],var_type[i],
    4056. 

  4056. 				    NCT_DOUBLE)){
    4057. 

  4057. 				error("value read not that expected");
    4058. 

  4058. 				if (verbose) {
    4059. 

  4059. 				    error("\n");
    4060. 

  4060. 				    error("varid: %d, ", i);
    4061. 

  4061. 				    error("var_name: %s, ", var_name[i]);
    4062. 

  4062. 				    error("element number: %d ", j);
    4063. 

  4063.                                     error("expect: %g, ", expect[j]);
    4064. 

  4064. 				    error("got: %g", (double) value[j]);
    4065. 

  4065. 				}
    4066. 

  4066. 			    } else {
    4067. 

  4067. 				nok++;
    4068. 

  4068. 			    }
    4069. 

  4069. 			}
    4070. 

  4070. 		    }
    4071. 

  4071. 		} else {
    4072. 

  4072. 		    IF (nels > 0 && err != NC_ECHAR)
    4073. 

  4073. 			error("wrong type: status = %d", err);
    4074. 

  4074. 		}
    4075. 

  4075. 	    }
    4076. 

  4076. 	}
    4077. 

  4077. 

  4078.     }
    4079. 

  4079.     err = nc_close(ncid);
    4080. 

  4080.     IF (err)
    4081. 

  4081.         error("nc_close: %s", nc_strerror(err));
    4082. 

  4082.     print_nok(nok);
    4083. 

  4083. }
    4084. 

  4084. 

  4085. 

  4086. 

  4087. 

  4088. void
    4089. 

  4089. test_nc_get_varm_text(void)
    4090. 

  4090. {
    4091. 

  4091.     int ncid;
    4092. 

  4092.     int d;
    4093. 

  4093.     int i;
    4094. 

  4094.     int j;
    4095. 

  4095.     int k;
    4096. 

  4096.     int m;
    4097. 

  4097.     int err;
    4098. 

  4098.     int allInExtRange;	/* all values within external range? */
    4099. 

  4099.     int allInIntRange;	/* all values within internal range? */
    4100. 

  4100.     int nels;
    4101. 

  4101.     int nslabs;
    4102. 

  4102.     int nstarts;        /* number of different starts */
    4103. 

  4103.     int nok = 0;      /* count of valid comparisons */
    4104. 

  4104.     size_t start[MAX_RANK];
    4105. 

  4105.     size_t edge[MAX_RANK];
    4106. 

  4106.     size_t index[MAX_RANK];
    4107. 

  4107.     size_t index2[MAX_RANK];
    4108. 

  4108.     size_t mid[MAX_RANK];
    4109. 

  4109.     size_t count[MAX_RANK];
    4110. 

  4110.     size_t sstride[MAX_RANK];
    4111. 

  4111.     ptrdiff_t stride[MAX_RANK];
    4112. 

  4112.     ptrdiff_t imap[MAX_RANK];
    4113. 

  4113.     int canConvert;     /* Both text or both numeric */
    4114. 

  4114.     text value[MAX_NELS];
    4115. 

  4115.     double expect[MAX_NELS];
    4116. 

  4116. 

  4117.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    4118. 

  4118.     IF (err)
    4119. 

  4119.         error("nc_open: %s", nc_strerror(err));
    4120. 

  4120.     for (i = 0; i < NVARS; i++) {
    4121. 

  4121.         canConvert = (var_type[i] == NC_CHAR) == (NCT_TEXT == NCT_TEXT);
    4122. 

  4122.         assert(var_rank[i] <= MAX_RANK);
    4123. 

  4123.         assert(var_nels[i] <= MAX_NELS);
    4124. 

  4124.         for (j = 0; j < var_rank[i]; j++) {
    4125. 

  4125.             start[j] = 0;
    4126. 

  4126.             edge[j] = 1;
    4127. 

  4127.             stride[j] = 1;
    4128. 

  4128.             imap[j] = 1;
    4129. 

  4129.         }
    4130. 

  4130.         err = nc_get_varm_text(BAD_ID, i, start, edge, stride, imap, value);
    4131. 

  4131.         IF (err != NC_EBADID)
    4132. 

  4132.             error("bad ncid: status = %d", err);
    4133. 

  4133.         err = nc_get_varm_text(ncid, BAD_VARID, start, edge, stride, imap, value);
    4134. 

  4134.         IF (err != NC_ENOTVAR)
    4135. 

  4135.             error("bad var id: status = %d", err);
    4136. 

  4136.         for (j = 0; j < var_rank[i]; j++) {
    4137. 

  4137.             start[j] = var_shape[i][j];
    4138. 

  4138.             err = nc_get_varm_text(ncid, i, start, edge, stride, imap, value);
    4139. 

  4139. 	  if(!canConvert) {
    4140. 

  4140. 		IF (err != NC_ECHAR)
    4141. 

  4141.                	    error("conversion: status = %d", err);
    4142. 

  4142. 	  } else {
    4143. 

  4143. 	    IF (err != NC_EINVALCOORDS)
    4144. 

  4144.                 error("bad index: status = %d", err);
    4145. 

  4145.             start[j] = 0;
    4146. 

  4146.             edge[j] = var_shape[i][j] + 1;
    4147. 

  4147.             err = nc_get_varm_text(ncid, i, start, edge, stride, imap, value);
    4148. 

  4148.             IF (err != NC_EEDGE)
    4149. 

  4149.                 error("bad edge: status = %d", err);
    4150. 

  4150.             edge[j] = 1;
    4151. 

  4151.             stride[j] = 0;
    4152. 

  4152.             err = nc_get_varm_text(ncid, i, start, edge, stride, imap, value);
    4153. 

  4153.             IF (err != NC_ESTRIDE)
    4154. 

  4154.                 error("bad stride: status = %d", err);
    4155. 

  4155.             stride[j] = 1;
    4156. 

  4156.            }
    4157. 

  4157.         }
    4158. 

  4158.             /* Choose a random point dividing each dim into 2 parts */
    4159. 

  4159.             /* get 2^rank (nslabs) slabs so defined */
    4160. 

  4160.         nslabs = 1;
    4161. 

  4161.         for (j = 0; j < var_rank[i]; j++) {
    4162. 

  4162.             mid[j] = roll( var_shape[i][j] );
    4163. 

  4163.             nslabs *= 2;
    4164. 

  4164.         }
    4165. 

  4165.             /* bits of k determine whether to get lower or upper part of dim */
    4166. 

  4166.             /* choose random stride from 1 to edge */
    4167. 

  4167.         for (k = 0; k < nslabs; k++) {
    4168. 

  4168.             nstarts = 1;
    4169. 

  4169.             for (j = 0; j < var_rank[i]; j++) {
    4170. 

  4170.                 if ((k >> j) & 1) {
    4171. 

  4171.                     start[j] = 0;
    4172. 

  4172.                     edge[j] = mid[j];
    4173. 

  4173.                 }else{
    4174. 

  4174.                     start[j] = mid[j];
    4175. 

  4175.                     edge[j] = var_shape[i][j] - mid[j];
    4176. 

  4176.                 }
    4177. 

  4177.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    4178. 

  4178.                 nstarts *= stride[j];
    4179. 

  4179.             }
    4180. 

  4180.             for (m = 0; m < nstarts; m++) {
    4181. 

  4181.                 err = toMixedBase(m, var_rank[i], sstride, index);
    4182. 

  4182.                 IF (err)
    4183. 

  4183.                     error("error in toMixedBase");
    4184. 

  4184.                 nels = 1;
    4185. 

  4185.                 for (j = 0; j < var_rank[i]; j++) {
    4186. 

  4186.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    4187. 

  4187.                     nels *= count[j];
    4188. 

  4188.                     index[j] += start[j];
    4189. 

  4189.                 }
    4190. 

  4190. 		    /* Random choice of forward or backward */
    4191. 

  4191. /* TODO
    4192. 

  4192. 		if ( roll(2) ) {
    4193. 

  4193. 		    for (j = 0; j < var_rank[i]; j++) {
    4194. 

  4194. 			index[j] += (count[j] - 1) * stride[j];
    4195. 

  4195. 			stride[j] = -stride[j];
    4196. 

  4196. 		    }
    4197. 

  4197. 		}
    4198. 

  4198.  */
    4199. 

  4199. 		if (var_rank[i] > 0) {
    4200. 

  4200. 		    j = var_rank[i] - 1;
    4201. 

  4201. 		    imap[j] = 1;
    4202. 

  4202. 		    for (; j > 0; j--)
    4203. 

  4203. 			imap[j-1] = imap[j] * count[j];
    4204. 

  4204. 		}
    4205. 

  4205.                 allInExtRange = allInIntRange = 1;
    4206. 

  4206.                 for (j = 0; j < nels; j++) {
    4207. 

  4207.                     err = toMixedBase(j, var_rank[i], count, index2);
    4208. 

  4208.                     IF (err)
    4209. 

  4209.                         error("error in toMixedBase 1");
    4210. 

  4210.                     for (d = 0; d < var_rank[i]; d++)
    4211. 

  4211.                         index2[d] = index[d] + index2[d] * stride[d];
    4212. 

  4212.                     expect[j] = hash4(var_type[i], var_rank[i], index2,
    4213. 

  4213.                         NCT_TEXT);
    4214. 

  4214.                     if (inRange3(expect[j],var_type[i],NCT_TEXT)) {
    4215. 

  4215.                         allInIntRange = allInIntRange && expect[j] >= text_min
    4216. 

  4216.                             && expect[j] <= text_max;
    4217. 

  4217.                     } else {
    4218. 

  4218.                         allInExtRange = 0;
    4219. 

  4219.                     }
    4220. 

  4220.                 }
    4221. 

  4221.                 if (var_rank[i] == 0 && i%2 )
    4222. 

  4222.                     err = nc_get_varm_text(ncid,i,NULL,NULL,NULL,NULL,value);
    4223. 

  4223.                 else
    4224. 

  4224.                     err = nc_get_varm_text(ncid,i,index,count,stride,imap,value);
    4225. 

  4225.                 if (canConvert) {
    4226. 

  4226.                     if (allInExtRange) {
    4227. 

  4227.                         if (allInIntRange) {
    4228. 

  4228.                             IF (err)
    4229. 

  4229.                                 error("%s", nc_strerror(err));
    4230. 

  4230.                         } else {
    4231. 

  4231.                             IF (err != NC_ERANGE)
    4232. 

  4232.                                 error("Range error: status = %d", err);
    4233. 

  4233.                         }
    4234. 

  4234.                     } else {
    4235. 

  4235.                         IF (err != 0 && err != NC_ERANGE)
    4236. 

  4236.                             error("OK or Range error: status = %d", err);
    4237. 

  4237.                     }
    4238. 

  4238.                     for (j = 0; j < nels; j++) {
    4239. 

  4239.                         if (inRange3(expect[j],var_type[i],NCT_TEXT)
    4240. 

  4240.                                 && expect[j] >= text_min 
    4241. 

  4241. 				&& expect[j] <= text_max) {
    4242. 

  4242. 			    IF (!equal(value[j],expect[j],var_type[i],
    4243. 

  4243. 				    NCT_TEXT)){
    4244. 

  4244.                                 error("value read not that expected");
    4245. 

  4245.                                 if (verbose) {
    4246. 

  4246.                                     error("\n");
    4247. 

  4247.                                     error("varid: %d, ", i);
    4248. 

  4248.                                     error("var_name: %s, ", var_name[i]);
    4249. 

  4249.                                     error("element number: %d ", j);
    4250. 

  4250.                                     error("expect: %g, ", expect[j]);
    4251. 

  4251.                                     error("got: %g", (double) value[j]);
    4252. 

  4252.                                 }
    4253. 

  4253.                             } else {
    4254. 

  4254.                                 nok++;
    4255. 

  4255.                             }
    4256. 

  4256.                         }
    4257. 

  4257.                     }
    4258. 

  4258.                 } else {
    4259. 

  4259.                     IF (nels > 0 && err != NC_ECHAR)
    4260. 

  4260.                         error("wrong type: status = %d", err);
    4261. 

  4261.                 }
    4262. 

  4262.             }
    4263. 

  4263.         }
    4264. 

  4264.     }
    4265. 

  4265.     err = nc_close(ncid);
    4266. 

  4266.     IF (err)
    4267. 

  4267.         error("nc_close: %s", nc_strerror(err));
    4268. 

  4268.     print_nok(nok);
    4269. 

  4269. }
    4270. 

  4270. 

  4271. void
    4272. 

  4272. test_nc_get_varm_uchar(void)
    4273. 

  4273. {
    4274. 

  4274.     int ncid;
    4275. 

  4275.     int d;
    4276. 

  4276.     int i;
    4277. 

  4277.     int j;
    4278. 

  4278.     int k;
    4279. 

  4279.     int m;
    4280. 

  4280.     int err;
    4281. 

  4281.     int allInExtRange;	/* all values within external range? */
    4282. 

  4282.     int allInIntRange;	/* all values within internal range? */
    4283. 

  4283.     int nels;
    4284. 

  4284.     int nslabs;
    4285. 

  4285.     int nstarts;        /* number of different starts */
    4286. 

  4286.     int nok = 0;      /* count of valid comparisons */
    4287. 

  4287.     size_t start[MAX_RANK];
    4288. 

  4288.     size_t edge[MAX_RANK];
    4289. 

  4289.     size_t index[MAX_RANK];
    4290. 

  4290.     size_t index2[MAX_RANK];
    4291. 

  4291.     size_t mid[MAX_RANK];
    4292. 

  4292.     size_t count[MAX_RANK];
    4293. 

  4293.     size_t sstride[MAX_RANK];
    4294. 

  4294.     ptrdiff_t stride[MAX_RANK];
    4295. 

  4295.     ptrdiff_t imap[MAX_RANK];
    4296. 

  4296.     int canConvert;     /* Both text or both numeric */
    4297. 

  4297.     uchar value[MAX_NELS];
    4298. 

  4298.     double expect[MAX_NELS];
    4299. 

  4299. 

  4300.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    4301. 

  4301.     IF (err)
    4302. 

  4302.         error("nc_open: %s", nc_strerror(err));
    4303. 

  4303.     for (i = 0; i < NVARS; i++) {
    4304. 

  4304.         canConvert = (var_type[i] == NC_CHAR) == (NCT_UCHAR == NCT_TEXT);
    4305. 

  4305.         assert(var_rank[i] <= MAX_RANK);
    4306. 

  4306.         assert(var_nels[i] <= MAX_NELS);
    4307. 

  4307.         for (j = 0; j < var_rank[i]; j++) {
    4308. 

  4308.             start[j] = 0;
    4309. 

  4309.             edge[j] = 1;
    4310. 

  4310.             stride[j] = 1;
    4311. 

  4311.             imap[j] = 1;
    4312. 

  4312.         }
    4313. 

  4313.         err = nc_get_varm_uchar(BAD_ID, i, start, edge, stride, imap, value);
    4314. 

  4314.         IF (err != NC_EBADID)
    4315. 

  4315.             error("bad ncid: status = %d", err);
    4316. 

  4316.         err = nc_get_varm_uchar(ncid, BAD_VARID, start, edge, stride, imap, value);
    4317. 

  4317.         IF (err != NC_ENOTVAR)
    4318. 

  4318.             error("bad var id: status = %d", err);
    4319. 

  4319.         for (j = 0; j < var_rank[i]; j++) {
    4320. 

  4320.             start[j] = var_shape[i][j];
    4321. 

  4321.             err = nc_get_varm_uchar(ncid, i, start, edge, stride, imap, value);
    4322. 

  4322. 	  if(!canConvert) {
    4323. 

  4323. 		IF (err != NC_ECHAR)
    4324. 

  4324.                	    error("conversion: status = %d", err);
    4325. 

  4325. 	  } else {
    4326. 

  4326. 	    IF (err != NC_EINVALCOORDS)
    4327. 

  4327.                 error("bad index: status = %d", err);
    4328. 

  4328.             start[j] = 0;
    4329. 

  4329.             edge[j] = var_shape[i][j] + 1;
    4330. 

  4330.             err = nc_get_varm_uchar(ncid, i, start, edge, stride, imap, value);
    4331. 

  4331.             IF (err != NC_EEDGE)
    4332. 

  4332.                 error("bad edge: status = %d", err);
    4333. 

  4333.             edge[j] = 1;
    4334. 

  4334.             stride[j] = 0;
    4335. 

  4335.             err = nc_get_varm_uchar(ncid, i, start, edge, stride, imap, value);
    4336. 

  4336.             IF (err != NC_ESTRIDE)
    4337. 

  4337.                 error("bad stride: status = %d", err);
    4338. 

  4338.             stride[j] = 1;
    4339. 

  4339.            }
    4340. 

  4340.         }
    4341. 

  4341.             /* Choose a random point dividing each dim into 2 parts */
    4342. 

  4342.             /* get 2^rank (nslabs) slabs so defined */
    4343. 

  4343.         nslabs = 1;
    4344. 

  4344.         for (j = 0; j < var_rank[i]; j++) {
    4345. 

  4345.             mid[j] = roll( var_shape[i][j] );
    4346. 

  4346.             nslabs *= 2;
    4347. 

  4347.         }
    4348. 

  4348.             /* bits of k determine whether to get lower or upper part of dim */
    4349. 

  4349.             /* choose random stride from 1 to edge */
    4350. 

  4350.         for (k = 0; k < nslabs; k++) {
    4351. 

  4351.             nstarts = 1;
    4352. 

  4352.             for (j = 0; j < var_rank[i]; j++) {
    4353. 

  4353.                 if ((k >> j) & 1) {
    4354. 

  4354.                     start[j] = 0;
    4355. 

  4355.                     edge[j] = mid[j];
    4356. 

  4356.                 }else{
    4357. 

  4357.                     start[j] = mid[j];
    4358. 

  4358.                     edge[j] = var_shape[i][j] - mid[j];
    4359. 

  4359.                 }
    4360. 

  4360.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    4361. 

  4361.                 nstarts *= stride[j];
    4362. 

  4362.             }
    4363. 

  4363.             for (m = 0; m < nstarts; m++) {
    4364. 

  4364.                 err = toMixedBase(m, var_rank[i], sstride, index);
    4365. 

  4365.                 IF (err)
    4366. 

  4366.                     error("error in toMixedBase");
    4367. 

  4367.                 nels = 1;
    4368. 

  4368.                 for (j = 0; j < var_rank[i]; j++) {
    4369. 

  4369.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    4370. 

  4370.                     nels *= count[j];
    4371. 

  4371.                     index[j] += start[j];
    4372. 

  4372.                 }
    4373. 

  4373. 		    /* Random choice of forward or backward */
    4374. 

  4374. /* TODO
    4375. 

  4375. 		if ( roll(2) ) {
    4376. 

  4376. 		    for (j = 0; j < var_rank[i]; j++) {
    4377. 

  4377. 			index[j] += (count[j] - 1) * stride[j];
    4378. 

  4378. 			stride[j] = -stride[j];
    4379. 

  4379. 		    }
    4380. 

  4380. 		}
    4381. 

  4381.  */
    4382. 

  4382. 		if (var_rank[i] > 0) {
    4383. 

  4383. 		    j = var_rank[i] - 1;
    4384. 

  4384. 		    imap[j] = 1;
    4385. 

  4385. 		    for (; j > 0; j--)
    4386. 

  4386. 			imap[j-1] = imap[j] * count[j];
    4387. 

  4387. 		}
    4388. 

  4388.                 allInExtRange = allInIntRange = 1;
    4389. 

  4389.                 for (j = 0; j < nels; j++) {
    4390. 

  4390.                     err = toMixedBase(j, var_rank[i], count, index2);
    4391. 

  4391.                     IF (err)
    4392. 

  4392.                         error("error in toMixedBase 1");
    4393. 

  4393.                     for (d = 0; d < var_rank[i]; d++)
    4394. 

  4394.                         index2[d] = index[d] + index2[d] * stride[d];
    4395. 

  4395.                     expect[j] = hash4(var_type[i], var_rank[i], index2,
    4396. 

  4396.                         NCT_UCHAR);
    4397. 

  4397.                     if (inRange3(expect[j],var_type[i],NCT_UCHAR)) {
    4398. 

  4398.                         allInIntRange = allInIntRange && expect[j] >= uchar_min
    4399. 

  4399.                             && expect[j] <= uchar_max;
    4400. 

  4400.                     } else {
    4401. 

  4401.                         allInExtRange = 0;
    4402. 

  4402.                     }
    4403. 

  4403.                 }
    4404. 

  4404.                 if (var_rank[i] == 0 && i%2 )
    4405. 

  4405.                     err = nc_get_varm_uchar(ncid,i,NULL,NULL,NULL,NULL,value);
    4406. 

  4406.                 else
    4407. 

  4407.                     err = nc_get_varm_uchar(ncid,i,index,count,stride,imap,value);
    4408. 

  4408.                 if (canConvert) {
    4409. 

  4409.                     if (allInExtRange) {
    4410. 

  4410.                         if (allInIntRange) {
    4411. 

  4411.                             IF (err)
    4412. 

  4412.                                 error("%s", nc_strerror(err));
    4413. 

  4413.                         } else {
    4414. 

  4414.                             IF (err != NC_ERANGE)
    4415. 

  4415.                                 error("Range error: status = %d", err);
    4416. 

  4416.                         }
    4417. 

  4417.                     } else {
    4418. 

  4418.                         IF (err != 0 && err != NC_ERANGE)
    4419. 

  4419.                             error("OK or Range error: status = %d", err);
    4420. 

  4420.                     }
    4421. 

  4421.                     for (j = 0; j < nels; j++) {
    4422. 

  4422.                         if (inRange3(expect[j],var_type[i],NCT_UCHAR)
    4423. 

  4423.                                 && expect[j] >= uchar_min 
    4424. 

  4424. 				&& expect[j] <= uchar_max) {
    4425. 

  4425. 			    IF (!equal(value[j],expect[j],var_type[i],
    4426. 

  4426. 				    NCT_UCHAR)){
    4427. 

  4427.                                 error("value read not that expected");
    4428. 

  4428.                                 if (verbose) {
    4429. 

  4429.                                     error("\n");
    4430. 

  4430.                                     error("varid: %d, ", i);
    4431. 

  4431.                                     error("var_name: %s, ", var_name[i]);
    4432. 

  4432.                                     error("element number: %d ", j);
    4433. 

  4433.                                     error("expect: %g, ", expect[j]);
    4434. 

  4434.                                     error("got: %g", (double) value[j]);
    4435. 

  4435.                                 }
    4436. 

  4436.                             } else {
    4437. 

  4437.                                 nok++;
    4438. 

  4438.                             }
    4439. 

  4439.                         }
    4440. 

  4440.                     }
    4441. 

  4441.                 } else {
    4442. 

  4442.                     IF (nels > 0 && err != NC_ECHAR)
    4443. 

  4443.                         error("wrong type: status = %d", err);
    4444. 

  4444.                 }
    4445. 

  4445.             }
    4446. 

  4446.         }
    4447. 

  4447.     }
    4448. 

  4448.     err = nc_close(ncid);
    4449. 

  4449.     IF (err)
    4450. 

  4450.         error("nc_close: %s", nc_strerror(err));
    4451. 

  4451.     print_nok(nok);
    4452. 

  4452. }
    4453. 

  4453. 

  4454. void
    4455. 

  4455. test_nc_get_varm_schar(void)
    4456. 

  4456. {
    4457. 

  4457.     int ncid;
    4458. 

  4458.     int d;
    4459. 

  4459.     int i;
    4460. 

  4460.     int j;
    4461. 

  4461.     int k;
    4462. 

  4462.     int m;
    4463. 

  4463.     int err;
    4464. 

  4464.     int allInExtRange;	/* all values within external range? */
    4465. 

  4465.     int allInIntRange;	/* all values within internal range? */
    4466. 

  4466.     int nels;
    4467. 

  4467.     int nslabs;
    4468. 

  4468.     int nstarts;        /* number of different starts */
    4469. 

  4469.     int nok = 0;      /* count of valid comparisons */
    4470. 

  4470.     size_t start[MAX_RANK];
    4471. 

  4471.     size_t edge[MAX_RANK];
    4472. 

  4472.     size_t index[MAX_RANK];
    4473. 

  4473.     size_t index2[MAX_RANK];
    4474. 

  4474.     size_t mid[MAX_RANK];
    4475. 

  4475.     size_t count[MAX_RANK];
    4476. 

  4476.     size_t sstride[MAX_RANK];
    4477. 

  4477.     ptrdiff_t stride[MAX_RANK];
    4478. 

  4478.     ptrdiff_t imap[MAX_RANK];
    4479. 

  4479.     int canConvert;     /* Both text or both numeric */
    4480. 

  4480.     schar value[MAX_NELS];
    4481. 

  4481.     double expect[MAX_NELS];
    4482. 

  4482. 

  4483.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    4484. 

  4484.     IF (err)
    4485. 

  4485.         error("nc_open: %s", nc_strerror(err));
    4486. 

  4486.     for (i = 0; i < NVARS; i++) {
    4487. 

  4487.         canConvert = (var_type[i] == NC_CHAR) == (NCT_SCHAR == NCT_TEXT);
    4488. 

  4488.         assert(var_rank[i] <= MAX_RANK);
    4489. 

  4489.         assert(var_nels[i] <= MAX_NELS);
    4490. 

  4490.         for (j = 0; j < var_rank[i]; j++) {
    4491. 

  4491.             start[j] = 0;
    4492. 

  4492.             edge[j] = 1;
    4493. 

  4493.             stride[j] = 1;
    4494. 

  4494.             imap[j] = 1;
    4495. 

  4495.         }
    4496. 

  4496.         err = nc_get_varm_schar(BAD_ID, i, start, edge, stride, imap, value);
    4497. 

  4497.         IF (err != NC_EBADID)
    4498. 

  4498.             error("bad ncid: status = %d", err);
    4499. 

  4499.         err = nc_get_varm_schar(ncid, BAD_VARID, start, edge, stride, imap, value);
    4500. 

  4500.         IF (err != NC_ENOTVAR)
    4501. 

  4501.             error("bad var id: status = %d", err);
    4502. 

  4502.         for (j = 0; j < var_rank[i]; j++) {
    4503. 

  4503.             start[j] = var_shape[i][j];
    4504. 

  4504.             err = nc_get_varm_schar(ncid, i, start, edge, stride, imap, value);
    4505. 

  4505. 	  if(!canConvert) {
    4506. 

  4506. 		IF (err != NC_ECHAR)
    4507. 

  4507.                	    error("conversion: status = %d", err);
    4508. 

  4508. 	  } else {
    4509. 

  4509. 	    IF (err != NC_EINVALCOORDS)
    4510. 

  4510.                 error("bad index: status = %d", err);
    4511. 

  4511.             start[j] = 0;
    4512. 

  4512.             edge[j] = var_shape[i][j] + 1;
    4513. 

  4513.             err = nc_get_varm_schar(ncid, i, start, edge, stride, imap, value);
    4514. 

  4514.             IF (err != NC_EEDGE)
    4515. 

  4515.                 error("bad edge: status = %d", err);
    4516. 

  4516.             edge[j] = 1;
    4517. 

  4517.             stride[j] = 0;
    4518. 

  4518.             err = nc_get_varm_schar(ncid, i, start, edge, stride, imap, value);
    4519. 

  4519.             IF (err != NC_ESTRIDE)
    4520. 

  4520.                 error("bad stride: status = %d", err);
    4521. 

  4521.             stride[j] = 1;
    4522. 

  4522.            }
    4523. 

  4523.         }
    4524. 

  4524.             /* Choose a random point dividing each dim into 2 parts */
    4525. 

  4525.             /* get 2^rank (nslabs) slabs so defined */
    4526. 

  4526.         nslabs = 1;
    4527. 

  4527.         for (j = 0; j < var_rank[i]; j++) {
    4528. 

  4528.             mid[j] = roll( var_shape[i][j] );
    4529. 

  4529.             nslabs *= 2;
    4530. 

  4530.         }
    4531. 

  4531.             /* bits of k determine whether to get lower or upper part of dim */
    4532. 

  4532.             /* choose random stride from 1 to edge */
    4533. 

  4533.         for (k = 0; k < nslabs; k++) {
    4534. 

  4534.             nstarts = 1;
    4535. 

  4535.             for (j = 0; j < var_rank[i]; j++) {
    4536. 

  4536.                 if ((k >> j) & 1) {
    4537. 

  4537.                     start[j] = 0;
    4538. 

  4538.                     edge[j] = mid[j];
    4539. 

  4539.                 }else{
    4540. 

  4540.                     start[j] = mid[j];
    4541. 

  4541.                     edge[j] = var_shape[i][j] - mid[j];
    4542. 

  4542.                 }
    4543. 

  4543.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    4544. 

  4544.                 nstarts *= stride[j];
    4545. 

  4545.             }
    4546. 

  4546.             for (m = 0; m < nstarts; m++) {
    4547. 

  4547.                 err = toMixedBase(m, var_rank[i], sstride, index);
    4548. 

  4548.                 IF (err)
    4549. 

  4549.                     error("error in toMixedBase");
    4550. 

  4550.                 nels = 1;
    4551. 

  4551.                 for (j = 0; j < var_rank[i]; j++) {
    4552. 

  4552.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    4553. 

  4553.                     nels *= count[j];
    4554. 

  4554.                     index[j] += start[j];
    4555. 

  4555.                 }
    4556. 

  4556. 		    /* Random choice of forward or backward */
    4557. 

  4557. /* TODO
    4558. 

  4558. 		if ( roll(2) ) {
    4559. 

  4559. 		    for (j = 0; j < var_rank[i]; j++) {
    4560. 

  4560. 			index[j] += (count[j] - 1) * stride[j];
    4561. 

  4561. 			stride[j] = -stride[j];
    4562. 

  4562. 		    }
    4563. 

  4563. 		}
    4564. 

  4564.  */
    4565. 

  4565. 		if (var_rank[i] > 0) {
    4566. 

  4566. 		    j = var_rank[i] - 1;
    4567. 

  4567. 		    imap[j] = 1;
    4568. 

  4568. 		    for (; j > 0; j--)
    4569. 

  4569. 			imap[j-1] = imap[j] * count[j];
    4570. 

  4570. 		}
    4571. 

  4571.                 allInExtRange = allInIntRange = 1;
    4572. 

  4572.                 for (j = 0; j < nels; j++) {
    4573. 

  4573.                     err = toMixedBase(j, var_rank[i], count, index2);
    4574. 

  4574.                     IF (err)
    4575. 

  4575.                         error("error in toMixedBase 1");
    4576. 

  4576.                     for (d = 0; d < var_rank[i]; d++)
    4577. 

  4577.                         index2[d] = index[d] + index2[d] * stride[d];
    4578. 

  4578.                     expect[j] = hash4(var_type[i], var_rank[i], index2,
    4579. 

  4579.                         NCT_SCHAR);
    4580. 

  4580.                     if (inRange3(expect[j],var_type[i],NCT_SCHAR)) {
    4581. 

  4581.                         allInIntRange = allInIntRange && expect[j] >= schar_min
    4582. 

  4582.                             && expect[j] <= schar_max;
    4583. 

  4583.                     } else {
    4584. 

  4584.                         allInExtRange = 0;
    4585. 

  4585.                     }
    4586. 

  4586.                 }
    4587. 

  4587.                 if (var_rank[i] == 0 && i%2 )
    4588. 

  4588.                     err = nc_get_varm_schar(ncid,i,NULL,NULL,NULL,NULL,value);
    4589. 

  4589.                 else
    4590. 

  4590.                     err = nc_get_varm_schar(ncid,i,index,count,stride,imap,value);
    4591. 

  4591.                 if (canConvert) {
    4592. 

  4592.                     if (allInExtRange) {
    4593. 

  4593.                         if (allInIntRange) {
    4594. 

  4594.                             IF (err)
    4595. 

  4595.                                 error("%s", nc_strerror(err));
    4596. 

  4596.                         } else {
    4597. 

  4597.                             IF (err != NC_ERANGE)
    4598. 

  4598.                                 error("Range error: status = %d", err);
    4599. 

  4599.                         }
    4600. 

  4600.                     } else {
    4601. 

  4601.                         IF (err != 0 && err != NC_ERANGE)
    4602. 

  4602.                             error("OK or Range error: status = %d", err);
    4603. 

  4603.                     }
    4604. 

  4604.                     for (j = 0; j < nels; j++) {
    4605. 

  4605.                         if (inRange3(expect[j],var_type[i],NCT_SCHAR)
    4606. 

  4606.                                 && expect[j] >= schar_min 
    4607. 

  4607. 				&& expect[j] <= schar_max) {
    4608. 

  4608. 			    IF (!equal(value[j],expect[j],var_type[i],
    4609. 

  4609. 				    NCT_SCHAR)){
    4610. 

  4610.                                 error("value read not that expected");
    4611. 

  4611.                                 if (verbose) {
    4612. 

  4612.                                     error("\n");
    4613. 

  4613.                                     error("varid: %d, ", i);
    4614. 

  4614.                                     error("var_name: %s, ", var_name[i]);
    4615. 

  4615.                                     error("element number: %d ", j);
    4616. 

  4616.                                     error("expect: %g, ", expect[j]);
    4617. 

  4617.                                     error("got: %g", (double) value[j]);
    4618. 

  4618.                                 }
    4619. 

  4619.                             } else {
    4620. 

  4620.                                 nok++;
    4621. 

  4621.                             }
    4622. 

  4622.                         }
    4623. 

  4623.                     }
    4624. 

  4624.                 } else {
    4625. 

  4625.                     IF (nels > 0 && err != NC_ECHAR)
    4626. 

  4626.                         error("wrong type: status = %d", err);
    4627. 

  4627.                 }
    4628. 

  4628.             }
    4629. 

  4629.         }
    4630. 

  4630.     }
    4631. 

  4631.     err = nc_close(ncid);
    4632. 

  4632.     IF (err)
    4633. 

  4633.         error("nc_close: %s", nc_strerror(err));
    4634. 

  4634.     print_nok(nok);
    4635. 

  4635. }
    4636. 

  4636. 

  4637. void
    4638. 

  4638. test_nc_get_varm_short(void)
    4639. 

  4639. {
    4640. 

  4640.     int ncid;
    4641. 

  4641.     int d;
    4642. 

  4642.     int i;
    4643. 

  4643.     int j;
    4644. 

  4644.     int k;
    4645. 

  4645.     int m;
    4646. 

  4646.     int err;
    4647. 

  4647.     int allInExtRange;	/* all values within external range? */
    4648. 

  4648.     int allInIntRange;	/* all values within internal range? */
    4649. 

  4649.     int nels;
    4650. 

  4650.     int nslabs;
    4651. 

  4651.     int nstarts;        /* number of different starts */
    4652. 

  4652.     int nok = 0;      /* count of valid comparisons */
    4653. 

  4653.     size_t start[MAX_RANK];
    4654. 

  4654.     size_t edge[MAX_RANK];
    4655. 

  4655.     size_t index[MAX_RANK];
    4656. 

  4656.     size_t index2[MAX_RANK];
    4657. 

  4657.     size_t mid[MAX_RANK];
    4658. 

  4658.     size_t count[MAX_RANK];
    4659. 

  4659.     size_t sstride[MAX_RANK];
    4660. 

  4660.     ptrdiff_t stride[MAX_RANK];
    4661. 

  4661.     ptrdiff_t imap[MAX_RANK];
    4662. 

  4662.     int canConvert;     /* Both text or both numeric */
    4663. 

  4663.     short value[MAX_NELS];
    4664. 

  4664.     double expect[MAX_NELS];
    4665. 

  4665. 

  4666.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    4667. 

  4667.     IF (err)
    4668. 

  4668.         error("nc_open: %s", nc_strerror(err));
    4669. 

  4669.     for (i = 0; i < NVARS; i++) {
    4670. 

  4670.         canConvert = (var_type[i] == NC_CHAR) == (NCT_SHORT == NCT_TEXT);
    4671. 

  4671.         assert(var_rank[i] <= MAX_RANK);
    4672. 

  4672.         assert(var_nels[i] <= MAX_NELS);
    4673. 

  4673.         for (j = 0; j < var_rank[i]; j++) {
    4674. 

  4674.             start[j] = 0;
    4675. 

  4675.             edge[j] = 1;
    4676. 

  4676.             stride[j] = 1;
    4677. 

  4677.             imap[j] = 1;
    4678. 

  4678.         }
    4679. 

  4679.         err = nc_get_varm_short(BAD_ID, i, start, edge, stride, imap, value);
    4680. 

  4680.         IF (err != NC_EBADID)
    4681. 

  4681.             error("bad ncid: status = %d", err);
    4682. 

  4682.         err = nc_get_varm_short(ncid, BAD_VARID, start, edge, stride, imap, value);
    4683. 

  4683.         IF (err != NC_ENOTVAR)
    4684. 

  4684.             error("bad var id: status = %d", err);
    4685. 

  4685.         for (j = 0; j < var_rank[i]; j++) {
    4686. 

  4686.             start[j] = var_shape[i][j];
    4687. 

  4687.             err = nc_get_varm_short(ncid, i, start, edge, stride, imap, value);
    4688. 

  4688. 	  if(!canConvert) {
    4689. 

  4689. 		IF (err != NC_ECHAR)
    4690. 

  4690.                	    error("conversion: status = %d", err);
    4691. 

  4691. 	  } else {
    4692. 

  4692. 	    IF (err != NC_EINVALCOORDS)
    4693. 

  4693.                 error("bad index: status = %d", err);
    4694. 

  4694.             start[j] = 0;
    4695. 

  4695.             edge[j] = var_shape[i][j] + 1;
    4696. 

  4696.             err = nc_get_varm_short(ncid, i, start, edge, stride, imap, value);
    4697. 

  4697.             IF (err != NC_EEDGE)
    4698. 

  4698.                 error("bad edge: status = %d", err);
    4699. 

  4699.             edge[j] = 1;
    4700. 

  4700.             stride[j] = 0;
    4701. 

  4701.             err = nc_get_varm_short(ncid, i, start, edge, stride, imap, value);
    4702. 

  4702.             IF (err != NC_ESTRIDE)
    4703. 

  4703.                 error("bad stride: status = %d", err);
    4704. 

  4704.             stride[j] = 1;
    4705. 

  4705.            }
    4706. 

  4706.         }
    4707. 

  4707.             /* Choose a random point dividing each dim into 2 parts */
    4708. 

  4708.             /* get 2^rank (nslabs) slabs so defined */
    4709. 

  4709.         nslabs = 1;
    4710. 

  4710.         for (j = 0; j < var_rank[i]; j++) {
    4711. 

  4711.             mid[j] = roll( var_shape[i][j] );
    4712. 

  4712.             nslabs *= 2;
    4713. 

  4713.         }
    4714. 

  4714.             /* bits of k determine whether to get lower or upper part of dim */
    4715. 

  4715.             /* choose random stride from 1 to edge */
    4716. 

  4716.         for (k = 0; k < nslabs; k++) {
    4717. 

  4717.             nstarts = 1;
    4718. 

  4718.             for (j = 0; j < var_rank[i]; j++) {
    4719. 

  4719.                 if ((k >> j) & 1) {
    4720. 

  4720.                     start[j] = 0;
    4721. 

  4721.                     edge[j] = mid[j];
    4722. 

  4722.                 }else{
    4723. 

  4723.                     start[j] = mid[j];
    4724. 

  4724.                     edge[j] = var_shape[i][j] - mid[j];
    4725. 

  4725.                 }
    4726. 

  4726.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    4727. 

  4727.                 nstarts *= stride[j];
    4728. 

  4728.             }
    4729. 

  4729.             for (m = 0; m < nstarts; m++) {
    4730. 

  4730.                 err = toMixedBase(m, var_rank[i], sstride, index);
    4731. 

  4731.                 IF (err)
    4732. 

  4732.                     error("error in toMixedBase");
    4733. 

  4733.                 nels = 1;
    4734. 

  4734.                 for (j = 0; j < var_rank[i]; j++) {
    4735. 

  4735.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    4736. 

  4736.                     nels *= count[j];
    4737. 

  4737.                     index[j] += start[j];
    4738. 

  4738.                 }
    4739. 

  4739. 		    /* Random choice of forward or backward */
    4740. 

  4740. /* TODO
    4741. 

  4741. 		if ( roll(2) ) {
    4742. 

  4742. 		    for (j = 0; j < var_rank[i]; j++) {
    4743. 

  4743. 			index[j] += (count[j] - 1) * stride[j];
    4744. 

  4744. 			stride[j] = -stride[j];
    4745. 

  4745. 		    }
    4746. 

  4746. 		}
    4747. 

  4747.  */
    4748. 

  4748. 		if (var_rank[i] > 0) {
    4749. 

  4749. 		    j = var_rank[i] - 1;
    4750. 

  4750. 		    imap[j] = 1;
    4751. 

  4751. 		    for (; j > 0; j--)
    4752. 

  4752. 			imap[j-1] = imap[j] * count[j];
    4753. 

  4753. 		}
    4754. 

  4754.                 allInExtRange = allInIntRange = 1;
    4755. 

  4755.                 for (j = 0; j < nels; j++) {
    4756. 

  4756.                     err = toMixedBase(j, var_rank[i], count, index2);
    4757. 

  4757.                     IF (err)
    4758. 

  4758.                         error("error in toMixedBase 1");
    4759. 

  4759.                     for (d = 0; d < var_rank[i]; d++)
    4760. 

  4760.                         index2[d] = index[d] + index2[d] * stride[d];
    4761. 

  4761.                     expect[j] = hash4(var_type[i], var_rank[i], index2,
    4762. 

  4762.                         NCT_SHORT);
    4763. 

  4763.                     if (inRange3(expect[j],var_type[i],NCT_SHORT)) {
    4764. 

  4764.                         allInIntRange = allInIntRange && expect[j] >= short_min
    4765. 

  4765.                             && expect[j] <= short_max;
    4766. 

  4766.                     } else {
    4767. 

  4767.                         allInExtRange = 0;
    4768. 

  4768.                     }
    4769. 

  4769.                 }
    4770. 

  4770.                 if (var_rank[i] == 0 && i%2 )
    4771. 

  4771.                     err = nc_get_varm_short(ncid,i,NULL,NULL,NULL,NULL,value);
    4772. 

  4772.                 else
    4773. 

  4773.                     err = nc_get_varm_short(ncid,i,index,count,stride,imap,value);
    4774. 

  4774.                 if (canConvert) {
    4775. 

  4775.                     if (allInExtRange) {
    4776. 

  4776.                         if (allInIntRange) {
    4777. 

  4777.                             IF (err)
    4778. 

  4778.                                 error("%s", nc_strerror(err));
    4779. 

  4779.                         } else {
    4780. 

  4780.                             IF (err != NC_ERANGE)
    4781. 

  4781.                                 error("Range error: status = %d", err);
    4782. 

  4782.                         }
    4783. 

  4783.                     } else {
    4784. 

  4784.                         IF (err != 0 && err != NC_ERANGE)
    4785. 

  4785.                             error("OK or Range error: status = %d", err);
    4786. 

  4786.                     }
    4787. 

  4787.                     for (j = 0; j < nels; j++) {
    4788. 

  4788.                         if (inRange3(expect[j],var_type[i],NCT_SHORT)
    4789. 

  4789.                                 && expect[j] >= short_min 
    4790. 

  4790. 				&& expect[j] <= short_max) {
    4791. 

  4791. 			    IF (!equal(value[j],expect[j],var_type[i],
    4792. 

  4792. 				    NCT_SHORT)){
    4793. 

  4793.                                 error("value read not that expected");
    4794. 

  4794.                                 if (verbose) {
    4795. 

  4795.                                     error("\n");
    4796. 

  4796.                                     error("varid: %d, ", i);
    4797. 

  4797.                                     error("var_name: %s, ", var_name[i]);
    4798. 

  4798.                                     error("element number: %d ", j);
    4799. 

  4799.                                     error("expect: %g, ", expect[j]);
    4800. 

  4800.                                     error("got: %g", (double) value[j]);
    4801. 

  4801.                                 }
    4802. 

  4802.                             } else {
    4803. 

  4803.                                 nok++;
    4804. 

  4804.                             }
    4805. 

  4805.                         }
    4806. 

  4806.                     }
    4807. 

  4807.                 } else {
    4808. 

  4808.                     IF (nels > 0 && err != NC_ECHAR)
    4809. 

  4809.                         error("wrong type: status = %d", err);
    4810. 

  4810.                 }
    4811. 

  4811.             }
    4812. 

  4812.         }
    4813. 

  4813.     }
    4814. 

  4814.     err = nc_close(ncid);
    4815. 

  4815.     IF (err)
    4816. 

  4816.         error("nc_close: %s", nc_strerror(err));
    4817. 

  4817.     print_nok(nok);
    4818. 

  4818. }
    4819. 

  4819. 

  4820. void
    4821. 

  4821. test_nc_get_varm_int(void)
    4822. 

  4822. {
    4823. 

  4823.     int ncid;
    4824. 

  4824.     int d;
    4825. 

  4825.     int i;
    4826. 

  4826.     int j;
    4827. 

  4827.     int k;
    4828. 

  4828.     int m;
    4829. 

  4829.     int err;
    4830. 

  4830.     int allInExtRange;	/* all values within external range? */
    4831. 

  4831.     int allInIntRange;	/* all values within internal range? */
    4832. 

  4832.     int nels;
    4833. 

  4833.     int nslabs;
    4834. 

  4834.     int nstarts;        /* number of different starts */
    4835. 

  4835.     int nok = 0;      /* count of valid comparisons */
    4836. 

  4836.     size_t start[MAX_RANK];
    4837. 

  4837.     size_t edge[MAX_RANK];
    4838. 

  4838.     size_t index[MAX_RANK];
    4839. 

  4839.     size_t index2[MAX_RANK];
    4840. 

  4840.     size_t mid[MAX_RANK];
    4841. 

  4841.     size_t count[MAX_RANK];
    4842. 

  4842.     size_t sstride[MAX_RANK];
    4843. 

  4843.     ptrdiff_t stride[MAX_RANK];
    4844. 

  4844.     ptrdiff_t imap[MAX_RANK];
    4845. 

  4845.     int canConvert;     /* Both text or both numeric */
    4846. 

  4846.     int value[MAX_NELS];
    4847. 

  4847.     double expect[MAX_NELS];
    4848. 

  4848. 

  4849.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    4850. 

  4850.     IF (err)
    4851. 

  4851.         error("nc_open: %s", nc_strerror(err));
    4852. 

  4852.     for (i = 0; i < NVARS; i++) {
    4853. 

  4853.         canConvert = (var_type[i] == NC_CHAR) == (NCT_INT == NCT_TEXT);
    4854. 

  4854.         assert(var_rank[i] <= MAX_RANK);
    4855. 

  4855.         assert(var_nels[i] <= MAX_NELS);
    4856. 

  4856.         for (j = 0; j < var_rank[i]; j++) {
    4857. 

  4857.             start[j] = 0;
    4858. 

  4858.             edge[j] = 1;
    4859. 

  4859.             stride[j] = 1;
    4860. 

  4860.             imap[j] = 1;
    4861. 

  4861.         }
    4862. 

  4862.         err = nc_get_varm_int(BAD_ID, i, start, edge, stride, imap, value);
    4863. 

  4863.         IF (err != NC_EBADID)
    4864. 

  4864.             error("bad ncid: status = %d", err);
    4865. 

  4865.         err = nc_get_varm_int(ncid, BAD_VARID, start, edge, stride, imap, value);
    4866. 

  4866.         IF (err != NC_ENOTVAR)
    4867. 

  4867.             error("bad var id: status = %d", err);
    4868. 

  4868.         for (j = 0; j < var_rank[i]; j++) {
    4869. 

  4869.             start[j] = var_shape[i][j];
    4870. 

  4870.             err = nc_get_varm_int(ncid, i, start, edge, stride, imap, value);
    4871. 

  4871. 	  if(!canConvert) {
    4872. 

  4872. 		IF (err != NC_ECHAR)
    4873. 

  4873.                	    error("conversion: status = %d", err);
    4874. 

  4874. 	  } else {
    4875. 

  4875. 	    IF (err != NC_EINVALCOORDS)
    4876. 

  4876.                 error("bad index: status = %d", err);
    4877. 

  4877.             start[j] = 0;
    4878. 

  4878.             edge[j] = var_shape[i][j] + 1;
    4879. 

  4879.             err = nc_get_varm_int(ncid, i, start, edge, stride, imap, value);
    4880. 

  4880.             IF (err != NC_EEDGE)
    4881. 

  4881.                 error("bad edge: status = %d", err);
    4882. 

  4882.             edge[j] = 1;
    4883. 

  4883.             stride[j] = 0;
    4884. 

  4884.             err = nc_get_varm_int(ncid, i, start, edge, stride, imap, value);
    4885. 

  4885.             IF (err != NC_ESTRIDE)
    4886. 

  4886.                 error("bad stride: status = %d", err);
    4887. 

  4887.             stride[j] = 1;
    4888. 

  4888.            }
    4889. 

  4889.         }
    4890. 

  4890.             /* Choose a random point dividing each dim into 2 parts */
    4891. 

  4891.             /* get 2^rank (nslabs) slabs so defined */
    4892. 

  4892.         nslabs = 1;
    4893. 

  4893.         for (j = 0; j < var_rank[i]; j++) {
    4894. 

  4894.             mid[j] = roll( var_shape[i][j] );
    4895. 

  4895.             nslabs *= 2;
    4896. 

  4896.         }
    4897. 

  4897.             /* bits of k determine whether to get lower or upper part of dim */
    4898. 

  4898.             /* choose random stride from 1 to edge */
    4899. 

  4899.         for (k = 0; k < nslabs; k++) {
    4900. 

  4900.             nstarts = 1;
    4901. 

  4901.             for (j = 0; j < var_rank[i]; j++) {
    4902. 

  4902.                 if ((k >> j) & 1) {
    4903. 

  4903.                     start[j] = 0;
    4904. 

  4904.                     edge[j] = mid[j];
    4905. 

  4905.                 }else{
    4906. 

  4906.                     start[j] = mid[j];
    4907. 

  4907.                     edge[j] = var_shape[i][j] - mid[j];
    4908. 

  4908.                 }
    4909. 

  4909.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    4910. 

  4910.                 nstarts *= stride[j];
    4911. 

  4911.             }
    4912. 

  4912.             for (m = 0; m < nstarts; m++) {
    4913. 

  4913.                 err = toMixedBase(m, var_rank[i], sstride, index);
    4914. 

  4914.                 IF (err)
    4915. 

  4915.                     error("error in toMixedBase");
    4916. 

  4916.                 nels = 1;
    4917. 

  4917.                 for (j = 0; j < var_rank[i]; j++) {
    4918. 

  4918.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    4919. 

  4919.                     nels *= count[j];
    4920. 

  4920.                     index[j] += start[j];
    4921. 

  4921.                 }
    4922. 

  4922. 		    /* Random choice of forward or backward */
    4923. 

  4923. /* TODO
    4924. 

  4924. 		if ( roll(2) ) {
    4925. 

  4925. 		    for (j = 0; j < var_rank[i]; j++) {
    4926. 

  4926. 			index[j] += (count[j] - 1) * stride[j];
    4927. 

  4927. 			stride[j] = -stride[j];
    4928. 

  4928. 		    }
    4929. 

  4929. 		}
    4930. 

  4930.  */
    4931. 

  4931. 		if (var_rank[i] > 0) {
    4932. 

  4932. 		    j = var_rank[i] - 1;
    4933. 

  4933. 		    imap[j] = 1;
    4934. 

  4934. 		    for (; j > 0; j--)
    4935. 

  4935. 			imap[j-1] = imap[j] * count[j];
    4936. 

  4936. 		}
    4937. 

  4937.                 allInExtRange = allInIntRange = 1;
    4938. 

  4938.                 for (j = 0; j < nels; j++) {
    4939. 

  4939.                     err = toMixedBase(j, var_rank[i], count, index2);
    4940. 

  4940.                     IF (err)
    4941. 

  4941.                         error("error in toMixedBase 1");
    4942. 

  4942.                     for (d = 0; d < var_rank[i]; d++)
    4943. 

  4943.                         index2[d] = index[d] + index2[d] * stride[d];
    4944. 

  4944.                     expect[j] = hash4(var_type[i], var_rank[i], index2,
    4945. 

  4945.                         NCT_INT);
    4946. 

  4946.                     if (inRange3(expect[j],var_type[i],NCT_INT)) {
    4947. 

  4947.                         allInIntRange = allInIntRange && expect[j] >= int_min
    4948. 

  4948.                             && expect[j] <= int_max;
    4949. 

  4949.                     } else {
    4950. 

  4950.                         allInExtRange = 0;
    4951. 

  4951.                     }
    4952. 

  4952.                 }
    4953. 

  4953.                 if (var_rank[i] == 0 && i%2 )
    4954. 

  4954.                     err = nc_get_varm_int(ncid,i,NULL,NULL,NULL,NULL,value);
    4955. 

  4955.                 else
    4956. 

  4956.                     err = nc_get_varm_int(ncid,i,index,count,stride,imap,value);
    4957. 

  4957.                 if (canConvert) {
    4958. 

  4958.                     if (allInExtRange) {
    4959. 

  4959.                         if (allInIntRange) {
    4960. 

  4960.                             IF (err)
    4961. 

  4961.                                 error("%s", nc_strerror(err));
    4962. 

  4962.                         } else {
    4963. 

  4963.                             IF (err != NC_ERANGE)
    4964. 

  4964.                                 error("Range error: status = %d", err);
    4965. 

  4965.                         }
    4966. 

  4966.                     } else {
    4967. 

  4967.                         IF (err != 0 && err != NC_ERANGE)
    4968. 

  4968.                             error("OK or Range error: status = %d", err);
    4969. 

  4969.                     }
    4970. 

  4970.                     for (j = 0; j < nels; j++) {
    4971. 

  4971.                         if (inRange3(expect[j],var_type[i],NCT_INT)
    4972. 

  4972.                                 && expect[j] >= int_min 
    4973. 

  4973. 				&& expect[j] <= int_max) {
    4974. 

  4974. 			    IF (!equal(value[j],expect[j],var_type[i],
    4975. 

  4975. 				    NCT_INT)){
    4976. 

  4976.                                 error("value read not that expected");
    4977. 

  4977.                                 if (verbose) {
    4978. 

  4978.                                     error("\n");
    4979. 

  4979.                                     error("varid: %d, ", i);
    4980. 

  4980.                                     error("var_name: %s, ", var_name[i]);
    4981. 

  4981.                                     error("element number: %d ", j);
    4982. 

  4982.                                     error("expect: %g, ", expect[j]);
    4983. 

  4983.                                     error("got: %g", (double) value[j]);
    4984. 

  4984.                                 }
    4985. 

  4985.                             } else {
    4986. 

  4986.                                 nok++;
    4987. 

  4987.                             }
    4988. 

  4988.                         }
    4989. 

  4989.                     }
    4990. 

  4990.                 } else {
    4991. 

  4991.                     IF (nels > 0 && err != NC_ECHAR)
    4992. 

  4992.                         error("wrong type: status = %d", err);
    4993. 

  4993.                 }
    4994. 

  4994.             }
    4995. 

  4995.         }
    4996. 

  4996.     }
    4997. 

  4997.     err = nc_close(ncid);
    4998. 

  4998.     IF (err)
    4999. 

  4999.         error("nc_close: %s", nc_strerror(err));
    5000. 

  5000.     print_nok(nok);
    5001. 

  5001. }
    5002. 

  5002. 

  5003. void
    5004. 

  5004. test_nc_get_varm_long(void)
    5005. 

  5005. {
    5006. 

  5006.     int ncid;
    5007. 

  5007.     int d;
    5008. 

  5008.     int i;
    5009. 

  5009.     int j;
    5010. 

  5010.     int k;
    5011. 

  5011.     int m;
    5012. 

  5012.     int err;
    5013. 

  5013.     int allInExtRange;	/* all values within external range? */
    5014. 

  5014.     int allInIntRange;	/* all values within internal range? */
    5015. 

  5015.     int nels;
    5016. 

  5016.     int nslabs;
    5017. 

  5017.     int nstarts;        /* number of different starts */
    5018. 

  5018.     int nok = 0;      /* count of valid comparisons */
    5019. 

  5019.     size_t start[MAX_RANK];
    5020. 

  5020.     size_t edge[MAX_RANK];
    5021. 

  5021.     size_t index[MAX_RANK];
    5022. 

  5022.     size_t index2[MAX_RANK];
    5023. 

  5023.     size_t mid[MAX_RANK];
    5024. 

  5024.     size_t count[MAX_RANK];
    5025. 

  5025.     size_t sstride[MAX_RANK];
    5026. 

  5026.     ptrdiff_t stride[MAX_RANK];
    5027. 

  5027.     ptrdiff_t imap[MAX_RANK];
    5028. 

  5028.     int canConvert;     /* Both text or both numeric */
    5029. 

  5029.     long value[MAX_NELS];
    5030. 

  5030.     double expect[MAX_NELS];
    5031. 

  5031. 

  5032.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    5033. 

  5033.     IF (err)
    5034. 

  5034.         error("nc_open: %s", nc_strerror(err));
    5035. 

  5035.     for (i = 0; i < NVARS; i++) {
    5036. 

  5036.         canConvert = (var_type[i] == NC_CHAR) == (NCT_LONG == NCT_TEXT);
    5037. 

  5037.         assert(var_rank[i] <= MAX_RANK);
    5038. 

  5038.         assert(var_nels[i] <= MAX_NELS);
    5039. 

  5039.         for (j = 0; j < var_rank[i]; j++) {
    5040. 

  5040.             start[j] = 0;
    5041. 

  5041.             edge[j] = 1;
    5042. 

  5042.             stride[j] = 1;
    5043. 

  5043.             imap[j] = 1;
    5044. 

  5044.         }
    5045. 

  5045.         err = nc_get_varm_long(BAD_ID, i, start, edge, stride, imap, value);
    5046. 

  5046.         IF (err != NC_EBADID)
    5047. 

  5047.             error("bad ncid: status = %d", err);
    5048. 

  5048.         err = nc_get_varm_long(ncid, BAD_VARID, start, edge, stride, imap, value);
    5049. 

  5049.         IF (err != NC_ENOTVAR)
    5050. 

  5050.             error("bad var id: status = %d", err);
    5051. 

  5051.         for (j = 0; j < var_rank[i]; j++) {
    5052. 

  5052.             start[j] = var_shape[i][j];
    5053. 

  5053.             err = nc_get_varm_long(ncid, i, start, edge, stride, imap, value);
    5054. 

  5054. 	  if(!canConvert) {
    5055. 

  5055. 		IF (err != NC_ECHAR)
    5056. 

  5056.                	    error("conversion: status = %d", err);
    5057. 

  5057. 	  } else {
    5058. 

  5058. 	    IF (err != NC_EINVALCOORDS)
    5059. 

  5059.                 error("bad index: status = %d", err);
    5060. 

  5060.             start[j] = 0;
    5061. 

  5061.             edge[j] = var_shape[i][j] + 1;
    5062. 

  5062.             err = nc_get_varm_long(ncid, i, start, edge, stride, imap, value);
    5063. 

  5063.             IF (err != NC_EEDGE)
    5064. 

  5064.                 error("bad edge: status = %d", err);
    5065. 

  5065.             edge[j] = 1;
    5066. 

  5066.             stride[j] = 0;
    5067. 

  5067.             err = nc_get_varm_long(ncid, i, start, edge, stride, imap, value);
    5068. 

  5068.             IF (err != NC_ESTRIDE)
    5069. 

  5069.                 error("bad stride: status = %d", err);
    5070. 

  5070.             stride[j] = 1;
    5071. 

  5071.            }
    5072. 

  5072.         }
    5073. 

  5073.             /* Choose a random point dividing each dim into 2 parts */
    5074. 

  5074.             /* get 2^rank (nslabs) slabs so defined */
    5075. 

  5075.         nslabs = 1;
    5076. 

  5076.         for (j = 0; j < var_rank[i]; j++) {
    5077. 

  5077.             mid[j] = roll( var_shape[i][j] );
    5078. 

  5078.             nslabs *= 2;
    5079. 

  5079.         }
    5080. 

  5080.             /* bits of k determine whether to get lower or upper part of dim */
    5081. 

  5081.             /* choose random stride from 1 to edge */
    5082. 

  5082.         for (k = 0; k < nslabs; k++) {
    5083. 

  5083.             nstarts = 1;
    5084. 

  5084.             for (j = 0; j < var_rank[i]; j++) {
    5085. 

  5085.                 if ((k >> j) & 1) {
    5086. 

  5086.                     start[j] = 0;
    5087. 

  5087.                     edge[j] = mid[j];
    5088. 

  5088.                 }else{
    5089. 

  5089.                     start[j] = mid[j];
    5090. 

  5090.                     edge[j] = var_shape[i][j] - mid[j];
    5091. 

  5091.                 }
    5092. 

  5092.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    5093. 

  5093.                 nstarts *= stride[j];
    5094. 

  5094.             }
    5095. 

  5095.             for (m = 0; m < nstarts; m++) {
    5096. 

  5096.                 err = toMixedBase(m, var_rank[i], sstride, index);
    5097. 

  5097.                 IF (err)
    5098. 

  5098.                     error("error in toMixedBase");
    5099. 

  5099.                 nels = 1;
    5100. 

  5100.                 for (j = 0; j < var_rank[i]; j++) {
    5101. 

  5101.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    5102. 

  5102.                     nels *= count[j];
    5103. 

  5103.                     index[j] += start[j];
    5104. 

  5104.                 }
    5105. 

  5105. 		    /* Random choice of forward or backward */
    5106. 

  5106. /* TODO
    5107. 

  5107. 		if ( roll(2) ) {
    5108. 

  5108. 		    for (j = 0; j < var_rank[i]; j++) {
    5109. 

  5109. 			index[j] += (count[j] - 1) * stride[j];
    5110. 

  5110. 			stride[j] = -stride[j];
    5111. 

  5111. 		    }
    5112. 

  5112. 		}
    5113. 

  5113.  */
    5114. 

  5114. 		if (var_rank[i] > 0) {
    5115. 

  5115. 		    j = var_rank[i] - 1;
    5116. 

  5116. 		    imap[j] = 1;
    5117. 

  5117. 		    for (; j > 0; j--)
    5118. 

  5118. 			imap[j-1] = imap[j] * count[j];
    5119. 

  5119. 		}
    5120. 

  5120.                 allInExtRange = allInIntRange = 1;
    5121. 

  5121.                 for (j = 0; j < nels; j++) {
    5122. 

  5122.                     err = toMixedBase(j, var_rank[i], count, index2);
    5123. 

  5123.                     IF (err)
    5124. 

  5124.                         error("error in toMixedBase 1");
    5125. 

  5125.                     for (d = 0; d < var_rank[i]; d++)
    5126. 

  5126.                         index2[d] = index[d] + index2[d] * stride[d];
    5127. 

  5127.                     expect[j] = hash4(var_type[i], var_rank[i], index2,
    5128. 

  5128.                         NCT_LONG);
    5129. 

  5129.                     if (inRange3(expect[j],var_type[i],NCT_LONG)) {
    5130. 

  5130.                         allInIntRange = allInIntRange && expect[j] >= long_min
    5131. 

  5131.                             && expect[j] <= long_max;
    5132. 

  5132.                     } else {
    5133. 

  5133.                         allInExtRange = 0;
    5134. 

  5134.                     }
    5135. 

  5135.                 }
    5136. 

  5136.                 if (var_rank[i] == 0 && i%2 )
    5137. 

  5137.                     err = nc_get_varm_long(ncid,i,NULL,NULL,NULL,NULL,value);
    5138. 

  5138.                 else
    5139. 

  5139.                     err = nc_get_varm_long(ncid,i,index,count,stride,imap,value);
    5140. 

  5140.                 if (canConvert) {
    5141. 

  5141.                     if (allInExtRange) {
    5142. 

  5142.                         if (allInIntRange) {
    5143. 

  5143.                             IF (err)
    5144. 

  5144.                                 error("%s", nc_strerror(err));
    5145. 

  5145.                         } else {
    5146. 

  5146.                             IF (err != NC_ERANGE)
    5147. 

  5147.                                 error("Range error: status = %d", err);
    5148. 

  5148.                         }
    5149. 

  5149.                     } else {
    5150. 

  5150.                         IF (err != 0 && err != NC_ERANGE)
    5151. 

  5151.                             error("OK or Range error: status = %d", err);
    5152. 

  5152.                     }
    5153. 

  5153.                     for (j = 0; j < nels; j++) {
    5154. 

  5154.                         if (inRange3(expect[j],var_type[i],NCT_LONG)
    5155. 

  5155.                                 && expect[j] >= long_min 
    5156. 

  5156. 				&& expect[j] <= long_max) {
    5157. 

  5157. 			    IF (!equal(value[j],expect[j],var_type[i],
    5158. 

  5158. 				    NCT_LONG)){
    5159. 

  5159.                                 error("value read not that expected");
    5160. 

  5160.                                 if (verbose) {
    5161. 

  5161.                                     error("\n");
    5162. 

  5162.                                     error("varid: %d, ", i);
    5163. 

  5163.                                     error("var_name: %s, ", var_name[i]);
    5164. 

  5164.                                     error("element number: %d ", j);
    5165. 

  5165.                                     error("expect: %g, ", expect[j]);
    5166. 

  5166.                                     error("got: %g", (double) value[j]);
    5167. 

  5167.                                 }
    5168. 

  5168.                             } else {
    5169. 

  5169.                                 nok++;
    5170. 

  5170.                             }
    5171. 

  5171.                         }
    5172. 

  5172.                     }
    5173. 

  5173.                 } else {
    5174. 

  5174.                     IF (nels > 0 && err != NC_ECHAR)
    5175. 

  5175.                         error("wrong type: status = %d", err);
    5176. 

  5176.                 }
    5177. 

  5177.             }
    5178. 

  5178.         }
    5179. 

  5179.     }
    5180. 

  5180.     err = nc_close(ncid);
    5181. 

  5181.     IF (err)
    5182. 

  5182.         error("nc_close: %s", nc_strerror(err));
    5183. 

  5183.     print_nok(nok);
    5184. 

  5184. }
    5185. 

  5185. 

  5186. void
    5187. 

  5187. test_nc_get_varm_float(void)
    5188. 

  5188. {
    5189. 

  5189.     int ncid;
    5190. 

  5190.     int d;
    5191. 

  5191.     int i;
    5192. 

  5192.     int j;
    5193. 

  5193.     int k;
    5194. 

  5194.     int m;
    5195. 

  5195.     int err;
    5196. 

  5196.     int allInExtRange;	/* all values within external range? */
    5197. 

  5197.     int allInIntRange;	/* all values within internal range? */
    5198. 

  5198.     int nels;
    5199. 

  5199.     int nslabs;
    5200. 

  5200.     int nstarts;        /* number of different starts */
    5201. 

  5201.     int nok = 0;      /* count of valid comparisons */
    5202. 

  5202.     size_t start[MAX_RANK];
    5203. 

  5203.     size_t edge[MAX_RANK];
    5204. 

  5204.     size_t index[MAX_RANK];
    5205. 

  5205.     size_t index2[MAX_RANK];
    5206. 

  5206.     size_t mid[MAX_RANK];
    5207. 

  5207.     size_t count[MAX_RANK];
    5208. 

  5208.     size_t sstride[MAX_RANK];
    5209. 

  5209.     ptrdiff_t stride[MAX_RANK];
    5210. 

  5210.     ptrdiff_t imap[MAX_RANK];
    5211. 

  5211.     int canConvert;     /* Both text or both numeric */
    5212. 

  5212.     float value[MAX_NELS];
    5213. 

  5213.     double expect[MAX_NELS];
    5214. 

  5214. 

  5215.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    5216. 

  5216.     IF (err)
    5217. 

  5217.         error("nc_open: %s", nc_strerror(err));
    5218. 

  5218.     for (i = 0; i < NVARS; i++) {
    5219. 

  5219.         canConvert = (var_type[i] == NC_CHAR) == (NCT_FLOAT == NCT_TEXT);
    5220. 

  5220.         assert(var_rank[i] <= MAX_RANK);
    5221. 

  5221.         assert(var_nels[i] <= MAX_NELS);
    5222. 

  5222.         for (j = 0; j < var_rank[i]; j++) {
    5223. 

  5223.             start[j] = 0;
    5224. 

  5224.             edge[j] = 1;
    5225. 

  5225.             stride[j] = 1;
    5226. 

  5226.             imap[j] = 1;
    5227. 

  5227.         }
    5228. 

  5228.         err = nc_get_varm_float(BAD_ID, i, start, edge, stride, imap, value);
    5229. 

  5229.         IF (err != NC_EBADID)
    5230. 

  5230.             error("bad ncid: status = %d", err);
    5231. 

  5231.         err = nc_get_varm_float(ncid, BAD_VARID, start, edge, stride, imap, value);
    5232. 

  5232.         IF (err != NC_ENOTVAR)
    5233. 

  5233.             error("bad var id: status = %d", err);
    5234. 

  5234.         for (j = 0; j < var_rank[i]; j++) {
    5235. 

  5235.             start[j] = var_shape[i][j];
    5236. 

  5236.             err = nc_get_varm_float(ncid, i, start, edge, stride, imap, value);
    5237. 

  5237. 	  if(!canConvert) {
    5238. 

  5238. 		IF (err != NC_ECHAR)
    5239. 

  5239.                	    error("conversion: status = %d", err);
    5240. 

  5240. 	  } else {
    5241. 

  5241. 	    IF (err != NC_EINVALCOORDS)
    5242. 

  5242.                 error("bad index: status = %d", err);
    5243. 

  5243.             start[j] = 0;
    5244. 

  5244.             edge[j] = var_shape[i][j] + 1;
    5245. 

  5245.             err = nc_get_varm_float(ncid, i, start, edge, stride, imap, value);
    5246. 

  5246.             IF (err != NC_EEDGE)
    5247. 

  5247.                 error("bad edge: status = %d", err);
    5248. 

  5248.             edge[j] = 1;
    5249. 

  5249.             stride[j] = 0;
    5250. 

  5250.             err = nc_get_varm_float(ncid, i, start, edge, stride, imap, value);
    5251. 

  5251.             IF (err != NC_ESTRIDE)
    5252. 

  5252.                 error("bad stride: status = %d", err);
    5253. 

  5253.             stride[j] = 1;
    5254. 

  5254.            }
    5255. 

  5255.         }
    5256. 

  5256.             /* Choose a random point dividing each dim into 2 parts */
    5257. 

  5257.             /* get 2^rank (nslabs) slabs so defined */
    5258. 

  5258.         nslabs = 1;
    5259. 

  5259.         for (j = 0; j < var_rank[i]; j++) {
    5260. 

  5260.             mid[j] = roll( var_shape[i][j] );
    5261. 

  5261.             nslabs *= 2;
    5262. 

  5262.         }
    5263. 

  5263.             /* bits of k determine whether to get lower or upper part of dim */
    5264. 

  5264.             /* choose random stride from 1 to edge */
    5265. 

  5265.         for (k = 0; k < nslabs; k++) {
    5266. 

  5266.             nstarts = 1;
    5267. 

  5267.             for (j = 0; j < var_rank[i]; j++) {
    5268. 

  5268.                 if ((k >> j) & 1) {
    5269. 

  5269.                     start[j] = 0;
    5270. 

  5270.                     edge[j] = mid[j];
    5271. 

  5271.                 }else{
    5272. 

  5272.                     start[j] = mid[j];
    5273. 

  5273.                     edge[j] = var_shape[i][j] - mid[j];
    5274. 

  5274.                 }
    5275. 

  5275.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    5276. 

  5276.                 nstarts *= stride[j];
    5277. 

  5277.             }
    5278. 

  5278.             for (m = 0; m < nstarts; m++) {
    5279. 

  5279.                 err = toMixedBase(m, var_rank[i], sstride, index);
    5280. 

  5280.                 IF (err)
    5281. 

  5281.                     error("error in toMixedBase");
    5282. 

  5282.                 nels = 1;
    5283. 

  5283.                 for (j = 0; j < var_rank[i]; j++) {
    5284. 

  5284.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    5285. 

  5285.                     nels *= count[j];
    5286. 

  5286.                     index[j] += start[j];
    5287. 

  5287.                 }
    5288. 

  5288. 		    /* Random choice of forward or backward */
    5289. 

  5289. /* TODO
    5290. 

  5290. 		if ( roll(2) ) {
    5291. 

  5291. 		    for (j = 0; j < var_rank[i]; j++) {
    5292. 

  5292. 			index[j] += (count[j] - 1) * stride[j];
    5293. 

  5293. 			stride[j] = -stride[j];
    5294. 

  5294. 		    }
    5295. 

  5295. 		}
    5296. 

  5296.  */
    5297. 

  5297. 		if (var_rank[i] > 0) {
    5298. 

  5298. 		    j = var_rank[i] - 1;
    5299. 

  5299. 		    imap[j] = 1;
    5300. 

  5300. 		    for (; j > 0; j--)
    5301. 

  5301. 			imap[j-1] = imap[j] * count[j];
    5302. 

  5302. 		}
    5303. 

  5303.                 allInExtRange = allInIntRange = 1;
    5304. 

  5304.                 for (j = 0; j < nels; j++) {
    5305. 

  5305.                     err = toMixedBase(j, var_rank[i], count, index2);
    5306. 

  5306.                     IF (err)
    5307. 

  5307.                         error("error in toMixedBase 1");
    5308. 

  5308.                     for (d = 0; d < var_rank[i]; d++)
    5309. 

  5309.                         index2[d] = index[d] + index2[d] * stride[d];
    5310. 

  5310.                     expect[j] = hash4(var_type[i], var_rank[i], index2,
    5311. 

  5311.                         NCT_FLOAT);
    5312. 

  5312.                     if (inRange3(expect[j],var_type[i],NCT_FLOAT)) {
    5313. 

  5313.                         allInIntRange = allInIntRange && expect[j] >= float_min
    5314. 

  5314.                             && expect[j] <= float_max;
    5315. 

  5315.                     } else {
    5316. 

  5316.                         allInExtRange = 0;
    5317. 

  5317.                     }
    5318. 

  5318.                 }
    5319. 

  5319.                 if (var_rank[i] == 0 && i%2 )
    5320. 

  5320.                     err = nc_get_varm_float(ncid,i,NULL,NULL,NULL,NULL,value);
    5321. 

  5321.                 else
    5322. 

  5322.                     err = nc_get_varm_float(ncid,i,index,count,stride,imap,value);
    5323. 

  5323.                 if (canConvert) {
    5324. 

  5324.                     if (allInExtRange) {
    5325. 

  5325.                         if (allInIntRange) {
    5326. 

  5326.                             IF (err)
    5327. 

  5327.                                 error("%s", nc_strerror(err));
    5328. 

  5328.                         } else {
    5329. 

  5329.                             IF (err != NC_ERANGE)
    5330. 

  5330.                                 error("Range error: status = %d", err);
    5331. 

  5331.                         }
    5332. 

  5332.                     } else {
    5333. 

  5333.                         IF (err != 0 && err != NC_ERANGE)
    5334. 

  5334.                             error("OK or Range error: status = %d", err);
    5335. 

  5335.                     }
    5336. 

  5336.                     for (j = 0; j < nels; j++) {
    5337. 

  5337.                         if (inRange3(expect[j],var_type[i],NCT_FLOAT)
    5338. 

  5338.                                 && expect[j] >= float_min 
    5339. 

  5339. 				&& expect[j] <= float_max) {
    5340. 

  5340. 			    IF (!equal(value[j],expect[j],var_type[i],
    5341. 

  5341. 				    NCT_FLOAT)){
    5342. 

  5342.                                 error("value read not that expected");
    5343. 

  5343.                                 if (verbose) {
    5344. 

  5344.                                     error("\n");
    5345. 

  5345.                                     error("varid: %d, ", i);
    5346. 

  5346.                                     error("var_name: %s, ", var_name[i]);
    5347. 

  5347.                                     error("element number: %d ", j);
    5348. 

  5348.                                     error("expect: %g, ", expect[j]);
    5349. 

  5349.                                     error("got: %g", (double) value[j]);
    5350. 

  5350.                                 }
    5351. 

  5351.                             } else {
    5352. 

  5352.                                 nok++;
    5353. 

  5353.                             }
    5354. 

  5354.                         }
    5355. 

  5355.                     }
    5356. 

  5356.                 } else {
    5357. 

  5357.                     IF (nels > 0 && err != NC_ECHAR)
    5358. 

  5358.                         error("wrong type: status = %d", err);
    5359. 

  5359.                 }
    5360. 

  5360.             }
    5361. 

  5361.         }
    5362. 

  5362.     }
    5363. 

  5363.     err = nc_close(ncid);
    5364. 

  5364.     IF (err)
    5365. 

  5365.         error("nc_close: %s", nc_strerror(err));
    5366. 

  5366.     print_nok(nok);
    5367. 

  5367. }
    5368. 

  5368. 

  5369. void
    5370. 

  5370. test_nc_get_varm_double(void)
    5371. 

  5371. {
    5372. 

  5372.     int ncid;
    5373. 

  5373.     int d;
    5374. 

  5374.     int i;
    5375. 

  5375.     int j;
    5376. 

  5376.     int k;
    5377. 

  5377.     int m;
    5378. 

  5378.     int err;
    5379. 

  5379.     int allInExtRange;	/* all values within external range? */
    5380. 

  5380.     int allInIntRange;	/* all values within internal range? */
    5381. 

  5381.     int nels;
    5382. 

  5382.     int nslabs;
    5383. 

  5383.     int nstarts;        /* number of different starts */
    5384. 

  5384.     int nok = 0;      /* count of valid comparisons */
    5385. 

  5385.     size_t start[MAX_RANK];
    5386. 

  5386.     size_t edge[MAX_RANK];
    5387. 

  5387.     size_t index[MAX_RANK];
    5388. 

  5388.     size_t index2[MAX_RANK];
    5389. 

  5389.     size_t mid[MAX_RANK];
    5390. 

  5390.     size_t count[MAX_RANK];
    5391. 

  5391.     size_t sstride[MAX_RANK];
    5392. 

  5392.     ptrdiff_t stride[MAX_RANK];
    5393. 

  5393.     ptrdiff_t imap[MAX_RANK];
    5394. 

  5394.     int canConvert;     /* Both text or both numeric */
    5395. 

  5395.     double value[MAX_NELS];
    5396. 

  5396.     double expect[MAX_NELS];
    5397. 

  5397. 

  5398.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    5399. 

  5399.     IF (err)
    5400. 

  5400.         error("nc_open: %s", nc_strerror(err));
    5401. 

  5401.     for (i = 0; i < NVARS; i++) {
    5402. 

  5402.         canConvert = (var_type[i] == NC_CHAR) == (NCT_DOUBLE == NCT_TEXT);
    5403. 

  5403.         assert(var_rank[i] <= MAX_RANK);
    5404. 

  5404.         assert(var_nels[i] <= MAX_NELS);
    5405. 

  5405.         for (j = 0; j < var_rank[i]; j++) {
    5406. 

  5406.             start[j] = 0;
    5407. 

  5407.             edge[j] = 1;
    5408. 

  5408.             stride[j] = 1;
    5409. 

  5409.             imap[j] = 1;
    5410. 

  5410.         }
    5411. 

  5411.         err = nc_get_varm_double(BAD_ID, i, start, edge, stride, imap, value);
    5412. 

  5412.         IF (err != NC_EBADID)
    5413. 

  5413.             error("bad ncid: status = %d", err);
    5414. 

  5414.         err = nc_get_varm_double(ncid, BAD_VARID, start, edge, stride, imap, value);
    5415. 

  5415.         IF (err != NC_ENOTVAR)
    5416. 

  5416.             error("bad var id: status = %d", err);
    5417. 

  5417.         for (j = 0; j < var_rank[i]; j++) {
    5418. 

  5418.             start[j] = var_shape[i][j];
    5419. 

  5419.             err = nc_get_varm_double(ncid, i, start, edge, stride, imap, value);
    5420. 

  5420. 	  if(!canConvert) {
    5421. 

  5421. 		IF (err != NC_ECHAR)
    5422. 

  5422.                	    error("conversion: status = %d", err);
    5423. 

  5423. 	  } else {
    5424. 

  5424. 	    IF (err != NC_EINVALCOORDS)
    5425. 

  5425.                 error("bad index: status = %d", err);
    5426. 

  5426.             start[j] = 0;
    5427. 

  5427.             edge[j] = var_shape[i][j] + 1;
    5428. 

  5428.             err = nc_get_varm_double(ncid, i, start, edge, stride, imap, value);
    5429. 

  5429.             IF (err != NC_EEDGE)
    5430. 

  5430.                 error("bad edge: status = %d", err);
    5431. 

  5431.             edge[j] = 1;
    5432. 

  5432.             stride[j] = 0;
    5433. 

  5433.             err = nc_get_varm_double(ncid, i, start, edge, stride, imap, value);
    5434. 

  5434.             IF (err != NC_ESTRIDE)
    5435. 

  5435.                 error("bad stride: status = %d", err);
    5436. 

  5436.             stride[j] = 1;
    5437. 

  5437.            }
    5438. 

  5438.         }
    5439. 

  5439.             /* Choose a random point dividing each dim into 2 parts */
    5440. 

  5440.             /* get 2^rank (nslabs) slabs so defined */
    5441. 

  5441.         nslabs = 1;
    5442. 

  5442.         for (j = 0; j < var_rank[i]; j++) {
    5443. 

  5443.             mid[j] = roll( var_shape[i][j] );
    5444. 

  5444.             nslabs *= 2;
    5445. 

  5445.         }
    5446. 

  5446.             /* bits of k determine whether to get lower or upper part of dim */
    5447. 

  5447.             /* choose random stride from 1 to edge */
    5448. 

  5448.         for (k = 0; k < nslabs; k++) {
    5449. 

  5449.             nstarts = 1;
    5450. 

  5450.             for (j = 0; j < var_rank[i]; j++) {
    5451. 

  5451.                 if ((k >> j) & 1) {
    5452. 

  5452.                     start[j] = 0;
    5453. 

  5453.                     edge[j] = mid[j];
    5454. 

  5454.                 }else{
    5455. 

  5455.                     start[j] = mid[j];
    5456. 

  5456.                     edge[j] = var_shape[i][j] - mid[j];
    5457. 

  5457.                 }
    5458. 

  5458.                 sstride[j] = stride[j] = edge[j] > 0 ? 1+roll(edge[j]) : 1;
    5459. 

  5459.                 nstarts *= stride[j];
    5460. 

  5460.             }
    5461. 

  5461.             for (m = 0; m < nstarts; m++) {
    5462. 

  5462.                 err = toMixedBase(m, var_rank[i], sstride, index);
    5463. 

  5463.                 IF (err)
    5464. 

  5464.                     error("error in toMixedBase");
    5465. 

  5465.                 nels = 1;
    5466. 

  5466.                 for (j = 0; j < var_rank[i]; j++) {
    5467. 

  5467.                     count[j] = 1 + (edge[j] - index[j] - 1) / stride[j];
    5468. 

  5468.                     nels *= count[j];
    5469. 

  5469.                     index[j] += start[j];
    5470. 

  5470.                 }
    5471. 

  5471. 		    /* Random choice of forward or backward */
    5472. 

  5472. /* TODO
    5473. 

  5473. 		if ( roll(2) ) {
    5474. 

  5474. 		    for (j = 0; j < var_rank[i]; j++) {
    5475. 

  5475. 			index[j] += (count[j] - 1) * stride[j];
    5476. 

  5476. 			stride[j] = -stride[j];
    5477. 

  5477. 		    }
    5478. 

  5478. 		}
    5479. 

  5479.  */
    5480. 

  5480. 		if (var_rank[i] > 0) {
    5481. 

  5481. 		    j = var_rank[i] - 1;
    5482. 

  5482. 		    imap[j] = 1;
    5483. 

  5483. 		    for (; j > 0; j--)
    5484. 

  5484. 			imap[j-1] = imap[j] * count[j];
    5485. 

  5485. 		}
    5486. 

  5486.                 allInExtRange = allInIntRange = 1;
    5487. 

  5487.                 for (j = 0; j < nels; j++) {
    5488. 

  5488.                     err = toMixedBase(j, var_rank[i], count, index2);
    5489. 

  5489.                     IF (err)
    5490. 

  5490.                         error("error in toMixedBase 1");
    5491. 

  5491.                     for (d = 0; d < var_rank[i]; d++)
    5492. 

  5492.                         index2[d] = index[d] + index2[d] * stride[d];
    5493. 

  5493.                     expect[j] = hash4(var_type[i], var_rank[i], index2,
    5494. 

  5494.                         NCT_DOUBLE);
    5495. 

  5495.                     if (inRange3(expect[j],var_type[i],NCT_DOUBLE)) {
    5496. 

  5496.                         allInIntRange = allInIntRange && expect[j] >= double_min
    5497. 

  5497.                             && expect[j] <= double_max;
    5498. 

  5498.                     } else {
    5499. 

  5499.                         allInExtRange = 0;
    5500. 

  5500.                     }
    5501. 

  5501.                 }
    5502. 

  5502.                 if (var_rank[i] == 0 && i%2 )
    5503. 

  5503.                     err = nc_get_varm_double(ncid,i,NULL,NULL,NULL,NULL,value);
    5504. 

  5504.                 else
    5505. 

  5505.                     err = nc_get_varm_double(ncid,i,index,count,stride,imap,value);
    5506. 

  5506.                 if (canConvert) {
    5507. 

  5507.                     if (allInExtRange) {
    5508. 

  5508.                         if (allInIntRange) {
    5509. 

  5509.                             IF (err)
    5510. 

  5510.                                 error("%s", nc_strerror(err));
    5511. 

  5511.                         } else {
    5512. 

  5512.                             IF (err != NC_ERANGE)
    5513. 

  5513.                                 error("Range error: status = %d", err);
    5514. 

  5514.                         }
    5515. 

  5515.                     } else {
    5516. 

  5516.                         IF (err != 0 && err != NC_ERANGE)
    5517. 

  5517.                             error("OK or Range error: status = %d", err);
    5518. 

  5518.                     }
    5519. 

  5519.                     for (j = 0; j < nels; j++) {
    5520. 

  5520.                         if (inRange3(expect[j],var_type[i],NCT_DOUBLE)
    5521. 

  5521.                                 && expect[j] >= double_min 
    5522. 

  5522. 				&& expect[j] <= double_max) {
    5523. 

  5523. 			    IF (!equal(value[j],expect[j],var_type[i],
    5524. 

  5524. 				    NCT_DOUBLE)){
    5525. 

  5525.                                 error("value read not that expected");
    5526. 

  5526.                                 if (verbose) {
    5527. 

  5527.                                     error("\n");
    5528. 

  5528.                                     error("varid: %d, ", i);
    5529. 

  5529.                                     error("var_name: %s, ", var_name[i]);
    5530. 

  5530.                                     error("element number: %d ", j);
    5531. 

  5531.                                     error("expect: %g, ", expect[j]);
    5532. 

  5532.                                     error("got: %g", (double) value[j]);
    5533. 

  5533.                                 }
    5534. 

  5534.                             } else {
    5535. 

  5535.                                 nok++;
    5536. 

  5536.                             }
    5537. 

  5537.                         }
    5538. 

  5538.                     }
    5539. 

  5539.                 } else {
    5540. 

  5540.                     IF (nels > 0 && err != NC_ECHAR)
    5541. 

  5541.                         error("wrong type: status = %d", err);
    5542. 

  5542.                 }
    5543. 

  5543.             }
    5544. 

  5544.         }
    5545. 

  5545.     }
    5546. 

  5546.     err = nc_close(ncid);
    5547. 

  5547.     IF (err)
    5548. 

  5548.         error("nc_close: %s", nc_strerror(err));
    5549. 

  5549.     print_nok(nok);
    5550. 

  5550. }
    5551. 

  5551. 

  5552. 

  5553. 

  5554. 

  5555. void
    5556. 

  5556. test_nc_get_att_text(void)
    5557. 

  5557. {
    5558. 

  5558.     int ncid;
    5559. 

  5559.     int i;
    5560. 

  5560.     int j;
    5561. 

  5561.     size_t k;
    5562. 

  5562.     int err;
    5563. 

  5563.     int allInExtRange;
    5564. 

  5564.     int allInIntRange;
    5565. 

  5565.     int canConvert;     /* Both text or both numeric */
    5566. 

  5566.     text value[MAX_NELS];
    5567. 

  5567.     double expect[MAX_NELS];
    5568. 

  5568.     int nok = 0;      /* count of valid comparisons */
    5569. 

  5569. 

  5570.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    5571. 

  5571.     IF (err) 
    5572. 

  5572. 	error("nc_open: %s", nc_strerror(err));
    5573. 

  5573. 

  5574.     for (i = -1; i < NVARS; i++) {
    5575. 

  5575.         for (j = 0; j < NATTS(i); j++) {
    5576. 

  5576. 	    canConvert = (ATT_TYPE(i,j) == NC_CHAR) == (NCT_TEXT == NCT_TEXT);
    5577. 

  5577. 	    err = nc_get_att_text(BAD_ID, i, ATT_NAME(i,j), value);
    5578. 

  5578. 	    IF (err != NC_EBADID) 
    5579. 

  5579. 		error("bad ncid: status = %d", err);
    5580. 

  5580. 	    err = nc_get_att_text(ncid, BAD_VARID, ATT_NAME(i,j), value);
    5581. 

  5581. 	    IF (err != NC_ENOTVAR) 
    5582. 

  5582. 		error("bad var id: status = %d", err);
    5583. 

  5583. 	    err = nc_get_att_text(ncid, i, "noSuch", value);
    5584. 

  5584. 	    IF (err != NC_ENOTATT) 
    5585. 

  5585. 		error("Bad attribute name: status = %d", err);
    5586. 

  5586. 	    allInExtRange = allInIntRange = 1;
    5587. 

  5587.             for (k = 0; k < ATT_LEN(i,j); k++) {
    5588. 

  5588. 		expect[k] = hash4(ATT_TYPE(i,j), -1, &k, NCT_TEXT);
    5589. 

  5589.                 if (inRange3(expect[k],ATT_TYPE(i,j),NCT_TEXT)) {
    5590. 

  5590.                     allInIntRange = allInIntRange && expect[k] >= text_min
    5591. 

  5591.                                 && expect[k] <= text_max;
    5592. 

  5592.                 } else {
    5593. 

  5593.                     allInExtRange = 0;
    5594. 

  5594.                 }
    5595. 

  5595. 	    }
    5596. 

  5596. 	    err = nc_get_att_text(ncid, i, ATT_NAME(i,j), value);
    5597. 

  5597.             if (canConvert || ATT_LEN(i,j) == 0) {
    5598. 

  5598.                 if (allInExtRange) {
    5599. 

  5599.                     if (allInIntRange) {
    5600. 

  5600.                         IF (err)
    5601. 

  5601.                             error("%s", nc_strerror(err));
    5602. 

  5602.                     } else {
    5603. 

  5603.                         IF (err != NC_ERANGE)
    5604. 

  5604.                             error("Range error: status = %d", err);
    5605. 

  5605.                     }
    5606. 

  5606.                 } else {
    5607. 

  5607.                     IF (err != 0 && err != NC_ERANGE)
    5608. 

  5608.                         error("OK or Range error: status = %d", err);
    5609. 

  5609.                 }
    5610. 

  5610. 		for (k = 0; k < ATT_LEN(i,j); k++) {
    5611. 

  5611. 		    if (inRange3(expect[k],ATT_TYPE(i,j),NCT_TEXT)
    5612. 

  5612.                             && expect[k] >= text_min && expect[k] <= text_max) {
    5613. 

  5613. 			IF (!equal(value[k],expect[k],ATT_TYPE(i,j),
    5614. 

  5614. 				NCT_TEXT)){
    5615. 

  5615. 			    error("value read not that expected");
    5616. 

  5616.                             if (verbose) {
    5617. 

  5617.                                 error("\n");
    5618. 

  5618.                                 error("varid: %d, ", i);
    5619. 

  5619.                                 error("att_name: %s, ", ATT_NAME(i,j));
    5620. 

  5620.                                 error("element number: %d ", k);
    5621. 

  5621.                                 error("expect: %g", expect[k]);
    5622. 

  5622.                                 error("got: %g", (double) value[k]);
    5623. 

  5623.                             }
    5624. 

  5624. 			} else {
    5625. 

  5625. 			    nok++;
    5626. 

  5626.                         }
    5627. 

  5627. 		    }
    5628. 

  5628. 		}
    5629. 

  5629. 	    } else {
    5630. 

  5630. 		IF (err != NC_ECHAR)
    5631. 

  5631. 		    error("wrong type: status = %d", err);
    5632. 

  5632. 	    }
    5633. 

  5633. 	}
    5634. 

  5634.     }
    5635. 

  5635. 

  5636.     err = nc_close(ncid);
    5637. 

  5637.     IF (err)
    5638. 

  5638. 	error("nc_close: %s", nc_strerror(err));
    5639. 

  5639.     print_nok(nok);
    5640. 

  5640. }
    5641. 

  5641. 

  5642. void
    5643. 

  5643. test_nc_get_att_uchar(void)
    5644. 

  5644. {
    5645. 

  5645.     int ncid;
    5646. 

  5646.     int i;
    5647. 

  5647.     int j;
    5648. 

  5648.     size_t k;
    5649. 

  5649.     int err;
    5650. 

  5650.     int allInExtRange;
    5651. 

  5651.     int allInIntRange;
    5652. 

  5652.     int canConvert;     /* Both text or both numeric */
    5653. 

  5653.     uchar value[MAX_NELS];
    5654. 

  5654.     double expect[MAX_NELS];
    5655. 

  5655.     int nok = 0;      /* count of valid comparisons */
    5656. 

  5656. 

  5657.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    5658. 

  5658.     IF (err) 
    5659. 

  5659. 	error("nc_open: %s", nc_strerror(err));
    5660. 

  5660. 

  5661.     for (i = -1; i < NVARS; i++) {
    5662. 

  5662.         for (j = 0; j < NATTS(i); j++) {
    5663. 

  5663. 	    canConvert = (ATT_TYPE(i,j) == NC_CHAR) == (NCT_UCHAR == NCT_TEXT);
    5664. 

  5664. 	    err = nc_get_att_uchar(BAD_ID, i, ATT_NAME(i,j), value);
    5665. 

  5665. 	    IF (err != NC_EBADID) 
    5666. 

  5666. 		error("bad ncid: status = %d", err);
    5667. 

  5667. 	    err = nc_get_att_uchar(ncid, BAD_VARID, ATT_NAME(i,j), value);
    5668. 

  5668. 	    IF (err != NC_ENOTVAR) 
    5669. 

  5669. 		error("bad var id: status = %d", err);
    5670. 

  5670. 	    err = nc_get_att_uchar(ncid, i, "noSuch", value);
    5671. 

  5671. 	    IF (err != NC_ENOTATT) 
    5672. 

  5672. 		error("Bad attribute name: status = %d", err);
    5673. 

  5673. 	    allInExtRange = allInIntRange = 1;
    5674. 

  5674.             for (k = 0; k < ATT_LEN(i,j); k++) {
    5675. 

  5675. 		expect[k] = hash4(ATT_TYPE(i,j), -1, &k, NCT_UCHAR);
    5676. 

  5676.                 if (inRange3(expect[k],ATT_TYPE(i,j),NCT_UCHAR)) {
    5677. 

  5677.                     allInIntRange = allInIntRange && expect[k] >= uchar_min
    5678. 

  5678.                                 && expect[k] <= uchar_max;
    5679. 

  5679.                 } else {
    5680. 

  5680.                     allInExtRange = 0;
    5681. 

  5681.                 }
    5682. 

  5682. 	    }
    5683. 

  5683. 	    err = nc_get_att_uchar(ncid, i, ATT_NAME(i,j), value);
    5684. 

  5684.             if (canConvert || ATT_LEN(i,j) == 0) {
    5685. 

  5685.                 if (allInExtRange) {
    5686. 

  5686.                     if (allInIntRange) {
    5687. 

  5687.                         IF (err)
    5688. 

  5688.                             error("%s", nc_strerror(err));
    5689. 

  5689.                     } else {
    5690. 

  5690.                         IF (err != NC_ERANGE)
    5691. 

  5691.                             error("Range error: status = %d", err);
    5692. 

  5692.                     }
    5693. 

  5693.                 } else {
    5694. 

  5694.                     IF (err != 0 && err != NC_ERANGE)
    5695. 

  5695.                         error("OK or Range error: status = %d", err);
    5696. 

  5696.                 }
    5697. 

  5697. 		for (k = 0; k < ATT_LEN(i,j); k++) {
    5698. 

  5698. 		    if (inRange3(expect[k],ATT_TYPE(i,j),NCT_UCHAR)
    5699. 

  5699.                             && expect[k] >= uchar_min && expect[k] <= uchar_max) {
    5700. 

  5700. 			IF (!equal(value[k],expect[k],ATT_TYPE(i,j),
    5701. 

  5701. 				NCT_UCHAR)){
    5702. 

  5702. 			    error("value read not that expected");
    5703. 

  5703.                             if (verbose) {
    5704. 

  5704.                                 error("\n");
    5705. 

  5705.                                 error("varid: %d, ", i);
    5706. 

  5706.                                 error("att_name: %s, ", ATT_NAME(i,j));
    5707. 

  5707.                                 error("element number: %d ", k);
    5708. 

  5708.                                 error("expect: %g", expect[k]);
    5709. 

  5709.                                 error("got: %g", (double) value[k]);
    5710. 

  5710.                             }
    5711. 

  5711. 			} else {
    5712. 

  5712. 			    nok++;
    5713. 

  5713.                         }
    5714. 

  5714. 		    }
    5715. 

  5715. 		}
    5716. 

  5716. 	    } else {
    5717. 

  5717. 		IF (err != NC_ECHAR)
    5718. 

  5718. 		    error("wrong type: status = %d", err);
    5719. 

  5719. 	    }
    5720. 

  5720. 	}
    5721. 

  5721.     }
    5722. 

  5722. 

  5723.     err = nc_close(ncid);
    5724. 

  5724.     IF (err)
    5725. 

  5725. 	error("nc_close: %s", nc_strerror(err));
    5726. 

  5726.     print_nok(nok);
    5727. 

  5727. }
    5728. 

  5728. 

  5729. void
    5730. 

  5730. test_nc_get_att_schar(void)
    5731. 

  5731. {
    5732. 

  5732.     int ncid;
    5733. 

  5733.     int i;
    5734. 

  5734.     int j;
    5735. 

  5735.     size_t k;
    5736. 

  5736.     int err;
    5737. 

  5737.     int allInExtRange;
    5738. 

  5738.     int allInIntRange;
    5739. 

  5739.     int canConvert;     /* Both text or both numeric */
    5740. 

  5740.     schar value[MAX_NELS];
    5741. 

  5741.     double expect[MAX_NELS];
    5742. 

  5742.     int nok = 0;      /* count of valid comparisons */
    5743. 

  5743. 

  5744.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    5745. 

  5745.     IF (err) 
    5746. 

  5746. 	error("nc_open: %s", nc_strerror(err));
    5747. 

  5747. 

  5748.     for (i = -1; i < NVARS; i++) {
    5749. 

  5749.         for (j = 0; j < NATTS(i); j++) {
    5750. 

  5750. 	    canConvert = (ATT_TYPE(i,j) == NC_CHAR) == (NCT_SCHAR == NCT_TEXT);
    5751. 

  5751. 	    err = nc_get_att_schar(BAD_ID, i, ATT_NAME(i,j), value);
    5752. 

  5752. 	    IF (err != NC_EBADID) 
    5753. 

  5753. 		error("bad ncid: status = %d", err);
    5754. 

  5754. 	    err = nc_get_att_schar(ncid, BAD_VARID, ATT_NAME(i,j), value);
    5755. 

  5755. 	    IF (err != NC_ENOTVAR) 
    5756. 

  5756. 		error("bad var id: status = %d", err);
    5757. 

  5757. 	    err = nc_get_att_schar(ncid, i, "noSuch", value);
    5758. 

  5758. 	    IF (err != NC_ENOTATT) 
    5759. 

  5759. 		error("Bad attribute name: status = %d", err);
    5760. 

  5760. 	    allInExtRange = allInIntRange = 1;
    5761. 

  5761.             for (k = 0; k < ATT_LEN(i,j); k++) {
    5762. 

  5762. 		expect[k] = hash4(ATT_TYPE(i,j), -1, &k, NCT_SCHAR);
    5763. 

  5763.                 if (inRange3(expect[k],ATT_TYPE(i,j),NCT_SCHAR)) {
    5764. 

  5764.                     allInIntRange = allInIntRange && expect[k] >= schar_min
    5765. 

  5765.                                 && expect[k] <= schar_max;
    5766. 

  5766.                 } else {
    5767. 

  5767.                     allInExtRange = 0;
    5768. 

  5768.                 }
    5769. 

  5769. 	    }
    5770. 

  5770. 	    err = nc_get_att_schar(ncid, i, ATT_NAME(i,j), value);
    5771. 

  5771.             if (canConvert || ATT_LEN(i,j) == 0) {
    5772. 

  5772.                 if (allInExtRange) {
    5773. 

  5773.                     if (allInIntRange) {
    5774. 

  5774.                         IF (err)
    5775. 

  5775.                             error("%s", nc_strerror(err));
    5776. 

  5776.                     } else {
    5777. 

  5777.                         IF (err != NC_ERANGE)
    5778. 

  5778.                             error("Range error: status = %d", err);
    5779. 

  5779.                     }
    5780. 

  5780.                 } else {
    5781. 

  5781.                     IF (err != 0 && err != NC_ERANGE)
    5782. 

  5782.                         error("OK or Range error: status = %d", err);
    5783. 

  5783.                 }
    5784. 

  5784. 		for (k = 0; k < ATT_LEN(i,j); k++) {
    5785. 

  5785. 		    if (inRange3(expect[k],ATT_TYPE(i,j),NCT_SCHAR)
    5786. 

  5786.                             && expect[k] >= schar_min && expect[k] <= schar_max) {
    5787. 

  5787. 			IF (!equal(value[k],expect[k],ATT_TYPE(i,j),
    5788. 

  5788. 				NCT_SCHAR)){
    5789. 

  5789. 			    error("value read not that expected");
    5790. 

  5790.                             if (verbose) {
    5791. 

  5791.                                 error("\n");
    5792. 

  5792.                                 error("varid: %d, ", i);
    5793. 

  5793.                                 error("att_name: %s, ", ATT_NAME(i,j));
    5794. 

  5794.                                 error("element number: %d ", k);
    5795. 

  5795.                                 error("expect: %g", expect[k]);
    5796. 

  5796.                                 error("got: %g", (double) value[k]);
    5797. 

  5797.                             }
    5798. 

  5798. 			} else {
    5799. 

  5799. 			    nok++;
    5800. 

  5800.                         }
    5801. 

  5801. 		    }
    5802. 

  5802. 		}
    5803. 

  5803. 	    } else {
    5804. 

  5804. 		IF (err != NC_ECHAR)
    5805. 

  5805. 		    error("wrong type: status = %d", err);
    5806. 

  5806. 	    }
    5807. 

  5807. 	}
    5808. 

  5808.     }
    5809. 

  5809. 

  5810.     err = nc_close(ncid);
    5811. 

  5811.     IF (err)
    5812. 

  5812. 	error("nc_close: %s", nc_strerror(err));
    5813. 

  5813.     print_nok(nok);
    5814. 

  5814. }
    5815. 

  5815. 

  5816. void
    5817. 

  5817. test_nc_get_att_short(void)
    5818. 

  5818. {
    5819. 

  5819.     int ncid;
    5820. 

  5820.     int i;
    5821. 

  5821.     int j;
    5822. 

  5822.     size_t k;
    5823. 

  5823.     int err;
    5824. 

  5824.     int allInExtRange;
    5825. 

  5825.     int allInIntRange;
    5826. 

  5826.     int canConvert;     /* Both text or both numeric */
    5827. 

  5827.     short value[MAX_NELS];
    5828. 

  5828.     double expect[MAX_NELS];
    5829. 

  5829.     int nok = 0;      /* count of valid comparisons */
    5830. 

  5830. 

  5831.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    5832. 

  5832.     IF (err) 
    5833. 

  5833. 	error("nc_open: %s", nc_strerror(err));
    5834. 

  5834. 

  5835.     for (i = -1; i < NVARS; i++) {
    5836. 

  5836.         for (j = 0; j < NATTS(i); j++) {
    5837. 

  5837. 	    canConvert = (ATT_TYPE(i,j) == NC_CHAR) == (NCT_SHORT == NCT_TEXT);
    5838. 

  5838. 	    err = nc_get_att_short(BAD_ID, i, ATT_NAME(i,j), value);
    5839. 

  5839. 	    IF (err != NC_EBADID) 
    5840. 

  5840. 		error("bad ncid: status = %d", err);
    5841. 

  5841. 	    err = nc_get_att_short(ncid, BAD_VARID, ATT_NAME(i,j), value);
    5842. 

  5842. 	    IF (err != NC_ENOTVAR) 
    5843. 

  5843. 		error("bad var id: status = %d", err);
    5844. 

  5844. 	    err = nc_get_att_short(ncid, i, "noSuch", value);
    5845. 

  5845. 	    IF (err != NC_ENOTATT) 
    5846. 

  5846. 		error("Bad attribute name: status = %d", err);
    5847. 

  5847. 	    allInExtRange = allInIntRange = 1;
    5848. 

  5848.             for (k = 0; k < ATT_LEN(i,j); k++) {
    5849. 

  5849. 		expect[k] = hash4(ATT_TYPE(i,j), -1, &k, NCT_SHORT);
    5850. 

  5850.                 if (inRange3(expect[k],ATT_TYPE(i,j),NCT_SHORT)) {
    5851. 

  5851.                     allInIntRange = allInIntRange && expect[k] >= short_min
    5852. 

  5852.                                 && expect[k] <= short_max;
    5853. 

  5853.                 } else {
    5854. 

  5854.                     allInExtRange = 0;
    5855. 

  5855.                 }
    5856. 

  5856. 	    }
    5857. 

  5857. 	    err = nc_get_att_short(ncid, i, ATT_NAME(i,j), value);
    5858. 

  5858.             if (canConvert || ATT_LEN(i,j) == 0) {
    5859. 

  5859.                 if (allInExtRange) {
    5860. 

  5860.                     if (allInIntRange) {
    5861. 

  5861.                         IF (err)
    5862. 

  5862.                             error("%s", nc_strerror(err));
    5863. 

  5863.                     } else {
    5864. 

  5864.                         IF (err != NC_ERANGE)
    5865. 

  5865.                             error("Range error: status = %d", err);
    5866. 

  5866.                     }
    5867. 

  5867.                 } else {
    5868. 

  5868.                     IF (err != 0 && err != NC_ERANGE)
    5869. 

  5869.                         error("OK or Range error: status = %d", err);
    5870. 

  5870.                 }
    5871. 

  5871. 		for (k = 0; k < ATT_LEN(i,j); k++) {
    5872. 

  5872. 		    if (inRange3(expect[k],ATT_TYPE(i,j),NCT_SHORT)
    5873. 

  5873.                             && expect[k] >= short_min && expect[k] <= short_max) {
    5874. 

  5874. 			IF (!equal(value[k],expect[k],ATT_TYPE(i,j),
    5875. 

  5875. 				NCT_SHORT)){
    5876. 

  5876. 			    error("value read not that expected");
    5877. 

  5877.                             if (verbose) {
    5878. 

  5878.                                 error("\n");
    5879. 

  5879.                                 error("varid: %d, ", i);
    5880. 

  5880.                                 error("att_name: %s, ", ATT_NAME(i,j));
    5881. 

  5881.                                 error("element number: %d ", k);
    5882. 

  5882.                                 error("expect: %g", expect[k]);
    5883. 

  5883.                                 error("got: %g", (double) value[k]);
    5884. 

  5884.                             }
    5885. 

  5885. 			} else {
    5886. 

  5886. 			    nok++;
    5887. 

  5887.                         }
    5888. 

  5888. 		    }
    5889. 

  5889. 		}
    5890. 

  5890. 	    } else {
    5891. 

  5891. 		IF (err != NC_ECHAR)
    5892. 

  5892. 		    error("wrong type: status = %d", err);
    5893. 

  5893. 	    }
    5894. 

  5894. 	}
    5895. 

  5895.     }
    5896. 

  5896. 

  5897.     err = nc_close(ncid);
    5898. 

  5898.     IF (err)
    5899. 

  5899. 	error("nc_close: %s", nc_strerror(err));
    5900. 

  5900.     print_nok(nok);
    5901. 

  5901. }
    5902. 

  5902. 

  5903. void
    5904. 

  5904. test_nc_get_att_int(void)
    5905. 

  5905. {
    5906. 

  5906.     int ncid;
    5907. 

  5907.     int i;
    5908. 

  5908.     int j;
    5909. 

  5909.     size_t k;
    5910. 

  5910.     int err;
    5911. 

  5911.     int allInExtRange;
    5912. 

  5912.     int allInIntRange;
    5913. 

  5913.     int canConvert;     /* Both text or both numeric */
    5914. 

  5914.     int value[MAX_NELS];
    5915. 

  5915.     double expect[MAX_NELS];
    5916. 

  5916.     int nok = 0;      /* count of valid comparisons */
    5917. 

  5917. 

  5918.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    5919. 

  5919.     IF (err) 
    5920. 

  5920. 	error("nc_open: %s", nc_strerror(err));
    5921. 

  5921. 

  5922.     for (i = -1; i < NVARS; i++) {
    5923. 

  5923.         for (j = 0; j < NATTS(i); j++) {
    5924. 

  5924. 	    canConvert = (ATT_TYPE(i,j) == NC_CHAR) == (NCT_INT == NCT_TEXT);
    5925. 

  5925. 	    err = nc_get_att_int(BAD_ID, i, ATT_NAME(i,j), value);
    5926. 

  5926. 	    IF (err != NC_EBADID) 
    5927. 

  5927. 		error("bad ncid: status = %d", err);
    5928. 

  5928. 	    err = nc_get_att_int(ncid, BAD_VARID, ATT_NAME(i,j), value);
    5929. 

  5929. 	    IF (err != NC_ENOTVAR) 
    5930. 

  5930. 		error("bad var id: status = %d", err);
    5931. 

  5931. 	    err = nc_get_att_int(ncid, i, "noSuch", value);
    5932. 

  5932. 	    IF (err != NC_ENOTATT) 
    5933. 

  5933. 		error("Bad attribute name: status = %d", err);
    5934. 

  5934. 	    allInExtRange = allInIntRange = 1;
    5935. 

  5935.             for (k = 0; k < ATT_LEN(i,j); k++) {
    5936. 

  5936. 		expect[k] = hash4(ATT_TYPE(i,j), -1, &k, NCT_INT);
    5937. 

  5937.                 if (inRange3(expect[k],ATT_TYPE(i,j),NCT_INT)) {
    5938. 

  5938.                     allInIntRange = allInIntRange && expect[k] >= int_min
    5939. 

  5939.                                 && expect[k] <= int_max;
    5940. 

  5940.                 } else {
    5941. 

  5941.                     allInExtRange = 0;
    5942. 

  5942.                 }
    5943. 

  5943. 	    }
    5944. 

  5944. 	    err = nc_get_att_int(ncid, i, ATT_NAME(i,j), value);
    5945. 

  5945.             if (canConvert || ATT_LEN(i,j) == 0) {
    5946. 

  5946.                 if (allInExtRange) {
    5947. 

  5947.                     if (allInIntRange) {
    5948. 

  5948.                         IF (err)
    5949. 

  5949.                             error("%s", nc_strerror(err));
    5950. 

  5950.                     } else {
    5951. 

  5951.                         IF (err != NC_ERANGE)
    5952. 

  5952.                             error("Range error: status = %d", err);
    5953. 

  5953.                     }
    5954. 

  5954.                 } else {
    5955. 

  5955.                     IF (err != 0 && err != NC_ERANGE)
    5956. 

  5956.                         error("OK or Range error: status = %d", err);
    5957. 

  5957.                 }
    5958. 

  5958. 		for (k = 0; k < ATT_LEN(i,j); k++) {
    5959. 

  5959. 		    if (inRange3(expect[k],ATT_TYPE(i,j),NCT_INT)
    5960. 

  5960.                             && expect[k] >= int_min && expect[k] <= int_max) {
    5961. 

  5961. 			IF (!equal(value[k],expect[k],ATT_TYPE(i,j),
    5962. 

  5962. 				NCT_INT)){
    5963. 

  5963. 			    error("value read not that expected");
    5964. 

  5964.                             if (verbose) {
    5965. 

  5965.                                 error("\n");
    5966. 

  5966.                                 error("varid: %d, ", i);
    5967. 

  5967.                                 error("att_name: %s, ", ATT_NAME(i,j));
    5968. 

  5968.                                 error("element number: %d ", k);
    5969. 

  5969.                                 error("expect: %g", expect[k]);
    5970. 

  5970.                                 error("got: %g", (double) value[k]);
    5971. 

  5971.                             }
    5972. 

  5972. 			} else {
    5973. 

  5973. 			    nok++;
    5974. 

  5974.                         }
    5975. 

  5975. 		    }
    5976. 

  5976. 		}
    5977. 

  5977. 	    } else {
    5978. 

  5978. 		IF (err != NC_ECHAR)
    5979. 

  5979. 		    error("wrong type: status = %d", err);
    5980. 

  5980. 	    }
    5981. 

  5981. 	}
    5982. 

  5982.     }
    5983. 

  5983. 

  5984.     err = nc_close(ncid);
    5985. 

  5985.     IF (err)
    5986. 

  5986. 	error("nc_close: %s", nc_strerror(err));
    5987. 

  5987.     print_nok(nok);
    5988. 

  5988. }
    5989. 

  5989. 

  5990. void
    5991. 

  5991. test_nc_get_att_long(void)
    5992. 

  5992. {
    5993. 

  5993.     int ncid;
    5994. 

  5994.     int i;
    5995. 

  5995.     int j;
    5996. 

  5996.     size_t k;
    5997. 

  5997.     int err;
    5998. 

  5998.     int allInExtRange;
    5999. 

  5999.     int allInIntRange;
    6000. 

  6000.     int canConvert;     /* Both text or both numeric */
    6001. 

  6001.     long value[MAX_NELS];
    6002. 

  6002.     double expect[MAX_NELS];
    6003. 

  6003.     int nok = 0;      /* count of valid comparisons */
    6004. 

  6004. 

  6005.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    6006. 

  6006.     IF (err) 
    6007. 

  6007. 	error("nc_open: %s", nc_strerror(err));
    6008. 

  6008. 

  6009.     for (i = -1; i < NVARS; i++) {
    6010. 

  6010.         for (j = 0; j < NATTS(i); j++) {
    6011. 

  6011. 	    canConvert = (ATT_TYPE(i,j) == NC_CHAR) == (NCT_LONG == NCT_TEXT);
    6012. 

  6012. 	    err = nc_get_att_long(BAD_ID, i, ATT_NAME(i,j), value);
    6013. 

  6013. 	    IF (err != NC_EBADID) 
    6014. 

  6014. 		error("bad ncid: status = %d", err);
    6015. 

  6015. 	    err = nc_get_att_long(ncid, BAD_VARID, ATT_NAME(i,j), value);
    6016. 

  6016. 	    IF (err != NC_ENOTVAR) 
    6017. 

  6017. 		error("bad var id: status = %d", err);
    6018. 

  6018. 	    err = nc_get_att_long(ncid, i, "noSuch", value);
    6019. 

  6019. 	    IF (err != NC_ENOTATT) 
    6020. 

  6020. 		error("Bad attribute name: status = %d", err);
    6021. 

  6021. 	    allInExtRange = allInIntRange = 1;
    6022. 

  6022.             for (k = 0; k < ATT_LEN(i,j); k++) {
    6023. 

  6023. 		expect[k] = hash4(ATT_TYPE(i,j), -1, &k, NCT_LONG);
    6024. 

  6024.                 if (inRange3(expect[k],ATT_TYPE(i,j),NCT_LONG)) {
    6025. 

  6025.                     allInIntRange = allInIntRange && expect[k] >= long_min
    6026. 

  6026.                                 && expect[k] <= long_max;
    6027. 

  6027.                 } else {
    6028. 

  6028.                     allInExtRange = 0;
    6029. 

  6029.                 }
    6030. 

  6030. 	    }
    6031. 

  6031. 	    err = nc_get_att_long(ncid, i, ATT_NAME(i,j), value);
    6032. 

  6032.             if (canConvert || ATT_LEN(i,j) == 0) {
    6033. 

  6033.                 if (allInExtRange) {
    6034. 

  6034.                     if (allInIntRange) {
    6035. 

  6035.                         IF (err)
    6036. 

  6036.                             error("%s", nc_strerror(err));
    6037. 

  6037.                     } else {
    6038. 

  6038.                         IF (err != NC_ERANGE)
    6039. 

  6039.                             error("Range error: status = %d", err);
    6040. 

  6040.                     }
    6041. 

  6041.                 } else {
    6042. 

  6042.                     IF (err != 0 && err != NC_ERANGE)
    6043. 

  6043.                         error("OK or Range error: status = %d", err);
    6044. 

  6044.                 }
    6045. 

  6045. 		for (k = 0; k < ATT_LEN(i,j); k++) {
    6046. 

  6046. 		    if (inRange3(expect[k],ATT_TYPE(i,j),NCT_LONG)
    6047. 

  6047.                             && expect[k] >= long_min && expect[k] <= long_max) {
    6048. 

  6048. 			IF (!equal(value[k],expect[k],ATT_TYPE(i,j),
    6049. 

  6049. 				NCT_LONG)){
    6050. 

  6050. 			    error("value read not that expected");
    6051. 

  6051.                             if (verbose) {
    6052. 

  6052.                                 error("\n");
    6053. 

  6053.                                 error("varid: %d, ", i);
    6054. 

  6054.                                 error("att_name: %s, ", ATT_NAME(i,j));
    6055. 

  6055.                                 error("element number: %d ", k);
    6056. 

  6056.                                 error("expect: %g", expect[k]);
    6057. 

  6057.                                 error("got: %g", (double) value[k]);
    6058. 

  6058.                             }
    6059. 

  6059. 			} else {
    6060. 

  6060. 			    nok++;
    6061. 

  6061.                         }
    6062. 

  6062. 		    }
    6063. 

  6063. 		}
    6064. 

  6064. 	    } else {
    6065. 

  6065. 		IF (err != NC_ECHAR)
    6066. 

  6066. 		    error("wrong type: status = %d", err);
    6067. 

  6067. 	    }
    6068. 

  6068. 	}
    6069. 

  6069.     }
    6070. 

  6070. 

  6071.     err = nc_close(ncid);
    6072. 

  6072.     IF (err)
    6073. 

  6073. 	error("nc_close: %s", nc_strerror(err));
    6074. 

  6074.     print_nok(nok);
    6075. 

  6075. }
    6076. 

  6076. 

  6077. void
    6078. 

  6078. test_nc_get_att_float(void)
    6079. 

  6079. {
    6080. 

  6080.     int ncid;
    6081. 

  6081.     int i;
    6082. 

  6082.     int j;
    6083. 

  6083.     size_t k;
    6084. 

  6084.     int err;
    6085. 

  6085.     int allInExtRange;
    6086. 

  6086.     int allInIntRange;
    6087. 

  6087.     int canConvert;     /* Both text or both numeric */
    6088. 

  6088.     float value[MAX_NELS];
    6089. 

  6089.     double expect[MAX_NELS];
    6090. 

  6090.     int nok = 0;      /* count of valid comparisons */
    6091. 

  6091. 

  6092.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    6093. 

  6093.     IF (err) 
    6094. 

  6094. 	error("nc_open: %s", nc_strerror(err));
    6095. 

  6095. 

  6096.     for (i = -1; i < NVARS; i++) {
    6097. 

  6097.         for (j = 0; j < NATTS(i); j++) {
    6098. 

  6098. 	    canConvert = (ATT_TYPE(i,j) == NC_CHAR) == (NCT_FLOAT == NCT_TEXT);
    6099. 

  6099. 	    err = nc_get_att_float(BAD_ID, i, ATT_NAME(i,j), value);
    6100. 

  6100. 	    IF (err != NC_EBADID) 
    6101. 

  6101. 		error("bad ncid: status = %d", err);
    6102. 

  6102. 	    err = nc_get_att_float(ncid, BAD_VARID, ATT_NAME(i,j), value);
    6103. 

  6103. 	    IF (err != NC_ENOTVAR) 
    6104. 

  6104. 		error("bad var id: status = %d", err);
    6105. 

  6105. 	    err = nc_get_att_float(ncid, i, "noSuch", value);
    6106. 

  6106. 	    IF (err != NC_ENOTATT) 
    6107. 

  6107. 		error("Bad attribute name: status = %d", err);
    6108. 

  6108. 	    allInExtRange = allInIntRange = 1;
    6109. 

  6109.             for (k = 0; k < ATT_LEN(i,j); k++) {
    6110. 

  6110. 		expect[k] = hash4(ATT_TYPE(i,j), -1, &k, NCT_FLOAT);
    6111. 

  6111.                 if (inRange3(expect[k],ATT_TYPE(i,j),NCT_FLOAT)) {
    6112. 

  6112.                     allInIntRange = allInIntRange && expect[k] >= float_min
    6113. 

  6113.                                 && expect[k] <= float_max;
    6114. 

  6114.                 } else {
    6115. 

  6115.                     allInExtRange = 0;
    6116. 

  6116.                 }
    6117. 

  6117. 	    }
    6118. 

  6118. 	    err = nc_get_att_float(ncid, i, ATT_NAME(i,j), value);
    6119. 

  6119.             if (canConvert || ATT_LEN(i,j) == 0) {
    6120. 

  6120.                 if (allInExtRange) {
    6121. 

  6121.                     if (allInIntRange) {
    6122. 

  6122.                         IF (err)
    6123. 

  6123.                             error("%s", nc_strerror(err));
    6124. 

  6124.                     } else {
    6125. 

  6125.                         IF (err != NC_ERANGE)
    6126. 

  6126.                             error("Range error: status = %d", err);
    6127. 

  6127.                     }
    6128. 

  6128.                 } else {
    6129. 

  6129.                     IF (err != 0 && err != NC_ERANGE)
    6130. 

  6130.                         error("OK or Range error: status = %d", err);
    6131. 

  6131.                 }
    6132. 

  6132. 		for (k = 0; k < ATT_LEN(i,j); k++) {
    6133. 

  6133. 		    if (inRange3(expect[k],ATT_TYPE(i,j),NCT_FLOAT)
    6134. 

  6134.                             && expect[k] >= float_min && expect[k] <= float_max) {
    6135. 

  6135. 			IF (!equal(value[k],expect[k],ATT_TYPE(i,j),
    6136. 

  6136. 				NCT_FLOAT)){
    6137. 

  6137. 			    error("value read not that expected");
    6138. 

  6138.                             if (verbose) {
    6139. 

  6139.                                 error("\n");
    6140. 

  6140.                                 error("varid: %d, ", i);
    6141. 

  6141.                                 error("att_name: %s, ", ATT_NAME(i,j));
    6142. 

  6142.                                 error("element number: %d ", k);
    6143. 

  6143.                                 error("expect: %g", expect[k]);
    6144. 

  6144.                                 error("got: %g", (double) value[k]);
    6145. 

  6145.                             }
    6146. 

  6146. 			} else {
    6147. 

  6147. 			    nok++;
    6148. 

  6148.                         }
    6149. 

  6149. 		    }
    6150. 

  6150. 		}
    6151. 

  6151. 	    } else {
    6152. 

  6152. 		IF (err != NC_ECHAR)
    6153. 

  6153. 		    error("wrong type: status = %d", err);
    6154. 

  6154. 	    }
    6155. 

  6155. 	}
    6156. 

  6156.     }
    6157. 

  6157. 

  6158.     err = nc_close(ncid);
    6159. 

  6159.     IF (err)
    6160. 

  6160. 	error("nc_close: %s", nc_strerror(err));
    6161. 

  6161.     print_nok(nok);
    6162. 

  6162. }
    6163. 

  6163. 

  6164. void
    6165. 

  6165. test_nc_get_att_double(void)
    6166. 

  6166. {
    6167. 

  6167.     int ncid;
    6168. 

  6168.     int i;
    6169. 

  6169.     int j;
    6170. 

  6170.     size_t k;
    6171. 

  6171.     int err;
    6172. 

  6172.     int allInExtRange;
    6173. 

  6173.     int allInIntRange;
    6174. 

  6174.     int canConvert;     /* Both text or both numeric */
    6175. 

  6175.     double value[MAX_NELS];
    6176. 

  6176.     double expect[MAX_NELS];
    6177. 

  6177.     int nok = 0;      /* count of valid comparisons */
    6178. 

  6178. 

  6179.     err = nc_open(testfile, NC_NOWRITE, &ncid);
    6180. 

  6180.     IF (err) 
    6181. 

  6181. 	error("nc_open: %s", nc_strerror(err));
    6182. 

  6182. 

  6183.     for (i = -1; i < NVARS; i++) {
    6184. 

  6184.         for (j = 0; j < NATTS(i); j++) {
    6185. 

  6185. 	    canConvert = (ATT_TYPE(i,j) == NC_CHAR) == (NCT_DOUBLE == NCT_TEXT);
    6186. 

  6186. 	    err = nc_get_att_double(BAD_ID, i, ATT_NAME(i,j), value);
    6187. 

  6187. 	    IF (err != NC_EBADID) 
    6188. 

  6188. 		error("bad ncid: status = %d", err);
    6189. 

  6189. 	    err = nc_get_att_double(ncid, BAD_VARID, ATT_NAME(i,j), value);
    6190. 

  6190. 	    IF (err != NC_ENOTVAR) 
    6191. 

  6191. 		error("bad var id: status = %d", err);
    6192. 

  6192. 	    err = nc_get_att_double(ncid, i, "noSuch", value);
    6193. 

  6193. 	    IF (err != NC_ENOTATT) 
    6194. 

  6194. 		error("Bad attribute name: status = %d", err);
    6195. 

  6195. 	    allInExtRange = allInIntRange = 1;
    6196. 

  6196.             for (k = 0; k < ATT_LEN(i,j); k++) {
    6197. 

  6197. 		expect[k] = hash4(ATT_TYPE(i,j), -1, &k, NCT_DOUBLE);
    6198. 

  6198.                 if (inRange3(expect[k],ATT_TYPE(i,j),NCT_DOUBLE)) {
    6199. 

  6199.                     allInIntRange = allInIntRange && expect[k] >= double_min
    6200. 

  6200.                                 && expect[k] <= double_max;
    6201. 

  6201.                 } else {
    6202. 

  6202.                     allInExtRange = 0;
    6203. 

  6203.                 }
    6204. 

  6204. 	    }
    6205. 

  6205. 	    err = nc_get_att_double(ncid, i, ATT_NAME(i,j), value);
    6206. 

  6206.             if (canConvert || ATT_LEN(i,j) == 0) {
    6207. 

  6207.                 if (allInExtRange) {
    6208. 

  6208.                     if (allInIntRange) {
    6209. 

  6209.                         IF (err)
    6210. 

  6210.                             error("%s", nc_strerror(err));
    6211. 

  6211.                     } else {
    6212. 

  6212.                         IF (err != NC_ERANGE)
    6213. 

  6213.                             error("Range error: status = %d", err);
    6214. 

  6214.                     }
    6215. 

  6215.                 } else {
    6216. 

  6216.                     IF (err != 0 && err != NC_ERANGE)
    6217. 

  6217.                         error("OK or Range error: status = %d", err);
    6218. 

  6218.                 }
    6219. 

  6219. 		for (k = 0; k < ATT_LEN(i,j); k++) {
    6220. 

  6220. 		    if (inRange3(expect[k],ATT_TYPE(i,j),NCT_DOUBLE)
    6221. 

  6221.                             && expect[k] >= double_min && expect[k] <= double_max) {
    6222. 

  6222. 			IF (!equal(value[k],expect[k],ATT_TYPE(i,j),
    6223. 

  6223. 				NCT_DOUBLE)){
    6224. 

  6224. 			    error("value read not that expected");
    6225. 

  6225.                             if (verbose) {
    6226. 

  6226.                                 error("\n");
    6227. 

  6227.                                 error("varid: %d, ", i);
    6228. 

  6228.                                 error("att_name: %s, ", ATT_NAME(i,j));
    6229. 

  6229.                                 error("element number: %d ", k);
    6230. 

  6230.                                 error("expect: %g", expect[k]);
    6231. 

  6231.                                 error("got: %g", (double) value[k]);
    6232. 

  6232.                             }
    6233. 

  6233. 			} else {
    6234. 

  6234. 			    nok++;
    6235. 

  6235.                         }
    6236. 

  6236. 		    }
    6237. 

  6237. 		}
    6238. 

  6238. 	    } else {
    6239. 

  6239. 		IF (err != NC_ECHAR)
    6240. 

  6240. 		    error("wrong type: status = %d", err);
    6241. 

  6241. 	    }
    6242. 

  6242. 	}
    6243. 

  6243.     }
    6244. 

  6244. 

  6245.     err = nc_close(ncid);
    6246. 

  6246.     IF (err)
    6247. 

  6247. 	error("nc_close: %s", nc_strerror(err));
    6248. 

  6248.     print_nok(nok);
    6249. 

  6249. }
    6250. 

  6250. 

  6251. 

  6252.