constraints.c#416     slice->first = startp[dimindex+j];
#421     slice->last = (slice->first + slice->length) - 1;
#425 slice->length = (slice->last - slice->first) + 1;
#449    if(slice->first != 0 || slice->stride != 1) return 0;
#676     if(slice1->first != slice2->first
#804    size_t first = slice->first;
#806    if(first == 0 && stride == 1) return; /* no need to do anything */
#807    slice->first = 0;
dapdump.c#576            (unsigned long)slice->first);
#579                (unsigned long)slice->first,
#583                (unsigned long)slice->first,
dapodom.c#25 odom->start[i] = segment->slices[i+startindex].first;
daputil.c#373    int i,len,first;
#395    for(first=1,i=1;i<len;i++) { /* start at 1 to skip dataset name */
#400 if(!firstncbytescat(pathname,sep);
#403 first = 0;
#414    int i,len,first;
#428    for(first=1,i=0;i<len;i++) {
#435         if(!firstncbytescat(pathname,separator);
#437         first = 0;
dceconstraints.c#75    size_t last = (s->first+s->length)-1;
#77 prefix,s->first,s->stride,last,s->stop,s->length,s->count);
#190#define MAP(s1,i) ((s1)->first + ((s1)->stride*(i)))
#206    sr.first     = MAP(s1,s2->first);
#207    if(sr.first > s1->last)
#211    sr.length    = (sr.last + 1) - sr.first;
#614     size_t last = (slice->first+slice->length)-1;
#617             (unsigned long)slice->first,dimdecl(slice->declsize));
#620             (unsigned long)slice->first,
#625     (unsigned long)slice->first,
#912    if(slice->first != 0
#934    slice->first = 0;
#979     if(start != NULLstart[i] = segment->slices[i].first;
#1061     (unsigned long)slice->first,
dceconstraints.h#23    size_t first;
dceparse.c#127    unsigned long first=0,stride=0,last=0;
#131    sscanf((char*)sfirst,"%lu",&first); /* always defined */
#135 last = first;
#143    if(last < first)
#145    slice->first  = first;
#148    slice->length  = (slice->last - slice->first) + 1;
#208    slice->first = start;
getvara.c#908slice->first,slice->stride,slice->stop,slice->declsize);
#913    for(i=slice->first;i<slice->length;i+=slice->stride) {
nc_iter.c#93    if(iter->first) {
#104        iter->first = 0;
#145    iter->first = 1;
nc_iter.h#20    int first;      /* false after associated next function invoked */
nciter.c#32    iter->first = 1;
#248    if(iter->first) {
#269 iter->first = 0;
nciter.h#20    int first;      /* false after first invocation of nc_next_iter() */
nctime0.c#37    bounds_node_t *first;
#50    bnode->next = bounds_list.first;
#51    bounds_list.first = bnode;
#100    bounds_node_t *bp = bounds_list.first;
#183 bounds_list.first = NULL;
occonstraints.h#9    size_t first;
ocdump.c#214    fprintf(stdout,"%lu",(unsigned long)slice->first);
#216    fprintf(stdout,":%lu",(unsigned long)(slice->first+slice->count)-1);
semantics.c#1171 int first,ischar;
#1176 first = findunlimited(dimset,0);
#1177 if(first == dimset->ndims) continue; /* no unlimited dims */
#1178 if(first == 0) {
#1179     computeunlimitedsizes(dimset,first,var->data,ischar);
#1187             computeunlimitedsizes(dimset,first,con->value.compoundv,ischar);
vardata.h#38extern void lput2( const char *stringbool_t firstbool_t wrap);


HyperKWIC - Version 7.20DA executed at 11:37 on 27 Oct 2017 | Polyhedron Solutions - INTERNAL USE | COMMERCIAL (Any O/S) SN 4AKIed