⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 pr25990.c

📁 用于进行gcc测试
💻 C
📖 第 1 页 / 共 2 页
字号:
	  X[ ( ((m)-1) + ( ((n)-1)*m_max ))] = FF ;	  Y[ ( ((m)-1) + ( ((n)-1)*m_max ))] = FF ;	  Z[ ( ((m)-1) + ( ((n)-1)*m_max ))] = FF ;      }  }  int KK = atoi(argv[8]);  int LL = 3 * KK;  float * restrict MM;  MM = malloc(4 * LL * sizeof(float));  for ( n = 1 ; n <= n_max ; n++) {      for ( m = 1 ; m <= m_max ; m++) {	  for ( s = 1 ; s <= num_s ; s++) {	      Ps[ ( ((m)-1) + (((n)-1)*(m_max)) + (((s)-1)*(Ps_slice_stride)) ) ] = 0.0 + 0.0 * (__extension__ 1.0iF);	  }      }  }  int liter ;#pragma omp parallel for private(m,liter,s)  for ( n = 1 ; n <= n_max ; n++) {      for ( m = 1 ; m <= m_max ; m++) {	  for ( liter = 1 ; liter <= KK ; liter++ ) {	      for ( s = 1 ; s <= num_s ; s++) {		  int LM_column;		  float NN[4];		  float OO[4];		  float PP[4];		  float QQ[4];		  float k;		  int s_index;		  float RR;		  s_index = s + (DD -1);		  RR = f[ ( (s_index)-1) ];		  k = 99.0;		  NN[1 -1] = X[ ( ((m)-1) + ( ((n)-1)*m_max ))];		  NN[2 -1] = Y[ ( ((m)-1) + ( ((n)-1)*m_max ))];		  NN[3 -1] = Z[ ( ((m)-1) + ( ((n)-1)*m_max ))];		  NN[4 -1] = 1.0;		  LM_column = ((liter -1) * 3) + 1;		  OO[1 -1] = MM[ ( ((1)-1) + ( ((LM_column)-1)*4 ))];		  OO[2 -1] = MM[ ( ((2)-1) + ( ((LM_column)-1)*4 ))];		  OO[3 -1] = MM[ ( ((3)-1) + ( ((LM_column)-1)*4 ))];		  OO[4 -1] = MM[ ( ((4)-1) + ( ((LM_column)-1)*4 ))];		  LM_column = ((liter -1) * 3) + 2;		  PP[1 -1] = MM[ ( ((1)-1) + ( ((LM_column)-1)*4 ))];		  PP[2 -1] = MM[ ( ((2)-1) + ( ((LM_column)-1)*4 ))];		  PP[3 -1] = MM[ ( ((3)-1) + ( ((LM_column)-1)*4 ))];		  PP[4 -1] = MM[ ( ((4)-1) + ( ((LM_column)-1)*4 ))];		  LM_column = ((liter -1) * 3) + 3;		  QQ[1 -1] = MM[ ( ((1)-1) + ( ((LM_column)-1)*4 ))];		  QQ[2 -1] = MM[ ( ((2)-1) + ( ((LM_column)-1)*4 ))];		  QQ[3 -1] = MM[ ( ((3)-1) + ( ((LM_column)-1)*4 ))];		  QQ[4 -1] = MM[ ( ((4)-1) + ( ((LM_column)-1)*4 ))];	      }	  }      }  }#pragma omp parallel for private(m)  for ( n = 1 ; n <= n_max ; n++) {      for ( m = 1 ; m <= m_max ; m++) {	  int s;	  float SSS;	  float f1,f2,p1,p2,TT,h,FFF;	  SSS = 0.0;	  for ( s = 2 ; s <= num_s ; s++) {	      f1 = f[ ( ((s-1) + (DD - 1))-1) ];	      f2 = f[ ( ((s) + (DD - 1))-1) ];	      p1 = cabsf(Ps[ ( ((m)-1) + (((n)-1)*(m_max)) + ((((s-1))-1)*(Ps_slice_stride)) ) ]) ;	      p2 = cabsf(Ps[ ( ((m)-1) + (((n)-1)*(m_max)) + (((s)-1)*(Ps_slice_stride)) ) ]) ;	      h = f2 - f1;	      FFF = (f1 + f2) / 2.0;	      TT = (1.0 / sqrtf(2.0)) * (((h * p1) + (0.5 * h * (p2 - p1))) * (1.0 / FFF));	      SSS += TT;	  }	  P[ ( ((m)-1) + ( ((n)-1)*m_max ))] = SSS + ((__extension__ 1.0iF) * 0.0);      }  }  fp = fopen(argv[10],"wb");  fwrite(X,sizeof(float),m_max * n_max,fp);  fclose(fp);  fp = fopen(argv[11],"wb");  fwrite(Y,sizeof(float),m_max * n_max,fp);  fclose(fp);  fp = fopen(argv[12],"wb");  fwrite(Z,sizeof(float),m_max * n_max,fp);  fclose(fp);  fp = fopen(argv[13],"wb");  fwrite(P,sizeof(float _Complex),m_max * n_max,fp);  fclose(fp);  return(0);}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -