cache.c#51    for(i=nclistlength(cache->nodes)-1;i>=0;i--) {
#52        cachenode = (NCcachenode*)nclistget(cache->nodes,i);
#67        if(nclistlength(cache->nodes) > 1) {
#69     nclistremove(cache->nodes,index);
#70     nclistpush(cache->nodes,(void*)cachenode);
#273 if(cache->nodes == NULLcache->nodes = nclistnew();
#276       && nclistlength(cache->nodes) > 0) {
#277     NCcachenodenode = (NCcachenode*)nclistremove(cache->nodes,0);
#287 while(nclistlength(cache->nodes) > cache->cachecount) {
#288     NCcachenodenode = (NCcachenode*)nclistremove(cache->nodes,0);
#296        nclistpush(nccomm->cdf.cache->nodes,(void*)cachenode);
#345    for(i=0;i<nclistlength(cache->nodes);i++) {
#346 freenccachenode(nccomm,(NCcachenode*)nclistget(cache->nodes,i));
#348    nclistfree(cache->nodes);
#360    c->nodes = nclistnew();
cdf.c#43    allnodes = tree->nodes;
#222    for(i=0;i<nclistlength(root->tree->nodes);i++) {
#223 CDFnodenode = (CDFnode*)nclistget(root->tree->nodes,i);
#539    nclistpush(node->root->tree->nodes,(void*)newstruct);
#664    for(i=0;i<nclistlength(tree->nodes);i++) {
#665 CDFnodenode = (CDFnode*)nclistget(tree->nodes,i);
#682    allnodes = nccomm->cdf.ddsroot->tree->nodes;
#719    nclistpush(dim->container->root->tree->nodes,(void*)clone);
#951    tree->nodes = nclistnew();
#958     fixnodes(nccomm,tree->nodes);
#994 nclistpush(tree->nodes,(void*)cdfnode);
#1003 nclistpush(tree->nodes,(void*)cdfnode);
#1014 nclistpush(tree->nodes,(void*)cdfnode);
#1070    for(i=0;i<nclistlength(tree->nodes);i++) {
#1071 CDFnodenode = (CDFnode*)nclistget(tree->nodes,i);
#1074    nclistfree(tree->nodes);
#1217 nclistpush(tree->nodes,(void*)cdfdim);
constraints.c#15static NCerror matchpartialname(NClistnodesNClistsegmentsCDFnode** nodep);
#60    NClistnodes = root->tree->nodes;
#68 ncstat = matchpartialname(nodes,proj->var->segments,&cdfmatch);
#233matchpartialname(NClistnodesNClistsegmentsCDFnode** nodep)
#247    for(i=0;i<nclistlength(nodes);i++) {
#248        CDFnodenode = (CDFnode*)nclistget(nodes,i);
dapattr.c#37    allnodes = ddsroot->tree->nodes;
dapdump.c#551    if(nclistlength(cache->nodes) > 0) {
#552        for(i=0;i<nclistlength(cache->nodes);i++) {
#553        NCcachenodenode = (NCcachenode*)nclistget(cache->nodes,i);
dapparse.c#520            tree->nodes = state->ocnodes;
getvara.c#1024    for(i=0;i<nclistlength(xtree->nodes);i++) {
#1025 CDFnodexnode = (CDFnode*)nclistget(xtree->nodes,i);
nccommon.h#122    NClistnodes; /* cache nodes other than prefetch */
#175    NClistnodes; /* all nodes in tree*/
ncd2dispatch.c#836        cdfnodes = dapcomm->cdf.ddsroot->tree->nodes;
#1283    for(i=0;i<nclistlength(nccomm->cdf.ddsroot->tree->nodes);i++) {
#1284 CDFnodevar = (CDFnode*)nclistget(nccomm->cdf.ddsroot->tree->nodes,i);
#1425    nclistpush(dapcomm->cdf.ddsroot->tree->nodes,(void*)globalsdim);
#1461     nclistpush(dapcomm->cdf.ddsroot->tree->nodes,(void*)sdim);
#1667    nclistpush(tree->nodes,(void*)sqdim);
ocinternal.c#288    tree->nodes = NULL;
#325        occomputesemantics(tree->nodes);
ocinternal.h#237    OClistnodes; /* all nodes in tree*/
ocnode.c#177    ocnodes_free(tree->nodes);
#190ocnodes_free(OClistnodes)
#193    for(i=0;i<oclistlength(nodes);i++) {
#194 OCnodenode = (OCnode*)oclistget(nodes,i);
#223    oclistfree(nodes);
#261    ddsnodes = ddsroot->tree->nodes;
#269    for(i=0;i<oclistlength(dasroot->tree->nodes);i++) {
#270 OCnodedas = (OCnode*)oclistget(dasroot->tree->nodes,i);
#443    for(i=0;i<oclistlength(tree->nodes);i++) {
#444 OCnodenode = (OCnode*)oclistget(tree->nodes,i);
#528    OClisttreenodes = ddsroot->tree->nodes;


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