n                 598 src/CalculiX.h void CEE(ddotc,(ITG *n,double *dx,ITG *incx,double *dy,ITG *incy,
n                 620 src/CalculiX.h void FORTRAN(dnaupd,(ITG *ido,char *bmat,ITG *n,char *which,ITG *nev,
n                 625 src/CalculiX.h void FORTRAN(dsaupd,(ITG *ido,char *bmat,ITG *n,char *which,ITG *nev,
n                 643 src/CalculiX.h void FORTRAN(dsort,(double *dx,ITG *iy,ITG *n,ITG *kflag));
n                1135 src/CalculiX.h void FORTRAN(isortid,(ITG *ix,double *dy,ITG *n,ITG *kflag));
n                1137 src/CalculiX.h void FORTRAN(isortii,(ITG *ix,ITG *iy,ITG *n,ITG *kflag));
n                1139 src/CalculiX.h void FORTRAN(isortiid,(ITG *ix,ITG *iy,double *dy,ITG *n,ITG *kflag));
n                1141 src/CalculiX.h void FORTRAN(isortiddc,(ITG *ix,double *dy1,double *dy2,char *cy,ITG *n, 
n                1145 src/CalculiX.h                          char *cy,ITG *n,ITG *kflag));
n                1490 src/CalculiX.h void FORTRAN(mult,(double *matrix,double *trans,ITG *n));
n                1498 src/CalculiX.h void FORTRAN(nident,(ITG *x,ITG *px,ITG *n,ITG *id));
n                1500 src/CalculiX.h void FORTRAN(nidentll,(long long *x,long long *px,ITG *n,ITG *id));
n                1566 src/CalculiX.h void FORTRAN(op,(ITG *n,double *x,double *y,double *ad,double *au,ITG *jq,ITG *irow));
n                1568 src/CalculiX.h void FORTRAN(opas,(ITG *n,double *x,double *y,double *ad,double *au,ITG *jq,
n                1571 src/CalculiX.h void FORTRAN(op_corio,(ITG *n,double *x,double *y,double *ad,double *au,
n                2065 src/CalculiX.h void FORTRAN(splitline,(char *text,char *textpart,ITG *n));
n                2330 src/CalculiX.h void FORTRAN(znaupd,(ITG *ido,char *bmat,ITG *n,char *which,ITG *nev,
n                  63 src/exo.c        ITG i,j,k,l,m,n,o,indexe,nemax,nlayer,noutloc,iset,iselect,ncomp,nope,
n                 434 src/exo.c      	    for(n=0;n<nlayer;n++){
n                 435 src/exo.c      	      for(m=0;m<12;m++){connect[k++] = node_map_inv[kon[indexe+28+20*n+m]-1];}
n                 436 src/exo.c      	      for(m=16;m<20;m++){connect[k++] = node_map_inv[kon[indexe+28+20*n+m]-1];}
n                 437 src/exo.c      	      for(m=12;m<16;m++){connect[k++] = node_map_inv[kon[indexe+28+20*n+m]-1];}
n                  40 src/exo.h      ITG exoset_check(ITG n, ITG *node_map_inv, ITG *nk, int *dropped, int *unidentified);
n                  32 src/exosetfind.c   ITG i,j,k,l,n,s,e,gen;
n                  67 src/exosetfind.c       n=0; j=s;
n                  73 src/exosetfind.c 	      set_nums[n++]=exoset_check(k-1, node_map_inv, nk, &dropped, &unidentified);
n                  79 src/exosetfind.c 	    set_nums[n++]=exoset_check(gen, node_map_inv, nk, &dropped, &unidentified);
n                  85 src/exosetfind.c 	  set_nums[1+n++]=exoset_check(ialset[e]-2, node_map_inv, nk, &dropped, &unidentified);
n                  87 src/exosetfind.c 	    set_nums[-1+n++]=exoset_check(ialset[e]-3, node_map_inv, nk, &dropped, &unidentified);
n                  91 src/exosetfind.c 	set_nums[n++]=exoset_check(ialset[s]-1, node_map_inv, nk, &dropped, &unidentified);
n                  92 src/exosetfind.c 	set_nums[n++]=exoset_check(ialset[e]-1, node_map_inv, nk, &dropped, &unidentified);
n                  94 src/exosetfind.c 	set_nums[n++]=exoset_check(ialset[e]-1, node_map_inv, nk, &dropped, &unidentified);
n                 104 src/exosetfind.c 	errr = ex_put_node_set_param (exoid, i, n, 0); // CURRENTLY NO DISTRIBUTIONS ADDED
n                 188 src/exosetfind.c ITG exoset_check(ITG n, ITG *node_map_inv, ITG *nk, int *dropped, int *unidentified){
n                 191 src/exosetfind.c   if (n<=*nk){
n                 192 src/exosetfind.c     val = node_map_inv[n]-1;
n                  35 src/exovector.c   ITG i,j,k,l,m,n,ii,jj,kk;
n                 105 src/exovector.c 	    n=0;
n                 110 src/exovector.c 		nodal_var_vals[n++]=v[(mi[1]+1)*i+j];
n                 116 src/exovector.c 		nodal_var_vals[n++]=v[ii]*a[0+(j-1)*3]+v[jj]*a[1+(j-1)*3]+v[kk]*a[2+(j-1)*3];
n                  43 src/frdselect.c   ITG i,j,k,l,m,n,nksegment;
n                  65 src/frdselect.c 	for(n=1;n<=(ITG)((*ncomp+5)/6);n++){
n                  66 src/frdselect.c 	  if(n==1){
n                  92 src/frdselect.c 	    for(j=(n-1)*6;j<min(n*6,*ncomp);j++){
n                 134 src/frdselect.c 	  for(n=1;n<=(ITG)((*ncomp+5)/6);n++){
n                 135 src/frdselect.c 	    if(n==1){
n                 161 src/frdselect.c 	      for(j=(n-1)*6;j<min(n*6,*ncomp);j++){
n                 204 src/frdselect.c 	    for(n=1;n<=(ITG)((*ncomp+5)/6);n++){
n                 205 src/frdselect.c 	      if(n==1){
n                 231 src/frdselect.c 		for(j=(n-1)*6;j<min(n*6,*ncomp);j++){
n                  19 src/frecord.c    register ITG i, n, c;
n                  26 src/frecord.c        for (n=i+1; n<MAX_LINE_LENGTH; ++n) string[n] = '\0';
n                  35 src/frecord.c        for (n=i+1; n<MAX_LINE_LENGTH; ++n) string[n] = '\0';
n                  40 src/frecord.c        for (n=i+1; n<MAX_LINE_LENGTH; ++n) string[n] = '\0';
n                 133 src/getglobalresults.c     anz->n=0;
n                 156 src/getglobalresults.c     for(i=0;i<anz[0].n;i++){
n                 163 src/getglobalresults.c     for (i=0;i<anz[0].n;i++){
n                 408 src/getglobalresults.c 	for(i=0;i<anz[0].n;i++){
n                 447 src/getglobalresults.c 	for(i=0;i<anz[0].n;i++){
n                 487 src/getglobalresults.c 	for(i=0;i<anz[0].n;i++){
n                 529 src/getglobalresults.c 	for(i=0;i<anz[0].n;i++){
n                  35 src/matrixstorage.c     npoint_,npoint,neq3,index,i3l,i3c,i3lo,i3co,idof,n,il,
n                 246 src/matrixstorage.c       n=2;
n                 247 src/matrixstorage.c       FORTRAN(mult,(&aa3[9*i],&trans[9*i3c],&n));
n                 254 src/matrixstorage.c       n=1;
n                 255 src/matrixstorage.c       FORTRAN(mult,(&aa3[9*i],&trans[9*i3l],&n));
n                 470 src/matrixstorage.c       n=2;
n                 471 src/matrixstorage.c       FORTRAN(mult,(&aa3[9*i],&trans[9*i3c],&n));
n                 478 src/matrixstorage.c       n=1;
n                 479 src/matrixstorage.c       FORTRAN(mult,(&aa3[9*i],&trans[9*i3l],&n));
n                  41 src/pardiso.c        msglvl=0,error=0,*irowpardiso=NULL,kflag,kstart,n,ifortran,
n                 173 src/pardiso.c  		      n=k-kstart;		  
n                 175 src/pardiso.c  				       &n,&kflag));
n                 180 src/pardiso.c  			  n=k-kstart+1;	  
n                 182 src/pardiso.c                                    &aupardiso[kstart],&n,&kflag));
n                 236 src/pardiso.c  		      n=k-kstart;
n                 238 src/pardiso.c  				       &n,&kflag));
n                 246 src/pardiso.c  			  n=k-kstart+1;
n                 248 src/pardiso.c  					   &n,&kflag));
n                  45 src/pcgsolver.c void InnerProduct (double *a, double *b, ITG n, double *Sum);
n                 477 src/pcgsolver.c void InnerProduct (double *a, double *b, ITG n, double *Sum)
n                 482 src/pcgsolver.c 		for (i=0; i<n; i++)	       *Sum += a[i]*b[i];
n                  92 src/readfrd.c    ITG n;  /* used in format_flag */
n                 119 src/readfrd.c    anz->u=anz->n=anz->e=anz->l=-1;
n                 239 src/readfrd.c          anz->n++;
n                 241 src/readfrd.c          if (!format_flag) node[anz->n].nr = stoi(rec_str,4,8);
n                 242 src/readfrd.c          else              node[anz->n].nr = stoi(rec_str,4,13);
n                 243 src/readfrd.c          if (node[anz->n].nr>=node_field_size)
n                 245 src/readfrd.c            if(node[anz->n].nr<MAX_INTEGER/2) node_field_size=node[anz->n].nr*2+1; else node_field_size=MAX_INTEGER-2;
n                 246 src/readfrd.c            nodenr=node[anz->n].nr;
n                 263 src/readfrd.c          if(node[node[anz->n].nr].indx<0)
n                 265 src/readfrd.c            node[node[anz->n].nr].indx=anz->n;
n                 268 src/readfrd.c              node[node[anz->n].nr].nx = stof(&rec_str[8],1,12);
n                 269 src/readfrd.c              node[node[anz->n].nr].ny = stof(&rec_str[20],1,12);
n                 270 src/readfrd.c              node[node[anz->n].nr].nz = stof(&rec_str[32],1,12);
n                 274 src/readfrd.c              node[node[anz->n].nr].nx = stof(&rec_str[13],1,12);
n                 275 src/readfrd.c              node[node[anz->n].nr].ny = stof(&rec_str[25],1,12);
n                 276 src/readfrd.c              node[node[anz->n].nr].nz = stof(&rec_str[37],1,12);
n                 278 src/readfrd.c            if (node[anz->n].nr >  anz->nmax)  anz->nmax=node[anz->n].nr;
n                 279 src/readfrd.c            if (node[anz->n].nr <  anz->nmin)  anz->nmin=node[anz->n].nr;
n                 281 src/readfrd.c          printf (" n=%" ITGFORMAT " x=%lf y=%lf z=%lf \n",  node[anz->n].nr,
n                 282 src/readfrd.c            node[node[anz->n].nr].nx, node[node[anz->n].nr].ny,
n                 283 src/readfrd.c            node[node[anz->n].nr].nz); 
n                 296 src/readfrd.c          anz->n++;
n                 297 src/readfrd.c          length=fread((ITG *)&node[anz->n].nr,sizeof(ITG),1,handle);
n                 299 src/readfrd.c          if (node[anz->n].nr>=node_field_size)
n                 301 src/readfrd.c            if(node[anz->n].nr<MAX_INTEGER/2) node_field_size=node[anz->n].nr*2+1; else node_field_size=MAX_INTEGER-2;
n                 302 src/readfrd.c            nodenr= node[anz->n].nr;
n                 316 src/readfrd.c            for(n=node[anz->n].nr; n<node_field_size; n++) node[n].indx=-1;
n                 323 src/readfrd.c            if(node[node[anz->n].nr].indx<0)
n                 325 src/readfrd.c              node[node[anz->n].nr].indx=anz->n;
n                 326 src/readfrd.c  	    node[node[anz->n].nr].nx = value[0];
n                 327 src/readfrd.c              node[node[anz->n].nr].ny = value[1];
n                 328 src/readfrd.c              node[node[anz->n].nr].nz = value[2];
n                 333 src/readfrd.c            if(node[node[anz->n].nr].indx<0)
n                 335 src/readfrd.c              length=fread((double *)&node[node[anz->n].nr].nx,sizeof(double),3,handle);
n                 336 src/readfrd.c              node[node[anz->n].nr].indx=anz->n;
n                 340 src/readfrd.c          if (node[anz->n].nr >  anz->nmax)  anz->nmax=node[anz->n].nr;
n                 341 src/readfrd.c          if (node[anz->n].nr <  anz->nmin)  anz->nmin=node[anz->n].nr;
n                 343 src/readfrd.c          printf (" n=%" ITGFORMAT " x=%lf y=%lf z=%lf \n",  node[anz->n].nr,
n                 344 src/readfrd.c            node[node[anz->n].nr].nx, node[node[anz->n].nr].ny,
n                 345 src/readfrd.c            node[node[anz->n].nr].nz); 
n                 348 src/readfrd.c         anz->n++;
n                 558 src/readfrd.c        if(nod_data>anz->n)
n                 560 src/readfrd.c          printf(" WARNING: in this result-block are more nodes announced:%" ITGFORMAT " than in the model defined:%" ITGFORMAT "\n Please inform the program-admin of the originator of the frd-file\n\n", nod_data, anz->n);
n                 562 src/readfrd.c          nod_data=anz->n;
n                 583 src/readfrd.c        if (!format_flag) n=8;
n                 584 src/readfrd.c        else n=13;
n                 638 src/readfrd.c              for(n=0; n<nod_data; n++)
n                 714 src/readfrd.c  	        for(i=0; i<maxcomps; i++) lcase[anz->l].dat[i][nodenr]= stof(&rec_str[n+i*12], 1, 12);
n                 723 src/readfrd.c            if (!format_flag) n=8;
n                 724 src/readfrd.c            else n=13;
n                 732 src/readfrd.c                lcase[anz->l].dat[i][nodenr]= stof(&rec_str[n+j*12], 1, 12);
n                 835 src/readfrd.c                    if (!format_flag) n=8;
n                 836 src/readfrd.c                    else n=13;
n                 837 src/readfrd.c                    if(nvals<=6) offset= nod_data * (n+nvals*12+1); 
n                 842 src/readfrd.c                        offset+= nod_data * (n+6*12+1);
n                 844 src/readfrd.c                        offset+= nod_data * (n+(nvals%6)*12+1);
n                 914 src/readfrd.c         for(j=0; j<anz->n; j++)
n                1022 src/readfrd.c        for(n=0; n<anz->n; n++)
n                1024 src/readfrd.c          nodenr=node[n].nr;
n                1149 src/readfrd.c        for(n=0; n<anz->n; n++)
n                1151 src/readfrd.c          nodenr=node[n].nr;
n                1255 src/readfrd.c        for(n=0; n<anz->n; n++)
n                1257 src/readfrd.c          nodenr=node[n].nr;
n                1296 src/readfrd.c    if(anz->n<0) anz->n=0;
n                1311 src/readfrd.c    anz->orign    = anz->n;
n                1325 src/readfrd.c    register ITG i,j, n;
n                1370 src/readfrd.c      if (!format_flag) n=8;
n                1371 src/readfrd.c      else n=13;
n                1394 src/readfrd.c          for(n=0; n<nod_data; n++)
n                1440 src/readfrd.c            else for(i=0; i<maxcomps; i++) lcase[lc].dat[i][nodenr]= stof(&rec_str[n+i*12], 1, 12);
n                1446 src/readfrd.c          if (!format_flag) n=8;
n                1447 src/readfrd.c          else n=13;
n                1451 src/readfrd.c            lcase[lc].dat[i][nodenr]= stof(&rec_str[n+j*12], 1, 12);
n                1481 src/readfrd.c  char *getRecord(FILE *handle, ITG n, ITG x0 )
n                1487 src/readfrd.c      n2=n;                            
n                1488 src/readfrd.c      for(ii=0; ii<n; ii++)
n                1510 src/readfrd.c    register ITG i=0,j, n;
n                1586 src/readfrd.c    if (!lcase[lc].format_flag) n=8;
n                1587 src/readfrd.c    else n=13;
n                1610 src/readfrd.c        if (!lcase[lc].format_flag) n=8;
n                1611 src/readfrd.c        else n=13;
n                1615 src/readfrd.c          dat[i]= stof(&rec_str[n+j*12], 1, 12);
n                1628 src/readfrd.c        if (!lcase[lc].format_flag) n=8;
n                1629 src/readfrd.c        else n=13;
n                1630 src/readfrd.c        if(nvals<=6) offset+= nod_data * (n+nvals*12); 
n                1634 src/readfrd.c            offset+= nod_data * (n+6*12+1);
n                1636 src/readfrd.c            offset+= nod_data * (n+(nvals%6)*12+1);
n                1677 src/readfrd.c          else for(i=0; i<maxcomps; i++) dat[i]= stof(&rec_str[n+i*12], 1, 12);
n                  20 src/readfrd.h    ITG   n;         /* number of nodes */
n                  36 src/readinput.c   ITG i,j,k,n,in=0,nlinemax=100000,irestartread,irestartstep,
n                 197 src/readinput.c 	  FORTRAN(splitline,(buff,textpart,&n));
n                 198 src/readinput.c 	  for(i=0;i<n;i++){
n                 361 src/readinput.c 	  FORTRAN(splitline,(buff,textpart,&n));
n                 362 src/readinput.c 	  for(i=0;i<n;i++){
n                  17 src/stof.c       register ITG    n, i;
n                  20 src/stof.c       n=-1;
n                  23 src/stof.c         n++;
n                  24 src/stof.c         if ((i>=MAX_LINE_LENGTH)||(n>=MAX_LINE_LENGTH)) break;
n                  25 src/stof.c         puffer[n] = string[i];
n                  27 src/stof.c       puffer[n+1] = '\0';
n                  17 src/stoi.c       register ITG      n, i;
n                  20 src/stoi.c       n=-1;
n                  23 src/stoi.c         n++;
n                  24 src/stoi.c         if ((i>=MAX_LINE_LENGTH)||(n>=MAX_LINE_LENGTH)) break;
n                  25 src/stoi.c         puffer[n] = string[i];
n                  27 src/stoi.c       puffer[n+1] = '\0';
n                  18 src/stos.c       register ITG n, i;
n                  20 src/stos.c       n=-1;
n                  23 src/stos.c         n++;
n                  24 src/stos.c         if ((i>=MAX_LINE_LENGTH)||(n>=MAX_LINE_LENGTH)) break;
n                  25 src/stos.c         puffer[n] = string[i];
n                  27 src/stos.c       puffer[n+1] = '\0';
n                  33 src/stos.c       register ITG n, i;
n                  35 src/stos.c       n=-1;
n                  38 src/stos.c         n++;
n                  39 src/stos.c         if ((i>132)||(n>132)) break;
n                  40 src/stos.c         puffer[i] = string[n];
n                  95 src/tau.c        aa->n = *neq;