bm_file.c#75 get_starts_counts(int ndims, size_t *dimlen, int p, int my_rank, #97 total_len *= dimlen[d]; #117 if (total[d] >= dimlen[d]) #131 *last_count = dimlen[0] - total[0]; #136 *start_inc = dimlen[0]/slow_count; #137 while (*start_inc * slow_count < dimlen[0]) #141 if (start[0] > dimlen[0]) #152 count[d] = dimlen[d]; #153 *slice_len *= dimlen[d]; #155 *num_steps = (float)dimlen[0] / (*start_inc * p); #156 if ((float)dimlen[0] / (*start_inc * p) != dimlen[0] / (*start_inc * p)) #169 left = dimlen[0] - (*num_steps - 1) * *start_inc * p; #182 *last_count = dimlen[0] - (*num_steps - 1) * *start_inc; #271 size_t *dimlen = NULL, type_size = 0; #372 if (!(dimlen = malloc(real_ndims * sizeof(size_t)))) #375 if ((ret = nc_inq_dimlen(ncid1, dimids[d], &dimlen[d]))) #380 dimlen[0] = 1; #382 if ((ret = get_starts_counts(ndims, dimlen, p, my_rank, slow_count, use_scs, #391 if (!dimlen[0]) #446 if (dimlen) free(dimlen); #645 size_t *dimlen = NULL; #667 if (!(dimlen = malloc(real_ndims * sizeof(size_t)))) #670 if ((ret = nc_inq_dimlen(ncid_in, dimids[d], &dimlen[d]))) #680 dimlen[0] = 1; #691 if ((ret = get_starts_counts(ndims, dimlen, p, my_rank, slow_count, use_scs, #700 if (!dimlen[0]) #766 var_num_bytes *= dimlen[d]; #771 if (dimlen) free(dimlen); chunkspec.c#107 size_t dimlen; #108 ret = nc_inq_dimlen(ncid, dimid, &dimlen); #111 chunksize = dimlen; dcopy.c#264 size_t *dimlen = NULL; #345 if (!(dimlen = malloc((size_t)real_ndims * sizeof(size_t)))) #350 dimlen[0] = 0; #355 if ((retval = nc_inq_dimlen(ncid_in, dimids_in[d], &dimlen[d]))) #358 LOG((4, "nc_copy_var: there are %d data", dimlen[d])); #364 dimlen[0] = 1; #369 count[d] = d ? dimlen[d] : 1; #370 if (d) reclen *= dimlen[d]; #374 if (!dimlen[0]) #380 if(dimlen) free(dimlen); #386 for (start[0]=0; !retval && start[0]<(size_t)dimlen[0]; start[0]++) #474 if (dimlen) free(dimlen); dvarget.c#204 size_t dimlen; #222 dimlen = (i == 0 && isrecvar ? numrecs : varshape[i]); #224 if(mystart[i] >= dimlen) #227 if(mystart[i] + myedges[i] > dimlen) #438 size_t dimlen = #442 if (mystart[idim] >= dimlen) #448 if (mystart[idim] + myedges[idim] > dimlen) dvarput.c#197 size_t dimlen; #221 dimlen = (i == 0 && isrecvar ? numrecs : varshape[i]); #224 dimlen = varshape[i]; #229 if(mystart[i] > dimlen) #232 if(mystart[i] + myedges[i] > dimlen) nccopy.c#610 size_t dimlen; #611 NC_CHECK(nc_inq_dimlen(ogrp, odimid, &dimlen)); #615 if(dimlen > 0) { /* dimlen for unlimited dims is still 0 before copying data */ #616 varsize *= dimlen; #1288 size_t dimlen; #1290 NC_CHECK(nc_inq_dimlen(ncid, dimid, &dimlen)); #1291 nvals *= dimlen; #1293 count[ivar][ii] = dimlen; tst_chunks2.c#19 calculate_waste(int ndims, size_t *dimlen, size_t *chunksize, float *waste) #26 assert(waste && dimlen && chunksize && ndims); #36 for (num_chunks[d] = 0; (num_chunks[d] * chunksize[d]) < (dimlen[d] ? dimlen[d] : 1); #45 unchunked *= (dimlen[d] ? dimlen[d] : 1); #61 printf("%ld\t%ld\t\t%ld\n", (long int)dimlen[d], (long int)chunksize[d],
HyperKWIC - Version 7.20DA executed at 11:37 on 27 Oct 2017 | Polyhedron Solutions - INTERNAL USE | COMMERCIAL (Any O/S) SN 4AKIed